UVA 484 - The Department of Redundancy Department

水题,一个数组存数,一个数组存次数
代码如下:

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int Long=0,flag,n,x[10005],y[10005];
    while(cin>>n)
    {
        flag=1;
        for(int i=0; i<Long; ++i)
            if(n==x[i])
            {
                y[i]++;
                flag=0;
                break;
            }
        if(flag)
        {
            x[Long]=n;
            y[Long++]=1;
        }
    }
    for(int i=0; i<Long; ++i)
        cout<<x[i]<<" "<<y[i]<<endl;
    return 0;
}

猜你喜欢

转载自blog.csdn.net/liuxinyu666/article/details/80209186