QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#54680 | #4184. Amusement Arcade | Sa3tElSefr# | WA | 3ms | 3696kb | C++ | 1.3kb | 2022-10-10 03:53:43 | 2022-10-10 03:53:46 |
Judging History
answer
/// tban lecodes el bosta2
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for(int i = a; i < b; i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll
using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;
const int N = 2e5+5, LG = 18, MOD = 1e9+7;
const long double PI = acos(-1);
const long double EPS = 1e-7;
const string TARGET = "WALDO";
bool check(ll x) {return x & (x-1);}
void doWork() {
ll n;
cin >> n;
for(int p = 1; p <= n; p *= 2) {
if(!check(n-p-1)) {
cout << p + 1 << '\n';
return;
}
}
cout << "impossible\n";
}
int32_t main() {
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif // ONLINE_JUDGE
int t = 1;
// cin >> t;
while (t--) {
doWork();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
input:
7
output:
3
result:
ok
Test #2:
score: 0
Accepted
time: 2ms
memory: 3696kb
input:
15
output:
impossible
result:
ok
Test #3:
score: 0
Accepted
time: 2ms
memory: 3640kb
input:
19
output:
3
result:
ok
Test #4:
score: 0
Accepted
time: 2ms
memory: 3656kb
input:
2049
output:
1025
result:
ok
Test #5:
score: 0
Accepted
time: 2ms
memory: 3560kb
input:
32769
output:
16385
result:
ok
Test #6:
score: 0
Accepted
time: 1ms
memory: 3696kb
input:
536870913
output:
268435457
result:
ok
Test #7:
score: 0
Accepted
time: 2ms
memory: 3636kb
input:
35184372088833
output:
17592186044417
result:
ok
Test #8:
score: 0
Accepted
time: 2ms
memory: 3524kb
input:
2251799813685249
output:
1125899906842625
result:
ok
Test #9:
score: 0
Accepted
time: 2ms
memory: 3656kb
input:
576460752303423489
output:
288230376151711745
result:
ok
Test #10:
score: 0
Accepted
time: 3ms
memory: 3604kb
input:
1027
output:
3
result:
ok
Test #11:
score: 0
Accepted
time: 2ms
memory: 3608kb
input:
2081
output:
33
result:
ok
Test #12:
score: 0
Accepted
time: 3ms
memory: 3692kb
input:
34393292801
output:
33554433
result:
ok
Test #13:
score: -100
Wrong Answer
time: 2ms
memory: 3632kb
input:
1
output:
impossible
result:
wrong output format Expected integer, but "impossible" found