| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15190 |
2015-07-12T03:34:33 Z |
xhae |
맛있는 과자 (kriii3_A) |
C++14 |
|
0 ms |
1220 KB |
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
long long ptri[60][60];
int main()
{
int a,b;
long long N, K;
scanf("%d%d%lld%lld",&a,&b,&N,&K);
for (int i = 0; i <= 50; i++) {
ptri[i][0] = ptri[i][i] = 1;
for (int j = 1; j < i; j++) {
ptri[i][j] = ptri[i-1][j] + ptri[i-1][j-1];
}
}
if (a < b) swap(a,b);
// now a > b
double A = log((double)(a*a)/(a*a+b*b));
double B = log((double)(b*b)/(a*a+b*b));
// A > B
for (int acnt = 0; acnt <= N; acnt++) {
K -= ptri[N][acnt];
if (K <= 0) {
printf("%.15f\n", log(a*b/2.0) + A * (N-acnt) + B*acnt);
return 0;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1220 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1220 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1220 KB |
Output is correct |
