QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#426882 | #4184. Amusement Arcade | rania__# | WA | 0ms | 3748kb | C++14 | 867b | 2024-05-31 23:49:11 | 2024-05-31 23:49:11 |
Judging History
answer
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define double long double
#define f first
#define s second
#define pb push_back
#define pp push
#define ceill(x,y) ((x/y)+(x%y!=0)*(x/abs(x)*y/abs(y)<0?0:1))
#define floorr(x,y) ((x/y)+(x%y!=0)*(x/abs(x)*y/abs(y)<0?-1:0))
#define YN(x) cout<<(x?"YES\n":"NO\n");
#define Yn(x) cout<<(x?"Yes\n":"No\n");
#define yn(x) cout<<(x?"yes\n":"no\n");
const int MAAX=1e18;
const int MOD=1e9+7;
const int MAX=1e9;
in main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int tc=1;
// cin>>tc;
while(tc--){
int n;
cin>>n;
for(int i=0;i<61;i++){
if(__builtin_popcountll(n-(1<<i)-1)==1){
cout<<(1<<i)+1<<"\n";
return 0;
}
}
cout<<"impossbile\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
7
output:
3
result:
ok
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3748kb
input:
15
output:
impossbile
result:
wrong answer WA: supposed to be impossible, team says otherwise