oj.uz

답안 #15352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15352 2015-07-12T06:32:43 Z cki86201 맛있는 과자 (kriii3_A) C++
33 / 33
 0 ms 1212 KB 
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;

typedef long long ll;

ll C[50][50];

int main(){
	int a, b, n;
	ll K;
	scanf("%d%d%d%lld", &a, &b, &n, &K);
	C[0][0] = 1;
	for (int i = 1; i <= 42; i++){
		C[i][0] = 1;
		for (int j = 1; j <= i; j++){
			C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
		}
	}
	ll now = 0;
	if (a > b)swap(a, b);
	for (int i = 0; i <= n; i++){
		now += C[n][i];
		if (now >= K){
			printf("%.10f\n", log(a * b / 2.0) + 2 * (log(a) * i + log(b) * (n - i)) - n * log(a * a + b * b));
			break;
		}
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 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