Codeforces Round #307 (Div. 2) A

简介:

http://codeforces.com/contest/551/problem/A

#include <iostream>

using namespace std;
int data[2005];
int main()
{
    int m;
    while(cin>>m)
    {

        for(int i=0; i<m; i++)
            cin>>data[i];
        for(int i=0; i<m; i++)
        {
            int ans=1;
            for(int j=0; j<m; j++)
              if(data[i]<data[j])
                ans++;
            cout<<ans<<" ";
        }
        cout<<endl;
    }
    return 0;
}
目录
相关文章
|
1月前
|
人工智能 测试技术 C++
Codeforces Round 962 (Div. 3)
Codeforces Round 962 (Div. 3)
|
1月前
|
人工智能 测试技术 BI
Codeforces Round 942 (Div. 2)
Codeforces Round 942 (Div. 2)
|
机器学习/深度学习 人工智能 移动开发
.Codeforces Round 883 (Div. 3)
Codeforces Round 883 (Div. 3)
Codeforces Round #186 (Div. 2)A、B、C、D、E
Ilya得到了一个礼物,可以在删掉银行账户最后和倒数第二位的数字(账户有可能是负的),也可以不做任何处理。
34 0
Codeforces Round #192 (Div. 2) (329A)C.Purification
Codeforces Round #192 (Div. 2) (329A)C.Purification
45 0
Codeforces Round 835 (Div. 4)
Codeforces Round 835 (Div. 4) A~F题解
110 0
Codeforces Round 849 (Div. 4)
Codeforces Round 849 (Div. 4)A~G2题解
116 0
Codeforces Round #644 (Div. 3)(A~G)
Codeforces Round #644 (Div. 3)(A~G)
122 0
Equidistant Vertices-树型dp-Codeforces Round #734 (Div. 3)
Description A tree is an undirected connected graph without cycles. You are given a tree of n vertices. Find the number of ways to choose exactly k vertices in this tree (i. e. a k-element subset of vertices) so that all pairwise distances between the selected vertices are equal (in other words,
139 0