Joseph

 

Problem Description The Joseph\\\\\\\'s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and only the life of the last remaining person will be saved. Joseph was smart enough to choose the position of the last remaining person, thus saving his life to give us the message about the incident. For example when n = 6 and m = 5 then the people will be executed in the order 5, 4, 6, 2, 3 and 1 will be saved. Suppose that there are k good guys and k bad guys. In the circle the first k are good guys and the last k bad guys. You have to determine such minimal m that all the bad guys will be executed before the first good guy.

Input The input file consists of separate lines containing k. The last line in the input file contains 0. You can suppose that 0 < k < 14.

Output             The output file will consist of separate lines containing m corresponding to k in the input file.

Sample Input 3 4 0

Sample Output 5 30

Source ACM暑期集训队练习赛（5）

Recommend lcy

约瑟夫环变形，经典问题是从前往后推，f[i]=(f[i-1]+m)%i;  (i>1)这个问题是从后往前推。设f[n]是2*k个人一圈第n个被踢出的人的相对编号，注意是相对编号，比如说本来有6个人编号0-5，编号4的被踢了，那么编号5的相对编号变成4，也就是踢掉之后的编号往前移动一个。f[n]=(f[n-1]+m-1)%(2*K-(n-1))。

k比较小，直接暴力打表! 

代码：

#include <bits/stdc++.h>
using namespace std;
int main() 
{
   int p[17], ans[17] = {0}; 
   int m, k; 
   for(k = 1; k <= 14; k++) 
   { 
    int n = 2*k;//总人数
    m = 1; 
   for(int i = 1; i <= k; i++)
   { 
   ans[i] = (ans[i-1]+m-1)%(n-i+1);//因为编号是从1开始
   if(ans[i] < k)//杀掉了好人，不符合
   { 
   i = 0; 
   m++; //枚举
   } 
} 
p[k] = m;
} 
int kk; while(scanf("%d",&kk) && kk) { 
printf("%d\n",p[kk]); 
} 
return 0; 
}