Submission #15831

#TimeUsernameProblemLanguageResultExecution timeMemory
15831comet맛있는 과자 (kriii3_A)C++98
0 / 33
0 ms1820 KiB
#include<iostream> #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){ cout<<a+b-log(2); return; } if(a>b)swap(a,b); if(K>(1ll<<N)){ f(a+b-c,2*b-c,b,N-1,K-(1ll<<N)); } else{ f(2*a-c,a+b-c,a,N-1,K); } } int main(){ ios::sync_with_stdio(0); cout<<fixed; cout.precision(15); ll N,K; double a,b,c; cin>>a>>b>>N>>K; K=(1ll<<N)-K+1; c=sqrt(a*a+b*b); f(log(a),log(b),log(c),N-1,K); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...