Task: | Bittijono |
Sender: | OulaK |
Submission time: | 2016-10-03 18:57:09 +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.08 s | 2 | details |
#3 | ACCEPTED | 0.12 s | 3 | details |
Code
#include <iostream> using namespace std; typedef unsigned long long ull; inline unsigned int count(ull n) { unsigned int c = 0; while(n != 0) { n &= n - 1; c++; } return c; } int main() { unsigned int n; cin >> n; ull k[n]; for(unsigned int i = 0; i < n; i++) cin >> k[i]; for(unsigned int i = 0; i < n; i++) cout << (((count(k[i] - 1) % 2 == 0) ? 0 : 1)) << "\n"; 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 ... |