QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #588811 | #8339. Rooted Tree | DBsoleil# | AC ✓ | 1337ms | 42912kb | C++20 | 693b | 2024-09-25 14:41:51 | 2024-09-25 14:41:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
static constexpr int mod = 1e9 + 9;
static constexpr int Maxn = 1e7 + 5;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
int mul(int x, int y) { return (int64_t)x * y % mod; }
int ksm(int x, int y) {
int r = 1;
for (; y; y >>= 1, x = mul(x, x))
if (y & 1) r = mul(r, x);
return r;
} // ksm
int M, K;
int f[Maxn], ans;
int main(void) {
cin >> M >> K; f[0] = 1;
for (int i = 1; i <= K; ++i) {
int leafs = 1 + (M - 1) * i;
f[i] = add(f[i - 1], mul(M, ksm(leafs, mod - 2)));
}
for (int i = 0; i < K; ++i)
ans = add(ans, mul(M, f[i]));
printf("%d\n", ans);
return 0;
} // main
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
input:
6 2
output:
18
result:
ok 1 number(s): "18"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3820kb
input:
2 6
output:
600000038
result:
ok 1 number(s): "600000038"
Test #3:
score: 0
Accepted
time: 83ms
memory: 6960kb
input:
83 613210
output:
424200026
result:
ok 1 number(s): "424200026"
Test #4:
score: 0
Accepted
time: 897ms
memory: 30604kb
input:
48 6713156
output:
198541581
result:
ok 1 number(s): "198541581"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
1 111
output:
6216
result:
ok 1 number(s): "6216"
Test #6:
score: 0
Accepted
time: 968ms
memory: 32456kb
input:
28 7304152
output:
457266679
result:
ok 1 number(s): "457266679"
Test #7:
score: 0
Accepted
time: 551ms
memory: 20612kb
input:
38 4101162
output:
232117382
result:
ok 1 number(s): "232117382"
Test #8:
score: 0
Accepted
time: 1326ms
memory: 42596kb
input:
51 9921154
output:
340670552
result:
ok 1 number(s): "340670552"
Test #9:
score: 0
Accepted
time: 243ms
memory: 12792kb
input:
79 1801157
output:
620550406
result:
ok 1 number(s): "620550406"
Test #10:
score: 0
Accepted
time: 727ms
memory: 25096kb
input:
22 5417157
output:
457449071
result:
ok 1 number(s): "457449071"
Test #11:
score: 0
Accepted
time: 419ms
memory: 18292kb
input:
25 3210162
output:
36368303
result:
ok 1 number(s): "36368303"
Test #12:
score: 0
Accepted
time: 393ms
memory: 16000kb
input:
67 2919160
output:
935195555
result:
ok 1 number(s): "935195555"
Test #13:
score: 0
Accepted
time: 1139ms
memory: 38672kb
input:
77 8613163
output:
482832472
result:
ok 1 number(s): "482832472"
Test #14:
score: 0
Accepted
time: 1333ms
memory: 42844kb
input:
90 10000000
output:
275581651
result:
ok 1 number(s): "275581651"
Test #15:
score: 0
Accepted
time: 1325ms
memory: 42912kb
input:
99 9999999
output:
126087169
result:
ok 1 number(s): "126087169"
Test #16:
score: 0
Accepted
time: 1337ms
memory: 42812kb
input:
100 10000000
output:
451590067
result:
ok 1 number(s): "451590067"
Extra Test:
score: 0
Extra Test Passed