3066.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:3066  User Id:fzk 
Memory:32K  Time:0MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>
#include <memory.h>
#include <math.h>
#include <algorithm>
using namespace std;

int main( ) {
	int m, p, a, b, k, i;
	double sum, q_a, a_p, ans, t;
	while( scanf( "%d%d%d%d", &m, &p, &a, &b ) == 4 ) {
		q_a = sqrt(a);
		sum = b*q_a+m/q_a;
		
		k = int(sum/(q_a+1.0/q_a)+1e-6);
		
		sum -= k*(q_a+1.0/q_a) + 1/q_a;
		
		while( k > m )
			;

		for( a_p=1, i=0; i<p/2; i++ )
			a_p *= a;
		
		ans = k*a_p;
		if( k != m ) {
			for( t=1, i=0; i<p; i++ )
				t *= sum;
			ans += (m-k-1)/a_p + t;
		}
		


		printf( "%.0lf\n", ans );
	}
	return 0;
}