POJ 1012 Joseph
2012-04-20 23:11
375 查看
水题痛彻我心扉,就这样。
View Code
View Code
#include<iostream> using namespace std; int main() { int a[14]; int i,j,k,num = 2; while(num <= 13) { if(num == 0) break; for(i = 1;;i++) { j = 0; k = num * 2; while(1) { j = (j + i) % k; if(j == 0 || j > num) { k--; if(k == num) { a[num] = i; goto end; } if(j == 0) j = k; else j--; } else break; } } end: num++; continue; }//while int t; while(cin>>t) { if(t == 0) break; if(t == 1) { cout<<2<<endl; continue; } else cout<<a[t]<<endl; } return 0; }
相关文章推荐
- 【Joseph问题】poj1012 Joseph
- POJ 1012 Joseph 笔记 G++
- poj 1012 & hdu 1443 Joseph(约瑟夫环变形)
- POJ 1012 Joseph
- poj 1012 Joseph
- POJ 1012 Joseph
- poj 1012 Joseph
- NYOJ 191 && POJ 1012 Joseph(约瑟夫环问题)
- POJ 1012--Joseph
- poj1012Joseph(约瑟夫环)
- POJ 1012: Joseph
- ACM篇:POJ1012--Joseph
- POJ 1012 Joseph 解题报告
- poj-1012 Joseph
- POJ 1012 Joseph(约瑟夫环)(枚举)
- POJ-1012 Joseph-约瑟夫问题好人坏人
- POJ 1012 Joseph(打表题)
- POJ 1012 Joseph
- [poj1012]Joseph_Joseph
- POJ 1012 Joseph