4066737_ac_0ms_404k.cc

北大大牛代码 1240道题的原代码 超级权威

#include <iostream>
#include <cmath>
using namespace std;
int m, p, a, b;

void work()
{
	int mus_p=0,mus_n=0;
	if(b>0)
	{
		mus_p = b;
	}
	if(b<0)
	{
		mus_n = -1*b*a;
	}
	int left = m - mus_p-mus_n;
	int pl = left/(a+1);//
	int n = pl*a; //

	int mod1 = left%(a+1);
	int m_n = mod1-1;
	if (m_n == -1)	m_n = 0;
	double m_p_t = (double)(m_n)/sqrt((double)a);
	double rst =0.0; 
	rst +=(double)(mus_p+pl) * pow( (double)a,(double)(p/2));
	rst +=(double)(mus_n + n + m_n) * pow(1.0/(double)a,(double)(p/2));
	rst +=pow(m_p_t,(double)p);
	printf("%.0f\n",rst);
}

int main()
{
	while (scanf("%d%d%d%d",&m,&p,&a,&b)!=EOF)
	{
		work();
	}
	return 0;
}