Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class PrimeNumber
- {
- public static void main(String[] args)
- {
- ArrayList<Integer> prime = new ArrayList<Integer>();
- prime.add(2);
- for(int num = 3; num <= 10000; num+=2)
- {
- boolean isPrime = true;
- for(int prim : prime)
- {
- if(num % prim == 0)
- {
- isPrime = false;
- break;
- }
- }
- if(isPrime)
- prime.add(num);
- }
- // prime is prime numbers from 0-10000 in order
- while(true)
- {
- Scanner sc = new Scanner(System.in);
- int user = sc.nextInt();
- if(user == 0)
- {
- break;
- }
- int count = 0;
- int index = 0;
- while(index < prime.size() && prime.get(index) <= user)
- {
- int result = 0;
- int index_in = 0;
- while(index+index_in < prime.size() && result < user)
- {
- result+= prime.get(index + index_in);
- index_in++;
- }
- if(result == user)
- {
- count++;
- }
- index++;
- }
- System.out.println(count);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment