-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathUVA_12247_Jollo.cpp
106 lines (105 loc) · 1.71 KB
/
UVA_12247_Jollo.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include <stdio.h>
int main()
{
int girl[3], girlFlag[3], boy[3], b, g, justBigger, justBiggerIndex, biggest, flag, girlWin, boyWin;
scanf("%d %d %d %d %d",&girl[0],&girl[1],&girl[2],&boy[0],&boy[1]);
while(girl[0] != 0 && girl[1] != 0 && girl[2] != 0 && boy[0] != 0 && boy[1] != 0)
{
for(g=0; g<3; g++)
girlFlag[g] = 0;
girlWin = 0;
boyWin = 0;
for(b=0; b<2; b++)
{
justBigger = 53;
justBiggerIndex = -1;
for(g=0; g<3; g++)
{
if(girlFlag[g] == 0)
{
if(girl[g] > boy[b] && girl[g] < justBigger)
{
justBigger = girl[g];
justBiggerIndex = g;
}
}
}
if(justBiggerIndex != -1)
{
girlFlag[justBiggerIndex] = 1;
girlWin ++;
}
else
{
boyWin ++;
}
}
if(girlWin >= 2)
{
boy[2] = -1;
}
else if(boyWin >=2)
{
boy[2] = 1;
flag = 0;
while(flag == 0 && boy[2] < 53)
{
flag = 1;
for(g=0; g<3; g++)
{
if(girl[g] == boy[2])
{
boy[2] ++;
flag = 0;
}
}
for(b=0; b<2; b++)
{
if(boy[b] == boy[2])
{
boy[2] ++;
flag = 0;
}
}
}
if(boy[2] > 52)
boy[2] = -1;
}
else
{
biggest = -1;
for(g=0; g<3; g++)
{
if(girlFlag[g] == 0 && girl[g] > biggest)
biggest = girl[g];
}
boy[2] = biggest+1;
flag = 0;
while(flag == 0 && boy[2] < 53)
{
flag = 1;
for(g=0; g<3; g++)
{
if(girl[g] == boy[2])
{
boy[2] ++;
flag = 0;
}
}
for(b=0; b<2; b++)
{
if(boy[b] == boy[2])
{
boy[2] ++;
flag = 0;
}
}
}
if(boy[2] > 52)
boy[2] = -1;
}
printf("%d\n", boy[2]);
scanf("%d %d %d %d %d",&girl[0],&girl[1],&girl[2],&boy[0],&boy[1]);
}
return 0;
}