Recently you must have experienced that when too many people use the BBS simultaneously, the net becomes very, very slow.
To put an end to this problem, the Sysop has developed a contingency scheme for times of peak load to cut off net access for some buildings of the university in a systematic, totally fair manner. Our university buildings were enumerated randomly from 1 to n. XWB is number 1, CaoGuangBiao (CGB) Building is number 2, and so on in a purely random order.
Then a number m would be picked at random, and BBS access would first be cut off in building 1 (clearly the fairest starting point) and then in every mth building after that, wrapping around to 1 after n, and ignoring buildings already cut off. For example, if n=17 and m=5, net access would be cut off to the buildings in the order [1,6,11,16,5,12,2,9,17,10,4,15,14,3,8,13,7]. The problem is that it is clearly fairest to cut off CGB Building last (after all, this is where the best programmers come from), so for a given n, the random number m needs to be carefully chosen so that building 2 is the last building selected.
Your job is to write a program that will read in a number of buildings n and then determine the smallest integer m that will ensure that our CGB Building can surf the net while the rest of the university is cut off.
Input Specification
The input file will contain one or more lines, each line containing one integer n with 3 <= n < 150, representing the number of buildings in the university.Input is terminated by a value of zero (0) for n .
Output Specification
For each line of the input, print one line containing the integer m fulfilling the requirement specified above.Sample Input
3 4 5 6 7 8 9 10 11 12 0
Sample Output
2 5 2 4 3 11 2 3 8 16
#include<iostream>
#include<cstdio>
using namespace std;
int n;
int solve(int m)
{
//由于开始XWBy一号大楼开始直接出队,所以从2~n进行编号0~n-2
int f=0;
for(int i=2;i<n;i++)
f=(f+m)%i;
if(f==0) return 1;
//编号为0,对应2号大楼
return 0;
}
int main()
{
while(cin>>n&&n)
{
int m=1; //每隔m个大楼,就是报m
while(!solve(m))
m++;
cout<<m<<endl;
}
return 0;
}
#include<cstdio>
#include<iostream>
using namespace std;
const int maxn = 10000 + 2;
int f[maxn];
int main() {
int n, k, m;
while(scanf("%d%d%d", &n, &k, &m) == 3 && n) {
f[1] = 0;
for(int i = 2; i <= n; i++)
{
f[i] = (f[i-1] + k) % i;
// cout<<"f[ "<<i<<" ] "<<"--------"<<f[i]<<endl;
}
int ans = (m - k + 1 + f[n]) % n;
if (ans <= 0) ans += n;
printf("%d\n", ans);
}
return 0;
}
/**
8 5 3
100 9999 98
10000 10000 10000
0 0 0
1
93
2019
*/
LA4727
#include <iostream>
#include<cstdio>
using namespace std;
const int maxn = 600000;
int f[maxn];
int main()
{
int n,k;
int T;scanf("%d",&T);
while(T--)
{
int a1,a2,a3;
scanf("%d%d",&n,&k);
f[1]=0; //只剩一个人的话,出去的人编号为0
for(int i=2;i<=n;i++) f[i]=(f[i-1]+k)%i; //推出n个人时,最后出去的人编号。
a1=f[n]+1;
f[2]=(k-1)%2;//只剩两个人,那么倒数第二个人出去的编号就是 (k-1)%2
for(int i=3;i<=n;i++) f[i]=(f[i-1]+k)%i;// 推出n个人时,倒数第二个人出去的编号。
a2=f[n]+1;
f[3]=(k-1)%3;
for(int i=4;i<=n;i++) f[i]=(f[i-1]+k)%i;
a3=f[n]+1;
cout<<a3<<' '<<a2<<' '<<a1<<endl;
}
return 0;
}