Submission #3787948


Source Code Expand

#include<cstdio>
typedef long long ll;
const ll mod=998244353;
inline ll rev(ll x)
{ll k=mod-2,r=1;for(;k;k>>=1,(x*=x)%=mod)if(k&1)(r*=x)%=mod;return r;}
ll fac[1111111],inv[1111111];
inline ll C(int n,int r)
{return((((fac[n]*inv[r])%mod)*inv[n-r])%mod);}
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	if(n<m)n^=m,m^=n,n^=m;
	fac[0]=inv[0]=1;
	register int i;
	for(i=1;i<=n+m;i++)fac[i]=(fac[i-1]*i)%mod;
	inv[n+m]=rev(fac[n+m]);
	for(i=n+m-1;i;i--)inv[i]=inv[i+1]*(i+1)%mod;
	ll ans=0;
	for(i=1;i<=m;i++)
		(ans+=C(i*2,i)*C(n+m-2*i,n-i))%=mod;
	(((ans*=rev(2*C(n+m,n)))%=mod)+=n+mod)%=mod;
	printf("%lld\n",ans);
}

Submission Info

Submission Time
Task F - Yes or No
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 2000
Code Size 639 Byte
Status AC
Exec Time 19 ms
Memory 16640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:21: 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 2304 KB
subtask_1_14.txt AC 2 ms 2688 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 4 ms 3712 KB
subtask_1_24.txt AC 4 ms 3584 KB
subtask_1_25.txt AC 4 ms 3584 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 19 ms 16640 KB
subtask_2_05.txt AC 19 ms 16640 KB
subtask_2_06.txt AC 19 ms 16640 KB
subtask_2_07.txt AC 19 ms 16640 KB
subtask_2_08.txt AC 19 ms 16640 KB
subtask_2_09.txt AC 19 ms 16640 KB
subtask_2_10.txt AC 19 ms 16640 KB
subtask_2_11.txt AC 19 ms 16640 KB
subtask_2_12.txt AC 19 ms 16640 KB
subtask_2_13.txt AC 19 ms 16640 KB
subtask_2_14.txt AC 19 ms 16640 KB
subtask_2_15.txt AC 19 ms 16640 KB
subtask_2_16.txt AC 19 ms 16640 KB
subtask_2_17.txt AC 19 ms 16512 KB
subtask_2_18.txt AC 18 ms 16512 KB
subtask_2_19.txt AC 15 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 9 ms 10368 KB
subtask_2_30.txt AC 10 ms 12416 KB
subtask_2_31.txt AC 12 ms 12416 KB
subtask_2_32.txt AC 19 ms 16640 KB
subtask_2_33.txt AC 19 ms 16640 KB
subtask_2_34.txt AC 19 ms 16640 KB
subtask_2_35.txt AC 18 ms 16640 KB
subtask_2_36.txt AC 18 ms 16512 KB
subtask_2_37.txt AC 10 ms 10368 KB
subtask_2_38.txt AC 7 ms 8320 KB
subtask_2_39.txt AC 18 ms 16512 KB
subtask_2_40.txt AC 10 ms 12416 KB