Joseph
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 54560 Accepted: 20867
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
题意:k个好人,k个坏人环坐,从1开始报数,报到m则杀死报数的人,后面一人重新从1开始报数,问数m最小为多少,能优先将所有坏人杀死。
解决:最多循环次数为k,枚举所有满足死的人为坏人,若死的人dp
#include<iostream>
#include<algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int n,m;
int k;
int dp[20];
while(cin>>k)
{
if(k==0)
break;
n=2*k;
//dp[0]=0;
m=1;
memset(dp,0,sizeof(dp));
for(int i=1;i<=k;i++)
{
dp[i]=(dp[i-1]+m-1)%(n-i+1);
if(dp[i]<k)///杀掉了好人,枚举下一个m
{
i=0;
m++;
}
}
cout<<m<<endl;
}
return 0;
}