Number of digits in 2 raised to power n in C++

The power of a number can be computed using the iterative multiplication or function that the language provides. It's a straightforward thing.

Here, we have to find the 2 raised to power n. And the number of digits in the result. Let's see some examples.

Input

5

Output

2

Input

10

Output

4

Algorithm

• Initialise the number n.
• Find the value of 2ⁿ.
• The ceil of log10(n) will give you number of digits in the number n.
• Find it and return it.

Implementation

Following is the implementation of the above algorithm in C++

#include <bits/stdc++.h>
using namespace std;
int getDigitsCount(int n) {
   return ceil(log10(pow(2, n)));
}
int main() {
   int n = 8;
   cout << getDigitsCount(n) << endl;
   return 0;
}

Output

If you run the above code, then you will get the following result.

3

Hafeezul Kareem

Published on 03-Jul-2021 04:57:34

• Related Questions & Answers
• Find value of y mod (2 raised to power x) in C++
• Find last five digits of a given five digit number raised to power five in C++
• Sum of the digits of a number N written in all bases from 2 to N/2 in C++
• C/C++ Program to Find sum of Series with n-th term as n power of 2 - (n-1) power of 2
• Program to find last two digits of 2^n in C++
• Reordered Power of 2 in C++
• n-th number with digits in {0, 1, 2, 3, 4, 5} in C++
• Power of a prime number r in n! in C++
• Nearest power 2 of a number - JavaScript
• Compute modulus division by a power-of-2-number in C#
• Finding n-th number made of prime digits (2, 3, 5 and 7) only in C++
• Number of pairs whose sum is a power of 2 in C++
• Minimum removals in a number to be divisible by 10 power raised to K in C++
• How to check if a number is a power of 2 in C#?
• Count total number of digits from 1 to N in C++