QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#413226 | #6736. Alice and Bob | albion | TL | 948ms | 133032kb | C++17 | 689b | 2024-05-17 10:10:48 | 2024-05-17 10:10:49 |
Judging History
answer
#include<bits/stdc++.h>
#define MO 998244353
using namespace std;
int i,n;
long long ans;
long long jc[10000005][2];
long long qsm(long long x,long long y)
{
long long res=1;
while (y)
{
if (y&1) res=(res*x)%MO;
y>>=1;x=(x*x)%MO;
}
return res;
}
long long ny(long long x)
{
return qsm(x,MO-2);
}
long long c(int n,int m)
{
return jc[n][0]*jc[n-m][1]%MO*jc[m][1]%MO;
}
int main()
{
scanf("%d",&n);jc[0][0]=1;jc[0][1]=1;
for (i=1;i<=n;++i) jc[i][0]=(jc[i-1][0]*i)%MO,jc[i][1]=ny(jc[i][0]);
ans=0;
for (i=1;i<=(n+1)/2;++i)
ans=(ans+c(n-i,i-1)%MO*jc[n-i][0]%MO*jc[i-1][0]%MO)%MO;
printf("%lld",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3668kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3948kb
input:
2
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3952kb
input:
10
output:
997920
result:
ok 1 number(s): "997920"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3816kb
input:
100
output:
188898954
result:
ok 1 number(s): "188898954"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
4
output:
10
result:
ok 1 number(s): "10"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
8
output:
12336
result:
ok 1 number(s): "12336"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
16
output:
373118483
result:
ok 1 number(s): "373118483"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
32
output:
314585464
result:
ok 1 number(s): "314585464"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
64
output:
627827331
result:
ok 1 number(s): "627827331"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
128
output:
828497685
result:
ok 1 number(s): "828497685"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3740kb
input:
256
output:
65697890
result:
ok 1 number(s): "65697890"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
512
output:
854187619
result:
ok 1 number(s): "854187619"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
1024
output:
513823539
result:
ok 1 number(s): "513823539"
Test #14:
score: 0
Accepted
time: 154ms
memory: 26628kb
input:
1361956
output:
617368199
result:
ok 1 number(s): "617368199"
Test #15:
score: 0
Accepted
time: 862ms
memory: 124080kb
input:
7579013
output:
827172636
result:
ok 1 number(s): "827172636"
Test #16:
score: 0
Accepted
time: 948ms
memory: 133032kb
input:
8145517
output:
710624331
result:
ok 1 number(s): "710624331"
Test #17:
score: 0
Accepted
time: 702ms
memory: 101192kb
input:
6140463
output:
707600568
result:
ok 1 number(s): "707600568"
Test #18:
score: 0
Accepted
time: 408ms
memory: 60472kb
input:
3515281
output:
698302413
result:
ok 1 number(s): "698302413"
Test #19:
score: 0
Accepted
time: 801ms
memory: 114560kb
input:
6969586
output:
69470392
result:
ok 1 number(s): "69470392"
Test #20:
score: 0
Accepted
time: 335ms
memory: 50076kb
input:
2888636
output:
433579983
result:
ok 1 number(s): "433579983"
Test #21:
score: -100
Time Limit Exceeded
input:
9999998