-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path00489 Hangman Judge.cpp
72 lines (72 loc) · 1.72 KB
/
00489 Hangman Judge.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <limits>
#define iter(a,b,c,d) for(a = b; a < c; a+=d)
#define ited(a,b,c,d) for(a = b; a > c; a-=d)
#define li long int
#define uli unsigned li
#define ll long li
#define ull unsigned ll
#define si(a) scanf("%d",&a)
#define sli(a) scanf("%ld",&a)
#define sll(a) scanf("%lld",&a)
#define slu(a) scanf("%llu",&a)
#define sf(a) scanf("%f",&a)
#define slf(a) scanf("%lf",&a)
#define PI 3.1415926
using namespace std;
int main()
{
/*freopen("1in.txt", "r", stdin);
freopen("1out.txt", "w", stdout);*/
ll charmask;
int n;
while(scanf("%d\n",&n) && n != -1)
{
charmask = 0;
string s1,s2;
cin >> s1;
int i;
iter(i,0,s1.size(),1)
{
charmask |= (1 << (s1[i] - 'a'));
}
//cout << charmask << endl;
cin >> s2;
int wrong = 0;
ll mask2 = 0;
iter(i,0,s2.size(),1)
{
ll temp = charmask & (1 << (s2[i] - 'a'));
//cout << temp << endl;
if(temp)
{
mask2 |= temp;
if(charmask == mask2)
break;
}
else
{
wrong++;
if(wrong >= 7) break;
}
}
//cout << wrong << endl;
if(charmask == mask2 && wrong < 7)
printf("Round %d\nYou win.\n",n);
else if(charmask != mask2 && wrong < 7)
printf("Round %d\nYou chickened out.\n",n);
else
printf("Round %d\nYou lose.\n",n);
}
return 0;
}