QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#649095 | #8339. Rooted Tree | zzhrnoicansolve# | AC ✓ | 1427ms | 3744kb | C++17 | 987b | 2024-10-17 21:36:00 | 2024-10-17 21:36:03 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define pii pair<int,int>
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"
#define pb push_back
#define lowbit(x) ((x) & (-x))
using namespace std;
const int INF = 0x3f3f3f3f;
const double EPS=1e-10;
const double Pi=3.1415926535897;
const int mod=1e9+9;
const int maxn=1e5+5;
ll m, k;
ll e;
ll ans;
ll ksm(ll a, ll n){
ll res=1;
a%=mod;
while(n){
if(n&1) res=res%mod*a%mod;
a=a%mod*a%mod;
n>>=1;
}
return res;
}
ll inv(ll a){
return ksm(a, mod-2);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>m>>k;
e=0, ans=0;
for(int i=1;i<=k;i++){
ans=(ans+m*(e*inv((m-1)*(i-1)+1)%mod+1)%mod)%mod;
e=((m-1)*i+1)%mod*inv((m-1)*(i-1)+1)%mod*e+m;
e%=mod;
}
cout<<ans<<"\n";
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3744kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 88ms
memory: 3672kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 959ms
memory: 3668kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 1043ms
memory: 3736kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 586ms
memory: 3672kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 1418ms
memory: 3688kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 254ms
memory: 3620kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 774ms
memory: 3644kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 459ms
memory: 3612kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 417ms
memory: 3732kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 1229ms
memory: 3688kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 1422ms
memory: 3728kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 1427ms
memory: 3612kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 1426ms
memory: 3668kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed