QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #385339 | #6736. Alice and Bob | ty09 | AC ✓ | 205ms | 159572kb | C++14 | 903b | 2024-04-10 17:50:30 | 2024-04-10 17:50:30 |
Judging History
answer
#include"bits/stdc++.h"
#define endl '\n'
using ll=long long;
using namespace std;
#define int long long
constexpr int N=10000000+5,mod=998244353;
void slove(){
int n;
cin>>n;
int x=(n+1)/2;
vector<int>po(N,1);
vector<int>inv(N,1);
inv[1]=1;
for(int i=2;i<=N-5;i++)
inv[i]=(mod-mod/i)*inv[mod%i]%mod;
for(int i=1;i<=N-5;i++)
po[i]=(po[i-1]*i)%mod;
// for(int i=1;i<=10;i++){
// cout<<inv[i]<<" ";
// }cout<<endl;
// for(int i=1;i<=10;i++){
// cout<<po[i]<<" ";
// }cout<<endl;
int c=n-2;
ll ans=0;
ans+=po[n-1];
for(int i=2,j=n-2,k=n-2;i<=x;i++){
ans += (po[n-i] % mod * c %mod);
// cout<<ans<<endl;
ans%=mod;
c*=(k-1);
c%=mod;
c*=(k-2);
c%=mod;
c*=inv[j];
j--;
k-=2;
c%=mod;
}
cout<<ans%mod<<endl;
}
signed main(){
cin.tie(nullptr)->sync_with_stdio(0);
int _=1;
while(_--){
slove();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 142ms
memory: 159384kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 139ms
memory: 159512kb
input:
2
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 149ms
memory: 159352kb
input:
10
output:
997920
result:
ok 1 number(s): "997920"
Test #4:
score: 0
Accepted
time: 143ms
memory: 159508kb
input:
100
output:
188898954
result:
ok 1 number(s): "188898954"
Test #5:
score: 0
Accepted
time: 146ms
memory: 159396kb
input:
4
output:
10
result:
ok 1 number(s): "10"
Test #6:
score: 0
Accepted
time: 140ms
memory: 159564kb
input:
8
output:
12336
result:
ok 1 number(s): "12336"
Test #7:
score: 0
Accepted
time: 134ms
memory: 159328kb
input:
16
output:
373118483
result:
ok 1 number(s): "373118483"
Test #8:
score: 0
Accepted
time: 136ms
memory: 159488kb
input:
32
output:
314585464
result:
ok 1 number(s): "314585464"
Test #9:
score: 0
Accepted
time: 146ms
memory: 159416kb
input:
64
output:
627827331
result:
ok 1 number(s): "627827331"
Test #10:
score: 0
Accepted
time: 134ms
memory: 159400kb
input:
128
output:
828497685
result:
ok 1 number(s): "828497685"
Test #11:
score: 0
Accepted
time: 140ms
memory: 159488kb
input:
256
output:
65697890
result:
ok 1 number(s): "65697890"
Test #12:
score: 0
Accepted
time: 142ms
memory: 159480kb
input:
512
output:
854187619
result:
ok 1 number(s): "854187619"
Test #13:
score: 0
Accepted
time: 159ms
memory: 159416kb
input:
1024
output:
513823539
result:
ok 1 number(s): "513823539"
Test #14:
score: 0
Accepted
time: 159ms
memory: 159444kb
input:
1361956
output:
617368199
result:
ok 1 number(s): "617368199"
Test #15:
score: 0
Accepted
time: 195ms
memory: 159444kb
input:
7579013
output:
827172636
result:
ok 1 number(s): "827172636"
Test #16:
score: 0
Accepted
time: 187ms
memory: 159472kb
input:
8145517
output:
710624331
result:
ok 1 number(s): "710624331"
Test #17:
score: 0
Accepted
time: 182ms
memory: 159284kb
input:
6140463
output:
707600568
result:
ok 1 number(s): "707600568"
Test #18:
score: 0
Accepted
time: 166ms
memory: 159428kb
input:
3515281
output:
698302413
result:
ok 1 number(s): "698302413"
Test #19:
score: 0
Accepted
time: 179ms
memory: 159476kb
input:
6969586
output:
69470392
result:
ok 1 number(s): "69470392"
Test #20:
score: 0
Accepted
time: 180ms
memory: 159572kb
input:
2888636
output:
433579983
result:
ok 1 number(s): "433579983"
Test #21:
score: 0
Accepted
time: 199ms
memory: 159392kb
input:
9999998
output:
758172780
result:
ok 1 number(s): "758172780"
Test #22:
score: 0
Accepted
time: 205ms
memory: 159352kb
input:
9999999
output:
605195495
result:
ok 1 number(s): "605195495"
Test #23:
score: 0
Accepted
time: 205ms
memory: 159352kb
input:
10000000
output:
866813682
result:
ok 1 number(s): "866813682"