1124 Raffle for Weibo Followers （20 分）

1124 Raffle for Weibo Followers （20 分）

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...

题意：从转发微博的人中抽奖，每n个人抽一次，如果当前人已经中过奖考虑下一个。

坑点：如果序号A已经中过奖，考虑A+1，如果A+1也中过奖，要考虑A+2。。。另外如果A+2没中奖，则A+2中奖，下一次需要从A+2+n再开始遍历。。。（感觉题意不太明确）

 /**
 * Copyright(c)
 * All rights reserved.
 * Author : Mered1th
 * Date : 2019-02-28-13.02.01
 * Description : A1124
 */
 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<string>
 #include<unordered_set>
 #include<map>
 #include<vector>
 #include<set>
 #include<unordered_map>
 using namespace std;
 ;
 string str[maxn];
 unordered_map<string,int> mp;
 int main(){
 #ifdef ONLINE_JUDGE
 #else
     freopen("1.txt", "r", stdin);
 #endif
     int m,n,s;
     bool flag=false;
     scanf("%d%d%d",&m,&n,&s);
     ;i<=m;i++){
         cin>>str[i];
     }
     for(int i=s;i<=m;i=i+n){
         ){
             cout<<str[i]<<endl;
             mp[str[i]]=;
             flag=true;
         }
         else{
             ;j<=m;j++){
                 ){
                     cout<<str[j]<<endl;
                     flag=true;
                     mp[str[j]]=;
                     i=j;
                     break;
                 }
             }
         }
     }
     if(flag==false){
         cout<<"Keep going...";
     }

     ;
 }