PTA 1003 我要通过!

最新推荐文章于 2024-07-25 23:26:35 发布

鹤纸千丶

最新推荐文章于 2024-07-25 23:26:35 发布

阅读量316

点赞数 8

文章标签：算法数据结构

本文链接：https://blog.csdn.net/qq_51415695/article/details/136419395

版权

#include<stdio.h>
#include<string.h>
int main(){
    int n;
    scanf("%d",&n);
    char arr[100];
    while(n>0){
        n = n - 1;
        scanf("%s",arr);
        int len = strlen(arr);
        int flag1 = 0;
        int flagP = 0;
        int flagT = 0;
        for(int i = 0;i<len;i++){
            if(arr[i]=='P'||arr[i]=='A'||arr[i]=='T'){
                continue;
            }
            else{
                flag1 = 1;
                break;
            }
        }
        if(flag1 == 1){
            printf("NO\n");
            continue;
        }
        int countABetweenPAndT = 0;
        int countABeforeP = 0;
        int countABehindT = 0;
        for(int i=0;i<len;i++){
            if(arr[i]=='A'&&flagP==0){
                countABeforeP += 1;
            }
            if(arr[i]=='A'&&flagP == 1&&flagT == 0){
                countABetweenPAndT +=1;
            }
            if(arr[i]=='A'&&flagT==1&&flagP==1){
                countABehindT+=1;
            }
            if(arr[i]=='P'){
                flagP += 1;
            }
            if(arr[i]=='T'&&flagP==1){
                flagT+= 1;
            }
        }
        if(flagP==1&&flagT==1&&countABetweenPAndT>=1){
            if(countABeforeP*countABetweenPAndT==countABehindT){
              // printf("%d %d %d\n",countABeforeP,countABetweenPAndT,countABehindT);
                printf("YES\n");
            }
            else{
                printf("NO\n");
            }
        }else{
            printf("NO\n");
        }
    }

    return 0;
}