oj.uz

답안 #15205

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15205 2015-07-12T03:50:35 Z tonyjjw 맛있는 과자 (kriii3_A) C++
33 / 33
 0 ms 1224 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;

int a, b, n;
long long k;

long long c[64][64];

int main(void) {
    c[0][0] = 1;
    for (int i = 1; i < 64; i++) {
        c[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            c[i][j] = c[i-1][j-1] + c[i-1][j];
        }
    }
    scanf("%d %d %d %lld", &a, &b, &n, &k);
    double area = log((double) a * b / 2.);
    if (a == b) {
        printf("%.10lf\n", (double) n * log(0.5) + area);
    } else {
        if (a < b) swap(a, b);
        long long rank_sum = 0;
        double ans = 0.0;
        double ra = (double)a * a / (a * a + b * b);
        double rb = (double)b * b / (a * a + b * b);
        for (int i = 0; i <= n; i++) {
            rank_sum += c[n][i];
            if (rank_sum >= k) {
                ans = (double) (n-i) * log(ra) + i * log(rb) + area;
                break;
            }
        }
        printf("%.10lf\n", ans);
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1224 KB Output is correct
2 Correct 0 ms 1224 KB Output is correct
3 Correct 0 ms 1224 KB Output is correct
4 Correct 0 ms 1224 KB Output is correct
5 Correct 0 ms 1224 KB Output is correct
6 Correct 0 ms 1224 KB Output is correct
7 Correct 0 ms 1224 KB Output is correct
8 Correct 0 ms 1224 KB Output is correct
9 Correct 0 ms 1224 KB Output is correct
10 Correct 0 ms 1224 KB Output is correct
11 Correct 0 ms 1224 KB Output is correct
12 Correct 0 ms 1224 KB Output is correct
13 Correct 0 ms 1224 KB Output is correct
14 Correct 0 ms 1224 KB Output is correct
15 Correct 0 ms 1224 KB Output is correct
16 Correct 0 ms 1224 KB Output is correct
17 Correct 0 ms 1224 KB Output is correct
18 Correct 0 ms 1224 KB Output is correct
19 Correct 0 ms 1224 KB Output is correct
20 Correct 0 ms 1224 KB Output is correct
21 Correct 0 ms 1224 KB Output is correct
22 Correct 0 ms 1224 KB Output is correct
23 Correct 0 ms 1224 KB Output is correct
24 Correct 0 ms 1224 KB Output is correct
25 Correct 0 ms 1224 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1224 KB Output is correct
2 Correct 0 ms 1224 KB Output is correct
3 Correct 0 ms 1224 KB Output is correct
4 Correct 0 ms 1224 KB Output is correct
5 Correct 0 ms 1224 KB Output is correct
6 Correct 0 ms 1224 KB Output is correct
7 Correct 0 ms 1224 KB Output is correct
8 Correct 0 ms 1224 KB Output is correct
9 Correct 0 ms 1224 KB Output is correct
10 Correct 0 ms 1224 KB Output is correct
11 Correct 0 ms 1224 KB Output is correct
12 Correct 0 ms 1224 KB Output is correct
13 Correct 0 ms 1224 KB Output is correct
14 Correct 0 ms 1224 KB Output is correct
15 Correct 0 ms 1224 KB Output is correct
16 Correct 0 ms 1224 KB Output is correct
17 Correct 0 ms 1224 KB Output is correct
18 Correct 0 ms 1224 KB Output is correct
19 Correct 0 ms 1224 KB Output is correct
20 Correct 0 ms 1224 KB Output is correct
21 Correct 0 ms 1224 KB Output is correct
22 Correct 0 ms 1224 KB Output is correct
23 Correct 0 ms 1224 KB Output is correct
24 Correct 0 ms 1224 KB Output is correct
25 Correct 0 ms 1224 KB Output is correct