import java.util.*; public class NonRepetitivePrimePartitions{ static List> allPartitions=new ArrayList>(); public static void main(String[] a){ int num=new Scanner(System.in). nextInt(); int[]numbers=findPrimes(num); int[]numHelper=new int[numbers.length]; for(int s=0,i=numbers.length; --i>=0;){ numHelper[i]=numbers[i]+s; s+=numbers[i]; } findPartitions(numbers,0,num,new int[numbers.length],0,numHelper,num); //display result: int res=allPartitions.size(); if(res==0) System.out.printf("Number %d have not non-repetitive prime partitions", num); else { System.out.printf("The set of prime numbers less than %d are:%n%s%n%nThere are %d prime partitions:%n", num, Arrays.toString(numbers),res); for(List l:allPartitions) System.out.println(l); } } static int[]findPrimes(int n){ int count=0; int[]primes=new int[n]; for(int i=1;i=1;j--) if(i%j==0) flag=flag+1; if (flag==1){ primes[count]=i; count++; } } int [] newArray=new int[count]; System.arraycopy(primes,0, newArray,0,count ); return newArray; } static void findPartitions(int[] numbers,int i,int sum, int[]partition, int ptr,int[] numHelper,int target){ if(sum==0&&partition[0]!=target) addPartitions(ptr,partition); else{ for(;i=sum;i++) if(numbers[i]<=sum){ partition[ptr++]= numbers[i]; findPartitions (numbers,i+1,sum-numbers[i],partition, ptr,numHelper,target); ptr--; } } } static void addPartitions(int ptr, int[] partition){ ArrayList list=new ArrayList<>(); for (int i=0; i

PrimesNonRepetitivePartitions