QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#431246 | #4184. Amusement Arcade | kevinyang# | AC ✓ | 0ms | 3724kb | C++14 | 630b | 2024-06-05 07:38:03 | 2024-06-05 07:38:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
map<int,int>hm;
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
{
hm[1] = 1;
int i = 3;
while(i < (int)2e18){
hm[i] = 1;
i*=2;
i--;
}
}
if(hm[n]){
cout << "1\n";
return 0;
}
int i = 3;
while(i <= n){
if(!hm[n-i+1]){
i*=2; i--;
}
else{
cout << i << '\n';
return 0;
}
}
cout << "impossible\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3724kb
input:
7
output:
3
result:
ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
15
output:
impossible
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
19
output:
3
result:
ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
2049
output:
1
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
32769
output:
1
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
536870913
output:
1
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
35184372088833
output:
1
result:
ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
2251799813685249
output:
1
result:
ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
576460752303423489
output:
1
result:
ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
1027
output:
3
result:
ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
2081
output:
33
result:
ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
34393292801
output:
33554433
result:
ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
1
output:
1
result:
ok
Test #14:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
281543696187393
output:
68719476737
result:
ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
576460752303423491
output:
3
result:
ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
576460752336977921
output:
33554433
result:
ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
576461851815051265
output:
1099511627777
result:
ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
864691128455135233
output:
288230376151711745
result:
ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
635
output:
impossible
result:
ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
4537995
output:
impossible
result:
ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
4795018843
output:
impossible
result:
ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
5268828738869
output:
impossible
result:
ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
3859135424551273
output:
impossible
result:
ok
Test #24:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
3
output:
1
result:
ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
63913510461995523
output:
impossible
result:
ok
Test #26:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
341683697045680425
output:
impossible
result:
ok
Test #27:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
999999999999999999
output:
impossible
result:
ok
Test #28:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
5
output:
1
result:
ok
Test #29:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
9
output:
1
result:
ok
Test #30:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
11
output:
3
result:
ok
Test #31:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
13
output:
5
result:
ok
Test #32:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
17
output:
1
result:
ok