Uva 107 The Cat in the Hat

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
#include<stack>
#include<cmath>
#define ep 1e-9

using namespace std;

int main()
{
	int init_height,worker;
	while(scanf("%d %d",&init_height,&worker))
	{
		if(init_height==0&&worker==0)
			break;
		int i,j;
		int exponent;
		double temp;
		for(exponent=0;exponent<100;exponent++)
		{
			temp=pow(pow(worker,1.0/exponent)+1.0,exponent*1.0);
			if(fabs(temp-init_height)<ep)
				break;
		}
		int N=pow(worker*1.0,1.0/exponent)+ep;
		int sum_height=0;
		int amount=0;
		for(i=0;i<exponent;i++)
		{
			sum_height=sum_height+init_height*(pow(N*1.0,i)+ep)+ep;
			amount=amount+pow(N*1.0,i)+ep;
			init_height=ceil(init_height*1.0/(N+1));
		}
		sum_height+=pow(N*1.0,exponent)+ep;
		printf("%d %d\n",amount,sum_height);
	}
	return 0;
}