1124 Raffle for Weibo Followers (20分)

最新推荐文章于 2020-08-29 18:31:29 发布

原创最新推荐文章于 2020-08-29 18:31:29 发布 · 152 阅读

0 ·

CC 4.0 BY-SA版权

PAT 甲级专栏收录该内容

132 篇文章

订阅专栏

本文介绍了一个抽奖算法的实现，该算法用于从微博转发者中选择获奖者。输入包括转发总数、跳过数和首个获奖者的索引，输出为获奖者的名单。文章提供了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...

#include <iostream>
#include <map>
#include <vector>
#include <string>

using namespace std;

int main()
{
    // freopen("in.txt", "r", stdin);
    int m, n, s;
    cin >> m >> n >> s;
    string str;
    map<string, bool> p;
    bool flag = false;
    for (int i = 1; i <= m; i++)
    {
        cin >> str;
        if (p[str])
        {
            s += 1;
        }
        if (i == s && p[str] != true)
        {
            p[str] = true;
            cout << str<<endl;
            s += n;
            flag = true;
        }
    }
    if (!flag)
    {
        cout << "Keep going...";
    }
    return 0;
}