求助全RE
查看原帖
求助全RE
977778
__Harry_Haiyun__楼主2023/7/17 18:58
#include <bits/stdc++.h>
#define MOD 998244353
#define mod 1000000007
#define ll long long
#define ull unsigned long long
#define ui unsigned int
using namespace std;
int main()
{
	int n,m;
	cin >> n >> m;
	int mul = n * m;
	string que[m];
	for (int i = 0; i < m; i++) cin >> que[i];
	string stu,stuzip,numzip,quezip[m],quecpp,ans[mul];
    int l = 0;
	for (int i = 0; i < n; i++)
	{
	    cin >> stu;
	    for (int j = 0; j < m; j++)
	    {
	        bool flag = 1;
	        scanf("%s/%s/%s/%s",&stuzip,&numzip,&quezip[j],&quecpp);
	        if (stuzip[stuzip.length() - 1] == 'p' && stuzip[stuzip.length() - 2] == 'i' && stuzip[stuzip.length() - 3] == 'z' && stuzip[stuzip.length() - 4] == '.')
	        {
	            for (int k = 0; k < stu.length(); k++)
	            {
	                if (stuzip[k] != stu[k])
	                {
	                    flag = 0;
	                    break;
                    }
                }
                if (!flag)
                {
                    ans[l] = "Fusu is angry!";
                    l++;
                    continue;
                }
            }
            else 
            {
                ans[l] = "Fusu is angry!";
                l++;
                continue;
            }
            if (numzip != stu) 
            {
                ans[l] = "Fusu is angry!";
                l++;
                continue;
            }
            if (quezip[j] != que[j] || quezip[j] != que[j] + ".cpp")
            {
                ans[l] = "Fusu is angry!";
                l++;
                continue;
            }
            ans[l] = "Fusu is happy!";
            l++;
        }
    }
    for (int i = 0; i < n * m; i++) cout << ans[i] << endl;
	return 0;
}
2023/7/17 18:58
加载中...