fork download
  1.  
  2. import java.io.IOException;
  3. import java.math.BigDecimal;
  4. import java.math.BigInteger;
  5. import java.util.Arrays;
  6. import java.util.Scanner;
  7.  
  8. public class Main {
  9.  
  10. static Scanner input = new Scanner(System.in);
  11.  
  12. public static void main(String[] args) throws IOException {
  13. int cnt = 1, flag = 0;
  14. while (true) {
  15. int tc = input.nextInt();
  16. if (tc == 0) {
  17. break;
  18. }
  19. if (flag == 1) {
  20. System.out.println("");
  21. }
  22. flag = 1;
  23. int array[] = new int[tc];
  24. long sum = 0;
  25. for (int i = 0; i < tc; i++) {
  26. array[i] = input.nextInt();
  27. }
  28. for (int i = 0; i < tc; i++) {
  29. sum += array[i];
  30. }
  31. int fix = 0;
  32. for (int i = 1; i <= 50; i++) {
  33. if (sum % i == 0) {
  34. int res = (int) sum / i;
  35. if (res == tc) {
  36. fix = i;
  37. break;
  38. }
  39. }
  40. }
  41. int sm = 0;
  42. for (int i = 0; i < array.length; i++) {
  43. if (array[i] < fix) {
  44. sm += (fix - array[i]);
  45. }
  46. }
  47. System.out.println("Set #" + cnt);
  48. System.out.println("The minimum number of moves is " + sm + ".");
  49. cnt++;
  50. }
  51. }
  52. }
  53.  
Success #stdin #stdout 0.14s 37884KB
stdin
6
5 2 4 1 7 5
4
1 1 3 3
5
5 5 5 5 5
6
1 1 1 1 1 19
0
stdout
Set #1
The minimum number of moves is 5.

Set #2
The minimum number of moves is 2.

Set #3
The minimum number of moves is 0.

Set #4
The minimum number of moves is 15.