Central Europe Regional Contest 2012 Problem C: Chemist’s vows
2013-09-08 21:12
525 查看
http://acm.hunnu.edu.cn/online/problem_pdf/CERC2012/C.pdf
HUNNU11372
模拟题，直接暴力既可，比赛的时候想过这种方法，但是没敢动手，唉，以后要勇于尝试
HUNNU11372
模拟题，直接暴力既可，比赛的时候想过这种方法，但是没敢动手，唉，以后要勇于尝试
#include <stdio.h>
#include <string.h>
using namespace std;
char str[50005];
int main()
{
int t,len,i;
scanf("%d",&t);
while(t--)
{
scanf("%s",str);
len = strlen(str);
int flag = 1,flag1 = 0,flag2 = 0;
for (i=0; i<len; i++)
{
flag2 = flag1;
flag1 = flag;
flag = 0;
if (flag1)
{
if (str[i]=='b') flag = 1;
if (str[i]=='c') flag = 1;
if (str[i]=='f') flag = 1;
if (str[i]=='h') flag = 1;
if (str[i]=='i') flag = 1;
if (str[i]=='k') flag = 1;
if (str[i]=='n') flag = 1;
if (str[i]=='o') flag = 1;
if (str[i]=='p') flag = 1;
if (str[i]=='s') flag = 1;
if (str[i]=='u') flag = 1;
if (str[i]=='v') flag = 1;
if (str[i]=='w') flag = 1;
if (str[i]=='y') flag = 1;
}
if (flag2)
{
if (str[i-1]=='a' and str[i]=='c') flag = 1;
if (str[i-1]=='a' and str[i]=='g') flag = 1;
if (str[i-1]=='a' and str[i]=='l') flag = 1;
if (str[i-1]=='a' and str[i]=='m') flag = 1;
if (str[i-1]=='a' and str[i]=='r') flag = 1;
if (str[i-1]=='a' and str[i]=='s') flag = 1;
if (str[i-1]=='a' and str[i]=='t') flag = 1;
if (str[i-1]=='a' and str[i]=='u') flag = 1;
if (str[i-1]=='b' and str[i]=='a') flag = 1;
if (str[i-1]=='b' and str[i]=='e') flag = 1;
if (str[i-1]=='b' and str[i]=='h') flag = 1;
if (str[i-1]=='b' and str[i]=='i') flag = 1;
if (str[i-1]=='b' and str[i]=='k') flag = 1;
if (str[i-1]=='b' and str[i]=='r') flag = 1;
if (str[i-1]=='c' and str[i]=='a') flag = 1;
if (str[i-1]=='c' and str[i]=='d') flag = 1;
if (str[i-1]=='c' and str[i]=='e') flag = 1;
if (str[i-1]=='c' and str[i]=='f') flag = 1;
if (str[i-1]=='c' and str[i]=='l') flag = 1;
if (str[i-1]=='c' and str[i]=='m') flag = 1;
if (str[i-1]=='c' and str[i]=='n') flag = 1;
if (str[i-1]=='c' and str[i]=='o') flag = 1;
if (str[i-1]=='c' and str[i]=='r') flag = 1;
if (str[i-1]=='c' and str[i]=='s') flag = 1;
if (str[i-1]=='c' and str[i]=='u') flag = 1;
if (str[i-1]=='d' and str[i]=='b') flag = 1;
if (str[i-1]=='d' and str[i]=='s') flag = 1;
if (str[i-1]=='d' and str[i]=='y') flag = 1;
if (str[i-1]=='e' and str[i]=='r') flag = 1;
if (str[i-1]=='e' and str[i]=='s') flag = 1;
if (str[i-1]=='e' and str[i]=='u') flag = 1;
if (str[i-1]=='f' and str[i]=='e') flag = 1;
if (str[i-1]=='f' and str[i]=='l') flag = 1;
if (str[i-1]=='f' and str[i]=='m') flag = 1;
if (str[i-1]=='f' and str[i]=='r') flag = 1;
if (str[i-1]=='g' and str[i]=='a') flag = 1;
if (str[i-1]=='g' and str[i]=='d') flag = 1;
if (str[i-1]=='g' and str[i]=='e') flag = 1;
if (str[i-1]=='h' and str[i]=='e') flag = 1;
if (str[i-1]=='h' and str[i]=='f') flag = 1;
if (str[i-1]=='h' and str[i]=='g') flag = 1;
if (str[i-1]=='h' and str[i]=='o') flag = 1;
if (str[i-1]=='h' and str[i]=='s') flag = 1;
if (str[i-1]=='i' and str[i]=='n') flag = 1;
if (str[i-1]=='i' and str[i]=='r') flag = 1;
if (str[i-1]=='k' and str[i]=='r') flag = 1;
if (str[i-1]=='l' and str[i]=='a') flag = 1;
if (str[i-1]=='l' and str[i]=='i') flag = 1;
if (str[i-1]=='l' and str[i]=='r') flag = 1;
if (str[i-1]=='l' and str[i]=='u') flag = 1;
if (str[i-1]=='l' and str[i]=='v') flag = 1;
if (str[i-1]=='m' and str[i]=='d') flag = 1;
if (str[i-1]=='m' and str[i]=='g') flag = 1;
if (str[i-1]=='m' and str[i]=='n') flag = 1;
if (str[i-1]=='m' and str[i]=='o') flag = 1;
if (str[i-1]=='m' and str[i]=='t') flag = 1;
if (str[i-1]=='n' and str[i]=='a') flag = 1;
if (str[i-1]=='n' and str[i]=='b') flag = 1;
if (str[i-1]=='n' and str[i]=='d') flag = 1;
if (str[i-1]=='n' and str[i]=='e') flag = 1;
if (str[i-1]=='n' and str[i]=='i') flag = 1;
if (str[i-1]=='n' and str[i]=='o') flag = 1;
if (str[i-1]=='n' and str[i]=='p') flag = 1;
if (str[i-1]=='o' and str[i]=='s') flag = 1;
if (str[i-1]=='p' and str[i]=='a') flag = 1;
if (str[i-1]=='p' and str[i]=='b') flag = 1;
if (str[i-1]=='p' and str[i]=='d') flag = 1;
if (str[i-1]=='p' and str[i]=='m') flag = 1;
if (str[i-1]=='p' and str[i]=='o') flag = 1;
if (str[i-1]=='p' and str[i]=='r') flag = 1;
if (str[i-1]=='p' and str[i]=='t') flag = 1;
if (str[i-1]=='p' and str[i]=='u') flag = 1;
if (str[i-1]=='r' and str[i]=='a') flag = 1;
if (str[i-1]=='r' and str[i]=='b') flag = 1;
if (str[i-1]=='r' and str[i]=='e') flag = 1;
if (str[i-1]=='r' and str[i]=='f') flag = 1;
if (str[i-1]=='r' and str[i]=='g') flag = 1;
if (str[i-1]=='r' and str[i]=='h') flag = 1;
if (str[i-1]=='r' and str[i]=='n') flag = 1;
if (str[i-1]=='r' and str[i]=='u') flag = 1;
if (str[i-1]=='s' and str[i]=='b') flag = 1;
if (str[i-1]=='s' and str[i]=='c') flag = 1;
if (str[i-1]=='s' and str[i]=='e') flag = 1;
if (str[i-1]=='s' and str[i]=='g') flag = 1;
if (str[i-1]=='s' and str[i]=='i') flag = 1;
if (str[i-1]=='s' and str[i]=='m') flag = 1;
if (str[i-1]=='s' and str[i]=='n') flag = 1;
if (str[i-1]=='s' and str[i]=='r') flag = 1;
if (str[i-1]=='t' and str[i]=='a') flag = 1;
if (str[i-1]=='t' and str[i]=='b') flag = 1;
if (str[i-1]=='t' and str[i]=='c') flag = 1;
if (str[i-1]=='t' and str[i]=='e') flag = 1;
if (str[i-1]=='t' and str[i]=='h') flag = 1;
if (str[i-1]=='t' and str[i]=='i') flag = 1;
if (str[i-1]=='t' and str[i]=='l') flag = 1;
if (str[i-1]=='t' and str[i]=='m') flag = 1;
if (str[i-1]=='x' and str[i]=='e') flag = 1;
if (str[i-1]=='y' and str[i]=='b') flag = 1;
if (str[i-1]=='z' and str[i]=='n') flag = 1;
if (str[i-1]=='z' and str[i]=='r') flag = 1;
}
}
if(flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Central Europe Regional Contest 2012 Problem c: Chemist’s vows
- Central Europe Regional Contest 2012 Problem I: The Dragon and the Knights
- Central Europe Regional Contest 2012 Problem H: Darts
- Central Europe Regional Contest 2012 Problem J: Conservation
- Central Europe Regional Contest 2012 Problem H: Darts
- Problem I - Bricks ACM/ICPC Central Europe Regional Contest 2014
- Problem C - Sums ACM/ICPC Central Europe Regional Contest 2014
- Problem D - Wheels ACM/ICPC Central Europe Regional Contest 2014
- 2012 JinHuaSite Regional Contest Problem I
- [回文自动机优化转移] Central Europe Regional Contest 2014 G. Virus synthesis
- 2012-2013 ACM-ICPC, NEERC, Central Subregional Contest H Milestones1 （暴力）
- hdu4452 搜索模拟 Running Rabbits （2012 Asia JinHua Regional Contest problem K）
- 【codeforces】2014-2015 ACM-ICPC, Central Europe Regional Contest (CERC 14) F Vocabulary【dp】
- 2012-2013 ACM-ICPC, NEERC, Central Subregional Contest
- 2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17)
- 2012-2013 ACM-ICPC East Central North America Regional Contest (ECNA 2012)
- 并查集 xtu-2170 ACM ICPC 2011–2012, Northeastern European Regional Contest Problem E. Eve
- Central Europe Regional Contest 2011
- The 2012 ACM-ICPC Asia Changchun Regional Contest（problem E)
- 20130825组队赛-2012 East Central Regional Contest