Task: | Bittijono |
Sender: | FSMnArmosta |
Submission time: | 2016-10-03 10:45:16 +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.06 s | 1 | details |
#2 | ACCEPTED | 0.16 s | 2 | details |
#3 | ACCEPTED | 0.24 s | 3 | details |
Code
#include <iostream> #include <vector> using namespace std; long long int powOf2(long long int x){ long long int i = 1; while(i < x) i = i*2; return i/2; } bool bitAt(long long int x){ if(x == 0) return false; else if(x == 1) return true; else if(x == 2) return true; return !bitAt(x-powOf2(x+1)); } int main(int argc, char *argv[]) { long long int lines = 0; std::cin >> lines; long long int i = 0; while(i < lines){ long long int k = 0; std::cin >> k; if(bitAt(k-1)){ std::cout << "1" << std::endl; }else{ std::cout << "0" << std::endl; } i = i + 1; } 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: ACCEPTED
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
0 1 1 1 1 ... |