View Discussion
Improve Article
Save Article
View Discussion
Improve Article
Save Article
Given a number, we need to find the sum of all the digits of a number which we get after raising the number to a specified
power.
Examples:
Input: number = 5, power = 4 Output: 13 Explanation: Raising 5 to the power 4 we get 625. Now adding all the digits = 6 + 2 + 5 Input: number = 9, power = 5 Output: 27 Explanation: Raising 9 to the power 5 we get 59049. Now adding all the digits = 5 + 9 + 0 + 4 + 9
The approach for Python is explained. we have used pow[] function to calculate the base to the power value. Then we have extracted every digit as string using str[] method. Since we can’t calculate the sum of strings, we converted every string digit back to integer using int[] method. Finally, we used sum[] function to get the sum of all the digits. This solution will look very simple in Python but it won’t be so short in other languages. After running both the codes, one can
compare the time elapsed and the memory used in both the given language i.e., Python and Java.
Below is the implementation of above idea :
C++
#include
using
namespace
std;
int
calculate[
int
n,
int
power]
{
int
sum = 0;
int
bp = [
int
]
pow
[n, power];
while
[bp != 0] {
int
d = bp % 10;
sum += d;
bp /= 10;
}
return
sum;
}
int
main[]
{
int
n = 5;
int
power = 4;
cout
Javascript
function
calculate[ n, power]
{
sum = 0;
bp = Math.pow[n, power];
while
[bp != 0] {
d = bp % 10;
sum =sum+ d;
bp = Math.floor[bp/ 10];
}
return
sum;
}
n = 5;
power = 4;
document.write[calculate[n, power]];
Output:
13
This article is contributed by Chinmoy Lenka. If you like GeeksforGeeks and would like to contribute, you can also write an article using
contribute.geeksforgeeks.org or mail your article to . See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.