1124 Raffle for Weibo Followers（20 分）（C++）

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,第一个得奖的索引s。有得奖的人为s, n+s, 2*n+s。

#include <iostream>
#include <set>
using namespace std;
int main(){
    int n, m, s, cnt = 1, ans = 0;
    cin>>n>>m>>s;
    set<string>win;
    for(int i = 0; i < n; i++){
        string name;
        cin>>name;
        if(cnt >= s && (cnt - s)% m == 0){
            if(win.find(name) == win.end()){
                printf("%s\n",name.c_str());
                win.insert(name);
                ans ++;
            }
            else
            	continue;
        }
        cnt++;
    }
    if(ans == 0)
        printf("Keep going...\n");
}