CSES - Leirikisa 9.12.2021 - Results
Submission details
Task:Omenat
Sender:andreibe
Submission time:2021-12-09 13:05:34 +0200
Language:C++ (C++11)
Status:READY
Result:17
Feedback
groupverdictscore
#1ACCEPTED17
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.01 s1details
#3ACCEPTED0.01 s1details
#4ACCEPTED0.01 s1details
#5ACCEPTED0.01 s1details
#6ACCEPTED0.01 s1details
#7--2details
#8--2details
#9--2details
#10--2details
#11--2details
#12--2details
#13--3details
#14--3details
#15--3details
#16--3details
#17--3details
#18--3details

Code

#include <iostream>
#include <string>
#include <math.h>
#include <map>
#include <algorithm>
#include <vector>
#include <fstream>
#include <set>
#include <unordered_map>
#include <queue>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define LOOP(i,a,l) for (int i = a; i < l; i++)
#define LUO_VERKKO LOOP(i,0,m) {int a,b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a);}
#define COLLECT for (int i = 0; i < n; i++) cin >> s[i]
#define A 999999999999999999LL
//https://cses.fi/dt/
int n, m, q;
int s[101010];
int best = 0;
void haku(int i, ll summa, int maara) {
	if (i == n) {
		if (summa % 3 == 0) {
			best = max(maara, best);
		}
		return;
	}
	haku(i + 1, summa + s[i],maara+1);
	haku(i + 1, summa,maara);
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> s[i];
	}
	haku(0, 0,0);
	cout << best;
}

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: ACCEPTED

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

correct output
18

user output
18

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: ACCEPTED

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

correct output
18

user output
18

Test 7

Group: 2

Verdict:

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

correct output
100

user output
(empty)

Test 8

Group: 2

Verdict:

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

correct output
99

user output
(empty)

Test 9

Group: 2

Verdict:

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

correct output
98

user output
(empty)

Test 10

Group: 2

Verdict:

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

correct output
100

user output
(empty)

Test 11

Group: 2

Verdict:

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

correct output
99

user output
(empty)

Test 12

Group: 2

Verdict:

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

correct output
98

user output
(empty)

Test 13

Group: 3

Verdict:

input
100000
460655049 593289072 315159623 ...

correct output
100000

user output
(empty)

Test 14

Group: 3

Verdict:

input
100000
935436362 204516709 337519402 ...

correct output
99999

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
68654915 40061376 215300034 43...

correct output
99998

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
435410962 22254303 500625758 6...

correct output
100000

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000
230562634 84329865 874955526 8...

correct output
99999

user output
(empty)

Test 18

Group: 3

Verdict:

input
100000
29734968 168066517 710394372 3...

correct output
99998

user output
(empty)