For this Question: IPL is around the corner. Nitin Menon loves to represent all the numbers in the form of 1 or 0 or some combination of it. Given a number n, you are asked to help him represent n as a sum of some (not necessarily distinct) binary decimals (a number is called a binary decimal if it's a positive integer and all digits in its decimal notation are either 0 or 1). Compute the smallest number of binary decimals required for that.The input consists of an integer n denoting the number to be represented.

<b>Constraints</b>
1 &le; n &le; 10<sup>9</sup>Print the smallest number of binary decimals required to represent n as a sum.<b>Sample Input 1</b>
121
<b>Sample Output 1</b>
2

<b>Sample Input 2</b>
5
<b>Sample Output 2</b>
5, I have written this Solution Code: #include <bits/stdc++.h>

using i64 = long long;

int main() {
    int t=1;
  //  std::cin >> t;
    while (t--) {
        int n;
        std::cin >> n;
        
        auto s = std::to_string(n);
        
        std::cout << (*std::max_element(s.begin(), s.end()) - '0') << "\n";
    }
    
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?