CSES - Datatähti 2015 loppu - Results
 Task: Omenat Sender: Dentosal Submission time: 2015-01-29 13:30:08 Language: C++ Status: READY Result: 0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#30.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#60.05 s1details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.06 s2details
#90.06 s2details
#10ACCEPTED0.05 s2details
#11ACCEPTED0.06 s2details
#120.06 s2details
#13ACCEPTED0.22 s3details
#14ACCEPTED0.22 s3details
#150.21 s3details
#16ACCEPTED0.22 s3details
#17ACCEPTED0.21 s3details
#180.23 s3details

### Code

```/*
PARTIAL SOLUTION: SOME PROBLEMS
*/

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
int n;
cin >> n;

unsigned int painot[n];
unsigned long summa=0;
bool isModOne = false;
bool isModTwo = false;
for (int i = 0; i < n; ++i) {
cin >> painot[i];
summa += painot[i];
if (painot[i]%3==1) {
isModOne=true;
}
if (painot[i]%3==2) {
isModTwo=true;
}
}

if (summa<3) {
cout << 0 << endl;
return 0;
}

unsigned int delta = summa%3;

if (delta==0) {
cout << n << endl;
return 0;
}

if (isModOne || isModTwo)  {
cout << n-1 << endl;
return 0;
}
if (n==0) {
cout << 0 << endl;
}
if (n==1) {
cout << (painot[1]%3==0) << endl;
}

/*TIME LIMIT*/
while (1) {}

return 0;
}
```

### Test details

#### Test 1

Group: 1

Verdict: ACCEPTED

input
20
34 98 42 72 75 91 76 30 98 7 1...

correct output
20

user output
20

#### Test 2

Group: 1

Verdict: ACCEPTED

input
20
20 97 85 24 47 57 69 92 21 72 ...

correct output
19

user output
19

#### Test 3

Group: 1

Verdict:

input
20
36 35 3 15 84 14 24 33 39 27 7...

correct output
18

user output
19

#### Test 4

Group: 1

Verdict: ACCEPTED

input
20
75 87 27 66 14 48 34 1 52 47 7...

correct output
20

user output
20

#### Test 5

Group: 1

Verdict: ACCEPTED

input
20
83 7 54 38 21 51 61 61 14 32 3...

correct output
19

user output
19

#### Test 6

Group: 1

Verdict:

input
20
76 24 28 45 36 87 81 21 48 43 ...

correct output
18

user output
19

#### Test 7

Group: 2

Verdict: ACCEPTED

input
100
9 48 27 13 12 23 23 35 14 58 2...

correct output
100

user output
100

#### Test 8

Group: 2

Verdict: ACCEPTED

input
100
22 87 66 23 77 17 41 66 31 40 ...

correct output
99

user output
99

#### Test 9

Group: 2

Verdict:

input
100
90 50 48 47 20 93 36 48 69 2 6...

correct output
98

user output
99

#### Test 10

Group: 2

Verdict: ACCEPTED

input
100
88 39 9 21 51 92 94 75 71 19 8...

correct output
100

user output
100

#### Test 11

Group: 2

Verdict: ACCEPTED

input
100
76 37 49 50 59 68 6 100 48 18 ...

correct output
99

user output
99

#### Test 12

Group: 2

Verdict:

input
100
78 45 100 25 90 85 33 90 45 54...

correct output
98

user output
99

#### Test 13

Group: 3

Verdict: ACCEPTED

input
100000
460655049 593289072 315159623 ...

correct output
100000

user output
100000

#### Test 14

Group: 3

Verdict: ACCEPTED

input
100000
935436362 204516709 337519402 ...

correct output
99999

user output
99999

#### Test 15

Group: 3

Verdict:

input
100000
68654915 40061376 215300034 43...

correct output
99998

user output
99999

#### Test 16

Group: 3

Verdict: ACCEPTED

input
100000
435410962 22254303 500625758 6...

correct output
100000

user output
100000

#### Test 17

Group: 3

Verdict: ACCEPTED

input
100000
230562634 84329865 874955526 8...

correct output
99999

user output
99999

#### Test 18

Group: 3

Verdict:

input
100000
29734968 168066517 710394372 3...

correct output
99998

user output
99999