QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #404859 | #6736. Alice and Bob | 20232501479 | WA | 0ms | 3584kb | C++14 | 305b | 2024-05-04 20:42:30 | 2024-05-04 20:42:31 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int P=998244353;
int f[10010000],n;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
f[0]=1;
for(int i=1;i<=n+1;i++)
f[i]=f[i-1]*i%P;
cout<<f[n+1]/(n*(n/2-1))<<endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3584kb
input:
1
output:
-2
result:
wrong answer 1st numbers differ - expected: '1', found: '-2'