526A - King of Thieves
2015-04-05 09:43
211 查看
#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<queue> #include<vector> #include<stack> using namespace std; const int MAX = 1000; char s[MAX]; int main(){ int n; while (scanf("%d%s",&n,s) != EOF){ int ok = 0,len = n; for (int l = 1; l<len; l++){ for (int i = 0; i<len; i++){ int j, cnt = 0; for (j = i; j<len; j+=l){ if (s[j] == '*'){ cnt++; } else{ break; } } if (cnt >= 5){ ok = 1; break; } } if (ok) break; } if (ok) printf("yes\n"); else printf("no\n"); } return 0; }
相关文章推荐
- CodeForces 526A-King of Thieves
- ZeptoLab Code Rush 2015 A. King of Thieves
- ZeptoLab Code Rush 2015 A. King of Thieves
- CODEFORCES 526 A. King of Thieves
- A. King of Thieves
- A. King of Thieves
- ZeptoLab Code Rush 2015 A. King of Thieves 暴力
- Codeforces ZeptoLab Code Rush 2015 A. King of Thieves
- CF King of Thieves
- Codeforces 526A King of Thieves 枚举
- kingofark的第0个五评计划 - kingofark自述与简介
- Codeforces Beta Round #3 A. Shortest path of the king 水题
- kingofark关于学习C++和编程的另外35个观点
- hdu 3002 King of Destruction(全局最小割,StoerWagner算法)
- A. Shortest path of the king
- The Love of a King——10、The Wedding
- Codeforces Beta Round #3 A. Shortest path of the king
- HDU 3002 King of Destruction(SW求最小割的值)
- kingofark's Ineffective C/C++:自白1:返回值的运用
- JBoss AS 7之简单安装(The Return Of The King)