| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15412 |
2015-07-12T07:16:43 Z |
tlwpdus |
맛있는 과자 (kriii3_A) |
C++ |
|
0 ms |
1212 KB |
#include<stdio.h>
#include<math.h>
using namespace std;
long long pas[50][50];
int a, b, n;
long long k;
void input() {
scanf("%d %d %d %lld", &a, &b, &n, &k);
if (a > b) {
int t = a;
a = b;
b = t;
}
}
void init() {
int i, j;
for (i = 0; i <= n + 1; i++) {
for (j = 0; j <= i; j++) {
if (j == 0 || j == i) pas[i][j] = 1;
else pas[i][j] = pas[i - 1][j] + pas[i - 1][j - 1];
}
}
}
void process() {
int i;
long long sum = 0;
for (i = 0; i <= n; i++) {
sum += pas[n][i];
if (sum >= k) {
break;
}
}
double alog = log((double)(a*a) / (a*a + b*b)), blog = log((double)(b*b) / (a*a + b*b));
double S = log((double)(a*b) / 2);
printf("%.12lf\n", S + i*alog + (n - i)*blog);
}
int main() {
input();
init();
process();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1212 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1212 KB |
Output is correct |
