output_description: Print the number of digits that N has in base K.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: a, b = map(int, input().split())
  if b == 2:
      a = format(a, "b")
  elif b == 8:
      a = format(a, "o")
  elif b == 10:
      a = int(a)
  print(len(a))
  
problem_description: Statement
  
  Given is an integer N. Find the number of digits that N has in base K.
samples: [{"input": "11 2", "output": "4\n    \n\nIn binary, 11 is represented as `1011`.\n\n* * *"}, {"input": "1010101 10", "output": "7\n    \n\n* * *"}, {"input": "314159265 3", "output": "18"}]