QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#472216#6417. Classical Summation ProblemUESTC_DECAYALI#AC ✓206ms3944kbC++17727b2024-07-11 15:06:232024-07-11 15:06:23

Judging History

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

  • [2024-07-11 15:06:23]
  • 评测
  • 测评结果:AC
  • 用时:206ms
  • 内存:3944kb
  • [2024-07-11 15:06:23]
  • 提交

answer

#include<cstdio>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=1e6+5,mod=998244353,inv2=(mod+1)/2;
int n,k;
inline int quick_pow(int x,int p=mod-2,int mul=1)
{
	for (;p;p>>=1,x=1LL*x*x%mod) if (p&1) mul=1LL*mul*x%mod; return mul;
}
int main()
{
	RI i; scanf("%d%d",&n,&k);
	if (k%2==1) return printf("%d",1LL*quick_pow(n,k)*(n+1)%mod*inv2%mod),0;
	int comb=1; for (i=1;i<=k/2;++i) comb=1LL*comb*(k-i+1)%mod*quick_pow(i)%mod;
	int d=0; for (i=1;i<n;++i) (d+=1LL*quick_pow(i,k/2)*quick_pow(n-i,k/2)%mod)%=mod;
	d=1LL*d*comb%mod*quick_pow(quick_pow(n,k))%mod;
	d=(1LL*(n+1)*inv2%mod-1LL*d*inv2%mod+mod)%mod;
	return printf("%d",1LL*quick_pow(n,k)*d%mod),0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3 2

output:

14

result:

ok 1 number(s): "14"

Test #2:

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

input:

5 3

output:

375

result:

ok 1 number(s): "375"

Test #3:

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

input:

2 2

output:

5

result:

ok 1 number(s): "5"

Test #4:

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

input:

10 9

output:

508778235

result:

ok 1 number(s): "508778235"

Test #5:

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

input:

69 3

output:

11497815

result:

ok 1 number(s): "11497815"

Test #6:

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

input:

994 515

output:

33689623

result:

ok 1 number(s): "33689623"

Test #7:

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

input:

4476 6182

output:

114894183

result:

ok 1 number(s): "114894183"

Test #8:

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

input:

58957 12755

output:

932388891

result:

ok 1 number(s): "932388891"

Test #9:

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

input:

218138 28238

output:

392861201

result:

ok 1 number(s): "392861201"

Test #10:

score: 0
Accepted
time: 102ms
memory: 3812kb

input:

644125 316810

output:

420621854

result:

ok 1 number(s): "420621854"

Test #11:

score: 0
Accepted
time: 112ms
memory: 3904kb

input:

612914 505428

output:

973686286

result:

ok 1 number(s): "973686286"

Test #12:

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

input:

998216 938963

output:

251335926

result:

ok 1 number(s): "251335926"

Test #13:

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

input:

990516 996933

output:

549551960

result:

ok 1 number(s): "549551960"

Test #14:

score: 0
Accepted
time: 201ms
memory: 3920kb

input:

999019 999012

output:

637189128

result:

ok 1 number(s): "637189128"

Test #15:

score: 0
Accepted
time: 206ms
memory: 3796kb

input:

999928 999950

output:

185229465

result:

ok 1 number(s): "185229465"

Test #16:

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

input:

999999 999999

output:

384164916

result:

ok 1 number(s): "384164916"

Test #17:

score: 0
Accepted
time: 200ms
memory: 3876kb

input:

999999 1000000

output:

696165930

result:

ok 1 number(s): "696165930"

Test #18:

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

input:

1000000 999999

output:

219071706

result:

ok 1 number(s): "219071706"

Test #19:

score: 0
Accepted
time: 200ms
memory: 3792kb

input:

1000000 1000000

output:

128206597

result:

ok 1 number(s): "128206597"

Test #20:

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

input:

2 10

output:

1410

result:

ok 1 number(s): "1410"

Test #21:

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

input:

84 16

output:

297627153

result:

ok 1 number(s): "297627153"

Test #22:

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

input:

643 800

output:

489237163

result:

ok 1 number(s): "489237163"

Test #23:

score: 0
Accepted
time: 1ms
memory: 3684kb

input:

9903 880

output:

595167333

result:

ok 1 number(s): "595167333"

Test #24:

score: 0
Accepted
time: 17ms
memory: 3880kb

input:

97446 89750

output:

410205549

result:

ok 1 number(s): "410205549"

Test #25:

score: 0
Accepted
time: 64ms
memory: 3872kb

input:

186460 646474

output:

32638530

result:

ok 1 number(s): "32638530"

Test #26:

score: 0
Accepted
time: 75ms
memory: 3784kb

input:

508940 244684

output:

598321755

result:

ok 1 number(s): "598321755"

Test #27:

score: 0
Accepted
time: 111ms
memory: 3876kb

input:

583646 557758

output:

858695621

result:

ok 1 number(s): "858695621"

Test #28:

score: 0
Accepted
time: 195ms
memory: 3884kb

input:

969610 992608

output:

256683498

result:

ok 1 number(s): "256683498"

Test #29:

score: 0
Accepted
time: 203ms
memory: 3944kb

input:

995106 996434

output:

411791999

result:

ok 1 number(s): "411791999"

Test #30:

score: 0
Accepted
time: 200ms
memory: 3848kb

input:

999961 999872

output:

61222370

result:

ok 1 number(s): "61222370"

Test #31:

score: 0
Accepted
time: 201ms
memory: 3784kb

input:

999977 999908

output:

831096762

result:

ok 1 number(s): "831096762"

Test #32:

score: 0
Accepted
time: 206ms
memory: 3944kb

input:

999992 999998

output:

562977678

result:

ok 1 number(s): "562977678"

Test #33:

score: 0
Accepted
time: 7ms
memory: 3876kb

input:

1000000 2

output:

118436113

result:

ok 1 number(s): "118436113"

Test #34:

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

input:

2 1000000

output:

298823641

result:

ok 1 number(s): "298823641"