Task: | Inversiot |
Sender: | suola_makkara |
Submission time: | 2018-01-07 19:58:16 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.04 s | 1 | details |
#2 | WRONG ANSWER | 0.03 s | 1 | details |
#3 | WRONG ANSWER | 0.05 s | 1 | details |
#4 | WRONG ANSWER | 0.05 s | 1 | details |
#5 | WRONG ANSWER | 0.04 s | 1 | details |
#6 | WRONG ANSWER | 0.05 s | 2 | details |
#7 | WRONG ANSWER | 0.06 s | 2 | details |
#8 | WRONG ANSWER | 0.04 s | 2 | details |
#9 | WRONG ANSWER | 0.05 s | 2 | details |
#10 | WRONG ANSWER | 0.04 s | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <string> using namespace std; int main() { int n, k; cin >> n >> k; string back = ""; string front = ""; for (int i = n - 1; i > -1;) { cout << k << '\n'; if (i <= k) { front.append(to_string(i + 1) + ' '); k -= i; i--; } else { while (i > k) { back = (to_string(i + 1) + ' ').append(back); i--; } } } cout << front.append(back); return 0; }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
5 0 |
correct output |
---|
1 2 3 4 5 |
user output |
---|
0 0 1 2 3 4 5 |
Test 2
Group: 1
Verdict: WRONG ANSWER
input |
---|
5 1 |
correct output |
---|
2 1 3 4 5 |
user output |
---|
1 1 0 2 1 3 4 5 |
Test 3
Group: 1
Verdict: WRONG ANSWER
input |
---|
5 2 |
correct output |
---|
3 1 2 4 5 |
user output |
---|
2 2 0 0 3 1 2 4 5 |
Test 4
Group: 1
Verdict: WRONG ANSWER
input |
---|
5 4 |
correct output |
---|
5 1 2 3 4 |
user output |
---|
4 0 0 5 1 2 3 4 |
Test 5
Group: 1
Verdict: WRONG ANSWER
input |
---|
5 10 |
correct output |
---|
5 4 3 2 1 |
user output |
---|
10 6 3 1 0 ... |
Test 6
Group: 2
Verdict: WRONG ANSWER
input |
---|
100 0 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 7
Group: 2
Verdict: WRONG ANSWER
input |
---|
100 1 |
correct output |
---|
2 1 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
1 1 0 2 1 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 8
Group: 2
Verdict: WRONG ANSWER
input |
---|
100 990 |
correct output |
---|
100 99 98 97 96 95 94 93 92 91... |
user output |
---|
990 891 793 696 600 ... |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
100 1980 |
correct output |
---|
100 99 98 97 96 95 94 93 92 91... |
user output |
---|
1980 1881 1783 1686 1590 ... |
Test 10
Group: 2
Verdict: WRONG ANSWER
input |
---|
100 4950 |
correct output |
---|
100 99 98 97 96 95 94 93 92 91... |
user output |
---|
4950 4851 4753 4656 4560 ... |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 0 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 1 |
correct output |
---|
2 1 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 99999900000 |
correct output |
---|
1000000 999999 999998 999997 9... |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 199999800000 |
correct output |
---|
1000000 999999 999998 999997 9... |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 499999500000 |
correct output |
---|
1000000 999999 999998 999997 9... |
user output |
---|
(empty) |