Raffle for Weibo Followers

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

题目很简单，使用map对应键值string 和 int，string储存输入字符串，int储存此字符串是否出现过。

#include <iostream>
#include <map>
#include <cstdio>
#include <string>

using namespace std;

string input_str[1005];

int main()
{
    int M,N,S;
    map<string,int> is_vis;
    while(cin >> M >> N >> S ){
        for(int i =0; i< M;i++){
            cin >> input_str[i];
            is_vis[input_str[i]] = 0;
        }
        int flag = 0;
        for(int j = S-1; j<M;){
            if(is_vis[input_str[j]] == 0){
                flag = 1;
                is_vis[input_str[j]] = 1;
                cout << input_str[j] << endl;
                j += N;//跳到下一个中奖者；
            }
            else
                j += 1;//如果中奖过，顺次推进；
        }
        if(flag == 0)
            cout << "Keep going...\n";
    }
    return 0;
}