484:The Department of Redundancy Department

Problem Link

#Solution

#include <bits/stdc++.h>
using namespace std;
map<int,int> f;

vector<int>a;
int main() {

int n;
while(scanf(“%d”,&n)!=EOF)
{
if(!f[n])

{f[n]=1;
a.push_back(n);
}
else f[n]++;

}
for(int i=0;i<a.size();i++)
{
cout<<a[i]<<” “<<f[a[i]]<<endl;
}
return 0;
}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s