QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#619611 | #8339. Rooted Tree | lzy | WA | 0ms | 3688kb | C++14 | 599b | 2024-10-07 14:47:48 | 2024-10-07 14:47:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=1e9+9;
int qpow(int a,int b){
int res=1;
a%=mod;
while(b){
if(b&1)res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
signed main() {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,k;
cin>>n>>k;
int av;
int sum=0,leave=0;
for(int i=1;i<=k;i++){
av=leave*qpow((i*(n-1)+1),mod-2)%mod;
int t=((av+1)*n)%mod;
sum=(sum+t)%mod;
leave=(leave+t-av+mod)%mod;
}
cout<<sum<<"\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3688kb
input:
6 2
output:
90909107
result:
wrong answer 1st numbers differ - expected: '18', found: '90909107'