Submission #15167

#	Time	Username	Problem	Language	Result	Execution time	Memory
15167		progressive	맛있는 과자 (kriii3_A)	C++14	33 / 33	0 ms	1204 KiB

A

#include<cstdio>
#include<cmath>
long long comb[41][41];
int main()
{
	int a,b,N;
	long long K;
	scanf("%d%d%d%lld",&a,&b,&N,&K);
	if(a>b) a^=b^=a^=b;
	comb[0][0]=1;
	for(int i=1;i<=N;i++)
	{
		comb[i][0]=comb[i][i]=1;
		for(int j=1;j<i;j++)
			comb[i][j]=comb[i-1][j-1]+comb[i-1][j];
	}
	for(int i=0;i<=N;i++)
	{
		K-=comb[N][i];
		if(K<=0)
		{
			printf("%.12lf",log(a*b/2.)+(N-i)*log(b*b)+i*log(a*a)-N*log(a*a+b*b));
			return 0;
		}
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23