CF King of Thieves
2015-05-17 20:00
288 查看
分析:题意是选一个点,然后跳4下都是跳到*上,存在就输出yes,否则输出no。因为n<=100比较小,直接暴力就可以了。
# include <stdio.h> int main() { int i,j,n,f; char s[150]; scanf("%d",&n); scanf("%s",s); for(i=0,f=0;i<n;i++) for(j=1;j<n;j++) if(s[i]=='*'&&s[i+j]=='*'&&s[i+2*j]=='*'&&s[i+3*j]=='*'&&s[i+4*j]=='*') f=1; if(f==1) printf("yes\n"); else printf("no\n"); return 0; }
相关文章推荐
- CodeForces 526A-King of Thieves
- cf 3a Shortest path of the king
- ZeptoLab Code Rush 2015 A. King of Thieves 暴力
- ZeptoLab Code Rush 2015 A. King of Thieves
- A. King of Thieves
- CODEFORCES 526 A. King of Thieves
- 526A - King of Thieves
- CF 3A Shortest path of the king
- Codeforces 526A King of Thieves 枚举
- A. King of Thieves
- cf A. Shortest path of the king 简单存路径bfs
- ZeptoLab Code Rush 2015 A. King of Thieves
- CF_3A_ShortestPathOfTheKing
- Codeforces ZeptoLab Code Rush 2015 A. King of Thieves
- CF-3A Shortest path of the king(water)
- kingofark的第2个“五评计划”——五评C++(2)
- kingofark's Ineffective C/C++:自白2:有符号、无符号还有位运算,我的天!
- cast of Objective-C pointer type 'NSString *' to C pointer type 'CFStringRef' (aka 'const struct __C
- Shortest path of the king
- CF-Codeforces Round #392 (Div. 2)-A-Holiday Of Equality