算法竞赛入门经典第四章例题4-2 Hangman Judge UVA - 489

例题4-2
https://vjudge.net/problem/UVA-489

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
    string s, t;
    int cnt;
    while (cin >> cnt && cnt != -1) {
        int vis[26] = {};
        cin >> s >> t;
        int L = s.length();
        for (int i = 0; i < L; ++i)
            ++vis[s[i] - 'a'];
        int nn = 7;
        for (int i = 0; i < t.size(); ++i) {
            if (vis[t[i]-'a']) {L -= vis[t[i]-'a']; vis[t[i]-'a'] = 0;}
            else if (!(--nn)) break;
            if (!L) break;
        }
        printf("Round %d\n",cnt);
        if (!L) printf("You win.\n");
        else if (nn) printf("You chickened out.\n");
        else printf("You lose.\n");
    }
}