QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #68825 | #5103. Fair Division | chenshi# | WA | 239ms | 17224kb | C++14 | 558b | 2022-12-21 10:02:39 | 2022-12-21 10:02:41 |
Judging History
answer
#include<cstdio>
using namespace std;
const __int128 E=1e36;
int n,cnt=1;__int128 pw[1000010];long long m;
inline void mul(__int128&a,__int128 b){if(a>E/b) a=E;else a*=b;}
inline __int128 qp(__int128 b,int f){__int128 res=1;for(;f;f>>=1,mul(b,b)) if(f&1) mul(res,b);return res;}
int main(){
scanf("%d%lld",&n,&m);
for(;(pw[cnt]=qp(cnt,n))<E;++cnt);
for(int i=1;i<=cnt;++i) for(int j=1;j<i&&(i<=1000||pw[i]-pw[i-j]<=m*(__int128)j);++j)
if(m*(__int128)j%(pw[i]-pw[i-j])==0){printf("%d %d\n",j,i);return 0;}
printf("impossible");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 1696kb
input:
13 382475111752106101
output:
17 28
result:
ok single line: '17 28'
Test #2:
score: 0
Accepted
time: 1ms
memory: 1720kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #3:
score: 0
Accepted
time: 1ms
memory: 1704kb
input:
15 227368755046033249
output:
13 14
result:
ok single line: '13 14'
Test #4:
score: 0
Accepted
time: 1ms
memory: 1676kb
input:
27 72027091647987988
output:
1 4
result:
ok single line: '1 4'
Test #5:
score: 0
Accepted
time: 1ms
memory: 1664kb
input:
12 817283057828223168
output:
10 17
result:
ok single line: '10 17'
Test #6:
score: 0
Accepted
time: 1ms
memory: 1704kb
input:
40 279103330129289325
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 3ms
memory: 1848kb
input:
9 200754090585004509
output:
27 31
result:
ok single line: '27 31'
Test #8:
score: 0
Accepted
time: 1ms
memory: 1684kb
input:
13 145272043713167318
output:
11 19
result:
ok single line: '11 19'
Test #9:
score: 0
Accepted
time: 1ms
memory: 1604kb
input:
13 330339892079732537
output:
3 5
result:
ok single line: '3 5'
Test #10:
score: 0
Accepted
time: 6ms
memory: 2100kb
input:
8 518312274023062851
output:
35 81
result:
ok single line: '35 81'
Test #11:
score: 0
Accepted
time: 6ms
memory: 2200kb
input:
8 226575677743060500
output:
3 37
result:
ok single line: '3 37'
Test #12:
score: 0
Accepted
time: 1ms
memory: 1592kb
input:
22 947676267664323372
output:
5 6
result:
ok single line: '5 6'
Test #13:
score: 0
Accepted
time: 6ms
memory: 2172kb
input:
8 884152939068009488
output:
32 87
result:
ok single line: '32 87'
Test #14:
score: 0
Accepted
time: 2ms
memory: 1752kb
input:
10 334992255296783634
output:
1 2
result:
ok single line: '1 2'
Test #15:
score: 0
Accepted
time: 3ms
memory: 1856kb
input:
9 387165762000719100
output:
9 26
result:
ok single line: '9 26'
Test #16:
score: 0
Accepted
time: 1ms
memory: 1688kb
input:
13 966426794141592430
output:
5 23
result:
ok single line: '5 23'
Test #17:
score: 0
Accepted
time: 1ms
memory: 1656kb
input:
30 3882204456
output:
impossible
result:
ok single line: 'impossible'
Test #18:
score: 0
Accepted
time: 1ms
memory: 1592kb
input:
17 388292937745500
output:
impossible
result:
ok single line: 'impossible'
Test #19:
score: 0
Accepted
time: 23ms
memory: 3792kb
input:
7 77777777777777777
output:
impossible
result:
ok single line: 'impossible'
Test #20:
score: 0
Accepted
time: 117ms
memory: 17224kb
input:
6 1
output:
impossible
result:
ok single line: 'impossible'
Test #21:
score: 0
Accepted
time: 122ms
memory: 17168kb
input:
6 6
output:
impossible
result:
ok single line: 'impossible'
Test #22:
score: 0
Accepted
time: 122ms
memory: 17136kb
input:
6 666666666
output:
impossible
result:
ok single line: 'impossible'
Test #23:
score: -100
Wrong Answer
time: 239ms
memory: 17220kb
input:
6 982698952174251648
output:
impossible
result:
wrong answer 1st lines differ - expected: '3966 3967', found: 'impossible'