{"raw_statement":[{"iden":"problem statement","content":"Given is an integer $N$. Find the number of digits that $N$ has in base $K$."},{"iden":"notes","content":"For information on base-$K$ representation, see [Positional notation - Wikipedia](https://en.wikipedia.org/wiki/Positional_notation)."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 10^9$\n*   $2 \\leq K \\leq 10$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"11 2"},{"iden":"sample output 1","content":"4\n\nIn binary, $11$ is represented as `1011`."},{"iden":"sample input 2","content":"1010101 10"},{"iden":"sample output 2","content":"7"},{"iden":"sample input 3","content":"314159265 3"},{"iden":"sample output 3","content":"18"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}