样例过了,但是测评还在等待,就先把代码粘贴过来把,觉得应该不会有坑
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int main() {
int n;
while (cin >> n && n != -1) {
cout << "Round " << n << endl;
string s1, s2;
cin >> s1 >> s2;
int Hash1[26] = {};
for (int i = 0; i < sz(s1); i++) {
Hash1[s1[i] - 'a']++;
}
int sum = 0;
for (int i = 0; i < 26; i++) {
if (Hash1[i]) sum++;
}
int wrong = 0;
int ans = 0;
int Hash2[26] = {};
for (int i = 0; i < sz(s2); i++) {
if (Hash1[s2[i] - 'a'] == 0) wrong++;
else if (Hash2[s2[i] - 'a']) wrong++;
else ans++, Hash2[s2[i] - 'a'] = 1;
if (wrong == 7) break;
}
if (wrong == 7) cout << "You lose." << endl;
else cout << (ans == sum ? "You win." : "You chickened out.") << endl;
}
return 0;
}