Task: | Bittijono |
Sender: | inkeri |
Submission time: | 2016-10-07 15:14:01 +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.14 s | 2 | details |
#3 | ACCEPTED | 0.14 s | 3 | details |
Code
#include <iostream>#include <math.h>#include <vector>using namespace std;int getBitti(long long luku) {int bitit[2][2] = {0, 1, 1, 0};long long length = 2;while (length * 2 < luku) {length *= 2;}luku -= length;int bitti = 1;while (luku <= length / 2) {length /= 2;}while (length > 2) {length /= 2;luku -= length;if (bitti == 0) {bitti = 1;}else {bitti = 0;}while (luku <= length / 2) {length /= 2;}}return bitit[bitti][luku - 1];}int getBitti2(int luku) {int length = (int) pow(2, ceil(log2(luku)));int bitit[2][2] = {0, 1, 1, 0};int bitti = 0;while (length > 2) {length /= 2;luku -= length;if (bitti == 0) {bitti = 1;}else {bitti = 0;}while (luku <= length / 2) {length /= 2;}}return bitit[bitti][luku - 1];}int main() {std::ios_base::sync_with_stdio(false);// long long amount, beginning;// cin >> amount >> beginning;// for (long long i = beginning; i < (beginning + amount); i ++) {// int bitti1 = getBitti(i, 0);// cout << bitti1;// }int amount;cin >> amount;for (int i = 0; i < amount; i++) {long long luku;cin >> luku;int bitti;if (luku <= 100) {bitti = getBitti2(luku);}else {bitti = getBitti(luku);}cout << bitti << "\n";}}
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 ... |