QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #409009 | #6736. Alice and Bob | tutuwizard# | TL | 864ms | 69424kb | C++20 | 590b | 2024-05-11 15:24:56 | 2024-05-11 15:24:57 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int M=998244353;
const int N=1e7+10;
int f[N];
int fn[N];
int quick(int a,int b)
{
int ans=1%M;
while(b)
{
if(b&1)
ans=ans*a%M;
a=a%M*a%M;
a%=M;
b>>=1;
}
return ans%M;
}
signed main(){
int n;
scanf("%lld",&n);
f[0]=f[1]=1;
fn[0]=fn[1]=1;
for(register int i=2;i<=n;i++)
{
f[i]=f[i-1]*i%M;
}
int ans=f[n-1]%M;
for(register int i=2;i<=(n+1)/2;i++)
{
ans=(ans+f[n-i]*f[n-i]%M*quick(f[n-i-(i-1)],M-2)%M)%M;
ans%=M;
}
printf("%lld",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5896kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 5884kb
input:
2
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 1ms
memory: 5880kb
input:
10
output:
997920
result:
ok 1 number(s): "997920"
Test #4:
score: 0
Accepted
time: 1ms
memory: 5688kb
input:
100
output:
188898954
result:
ok 1 number(s): "188898954"
Test #5:
score: 0
Accepted
time: 0ms
memory: 5848kb
input:
4
output:
10
result:
ok 1 number(s): "10"
Test #6:
score: 0
Accepted
time: 1ms
memory: 5896kb
input:
8
output:
12336
result:
ok 1 number(s): "12336"
Test #7:
score: 0
Accepted
time: 1ms
memory: 5892kb
input:
16
output:
373118483
result:
ok 1 number(s): "373118483"
Test #8:
score: 0
Accepted
time: 0ms
memory: 5940kb
input:
32
output:
314585464
result:
ok 1 number(s): "314585464"
Test #9:
score: 0
Accepted
time: 1ms
memory: 5784kb
input:
64
output:
627827331
result:
ok 1 number(s): "627827331"
Test #10:
score: 0
Accepted
time: 1ms
memory: 5880kb
input:
128
output:
828497685
result:
ok 1 number(s): "828497685"
Test #11:
score: 0
Accepted
time: 1ms
memory: 5676kb
input:
256
output:
65697890
result:
ok 1 number(s): "65697890"
Test #12:
score: 0
Accepted
time: 1ms
memory: 5672kb
input:
512
output:
854187619
result:
ok 1 number(s): "854187619"
Test #13:
score: 0
Accepted
time: 1ms
memory: 5844kb
input:
1024
output:
513823539
result:
ok 1 number(s): "513823539"
Test #14:
score: 0
Accepted
time: 145ms
memory: 16088kb
input:
1361956
output:
617368199
result:
ok 1 number(s): "617368199"
Test #15:
score: 0
Accepted
time: 788ms
memory: 65232kb
input:
7579013
output:
827172636
result:
ok 1 number(s): "827172636"
Test #16:
score: 0
Accepted
time: 864ms
memory: 69424kb
input:
8145517
output:
710624331
result:
ok 1 number(s): "710624331"
Test #17:
score: 0
Accepted
time: 645ms
memory: 55040kb
input:
6140463
output:
707600568
result:
ok 1 number(s): "707600568"
Test #18:
score: 0
Accepted
time: 355ms
memory: 34568kb
input:
3515281
output:
698302413
result:
ok 1 number(s): "698302413"
Test #19:
score: 0
Accepted
time: 735ms
memory: 61184kb
input:
6969586
output:
69470392
result:
ok 1 number(s): "69470392"
Test #20:
score: 0
Accepted
time: 303ms
memory: 28368kb
input:
2888636
output:
433579983
result:
ok 1 number(s): "433579983"
Test #21:
score: -100
Time Limit Exceeded
input:
9999998
output:
758172780