Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class SumPrimeNonPrime {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- String input = scanner.nextLine();
- int sumPrime = 0;
- int sumNonPrime = 0;
- while (!input.equalsIgnoreCase("stop")) {
- int number = Integer.parseInt(input);
- boolean isPrime = true;
- if (number < 0) {
- System.out.println("Number is negative.");
- input = scanner.nextLine();
- continue;
- }
- if (number == 0 || number == 1) {
- isPrime = false;
- }
- for (int i = 2; i < number; i++) {
- if (number % i == 0 && i != number) {
- isPrime = false;
- }
- }
- if (isPrime) {
- sumPrime += number;
- } else {
- sumNonPrime += number;
- }
- input = scanner.nextLine();
- }
- System.out.printf("Sum of all prime numbers is: %d", sumPrime).println();
- System.out.printf("Sum of all non prime numbers is: %d", sumNonPrime).println();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement