2021四川省赛H题 Nihongo wa Muzukashii Desu（指针数组，strstr函数的应用）2021-07-20

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char* suffix[10]={"chimasu","rimasu","mimasu","bimasu","nimasu","kimasu","gimasu","shimasu","imasu"};//后缀
int main()
{
    int t;
    char word[30];
    scanf("%d",&t);
    char *p;
    while(t--)
    {
        scanf("%s",word);
        if(!strcmp(word,"ikimasu"))
            {printf("itte\n");continue;}
        int i;
        for(i=0;i<9;i++)
        {
            if(strstr(word,suffix[i]))
            {
                p=strstr(word,suffix[i]);//用strstr函数寻找子串（后缀），若找到，返回子串所在的指针，若找不到，返回NULL
                break;
            }
        }
        int T=i+1;
        char prefix[25];//前缀
        int t=p-word;
        for(i=0;i<t;i++)
        {
            prefix[i]=word[i];
        }
        prefix[i]='\0';
        if(T>=1&&T<=2) printf("%stte\n",prefix);
        else if(T>2&&T<=5) printf("%snde\n",prefix);
        else if(T==6) printf("%site\n",prefix);
        else if(T==7) printf("%side\n",prefix);
        else if(T==8) printf("%sshite\n",prefix);
        else if(T==9) printf("%stte\n",prefix);
    }
    return 0;
}