QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#136480 | #4186. Card Trading | RetiredButNotTired# | WA | 1ms | 3584kb | C++17 | 747b | 2023-08-08 20:33:16 | 2023-08-08 20:33:21 |
Judging History
answer
// Hey there.. I love you <3
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
mt19937 rnd(time(nullptr));
const int N = 1e5 + 5, mod = 1e9 + 7;
const double pi = acos(-1), eps = 1e-10;
void work() {
ll x;
cin >> x;
--x;
int b = __builtin_popcountll(x);
if (b > 2)
cout << "impossible" << endl;
else
cout << (x & -x) + 1 << endl;
}
void init() {
cin.tie(nullptr);
istream::sync_with_stdio(false);
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
}
int main() {
init();
int testCases = 1;
// cin >> testCases;
while (testCases--) work();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3584kb
input:
5 12.00 0 3 11.99 2 0 11.98 5 0 10.00 1 0 12.01 0 6
output:
5
result:
wrong output format Unexpected end of file - token expected