URAL 1098 Questions 约瑟夫环
2014-01-09 00:54
381 查看
--------
--------
int n; int f[maxn]; char s[maxn]; int main(){ int n=0; while (gets(s+n)){ n=strlen(s); } s =0; f[0]=0; for (int i=1;i<=n;i++) f[i]=(f[i-1]+1999)%i; if (s[f ]=='?') printf("Yes\n"); else if (s[f ]==' ') printf("No\n"); else printf("No comments\n"); return 0; }
--------
相关文章推荐
- URAL - 1098 Questions——约瑟夫环
- URAL 1098 Questions 约瑟夫环
- poj 2359 || ural 1098 Questions
- 1098. Questions
- Poj 2359 Questions (约瑟夫环)
- ural 1026. Questions and Answers 查询
- SBT解决约瑟夫环问题(URAL1521)
- URAL 1026. Questions and answers
- POJ 2359 Questions(约瑟夫环)
- URAL 1026 — Questions and Answers
- URAL 1026 - Questions and Answers(计数排序)
- ural 1521. War Games 2 约瑟夫环 SBT实现
- POJ 2359 Questions(约瑟夫环——数学解法)
- URAL 1521 War Games 2 树状数组解决约瑟夫环,输出离队顺序
- ural 1026 Questions and Answers
- URAL 1026 Questions and Answers
- 约瑟夫问题 URAL 1098
- (1)前言——(17)问题(Questions)
- ural 2015 Zhenya moves from the dormitory(模拟)
- URAL 1932 The Secret of Identifier (dp+容斥,4级)