(int sum, int numPieces)
| 1384 | } |
| 1385 | |
| 1386 | public static TreeMap<Integer, Integer> integerDivided(int sum, int numPieces) { |
| 1387 | int base = sum / numPieces; |
| 1388 | int numInc = sum % numPieces; |
| 1389 | int numBases = numPieces - numInc; |
| 1390 | TreeMap<Integer, Integer> ret = new TreeMap<Integer, Integer>(); |
| 1391 | ret.put(base, numBases); |
| 1392 | if (numInc != 0) { |
| 1393 | ret.put(base + 1, numInc); |
| 1394 | } |
| 1395 | return ret; |
| 1396 | } |
| 1397 | |
| 1398 | /** |
| 1399 | * Fills up chunks out of a collection (given a maximum amount of chunks). |
no test coverage detected