| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15816 |
2015-07-30T00:21:01 Z |
jihoon |
맛있는 과자 (kriii3_A) |
C++ |
|
0 ms |
1204 KB |
#include<cstdio>
#include<cmath>
long long int ncr[41][41];
int main(){
int a,b,n,t;
double lna,lnb,lnn;
long long int k,sum=0;
scanf("%d %d %d %lld",&a,&b,&n,&k);
//printf("%d %d %d %lld\n",a,b,n,k);
ncr[0][0]=1;
if(a>b){
t=a;a=b;b=t;
}
t=a*a+b*b;
lna=log((a*a)/(double)t);
lnb=log((b*b)/(double)t);
lnn=log(a*b/2.0);
for(int i=1;i<=n;i++){
ncr[i][0]=1;
for(int j=1;j<=i;j++){
ncr[i][j]=ncr[i-1][j-1]+ncr[i-1][j];
}
}
for(int i=0;i<=n;i++){
sum+=ncr[n][i];
//printf("%d %lld %lld\n",i,sum,k);
if(sum>=k){
printf("%.12f",i*lna+(n-i)*lnb+lnn);
return 0;
}
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1204 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1204 KB |
Output is correct |
