-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathARMY.cpp
76 lines (63 loc) · 873 Bytes
/
ARMY.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
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int T,ng,nm,i,j,size=0;
scanf("%d",&T);
while(T--)
{
scanf("%d %d", &ng, &nm);
if(ng>nm)
size=ng;
else
size=nm;
int g[size+1];
int mg[size+1];
for(i=0;i<size;i++)
g[i]=0;
for(i=0;i<size;i++)
mg[i]=0;
for(i=0;i<ng;i++)
scanf("%d",&g[i]);
for(i=0;i<nm;i++)
scanf("%d",&mg[i]);
sort(g,g+ng);
sort(mg,mg+nm);
i=0;
j=0;
for(;i<size && j<size;)
{
if(g[i]==mg[j])
{
mg[j]=0;
i--;
//continue;
}
else
if(g[i]<mg[j])
{
g[i]=0;
j--;
//continue;
}
else
if(mg[j]<g[i])
{
mg[j]=0;
i--;
//continue;
}
i++;
j++;
}
for(i=0;i<ng;i++)
if(g[i]!=0)
break;
if(i<ng)
printf("Godzilla\n");
else
printf("MechaGodzilla\n");
}
return 0;
}