oj.uz

답안 #15195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15195 2015-07-12T03:37:55 Z gs14004 맛있는 과자 (kriii3_A) C++14
33 / 33
 0 ms 1844 KB 
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long lint;

lint bino[44][44];

int main(){
	for(int i=0; i<44; i++){
		bino[i][0] = 1;
		for(int j=1; j<=i; j++){
			bino[i][j] = bino[i-1][j] + bino[i-1][j-1];
		}
	}
	int a, b, n;
	long long k;
	scanf("%d %d %d %lld",&a,&b,&n,&k);
	long double addi0 = log(1.0 * (a * a) / (a * a + b * b));
	long double addi1 = log(1.0 * (b * b) / (a * a + b * b));
	int p = 0;
	for(int i=0; i<=n; i++){
		if(bino[n][i] >= k){
			p = i;
			break;
		}
		k -= bino[n][i];
	}
	if(addi0 > addi1) swap(addi0, addi1);
	cout << setprecision(30) << p * addi0 + (n - p ) * addi1 + log(a * b * 0.5);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
23.0 / 23.0

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