QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #414616 | #8339. Rooted Tree | MN2016# | AC ✓ | 1376ms | 160196kb | C++14 | 708b | 2024-05-19 12:06:51 | 2024-05-19 12:06:51 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=10000010,mod=1000000009;
int M,K,n[maxn],f[maxn],g[maxn],ni[maxn];
int qp(int a,int b)
{
int res=1;
for (;b;b>>=1)
{
if (b&1)
res=1ll*res*a%mod;
a=1ll*a*a%mod;
}
return res;
}
int inc(int a,int b)
{
a+=b;
if (a>=mod)
a-=mod;
return a;
}
int main()
{
scanf("%d%d",&M,&K);
for (int i=1;i<=K;i++)
n[i]=1+(M-1)*i,ni[i]=qp(n[i],mod-2);
n[0]=ni[0]=1;
for (int i=1;i<=K;i++)
{
f[i]=inc(1ll*inc(1ll*f[i-1]*ni[i-1]%mod,1)*M%mod,1ll*f[i-1]*ni[i-1]%mod*inc(n[i-1],mod-1)%mod);
g[i]=inc(g[i-1],1ll*f[i-1]*ni[i-1]%mod);
}
printf("%d\n",inc(f[K],g[K]));
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 5848kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 1ms
memory: 5868kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 88ms
memory: 17840kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 914ms
memory: 113556kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 5848kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 1000ms
memory: 124128kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 557ms
memory: 75236kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 1370ms
memory: 159708kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 247ms
memory: 35932kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 736ms
memory: 97164kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 435ms
memory: 61140kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 402ms
memory: 52492kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 1182ms
memory: 141136kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 1376ms
memory: 160036kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 1374ms
memory: 160112kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 1364ms
memory: 160196kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed