poj2244 – Eeny Meeny Moo

                              
想看更多的解題報告: http://blog.csdn.net/wangjian8006/article/details/7870410
                                 
轉載請註明出處：http://blog.csdn.net/wangjian8006

題目大意：有n個城市圍成圈，先將第一個城市斷電，然後每隔m個城市使一個城市斷電，這樣使2號城市最後斷電的最小的m是什麼
然後給你n，輸出m
解題思路：約瑟夫環問題,直接類比，用約瑟夫公式可以算出

/*Memory 164KTime   32MS*/#include <iostream>using namespace std;#define _MAX_ 150int ans[_MAX_];void init(){int i,j,m;for(i = 3;i < _MAX_;i++){m = 1;while(1){int tmp = 1;for(j = 2;j < i;j++){tmp = (tmp + m)%j;if(tmp == 0){tmp = j;}}if(tmp == 1){ans[i] = m;break;}m++;}}}int main(){int n;init();while(scanf("%d",&n)){if(!n) break;printf("%d\n",ans[n]);}return 0;}