QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#350341#6736. Alice and BobAlbert711TL 1ms3708kbC++20969b2024-03-10 17:32:042024-03-10 17:32:05

Judging History

你现在查看的是最新测评结果

  • [2024-03-10 17:32:05]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3708kb
  • [2024-03-10 17:32:04]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
const int N = 100005 + 5;
const int mod = 998244353;
//#define int long long

ll fp(ll base,ll pow){
    ll result =1;
    while(pow){
        if(pow%2) result=result*base%mod;
        base=base*base%mod;
        pow/=2;
    }
    return result;
}
void solve() {
    ll n;
    cin>>n;
    ll ans=0;
    ll tmp=1;
    for(int i=1;i<=n-1;i++) tmp=tmp*i%mod;
    ll tt=tmp;
    for(int i=1;i<=n;i++){
        ll t2=1;
        ll k=n-i;
        for(int j=1;j<=i-1;j++){
            t2=t2*(k-j+1)%mod;
        }
//        cout<<t2<<' '<<tt<<'\n';
        if(t2==0) break;
        ans=ans+t2*tt%mod;
        ans%=mod;
        tt=tt*fp(n-i,mod-2)%mod;
    }
    cout<<ans<<'\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout << fixed << setprecision(1);
    int T = 1;
//    cin >> T;
    while (T--) solve();
    return 0;
}




Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3572kb

input:

1

output:

1

result:

ok 1 number(s): "1"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3564kb

input:

2

output:

1

result:

ok 1 number(s): "1"

Test #3:

score: 0
Accepted
time: 1ms
memory: 3680kb

input:

10

output:

997920

result:

ok 1 number(s): "997920"

Test #4:

score: 0
Accepted
time: 0ms
memory: 3680kb

input:

100

output:

188898954

result:

ok 1 number(s): "188898954"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3680kb

input:

4

output:

10

result:

ok 1 number(s): "10"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

8

output:

12336

result:

ok 1 number(s): "12336"

Test #7:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

16

output:

373118483

result:

ok 1 number(s): "373118483"

Test #8:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

32

output:

314585464

result:

ok 1 number(s): "314585464"

Test #9:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

64

output:

627827331

result:

ok 1 number(s): "627827331"

Test #10:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

128

output:

828497685

result:

ok 1 number(s): "828497685"

Test #11:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

256

output:

65697890

result:

ok 1 number(s): "65697890"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

512

output:

854187619

result:

ok 1 number(s): "854187619"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

1024

output:

513823539

result:

ok 1 number(s): "513823539"

Test #14:

score: -100
Time Limit Exceeded

input:

1361956

output:


result: