Codeforces Round #773 (Div. 2) 1642B - Power Walking Solution

 Problem Link:  https://codeforces.com/problemset/problem/1642/B

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i,r;

    cin>>t;

    while(t--)

    {

       cin>>n;

       long long a[n+9],mx;

       set<int>st;

       for(i=0;i<n;i++)

       {

           cin>>a[i];

           st.insert(a[i]);

       }

       mx=st.size();

       for(i=1;i<=n;i++)

        cout<<max(mx,i)<<" ";

        cout<<endl;

    }

}