您的位置:首页 > 其它

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;

}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: