Submission #2615464


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#define fo(i,a,b) for(LL i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define max(q,w) ((q)>(w)?(q):(w))
using namespace std;
typedef long long LL;
const int N=1000500,mo=998244353;
int m,n;
LL ans,jc[N],jcn[N];
LL ksm(LL q,int w)
{
    LL ans=1;
    for(;w;w>>=1,q=q*q%mo)if(w&1)ans=ans*q%mo;
    return ans;
}
LL C(int m,int n){return jc[m]*jcn[n]%mo*jcn[m-n]%mo;}
int main()
{
    scanf("%d%d",&n,&m);
    jc[0]=1;fo(i,1,n+m)jc[i]=jc[i-1]*(LL)i%mo;
    jcn[n+m]=ksm(jc[n+m],mo-2);fod(i,m+n-1,0)jcn[i]=jcn[i+1]*(i+1LL)%mo;
    if(n<m)swap(n,m);
    fo(i,1,m)ans=(ans+C(i*2,i)*C(n+m-i*2,m-i)%mo)%mo;
    printf("%lld\n",(ans*ksm(2,mo-2)%mo*ksm(C(m+n,m),mo-2)+n)%mo);
    return 0;
}

Submission Info

Submission Time
Task F - Yes or No
User cqz210831549
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 778 Byte
Status AC
Exec Time 22 ms
Memory 15872 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21: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 1 ms 2176 KB
sample_02.txt AC 1 ms 2176 KB
sample_03.txt AC 1 ms 2176 KB
sample_04.txt AC 1 ms 2176 KB
sample_05.txt AC 1 ms 2176 KB
subtask_1_01.txt AC 1 ms 2176 KB
subtask_1_02.txt AC 1 ms 2176 KB
subtask_1_03.txt AC 1 ms 2176 KB
subtask_1_04.txt AC 1 ms 2176 KB
subtask_1_05.txt AC 1 ms 2176 KB
subtask_1_06.txt AC 1 ms 2176 KB
subtask_1_07.txt AC 1 ms 2176 KB
subtask_1_08.txt AC 1 ms 2176 KB
subtask_1_09.txt AC 1 ms 2176 KB
subtask_1_10.txt AC 1 ms 2176 KB
subtask_1_11.txt AC 1 ms 2176 KB
subtask_1_12.txt AC 1 ms 2304 KB
subtask_1_13.txt AC 1 ms 2432 KB
subtask_1_14.txt AC 2 ms 4736 KB
subtask_1_15.txt AC 5 ms 5760 KB
subtask_1_16.txt AC 5 ms 5760 KB
subtask_1_17.txt AC 5 ms 5760 KB
subtask_1_18.txt AC 5 ms 5760 KB
subtask_1_19.txt AC 5 ms 5760 KB
subtask_1_20.txt AC 5 ms 5760 KB
subtask_1_21.txt AC 5 ms 5760 KB
subtask_1_22.txt AC 5 ms 5760 KB
subtask_1_23.txt AC 5 ms 5760 KB
subtask_1_24.txt AC 5 ms 5632 KB
subtask_1_25.txt AC 4 ms 5632 KB
subtask_2_01.txt AC 1 ms 2176 KB
subtask_2_02.txt AC 1 ms 2176 KB
subtask_2_03.txt AC 1 ms 2176 KB
subtask_2_04.txt AC 20 ms 15744 KB
subtask_2_05.txt AC 22 ms 15872 KB
subtask_2_06.txt AC 20 ms 15744 KB
subtask_2_07.txt AC 20 ms 15744 KB
subtask_2_08.txt AC 20 ms 15744 KB
subtask_2_09.txt AC 20 ms 15744 KB
subtask_2_10.txt AC 20 ms 15744 KB
subtask_2_11.txt AC 20 ms 15744 KB
subtask_2_12.txt AC 20 ms 15744 KB
subtask_2_13.txt AC 20 ms 15744 KB
subtask_2_14.txt AC 20 ms 15744 KB
subtask_2_15.txt AC 20 ms 15744 KB
subtask_2_16.txt AC 20 ms 15744 KB
subtask_2_17.txt AC 20 ms 15744 KB
subtask_2_18.txt AC 18 ms 15104 KB
subtask_2_19.txt AC 16 ms 14464 KB
subtask_2_20.txt AC 8 ms 10368 KB
subtask_2_21.txt AC 8 ms 10368 KB
subtask_2_22.txt AC 8 ms 10368 KB
subtask_2_23.txt AC 8 ms 10368 KB
subtask_2_24.txt AC 8 ms 10368 KB
subtask_2_25.txt AC 8 ms 10368 KB
subtask_2_26.txt AC 8 ms 10368 KB
subtask_2_27.txt AC 8 ms 10368 KB
subtask_2_28.txt AC 8 ms 10368 KB
subtask_2_29.txt AC 8 ms 10368 KB
subtask_2_30.txt AC 11 ms 14464 KB
subtask_2_31.txt AC 13 ms 14464 KB
subtask_2_32.txt AC 20 ms 15744 KB
subtask_2_33.txt AC 20 ms 15744 KB
subtask_2_34.txt AC 20 ms 15744 KB
subtask_2_35.txt AC 20 ms 15744 KB
subtask_2_36.txt AC 19 ms 15744 KB
subtask_2_37.txt AC 10 ms 10368 KB
subtask_2_38.txt AC 8 ms 10368 KB
subtask_2_39.txt AC 19 ms 15488 KB
subtask_2_40.txt AC 11 ms 14464 KB