fork(1) download
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. /* Name of the class has to be "Main" only if the class is public. */
  8. class Ideone
  9. {
  10. public static void main (String[] args) throws java.lang.Exception
  11. {
  12.  
  13. // your code goes here
  14. test();
  15. }
  16.  
  17.  
  18. static void test() {
  19. int[][] field = new int[][] {
  20. {2, 2, 2, 2, 2, 2, 2, 1, 4, 5},
  21. {0, 11, 1, 8, 2, 6, 1, 1, 1, 1},
  22. {7, 3, 0, 7, 1, 0, 2, 4, 0, 4},
  23. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
  24. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
  25. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
  26. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
  27. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
  28. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
  29. };
  30. Random rng = new Random();
  31. for (int r = 3; r < field.length; r++) {
  32. for (int c = 0; c < 10; c++)
  33. field[r][c] = rng.nextInt(10);
  34. }
  35.  
  36. int count = 0;
  37. for (int r = 0; r < field.length; r++) {
  38. int[] sum = new int[11];
  39. System.out.println("row: " + r);
  40. for (int i = 0; i < 10; i++) {
  41. System.out.print(" " + field[r][i]);
  42. if (field[r][i] == 0)
  43. sum[i + 1] = -sum[i];
  44. else
  45. sum[i + 1] = sum[i] + field[r][i];
  46. }
  47. System.out.println();
  48. for (int c1 = 0; c1 < 10; c1++) {
  49. for (int c2 = c1; c2 < 10; c2++) {
  50. int s = sum[c2+1] - sum[c1];
  51. if (s == 10) {
  52. count += c2 - c1 + 1;
  53. System.out.printf("%d -> %d (%d)%n", c1, c2, c2 - c1 + 1);
  54. for (int i = c1; i <= c2; i++) {
  55. System.out.printf(" %d", field[r][i]);
  56. }
  57. System.out.println();
  58. }
  59. }
  60. }
  61. }
  62. }
  63. }
Success #stdin #stdout 0.13s 35304KB
stdin
Standard input is empty
stdout
row: 0
 2 2 2 2 2 2 2 1 4 5
0 -> 4 (5)
 2 2 2 2 2
1 -> 5 (5)
 2 2 2 2 2
2 -> 6 (5)
 2 2 2 2 2
7 -> 9 (3)
 1 4 5
row: 1
 0 11 1 8 2 6 1 1 1 1
3 -> 4 (2)
 8 2
4 -> 7 (4)
 2 6 1 1
5 -> 9 (5)
 6 1 1 1 1
row: 2
 7 3 0 7 1 0 2 4 0 4
0 -> 1 (2)
 7 3
5 -> 7 (3)
 0 2 4
row: 3
 1 9 8 5 9 6 1 4 3 1
0 -> 1 (2)
 1 9
row: 4
 7 5 1 0 0 4 9 1 0 2
1 -> 5 (5)
 5 1 0 0 4
6 -> 7 (2)
 9 1
row: 5
 0 9 3 3 8 0 1 0 3 7
3 -> 7 (5)
 3 8 0 1 0
4 -> 8 (5)
 8 0 1 0 3
8 -> 9 (2)
 3 7
row: 6
 6 6 2 9 1 9 9 3 8 9
3 -> 4 (2)
 9 1
4 -> 5 (2)
 1 9
row: 7
 1 4 6 8 7 5 3 5 5 7
1 -> 2 (2)
 4 6
7 -> 8 (2)
 5 5
row: 8
 3 7 1 2 8 4 9 5 6 0
0 -> 1 (2)
 3 7
1 -> 3 (3)
 7 1 2
3 -> 4 (2)
 2 8