551A - GukiZ and Contest - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
#define pb push_back
#define pob pop_back
bool isprime(ll n)
{
    if (n <= 1)
        return false;
    for (ll i = 2; i <= sqrt(n); i++)
        if (n % i == 0)
            return false;
 
    return true;
}
void solve()
{ 
 ll n;
 cin>>n;
 vector<ll> v(n);
 for(int i=0;i<n;i++)
 {cin>>v[i];}
	for(int i=0;i<n;i++)
	{
		ll a = 1;
		for(int j=0;j<n;j++)
			if(v[j] > v[i]) a++;
		cout << a << " ";
	}
	cout <<endl;
	}
int main()
{ 
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    ll t = 1;
  // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}