UVA 107 The Cat in the Hat

公式雖已推出，但當n=1 時需要特判，下面代碼中會提到

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
    int H,W,N;
    while(scanf("%d%d",&H,&W),H&&W)
    {
        N=1;
        while(fabs(log(H)/log(N+1)-log(W)/log(N))>1e-10)
            N++;
        if(N==1)//當N=1時(M-1)/(N-1)會RE
            printf("%d ",int(log(H)/log(N+1)+0.5));//即直接輸出k
        else
            printf("%d ",(int)((W-1)/(N-1)));
        printf("%d\n",(int)(H*(1+N)-W*N));
    }
    return 0;
}