Submission #1542625


Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;
long long Mod = 998244353, F[1001000], InvF[1001000], S, S2, S3;
long long Pow(long long a, long long b){
    long long r = 1;
    while(b){
        if(b&1)r=r*a%Mod;
        a=a*a%Mod;b>>=1;
    }
    return r;
}
long long Inv(long long a){return Pow(a,Mod-2);}
long long Get(int a, int b){
    return F[a+b] * InvF[a] % Mod * InvF[b] % Mod;
}
int n, m;
int main(){
    int i;
    F[0]=1;
    for(i=1;i<=1000000;i++)F[i]=F[i-1]*i%Mod;
    InvF[1000000] = Inv(F[1000000]);
    for(i=1000000;i>=1;i--)InvF[i-1] = InvF[i] * i % Mod;
    scanf("%d%d",&n,&m);
    if(n > m) swap(n,m);
    S = m * Get(n,m) % Mod;
    for(i=0;i<n;i++){
        S = (S + Mod - Get(i, m-n+i) * Get(n-i, n-i-1) % Mod * (n-i-1) % Mod) % Mod;
        S = (S + Get(i, m-n+i+1) * Get(n-i-1, n-i-1) % Mod * (n-i-1) % Mod) % Mod;
        
        S3 = (S3 + Get(i, m-n+i) * Get(n-i, n-i-1) % Mod * (n-i) % Mod) % Mod;
        S3 = (S3 + Mod - Get(i, m-n+i+1) * Get(n-i-1, n-i-1) % Mod * (n-i-1) % Mod) % Mod;
    }
    S=(S+S3)%Mod;
    printf("%lld\n",S * Inv(Get(n,m))%Mod);
}

Submission Info

Submission Time
Task F - Yes or No
User ainta
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1140 Byte
Status AC
Exec Time 131 ms
Memory 15744 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^

Judge Result

Set Name Sample Partial All
Score / Max Score 0 / 0 1500 / 1500 500 / 500
Status
AC × 5
AC × 28
AC × 75
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt
Partial sample_01.txt, sample_02.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_2_01.txt, subtask_2_02.txt, subtask_2_03.txt, subtask_2_04.txt, subtask_2_05.txt, subtask_2_06.txt, subtask_2_07.txt, subtask_2_08.txt, subtask_2_09.txt, subtask_2_10.txt, subtask_2_11.txt, subtask_2_12.txt, subtask_2_13.txt, subtask_2_14.txt, subtask_2_15.txt, subtask_2_16.txt, subtask_2_17.txt, subtask_2_18.txt, subtask_2_19.txt, subtask_2_20.txt, subtask_2_21.txt, subtask_2_22.txt, subtask_2_23.txt, subtask_2_24.txt, subtask_2_25.txt, subtask_2_26.txt, subtask_2_27.txt, subtask_2_28.txt, subtask_2_29.txt, subtask_2_30.txt, subtask_2_31.txt, subtask_2_32.txt, subtask_2_33.txt, subtask_2_34.txt, subtask_2_35.txt, subtask_2_36.txt, subtask_2_37.txt, subtask_2_38.txt, subtask_2_39.txt, subtask_2_40.txt
Case Name Status Exec Time Memory
sample_01.txt AC 34 ms 15744 KB
sample_02.txt AC 34 ms 15744 KB
sample_03.txt AC 33 ms 15744 KB
sample_04.txt AC 34 ms 15744 KB
sample_05.txt AC 33 ms 15744 KB
subtask_1_01.txt AC 34 ms 15744 KB
subtask_1_02.txt AC 34 ms 15744 KB
subtask_1_03.txt AC 34 ms 15744 KB
subtask_1_04.txt AC 34 ms 15744 KB
subtask_1_05.txt AC 34 ms 15744 KB
subtask_1_06.txt AC 33 ms 15744 KB
subtask_1_07.txt AC 34 ms 15744 KB
subtask_1_08.txt AC 33 ms 15744 KB
subtask_1_09.txt AC 34 ms 15744 KB
subtask_1_10.txt AC 34 ms 15744 KB
subtask_1_11.txt AC 33 ms 15744 KB
subtask_1_12.txt AC 35 ms 15744 KB
subtask_1_13.txt AC 36 ms 15744 KB
subtask_1_14.txt AC 40 ms 15744 KB
subtask_1_15.txt AC 54 ms 15744 KB
subtask_1_16.txt AC 53 ms 15744 KB
subtask_1_17.txt AC 53 ms 15744 KB
subtask_1_18.txt AC 53 ms 15744 KB
subtask_1_19.txt AC 53 ms 15744 KB
subtask_1_20.txt AC 53 ms 15744 KB
subtask_1_21.txt AC 53 ms 15744 KB
subtask_1_22.txt AC 53 ms 15744 KB
subtask_1_23.txt AC 53 ms 15744 KB
subtask_1_24.txt AC 51 ms 15744 KB
subtask_1_25.txt AC 51 ms 15744 KB
subtask_2_01.txt AC 33 ms 15744 KB
subtask_2_02.txt AC 34 ms 15744 KB
subtask_2_03.txt AC 34 ms 15744 KB
subtask_2_04.txt AC 131 ms 15744 KB
subtask_2_05.txt AC 131 ms 15744 KB
subtask_2_06.txt AC 130 ms 15744 KB
subtask_2_07.txt AC 131 ms 15744 KB
subtask_2_08.txt AC 131 ms 15744 KB
subtask_2_09.txt AC 131 ms 15744 KB
subtask_2_10.txt AC 131 ms 15744 KB
subtask_2_11.txt AC 131 ms 15744 KB
subtask_2_12.txt AC 131 ms 15744 KB
subtask_2_13.txt AC 131 ms 15744 KB
subtask_2_14.txt AC 131 ms 15744 KB
subtask_2_15.txt AC 131 ms 15744 KB
subtask_2_16.txt AC 131 ms 15744 KB
subtask_2_17.txt AC 129 ms 15744 KB
subtask_2_18.txt AC 121 ms 15744 KB
subtask_2_19.txt AC 109 ms 15744 KB
subtask_2_20.txt AC 34 ms 15744 KB
subtask_2_21.txt AC 34 ms 15744 KB
subtask_2_22.txt AC 34 ms 15744 KB
subtask_2_23.txt AC 34 ms 15744 KB
subtask_2_24.txt AC 34 ms 15744 KB
subtask_2_25.txt AC 34 ms 15744 KB
subtask_2_26.txt AC 34 ms 15744 KB
subtask_2_27.txt AC 34 ms 15744 KB
subtask_2_28.txt AC 36 ms 15744 KB
subtask_2_29.txt AC 38 ms 15744 KB
subtask_2_30.txt AC 53 ms 15744 KB
subtask_2_31.txt AC 73 ms 15744 KB
subtask_2_32.txt AC 131 ms 15744 KB
subtask_2_33.txt AC 131 ms 15744 KB
subtask_2_34.txt AC 131 ms 15744 KB
subtask_2_35.txt AC 129 ms 15744 KB
subtask_2_36.txt AC 129 ms 15744 KB
subtask_2_37.txt AC 74 ms 15744 KB
subtask_2_38.txt AC 45 ms 15744 KB
subtask_2_39.txt AC 123 ms 15744 KB
subtask_2_40.txt AC 51 ms 15744 KB