Submission #15261

#TimeUsernameProblemLanguageResultExecution timeMemory
15261skeksk91맛있는 과자 (kriii3_A)C++98
0 / 33
0 ms1192 KiB
#include<stdio.h> #include<algorithm> #include<math.h> long long pow(long long n, long long k) { if (k == 0) { return 1; } long long temp = pow(n, k / 2); if (k % 2 == 0) { return temp*temp; } return temp*temp*n; } int main() { long long a, b, n, k; scanf("%lld%lld%lld%lld", &a, &b, &n, &k); if (a < b) { std::swap(a, b); } long long l = pow(2, n); double s = (double)a*b / 2; while (l!=1) { if (k > (l / 2)) { s = s*b*b / ((a*a) + (b*b)); k -= (l / 2); } else { s = s*a*a / ((a*a) + (b*b)); } l /= 2; } printf("%.12lf", log(s)); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...