URAL 1496. Spammer

最新推荐文章于 2018-06-21 20:29:50 发布

sxk_sxy

最新推荐文章于 2018-06-21 20:29:50 发布

阅读量921

点赞数 1

分类专栏： URAL STL

本文链接：https://blog.csdn.net/u013446688/article/details/44193879

版权

URAL 同时被 2 个专栏收录

67 篇文章 0 订阅

订阅专栏

STL

11 篇文章 0 订阅

订阅专栏

1496. Spammer

Time limit: 1.0 second
Memory limit: 64 MB

There is a famous spammer among our friends. In the end of every contest he is submitting his incorrect solutions at the speed of a machine-gun. In addition, he cheats by means of using several accounts for debugging. The judges eventually decided to disqualify the spammer. For that, they first want to discover all of his debugging accounts. The judges know which teams submitted their solutions in the last ten minutes of a contest. They regard as the spammer's debugging accounts all accounts which submitted solutions at least twice during the last ten minutes of the contest. Your task is to find these accounts.

Input

The first line contains the number N of submissions in the last 10 minutes (0 ≤ N ≤ 100). The next N lines contain the names of teams which submitted their solutions in this period. The names contain only digits and lowercase English letters. Each name is not longer than 30 symbols.

Output

Output in an arbitrary order all accounts which, in the judges' opinion, are used by the spammer.

Sample

input	output
11 naucoder iceman abikbaev abikbaev petr abikbaev abikbaev x abikbaev acrush x	x abikbaev

题意：输出出现过不少于两次的字符串。

解析：map直接搞。

AC代码：

#include <cstdio>
#include <map>
#include <string>
#include <iostream>
using namespace std;

map<string, int> a;

int main(){
    #ifdef sxk
        freopen("in.txt", "r", stdin);
    #endif //sxk

    int n;
    string s;
    while(scanf("%d", &n)==1){
        while(n--){
            cin>>s;
            a[s] ++;
        }
        map<string, int>::iterator it;
        for(it = a.begin(); it !=a.end(); it ++){
            if(it->second >= 2) cout<<it->first<<endl;
        }
    }
    return 0;
}