Luogu P1184 Master's Problem Solving Together

topic portal

Who is that master? @jxpxcsh QWQ.

The data of this question is very watery, so O(n*m) is used directly. Every time a string within m is read, the string of n is scanned. But note that there may be spaces in the location string, so at this time, getline is required.

#include<bits/stdc++.h>
using namespace std;
string gs[21],ll;
int n,m,ans=0;
int main(){
    cin>>n>>m;
    getline(cin,ll);
    for(int i=1;i<=n;i++) getline(cin,gs[i]);
    for(int i=1;i<=m;i++){
        getline(cin,ll);
        if(ll[ll.size()-1]!=13)ll=ll+(char)13;
        for(int j=1;j<=n;j++)
            if(ll==gs[j]){
                ans++;
                break;
            }
    }
    cout << years;
    return  0 ;
}