2509.txt

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

Memory:32K  Time:0MS
Language:G++  Result:Accepted

Source 

#include <stdio.h>

int main()
{
	int n, k, m, r;

	while( scanf( "%d %d", &n, &k ) == 2 )
	{
		m = n;
		r = 0;
		while( n >= k )
		{
			r = n%k;
			m += n/k;
			n /= k;
			n += r;
		}

		printf( "%d\n" , m );
	}

	return 0;
}