Central Europe Regional Contest 2012 Problem C: Chemist’s vows

最新推荐文章于 2017-09-13 07:55:23 发布
最新推荐文章于 2017-09-13 07:55:23 发布
阅读量1.5k 收藏
点赞数
分类专栏： 模拟 文章标签： hunnu CERC2012
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/libin56842/article/details/11395747
版权

http://acm.hunnu.edu.cn/online/problem_pdf/CERC2012/C.pdf

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;
}

键盘上的舞者
关注
专栏目录
2006 East Central Regional Contest数据和标程
10-02
标题 "2006 East Central Regional Contest数据和标程" 指的是一个与ACM（国际大学生程序设计竞赛）相关的资源集合，其中包含了2006年东中部区域赛的比赛数据和解决方案。ACM国际大学生程序设计竞赛是一项全球性的...
UVALive - 6257 K - Chemist's vows 【DFS】【BFS】【DP】
banshen0201的博客
04-23 197
题目链接 https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4268 题意 给出化学元素周期表，然后给出一个字符串，判断字符串里面的字符，能不能够完全由元素周期表里面的元...
Central Europe Regional Contest 2012 Problem c: Chemist’s vows
weixin_30780221的博客
10-03 116
字符串处理的题目； 学习了一下string类的一些用法； 这个代码花的时间很长，其实可以更加优化； 代码： 1 #include<iostream> 2 #include<string> 3 using namespace std; 4 string dict[114]= {"he","h","li","be","b","c","n","o",...
Chemist's vows - UVALive 6257
xiyue_jiang的博客
09-13 415
Chemist’s vows
UVALive 6257 Chemist's vows 判断一个字符串是否由n中的某些字符串组成 dp
became_a_wolf的专栏
06-04 476
#include #include #include #include #include using namespace std; string ss[]= {"h","he", "li","be","b","c","n","o","f","ne", "na","mg","al","si","p","s","cl","ar",
CERC 2012 题解 (A~K)
skywalkert's space
09-12 2104
比赛地址 CHFFY 3 - Central Europe Regional Contest 2012 CodeForcesGym - 2012-2013 ACM-ICPC, Central Europe Regional Contest (CERC 12) BZOJ 3115、3169、4057 ~ 4065 也可以提交 A. Kingdoms 题意： 给定n个国家之间的债务
c_language_contest.rar_contest C语言
09-20
"c_language_contest.rar_contest C语言" 提到的是一个与C语言相关的竞赛，这通常涉及到对C语言深入理解和应用的测试。在这样的竞赛中，参赛者不仅需要掌握基本的语法和数据类型，还需要理解指针、内存管理、函数、...
2008 ACM ICPC South Central USA Regional Programming Contest
10-29
3. **编程语言**：竞赛中允许使用的编程语言包括C, C++, Java, Pascal等，但近年来C++和Java是最常用的语言，因为它们提供了丰富的库函数和高效执行速度。 4. **算法与数据结构**：比赛中常见的问题类型涉及排序、...
shiny-contest-2021:闪亮的应用程式竞赛
04-01
总的来说，"shiny-contest-2021"是一个展示R语言与数据科学结合能力的平台，参赛者利用text-mining和sentiment-analysis等先进技术，创造出富有洞察力且具有交互性的应用。对于R用户来说，这是一个学习新技能、了解...
matlab信任模型代码-contest-aiteam2:Competition-aiteam2
05-22
matlab信任模型代码 代做各类CS相关课程和程序语言 QQ: 1823890830 微信: qiushiwenmeng 专业过硬, 英语精通。代写5年来, 累计完成近万份大小project assignment, 客户来自美国, 加拿大, 英国, ...Cap
UVALive 6257 Chemist's vows
weixin_30244681的博客
07-30 99
1 #include<iostream> 2 #include<string.h> 3 #include<stdio.h> 4 #include<ctype.h> 5 #include<algorithm> 6 #include<stack> 7 ...
ZOJ3669:Japanese Mahjong I
热门推荐
ACM！荣耀之路！
05-12 6万+
Mahjong is a game of skill, strategy and calculation and involves a certain degree of chance. In this problem, we concentrate on Japanese Mahjong, a variation of mahjong. For brief, all of the word ma
ZOJ3705:Applications
ACM！荣耀之路！
07-28 3万+
Recently, the ACM/ICPC team of Marjar University decided to choose some new members from freshmen to take part in the ACM/ICPC competitions of the next season. As a traditional elite university in ACM
ZOJ1111：Poker Hands(模拟题)
ACM！荣耀之路！
11-19 4666
A poker deck contains 52 cards - each card has a suit which is one of clubs, diamonds, hearts, or spades (denoted C, D, H, S in the input data). Each card also has a value which is one of 2, 3, 4, 5,
ZOJ3879:Capture the Flag(浙江省赛2015)
ACM！荣耀之路！
04-25 3765
The 12th Zhejiang Provincial Collegiate Programming Contest  n computer security, Capture the Flag (CTF) is a computer security competition. CTF contests are usually designed to serve as an edu
HDU1035:Robot Motion
ACM！荣耀之路！
05-28 2964
Problem Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions
ZOJ3878:Convert QWERTY to Dvorak(浙江省赛2015)
ACM！荣耀之路！
04-25 2863
The 12th Zhejiang Provincial Collegiate Programming Contest  Edward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps Lock key, so
ZOJ3787：Access System
ACM！荣耀之路！
04-13 2423
For security issues, Marjar University has an access control system for each dormitory building.The system requires the students to use their personal identification cards to open the gate if they wan
ZOJ3757：Alice and Bob and Cue Sports（模拟）
ACM！荣耀之路！
03-04 2317
Alice and Bob both love playing games. Now, Alice and Bob are playing a cue sport like Nine-ball Pool. Two players move in turn. A move is that one player use the cue ball to hit the target ball for p
https://codeforces.com/contest/1809/problem/C
最新发布
03-29
The problem statement can be found at Codeforces website. Approach: Let's start by looking at some examples: - 1, 2, 3, 4, 5 → No moves needed. - 2, 1, 3, 5, 4 → One move needed: swap index 1 and ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值