fork download
  1. class Ideone{
  2. void s(int[]a){for(int i=0,j,n=a.length,b=1;i<n;a[i++]=b,b=1)for(j=i+1;j<n;)b=a[i]==a[j++]?0:b;}
  3. public static void main (String[] args){
  4. int[][]testcases = new int[][]{
  5. {0},
  6. {55},
  7. {32,44},
  8. {0,0},
  9. {9001,9001,9001},
  10. {5,4,7,1},
  11. {1,2,3,4,3,5},
  12. {5,9,7,5,6,0,5},
  13. {0,8,6,6,3,8,7,2},
  14. {45,47,47,45,24,24,24,8,47,41,47,88},
  15. {154,993,420,154,154,689,172,417,790,175,790,790,154,172,175,175,420,417,154,175,172,175,172,993,689,993,993,790}
  16. };
  17. for(int i=0;i<testcases.length;i++){
  18. int[] temp = testcases[i];
  19. new Ideone().s(temp);
  20. System.out.println(java.util.Arrays.toString(temp));
  21. }
  22. }
  23. }
Success #stdin #stdout 0.09s 320576KB
stdin
Standard input is empty
stdout
[1]
[1]
[1, 1]
[0, 1]
[0, 0, 1]
[1, 1, 1, 1]
[1, 1, 0, 1, 1, 1]
[0, 1, 1, 0, 1, 1, 1]
[1, 0, 0, 1, 1, 1, 1, 1]
[0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1]