c2c-translator/data/geeks_for_geeks_dataset/java/FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2.java
<filename>c2c-translator/data/geeks_for_geeks_dataset/java/FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2.java// Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//

import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2{
static int f_gold ( int ar [ ] , int ar_size ) {
  int i ;
  int res = 0 ;
  for ( i = 0 ;
  i < ar_size ;
  i ++ ) {
    res = res ^ ar [ i ] ;
  }
  return res ;
}


//TOFILL

public static void main(String args[]) {
    int n_success = 0;
    List<int [ ]> param0 = new ArrayList<>();
    param0.add(new int[]{1,1,7,10,12,19,20,22,23,25,27,32,33,39,43,44,45,46,47,47,48,49,50,51,55,58,68,69,73,76,77,79,81,84,92,95,99});
    param0.add(new int[]{-12,-40,-68});
    param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
    param0.add(new int[]{86,56,98,58,7,40,84,45,69,77,36,50,72,99,95});
    param0.add(new int[]{-90,-68,-66,-66,-58,-54,-52,-48,-40,-30,-26,-24,-20,-14,-10,-8,-6,-6,-6,18,30,34,36,42,50,56,64,68,70,74,92,92,98});
    param0.add(new int[]{0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,1,0,1,0,1,1,1,1,0,0,1,0,0,0});
    param0.add(new int[]{3,21,47,51,78,84,84,85,86,99});
    param0.add(new int[]{-26,-72,44,62,-22,22,28,-28,32,-72,72,96,92,-52,-2,-22,-76,-88,-74,-8,-30,54,0,-62,14,-92,-58,72,40,46,96,86,-54,-92,46,92,20,-96,-92,-70,-94,78,-92,-54,-90});
    param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
    param0.add(new int[]{69,1,12,81,78,18,81,47,49,19,99,40,52,47,71,69,80,72,66,84,72,6,98,89,3,87,81,85,37,14,5,36,26,74});
    List<Integer> param1 = new ArrayList<>();
    param1.add(36);
    param1.add(2);
    param1.add(21);
    param1.add(9);
    param1.add(26);
    param1.add(27);
    param1.add(9);
    param1.add(33);
    param1.add(9);
    param1.add(22);
    for(int i = 0; i < param0.size(); ++i)
    {
        if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
        {
            n_success+=1;
        }
    }
    System.out.println("#Results:" + n_success + ", " + param0.size());
}
}