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 9.2.1) (judge verdict: Wrong Answer)

int pwo(int x,int y)
{
    int i,a;
    a = x;
    if(y == 0)
    {
        return 1;
    }
    for(i = 1 ; i < y ; i++)
    {
        x = x*a;

    }
    return x;
}
#include<stdio.h>

int main(void)
{
    long int n,x,b;
    int k,i,j,a[100];
    scanf("%ld %d",&n,&k);
    i = 1;
    while(n > pwo(k,i))
    {
        a[i] = n % pwo(k,i);
        
        
        i++;
    }
    printf("%d\n",i);
    
    return 0;
}