John got a full mark on PAT. He was so happy that he decided to hold a raffle(抽奖) for his followers on Weibo -- that is, he would select winners from every N followers who forwarded his post, and give away gifts. Now you are supposed to help him generate the list of winners.
Input Specification:
Each input file contains one test case. For each case, the first line gives three positive integers M (<= 1000), N and S, being the total number of forwards, the skip number of winners, and the index of the first winner (the indices start from 1). Then M lines follow, each gives the nickname (a nonempty string of no more than 20 characters, with no white space or return) of a follower who has forwarded John's post.
Note: it is possible that someone would forward more than once, but no one can win more than once. Hence if the current candidate of a winner has won before, we must skip him/her and consider the next one.
Output Specification:
For each case, print the list of winners in the same order as in the input, each nickname occupies a line. If there is no winner yet, print "Keep going..." instead.
Sample Input 1:9 3 2 Imgonnawin! PickMe PickMeMeMeee LookHere Imgonnawin! TryAgainAgain TryAgainAgain Imgonnawin! TryAgainAgainSample Output 1:
PickMe Imgonnawin! TryAgainAgainSample Input 2:
2 3 5 Imgonnawin! PickMeSample Output 2:
Keep going...
题目大意:
代码:
#include<stdio.h>
#include<iostream>
#include<string>
#include<map>
#include<vector>
using namespace std;
map<string,int> Map;
vector<string> v;
int main()
{
int i,j,n,m,k,t;
scanf("%d %d %d",&n,&m,&k);
for(i=1;i<=n;i++)
{
string s;
cin>>s;
if(i==k)
{
Map[s]=1;
v.push_back(s);
t=0;
}
else if(i>k)
{
if(Map.find(s)==Map.end())
{
t++;
if(t%m==0)
{
Map[s]=1;
v.push_back(s);
}
}
}
}
if(v.size()==0)
{
printf("Keep going...\n");
return 0;
}
for(i=0;i<v.size();i++)
{
cout<<v[i]<<endl;
}
return 0;
}