C language I want to pass

---

Algorithm design ideas

1. First , If there is any in the input sample, except PAT The rest of the characters , Procedure considered as NO
2. secondly , about “aPbATca” When ‘c’ and ‘a’ All are empty characters ,‘b’ yes ‘A’ character , It can be judged that ：“PAAT” That's right.
3. Last , The rest of the characters can be judged by formula inference ：P front A The number of * P and T middle A The number of = T after A The number of , If this formula is satisfied, it is also right
4. Combined with the idea of appeal, start the implementation of the code

---

Code

#include <stdio.h>

int main(){
    
    char a[10][100] = {
    0};
    int n,i,j,count_A,count_P,count_T,s1,s2,s3;
    scanf("%d", &n);
    for(i=0; i<n; i++){
    
        scanf("%s", &a[i]);
    }
    for(i=0; i<n; i++){
    
        j=0, count_A=0, count_P=0, count_T=0, s1=0, s2=0, s3=0;
        while(a[i][j] != '\0'){
    
            if(a[i][j]=='A'){
    
                count_A++;
            }else if(a[i][j]=='P'){
    
                count_P++;
                s1 = j;
            }else if(a[i][j]=='T'){
    
                count_T++;
                s2 = j;
            }else{
    
                s3 = 1;
                break;
            }
            j++;
        }
        if(s3!=1 && count_P==1 && count_T==1 && !((s2-s1-1)*s1-(count_A-s2+1)) && (s2-s1-1)){
    
            printf("YES");
        }else{
    
            printf("NO");
        }
        if(i != n-1){
    
            printf("\n");
        }
    }
    return 0;
}

---

Running results