| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15402 |
2015-07-12T07:09:54 Z |
skeksk91 |
맛있는 과자 (kriii3_A) |
C++ |
|
0 ms |
1204 KB |
#include<stdio.h>
#include<algorithm>
#include<math.h>
long long pascal[41][41];
long long pow(long long n, long long k) {
if (k == 0) {
return 1;
}
long long temp = pow(n, k / 2);
if (k % 2 == 0) {
return temp*temp;
}
return temp*temp*n;
}
int main() {
for (int i = 0; i <= 40; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
pascal[i][j] = 1;
}
else {
pascal[i][j] = pascal[i - 1][j] + pascal[i - 1][j - 1];
}
}
}
long long a, b, n, k;
scanf("%lld%lld%lld%lld", &a, &b, &n, &k);
if (a < b) {
std::swap(a, b);
}
long long l = pow(2, n);
double s = (double)a*b/2;
for (int i = 0; i <= n; i++) {
k -= pascal[n][i];
if (k <= 0) {
for (int j = 1; j <= i; j++) {
s = s*b*b / ((a*a) + (b*b));
}
for (int j = 1; j <= n-i; j++) {
s = s*a*a / ((a*a) + (b*b));
}
break;
}
}
printf("%.12lf", log(s));
}
| # |
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 |
