QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#385539 | #5103. Fair Division | SolitaryDream# | WA | 3ms | 3864kb | C++17 | 1000b | 2024-04-10 20:53:16 | 2024-04-10 20:53:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
typedef long long ll;
__int128 Fast(__int128 x,int b) {
__int128 t=1;
for(; b; b>>=1,x*=x) if(b&1) t*=x;
return t;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
ll m;
cin >> n >> m;
__int128 w=1;
FOR(i,1,n-1) {
w=w*2;
if(w>m) {
cout << "-1\n";
return 0;
}
}
int P=-1,Q;
FOR(p,2,10000) {
if(Fast(p,n-1)>m) break;
FOR(q,1,p-1) {
__int128 r=(Fast(p,n)-Fast(q,n))/(p-q);
if(r>m) break;
if(m%r==0) {
if(P==-1 || (P==p && q>Q)) {
P=p;
Q=q;
}
}
}
}
if(P<0) cout << "impossible\n";
else cout << P-Q << ' ' << P << '\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3624kb
input:
13 382475111752106101
output:
17 28
result:
ok single line: '17 28'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
15 227368755046033249
output:
13 14
result:
ok single line: '13 14'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
27 72027091647987988
output:
1 4
result:
ok single line: '1 4'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
12 817283057828223168
output:
10 17
result:
ok single line: '10 17'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
40 279103330129289325
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
9 200754090585004509
output:
27 31
result:
ok single line: '27 31'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
13 145272043713167318
output:
11 19
result:
ok single line: '11 19'
Test #9:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
13 330339892079732537
output:
3 5
result:
ok single line: '3 5'
Test #10:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
8 518312274023062851
output:
35 81
result:
ok single line: '35 81'
Test #11:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
8 226575677743060500
output:
3 37
result:
ok single line: '3 37'
Test #12:
score: 0
Accepted
time: 1ms
memory: 3860kb
input:
22 947676267664323372
output:
5 6
result:
ok single line: '5 6'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
8 884152939068009488
output:
32 87
result:
ok single line: '32 87'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
10 334992255296783634
output:
1 2
result:
ok single line: '1 2'
Test #15:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
9 387165762000719100
output:
9 26
result:
ok single line: '9 26'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
13 966426794141592430
output:
5 23
result:
ok single line: '5 23'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3504kb
input:
30 3882204456
output:
impossible
result:
ok single line: 'impossible'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3508kb
input:
17 388292937745500
output:
impossible
result:
ok single line: 'impossible'
Test #19:
score: 0
Accepted
time: 3ms
memory: 3852kb
input:
7 77777777777777777
output:
impossible
result:
ok single line: 'impossible'
Test #20:
score: -100
Wrong Answer
time: 0ms
memory: 3864kb
input:
6 1
output:
-1
result:
wrong answer 1st lines differ - expected: 'impossible', found: '-1'