| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15247 |
2015-07-12T04:32:13 Z |
kyma123 |
맛있는 과자 (kriii3_A) |
C++ |
|
0 ms |
1840 KB |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long int cache[41][41];
long long int bino(int n, int r) {
if (r == 0 || n == r)
return 1;
if (cache[n][r])
return cache[n][r];
return cache[n][r] = bino(n - 1, r - 1) + bino(n - 1, r);
}
int main() {
int a, b, n, i, m;
long long int k;
cin >> a >> b >> n >> k;
for (i = 0; (k -= bino(n, i)) > 0ll; i++);
if (a > b) {
m = a;
a = b;
b = m;
}//a > b
double la = 2 * log(a), lb = 2 * log(b), lab = log(a * a + b * b);
printf("%.10f", (i * la + (n - i) * lb - n * lab) + log(a * (double)b / 2));
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1840 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1840 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1840 KB |
Output is correct |
