QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#656014#8339. Rooted TreePleaseHackme#AC ✓1175ms3688kbC++20968b2024-10-19 10:50:152024-10-19 10:50:16

Judging History

你现在查看的是最新测评结果

  • [2024-10-19 10:50:16]
  • 评测
  • 测评结果:AC
  • 用时:1175ms
  • 内存:3688kb
  • [2024-10-19 10:50:15]
  • 提交

answer

#include<bits/stdc++.h>  
#define int long long
#define N 1000005
#define M 1000000009
#define endl '\n'
#define PII pair<int,int>
using namespace std;  
int ksm(int di,int mi){
    int sum=1;
    while(mi){
        if(mi%2){
            sum=sum*di%M;
            mi--;
        }
        else {
            di=di*di%M;
            mi/=2;
        }
    }
    return sum;
}
PII get(int a,int b,int x,int y){
    return {a*y+b*x,b*y};
}
void solve() {            
	int n,k;cin>>n>>k;
    int ans=0;
    int e=0,cnt=1;
    for(int i=1;i<=k;i++){
        int ye=n*(e*ksm(cnt,M-2)%M+1)%M;
        //cout<<ksm(cnt,M-2)%M<<endl;
        ans=(ans+ye)%M;
        ye=((n-1)*(e*ksm(cnt,M-2)%M+1)%M+1)%M;
        e=(e+ye)%M;
        cnt+=n-1;//叶子结点数更新
    }
    cout<<ans<<endl;
}  
signed main() {  
    ios::sync_with_stdio(false);  
    cin.tie(0);   
    int t=1;//cin>>t;
    while(t--) {  
        solve();  
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3688kb

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3596kb

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 72ms
memory: 3548kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 790ms
memory: 3544kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 857ms
memory: 3620kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 481ms
memory: 3680kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1165ms
memory: 3616kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 208ms
memory: 3656kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 632ms
memory: 3620kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 377ms
memory: 3628kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 343ms
memory: 3548kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 1012ms
memory: 3604kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1174ms
memory: 3656kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1174ms
memory: 3616kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1175ms
memory: 3560kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed