Problem:
Score : 200 points

Problem Statement

Given is an integer N. Find the number of digits that N has in base K.

Notes

For information on base-K representation, see Positional notation - Wikipedia.

Constraints

All values in input are integers.

1 \leq N \leq 10^9

2 \leq K \leq 10

Input

Input is given from Standard Input in the following format:

N K

Output

Print the number of digits that N has in base K.

Sample Input 1

11 2

Sample Output 1

4

In binary, 11 is represented as 1011.

Sample Input 2

1010101 10

Sample Output 2

7

Sample Input 3

314159265 3

Sample Output 3

18

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include <stdio.h>

int ft_cal_digit(int integer, int base_num)
{
	int count = 1;
	int quot = integer;

	if(integer < base_num)
	{
		printf('0\n');
		return (0);
	}
	else
	{
		while(quot >= base_num)
		{
			quot = (quot / base_num);

			count++;
		}
		printf("%d\n", count);
	}
	return (0);
}

int	main(void)
{
	int integer = 0;
	int base_num = 0;

	scanf("%d %d", &integer, &base_num);

	ft_cal_digit(integer, base_num);

	return (0);
}