QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#629735 | #8023. The Journey of Geor Autumn | Lumina (Yuchong Guo, Yikai Zhu, Jiyu Shen)# | AC ✓ | 140ms | 121124kb | C++14 | 604b | 2024-10-11 14:30:43 | 2024-10-11 14:30:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
const int N=1e7+5,MOD=998244353;
int n,m,ans,f[N],s[N],inv[N];
int qpow(int x,int y)
{
int res=1;
for(;y;y/=2,x=1ll*x*x%MOD) if(y&1)
res=1ll*res*x%MOD;return res;
}
int main()
{
scanf("%d %d",&n,&m);m=min(m,n);
for(int i=1;i<=n;++i)
inv[i]=i>1?1ll*inv[MOD%i]*(MOD-MOD/i)%MOD:1;
for(int i=1;i<=m;++i) f[i]=1,s[i]=i;
for(int i=m+1;i<=n;++i)
{
f[i]=1ll*(s[i-1]-s[i-m-1]+MOD)*inv[i]%MOD;
s[i]=(s[i-1]+f[i])%MOD;
}
ans=f[n];for(int i=1;i<=n;++i) ans=1ll*ans*i%MOD;
printf("%d\n",ans);return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 7988kb
input:
1 1
output:
1
result:
ok "1"
Test #2:
score: 0
Accepted
time: 1ms
memory: 7984kb
input:
1 2
output:
1
result:
ok "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 7984kb
input:
1 3
output:
1
result:
ok "1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 8036kb
input:
1 4
output:
1
result:
ok "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 7864kb
input:
2 1
output:
1
result:
ok "1"
Test #6:
score: 0
Accepted
time: 1ms
memory: 7992kb
input:
2 2
output:
2
result:
ok "2"
Test #7:
score: 0
Accepted
time: 1ms
memory: 8040kb
input:
2 3
output:
2
result:
ok "2"
Test #8:
score: 0
Accepted
time: 1ms
memory: 7868kb
input:
2 4
output:
2
result:
ok "2"
Test #9:
score: 0
Accepted
time: 0ms
memory: 7972kb
input:
3 1
output:
1
result:
ok "1"
Test #10:
score: 0
Accepted
time: 0ms
memory: 7996kb
input:
3 2
output:
4
result:
ok "4"
Test #11:
score: 0
Accepted
time: 1ms
memory: 7988kb
input:
3 3
output:
6
result:
ok "6"
Test #12:
score: 0
Accepted
time: 1ms
memory: 8004kb
input:
3 4
output:
6
result:
ok "6"
Test #13:
score: 0
Accepted
time: 1ms
memory: 7980kb
input:
4 1
output:
1
result:
ok "1"
Test #14:
score: 0
Accepted
time: 0ms
memory: 7912kb
input:
4 2
output:
10
result:
ok "10"
Test #15:
score: 0
Accepted
time: 1ms
memory: 7988kb
input:
4 3
output:
18
result:
ok "18"
Test #16:
score: 0
Accepted
time: 1ms
memory: 7932kb
input:
4 4
output:
24
result:
ok "24"
Test #17:
score: 0
Accepted
time: 1ms
memory: 7904kb
input:
99 50
output:
955866606
result:
ok "955866606"
Test #18:
score: 0
Accepted
time: 1ms
memory: 7904kb
input:
99 70
output:
296999003
result:
ok "296999003"
Test #19:
score: 0
Accepted
time: 1ms
memory: 7868kb
input:
1034 998
output:
637688669
result:
ok "637688669"
Test #20:
score: 0
Accepted
time: 1ms
memory: 7920kb
input:
1099 997
output:
712935289
result:
ok "712935289"
Test #21:
score: 0
Accepted
time: 1ms
memory: 7904kb
input:
10314 998
output:
224695890
result:
ok "224695890"
Test #22:
score: 0
Accepted
time: 0ms
memory: 7972kb
input:
10929 9974
output:
160291286
result:
ok "160291286"
Test #23:
score: 0
Accepted
time: 0ms
memory: 12440kb
input:
103124 99448
output:
695932649
result:
ok "695932649"
Test #24:
score: 0
Accepted
time: 0ms
memory: 12236kb
input:
109139 9937
output:
268916696
result:
ok "268916696"
Test #25:
score: 0
Accepted
time: 17ms
memory: 21760kb
input:
1031234 99238
output:
441457721
result:
ok "441457721"
Test #26:
score: 0
Accepted
time: 11ms
memory: 20812kb
input:
1091239 991237
output:
61047495
result:
ok "61047495"
Test #27:
score: 0
Accepted
time: 118ms
memory: 121124kb
input:
10000000 9982443
output:
224744113
result:
ok "224744113"
Test #28:
score: 0
Accepted
time: 140ms
memory: 120948kb
input:
9999977 5678901
output:
641748125
result:
ok "641748125"
Extra Test:
score: 0
Extra Test Passed