| Task: | Summa |
| Sender: | Dan Näsman |
| Submission time: | 2019-01-17 13:06:14 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | details |
| #2 | WRONG ANSWER | 0.02 s | details |
| #3 | WRONG ANSWER | 0.01 s | details |
| #4 | WRONG ANSWER | 0.03 s | details |
| #5 | WRONG ANSWER | 0.01 s | details |
| #6 | ACCEPTED | 0.01 s | details |
| #7 | WRONG ANSWER | 0.02 s | details |
| #8 | ACCEPTED | 0.02 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | WRONG ANSWER | 0.02 s | details |
| #11 | WRONG ANSWER | 0.03 s | details |
| #12 | WRONG ANSWER | 0.01 s | details |
| #13 | WRONG ANSWER | 0.02 s | details |
| #14 | WRONG ANSWER | 0.03 s | details |
| #15 | WRONG ANSWER | 0.02 s | details |
| #16 | WRONG ANSWER | 0.02 s | details |
| #17 | WRONG ANSWER | 0.02 s | details |
| #18 | WRONG ANSWER | 0.04 s | details |
| #19 | WRONG ANSWER | 0.04 s | details |
| #20 | WRONG ANSWER | 0.07 s | details |
| #21 | WRONG ANSWER | 0.20 s | details |
| #22 | WRONG ANSWER | 0.45 s | details |
| #23 | WRONG ANSWER | 0.84 s | 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
//============================================================================
// Name : Tehtava1.cpp
// Author : Dan
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/stdc++.h>
using namespace std;
int n;
int c = 1;
vector<int> v;
void haku(int k, int s) {
if(k == 3) {
return;
}
if(s == n) {
c++;
return;
}
for(int j = 0; j < n; j++) {
if(v[j] != -1) {
s = s + v[j];
v[j] = -1;
haku(k + 1, s + v[j]);
v[j] = j + 1;
}
}
}
int main() {
cin >> n;
v.resize(n);
for(int i = 0; i < n; i++) {
v[i] = i + 1;
}
sort(v.begin(), v.end());
haku(0, 0);
cout << c;
return 0;
}
Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 1 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 2 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 2 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 1 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 4 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 2 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 5 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 3 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 7 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 2 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 10 |
| correct output |
|---|
| 4 |
| user output |
|---|
| 1 |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 20 |
| correct output |
|---|
| 24 |
| user output |
|---|
| 3 |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 30 |
| correct output |
|---|
| 61 |
| user output |
|---|
| 1 |
Test 13
Verdict: WRONG ANSWER
| input |
|---|
| 40 |
| correct output |
|---|
| 114 |
| user output |
|---|
| 3 |
Test 14
Verdict: WRONG ANSWER
| input |
|---|
| 50 |
| correct output |
|---|
| 184 |
| user output |
|---|
| 1 |
Test 15
Verdict: WRONG ANSWER
| input |
|---|
| 60 |
| correct output |
|---|
| 271 |
| user output |
|---|
| 1 |
Test 16
Verdict: WRONG ANSWER
| input |
|---|
| 70 |
| correct output |
|---|
| 374 |
| user output |
|---|
| 3 |
Test 17
Verdict: WRONG ANSWER
| input |
|---|
| 80 |
| correct output |
|---|
| 494 |
| user output |
|---|
| 1 |
Test 18
Verdict: WRONG ANSWER
| input |
|---|
| 90 |
| correct output |
|---|
| 631 |
| user output |
|---|
| 3 |
Test 19
Verdict: WRONG ANSWER
| input |
|---|
| 100 |
| correct output |
|---|
| 784 |
| user output |
|---|
| 3 |
Test 20
Verdict: WRONG ANSWER
| input |
|---|
| 200 |
| correct output |
|---|
| 3234 |
| user output |
|---|
| 3 |
Test 21
Verdict: WRONG ANSWER
| input |
|---|
| 300 |
| correct output |
|---|
| 7351 |
| user output |
|---|
| 1 |
Test 22
Verdict: WRONG ANSWER
| input |
|---|
| 400 |
| correct output |
|---|
| 13134 |
| user output |
|---|
| 3 |
Test 23
Verdict: WRONG ANSWER
| input |
|---|
| 500 |
| correct output |
|---|
| 20584 |
| user output |
|---|
| 3 |
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) |
