Task: | Bittijono |
Sender: | ooh |
Submission time: | 2016-10-04 12:53:58 +0300 |
Language: | C++ |
Status: | READY |
Result: | 29 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 10 |
#2 | ACCEPTED | 19 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.19 s | 2 | details |
#3 | WRONG ANSWER | 0.40 s | 3 | details |
Code
#include <iostream> #include <cmath> using std::cout; using std::endl; using std::cin; int main (int argc, char** argv) { long n; cin >> n; for (; n>0; n--) { long pos; cin >> pos; long i = 0; while (pos != 1) { long x = floor(log2(pos)); long delta = pos - exp2(x); // cout << "x=" << x << " delta=" << delta << " pos=" << pos << endl; if (delta == 0) { pos = exp2(x-1); } else { pos = delta; } i++; } cout << (i%2 == 0 ? "0" : "1") << endl; } return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
100 62 9 12 73 ... |
correct output |
---|
1 1 1 0 1 ... |
user output |
---|
1 1 1 0 1 ... |
Test 2
Group: 2
Verdict: ACCEPTED
input |
---|
100000 565433 141881 120108 825392 ... |
correct output |
---|
1 1 0 0 1 ... |
user output |
---|
1 1 0 0 1 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
1 1 0 0 1 ... |