oj.uz

답안 #15186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15186 2015-07-12T03:30:44 Z gs13068 맛있는 과자 (kriii3_A) C++
33 / 33
 0 ms 1204 KB 
#include<cstdio>
#include<cmath>

long long d[44][44];

int main()
{
    double res;
    int i,j,a,b,n;
    long long k;
    scanf("%d%d%d%lld",&a,&b,&n,&k);
    if(a<b)a^=b^=a^=b;
    for(i=0;i<=n;i++)
    {
        d[i][0]=d[i][i]=1;
        for(j=1;j<i;j++)d[i][j]=d[i-1][j]+d[i-1][j-1];
    }
    for(j=0;j<=n;j++)
    {
        if(k>d[n][j])k-=d[n][j];
        else break;
    }
    res=log(a*b/2.);
    for(i=0;i<j;i++)res+=log(1.*b*b/(a*a+b*b));
    for(i=j;i<n;i++)res+=log(1.*a*a/(a*a+b*b));
    printf("%.12lf\n",res);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
23.0 / 23.0

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