#include <stdio.h>
#include <math.h>
int main(){
int i,n;
double a,b,c;
long long k,t=1;
scanf("%lf%lf%d%lld",&a,&b,&n,&k);
if(a>b)c=a,a=b,b=c;
for(i=0;i<n;){
if(k<=t)break;
k-=t;
t=t*(n-i)/(++i);
}
printf("%.8lf",log(a*b/2)+i*2*log(a)+(n-i)*2*log(b)-n*log(a*a+b*b));
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1192 KB |
Output is correct |
2 |
Correct |
0 ms |
1192 KB |
Output is correct |
3 |
Correct |
0 ms |
1192 KB |
Output is correct |
4 |
Correct |
0 ms |
1192 KB |
Output is correct |
5 |
Correct |
0 ms |
1192 KB |
Output is correct |
6 |
Correct |
0 ms |
1192 KB |
Output is correct |
7 |
Correct |
0 ms |
1192 KB |
Output is correct |
8 |
Correct |
0 ms |
1192 KB |
Output is correct |
9 |
Correct |
0 ms |
1192 KB |
Output is correct |
10 |
Correct |
0 ms |
1192 KB |
Output is correct |
11 |
Correct |
0 ms |
1192 KB |
Output is correct |
12 |
Correct |
0 ms |
1192 KB |
Output is correct |
13 |
Correct |
0 ms |
1192 KB |
Output is correct |
14 |
Correct |
0 ms |
1192 KB |
Output is correct |
15 |
Correct |
0 ms |
1192 KB |
Output is correct |
16 |
Correct |
0 ms |
1192 KB |
Output is correct |
17 |
Correct |
0 ms |
1192 KB |
Output is correct |
18 |
Correct |
0 ms |
1192 KB |
Output is correct |
19 |
Correct |
0 ms |
1192 KB |
Output is correct |
20 |
Correct |
0 ms |
1192 KB |
Output is correct |
21 |
Correct |
0 ms |
1192 KB |
Output is correct |
22 |
Correct |
0 ms |
1192 KB |
Output is correct |
23 |
Correct |
0 ms |
1192 KB |
Output is correct |
24 |
Correct |
0 ms |
1192 KB |
Output is correct |
25 |
Correct |
0 ms |
1192 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1192 KB |
Output is correct |
2 |
Correct |
0 ms |
1192 KB |
Output is correct |
3 |
Correct |
0 ms |
1192 KB |
Output is correct |
4 |
Correct |
0 ms |
1192 KB |
Output is correct |
5 |
Correct |
0 ms |
1192 KB |
Output is correct |
6 |
Correct |
0 ms |
1192 KB |
Output is correct |
7 |
Correct |
0 ms |
1192 KB |
Output is correct |
8 |
Correct |
0 ms |
1192 KB |
Output is correct |
9 |
Correct |
0 ms |
1192 KB |
Output is correct |
10 |
Correct |
0 ms |
1192 KB |
Output is correct |
11 |
Correct |
0 ms |
1192 KB |
Output is correct |
12 |
Correct |
0 ms |
1192 KB |
Output is correct |
13 |
Correct |
0 ms |
1192 KB |
Output is correct |
14 |
Correct |
0 ms |
1192 KB |
Output is correct |
15 |
Correct |
0 ms |
1192 KB |
Output is correct |
16 |
Correct |
0 ms |
1192 KB |
Output is correct |
17 |
Correct |
0 ms |
1192 KB |
Output is correct |
18 |
Correct |
0 ms |
1192 KB |
Output is correct |
19 |
Correct |
0 ms |
1192 KB |
Output is correct |
20 |
Correct |
0 ms |
1192 KB |
Output is correct |
21 |
Correct |
0 ms |
1192 KB |
Output is correct |
22 |
Correct |
0 ms |
1192 KB |
Output is correct |
23 |
Correct |
0 ms |
1192 KB |
Output is correct |
24 |
Correct |
0 ms |
1192 KB |
Output is correct |
25 |
Correct |
0 ms |
1192 KB |
Output is correct |