forked from buglinjo/codeforces
-
Notifications
You must be signed in to change notification settings - Fork 0
/
214B - Hometask.cpp
82 lines (82 loc) · 2.36 KB
/
214B - Hometask.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
#include <iostream>
#include <algorithm>
using namespace std;
int len, sum, mas[100005];
int main() {
cin >> len;
for (int i = 0; i < len; i++) {
cin >> mas[i];
sum += mas[i];
}
sort(mas, mas + len);
reverse(mas, mas + len);
if (mas[len - 1] != 0) {
cout << "-1";
} else if (mas[0] == 0 || sum == 0) {
cout << "0";
} else {
if (sum % 3 == 0) {
for (int i = 0; i < len; i++) {
cout << mas[i];
}
} else if (sum % 3 == 1) {
for (int i = len - 1; i >= 0; i--) {
if (mas[i] != 0 && mas[i] % 3 == 1) {
sum -= mas[i];
mas[i] = -1;
break;
}
}
if (sum % 3 != 0) {
int test = 0;
for (int i = len - 1; i >= 0; i--) {
if (mas[i] != 0 && mas[i] % 3 == 2) {
mas[i] = -1;
test++;
}
if (test == 2) {
break;
}
}
}
if ((mas[0] == -1 || mas[1] == -1) && mas[2] == 0) {
cout << 0;
} else {
for (int i = 0; i < len; i++) {
if (mas[i] != -1) {
cout << mas[i];
}
}
}
} else if (sum % 3 == 2) {
for (int i = len - 1; i >= 0; i--) {
if (mas[i] != 0 && mas[i] % 3 == 2) {
sum -= mas[i];
mas[i] = -1;
break;
}
}
if (sum % 3 != 0) {
int test = 0;
for (int i = len - 1; i >= 0; i--) {
if (mas[i] != 0 && mas[i] % 3 == 1) {
mas[i] = -1;
test++;
}
if (test == 2) {
break;
}
}
}
if ((mas[0] == -1 || mas[1] == -1) && mas[2] == 0) {
cout << 0;
} else {
for (int i = 0; i < len; i++) {
if (mas[i] != -1) {
cout << mas[i];
}
}
}
}
}
}