Sample Input
3 5 15 20
63923 99999
Sample Output
3 5 15 20 63923 99999 Good Choice Bad Choice Good Choice 题目 规定了一种求随机数的算法。按照他的算法。判断是不是随机出来的数可以覆盖每一个值#include<cstdio>
#include<cstring>
#include<stack>
#include<iostream>
using namespace std;
int fun(int s,int m,int pre){
int sum = (pre + s) % m;
return sum;
};
int main()
{ int m,n;
m = n = 0;
while(cin >> m >> n){
int flag = 1;
int temp[100000] = {0};
int s0 = (0 + m) % n;
for(int i = 0; i < n; i++){
int sum = fun(m, n, s0);
s0 = sum;
temp[sum] = 1;
// cout << sum << endl;
}
for(int i = 0; i <= n-1; i++){
if(temp[i] == 0){
flag = 0;
break;
}
}
if(flag)
printf("dd Good Choice\n\n",m,n);
else
printf("dd Bad Choice\n\n",m,n);
}
return 0;
}
1 对嵌套有了思考。有时间再看看别人的做法
