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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

'use strict' 
function main(input) {
    var arg = input.split(' ');
    var N = parseInt(arg[0]);
    var K = parseInt(arg[1]);
    var tmpAns = 0;
    var counter = 0;
    while (1) {
        tmpAns = parseInt(N / K);
        N = tmpAns;
        console.log(tmpAns);
        counter++;
        if (N/K < 1) {
            counter++;
            break;
        }
    };
    console.log(counter);
}

// 変更しない
main(require('fs').readFileSync('/dev/stdin', 'utf8'));