Advertisement
Ivelin_Arsov

Sum Prime Non Prime

Feb 16th, 2020
128
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.09 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class SumPrimeNonPrime {
  4.     public static void main(String[] args) {
  5.         Scanner scan = new Scanner(System.in);
  6.         String input = scan.nextLine();
  7.         int primeSum = 0;
  8.         int nonPrimeSum = 0;
  9.  
  10.         while (!"stop".equals(input)) {
  11.             int currentNumber = Integer.parseInt(input);
  12.             if (currentNumber < 0) {
  13.                 System.out.println("Number is negative.");
  14.                 input =scan.nextLine();
  15.                 continue;
  16.             }
  17.             boolean isPrime = true;
  18.             for (int i = 2; i < currentNumber; i++) {
  19.                 if (currentNumber % i == 0) {
  20.                     isPrime = false;
  21.                     break;
  22.                 }
  23.             }
  24.             if(isPrime) {
  25.                 primeSum +=currentNumber;
  26.             } else {
  27.                 nonPrimeSum +=currentNumber;
  28.             }
  29.             input = scan.nextLine();
  30.         }
  31.  
  32.         System.out.printf("Sum of all prime numbers is: %d%nSum of all non prime numbers is: %d", primeSum, nonPrimeSum);
  33.     }
  34. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement