PTA L1-078 吉老师的回归 C语言

题目：

输入：

5 1
L1-1 is a qiandao problem.
L1-2 is so...easy.
L1-3 is Easy.
L1-4 is qianDao.
Wow, such L1-5, so easy.

输出：

L1-4 is qianDao.

输入：

5 4
L1-1 is a-qiandao problem.
L1-2 is so easy.
L1-3 is Easy.
L1-4 is qianDao.
Wow, such L1-5, so!!easy.

输出：

Wo AK le

代码：

#include <stdio.h>
#include <string.h>
int main()
{
    const int N = 36;
    char ch[2][8] = {"qiandao","easy"};
    char arr[N][66];
    int n = 0,m = 0;
    scanf("%d %d",&n,&m);
    getchar();//注意吸收回车
    for(int i = 0;i<n;i++)
    {
        gets(arr[i]);
        if(strstr(arr[i],ch[0])==NULL && strstr(arr[i],ch[1])==NULL)
        {
            if(m==0)//放在m--的前面
            {
                printf("%s",arr[i]);
                return 0;
            }
            m--;
        }
    }
    printf("Wo AK le\n");
    return 0;
}

结果：