QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #402528 | #6736. Alice and Bob | mulberry# | AC ✓ | 259ms | 159948kb | C++23 | 886b | 2024-04-30 19:27:37 | 2024-04-30 19:27:37 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int mod = 998244353;
long long fac[10000010],Inv[10000010];
// long long mul(long long x, long long y){
// return x * y - x * y / mod * mod;
// }
void pre() {
fac[0] = fac[1] = Inv[0] = Inv[1] = /* */1;
for(int i = 2; i <= 10000000; ++i)
fac[i] = fac[i - 1] * i % mod, Inv[i] = (mod - mod / i) * Inv[mod % i] % mod;
for(int i = 2; i <= 10000000; ++i)
Inv[i] = Inv[i - 1] * Inv[i] % mod;
}
long long C(int m,int n) {
return fac[m] * Inv[m - n] % mod * Inv[n] % mod;
}
// long long fac[10000005];
int main()
{
pre();
long long ans = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++){
// cout <<
if(n - i < i - 1)break;
ans += fac[i - 1] * C(n - i, i - 1) % mod * fac[n - i] % mod;
ans %= mod;
// << endl;
}
cout << ans<< endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 182ms
memory: 159880kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 185ms
memory: 159880kb
input:
2
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 181ms
memory: 159880kb
input:
10
output:
997920
result:
ok 1 number(s): "997920"
Test #4:
score: 0
Accepted
time: 175ms
memory: 159868kb
input:
100
output:
188898954
result:
ok 1 number(s): "188898954"
Test #5:
score: 0
Accepted
time: 177ms
memory: 159816kb
input:
4
output:
10
result:
ok 1 number(s): "10"
Test #6:
score: 0
Accepted
time: 211ms
memory: 159804kb
input:
8
output:
12336
result:
ok 1 number(s): "12336"
Test #7:
score: 0
Accepted
time: 189ms
memory: 159824kb
input:
16
output:
373118483
result:
ok 1 number(s): "373118483"
Test #8:
score: 0
Accepted
time: 184ms
memory: 159804kb
input:
32
output:
314585464
result:
ok 1 number(s): "314585464"
Test #9:
score: 0
Accepted
time: 196ms
memory: 159876kb
input:
64
output:
627827331
result:
ok 1 number(s): "627827331"
Test #10:
score: 0
Accepted
time: 179ms
memory: 159760kb
input:
128
output:
828497685
result:
ok 1 number(s): "828497685"
Test #11:
score: 0
Accepted
time: 191ms
memory: 159880kb
input:
256
output:
65697890
result:
ok 1 number(s): "65697890"
Test #12:
score: 0
Accepted
time: 188ms
memory: 159876kb
input:
512
output:
854187619
result:
ok 1 number(s): "854187619"
Test #13:
score: 0
Accepted
time: 199ms
memory: 159888kb
input:
1024
output:
513823539
result:
ok 1 number(s): "513823539"
Test #14:
score: 0
Accepted
time: 186ms
memory: 159948kb
input:
1361956
output:
617368199
result:
ok 1 number(s): "617368199"
Test #15:
score: 0
Accepted
time: 247ms
memory: 159944kb
input:
7579013
output:
827172636
result:
ok 1 number(s): "827172636"
Test #16:
score: 0
Accepted
time: 254ms
memory: 159788kb
input:
8145517
output:
710624331
result:
ok 1 number(s): "710624331"
Test #17:
score: 0
Accepted
time: 225ms
memory: 159800kb
input:
6140463
output:
707600568
result:
ok 1 number(s): "707600568"
Test #18:
score: 0
Accepted
time: 215ms
memory: 159944kb
input:
3515281
output:
698302413
result:
ok 1 number(s): "698302413"
Test #19:
score: 0
Accepted
time: 250ms
memory: 159756kb
input:
6969586
output:
69470392
result:
ok 1 number(s): "69470392"
Test #20:
score: 0
Accepted
time: 211ms
memory: 159748kb
input:
2888636
output:
433579983
result:
ok 1 number(s): "433579983"
Test #21:
score: 0
Accepted
time: 248ms
memory: 159936kb
input:
9999998
output:
758172780
result:
ok 1 number(s): "758172780"
Test #22:
score: 0
Accepted
time: 259ms
memory: 159872kb
input:
9999999
output:
605195495
result:
ok 1 number(s): "605195495"
Test #23:
score: 0
Accepted
time: 259ms
memory: 159800kb
input:
10000000
output:
866813682
result:
ok 1 number(s): "866813682"