Task: | Bittijono |
Sender: | MääVaa |
Submission time: | 2016-10-03 17:24:32 +0300 |
Language: | Scala |
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.40 s | 1 | details |
#2 | WRONG ANSWER | 0.40 s | 2 | details |
#3 | WRONG ANSWER | 0.40 s | 3 | details |
Code
import scala.io.StdIn object Kisa extends App { println(binNum(StdIn.readInt)) def binNum(k: Long): Long = { if(k == 1) 0 else (1 - binNum(remPow(k))).toLong } def remPow(i: Long) = { var pow = 0 while(math.pow(2,pow+1)<i)pow += 1 i - math.pow(2,pow).toLong } }
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 |