For this Question: Bob loves to play with numbers. He has an integer N. Find the number of digits that N has in base K.The input contains two space-separated integers in the following format:
N K

<b>Constraints</b>
All values in the input are integers.
1 &le; N &le; 10<sup>9</sup>
 2 &le; K &le; 10Print the number of digits that N has in base K.<b>Sample Input 1</b> 
11 2
<b>Sample Output 1</b> 
4

<b>Sample Input 2</b> 
1010101 10
<b>Sample Output 2</b> 
7

<b>Sample Input 3</b> 
314159265 3
<b>Sample Output 3</b> 
18, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const ll mod=1000000007,MAX=200005,INF=1<<30;
 
int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N,K;cin>>N>>K;
    int cnt=0;
    while(N){
        N-=N%K;
        N/=K;
        cnt++;
    }
    
    cout<<cnt<<endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?