| Task: | Kolikot |
| Sender: | fergusq |
| Submission time: | 2016-10-06 21:18:53 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 57 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 22 |
| #2 | ACCEPTED | 35 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | 1 | details |
| #2 | ACCEPTED | 0.05 s | 1 | details |
| #3 | ACCEPTED | 0.06 s | 1 | details |
| #4 | ACCEPTED | 0.06 s | 1 | details |
| #5 | ACCEPTED | 0.06 s | 1 | details |
| #6 | ACCEPTED | 0.06 s | 2 | details |
| #7 | ACCEPTED | 0.05 s | 2 | details |
| #8 | ACCEPTED | 0.07 s | 2 | details |
| #9 | ACCEPTED | 0.05 s | 2 | details |
| #10 | ACCEPTED | 0.06 s | 2 | details |
| #11 | RUNTIME ERROR | 0.41 s | 3 | details |
| #12 | ACCEPTED | 0.06 s | 3 | details |
| #13 | ACCEPTED | 0.09 s | 3 | details |
| #14 | RUNTIME ERROR | 0.45 s | 3 | details |
| #15 | RUNTIME ERROR | 0.46 s | 3 | details |
| #16 | RUNTIME ERROR | 0.34 s | 3 | details |
Code
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int t[n];
for (int i = 0; i < n; i++) {
int k;
cin >> k;
t[i] = k;
}
int m = n > 100 ? 1000 : 1000000;
bool p[m][n+1];
for (int i = 0; i <= n; i++) p[0][i] = true;
for (int i = 1; true; i++) {
p[i][0] = false;
for (int j = 1; j <= n; j++) {
p[i][j] = p[i][j-1];
if (i >= t[j-1]) p[i][j] = p[i][j] || p[i - t[j-1]][j-1];
if (j == n && !p[i][j]) {
cout << i << endl;
return 0;
}
}
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 5 3 1 4 5 1 3 2 2 3 |
| correct output |
|---|
| 30 |
| user output |
|---|
| 30 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 3 5 5 4 5 4 5 5 5 3 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 9 2 8 7 10 7 1 5 2 |
| correct output |
|---|
| 62 |
| user output |
|---|
| 62 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 7 4 6 3 9 7 4 4 7 7 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 8 2 1 7 9 7 5 2 4 5 |
| correct output |
|---|
| 51 |
| user output |
|---|
| 51 |
Test 6
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ... |
| correct output |
|---|
| 269 |
| user output |
|---|
| 269 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 8
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 678 999 374 759 437 390 832 54... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 862 537 633 807 666 248 237 5 ... |
| correct output |
|---|
| 30 |
| user output |
|---|
| 30 |
Test 10
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 874 302 384 920 76 28 762 163 ... |
| correct output |
|---|
| 41765 |
| user output |
|---|
| 41765 |
Test 11
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ... |
| correct output |
|---|
| 299640 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 13
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 98146842 766872135 84108268 28... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 14
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 932032495 1 849176169 78948957... |
| correct output |
|---|
| 29970 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 35894853 796619259 699878597 4... |
| correct output |
|---|
| 44965249639582 |
| user output |
|---|
| (empty) |
Test 16
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 930494676 960662779 904422858 ... |
| correct output |
|---|
| 800020001 |
| user output |
|---|
| (empty) |