Advertisement
Guest User

C to Java

a guest
Oct 18th, 2012
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.68 KB | None | 0 0
  1.         int[] seq = new int[num/2];
  2.         int seqIndex = 0;
  3.         int prime = highestPrimes[num+1];
  4.         int solves = 0;
  5.         for(;;) {
  6.             num -= prime;
  7.             seq[seqIndex++] = prime;
  8.             if(num == 0) {
  9.                 ++solves;
  10.                 seqs.add(seq);
  11.             }
  12.             if(num <= 0) {
  13.                 prime = -1;
  14.             }
  15.             while(prime < 0 && seqIndex > 0) {
  16.                 prime = seq[--seqIndex];
  17.                 num += prime;
  18.                 prime = highestPrimes[prime];
  19.             }
  20.             if(prime < 0 && seqIndex <= 0) {
  21.                 break;
  22.             }
  23.         }
  24. /*
  25. Output:
  26.  
  27. 12: 2 2 2 2 2 2
  28. 12: 2 2 2 2 2 2
  29. 12: 2 2 2 2 2 2
  30. 12: 2 2 2 2 2 2
  31. 12: 2 2 2 2 2 2
  32. 12: 2 2 2 2 2 2
  33. 12: 2 2 2 2 2 2
  34. 12: 2 2 2 2 2 2
  35. 12: 2 2 2 2 2 2
  36. 12: 2 2 2 2 2 2
  37. 12: 2 2 2 2 2 2
  38. 12: 2 2 2 2 2 2
  39. 12: 2 2 2 2 2 2
  40. */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement