Skip to content

Problem 16 done in Java #111

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Problem 16 done in Java #111

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
ad02003
Add Python/35. Circular-Prime
Oct 10, 2019
3f611a7
Modified Python/35. Circular-Prime
Oct 10, 2019
a9a6a7b
Problem 16 done in JAVA
Oct 11, 2019
30df3ec
Modified Power digit-sum
Oct 12, 2019
45e9a45
Delete 35.Circular_Prime.py
aravp-mobile Oct 12, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
26 changes: 26 additions & 0 deletions Java/16. Power Digit Sum/power_sum.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
import java.math.BigInteger;

public class Problem16 {

public static void main(String[] args) {

int a = 2;
int b = 1000;
// Converting Integer to BigInteger.
BigInteger number = new BigInteger(String.valueOf(a));
// Getting 2^1000.
BigInteger power = number.pow(b);
// Converting BigInteger to String.
String powerInString = String.valueOf(power);
int length = powerInString.length();
int sum = 0;
int temp = 0;
for (int i = 0; i < length; i++) {
// Converting char to int.
temp = powerInString.charAt(i) - 48;
sum += temp;
}
System.out.println("The sum of the digits of the number 2^1000 is : " + sum);
}

}