QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#449251#7018. Insertion SortsycqwqAC ✓11ms3560kbC++14725b2024-06-20 20:40:012024-06-20 20:40:02

Judging History

This is the latest submission verdict.

  • [2024-06-20 20:40:02]
  • Judged
  • Verdict: AC
  • Time: 11ms
  • Memory: 3560kb
  • [2024-06-20 20:40:01]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
const int maxn=55;
int fac[maxn];
int main()
{
    int _;
    cin>>_;
    int i=0;
    while(_--)
    {
        ++i;
        int n,k,mod;
        cin>>n>>k>>mod;
        k=min(k,n);
        fac[0]=1;
        for(int i=1;i<=50;i++)
            fac[i]=1ll*fac[i-1]*i%mod;
        int s=0;
        (s+=(1ll*fac[k]*((1ll*(n-k)*(n-k-1)%mod-(n-k)+1+mod)%mod)%mod+fac[k])%mod)%=mod;
        // cout<<s<<' '<<((n-k)*(n-k-1)-(n-k))<<'\n';
        (s+=1ll*k*fac[k]%mod*(n-k)%mod)%=mod;
        // cout<<s<<'\n';
        (s+=1ll*fac[k]*(n-k-1)%mod)%=mod;
        if(k>n-1) 
            s=fac[n]; 
        cout<<"Case #"<<i<<": "<<s<<'\n';
    }

    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4
4 1 998244353
4 2 998244353
4 3 998244353
4 4 998244353

output:

Case #1: 10
Case #2: 14
Case #3: 24
Case #4: 24

result:

ok 4 lines

Test #2:

score: 0
Accepted
time: 11ms
memory: 3548kb

input:

5000
14 37 557911987
7 10 367410643
16 14 367486993
14 13 257679469
40 1 433152019
6 1 151926713
18 10 831429839
45 23 611504891
43 41 442772417
28 29 651920513
50 43 783397267
34 9 584271757
14 40 136299073
35 24 908302831
32 29 939394321
7 19 925472381
47 24 563986517
42 37 820968349
24 8 36281506...

output:

Case #1: 144021228
Case #2: 5040
Case #3: 27680678
Case #4: 82630678
Case #5: 1522
Case #6: 26
Case #7: 497145600
Case #8: 158517076
Case #9: 265540132
Case #10: 174173325
Case #11: 757472701
Case #12: 299738880
Case #13: 83183553
Case #14: 685128802
Case #15: 58404183
Case #16: 5040
Case #17: 19811...

result:

ok 5000 lines