QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#697628#8339. Rooted TreeKOH-#AC ✓1358ms3976kbC++14917b2024-11-01 15:10:252024-11-01 15:10:27

Judging History

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

  • [2024-11-01 15:10:27]
  • 评测
  • 测评结果:AC
  • 用时:1358ms
  • 内存:3976kb
  • [2024-11-01 15:10:25]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
	x=0;char ch=getchar();bool f=false;
	while(!isdigit(ch))	f|=ch=='-',ch=getchar();
	while(isdigit(ch))	x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	x=f?-x:x;return;
} 
template <typename T>
inline void print(T x){
	if(x<0)	putchar('-'),x=-x;
	if(x>9)	print(x/10);
	putchar(x%10^48);return; 
}
const int mod=1e9+9;
int ans;
int pre,now;
int cnt_p,cnt_n;
#define ll long long 
int m,k,p;
int power(int x,int y){
	int ans=1;
	while(y){
		if(y%2==1) ans=(long long)ans*x%mod;
		y/=2;
		x=(long long)x*x%mod;
	}
	return ans;
}
int main(){
	scanf("%d%d",&m,&k);
	int cnt=m;
	pre=0;
	ans=0;
	for(int i=1;i<=k;i++){
		now=((long long)m*power(cnt,mod-2)%mod+pre)%mod;
		ans=(ans+pre)%mod;
		pre=now;
		cnt=cnt+m-1;
	}
	ans=((long long)(cnt-m+1)*pre%mod+ans)%mod;
	printf("%d",ans);
	return 0;
}
	

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

6 2

output:

18

result:

ok 1 number(s): "18"

Test #2:

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

input:

2 6

output:

600000038

result:

ok 1 number(s): "600000038"

Test #3:

score: 0
Accepted
time: 84ms
memory: 3932kb

input:

83 613210

output:

424200026

result:

ok 1 number(s): "424200026"

Test #4:

score: 0
Accepted
time: 911ms
memory: 3916kb

input:

48 6713156

output:

198541581

result:

ok 1 number(s): "198541581"

Test #5:

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

input:

1 111

output:

6216

result:

ok 1 number(s): "6216"

Test #6:

score: 0
Accepted
time: 991ms
memory: 3976kb

input:

28 7304152

output:

457266679

result:

ok 1 number(s): "457266679"

Test #7:

score: 0
Accepted
time: 557ms
memory: 3972kb

input:

38 4101162

output:

232117382

result:

ok 1 number(s): "232117382"

Test #8:

score: 0
Accepted
time: 1347ms
memory: 3852kb

input:

51 9921154

output:

340670552

result:

ok 1 number(s): "340670552"

Test #9:

score: 0
Accepted
time: 245ms
memory: 3844kb

input:

79 1801157

output:

620550406

result:

ok 1 number(s): "620550406"

Test #10:

score: 0
Accepted
time: 736ms
memory: 3912kb

input:

22 5417157

output:

457449071

result:

ok 1 number(s): "457449071"

Test #11:

score: 0
Accepted
time: 436ms
memory: 3916kb

input:

25 3210162

output:

36368303

result:

ok 1 number(s): "36368303"

Test #12:

score: 0
Accepted
time: 397ms
memory: 3780kb

input:

67 2919160

output:

935195555

result:

ok 1 number(s): "935195555"

Test #13:

score: 0
Accepted
time: 1169ms
memory: 3976kb

input:

77 8613163

output:

482832472

result:

ok 1 number(s): "482832472"

Test #14:

score: 0
Accepted
time: 1357ms
memory: 3968kb

input:

90 10000000

output:

275581651

result:

ok 1 number(s): "275581651"

Test #15:

score: 0
Accepted
time: 1357ms
memory: 3932kb

input:

99 9999999

output:

126087169

result:

ok 1 number(s): "126087169"

Test #16:

score: 0
Accepted
time: 1358ms
memory: 3864kb

input:

100 10000000

output:

451590067

result:

ok 1 number(s): "451590067"

Extra Test:

score: 0
Extra Test Passed