UVa 489 - Hangman Judge

 1 #include <iostream>
 2 #include <cstring>
 3 using namespace std;
 4 char s1[100],s2[100];
 5 int s3[100];
 6 int n;
 7 int a,b,l1,l2;
 8 int main()
 9 {
10     while(cin>>n && n!=-1)
11     {
12         printf("Round %d\n",n);
13         cin>>s1>>s2;
14         l1=strlen(s1);
15         l2=strlen(s2);
16         memset(s3,0,sizeof(s3));
17         b=0;
18         for(int i=0;i<l2;i++)
19         {
20             bool f=0;
21             for(int j=0;j<l1;j++)
22             {
23                 if(s2[i]==s1[j]&&s3[j]==0)
24                 {
25                     s3[j]=1;
26                     f=1;
27                 }
28             }
29             if(f==0) b++;
30             if(b>6) break;
31         }
32         bool f2=1;
33         for(int i=0;i<l1;i++) if(s3[i]==0) f2=0;
34         if(f2==1)
35         {
36             puts("You win.");
37             continue;
38         } 
39         if(b>6)
40         {
41             puts("You lose.");
42             continue;
43         }
44         puts("You chickened out.");
45         continue;
46     }
47 }