oj.uz

Submission #15349

# Submission time Handle Problem Language Result Execution time Memory
15349 2015-07-12T06:29:19 Z skeksk91 맛있는 과자 (kriii3_A) C++
0 / 33
 0 ms 1192 KB 
#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;
	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/2));

}

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 -