湘潭邀请赛——Welcome to XTCPC

最新推荐文章于 2021-08-17 21:41:01 发布

CODE_BALL

最新推荐文章于 2021-08-17 21:41:01 发布

阅读量1.3k

点赞数

分类专栏： practise

本文链接：https://blog.csdn.net/codeball/article/details/29228045

版权

practise 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

 
  Welcome to XTCPC 
Accepted : 159 Submit : 304
Time Limit : 1000 MS Memory Limit : 65536 KB 
 

 
 Problem DescriptionWelcome to XTCPC! XTCPC start today, you are going to choose a slogan to celebrate it, many people give you some candidate string about the slogan, but the slogan itself must have something relavant to XTCPC, a string is considered relevant to XTCPC if it become XTCPC after deleting some characters in it. For example, XTCPC, XTCCPCC, OIUXKKJATSADCASPHHC is relevant, XX,FF,GG,CPCXT,XTCP is not. Now you have to write a program to judge whether a string is relevant to XTCPC.
InputFirst line an integer t(t≤100), the number of testcases. For each case, there is a string(length≤100, all are uppercase characters).
OutputFor each case, output case number first, then "Yes" if the string is relevant, "No" if the string is not relevant. Quote for clarify.
Sample Input3
XTCPC
CCC
XXXXTTTTCCCCPPPCCC


Sample OutputCase 1: Yes
Case 2: No
Case 3: Yes

	在一个字符串中，按顺序遍历是否能出现XTCPC，若是能出现，则打印Yes，利用栈存储。#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

using namespace std;
char sz[109];
char zhan[10];

int main()
{
    int i,j,k,top,low;
    int n,m;
    char *p;
    scanf("%d%*c",&n);
    for(m = 1;m <= n;m++)
    {
        scanf("%s",sz);
        p = sz;
        top = -1;
        while(*p != '\0')
        {
            if(*p == 'X')
            {
                if(top == -1)
                {
                    zhan[++top] = *p;
                }
            }
            else if(*p == 'T')
            {
                if(zhan[top] == 'X' && top == 0)
                {
                    zhan[++top] = *p;
                }
            }
            else if(*p == 'C')
            {
                if(zhan[top] == 'T' && top == 1)
                {
                    zhan[++top] = *p;
                }
                else if(zhan[top] == 'P' && top == 3)
                    zhan[++top] = *p;
            }
            else if(*p == 'P' && top == 2)
            {
                if(zhan[top] == 'C')
                {
                    zhan[++top] = *p;
                }
            }
            p++;
        }
        if(top == 4)
            printf("Case %d: Yes\n",m);
        else
            printf("Case %d: No\n",m);
    }
    return 0;
}


 