QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#373079 | #5103. Fair Division | RobeZH# | WA | 83ms | 3820kb | C++23 | 1.3kb | 2024-04-01 01:58:29 | 2024-04-01 01:58:30 |
Judging History
answer
#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
// #include<atcoder/all>
#define FR(i,n) for(int i=0;i<n;++i)
#define eb emplace_back
#define st first
#define nd second
#define x1 fxxkcjb
#define y1 fxxkyzc
#define x2 fxxkzzy
#define y2 fxxknitit
using namespace std;
namespace R=ranges;
template<typename T>
using func=function<T>;
template<typename T>
using vec=vector<T>;
using ll=long long;
using ld=long double;
using i128=__int128;
using pii=pair<int,int>;
const ll inf=ll(1e18)+7;
i128 pw(ll x,ll y){
i128 s=1;
for(;y;y>>=1,x=x*x)
if(y&1)s=s*x;
return s;
}
void sol(){
ll n,m;cin>>n>>m;
for(ll q=2;pw(q,n-1)<=m;++q){
for(ll p=1;p<q;++p){
i128 val=pw(q,n)-pw(q-p,n);
val/=p;
// cerr<<(ll)pw(q,n)<<endl;
// cerr<<p<<" "<<q<<" "<<(ll)val<<endl;
if(m%val==0){
cout<<p<<" "<<q<<"\n";
return;
}
}
}
cout<<"impossible\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
sol();
return 0;
}
/*
6 6
5 6 3
6 2 2
1 2 1
2 3 2
2 4 3
4 5 1
5
1 3 1
1 3 3
1 3 5
2 6 4
2 4 0
*/
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3544kb
input:
13 382475111752106101
output:
17 28
result:
ok single line: '17 28'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3816kb
input:
15 227368755046033249
output:
13 14
result:
ok single line: '13 14'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
27 72027091647987988
output:
1 4
result:
ok single line: '1 4'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3488kb
input:
12 817283057828223168
output:
10 17
result:
ok single line: '10 17'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
40 279103330129289325
output:
1 2
result:
ok single line: '1 2'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
9 200754090585004509
output:
27 31
result:
ok single line: '27 31'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
13 145272043713167318
output:
11 19
result:
ok single line: '11 19'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
13 330339892079732537
output:
3 5
result:
ok single line: '3 5'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
8 518312274023062851
output:
35 81
result:
ok single line: '35 81'
Test #11:
score: 0
Accepted
time: 1ms
memory: 3528kb
input:
8 226575677743060500
output:
3 37
result:
ok single line: '3 37'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
22 947676267664323372
output:
5 6
result:
ok single line: '5 6'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3488kb
input:
8 884152939068009488
output:
32 87
result:
ok single line: '32 87'
Test #14:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
10 334992255296783634
output:
1 2
result:
ok single line: '1 2'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
9 387165762000719100
output:
9 26
result:
ok single line: '9 26'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
13 966426794141592430
output:
5 23
result:
ok single line: '5 23'
Test #17:
score: 0
Accepted
time: 1ms
memory: 3568kb
input:
30 3882204456
output:
impossible
result:
ok single line: 'impossible'
Test #18:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
17 388292937745500
output:
impossible
result:
ok single line: 'impossible'
Test #19:
score: 0
Accepted
time: 3ms
memory: 3584kb
input:
7 77777777777777777
output:
impossible
result:
ok single line: 'impossible'
Test #20:
score: 0
Accepted
time: 1ms
memory: 3760kb
input:
6 1
output:
impossible
result:
ok single line: 'impossible'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
6 6
output:
impossible
result:
ok single line: 'impossible'
Test #22:
score: 0
Accepted
time: 1ms
memory: 3536kb
input:
6 666666666
output:
impossible
result:
ok single line: 'impossible'
Test #23:
score: 0
Accepted
time: 83ms
memory: 3540kb
input:
6 982698952174251648
output:
3966 3967
result:
ok single line: '3966 3967'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
6 998905704529596381
output:
1 2
result:
ok single line: '1 2'
Test #25:
score: 0
Accepted
time: 79ms
memory: 3776kb
input:
6 1000000000000000000
output:
impossible
result:
ok single line: 'impossible'
Test #26:
score: 0
Accepted
time: 3ms
memory: 3812kb
input:
7 983120539989861547
output:
996 997
result:
ok single line: '996 997'
Test #27:
score: 0
Accepted
time: 1ms
memory: 3760kb
input:
9 999999999999999998
output:
impossible
result:
ok single line: 'impossible'
Test #28:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
9 999999999999999999
output:
9 10
result:
ok single line: '9 10'
Test #29:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
9 1000000000000000000
output:
impossible
result:
ok single line: 'impossible'
Test #30:
score: 0
Accepted
time: 1ms
memory: 3564kb
input:
10 983231815060933795
output:
75 97
result:
ok single line: '75 97'
Test #31:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
11 725231960190597311
output:
60 61
result:
ok single line: '60 61'
Test #32:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
12 897612484786617600
output:
1 2
result:
ok single line: '1 2'
Test #33:
score: 0
Accepted
time: 0ms
memory: 3812kb
input:
14 897612484786617600
output:
impossible
result:
ok single line: 'impossible'
Test #34:
score: 0
Accepted
time: 1ms
memory: 3540kb
input:
59 576460752303423487
output:
1 2
result:
ok single line: '1 2'
Test #35:
score: -100
Wrong Answer
time: 1ms
memory: 3584kb
input:
100 100000000000000
output:
1 2
result:
wrong answer 1st lines differ - expected: 'impossible', found: '1 2'