-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path12765.cc
78 lines (73 loc) · 1.14 KB
/
12765.cc
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
#include <iostream>
using namespace std;
int main(){
int len1,len2;
while(cin >> len1 >> len2 && len1 != 0 && len2 != 0){
int left [9] = {0};
int right[9] = {0};
int val;
for(int i = 0;i < len1;i++){
cin >> val;
while(val > 0){
switch(val){
case 4:
left[1] += 2;
val--;
break;
case 6:
left[2]++;
left[1]++;
val--;
break;
case 8:
left[1] += 3;
val--;
break;
case 9:
left[2] += 2;
val--;
break;
default:
left[val-1]++;
val--;
}
}
}
for(int i = 0;i < len2;i++){
cin >> val;
while(val > 0){
switch(val){
case 4:
right[1] += 2;
val--;
break;
case 6:
right[2]++;
right[1]++;
val--;
break;
case 8:
right[1] += 3;
val--;
break;
case 9:
right[2] += 2;
val--;
break;
default:
right[val-1]++;
val--;
}
}
}
bool same = true;
for(int j = 1;j < 9;j++){
if(left[j] != right[j])
same = false;
}
if(same)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}