样例输入:
5 3 20
donglali
nanlali
xilali
beilali
chuanpu
样例输出:
chuanpu
分析:
相比与约瑟夫,多了一下条件:
规定从第几个人开始数(不是从第一个),从那个数字开始
1,从那个小朋友开始数,他就率进队。
注意如何先让指定的人入队
2,用队列直接存储小朋友的名字比较好处理
3,so,规定,队列用来存储每个人,而报的数字在while中++.
初版混乱的代码
#include <bits/stdc++.h>
#include <queue>
using namespace std;
char a[1005][21];
bool judge(int now){
int flag = 0,rep = now;
while(now){
int t = now % 10;
if(t == 7){
flag = 1;
break;
}
now = now /10;
}
if(flag == 1 || rep % 7 == 0){
return true;
}else return false;
}
int main(){
int n,m,t;
cin >> n >> m >> t;
queue<int>q;
for(int i = t + n - m + 1; i <= t + n - 1; i++){
//a[t]要对应第m个人的名
cin >> a[i];
}
for(int i = t; i <= t + n - m; i++){
cin >> a[i];
}
for(int i = m; i <= n; i++){
q.push(t);
t++;
}
for(int i = 1; i <= m-1; i++){
q.push(t);
t++;
}
int now = t - 1 - n;
while(q.size() > 1){
int x = q.front();
q.pop();
now++;
if(judge(now)){
}else {
q.push(x);
}
}
cout << a[q.front()] << endl;
return 0;
}
更新后代码
#include <bits/stdc++.h>
#include <queue>
using namespace std;
char a[1005][21];
bool judge(int now){
int flag = 0,rep = now;
while(now){
int t = now % 10;
if(t == 7){
flag = 1;
break;
}
now = now /10;
}
if(flag == 1 || rep % 7 == 0){
return true;
}else return false;
}
int main(){
int n,m,t;
cin >> n >> m >> t;
queue<string>q;
for(int i = 1;i <= n; i++){
string s;
cin >> s;
q.push(s);
}
for(int i = 1; i <= m - 1; i++){
q.push(q.front());//把前(m-1)人复制一边添加到队尾
q.pop(); //再把队首的(m-1)干掉
}
int now = t;
while(q.size() > 1){
string x = q.front();
q.pop();
if(judge(now)){
}else {
q.push(x);
}
now++;
}
cout << q.front() << endl;
return 0;
}