How to calculate the sum of digits of 2 power 15 in C++

1 Answer

0 votes
#include <iostream>
#include <cmath>

int sumDigits(long num) {
    int sum = 0;
    while (num != 0) {
        sum += num % 10;
        num /= 10;
    }
      
    return sum;
}

int main() {
    int base = 2;
    int exponent = 15;
   
    long power = (long)pow(base, exponent); // 32768

    std::cout << sumDigits(power);
}
 
 
 
 
/*
run:
 
26

*/

 



answered Nov 10, 2023 by avibootz

Related questions

1 answer 129 views
1 answer 124 views
1 answer 127 views
1 answer 135 views
1 answer 138 views
1 answer 145 views
...