CSES - Datatähti 2017 alku - Results
Submission details
Task:Bittijono
Sender:ankka22
Submission time:2016-10-13 18:44:09 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.05 s1details
#20.22 s2details
#3--3details

Code

#include <iostream>
#include <math.h>
int main() {
	int n;
	int bits[4] = {0, 1, 1, 0};
	long long int v[100000];
	std::cin >> n;
	long long int cur;
	bool og = true;
	for (int i = 0; i < n; i++) {
		og = true;
		std::cin >> cur;
		while (cur > 4) {
			int m = pow(2, floor(log2(cur)));
			cur -= m;
			og = !og;
		}
		v[i] = bits[(int)cur - 1];
		if (!og) v[i] = !v[i];
	}
	for (int i = 0; i < n; i++) {
		std::cout << v[i] << std::endl;
	}
	return 0;
}

Test details

Test 1

Group: 1

Verdict:

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:

input
100000
565433
141881
120108
825392
...

correct output
1
1
0
0
1
...

user output
1
1
0
1
1
...

Test 3

Group: 3

Verdict:

input
100000
374768524402011755
937067109466254318
389256426086302899
932585725667010169
...

correct output
0
1
1
1
1
...

user output
(empty)