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 (Clang 3.8.0) (judge verdict: Accepted)

#include <stdio.h>

int main () {
    int N;
    int R;
    int temp;
    int temp2;
    int digits_NbaseR = 0;
    /*
    int factor = 1;
    int NbaseR = 0;
    */
    int remainder_A;

    
    scanf("%d %d",&N,&R);
    
    temp = N;
    while (temp > 0) {
        temp2 = temp%R;
        /*
        NbaseR += temp2*factor;
        factor *= 10; 
        */
        temp = temp/R;
        digits_NbaseR++;
    }
    

    remainder_A = digits_NbaseR;
    
    printf("%d",remainder_A);
    
    return 0;

}