Task: | Bittijono |
Sender: | joshimasta |
Submission time: | 2016-10-05 00:41:29 +0300 |
Language: | Python3 |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.07 s | 1 | details |
#2 | WRONG ANSWER | 0.06 s | 2 | details |
#3 | WRONG ANSWER | 0.07 s | 3 | details |
Code
def turn(l,i): return l[:i+1][::-1]+l[i+1:] input() x = list(map(int, input().split())) s = x[:] s.sort() r = "" length = 0 i = len(x) b = True while b: if x == s: b = False else: length += 2 r += str(x.index(i)+1)+" " x = turn(x,x.index(i)) r += str(i)+" " x = turn(x,i-1) i -= 1 r = r[:-1] print(length) print(r)
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
100 62 9 12 73 ... |
correct output |
---|
1 1 1 0 1 ... |
user output |
---|
0 |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 565433 141881 120108 825392 ... |
correct output |
---|
1 1 0 0 1 ... |
user output |
---|
0 |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
0 |