Hangman Judge UVA - 489

题目链接：Hangman Judge UVA - 489
简单题。。。

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<iomanip>
#define ll long long

using namespace std;


int main(){
    int t,vis[27];
    string s,r;
    while(scanf("%d",&t)&&t != -1) {
        cin>>s;
        cin>>r;
        memset(vis,255,sizeof(vis));
        int l = s.length();
        int c =0;
        for(int i = 0; i < l; i++) {
                if(vis[(s[i] - 'a')] == -1) {
                     vis[(s[i] - 'a')] = 0;
                     c++;
                }
        }
        l = r.length();
        int sum = 0;
        int f = 0;
        for(int i = 0; i < l; i++) {
            if(vis[(r[i] - 'a')] == 0){
                vis[(r[i] - 'a')] = 1;
                c--;
            }
            else sum++;
            if(c == 0){
                f = 1;
                break;
            }
            if(sum == 7) {
                f = -1;
                break;
            }
        }
        printf("Round %d\n",t);
        if(f == 1) puts("You win.");
        else if(f == -1) puts("You lose.");
        else puts("You chickened out.");
    }
    return 0;
}