1 solutions

  • 0
    @ 2026-10-22 18:14:36

    C :

    #include <stdio.h>
    #include <string.h>
    
    #define Max 30
    #define Max_Length 500
    
    int main(void) {
        int N,M;
        int i;
        int count=0; 
        char strings[Max][Max_Length];
        
        scanf("%d %d",&N,&M);
    	getchar();
        
        if (M<1||M>30||M>N||N<1||N>30) {
            return 1;
        }
        
        for (i=0;i<N;i++) {
            fgets(strings[i],Max_Length,stdin);
            strings[i][strcspn(strings[i],"\n")] = '\0';
        }
        
        for (i=0;i<N;i++) {
            if (strstr(strings[i],"qiandao")!=NULL||strstr(strings[i],"easy")!=NULL) {
                continue;
            }
            count++;
            if (count==M + 1) {
                printf("%s\n",strings[i]);
                return 0;
            }
        }
        printf("Wo AK le\n");
        return 0;
    }
    

    C++ :

    #include<iostream>
    #include<string>
    using namespace std;
    
    int main() { 
        string a[31]; 
        int n, m; cin >> n >> m; 
        cin.ignore(); 
        for (int i = 1; i <= n; i++) { 
            getline(cin, a[i]); 
        } 
        int count = 1; 
        while (m--) { 
            if (a[count].find("easy") !=-1 || a[count].find("qiandao") !=-1) { 
                m++; 
            } 
            count++; 
        } 
        while (count <= n) { 
            if (a[count].find("easy") != -1 || a[count].find("qiandao") != -1) { 
                count++; 
            } else { 
                break; 
            } } if (count <= n) { 
                cout << a[count] << endl; 
            } else { cout << "Wo AK le"; 
        }
    }
    
    • 1

    Information

    ID
    341
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By