Task: | Bittijono |
Sender: | mika |
Submission time: | 2016-10-07 01:56:43 +0300 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.06 s | 1 | details |
#2 | WRONG ANSWER | 0.15 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream> #include <vector> #include <string> #include <algorithm> using namespace std; string flip(string s) { string out = ""; for (std::size_t i = 0; i < s.length(); i++) { if (s[i] == '0') out += '1'; if (s[i] == '1') out += '0'; } return out; } string bittijono = "0"; char hankiBitti(std::size_t paikka) { if (bittijono.size() > paikka) return bittijono[paikka - 1]; string out = "0"; while(out.size() < paikka) { out += flip(out); } if (out.size() > bittijono.size()) bittijono = out; return out[paikka - 1]; } int main() { int count; cin >> count; vector<int> n; while (count > 0) { int num; cin >> num; n.push_back(num); count--; } std::sort(n.begin(), n.end()); hankiBitti(n[n.size() - 1]); for (std::size_t i = 0; i < n.size(); i++) { cout << hankiBitti(n[i]) << endl; } return 0; }
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 1 1 0 0 ... |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 565433 141881 120108 825392 ... |
correct output |
---|
1 1 0 0 1 ... |
user output |
---|
0 1 0 1 0 ... |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
correct output |
---|
0 1 1 1 1 ... |
user output |
---|
(empty) |