QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#211908 | #6736. Alice and Bob | YFOQ | TL | 963ms | 63388kb | C++11 | 1.6kb | 2023-10-12 22:47:04 | 2023-10-12 22:47:05 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define endl '\n'
#define fix(x) cout << fixed << setprecision(x) ;
#pragma GCC optimize(3)
using namespace std;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
typedef pair<int,PII>PIP;
typedef pair<PII,int>PPI;
typedef vector<int>VI;
const int N =5e5+5;
const long long INF = 1e16;
int mod= 998244353;
ll a[10000001];
inline int kpow(int x,int n);
int inv;
ll A(int n,int x){
return a[n]*kpow(a[n-x],mod-2)%mod;
}
inline void Solve(){
a[0]=1;
int n;
cin>>n;
for(int i=1;i<=n;i++){
a[i]=a[i-1]*i;
a[i]%=mod;
}
ll res =0;
for(int i=1;i<=n/2+1;i++){
res+=A((n-i),i-1)*(a[n-i]);
res%=mod;
}
cout<<res<<endl;
}
signed main(){
IO
// fix(16);
int T=1;
// cin>>T;
for(int i=1;i<=T;i++){
Solve();
}
return 0;
}
/*
*/
int lowbit(int n)
{
return n&-n;
}
inline void read(int &x)
{
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
inline void print(long long x)
{
if(x<0){
putchar('-');
x=-x;
}
if(x>9) print(x/10);
putchar(x%10+'0');
}
//ofstream out("file.txt");
//ifstream in("file.txt");
inline int kpow(int x,int y){
if(y==0)return 1;
if(x==0)return 0;
long long res =1;
long long p=x;
for(int i=0;y>>i;++i){
if((y>>i)&1){
res*=p;
res%=mod;
}
p*=p;
p%=mod;
}
return res;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
input:
1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
2
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
10
output:
997920
result:
ok 1 number(s): "997920"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
100
output:
188898954
result:
ok 1 number(s): "188898954"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
4
output:
10
result:
ok 1 number(s): "10"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
8
output:
12336
result:
ok 1 number(s): "12336"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
16
output:
373118483
result:
ok 1 number(s): "373118483"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
32
output:
314585464
result:
ok 1 number(s): "314585464"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
64
output:
627827331
result:
ok 1 number(s): "627827331"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
128
output:
828497685
result:
ok 1 number(s): "828497685"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
256
output:
65697890
result:
ok 1 number(s): "65697890"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
512
output:
854187619
result:
ok 1 number(s): "854187619"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1024
output:
513823539
result:
ok 1 number(s): "513823539"
Test #14:
score: 0
Accepted
time: 178ms
memory: 15476kb
input:
1361956
output:
617368199
result:
ok 1 number(s): "617368199"
Test #15:
score: 0
Accepted
time: 963ms
memory: 63388kb
input:
7579013
output:
827172636
result:
ok 1 number(s): "827172636"
Test #16:
score: -100
Time Limit Exceeded
input:
8145517
output:
710624331