PAT-1124. Raffle for Weibo Followers (20)
1124. Raffle for Weibo Followers (20)
時間限制 400 ms 內存限制 65536 kB 代碼長度限制 16000 B 判題程序 Standard 作者 CHEN, YueJohn 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 <bits/stdc++.h>using namespace std;int N, M, K; vector<string> userVec; vector<string> ansVec;int main() {cin>>N>>M>>K;string user;int m = 0;int k = 1;for(int i = 1; i <= N; i++) {cin>> user;//if(i >= K+m*M) {int flag = 1;for(int j = 0; j < ansVec.size(); j++) {if(user == ansVec[j]) {flag = 0;break;}}if(flag) {if(k >= K+m*M) {ansVec.push_back(user);m++;}k++;}//} }if(ansVec.empty()) {cout<< "Keep going..."<< endl;return 0;}for(int i = 0; i < ansVec.size(); i++) {cout<< ansVec[i]<< endl;}return 0; }?
轉載于:https://www.cnblogs.com/ACMessi/p/8527684.html
總結
以上是生活随笔為你收集整理的PAT-1124. Raffle for Weibo Followers (20)的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: 寿司店怎么经营 非常简单愿意学就行
- 下一篇: Exp1 PC平台逆向破解(5)M