Tuesday, March 15, 2016

UVa 484 - The Department of Redundancy

#include <bits/stdc++.h>
#define LL  long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<n;i++)
#define REV(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define pri(a) cout<<a<<endl
#define prii(a,b) cout<<a<<" "<<b<<endl
#define priii(a,b,c) cout<<a<<" "<<b<<" "<<c<<endl
#define hi printf("Hello World\n");
#define pcs printf("CASE# %d:\n", ++cs);
#define WRITE(fn) freopen(fn, "w", stdout);
using namespace std;

/****/ int cs = 0;
const int INF = 1<<29;
const int MX  = 1e5+10;

int main()
{
    int a[MX];
    map<int,int> mp;
    int n, idx = 0;
   
    while(cin>>n)
    {
        if(mp[n]==0)
            a[idx++]=n;
        mp[n]++;
    }

    REP(i,idx)
    {
        prii(a[i],mp[ a[i] ]);
    }

    return 0;
}

No comments:

Post a Comment