| Task: | Bittijono |
| Sender: | while(false) |
| Submission time: | 2016-10-12 22:46:56 +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.66 s | 2 | details |
| #3 | WRONG ANSWER | 0.88 s | 3 | details |
Code
//#include "stdafx.h"
#include <iostream>
#include <cmath>
using namespace std;
int a;
long long b;
int main()
{
cin >> a;
for (int i = a; i > 0; i--) {
cin >> b;
long long n = 63;
int s = 0;
while (n>=0) {
if (b>pow((long long)2,n)) {
if (s == 0) { s = 1; }
else { s = 0; }
b -= pow((long long)2, n);
}
n--;
}
cout << s << '\n';
}
//cin >> a;
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 ... |
