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!
TryAgainAgain
Sample Output 1:
PickMe
Imgonnawin!
TryAgainAgain
Sample Input 2:
2 3 5
Imgonnawin!
PickMe
Sample Output 2:
Keep going…
#include<iostream>
#include<map>
using namespace std;
int main(){
int m,n,s;
string str;
cin>>m>>n>>s;
//getchar();加不加好像无所谓
map<string,int>mp;
bool flag=false;//flag的作用:如果flag没变成true,就说明没人中奖
for(int i=1;i<=m;i++){//i不能是0-m-1,以为题目说了s是1-m,i必须与s对应,s就是动态的i!!
cin>>str;
if(mp[str]==1) s+=1;
if(mp[str]==0&&i==s){//这题不能直接把for的递增设为i+=s,因为题目要求输入m个字符串的。所以s其实相当于是i的替身
cout<<str<<endl;
flag=true;
mp[str]=1;
s+=n;
}
}
if(flag==false) cout<<"Keep going...";
return 0;
}