Problem H: 零起點學算法109——單數變復數


#include <stdio.h>
#include<string.h>
int main(void)
{
    int n;
    char word[100];
    scanf("%d",&n);
    getchar();
    int i;
    while(n!=0)
    {
        gets(word);
        int k=strlen(word);
        if(word[k-1]=='y')
            strcat(word,"es");
        else if(word[k-2]=='s'||word[k-1]=='x')
            strcat(word,"es");
        else if(word[k-2]=='s'&&word[k-1]=='h')
            strcat(word,"es");
        else if(word[k-2]=='c'&&word[k-1]=='h')
            strcat(word,"es");
        else if(word[k-1]=='o')
            strcat(word,"es");
        else
            strcat(word,"s");
        puts(word);
        n--;
    }
    return 0;
}

似乎用printf提交ac不了,用put可以


免責聲明!

本站轉載的文章為個人學習借鑒使用,本站對版權不負任何法律責任。如果侵犯了您的隱私權益,請聯系本站郵箱yoyou2525@163.com刪除。



 
粵ICP備18138465號   © 2018-2025 CODEPRJ.COM