|
| 1 | +import java.util.*; |
| 2 | +import java.util.regex.*; |
| 3 | +import java.text.*; |
| 4 | +import java.math.*; |
| 5 | +import java.awt.geom.*; |
| 6 | + |
| 7 | +public class TheJackpotDivTwo |
| 8 | +{ |
| 9 | + public int[] find(int[] money, int jackpot) |
| 10 | + { |
| 11 | + int x = jackpot; |
| 12 | + int i=0; |
| 13 | + while (x > 0) { |
| 14 | + int minn = 0; |
| 15 | + for (i = 1 ; i < money.length ; i++){ |
| 16 | + if (money[i] < money[minn]) { |
| 17 | + minn = i; |
| 18 | + } |
| 19 | + } |
| 20 | + money[minn] = money[minn] + 1; |
| 21 | + x--; |
| 22 | + } |
| 23 | + Arrays.sort(money); |
| 24 | + return money; |
| 25 | + } |
| 26 | + |
| 27 | + public static void main(String[] args) |
| 28 | + { |
| 29 | + long time; |
| 30 | + int[] answer; |
| 31 | + boolean errors = false; |
| 32 | + int[] desiredAnswer; |
| 33 | + |
| 34 | + boolean same; |
| 35 | + |
| 36 | + time = System.currentTimeMillis(); |
| 37 | + answer = new TheJackpotDivTwo().find(new int[]{1, 2, 3, 4}, 2); |
| 38 | + System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds"); |
| 39 | + desiredAnswer = new int[]{2, 3, 3, 4 }; |
| 40 | + System.out.println("Your answer:"); |
| 41 | + if (answer.length > 0) |
| 42 | + { |
| 43 | + System.out.print("\t{ " + answer[0]); |
| 44 | + for (int i=1; i<answer.length; i++) |
| 45 | + System.out.print(", " + answer[i]); |
| 46 | + System.out.println(" }"); |
| 47 | + } |
| 48 | + else |
| 49 | + System.out.println("\t{ }"); |
| 50 | + System.out.println("Desired answer:"); |
| 51 | + if (desiredAnswer.length > 0) |
| 52 | + { |
| 53 | + System.out.print("\t{ " + desiredAnswer[0]); |
| 54 | + for (int i=1; i<desiredAnswer.length; i++) |
| 55 | + System.out.print(", " + desiredAnswer[i]); |
| 56 | + System.out.println(" }"); |
| 57 | + } |
| 58 | + else |
| 59 | + System.out.println("\t{ }"); |
| 60 | + same = desiredAnswer.length == answer.length; |
| 61 | + for (int i=0; i<answer.length && same; i++) |
| 62 | + if (answer[i] != desiredAnswer[i]) |
| 63 | + same = false; |
| 64 | + if (!same) |
| 65 | + { |
| 66 | + errors = true; |
| 67 | + System.out.println("DOESN'T MATCH!!!!"); |
| 68 | + } |
| 69 | + else |
| 70 | + System.out.println("Match :-)"); |
| 71 | + System.out.println(); |
| 72 | + time = System.currentTimeMillis(); |
| 73 | + answer = new TheJackpotDivTwo().find(new int[]{4, 7}, 1); |
| 74 | + System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds"); |
| 75 | + desiredAnswer = new int[]{5, 7 }; |
| 76 | + System.out.println("Your answer:"); |
| 77 | + if (answer.length > 0) |
| 78 | + { |
| 79 | + System.out.print("\t{ " + answer[0]); |
| 80 | + for (int i=1; i<answer.length; i++) |
| 81 | + System.out.print(", " + answer[i]); |
| 82 | + System.out.println(" }"); |
| 83 | + } |
| 84 | + else |
| 85 | + System.out.println("\t{ }"); |
| 86 | + System.out.println("Desired answer:"); |
| 87 | + if (desiredAnswer.length > 0) |
| 88 | + { |
| 89 | + System.out.print("\t{ " + desiredAnswer[0]); |
| 90 | + for (int i=1; i<desiredAnswer.length; i++) |
| 91 | + System.out.print(", " + desiredAnswer[i]); |
| 92 | + System.out.println(" }"); |
| 93 | + } |
| 94 | + else |
| 95 | + System.out.println("\t{ }"); |
| 96 | + same = desiredAnswer.length == answer.length; |
| 97 | + for (int i=0; i<answer.length && same; i++) |
| 98 | + if (answer[i] != desiredAnswer[i]) |
| 99 | + same = false; |
| 100 | + if (!same) |
| 101 | + { |
| 102 | + errors = true; |
| 103 | + System.out.println("DOESN'T MATCH!!!!"); |
| 104 | + } |
| 105 | + else |
| 106 | + System.out.println("Match :-)"); |
| 107 | + System.out.println(); |
| 108 | + time = System.currentTimeMillis(); |
| 109 | + answer = new TheJackpotDivTwo().find(new int[]{1}, 100); |
| 110 | + System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds"); |
| 111 | + desiredAnswer = new int[]{101 }; |
| 112 | + System.out.println("Your answer:"); |
| 113 | + if (answer.length > 0) |
| 114 | + { |
| 115 | + System.out.print("\t{ " + answer[0]); |
| 116 | + for (int i=1; i<answer.length; i++) |
| 117 | + System.out.print(", " + answer[i]); |
| 118 | + System.out.println(" }"); |
| 119 | + } |
| 120 | + else |
| 121 | + System.out.println("\t{ }"); |
| 122 | + System.out.println("Desired answer:"); |
| 123 | + if (desiredAnswer.length > 0) |
| 124 | + { |
| 125 | + System.out.print("\t{ " + desiredAnswer[0]); |
| 126 | + for (int i=1; i<desiredAnswer.length; i++) |
| 127 | + System.out.print(", " + desiredAnswer[i]); |
| 128 | + System.out.println(" }"); |
| 129 | + } |
| 130 | + else |
| 131 | + System.out.println("\t{ }"); |
| 132 | + same = desiredAnswer.length == answer.length; |
| 133 | + for (int i=0; i<answer.length && same; i++) |
| 134 | + if (answer[i] != desiredAnswer[i]) |
| 135 | + same = false; |
| 136 | + if (!same) |
| 137 | + { |
| 138 | + errors = true; |
| 139 | + System.out.println("DOESN'T MATCH!!!!"); |
| 140 | + } |
| 141 | + else |
| 142 | + System.out.println("Match :-)"); |
| 143 | + System.out.println(); |
| 144 | + time = System.currentTimeMillis(); |
| 145 | + answer = new TheJackpotDivTwo().find(new int[]{21, 85, 6, 54, 70, 100, 91, 60, 71}, 15); |
| 146 | + System.out.println("Time: " + (System.currentTimeMillis()-time)/1000.0 + " seconds"); |
| 147 | + desiredAnswer = new int[]{21, 21, 54, 60, 70, 71, 85, 91, 100 }; |
| 148 | + System.out.println("Your answer:"); |
| 149 | + if (answer.length > 0) |
| 150 | + { |
| 151 | + System.out.print("\t{ " + answer[0]); |
| 152 | + for (int i=1; i<answer.length; i++) |
| 153 | + System.out.print(", " + answer[i]); |
| 154 | + System.out.println(" }"); |
| 155 | + } |
| 156 | + else |
| 157 | + System.out.println("\t{ }"); |
| 158 | + System.out.println("Desired answer:"); |
| 159 | + if (desiredAnswer.length > 0) |
| 160 | + { |
| 161 | + System.out.print("\t{ " + desiredAnswer[0]); |
| 162 | + for (int i=1; i<desiredAnswer.length; i++) |
| 163 | + System.out.print(", " + desiredAnswer[i]); |
| 164 | + System.out.println(" }"); |
| 165 | + } |
| 166 | + else |
| 167 | + System.out.println("\t{ }"); |
| 168 | + same = desiredAnswer.length == answer.length; |
| 169 | + for (int i=0; i<answer.length && same; i++) |
| 170 | + if (answer[i] != desiredAnswer[i]) |
| 171 | + same = false; |
| 172 | + if (!same) |
| 173 | + { |
| 174 | + errors = true; |
| 175 | + System.out.println("DOESN'T MATCH!!!!"); |
| 176 | + } |
| 177 | + else |
| 178 | + System.out.println("Match :-)"); |
| 179 | + System.out.println(); |
| 180 | + |
| 181 | + |
| 182 | + if (errors) |
| 183 | + System.out.println("Some of the test cases had errors :-("); |
| 184 | + else |
| 185 | + System.out.println("You're a stud (at least on the test data)! :-D "); |
| 186 | + } |
| 187 | + |
| 188 | +} |
| 189 | +//Powered by [KawigiEdit] 2.0! |
0 commit comments