Submission #15834

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15834	2015-07-30T11:46:47 Z	comet	맛있는 과자 (kriii3_A)	C++	0 / 33	0 ms	1192 KB

A

#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
void f(double a,double b,double c,ll N,ll K){
	if(N<0){
		printf("%.12f",a+b-log(2));
		return;
	}
	if(K>(1ll<<N)){
		f(a+b-c,2.0*b-c,b,N-1,K-(1ll<<N));
	}
	else{
		f(2.0*a-c,a+b-c,a,N-1,K);
	}
}
int main(){
	ll N,K;
	double a,b,c;
	scanf("%lf%lf%lld%lld",&a,&b,&N,&K);
	if(a>b)swap(a,b);
	K=(1ll<<N)-K+1;
	c=sqrt(a*a+b*b);
	f(log(a),log(b),log(c),N-1,K);
}

Subtask #1

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1192 KB	Output is correct
2	Incorrect	0 ms	1192 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Halted	0 ms	0 KB	-