CF 538A(Cutting Banner-暴力找切割点)
来源:互联网 发布:在线直播平台源码 编辑:程序博客网 时间:2024/06/05 12:00
暴力找切割点
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#include<cctype>#include<ctime>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--)#define RepD(i,n) for(int i=n;i>=0;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define Lson (x<<1)#define Rson ((x<<1)+1)#define MEM(a) memset(a,0,sizeof(a));#define MEMI(a) memset(a,127,sizeof(a));#define MEMi(a) memset(a,128,sizeof(a));#define INF (2139062143)#define F (100000007)#define MAXN (1000000+10)long long mul(long long a,long long b){return (a*b)%F;}long long add(long long a,long long b){return (a+b)%F;}long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}typedef long long ll;char s[MAXN],s2[MAXN]="CODEFORCES";int main(){//freopen(".in","r",stdin);//freopen(".out","w",stdout);while(scanf("%s",s)==1){int n=strlen(s);int m=strlen(s2); if (n<m){cout<<"NO"<<endl;continue;}int t=n-m;Rep(i,n-t+1){int flag=0;Rep(j,i) if (s[j]!=s2[j]) flag=1;if (flag) continue;Fork(j,i+t,n-1) if (s[j]!=s2[j-t]) flag=1;if (flag==0){cout<<"YES"<<endl;return 0;}}cout<<"NO"<<endl;}return 0;}
0 0
- CF 538A(Cutting Banner-暴力找切割点)
- 538A - Cutting Banner
- codeforces 538 A.Cutting Banner
- codeforces 538 A Cutting Banner
- codeforces A. Cutting Banner
- A. Cutting Banner
- codeforces #300 A. Cutting Banner
- Code Forces 538 A. Cutting Banner(水~)
- #300 (div.1 2) A. Cutting Banner
- 第一次打CODEFORCES-----A. Cutting Banner
- cf 55A(暴力 )
- contest: Codeforces Round #300, problem: (A) Cutting Banner
- contest: Codeforces Round #300, problem: (A) Cutting Banner
- cf-348A 二分暴力
- CF 568A 数学 暴力
- cf 102 A(暴力)
- CF - 201A 找规律
- A538: Cutting Banner
- Linux 集锦
- iOS xml解析
- J2EE开发之常用开源框架介绍
- 构造函数
- 《暗时间》读书笔记
- CF 538A(Cutting Banner-暴力找切割点)
- maven常用命令
- 从erlang时间函数说到时间校正机制
- vxworks延时
- java读写文件
- 【leetcode】excel
- Zxing android 解析流程
- Sudoku Solver
- 获取某一文件夹下所有文件的路径