Task: | Bittijono |
Sender: | tuomask |
Submission time: | 2016-10-06 21:36:27 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 10 |
#2 | ACCEPTED | 19 |
#3 | ACCEPTED | 71 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.12 s | 2 | details |
#3 | ACCEPTED | 0.19 s | 3 | details |
Code
#include <iostream>#include <sstream>using namespace std;int main() {unsigned int input_length;cin >> input_length;for (unsigned int i=0; i<input_length; i++) {unsigned long index;cin >> index;// finding next power of twounsigned long length = 2;while (length < index) {length *= 2;}unsigned int times = 1;while (index > 2) {length /= 2;if (index > length) {index = index - length;times++;}}if (times % 2 == 0) {cout << index%2 << '\n';} else {cout << index-1 << '\n';}}cout << endl;}
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: ACCEPTED
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
0 1 1 1 1 ... |