Hangman Judge UVA - 489

#include<bits/stdc++.h>//包含所有头文件
using namespace std;

#define ms(s) memset(s,0,sizeof(s))typedef unsigned long

#define maxn 100
char ans[maxn];
char gus[maxn];
int main(){
//    freopen("F://inp.txt","r",stdin);
int T;
while(scanf("%d",&T)!=EOF)
{
if(T>0)
{
scanf("%s",ans);
scanf("%s",gus);

printf("Round %d\n",T);
int alen=strlen(ans);
int glen=strlen(gus);

int last,ches=0,m=0;
for(int i=0;i<glen;i++)
{
int last=1;
for(int j=0;j<alen;j++)
{
if(gus[i]==ans[j])
{
m++;
ans[j]=0;
last=0;
}
}
if(last)
{
ches++;

}
if(ches<7&&m==alen) break;
if(ches>=7) break;
}
if(ches<7)
{
if(m==alen) printf("You win.\n");
else    printf("You chickened out.\n");
}
else
printf("You lose.\n");
}
}
return 0;
}