Task: | Bittijono |
Sender: | kapesu8 |
Submission time: | 2016-10-07 12:29:34 +0300 |
Language: | C++ |
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.06 s | 1 | details |
#2 | WRONG ANSWER | 0.17 s | 2 | details |
#3 | WRONG ANSWER | 0.20 s | 3 | details |
Code
#include <iostream> #include <string> #include <math.h> #define uint unsigned int void p(int counter,long long x,long long s) { if(s == 1) { long long a = (long long)(pow(double(-1),counter)); if(a == 1) std::cout << '1'; else std::cout << '0'; } else p(counter+1,x - s/2,s/2); } int main() { int count; std::cin >> count; for(int a = 0;a < count;a++) { long long this_int; std::cin >> this_int; double closest = pow(2,ceil(log(double(this_int))/log(double(2)))); p(1,this_int,closest); if(a != count - 1) std::cout << '\n'; } return 0; }
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 0 0 1 1 ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 565433 141881 120108 825392 ... |
correct output |
---|
1 1 0 0 1 ... |
user output |
---|
0 0 1 0 0 ... |
Test 3
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
1 0 1 0 1 ... |