Task: | Summa |
Sender: | Alexander Popov |
Submission time: | 2019-01-17 15:48:34 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.03 s | details |
#2 | ACCEPTED | 0.02 s | details |
#3 | ACCEPTED | 0.02 s | details |
#4 | ACCEPTED | 0.01 s | details |
#5 | TIME LIMIT EXCEEDED | -- | details |
#6 | TIME LIMIT EXCEEDED | -- | details |
#7 | TIME LIMIT EXCEEDED | -- | details |
#8 | TIME LIMIT EXCEEDED | -- | details |
#9 | TIME LIMIT EXCEEDED | -- | details |
#10 | TIME LIMIT EXCEEDED | -- | details |
#11 | TIME LIMIT EXCEEDED | -- | details |
#12 | TIME LIMIT EXCEEDED | -- | details |
#13 | TIME LIMIT EXCEEDED | -- | details |
#14 | TIME LIMIT EXCEEDED | -- | details |
#15 | TIME LIMIT EXCEEDED | -- | details |
#16 | TIME LIMIT EXCEEDED | -- | details |
#17 | TIME LIMIT EXCEEDED | -- | details |
#18 | TIME LIMIT EXCEEDED | -- | details |
#19 | TIME LIMIT EXCEEDED | -- | details |
#20 | TIME LIMIT EXCEEDED | -- | details |
#21 | TIME LIMIT EXCEEDED | -- | details |
#22 | TIME LIMIT EXCEEDED | -- | details |
#23 | TIME LIMIT EXCEEDED | -- | details |
#24 | TIME LIMIT EXCEEDED | -- | details |
#25 | TIME LIMIT EXCEEDED | -- | details |
#26 | TIME LIMIT EXCEEDED | -- | details |
#27 | TIME LIMIT EXCEEDED | -- | details |
#28 | TIME LIMIT EXCEEDED | -- | details |
Code
#include <cstdint> #include <bits/stdc++.h> // wtf /* for first in range(1, 1001): for second in range(1, 1001-first-1): for third in range(1, 1001-first-second): if not set([first, second, third]) in doneSets: print repr([first, second, third]), first+second+third, first, second, third while True: pass n = 1000 + 1 for n in range(3, 1001): counter = 0 doneSets = [] for first in range(1, n): if first == second: continue for second in range(1, n-first-1): for third in range(1, n-first-second): if second == third or first == third: continue kek = set([first, second, third]) if not kek in doneSets: doneSets.append(kek) if sum(kek) == (n-1): counter += 1 print n-1, counter n = 1000 for first in range(1, n-1): k = 0 d = 2 i = 8 damn = [0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8] for x in range(14, 1001): if k < 4: i += d k += 1 elif k == 4: i += d + 1 k += 1 elif k == 5: i += d k = 0 d += 1 print x, i damn.append(i) */ std::vector<uint64_t> values = {0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8}; int main() { uint64_t n; std::cin >> n; if (n >= 5) for(;;); uint64_t k = 0; uint64_t d = 2; uint64_t i = 8; uint64_t result = 0; for (uint64_t x = 14; x <= n; ++x) { if (k < 4) { i += d; k += 1; } else if (k == 4) { i += d + 1; k += 1; } else if (k == 5) { i += d; k = 0; d += 1; } result = i; } std::cout << result << std::endl; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 2
Verdict: ACCEPTED
input |
---|
2 |
correct output |
---|
0 |
user output |
---|
0 |
Test 3
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
0 |
user output |
---|
0 |
Test 4
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
0 |
user output |
---|
0 |
Test 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
5 |
correct output |
---|
0 |
user output |
---|
(empty) |
Test 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
6 |
correct output |
---|
1 |
user output |
---|
(empty) |
Test 7
Verdict: TIME LIMIT EXCEEDED
input |
---|
7 |
correct output |
---|
1 |
user output |
---|
(empty) |
Test 8
Verdict: TIME LIMIT EXCEEDED
input |
---|
8 |
correct output |
---|
2 |
user output |
---|
(empty) |
Test 9
Verdict: TIME LIMIT EXCEEDED
input |
---|
9 |
correct output |
---|
3 |
user output |
---|
(empty) |
Test 10
Verdict: TIME LIMIT EXCEEDED
input |
---|
10 |
correct output |
---|
4 |
user output |
---|
(empty) |
Test 11
Verdict: TIME LIMIT EXCEEDED
input |
---|
20 |
correct output |
---|
24 |
user output |
---|
(empty) |
Test 12
Verdict: TIME LIMIT EXCEEDED
input |
---|
30 |
correct output |
---|
61 |
user output |
---|
(empty) |
Test 13
Verdict: TIME LIMIT EXCEEDED
input |
---|
40 |
correct output |
---|
114 |
user output |
---|
(empty) |
Test 14
Verdict: TIME LIMIT EXCEEDED
input |
---|
50 |
correct output |
---|
184 |
user output |
---|
(empty) |
Test 15
Verdict: TIME LIMIT EXCEEDED
input |
---|
60 |
correct output |
---|
271 |
user output |
---|
(empty) |
Test 16
Verdict: TIME LIMIT EXCEEDED
input |
---|
70 |
correct output |
---|
374 |
user output |
---|
(empty) |
Test 17
Verdict: TIME LIMIT EXCEEDED
input |
---|
80 |
correct output |
---|
494 |
user output |
---|
(empty) |
Test 18
Verdict: TIME LIMIT EXCEEDED
input |
---|
90 |
correct output |
---|
631 |
user output |
---|
(empty) |
Test 19
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 |
correct output |
---|
784 |
user output |
---|
(empty) |
Test 20
Verdict: TIME LIMIT EXCEEDED
input |
---|
200 |
correct output |
---|
3234 |
user output |
---|
(empty) |
Test 21
Verdict: TIME LIMIT EXCEEDED
input |
---|
300 |
correct output |
---|
7351 |
user output |
---|
(empty) |
Test 22
Verdict: TIME LIMIT EXCEEDED
input |
---|
400 |
correct output |
---|
13134 |
user output |
---|
(empty) |
Test 23
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 |
correct output |
---|
20584 |
user output |
---|
(empty) |
Test 24
Verdict: TIME LIMIT EXCEEDED
input |
---|
600 |
correct output |
---|
29701 |
user output |
---|
(empty) |
Test 25
Verdict: TIME LIMIT EXCEEDED
input |
---|
700 |
correct output |
---|
40484 |
user output |
---|
(empty) |
Test 26
Verdict: TIME LIMIT EXCEEDED
input |
---|
800 |
correct output |
---|
52934 |
user output |
---|
(empty) |
Test 27
Verdict: TIME LIMIT EXCEEDED
input |
---|
900 |
correct output |
---|
67051 |
user output |
---|
(empty) |
Test 28
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 |
correct output |
---|
82834 |
user output |
---|
(empty) |