Source Code
| Problem: 1012 | User: cug_fish2008 | |
| Memory: 288K | Time: 235MS | |
| Language: C++ | Result: Accepted |
- Source Code
#include<iostream> using namespace std; int main() { int k=0; int a[14] = {0}; while( (cin>>k)&&(k!=0) ) { if(a[k]) { cout<<a[k]<<endl; continue; } for(int m=k+1;;m++) { int n=2*k,i=0,flag=0; while(1) { i=(i+m-1)%n; if(i>=0&&i<k) break; else flag++; n--;} if(flag==k) { a[flag] = m; cout<<m<<endl; break; } } } return 0; }
327

被折叠的 条评论
为什么被折叠?



