| Task: | Bittijono |
| Sender: | 3isagreatnumber |
| Submission time: | 2016-10-06 16:53:41 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | 1 | details |
| #2 | WRONG ANSWER | 0.10 s | 2 | details |
| #3 | RUNTIME ERROR | 1.27 s | 3 | details |
Code
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
#define ull unsigned long long
using namespace std;
string gen(ull);
string inv(string);
int main(void)
{
ull n;
cin >> n;
vector<ull> new_ks;
ull max = 0;
ull k;
for (ull i = 0; i < n; i++)
{
cin >> k;
ull max_l = pow(2, ceil((log(k)/log(2))+1));
if (max_l > max) max = max_l;
new_ks.push_back(max_l - k);
}
string s = gen(max);
for (ull i = 0; i < n; i++)
{
cout << s[new_ks[i]] << '\n';
}
}
string gen(ull k_max)
{
ull n = ceil(log(float(k_max))/log(2.0))+1;
string s = "0";
for (ull i = 1; i < n; i++)
{
s+=inv(s);
}
return s;
}
string inv(string s)
{
for (ull i = 0, l = s.length(); i < l; i++)
{
if (s[i] == '1') s[i] = '0';
else s[i] = '1';
}
return s;
}
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 0 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 0 1 0 ... |
Test 3
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
| correct output |
|---|
| 0 1 1 1 1 ... |
| user output |
|---|
| (empty) |
