index
int64
0
0
repo_id
stringlengths
9
205
file_path
stringlengths
31
246
content
stringlengths
1
12.2M
__index_level_0__
int64
0
10k
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_SUBSEQUENCES_STRING_DIVISIBLE_N.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 NUMBER_SUBSEQUENCES_STRING_DIVISIBLE_N{ static int f_gold ( String str , int n ) { int len = str . length ( ) ; int dp [ ] [ ] = new int [ len ] [ n ] ; dp [ 0 ] [ ( str . charAt ( 0 ) - '0' ) % n ] ++ ; for ( int i = 1 ; i < len ; i ++ ) { dp [ i ] [ ( str . charAt ( i ) - '0' ) % n ] ++ ; for ( int j = 0 ; j < n ; j ++ ) { dp [ i ] [ j ] += dp [ i - 1 ] [ j ] ; dp [ i ] [ ( j * 10 + ( str . charAt ( i ) - '0' ) ) % n ] += dp [ i - 1 ] [ j ] ; } } return dp [ len - 1 ] [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("fYqkPLSWBgFy"); param0.add("151587"); param0.add("111111110"); param0.add("JQJHaUkkTrt"); param0.add("736592575580"); param0.add("10"); param0.add("L"); param0.add("3476601"); param0.add("0110001001"); param0.add("YimayLFU"); List<Integer> param1 = new ArrayList<>(); param1.add(55); param1.add(84); param1.add(9); param1.add(97); param1.add(68); param1.add(3); param1.add(74); param1.add(2); param1.add(53); param1.add(45); 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()); } }
900
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS.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 ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS{ static int f_gold ( int x , int y ) { while ( y != 0 ) { int carry = x & y ; x = x ^ y ; y = carry << 1 ; } return x ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(56); param0.add(17); param0.add(73); param0.add(75); param0.add(27); param0.add(61); param0.add(65); param0.add(22); param0.add(61); param0.add(97); List<Integer> param1 = new ArrayList<>(); param1.add(60); param1.add(44); param1.add(96); param1.add(3); param1.add(54); param1.add(1); param1.add(63); param1.add(19); param1.add(9); param1.add(23); 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()); } }
901
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_OPERATIONS_MAKE_STRINGAB_FREE.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 COUNT_OPERATIONS_MAKE_STRINGAB_FREE{ static int f_gold ( char [ ] s ) { int b_count = 0 ; int res = 0 ; for ( int i = 0 ; i < s . length ; i ++ ) { if ( s [ s . length - i - 1 ] == 'a' ) { res = ( res + b_count ) ; b_count = ( b_count * 2 ) ; } else { b_count += 1 ; } } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<char [ ]> param0 = new ArrayList<>(); param0.add(new char[]{'L','k','y'}); param0.add(new char[]{'1','0','9','5','7','4','6','0','4','8','0','1','4','1','8','9','1','5','4','4','8','0','5','8','9','8','1','9','7','0','4','2','5','2','4','6','6','5','3','1','1','0','6'}); param0.add(new char[]{'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'}); param0.add(new char[]{'A','L','a','l','G',' ','p','b'}); param0.add(new char[]{'0','1','1','1','2','2','4','5','5','5','6','6','6','7','9'}); param0.add(new char[]{'0'}); param0.add(new char[]{' ','A','B','B','B','B','D','G','G','H','H','H','I','I','J','J','J','L','M','N','O','Q','U','U','X','Y','Y','Z','Z','c','c','e','f','h','k','o','p','q','q','s','v','z'}); param0.add(new char[]{'2','5','7','5','2','3','9'}); param0.add(new char[]{'0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'}); param0.add(new char[]{'a','z','M',' ','l','X','x','B','i','j'}); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
902
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD.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 SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD{ static int f_gold ( int a [ ] , int b [ ] , int n ) { int i ; int s = 0 ; for ( i = 0 ; i < n ; i ++ ) s += ( a [ i ] + b [ i ] ) ; if ( n == 1 ) return a [ 0 ] + b [ 0 ] ; if ( s % n != 0 ) return - 1 ; int x = s / n ; for ( i = 0 ; i < n ; i ++ ) { if ( a [ i ] > x ) return - 1 ; if ( i > 0 ) { a [ i ] += b [ i - 1 ] ; b [ i - 1 ] = 0 ; } if ( a [ i ] == x ) continue ; int y = a [ i ] + b [ i ] ; if ( i + 1 < n ) y += b [ i + 1 ] ; if ( y == x ) { a [ i ] = y ; b [ i ] = 0 ; continue ; } if ( a [ i ] + b [ i ] == x ) { a [ i ] += b [ i ] ; b [ i ] = 0 ; continue ; } if ( i + 1 < n && a [ i ] + b [ i + 1 ] == x ) { a [ i ] += b [ i + 1 ] ; b [ i + 1 ] = 0 ; continue ; } return - 1 ; } for ( i = 0 ; i < n ; i ++ ) if ( b [ i ] != 0 ) return - 1 ; return x ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,9,16,18,20,23,24,25,25,26,29,30,35,40,41,43,44,46,53,53,56,56,58,60,62,70,80,80,80,82,86,90,92,92,95}); param0.add(new int[]{-24,70,-74,-90,72,50,-94,86,-58,-68,42,0,98,-70,-14,-32,6,74,64,-78,86,-42,-56,2,-34,-46,70,-62,50,-58,-58,42,86,96,-8,8,-22,-14,-14,98,2,98,-28}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{98,18,50,36,88,75,2,40,74,19,63,82,77,5,59,97,70,50,71,90,90,61,63,99}); param0.add(new int[]{-80,-64,-64,-64,-64,-62,-54,-48,-44,-44,-38,-30,-30,-26,-14,-12,-10,-6,-6,6,22,22,22,26,28,50,52,70,86,86,88,90}); param0.add(new int[]{0,1,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0,1,1,1,0,0,1,1,0,0,1}); param0.add(new int[]{59,61,64}); param0.add(new int[]{98,92,28,42,-74,-36,40,-8,32,-22,-70,-22,-56,74,6,6,-62,46,34,2}); 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,1,1}); param0.add(new int[]{72,97,79,21,83,2,31,59,6,11,79,97}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{3,15,16,16,18,26,30,32,32,35,37,41,42,43,48,49,49,54,55,57,65,66,67,67,68,83,85,89,89,90,91,93,96,97,99}); param1.add(new int[]{-26,36,48,48,-38,-86,90,-62,30,-4,82,16,32,-6,58,82,-66,-40,52,-78,94,-70,-80,-68,-58,-26,50,-78,-90,-48,-28,48,56,50,72,-22,-2,8,-94,92,-44,-66,-30}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param1.add(new int[]{93,25,16,42,55,61,69,68,95,28,40,90,1,86,76,40,13,47,71,4,64,54,84,45}); param1.add(new int[]{-96,-94,-80,-74,-64,-56,-52,-32,-30,-24,-12,-12,-8,-2,4,8,16,20,24,24,24,48,50,54,60,64,74,80,88,90,92,92}); param1.add(new int[]{1,1,1,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1}); param1.add(new int[]{22,59,85}); param1.add(new int[]{-62,-84,72,60,10,-18,-44,-22,14,0,76,72,96,-28,-24,52,-74,-30,16,66}); param1.add(new int[]{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,1,1,1,1}); param1.add(new int[]{27,71,87,36,73,37,80,34,57,17,88,52}); List<Integer> param2 = new ArrayList<>(); param2.add(29); param2.add(34); param2.add(13); param2.add(16); param2.add(22); param2.add(20); param2.add(1); param2.add(18); param2.add(34); param2.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
903
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1.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 HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1{ static boolean f_gold ( int arr [ ] , int n ) { for ( int i = 0 ; i <= ( n - 2 ) / 2 ; i ++ ) { if ( arr [ 2 * i + 1 ] > arr [ i ] ) { return false ; } if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) { return false ; } } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,2,2,7,10,14,24,38,42,50,59,60,72,73,79,83,89}); param0.add(new int[]{-48,98,96,-56,-2,58,52,-50,58,50,62,86,-26,-98,34,20,-28,56,-36}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{91,50,37}); param0.add(new int[]{-80,-26,0,0,6,14,22,76,82,88,98}); param0.add(new int[]{1,0}); param0.add(new int[]{9,24,24,33,48,50,55,61,69,79,83}); param0.add(new int[]{30,32,-82,-48,88,-24,74,2,90,98,68,82,32,-60,2,-94,18,14,46,50,-60,-74,-76,66,-76,-34,-20,82,-44,-62,34,48,-56,2,64,-78,-64,98,-10,-28,78,-42}); param0.add(new int[]{0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{38,74,99,75,44,75,24,70,78,74,60,59,34,27,7,23,19,95,4,35,38,22,46,1,44,20,52,1,96,57,5,76,49,1,37,35}); List<Integer> param1 = new ArrayList<>(); param1.add(9); param1.add(9); param1.add(20); param1.add(2); param1.add(10); param1.add(1); param1.add(8); param1.add(27); param1.add(6); param1.add(31); 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()); } }
904
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_DIGITS_REMOVED_MAKE_NUMBER_DIVISIBLE_3.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 NUMBER_DIGITS_REMOVED_MAKE_NUMBER_DIVISIBLE_3{ static int f_gold ( String num ) { int n = num . length ( ) ; int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += ( int ) ( num . charAt ( i ) ) ; if ( sum % 3 == 0 ) return 0 ; if ( n == 1 ) return - 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( sum % 3 == ( num . charAt ( i ) - '0' ) % 3 ) return 1 ; if ( n == 2 ) return - 1 ; return 2 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("wVVe"); param0.add("850390909067"); param0.add("1110"); param0.add("NRSAazejUS"); param0.add("297975"); param0.add("1"); param0.add("ThYMuVOm"); param0.add("1874418087476"); param0.add("11011001001"); param0.add("YJ"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
905
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMIZE_SUM_ARRII.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 MAXIMIZE_SUM_ARRII{ static int f_gold ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += ( arr [ i ] * i ) ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,4,6,7,8,9,11,19,23,24,30,31,31,32,41,43,43,46,47,50,50,51,53,57,63,63,69,73,74,79,80,81,81,85,86,88,92,93,95,98,99}); param0.add(new int[]{90,66,-98,-42,-10,90,-6,76,-80,-62,-40,90,-34,-76,90,-42,80,-74,10,-78,-16,32,52,-82,-98,-68,12,92,72,-10,98,76,-52,-58,62,68,20,-58}); 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}); param0.add(new int[]{79,52,45,58,44,13,14,99,8,44,42,98,47,44}); param0.add(new int[]{-90,-88,-68,-66,-46,-42,-40,-20,-16,4,8,8,8,20,28,52,84,98}); param0.add(new int[]{1,1,0,0,1,0,1,0,0,0,1,1,1,1,0,1,0,0,0,0,1}); param0.add(new int[]{5,6,7,9,11,13,16,19,22,25,26,27,28,29,32,32,32,33,36,40,43,43,47,49,51,51,52,53,59,61,63,65,66,66,67,72,73,73,75,76,80,86,87,89,89,91,96,98,99}); param0.add(new int[]{26,34,-26,-14,40,-20,54,48,-20,28,68,-78,-32,-96,-12,70,-24,92,-14,64,64,40,-8,88,-98,-4,-22,52,32,-52,2,6,-66,-38,-90,-48,-6,-30,76,32,96,-34,-12}); param0.add(new int[]{0,0,1,1}); param0.add(new int[]{84,32,75,21,62,49,88,49,47,20,49,18,71,34,88,44,84}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(24); param1.add(13); param1.add(11); param1.add(14); param1.add(13); param1.add(42); param1.add(39); param1.add(3); param1.add(8); 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()); } }
906
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE.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 CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE{ static boolean f_gold ( int degree [ ] , int n ) { int deg_sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { deg_sum += degree [ i ] ; } return ( 2 * ( n - 1 ) == deg_sum ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2, 3, 1, 1, 1}); param0.add(new int[]{2, 2, 1, 1, 2}); param0.add(new int[]{2, 2, 1, 1, 1}); param0.add(new int[]{0,0,0,3,3,4}); param0.add(new int[]{-10, 12, 2}); param0.add(new int[]{1,1,1,1,0,0,0,0,0,0,0,1,1,1,0,1,1,0,1,1,0,0,0,1,0,1,1,1,1,1,1,0,1,1,1,0,1,0,0}); param0.add(new int[]{1,6,10,13,15,17,18,23,26,28,30,32,32,33,36,39,39,41,43,50,50,51,53,54,59,59,63,63,63,66,66,71,71,74,78,89,89,93}); param0.add(new int[]{66,-96,-14,74,-20}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,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,1,1,1}); param0.add(new int[]{97,73,87,45,64,30,53,50,62,42,28,58,31,90}); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(5); param1.add(5); param1.add(6); param1.add(3); param1.add(19); param1.add(30); param1.add(4); param1.add(31); param1.add(10); 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()); } }
907
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_POINTS_INTERSECTION_N_CIRCLES.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 MAXIMUM_POINTS_INTERSECTION_N_CIRCLES{ static int f_gold ( int n ) { return n * ( n - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(30); param0.add(25); param0.add(69); param0.add(39); param0.add(14); param0.add(60); param0.add(89); param0.add(27); param0.add(29); param0.add(29); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
908
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M.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 SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M{ static int f_gold ( int A [ ] , int N , int M ) { int sum = 0 ; int ans = 0 ; for ( int i = 0 ; i < N ; i ++ ) { for ( int j = i + 1 ; j < N ; j ++ ) { for ( int k = j + 1 ; k < N ; k ++ ) { sum = A [ i ] + A [ j ] + A [ k ] ; if ( sum % M == 0 ) ans ++ ; } } } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{14,35,56,70,88}); param0.add(new int[]{-50,-92,16,-68,-36}); param0.add(new int[]{0,0,0,1,1,1}); param0.add(new int[]{76,43,22,41,49,99,25,40,3,45,60,16,83,62,26,93,64,73,72,53,6,32,35,67,17}); param0.add(new int[]{-90,-86,-86,-66,-50,-48,-44,-42,-42,-38,-24,-22,-20,-18,-8,8,24,28,34,48,60,62,66,68,74,76,80,82,88}); param0.add(new int[]{1,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,1,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,1,0,1,1,0}); param0.add(new int[]{4,5,8,9,10,12,13,16,17,18,21,21,25,27,28,30,36,36,54,55,56,57,60,62,67,67,68,71,72,72,73,73,77,77,83,86,86,86,87,89,92,92,96,97,97,98}); param0.add(new int[]{-64,52,-32,38,8,-62,-56,20,72,-12,32,44}); param0.add(new int[]{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}); param0.add(new int[]{77,68,45,6,27,19,29,95,21,2,39,48,72,67,49,45,1,16,56,78,25,22,27,40,31,34,26,35,12}); List<Integer> param1 = new ArrayList<>(); param1.add(3); param1.add(3); param1.add(4); param1.add(14); param1.add(24); param1.add(24); param1.add(24); param1.add(6); param1.add(12); param1.add(25); List<Integer> param2 = new ArrayList<>(); param2.add(4); param2.add(4); param2.add(5); param2.add(21); param2.add(20); param2.add(30); param2.add(23); param2.add(6); param2.add(15); param2.add(25); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
909
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBER_OF_WAYS_TO_PARTITION_A_SET_INTO_K_SUBSETS_1.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 COUNT_NUMBER_OF_WAYS_TO_PARTITION_A_SET_INTO_K_SUBSETS_1{ static int f_gold ( int n , int k ) { int [ ] [ ] dp = new int [ n + 1 ] [ k + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) dp [ i ] [ 0 ] = 0 ; for ( int i = 0 ; i <= k ; i ++ ) dp [ 0 ] [ k ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= k ; j ++ ) if ( j == 1 || i == j ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = j * dp [ i - 1 ] [ j ] + dp [ i - 1 ] [ j - 1 ] ; return dp [ n ] [ k ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(84); param0.add(95); param0.add(67); param0.add(92); param0.add(97); param0.add(13); param0.add(37); param0.add(9); param0.add(10); param0.add(90); List<Integer> param1 = new ArrayList<>(); param1.add(99); param1.add(64); param1.add(21); param1.add(22); param1.add(35); param1.add(77); param1.add(46); param1.add(92); param1.add(26); param1.add(94); 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()); } }
910
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LEONARDO_NUMBER_1.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 LEONARDO_NUMBER_1{ static int f_gold ( int n ) { int dp [ ] = new int [ n + 1 ] ; dp [ 0 ] = dp [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1 ; return dp [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(75); param0.add(76); param0.add(55); param0.add(14); param0.add(43); param0.add(10); param0.add(16); param0.add(30); param0.add(44); param0.add(65); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
911
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS.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_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS{ static int f_gold ( int [ ] boxes , int n ) { Arrays . sort ( boxes ) ; int ans = 1 ; int prev_width = boxes [ 0 ] ; int prev_count = 1 ; int curr_count = 0 ; int curr_width = 0 ; for ( int i = 1 ; i < n ; i ++ ) { curr_width += boxes [ i ] ; curr_count += 1 ; if ( curr_width > prev_width && curr_count > prev_count ) { prev_width = curr_width ; prev_count = curr_count ; curr_count = 0 ; curr_width = 0 ; ans ++ ; } } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,8,11,11,14,19,25,27,41,42,46,52,53,54,55,58,59,62,63,66,67,69,74,75,77,81,83,84,88,88,93,93,94}); param0.add(new int[]{80,72,40,-78,-72,20,-28,-18,-96,14,20,-60,-56,-92,12,86,16,76,30,76,16}); param0.add(new int[]{0,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,1,1}); param0.add(new int[]{12,85,16,78,85,48,91,1,65,22,15,84,67,14,73,19,40,98,4,33,43,37,66,27,45,81,50,95,63,6,95,67,67,97,59,13,21,64,37,80}); param0.add(new int[]{-98,-92,-90,-88,-88,-74,-64,-64,-64,-62,-60,-52,-48,-46,-42,-42,-38,-34,-28,-26,-20,-20,-18,-4,0,2,2,6,18,18,18,20,24,24,26,32,40,46,58,66,74,78,90,96}); param0.add(new int[]{1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0}); param0.add(new int[]{8,12,13,13,13,16,16,17,19,20,22,23,26,29,29,30,31,37,38,39,39,41,45,45,46,49,49,53,56,62,62,66,67,68,68,69,69,73,77,78,82,85,85,88,88,97}); param0.add(new int[]{36,-30,-84,4,-20,-28,-88,72,40,46,-68,-8,18,-24,94,-64,-76,8,82,-6,-98,-70,82,60,-58,-98,86,34,-76,-44,-22,-26,90,20,-38,16,94,94,-78,-42,78,-74,2,8,-62}); param0.add(new int[]{0,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}); param0.add(new int[]{70,54,71,85,51,28,64,85,21,88,27,27,77,50,29,39,57,92,37,93,64,48,22,30,28,23,97,4,3,61,96}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(12); param1.add(35); param1.add(35); param1.add(30); param1.add(21); param1.add(26); param1.add(25); param1.add(26); param1.add(18); 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()); } }
912
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS.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 MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS{ static int f_gold ( int arr [ ] , int n , int k ) { HashMap < Integer , Integer > um = new HashMap < Integer , Integer > ( ) ; int [ ] sum = new int [ n ] ; int curr_rem ; int maxSum = 0 ; sum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) sum [ i ] = sum [ i - 1 ] + arr [ i ] ; for ( int i = 0 ; i < n ; i ++ ) { curr_rem = sum [ i ] % k ; if ( curr_rem == 0 ) { if ( maxSum < sum [ i ] ) maxSum = sum [ i ] ; } else if ( ! um . containsKey ( curr_rem ) ) um . put ( curr_rem , i ) ; else if ( maxSum < ( sum [ i ] - sum [ um . get ( curr_rem ) ] ) ) maxSum = sum [ i ] - sum [ um . get ( curr_rem ) ] ; } return ( maxSum / k ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,8,8,12,14,23,25,25,27,27,29,40,42,49,52,52,54,56,57,61,68,74,77,81,82,83,84,85,85,85,87,87,88,88,90,92,96,96}); param0.add(new int[]{-90,-34,26,-20,-12,-42,28,12,-6,58,-46,4,-30,-28,-14}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{58,81,36,2,51,71,77,34,91,82,47,4,91,83,26,96,3,6}); param0.add(new int[]{-92,-86,-82,-68,-60,-46,-40,-28,-26,-24,-2,-2,2,2,10,10,10,16,16,18,20,20,22,30,34,38,56,56,60,62,62,68,82,94,94,98}); param0.add(new int[]{0,1,0}); param0.add(new int[]{3,8,15,19,21,26,28,31,31,42,45,48,57,75,75,78,79,85,91,99}); param0.add(new int[]{-38,42,40,-60,-16,-36,44,60,-86,-38,30,-22,-30,-96,-66}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param0.add(new int[]{95,38,91,75,43,95,23,36,51,4,38,53,52,58,55,3,19,22,84,9}); List<Integer> param1 = new ArrayList<>(); param1.add(27); param1.add(8); param1.add(7); param1.add(16); param1.add(20); param1.add(2); param1.add(17); param1.add(12); param1.add(13); param1.add(14); List<Integer> param2 = new ArrayList<>(); param2.add(32); param2.add(14); param2.add(9); param2.add(12); param2.add(31); param2.add(2); param2.add(16); param2.add(10); param2.add(16); param2.add(19); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
913
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY.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 ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { int count = 0 ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i ] != arr [ i + 1 ] && arr [ i ] != arr [ i + 1 ] - 1 ) count += arr [ i + 1 ] - arr [ i ] - 1 ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,4,5,7,7,9,13,15,18,19,25,27,27,29,32,36,48,51,53,53,55,65,66,67,72,74,74,76,77,79,80,81,82,83,83,86,87,97,98,98,99}); param0.add(new int[]{34,6,-16,-26,-80,-90,-74,16,-84,64,-8,14,-52,-26,-90,-84,94,92,-88,-84,72}); param0.add(new int[]{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}); param0.add(new int[]{25,29,12,79,23,92,54,43,26,10,43,39,32,12,62,13,13}); param0.add(new int[]{-94,-86,-72,-64,-64,-58,-56,-56,-56,-56,-54,-54,-52,-42,-42,-40,-36,-32,-28,-22,-20,-18,-12,-8,-6,-4,0,2,4,10,16,30,32,48,48,60,70,74,76,84}); param0.add(new int[]{1,1,1,0,1,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,1,0,1,0,1,1,0,0,1,0,1,1,1,0}); param0.add(new int[]{4,5,8,12,16,16,17,20,20,23,26,26,27,28,32,34,40,40,41,41,44,45,47,49,51,52,54,57,60,62,63,64,66,68,69,70,71,76,77,80,80,80,90,91,92,94,96,98,99}); param0.add(new int[]{66,-46,-92,-40,76,74,10,20,56,-46,88,-18,48,96,-48,-86,38,-98,50,4,-52,-38,14,-48,96,16,-74,-26,80,14,-92,-60,-78,-68,96,-72,-44,-92,2,60,4,48,84,-92}); param0.add(new int[]{0,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}); param0.add(new int[]{49,84,66}); List<Integer> param1 = new ArrayList<>(); param1.add(30); param1.add(17); param1.add(24); param1.add(14); param1.add(35); param1.add(29); param1.add(42); param1.add(37); param1.add(17); param1.add(2); 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()); } }
914
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING.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_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING{ static int f_gold ( int arr [ ] , int low , int high ) { int max = arr [ low ] ; int i ; for ( i = low ; i <= high ; i ++ ) { if ( arr [ i ] > max ) max = arr [ i ] ; } return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{11,15,16,19,24,25,26,28,34,34,43,61,63,66,67,72,77,79,81,83,87,94,99}); param0.add(new int[]{8,92}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{84,39,92,89,38,75,18,39,83,67,41,46,49,27}); param0.add(new int[]{-98,-94,-88,-84,-74,-72,-58,-52,-48,-48,-46,-42,-42,-32,-30,-30,-18,-10,-8,-8,-6,-4,4,6,28,30,34,38,44,48,56,58,60,64,86}); param0.add(new int[]{0,1,0}); param0.add(new int[]{5,9,10,16,18,19,23,24,26,33,37,44,46,54,55,57,58,59,63,64,70,75,77,81,83,84,85,85,88,89,96,97,99}); param0.add(new int[]{86,20,-50,74,-78,86}); param0.add(new int[]{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}); param0.add(new int[]{16,57,65,61,17,63,7,35,69,91,30,44,99,80,6,80,56,8,84,95,20,73,30,62,77,26,66,61,61,45}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(1); param1.add(23); param1.add(8); param1.add(31); param1.add(2); param1.add(20); param1.add(3); param1.add(19); param1.add(28); List<Integer> param2 = new ArrayList<>(); param2.add(21); param2.add(1); param2.add(15); param2.add(13); param2.add(34); param2.add(2); param2.add(31); param2.add(5); param2.add(18); param2.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
915
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1.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 MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1{ public static int f_gold ( int arr [ ] , int n ) { int mls [ ] = new int [ n ] , max = 0 ; for ( int i = 0 ; i < n ; i ++ ) mls [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( Math . abs ( arr [ i ] - arr [ j ] ) <= 1 && mls [ i ] < mls [ j ] + 1 ) mls [ i ] = mls [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( max < mls [ i ] ) max = mls [ i ] ; return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,5,9,31,31,37,41,55,56,61,79,81,89,93}); param0.add(new int[]{-76,96,-68,-16,22,-24,-24,6,98,-82,54,-80,46,0,0,-50}); param0.add(new int[]{0,0,0,0,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}); param0.add(new int[]{97,93,43,51,15,33,13,96,39,89,78,25,45,6,64,54}); param0.add(new int[]{-98,-78,-72,-70,-68,-58,-56,-54,-46,-44,-38,-34,-30,-24,-18,-16,-14,-12,2,6,8,8,10,10,16,24,26,28,40,42,44,56,58,62,66,66,78,86}); param0.add(new int[]{1,1,0,1,0,0}); param0.add(new int[]{7,8,10,11,12,15,16,16,19,21,23,23,23,25,26,35,38,43,46,47,51,52,53,57,60,61,66,67,69,74,75,81,83,84,88,92,94,98,98,99}); param0.add(new int[]{14,-40}); param0.add(new int[]{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,1,1,1,1,1,1}); param0.add(new int[]{59,70,53}); List<Integer> param1 = new ArrayList<>(); param1.add(12); param1.add(15); param1.add(29); param1.add(13); param1.add(19); param1.add(3); param1.add(34); param1.add(1); param1.add(38); param1.add(1); 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()); } }
916
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CASSINIS_IDENTITY.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 CASSINIS_IDENTITY{ static int f_gold ( int n ) { return ( n & 1 ) != 0 ? - 1 : 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(67); param0.add(2); param0.add(58); param0.add(6); param0.add(42); param0.add(17); param0.add(37); param0.add(44); param0.add(23); param0.add(40); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
917
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_CALCULATE_VOLUME_ELLIPSOID.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 PROGRAM_CALCULATE_VOLUME_ELLIPSOID{ public static float f_gold ( float r1 , float r2 , float r3 ) { float pi = ( float ) 3.14 ; return ( float ) 1.33 * pi * r1 * r2 * r3 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Float> param0 = new ArrayList<>(); param0.add(3287.4842316041018F); param0.add(-3707.427510963942F); param0.add(8980.643174783816F); param0.add(-2698.0187368852694F); param0.add(8627.156664162168F); param0.add(-7316.329924623669F); param0.add(7857.3846206400485F); param0.add(-6502.657905007728F); param0.add(4468.400513325576F); param0.add(-7231.864791620428F); List<Float> param1 = new ArrayList<>(); param1.add(4503.332888443404F); param1.add(-6671.335781753231F); param1.add(3584.781688607942F); param1.add(-1004.7289573934537F); param1.add(9572.27618966978F); param1.add(-6591.043206581106F); param1.add(3671.761679299217F); param1.add(-1412.2240121470609F); param1.add(2272.1999139470304F); param1.add(-8036.087711033032F); List<Float> param2 = new ArrayList<>(); param2.add(8590.24729914204F); param2.add(-2780.4954870801926F); param2.add(2818.469507143102F); param2.add(-9602.530725071243F); param2.add(4783.930377855004F); param2.add(-9760.465488363216F); param2.add(2534.5825334137794F); param2.add(-6135.238350044512F); param2.add(4753.075799180736F); param2.add(-6456.263512521035F); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i),param2.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i),param2.get(i))) + 0.0000001)) < 0.001F) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
918
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_XOR_VALUE_MATRIX.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 MAXIMUM_XOR_VALUE_MATRIX{ static int f_gold ( int mat [ ] [ ] , int N ) { int r_xor , c_xor ; int max_xor = 0 ; for ( int i = 0 ; i < N ; i ++ ) { r_xor = 0 ; c_xor = 0 ; for ( int j = 0 ; j < N ; j ++ ) { r_xor = r_xor ^ mat [ i ] [ j ] ; c_xor = c_xor ^ mat [ j ] [ i ] ; } if ( max_xor < Math . max ( r_xor , c_xor ) ) max_xor = Math . max ( r_xor , c_xor ) ; } return max_xor ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{2,2,3,9,9,10,12,13,17,19,26,28,28,30,30,32,32,39,40,41,42,52,52,54,54,55,56,59,62,63,69,71,72,72,72,73,77,78,80,83,83,85,87,90,90,91,93},new int[]{1,1,3,5,5,8,10,14,15,17,20,22,24,24,26,27,32,33,33,35,38,40,41,44,54,54,55,55,59,63,64,65,66,71,72,73,73,74,74,76,80,80,83,87,89,93,97},new int[]{2,2,3,3,6,9,9,10,13,15,15,17,19,22,22,22,23,24,25,27,27,29,29,35,36,37,38,41,41,52,52,54,54,61,64,65,66,70,72,73,73,74,89,89,90,97,97},new int[]{1,11,15,18,22,22,25,27,27,28,29,31,32,33,40,40,42,42,42,46,52,52,52,54,55,56,57,59,60,60,61,62,66,66,67,67,76,77,78,80,85,85,87,88,88,98,99},new int[]{1,2,3,4,6,9,10,15,15,19,20,20,28,29,34,35,36,45,47,48,54,56,57,62,64,65,66,68,69,70,75,76,77,77,77,79,79,83,87,90,90,92,95,96,96,99,99},new int[]{1,1,3,3,4,8,9,11,15,18,18,22,23,23,24,26,26,28,29,32,40,41,42,42,43,44,54,54,54,57,58,61,64,67,69,72,76,79,80,80,87,89,91,93,95,95,97},new int[]{1,1,6,11,14,14,16,17,20,20,25,28,28,30,31,31,33,35,36,37,37,40,42,43,45,45,48,49,54,55,55,60,60,62,63,65,66,72,74,80,80,82,82,84,84,93,94},new int[]{4,5,8,10,10,14,20,21,21,23,23,23,25,27,33,36,37,40,45,48,50,52,56,57,63,67,68,69,72,77,77,82,82,83,83,84,85,86,87,88,92,93,95,96,97,97,97},new int[]{1,7,7,9,13,13,18,19,21,28,28,31,37,39,41,43,44,45,48,48,49,50,51,52,58,62,63,64,64,68,70,73,74,79,80,81,85,88,90,91,93,93,94,94,95,98,98},new int[]{3,8,9,12,13,15,15,18,19,21,23,24,29,30,34,38,39,40,42,45,47,50,54,55,57,57,58,64,65,65,67,67,67,68,69,71,72,72,75,79,80,81,81,83,85,91,93},new int[]{3,3,5,5,6,11,23,24,25,27,29,31,35,35,38,40,43,44,45,46,50,54,54,55,57,57,58,62,65,69,70,70,74,78,78,78,79,79,80,84,87,90,90,92,94,98,99},new int[]{9,14,17,17,21,22,24,25,27,31,31,32,36,37,43,46,46,48,49,50,50,54,59,60,63,63,66,68,71,72,74,76,76,77,77,79,82,83,84,85,86,87,89,89,91,92,94},new int[]{2,3,8,10,10,11,16,19,19,21,21,23,27,28,34,36,40,41,46,46,46,48,52,52,52,53,60,63,64,66,67,67,71,71,72,74,77,80,83,84,86,88,88,88,89,89,89},new int[]{6,9,11,12,12,14,15,16,21,29,29,30,30,32,34,35,43,43,44,45,51,51,52,54,57,58,59,64,65,67,69,70,70,72,75,76,79,82,86,86,88,90,92,93,98,98,98},new int[]{1,2,3,8,9,13,15,16,17,17,17,19,22,25,32,36,44,44,45,46,48,54,55,58,66,68,72,72,73,74,78,79,80,80,82,89,89,89,90,91,91,93,93,97,97,98,99},new int[]{3,5,9,9,14,14,16,16,18,21,22,26,26,35,35,37,42,42,44,46,47,48,49,50,54,56,58,59,61,65,66,66,66,66,70,79,79,80,83,87,88,92,96,97,98,99,99},new int[]{4,7,9,10,10,12,16,20,22,24,26,28,33,34,34,36,37,37,39,43,45,45,46,51,52,53,54,55,55,56,56,57,59,63,65,69,70,70,70,73,74,77,82,85,92,97,98},new int[]{1,1,2,3,3,3,4,7,12,14,18,19,21,25,30,31,37,38,39,39,41,41,44,44,45,49,52,53,55,57,59,59,70,74,75,78,78,83,87,89,90,91,93,97,97,98,98},new int[]{4,6,6,9,12,15,21,22,23,26,29,30,33,40,41,41,42,43,44,46,47,50,53,56,60,61,61,62,62,62,64,66,71,75,77,77,84,85,85,85,85,89,90,90,91,97,98},new int[]{1,5,13,14,17,17,17,19,21,22,23,23,24,25,25,28,32,32,33,37,38,38,39,44,45,46,47,59,60,63,70,72,72,74,75,75,77,78,80,80,82,84,85,91,92,99,99},new int[]{4,5,9,14,17,19,21,25,25,27,29,29,30,30,32,42,42,44,44,44,45,46,51,54,57,57,61,69,69,72,73,74,75,77,78,80,81,82,89,91,91,93,96,96,97,98,99},new int[]{1,2,7,8,9,11,12,12,15,17,17,21,26,28,30,31,33,35,36,41,41,44,44,45,47,48,49,50,52,53,53,56,67,71,71,72,74,75,78,83,85,86,86,88,89,95,99},new int[]{2,4,5,13,17,18,21,22,24,26,27,28,29,31,32,34,35,36,38,38,39,41,43,43,52,52,54,62,69,70,71,71,72,73,77,77,78,81,82,82,84,86,89,91,93,94,95},new int[]{3,3,3,5,5,10,20,21,23,24,30,32,33,35,39,40,43,43,44,45,48,48,49,52,55,56,56,57,57,59,64,65,67,68,68,72,73,80,81,81,82,82,85,88,89,93,98},new int[]{3,6,6,11,12,12,13,21,21,23,25,31,31,33,36,37,41,43,44,46,50,53,56,57,57,57,58,59,62,66,71,73,74,78,78,78,79,80,89,92,92,94,96,96,97,97,97},new int[]{3,5,12,15,23,24,25,29,32,34,34,36,36,40,44,46,46,47,48,48,48,49,50,56,59,60,62,62,66,67,70,73,76,77,80,81,82,83,83,86,87,88,90,91,92,98,99},new int[]{9,11,13,19,20,21,23,26,29,29,30,35,38,38,42,43,47,50,52,53,54,55,56,57,57,58,61,62,63,65,67,69,72,72,72,76,79,82,85,86,86,87,88,89,90,90,99},new int[]{5,7,11,15,16,20,21,24,24,26,30,31,33,34,35,39,43,44,45,45,46,48,49,50,57,58,59,61,62,62,64,65,66,66,67,72,78,80,84,84,84,84,89,91,92,96,97},new int[]{2,6,7,9,10,14,14,16,21,22,24,27,30,32,32,33,35,35,37,40,43,47,55,56,59,65,67,68,68,69,70,71,73,74,75,76,78,79,79,82,86,88,90,93,94,97,99},new int[]{3,3,4,4,5,8,11,13,14,14,17,19,19,20,20,21,22,22,29,40,41,42,42,46,48,48,51,58,68,69,70,71,74,79,81,82,84,87,89,90,90,92,94,95,96,97,98},new int[]{1,1,2,2,5,6,7,7,9,11,13,16,18,25,26,27,31,32,33,35,35,35,38,39,40,55,58,58,60,61,62,63,64,68,70,72,72,74,75,76,81,82,84,90,97,97,99},new int[]{2,2,3,3,6,8,8,10,12,13,13,15,15,16,16,18,21,22,31,40,41,43,48,48,49,50,51,52,53,57,61,61,63,67,67,69,75,76,77,79,81,84,85,89,90,91,97},new int[]{5,5,6,7,9,16,18,19,19,20,22,23,23,24,25,27,27,28,32,34,34,34,37,37,38,43,52,53,54,55,59,62,63,64,65,70,74,77,78,78,79,81,83,83,88,93,97},new int[]{1,3,4,6,9,11,13,13,15,18,19,20,20,23,23,25,28,28,35,35,37,39,42,44,49,52,53,53,53,60,60,61,62,63,64,64,65,65,65,65,65,67,67,71,72,81,83},new int[]{3,5,6,8,8,14,15,20,21,22,26,26,28,29,32,35,36,37,38,42,44,49,50,51,56,57,59,62,65,67,68,68,70,73,73,75,79,84,89,90,90,91,95,97,98,99,99},new int[]{2,2,7,9,9,10,12,14,15,15,22,22,23,23,24,24,27,28,29,29,29,35,35,43,45,52,55,57,66,67,67,68,71,75,76,79,80,81,90,91,91,94,94,95,96,96,99},new int[]{1,2,2,4,11,12,12,13,17,20,22,22,25,27,29,37,41,42,43,43,45,47,53,54,54,54,55,55,59,60,63,66,66,66,81,82,82,82,84,85,85,86,93,94,94,94,96},new int[]{3,5,5,6,17,19,21,22,24,24,29,32,32,36,38,40,40,41,48,49,50,53,54,54,55,56,58,59,59,61,70,71,74,74,77,78,81,83,83,84,85,86,87,88,90,95,96},new int[]{1,2,3,4,6,9,10,12,14,15,15,15,18,22,23,23,24,25,27,32,34,35,37,38,40,41,42,43,44,46,46,49,53,54,54,55,55,55,60,78,83,86,86,87,91,93,98},new int[]{2,2,9,10,11,14,17,18,19,23,23,31,31,31,35,36,36,38,39,41,43,43,44,50,53,54,60,61,61,64,64,67,71,72,72,72,78,79,80,81,83,84,87,88,92,93,99},new int[]{3,5,7,7,12,12,12,18,19,20,20,21,24,25,26,26,28,32,36,39,39,41,53,54,54,55,59,60,62,64,64,64,64,65,67,68,79,81,87,88,96,97,97,97,98,99,99},new int[]{4,7,17,19,20,29,32,33,34,34,35,37,37,39,43,44,47,51,53,53,55,56,56,57,60,60,62,63,63,66,68,68,70,72,73,74,79,81,82,85,89,91,92,93,95,96,97},new int[]{3,3,3,6,10,13,14,14,16,17,18,18,18,19,28,31,33,34,35,44,44,45,48,51,59,59,60,62,65,66,67,70,71,73,73,73,77,78,82,86,86,88,88,89,90,93,93},new int[]{5,10,12,15,16,18,18,18,19,22,26,27,27,28,29,31,36,36,39,41,45,46,46,47,49,51,51,52,52,55,64,68,69,71,72,74,74,74,87,87,89,90,93,96,96,98,99},new int[]{3,16,17,19,19,25,25,31,32,33,35,36,39,42,42,44,45,46,59,61,62,63,64,65,65,66,67,68,68,69,70,73,75,76,76,78,86,88,88,88,89,91,93,95,98,99,99},new int[]{1,5,6,8,13,14,14,14,15,16,16,19,19,19,20,22,24,24,25,30,34,35,36,37,38,38,39,42,44,46,49,52,56,57,58,62,77,78,82,85,85,86,87,93,95,98,99},new int[]{4,4,5,5,7,11,12,12,14,20,21,25,26,26,28,30,31,33,34,36,37,43,44,45,49,51,53,56,57,59,62,62,63,63,66,66,66,72,78,79,84,85,88,92,94,97,98}}); param0.add(new int[][]{new int[]{94,-54,58,36,-2,56,-90,-44,-18,68,26,-60,60,52,-30,8,98,-80,-88,-30,-92,-34,-68,-74,-86,-4,-72,-84,24,50,-70,72,60,86,-48,38,16,42},new int[]{30,8,-64,92,-28,92,-28,-54,74,16,60,58,60,6,-30,88,66,-80,86,-70,-30,-74,42,-10,54,-36,-18,70,38,-58,50,68,22,26,24,46,56,-78},new int[]{-74,78,46,-10,50,88,82,-2,90,54,36,22,96,-50,38,86,-90,36,-6,54,-72,42,-54,98,-74,-70,0,-14,-94,20,-8,-22,-98,-90,64,14,42,-28},new int[]{-96,62,54,-98,-80,32,-92,-18,-90,88,50,-98,-24,-32,46,66,-10,34,52,24,0,82,-92,34,-40,-10,78,-20,-96,46,-56,48,-58,24,28,-34,66,-80},new int[]{-86,-24,-84,80,84,-36,56,-28,-88,36,68,20,16,-86,-24,88,-88,-28,-56,44,14,-66,90,-64,14,6,82,20,36,66,-50,52,-20,-40,-76,26,-12,-50},new int[]{-18,-78,-46,46,58,78,46,54,46,56,-80,70,42,78,-96,-76,-78,38,-8,14,28,-42,52,72,42,-96,16,96,-8,40,-42,-40,84,38,-28,-38,-34,-98},new int[]{-62,62,86,-84,-20,24,-98,46,84,20,-92,-20,-28,-38,44,12,48,34,46,-80,-38,-36,96,96,64,-72,-92,96,98,-84,4,74,14,-20,66,-14,-22,72},new int[]{16,-60,68,44,82,38,-70,86,-22,72,-10,48,52,66,74,74,-50,94,-32,-98,-76,14,-16,-98,-52,-74,10,-98,60,94,82,32,-56,-44,-84,-62,70,-90},new int[]{28,80,-60,-88,-4,68,-36,2,-28,-6,16,20,0,84,50,6,-72,-68,14,-80,-82,-26,-16,-40,22,-18,24,-90,-6,-42,-80,-54,62,-54,-66,32,-34,-24},new int[]{-60,-26,-18,80,-84,-24,-12,78,-8,22,68,62,-10,40,96,30,-38,46,-84,-84,4,-34,8,-18,-32,-68,98,6,-44,50,62,-56,20,-18,-40,-54,-56,56},new int[]{8,16,82,-82,-64,-10,-96,-56,18,24,46,86,48,36,66,84,4,18,-74,68,24,-94,68,54,44,-80,88,-48,-72,16,-90,80,-72,-82,-34,74,38,-92},new int[]{64,-88,-44,-88,2,26,-34,-82,-14,96,34,94,2,-64,38,-90,-44,62,40,-62,14,-56,4,-42,-32,62,-36,-78,58,-86,74,4,-50,-26,22,-16,58,84},new int[]{80,-2,-40,-32,-42,-58,-96,58,-54,22,34,-84,-20,84,76,98,18,-44,2,14,10,-26,92,0,32,-54,24,78,-86,48,0,24,-20,-54,32,-44,-78,-28},new int[]{56,40,66,-26,48,30,-72,60,-38,34,-40,42,-16,24,-54,-44,70,-62,-2,12,-62,78,22,56,32,12,2,-48,24,74,-42,48,62,90,74,-84,74,8},new int[]{20,-58,-40,-92,10,26,12,-66,76,96,50,-42,26,68,50,-90,86,78,-10,38,48,-62,30,40,-66,86,-74,12,-20,46,24,-98,-62,56,-40,-46,-60,30},new int[]{44,62,-48,-78,-32,90,-14,-74,98,-50,10,-54,-96,-14,-76,40,16,-44,24,-70,-84,96,62,64,56,60,30,-70,-32,14,-92,66,-94,94,24,74,-62,-54},new int[]{54,44,-8,-36,-68,-80,76,-58,-4,-64,4,96,26,-10,-28,20,-12,-62,-64,-38,-74,-24,-46,26,-88,46,-34,-2,0,-10,58,-76,-16,-50,84,-88,-94,34},new int[]{-72,80,-96,26,32,-68,-2,88,-98,10,96,2,-50,50,-2,76,-24,6,50,50,-24,-46,10,74,-70,-90,82,56,16,-24,66,80,96,90,-80,-66,48,-36},new int[]{38,22,88,14,-54,36,-86,80,2,54,34,84,-96,-84,38,26,96,-14,60,46,26,74,-8,-78,-6,-24,4,34,-80,14,62,28,-56,-62,32,-96,14,-32},new int[]{-60,80,98,54,-68,-16,-92,48,-66,-42,-94,-24,-28,-84,-78,74,34,-14,-92,78,26,-52,-78,88,-84,94,-20,-34,6,64,40,-44,-44,-88,54,-16,28,24},new int[]{-76,-26,-80,-72,76,88,36,66,12,28,64,8,-92,42,52,-14,-44,-96,20,-6,26,-64,34,0,12,16,64,-68,-86,94,-80,-22,-8,60,-32,-76,-66,44},new int[]{-46,58,-78,-62,60,-54,-34,88,76,4,32,32,-4,-76,-32,-20,90,-78,-64,44,42,38,-66,-46,36,-96,-42,58,-24,-36,-34,-64,30,40,26,-32,-42,20},new int[]{-52,-82,-76,-94,-82,-94,-46,-46,40,58,-96,86,-18,-2,-36,-74,-78,88,86,24,-6,44,-30,-96,78,-62,-64,-72,66,-28,68,96,-24,24,-98,26,26,-6},new int[]{88,90,0,38,52,-50,-94,-50,-64,-66,40,82,-64,-40,72,-50,86,92,48,-72,-12,6,42,70,-80,86,-6,-76,-64,-56,80,-14,70,-58,96,-36,84,-76},new int[]{-22,-40,4,66,-4,10,0,18,-16,-78,-18,10,52,-20,74,4,34,-80,62,-92,-58,24,-44,-52,20,6,70,90,88,40,60,42,-44,42,-18,30,-22,48},new int[]{30,86,-78,-22,52,90,-74,-68,50,-14,-78,30,84,-60,-24,40,-80,-56,40,34,42,-16,-50,-18,-78,14,40,52,-86,24,88,-62,-94,16,96,86,-56,74},new int[]{-38,42,-42,78,26,48,86,-68,2,-54,-50,2,46,-54,-46,74,48,-66,20,-32,-20,72,-36,96,98,24,-70,66,-72,-68,76,68,-82,68,60,-76,-92,42},new int[]{-12,-14,42,-96,14,52,6,-18,62,58,16,2,34,28,20,-72,-66,82,-80,-92,-12,-4,-94,30,68,64,96,-54,66,-30,-22,-60,-32,32,52,2,90,-26},new int[]{-70,78,24,-34,-20,-14,54,24,-48,48,-2,-96,92,-8,60,-4,-40,30,4,64,-32,-58,-96,-34,-24,-80,-12,38,-4,-26,-82,30,6,-96,50,-56,10,-12},new int[]{36,-42,-50,36,-60,-18,-12,28,-56,26,-64,56,44,90,66,-24,-32,10,-48,-82,-8,6,-64,-98,88,84,-8,-54,-36,-76,-60,-70,-54,-96,10,54,-76,4},new int[]{94,22,-86,-60,88,26,12,10,-96,66,-48,42,-40,-60,-70,-36,-70,-78,20,-96,-58,-46,-84,-28,64,-58,94,64,-16,74,34,22,0,-86,-64,-6,-2,26},new int[]{56,-78,-34,4,-66,4,12,-8,46,94,50,76,-82,0,32,70,70,-16,66,20,-22,84,8,88,-84,36,22,68,76,-2,62,66,-52,90,-34,-12,-12,46},new int[]{-98,-50,60,-96,44,84,4,-12,-4,-80,-12,-42,76,-62,66,-14,50,84,-48,72,88,20,72,96,90,46,90,-40,32,-90,84,-34,-92,-18,-58,18,26,-42},new int[]{-2,-22,54,68,52,-18,-42,-90,-58,-48,-66,-94,6,-56,-4,88,22,-58,-6,-80,48,-16,78,-96,-6,-66,24,-92,-40,-62,-90,-92,-66,-40,8,-32,6,-50},new int[]{94,-2,10,-30,8,-30,-84,-12,-22,-2,-26,-60,-60,22,-38,82,18,50,78,-48,0,52,-78,66,10,26,68,-48,-44,20,64,78,80,76,-44,-52,-48,18},new int[]{34,16,58,44,-46,90,-76,-78,16,80,-32,62,-54,-14,76,-22,2,36,68,28,52,-74,84,22,84,-30,-60,66,92,-86,-40,74,-60,-14,58,-52,36,78},new int[]{-84,-92,34,24,76,90,44,22,18,-84,90,62,82,-22,18,-42,12,-14,-86,-78,-24,-30,92,20,32,54,-24,26,24,-80,-84,76,44,74,56,56,40,-58},new int[]{-40,96,20,48,4,-74,72,58,62,-10,22,36,-82,4,-12,-92,2,-80,-54,50,-64,36,-40,-82,-2,-18,8,-18,-52,94,-30,66,-42,-62,-72,44,12,54}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1}}); param0.add(new int[][]{new int[]{88,92,80,80,15,85,46,62,7,8,47,50,1,6,55,63,19,14,52,10,56,26,80,55,22,99,23,36},new int[]{38,72,34,22,11,19,4,66,32,79,66,90,70,34,45,84,88,37,81,6,46,45,94,95,55,44,75,36},new int[]{41,26,10,97,4,30,79,82,98,41,93,36,60,37,36,56,26,72,70,25,82,2,64,89,83,38,80,47},new int[]{56,31,40,37,97,27,41,60,7,75,84,5,96,49,71,63,40,21,47,2,47,1,31,63,27,12,89,41},new int[]{84,79,99,26,28,96,42,61,17,78,75,40,95,45,16,93,64,3,76,15,2,26,27,71,89,47,78,91},new int[]{25,94,20,71,77,11,76,16,98,26,53,36,83,79,23,25,55,40,82,34,3,92,34,61,70,37,95,61},new int[]{14,55,54,38,63,31,54,36,9,1,46,80,54,19,62,54,26,66,79,18,27,30,1,39,85,68,16,32},new int[]{64,96,46,25,90,24,80,45,52,11,39,89,17,83,96,89,70,30,43,41,53,74,55,19,55,35,5,75},new int[]{66,99,36,49,5,1,26,37,7,82,75,83,8,99,6,49,86,72,41,20,78,58,2,56,8,20,99,62},new int[]{74,59,71,97,95,8,71,12,90,23,74,42,6,61,58,16,98,37,8,29,84,59,96,87,2,12,37,59},new int[]{41,65,76,35,52,81,4,50,72,59,42,59,21,47,20,28,85,61,35,44,98,28,49,13,35,9,15,32},new int[]{42,78,59,33,14,7,83,6,52,69,69,68,71,10,56,67,55,67,67,71,53,10,97,65,30,53,6,62},new int[]{43,75,45,42,7,19,80,69,77,20,28,47,23,54,45,22,83,89,72,8,54,79,46,23,36,29,62,17},new int[]{80,83,73,86,10,71,53,83,28,8,54,20,9,63,27,95,18,17,20,9,45,18,85,38,23,5,45,77},new int[]{20,4,82,22,95,45,38,39,32,29,71,82,94,39,83,1,87,52,2,98,38,44,77,17,5,62,66,85},new int[]{49,82,28,41,68,56,38,17,49,92,20,88,68,51,53,20,18,61,61,15,22,62,40,16,96,81,11,48},new int[]{14,7,17,46,72,54,59,23,17,87,93,57,30,88,50,96,47,60,43,60,38,15,31,24,70,19,71,6},new int[]{35,3,6,22,21,79,81,63,9,13,93,24,37,94,66,30,17,31,30,78,26,58,50,28,94,22,59,76},new int[]{15,24,7,76,50,31,9,81,3,2,32,52,24,42,27,99,25,35,98,85,8,36,16,17,44,54,8,21},new int[]{2,62,26,20,54,50,32,5,68,90,11,7,99,16,19,75,18,22,78,71,35,72,81,32,99,97,59,32},new int[]{30,2,93,99,99,93,57,9,20,54,54,72,67,7,10,39,16,50,58,1,23,36,93,73,91,40,76,35},new int[]{26,85,67,49,9,35,41,92,61,31,54,10,90,73,29,74,23,88,18,86,42,77,74,46,43,5,75,58},new int[]{99,45,58,32,65,47,77,6,14,51,67,70,64,96,61,75,91,39,65,50,27,88,84,91,71,78,87,75},new int[]{57,46,59,33,9,79,36,94,15,81,56,58,84,46,61,92,66,32,73,90,42,86,39,45,47,79,99,92},new int[]{9,62,49,98,19,10,50,41,99,12,22,61,32,75,46,83,57,98,92,86,65,38,23,39,26,45,68,12},new int[]{86,39,13,21,41,90,64,53,81,25,76,15,18,69,9,16,51,1,70,11,90,65,46,62,7,24,98,63},new int[]{30,1,38,95,83,32,71,46,6,66,81,74,29,82,54,86,90,6,62,13,30,55,77,72,29,4,92,96},new int[]{72,71,55,66,3,83,41,61,7,75,30,85,59,18,27,94,41,15,42,99,54,93,24,70,35,71,80,55}}); param0.add(new int[][]{new int[]{-84,-66,26,44,52},new int[]{-92,2,12,30,36},new int[]{-82,-62,30,46,82},new int[]{-10,36,66,68,96},new int[]{4,14,38,64,68}}); param0.add(new int[][]{new int[]{0,0,1,0,1,0,0,0,0,1,0,1,0,0,0,1,1,1,0,0,0},new int[]{1,1,0,0,0,0,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0},new int[]{0,1,1,0,0,0,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1},new int[]{1,1,0,0,1,0,1,1,1,0,1,0,0,0,1,1,1,0,0,1,1},new int[]{0,1,1,0,1,1,0,1,1,0,0,0,0,1,0,1,0,0,0,0,0},new int[]{0,1,0,0,1,0,0,1,0,0,1,0,1,1,0,0,0,1,1,1,0},new int[]{0,0,0,0,1,0,1,0,1,0,0,1,1,0,0,0,1,1,1,1,0},new int[]{0,0,0,1,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,1,0},new int[]{0,1,0,0,1,0,1,0,1,0,1,1,0,1,1,1,1,1,0,1,0},new int[]{0,0,0,1,0,0,0,1,0,1,0,0,0,0,1,0,0,0,1,0,1},new int[]{0,0,0,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1,0,1},new int[]{1,1,0,1,1,0,1,1,0,0,1,0,1,1,1,1,1,0,1,0,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1},new int[]{0,1,0,0,0,0,0,0,0,1,1,1,1,0,0,1,0,1,0,0,1},new int[]{0,1,1,1,0,0,0,1,0,1,0,0,1,0,0,0,0,0,0,1,1},new int[]{1,0,0,0,0,0,0,0,1,0,1,0,0,1,0,1,0,1,0,0,1},new int[]{1,0,1,0,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,0,1},new int[]{1,1,0,1,0,0,1,1,0,1,0,0,0,1,0,0,0,0,1,1,0},new int[]{1,1,0,0,0,1,0,1,1,0,1,0,0,0,1,0,0,1,0,0,1},new int[]{1,1,0,0,1,1,1,0,0,1,0,0,1,1,0,1,0,1,1,1,0},new int[]{0,1,0,1,1,1,1,1,1,0,0,1,0,0,1,0,1,0,1,0,1}}); param0.add(new int[][]{new int[]{2,8,11,12,12,15,17,24,26,32,38,39,41,44,45,48,52,55,56,57,59,62,63,71,72,77,81,82,83,85,89,92,92,92},new int[]{11,11,12,14,21,25,35,41,42,43,49,50,51,52,55,55,55,55,55,56,60,64,70,70,71,73,78,78,78,82,86,90,93,98},new int[]{1,2,9,9,16,19,19,20,21,23,28,29,30,35,35,42,51,53,54,58,60,64,66,70,73,74,77,79,81,88,94,95,97,97},new int[]{2,7,8,13,15,23,29,40,43,49,51,51,52,60,61,62,63,64,64,65,69,72,76,78,81,84,87,87,88,89,95,95,95,99},new int[]{3,3,7,8,9,17,17,18,18,23,23,36,40,45,47,50,52,53,54,58,60,60,75,76,77,77,83,83,87,88,88,91,93,97},new int[]{7,8,9,11,12,35,36,39,39,47,51,52,55,55,59,61,62,65,65,66,67,69,73,73,80,81,81,85,87,89,89,93,99,99},new int[]{1,2,2,4,4,7,13,16,18,21,22,23,26,27,35,37,37,41,44,45,51,51,54,56,57,59,66,71,78,78,79,82,83,95},new int[]{5,5,6,8,10,10,13,18,19,22,30,33,36,43,44,48,49,59,60,63,66,67,72,72,75,77,79,81,81,84,85,90,91,92},new int[]{7,7,15,17,19,20,20,23,25,26,33,36,38,38,44,46,48,49,59,60,63,64,68,68,74,74,76,79,79,90,91,93,96,98},new int[]{3,4,8,17,19,29,30,35,37,39,40,45,45,51,57,57,58,62,63,63,69,71,77,78,79,81,83,84,91,94,94,95,97,97},new int[]{5,10,13,13,15,20,21,26,28,35,39,40,42,44,47,48,48,49,55,56,60,61,67,75,76,78,79,82,84,84,85,87,90,91},new int[]{1,3,7,13,16,19,23,25,28,28,29,30,34,40,41,44,45,47,49,50,57,60,66,66,78,78,79,79,81,83,84,85,95,99},new int[]{8,10,14,15,15,15,16,19,21,21,21,22,26,29,30,31,44,44,47,58,62,63,68,76,78,78,81,84,86,90,90,91,96,98},new int[]{2,4,10,14,15,15,28,31,33,36,36,42,44,46,49,49,50,51,55,57,57,60,62,65,69,72,81,82,86,89,91,95,97,97},new int[]{1,2,6,7,16,24,24,24,28,30,41,46,47,47,49,49,50,60,61,64,66,66,67,70,70,74,75,78,80,81,83,90,91,97},new int[]{3,10,16,18,22,22,22,24,33,34,39,40,46,47,49,51,52,59,60,61,62,62,64,65,68,72,73,79,80,84,86,87,92,95},new int[]{9,11,12,16,22,25,25,29,32,34,39,39,39,39,41,42,48,49,52,55,58,62,69,69,76,82,82,84,86,87,90,91,92,97},new int[]{2,4,6,8,8,9,15,17,20,20,22,26,27,29,29,32,32,34,35,36,37,38,40,40,52,56,64,64,70,71,73,88,88,94},new int[]{1,7,11,12,12,13,14,15,20,25,29,32,34,38,41,43,50,57,59,64,65,69,71,72,74,77,78,82,84,85,91,91,92,96},new int[]{2,2,4,6,11,14,17,20,21,21,29,30,31,32,34,39,40,40,48,50,50,55,57,64,66,72,74,79,79,84,86,88,93,99},new int[]{1,2,2,10,16,25,26,26,29,29,31,33,34,36,41,42,44,47,53,53,54,59,61,62,70,72,73,75,78,79,82,84,87,99},new int[]{9,9,11,13,20,23,25,30,31,37,37,39,42,43,45,48,50,55,56,58,65,66,72,75,82,82,88,88,89,91,91,93,94,96},new int[]{1,5,5,8,9,13,15,17,18,21,21,24,25,27,34,43,44,45,46,50,54,55,60,67,68,71,76,78,81,82,84,87,97,99},new int[]{1,3,3,5,14,23,23,25,28,29,32,36,40,41,43,49,50,53,53,53,54,64,72,76,78,80,81,81,87,87,87,91,93,94},new int[]{2,10,10,12,13,15,15,16,17,21,23,27,28,32,37,37,41,43,45,46,48,51,52,56,57,69,70,74,78,80,83,86,89,95},new int[]{4,4,7,7,8,10,11,14,14,17,19,26,30,36,40,51,60,62,68,69,71,73,74,80,80,82,84,85,86,86,86,88,92,97},new int[]{2,3,6,8,10,11,11,13,16,18,19,21,23,23,26,27,28,35,37,37,42,50,53,54,55,58,61,68,73,81,85,86,97,99},new int[]{6,7,14,17,19,20,21,22,23,24,26,30,32,36,37,38,39,42,45,57,61,66,67,67,69,81,84,84,85,90,94,95,97,99},new int[]{1,2,9,10,12,13,13,13,14,15,16,16,16,17,21,27,27,33,35,35,36,41,44,46,46,47,48,51,61,66,73,76,93,95},new int[]{1,6,8,14,14,19,22,25,30,36,40,45,52,61,63,67,68,70,70,73,73,75,75,77,79,81,85,86,89,90,93,94,96,97},new int[]{12,14,18,22,24,25,26,26,27,29,32,34,38,38,40,54,55,56,58,60,70,74,76,77,78,78,81,83,84,84,86,91,95,98},new int[]{2,4,9,17,23,24,33,36,36,37,37,39,43,43,44,51,52,56,58,59,60,64,65,68,68,69,77,78,78,79,88,94,98,99},new int[]{2,2,5,5,6,13,17,19,19,23,33,36,45,45,46,51,53,62,66,69,74,77,77,78,78,79,81,86,87,93,94,96,96,99},new int[]{2,5,5,6,7,10,11,15,16,29,30,31,31,36,37,41,41,48,49,49,52,53,55,56,60,61,63,81,84,92,95,97,98,99}}); param0.add(new int[][]{new int[]{-12,46,-32,-10,74,98,-60,-54,8,90,78,84,-42,-36,-4,-72},new int[]{-10,-52,-22,84,-28,-90,-82,88,4,76,22,26,-38,6,94,10},new int[]{52,0,52,-34,-52,-40,30,62,64,-66,-22,-34,46,-86,82,58},new int[]{-38,-36,-84,72,-88,42,66,-60,-4,86,-42,30,36,-98,-44,58},new int[]{-34,16,-36,80,26,60,94,48,16,-10,4,68,-20,-76,84,-76},new int[]{-22,86,-98,-82,78,82,48,26,0,-30,54,-92,64,68,78,50},new int[]{-58,66,-14,-42,-38,-86,-70,-14,-54,44,82,54,-92,-58,-64,32},new int[]{18,50,6,-22,36,12,12,20,-6,-68,82,38,-8,-4,-22,16},new int[]{-16,90,-94,-62,26,32,-70,26,-8,-90,64,-80,42,-10,-22,82},new int[]{-94,54,28,38,86,-50,-96,10,48,16,46,4,-78,-54,4,-28},new int[]{64,56,0,-58,-22,62,96,-20,0,-26,16,-90,-84,8,80,60},new int[]{38,98,-18,-74,-24,-94,34,-68,-68,72,-74,60,62,76,86,86},new int[]{-58,-40,-70,90,94,-66,-52,54,-46,-80,32,-40,-20,50,48,-96},new int[]{74,2,-22,-28,42,-44,-58,36,-60,26,-86,-74,26,-96,-14,-60},new int[]{-90,8,-72,52,-94,22,90,-42,-22,-68,-86,-10,-12,-60,12,42},new int[]{26,-18,-68,-30,18,68,98,76,-2,28,4,-16,-92,82,-94,-58}}); param0.add(new int[][]{new int[]{0,0,0,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,1},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,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},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,1,1,1,1},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,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,1,1},new int[]{0,0,0,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,1},new int[]{0,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,1,1,1},new int[]{0,0,0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,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},new int[]{0,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,1,1,1},new int[]{0,0,0,0,0,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},new int[]{0,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,1,1,1},new int[]{0,0,0,0,0,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},new int[]{0,0,0,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,1},new int[]{0,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,1,1,1},new int[]{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,1,1,1,1,1},new int[]{0,0,0,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,1},new int[]{0,0,0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,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,1,1},new int[]{0,0,0,0,0,0,0,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},new int[]{0,0,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,1,1},new int[]{0,0,0,0,0,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},new int[]{0,0,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,1,1},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,0,0,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},new int[]{0,0,0,0,0,0,0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,0,0,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},new int[]{0,0,0,0,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[][]{new int[]{39,26,40,73,91,43,76,46,5,71,28,22,71,56,55,25,59,76,19,83,62,32,63,92,44,70,86,77,33,66,58,84,91,32,47,71,71,32,62,62,60,17,12,38,15},new int[]{2,23,60,30,49,2,6,37,52,78,18,59,66,91,78,84,96,74,10,49,95,52,40,92,47,71,31,16,59,44,28,34,40,89,30,84,40,58,51,59,20,45,86,19,48},new int[]{49,19,56,96,95,28,79,26,61,56,51,1,51,55,48,30,12,75,74,3,80,56,57,69,99,60,2,44,82,34,39,91,70,27,55,59,19,78,86,16,15,72,55,36,74},new int[]{59,23,88,66,35,26,35,21,28,1,94,53,11,98,75,20,73,36,97,71,59,53,98,41,48,29,33,83,79,44,60,47,50,16,70,95,34,52,18,58,45,94,15,79,10},new int[]{19,63,40,53,26,74,28,90,96,56,72,39,39,48,42,32,46,88,2,75,9,5,92,91,89,1,83,23,51,12,92,84,10,20,3,90,34,49,74,43,55,15,76,45,58},new int[]{59,70,73,46,39,54,85,4,75,95,12,61,88,43,91,75,4,89,41,73,30,37,4,75,63,41,68,7,93,67,84,54,43,7,97,17,93,95,96,41,64,46,31,72,24},new int[]{78,44,67,42,78,24,45,68,31,27,87,33,78,49,64,5,89,31,84,42,86,54,10,75,9,59,8,93,26,16,62,73,20,14,70,83,50,92,77,37,55,45,84,55,94},new int[]{59,6,36,64,29,50,28,15,62,47,88,9,97,95,29,46,75,15,9,91,59,29,99,73,47,25,15,52,47,57,40,28,43,10,70,1,53,75,4,28,88,2,9,35,15},new int[]{99,46,92,14,32,99,15,98,93,23,6,91,91,44,46,42,83,51,20,67,71,5,46,20,19,4,43,34,80,13,79,20,31,25,86,79,75,10,24,6,29,81,95,4,74},new int[]{85,36,57,3,80,45,55,61,94,78,88,54,78,97,13,95,89,36,33,40,4,96,96,92,87,29,66,24,77,45,70,68,41,21,39,29,61,1,37,35,22,55,54,35,13},new int[]{71,74,47,93,6,28,71,60,50,42,61,21,21,34,84,41,76,80,7,10,64,67,32,97,14,21,52,29,17,81,62,54,5,38,96,73,54,91,41,93,64,96,46,49,86},new int[]{21,24,84,19,40,76,69,35,35,51,80,8,38,32,49,60,33,72,42,43,49,6,80,66,2,33,94,76,63,24,62,8,5,3,99,14,91,65,30,53,24,43,3,34,77},new int[]{51,67,30,31,26,99,6,3,20,79,62,91,52,58,79,62,94,87,56,28,34,80,15,46,22,71,79,43,75,8,37,72,20,50,19,50,40,6,79,65,85,42,26,76,62},new int[]{48,79,73,90,73,30,24,63,83,63,63,73,24,46,10,22,80,66,17,8,74,30,91,26,79,91,64,2,99,83,95,92,17,94,8,78,20,81,57,8,32,43,33,23,95},new int[]{83,50,26,17,2,83,40,27,8,66,67,32,74,69,85,40,68,96,38,51,24,13,42,7,7,13,60,39,29,77,25,25,15,74,78,79,81,7,34,57,70,62,69,27,54},new int[]{8,23,46,4,66,64,1,3,96,51,35,2,87,25,11,77,22,54,70,86,13,90,17,93,90,42,16,23,98,93,22,55,83,72,22,27,38,13,10,48,20,14,46,64,49},new int[]{17,29,84,52,93,37,65,52,45,75,33,40,4,20,97,3,12,5,39,62,27,53,15,33,8,53,10,51,7,89,44,5,37,63,54,82,30,3,69,44,54,72,20,90,35},new int[]{64,35,94,43,89,22,2,40,14,35,68,31,70,76,65,43,73,4,37,44,47,44,14,6,73,37,43,62,59,22,49,16,9,38,23,8,13,85,63,23,8,86,68,5,50},new int[]{52,84,70,22,1,77,26,94,15,98,98,27,12,11,4,44,41,12,20,91,51,21,49,98,54,18,96,98,79,41,71,60,31,12,52,2,38,53,31,35,79,52,25,11,19},new int[]{71,95,41,70,27,50,29,92,85,79,71,27,57,81,1,56,20,76,60,77,85,96,1,91,82,42,13,98,11,57,70,70,49,90,43,21,3,93,39,52,61,12,27,76,37},new int[]{3,92,53,3,98,58,86,13,84,76,6,19,56,57,4,29,88,32,79,85,83,84,61,69,5,3,9,38,50,91,67,36,20,99,88,12,32,37,89,87,99,2,8,83,6},new int[]{25,8,35,86,87,46,46,32,5,71,17,24,85,18,8,75,54,5,7,80,47,72,21,8,47,90,95,33,26,57,92,31,68,23,99,56,72,13,13,74,46,96,41,20,12},new int[]{30,58,25,85,64,76,3,36,75,35,32,46,15,40,83,66,70,76,86,76,91,57,7,23,86,56,66,18,20,13,65,89,31,59,69,35,84,21,37,38,27,24,72,51,94},new int[]{27,78,77,96,11,64,59,90,65,48,3,16,6,14,54,62,55,37,63,74,60,84,44,52,73,16,3,29,24,92,62,33,58,87,95,45,51,73,76,53,8,22,23,79,87},new int[]{78,23,44,87,17,92,17,79,28,92,81,11,13,73,65,36,61,84,69,68,53,24,55,34,13,52,99,85,80,26,64,21,89,17,60,63,74,82,93,74,23,29,39,88,50},new int[]{38,97,29,93,79,32,26,51,69,96,54,68,93,25,30,41,90,62,44,16,11,92,78,66,57,61,96,60,76,76,80,75,80,16,56,8,55,1,78,51,93,46,68,93,19},new int[]{36,75,27,46,86,65,85,21,50,25,90,63,79,53,93,91,25,6,18,25,70,51,1,70,32,42,20,61,24,1,47,72,19,93,69,53,51,88,64,85,21,24,15,15,95},new int[]{73,39,37,1,99,28,65,5,25,4,5,65,59,23,29,94,38,51,3,10,52,21,27,39,36,28,11,55,33,96,57,98,43,57,28,11,40,2,61,98,83,29,54,28,68},new int[]{3,72,48,70,60,49,17,84,28,58,59,34,29,6,95,72,94,11,62,2,58,48,90,72,8,25,71,96,95,80,19,9,71,31,24,48,90,20,5,18,16,48,91,81,25},new int[]{44,32,83,67,57,16,58,21,86,75,2,98,60,7,98,39,84,26,80,63,99,44,49,61,87,74,55,76,16,55,20,26,1,16,85,11,9,40,33,91,46,12,75,5,23},new int[]{88,39,4,51,44,68,29,32,7,76,58,14,18,84,27,13,82,31,5,58,85,1,36,48,82,7,41,61,33,47,58,22,79,52,68,85,72,85,89,88,48,54,46,10,54},new int[]{41,29,62,36,30,50,26,40,93,67,11,71,27,50,28,48,2,77,7,57,4,48,34,25,92,60,77,91,10,21,54,45,34,40,61,34,59,2,42,27,94,60,2,43,80},new int[]{99,59,22,54,48,21,43,7,37,54,64,76,63,9,90,78,35,85,50,75,93,99,70,64,6,51,47,12,77,74,74,35,89,4,35,98,50,55,16,45,66,14,79,61,44},new int[]{99,30,17,32,7,36,35,67,36,29,63,37,38,81,65,53,47,78,9,42,55,80,3,76,74,42,13,96,96,86,51,29,64,89,76,32,45,88,75,92,66,78,65,28,98},new int[]{67,50,7,71,69,58,47,42,38,18,46,33,22,45,94,61,4,31,95,2,54,27,41,62,85,74,57,8,81,69,45,22,23,17,84,27,60,76,17,34,88,97,43,87,59},new int[]{85,63,26,68,84,42,60,45,40,59,34,16,52,66,71,17,95,97,51,30,17,51,34,58,44,34,23,85,66,54,5,25,2,92,53,35,86,8,35,16,28,24,33,70,16},new int[]{30,59,3,45,83,8,14,77,74,62,38,37,24,99,60,88,75,27,50,35,53,98,61,75,2,8,92,7,67,2,57,33,82,93,68,99,93,68,55,42,46,74,40,10,94},new int[]{74,89,17,23,15,32,46,72,6,56,87,17,44,16,48,44,51,19,24,63,29,96,84,48,20,80,62,23,79,38,9,59,6,71,4,30,86,55,96,36,48,9,16,5,71},new int[]{22,92,75,89,15,48,46,68,49,37,34,99,49,61,67,41,55,25,36,34,56,61,95,19,65,92,64,73,19,19,36,77,55,53,16,86,78,1,25,70,93,42,8,62,23},new int[]{73,80,12,36,95,32,96,49,95,17,24,61,46,4,6,82,72,92,46,41,44,26,71,72,95,44,12,91,24,4,32,58,19,87,92,99,89,51,76,46,95,36,53,52,59},new int[]{27,44,28,74,94,34,33,38,66,72,28,91,66,51,78,91,88,69,70,45,77,88,16,51,75,56,8,35,44,81,62,22,17,35,81,98,17,23,15,10,94,49,8,83,47},new int[]{70,18,9,35,22,18,59,53,7,41,61,5,47,78,33,83,16,86,91,94,81,24,54,21,34,68,15,38,82,71,37,47,71,24,4,18,23,18,40,9,16,35,83,77,9},new int[]{62,93,71,2,18,86,47,47,59,60,48,28,97,33,3,42,68,33,48,56,67,13,46,88,47,95,73,16,3,86,67,52,60,93,28,95,25,70,56,63,59,93,30,13,27},new int[]{86,69,35,18,3,49,58,20,86,94,15,7,19,49,15,31,33,91,58,17,14,63,97,88,72,54,50,26,36,97,83,25,74,77,93,24,42,84,32,64,43,18,40,68,13},new int[]{78,6,57,14,90,43,23,31,16,6,66,27,67,19,9,73,78,78,34,36,58,70,27,34,69,45,50,84,90,18,71,64,62,88,61,94,2,31,34,70,28,16,74,16,87}}); List<Integer> param1 = new ArrayList<>(); param1.add(42); param1.add(23); param1.add(13); param1.add(21); param1.add(4); param1.add(14); param1.add(31); param1.add(9); param1.add(27); param1.add(41); 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()); } }
919
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT.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 CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT{ static boolean f_gold ( int [ ] arr , int n ) { if ( n == 0 || n == 1 ) { return true ; } for ( int i = 1 ; i < n ; i ++ ) { if ( arr [ i - 1 ] > arr [ i ] ) { return false ; } } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,4,10,11,13,17,19,23,26,28,29,30,34,35,37,38,38,43,49,49,50,52,53,55,55,57,58,58,59,64,66,67,70,72,72,75,77,77,87,89,89,90,91,98,99,99,99}); param0.add(new int[]{56,-94,-26,-52,58,-66,-52,-66,-94,44,38,-66,70,-70,-80,-78,-72,-60,-76,68,-50,32,-16,84,74,-42,98,-8,72,26,24,6,24,86,86,78,-92,80,32,-74,26,50,92,4,2,-34,-2,-18,-10}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{38,79,76,92,92}); param0.add(new int[]{-42,-28,2,32,50,56,86,96,98}); param0.add(new int[]{1,0,0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{1,9,12,21,21,24,34,55,60,63,67,68,88,89,91,94,98,99}); param0.add(new int[]{-96,96,-98,-42,-74,40,42,50,-46,-52,8,-46,48,88,-78,-72,-10,-20,98,-40,-18,36,4,46,52,28,-88,-28,-28,-86}); param0.add(new int[]{0,0,0,0,1,1}); param0.add(new int[]{66,12,48,82,33,77,99,98,14,92}); List<Integer> param1 = new ArrayList<>(); param1.add(46); param1.add(30); param1.add(13); param1.add(2); param1.add(7); param1.add(11); param1.add(9); param1.add(29); param1.add(3); param1.add(7); 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()); } }
920
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1.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 COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1{ static int f_gold ( int [ ] arr , int n ) { Map < Integer , Integer > myMap = new HashMap < > ( ) ; int sum = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 0 ) arr [ i ] = - 1 ; sum += arr [ i ] ; if ( sum == 0 ) count ++ ; if ( myMap . containsKey ( sum ) ) count += myMap . get ( sum ) ; if ( ! myMap . containsKey ( sum ) ) myMap . put ( sum , 1 ) ; else myMap . put ( sum , myMap . get ( sum ) + 1 ) ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,6,6,9,9,9,16,18,19,20,21,22,23,26,26,28,39,40,41,43,43,44,44,45,51,51,55,59,60,62,67,67,68,69,70,71,71,72,82,84,88,88,89,89,91,92,92}); param0.add(new int[]{-44,74,-52,-96,46,92,54,56,-38,88,40,34,-72,8,58,-14,36,94,34,-90,-42,80,-12,-42,-6,78,-98,34,-88,0,-76,90,40,64,26,18,-84,72,80}); param0.add(new int[]{0,0,0,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,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{60,48,42,95,30,22,80,15,62,38,63,42,39,28,69,71,30,48,67,9,33,74,95,95,72,35,9}); param0.add(new int[]{-96,-94,-94,-86,-66,-66,-62,-58,-36,-36,-22,-18,-10,2,4,6,10,16,20,24,26,28,28,28,40,42,44,58,76,78,78,80,90,92}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,0,1,1,1,1,0,1,0,0,1,1,1,0,1,1,0,1,0,1,1,1,0,1,1}); param0.add(new int[]{4,5,5,6,7,11,16,16,17,18,19,20,21,22,23,25,26,27,29,31,34,36,37,40,41,45,45,55,65,69,70,71,71,71,73,73,76,79,80,85,85,88,90,97,98,98,99,99}); param0.add(new int[]{34,-20,38,-94,2,32,-26,90,94,-36,-94,6,-24,12,4,60,68,64,-60,-72,-54,-10,-64,-48,-88,60,48,64,0,-26,26,74,32,-92,4,84,6,-16,30,-56,-28,-86,-68}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{4,99,97,63,65,57,69,39,29,91,68,25,84,82,84,89,59,18,77,29,57,40,78,35,23,91,26,71,19,99,12,91,49,71,49,77,67}); List<Integer> param1 = new ArrayList<>(); param1.add(44); param1.add(37); param1.add(32); param1.add(18); param1.add(24); param1.add(28); param1.add(31); param1.add(37); param1.add(19); param1.add(31); 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()); } }
921
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_SUM_NODES_GIVEN_PERFECT_BINARY_TREE_1.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_SUM_NODES_GIVEN_PERFECT_BINARY_TREE_1{ static double f_gold ( int l ) { double leafNodeCount = Math . pow ( 2 , l - 1 ) ; double sumLastLevel = 0 ; sumLastLevel = ( leafNodeCount * ( leafNodeCount + 1 ) ) / 2 ; double sum = sumLastLevel * l ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(5); param0.add(16); param0.add(8); param0.add(61); param0.add(59); param0.add(88); param0.add(67); param0.add(28); param0.add(58); param0.add(42); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
922
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_CIRCUMFERENCE_PARALLELOGRAM.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 PROGRAM_CIRCUMFERENCE_PARALLELOGRAM{ static float f_gold ( float a , float b ) { return ( ( 2 * a ) + ( 2 * b ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Float> param0 = new ArrayList<>(); param0.add(801.0366882228715F); param0.add(-7069.610056819919F); param0.add(7723.966966568705F); param0.add(-7935.859205856963F); param0.add(6094.247432557289F); param0.add(-7371.490363309265F); param0.add(8368.473889617526F); param0.add(-3761.921143166053F); param0.add(3139.1089185587884F); param0.add(-5218.286665567171F); List<Float> param1 = new ArrayList<>(); param1.add(456.71190645582783F); param1.add(-4226.483870778477F); param1.add(5894.65405158763F); param1.add(-5333.225064296693F); param1.add(1660.420120702062F); param1.add(-1095.4543576847332F); param1.add(4735.838330834498F); param1.add(-5315.871691690649F); param1.add(6490.194159517967F); param1.add(-8265.153014320813F); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001F) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
923
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION.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 CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION{ static boolean f_gold ( int n ) { for ( int sum = 0 , i = 1 ; sum < n ; i += 2 ) { sum += i ; if ( sum == n ) return true ; } return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(1); param0.add(4); param0.add(9); param0.add(25); param0.add(36); param0.add(3); param0.add(121); param0.add(14); param0.add(17); param0.add(80); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
924
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_FACTORS_NUMBER.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 SUM_FACTORS_NUMBER{ static int f_gold ( int n ) { int result = 0 ; for ( int i = 2 ; i <= Math . sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { if ( i == ( n / i ) ) result += i ; else result += ( i + n / i ) ; } } return ( result + n + 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(76); param0.add(21); param0.add(4); param0.add(49); param0.add(35); param0.add(55); param0.add(43); param0.add(39); param0.add(36); param0.add(5); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
925
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_GIVEN_STRING_ROTATION_PALINDROME.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 CHECK_GIVEN_STRING_ROTATION_PALINDROME{ static boolean f_gold ( String str ) { int l = 0 ; int h = str . length ( ) - 1 ; while ( h > l ) if ( str . charAt ( l ++ ) != str . charAt ( h -- ) ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("aadaa"); param0.add("2674377254"); param0.add("11"); param0.add("0011000"); param0.add("26382426486138"); param0.add("111010111010"); param0.add("abccba"); param0.add("5191"); param0.add("1110101101"); param0.add("abcdecbe"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
926
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1.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 TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1{ static long f_gold ( int n ) { int N = 10 ; long count = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { count *= ( N + i - 1 ) ; count /= i ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(40); param0.add(11); param0.add(94); param0.add(73); param0.add(6); param0.add(73); param0.add(58); param0.add(40); param0.add(64); param0.add(66); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
927
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION.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 LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION{ static String f_gold ( String str ) { int n = str . length ( ) ; String arr [ ] = new String [ n ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("onWEchl"); param0.add("2"); param0.add("100"); param0.add("GHbCZA"); param0.add("50568798206105"); param0.add("001011110001"); param0.add("lljpYhznnyu"); param0.add("54499921759984"); param0.add("11101"); param0.add("qvypgCYEjsyjwZ"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)).equals(f_gold(param0.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
928
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD.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 CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD{ static boolean f_gold ( int n , int k ) { boolean oneSeen = false ; while ( n > 0 ) { int digit = n % k ; if ( digit > 1 ) return false ; if ( digit == 1 ) { if ( oneSeen ) return false ; oneSeen = true ; } n /= k ; } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(64); param0.add(16); param0.add(27); param0.add(81); param0.add(1); param0.add(69); param0.add(8); param0.add(31); param0.add(43); param0.add(54); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(2); param1.add(3); param1.add(72); param1.add(9); param1.add(17); param1.add(20); param1.add(79); param1.add(81); param1.add(89); 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()); } }
929
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_1.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 MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_1{ private static int f_gold ( int [ ] arr , int n ) { int jumps [ ] = new int [ n ] ; int i , j ; if ( n == 0 || arr [ 0 ] == 0 ) return Integer . MAX_VALUE ; jumps [ 0 ] = 0 ; for ( i = 1 ; i < n ; i ++ ) { jumps [ i ] = Integer . MAX_VALUE ; for ( j = 0 ; j < i ; j ++ ) { if ( i <= j + arr [ j ] && jumps [ j ] != Integer . MAX_VALUE ) { jumps [ i ] = Math . min ( jumps [ i ] , jumps [ j ] + 1 ) ; break ; } } } return jumps [ n - 1 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,5,9,9,12,13,13,13,15,16,17,18,20,20,20,25,28,30,30,33,34,34,37,42,45,49,50,52,52,54,65,68,72,74,75,82,85,87,91,91,94,95}); param0.add(new int[]{-28,90,30,-80,-10,26,-12,24,12,44,-38,20,26,38,-8,-40,88,26}); param0.add(new int[]{0,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,1,1,1,1}); param0.add(new int[]{74,37,37,71,85,89,44,72,55,8,5,98,54,37,7,76,93,74,84,51,18,37}); param0.add(new int[]{-68,14,76}); param0.add(new int[]{0,0,1,1,0,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,1,1}); param0.add(new int[]{3,4,6,6,7,14,28,36,37,44,46,47,50,51,52,55,55,61,68,69,70,73,74,77,86,90,90,91,98,99}); param0.add(new int[]{-4,-24,-84,-76}); param0.add(new int[]{0,0,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,1,1}); param0.add(new int[]{78,88,1,98,26,31,56,12,71}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(9); param1.add(37); param1.add(20); param1.add(1); param1.add(27); param1.add(23); param1.add(2); param1.add(32); param1.add(8); 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()); } }
930
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SORT_EVEN_NUMBERS_ASCENDING_ORDER_SORT_ODD_NUMBERS_DESCENDING_ORDER_1.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; class SORT_EVEN_NUMBERS_ASCENDING_ORDER_SORT_ODD_NUMBERS_DESCENDING_ORDER_1{ static void f_gold ( int arr [ ] , int n ) { for ( int i = 0 ; i < n ; i ++ ) if ( ( arr [ i ] & 1 ) != 0 ) arr [ i ] *= - 1 ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < n ; i ++ ) if ( ( arr [ i ] & 1 ) != 0 ) arr [ i ] *= - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4}); param0.add(new int[]{8,-74,89,65,51,-15,68,51,23,44,89}); param0.add(new int[]{0,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,1,1,1,1,1}); param0.add(new int[]{51,74,43,15,38,15,5,93}); param0.add(new int[]{-96,-75,-64,-20,-5,-2,1,40,46,64}); param0.add(new int[]{0,0,1,0,0,1,0,0,0}); param0.add(new int[]{1,2,4,4,17,22,23,28,35,38,39,39,41,42,42,45,46,49,49,49,50,59,62,68,69,71,73,76,78,79,80,87,88,88,90,90,91,93,95,96,98}); param0.add(new int[]{11,68,-52,-49,-57,-2,83,77,24,-20,85,11,43,-73,96,92,58,64,95,13,-14,14,24,-51,-24,-45,-44,96,-5,-56,59}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{44,7,44,68,34,66,69,55,10,96,42,41,77,69,10,10,91,60,51}); List<Integer> param1 = new ArrayList<>(); param1.add(0); param1.add(8); param1.add(28); param1.add(6); param1.add(7); param1.add(5); param1.add(34); param1.add(24); param1.add(14); param1.add(13); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{4}); filled_function_param0.add(new int[]{8,-74,89,65,51,-15,68,51,23,44,89}); filled_function_param0.add(new int[]{0,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,1,1,1,1,1}); filled_function_param0.add(new int[]{51,74,43,15,38,15,5,93}); filled_function_param0.add(new int[]{-96,-75,-64,-20,-5,-2,1,40,46,64}); filled_function_param0.add(new int[]{0,0,1,0,0,1,0,0,0}); filled_function_param0.add(new int[]{1,2,4,4,17,22,23,28,35,38,39,39,41,42,42,45,46,49,49,49,50,59,62,68,69,71,73,76,78,79,80,87,88,88,90,90,91,93,95,96,98}); filled_function_param0.add(new int[]{11,68,-52,-49,-57,-2,83,77,24,-20,85,11,43,-73,96,92,58,64,95,13,-14,14,24,-51,-24,-45,-44,96,-5,-56,59}); filled_function_param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); filled_function_param0.add(new int[]{44,7,44,68,34,66,69,55,10,96,42,41,77,69,10,10,91,60,51}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(0); filled_function_param1.add(8); filled_function_param1.add(28); filled_function_param1.add(6); filled_function_param1.add(7); filled_function_param1.add(5); filled_function_param1.add(34); filled_function_param1.add(24); filled_function_param1.add(14); filled_function_param1.add(13); for(int i = 0; i < param0.size(); ++i) { f_filled(filled_function_param0.get(i),filled_function_param1.get(i)); f_gold(param0.get(i),param1.get(i)); if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i)) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
931
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1.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 SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1{ static int f_gold ( int arr [ ] , int n , int x ) { int i = 0 ; while ( i < n ) { if ( arr [ i ] == x ) return i ; i = i + Math . abs ( arr [ i ] - x ) ; } System . out . println ( "number is not" + " present!" ) ; return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8, 7, 6, 7, 6, 5, 4, 3, 2, 3, 4, 3}); param0.add(new int[]{6,90}); param0.add(new int[]{1, 2, 3, 4, 5, 4}); param0.add(new int[]{97,35,60,96,3,67,72,95,55,9,69,28,15,91,31,59}); param0.add(new int[]{-84,-78,-74,-70,-68,-60,-56,-54,-48,-46,-28,-16,-6,0,0,8,8,8,12,16,26,30,32,34,36,40,46,48,70,70,72,76,78,78,80,84,84,86}); param0.add(new int[]{1,0,1,1,1,1,0,1,1,1,1}); param0.add(new int[]{55,64,76,79,93,96}); param0.add(new int[]{66,-90,98,-50,0,46,42,64,-96,-80,-96,20,-10,-84}); param0.add(new int[]{0,0,0,0,0,0,1}); param0.add(new int[]{94,4,34,87,32,3,92,68,57,76,24,33,3,4,30,70,49,30,72,82,16,53,6,24,92,96,89,28,21,8,36,9,40,85,51,1,63,68,74,26,40,3,9,32,67,4,6,73}); List<Integer> param1 = new ArrayList<>(); param1.add(12); param1.add(1); param1.add(6); param1.add(15); param1.add(22); param1.add(5); param1.add(4); param1.add(8); param1.add(6); param1.add(25); List<Integer> param2 = new ArrayList<>(); param2.add(3); param2.add(1); param2.add(5); param2.add(9); param2.add(31); param2.add(7); param2.add(4); param2.add(13); param2.add(5); param2.add(25); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
932
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_SEQUENCE_2_22_222.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 SUM_SEQUENCE_2_22_222{ static double f_gold ( int n ) { return 0.0246 * ( Math . pow ( 10 , n ) - 1 - ( 9 * n ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(88); param0.add(79); param0.add(7); param0.add(36); param0.add(23); param0.add(10); param0.add(27); param0.add(30); param0.add(71); param0.add(6); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
933
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE.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 MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE{ static int f_gold ( int arr [ ] , int n ) { int i ; int ans = Integer . MIN_VALUE ; int maxval = 1 ; int minval = 1 ; int prevMax ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] > 0 ) { maxval = maxval * arr [ i ] ; minval = Math . min ( 1 , minval * arr [ i ] ) ; } else if ( arr [ i ] == 0 ) { minval = 1 ; maxval = 0 ; } else if ( arr [ i ] < 0 ) { prevMax = maxval ; maxval = minval * arr [ i ] ; minval = prevMax * arr [ i ] ; } ans = Math . max ( ans , maxval ) ; if ( maxval <= 0 ) { maxval = 1 ; } } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{19,25,34,39,41,51,52,53,54,56,64,67,72,87,92,93,95}); param0.add(new int[]{10}); param0.add(new int[]{0,0,0,0,0,0,1,1}); param0.add(new int[]{84,81,14,15,34,52,54,1,16,65,54,71,15,40,53,35,62,84,81,85,28,90,74,97,64,3,7,38}); param0.add(new int[]{-94,-86,-56,-52,-52,-46,-40,-36,-36,-30,-12,18,20,32,44,50,54,64,68,74,74,74,82}); param0.add(new int[]{0,0,0,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,1,1,0,0,0,1,1,0,0,1,0}); param0.add(new int[]{2,3,4,8,11,16,16,18,20,22,24,26,26,27,29,31,37,38,45,45,46,50,50,59,59,59,60,61,63,65,68,69,71,74,74,76,79,82,88,88,89,91,93,93,99,99}); param0.add(new int[]{2,-24,-8,-82,76,-62,38,6,-92,30,68,98,-68,8,24,-34,-34,64,-4,-2,-56,-30,92,10,-60,88,4,14,90,-44,-54,4,-4,-26,14,-2,0,82}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{70,92,76,56,93,55,12,80,56,36,83,14,16,12,70,55,93,28,84,28,49,66,15,49,98}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(0); param1.add(5); param1.add(14); param1.add(21); param1.add(29); param1.add(45); param1.add(23); param1.add(19); param1.add(13); 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()); } }
934
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE.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 CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE{ static int f_gold ( int notes [ ] , int n ) { int fiveCount = 0 ; int tenCount = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( notes [ i ] == 5 ) fiveCount ++ ; else if ( notes [ i ] == 10 ) { if ( fiveCount > 0 ) { fiveCount -- ; tenCount ++ ; } else return 0 ; } else { if ( fiveCount > 0 && tenCount > 0 ) { fiveCount -- ; tenCount -- ; } else if ( fiveCount >= 3 ) { fiveCount -= 3 ; } else return 0 ; } } return 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5, 5, 5, 10, 20}); param0.add(new int[]{5,5,5,20,10}); param0.add(new int[]{5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,10,10,10,10,10,10,10,10,10,10,10,10,10}); param0.add(new int[]{10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,18}); param0.add(new int[]{5,5,20}); param0.add(new int[]{10,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5}); param0.add(new int[]{5,10,20,5,5,5,5,5,5,5,5,5,5,5,5}); param0.add(new int[]{-82,-10,-78,-84,68,62,10,20,-86,-98,92,70,40,-12,-20,-36,8,-70,6,8,44,-24,8,-18,76,-54,-14,-94,-68,-62,-24,-36,-74,92,92,-80,48,56,94}); param0.add(new int[]{10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5}); param0.add(new int[]{46,46,93,57,82,34,83,80,77,36,80,85,69,28,9,56,49,27,83,25,1,80,99,14,69,82,79,71,74,34}}); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(5); param1.add(27); param1.add(12); param1.add(2); param1.add(17); param1.add(7); param1.add(31); param1.add(25); param1.add(20); 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()); } }
935
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE.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 MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE{ static int f_gold ( int arr [ ] , int n , int x ) { int curr_sum = 0 , min_len = n + 1 ; int start = 0 , end = 0 ; while ( end < n ) { while ( curr_sum <= x && end < n ) curr_sum += arr [ end ++ ] ; while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{6,11,11,14,18,19,21,22,22,23,26,27,28,28,29,30,31,34,39,42,42,44,45,49,49,53,57,61,65,66,67,70,71,73,74,74,78,85,88,94,95,97}); param0.add(new int[]{-30,-22,-66,-80,18,-64,-28,-46,94,60,-64,2,26,-94,58,56,56,88,50,-78,-12,68,54,-78,42,-30,24,-48,84,12,-88,0,54,-92,-4,42,-60,-72,-32}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param0.add(new int[]{86,8,23,40,55,93,11,35,33,37,96,91,35,66,37,57,83,99,96,15,18,93}); param0.add(new int[]{-92,-68,-48,-48,-42,-26,-22,-18,2,4,8,14,20,22,32,46,52,62,70,96,98}); param0.add(new int[]{0,0,0,0,1,0,1,1,0,1,0,0,0}); param0.add(new int[]{4,4,11,11,13,15,16,18,19,19,19,23,26,27,34,39,39,40,41,46,47,51,52,52,53,57,58,58,60,64,68,70,72,84,84,85,95,98,99}); param0.add(new int[]{12,-22,2,-90,-92,84,-26,-76,-72,50,-36,30,78,-18,-94,-30,22,28,10,32,34,-86,0,-4,40,0,80,50,66,-48,-40,-94,64,58,-14,0,-32,-58,-22,-94,-68,-36,-94,-48,40,78,-74}); param0.add(new int[]{0,0,0,0,0,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,1,1}); param0.add(new int[]{1,33,20,32,76,27,8,95,78,72,25,56}); List<Integer> param1 = new ArrayList<>(); param1.add(37); param1.add(31); param1.add(8); param1.add(16); param1.add(17); param1.add(11); param1.add(31); param1.add(42); param1.add(25); param1.add(9); List<Integer> param2 = new ArrayList<>(); param2.add(23); param2.add(29); param2.add(12); param2.add(13); param2.add(14); param2.add(10); param2.add(35); param2.add(26); param2.add(21); param2.add(10); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
936
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS.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 NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS{ static int f_gold ( int x ) { int rightOne , nextHigherOneBit , rightOnesPattern , next = 0 ; if ( x > 0 ) { rightOne = x & - x ; nextHigherOneBit = x + rightOne ; rightOnesPattern = x ^ nextHigherOneBit ; rightOnesPattern = ( rightOnesPattern ) / rightOne ; rightOnesPattern >>= 2 ; next = nextHigherOneBit | rightOnesPattern ; } return next ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(42); param0.add(75); param0.add(94); param0.add(5); param0.add(52); param0.add(22); param0.add(77); param0.add(44); param0.add(85); param0.add(59); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
937
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1.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 SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1{ static int f_gold ( int arr [ ] , int n , int key , int capacity ) { if ( n >= capacity ) return n ; int i ; for ( i = n - 1 ; ( i >= 0 && arr [ i ] > key ) ; i -- ) arr [ i + 1 ] = arr [ i ] ; arr [ i + 1 ] = key ; return ( n + 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{69}); param0.add(new int[]{-34,-38,-72,90,-84,-40,-40,-52,-12,80,-4,-58}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{96,34,11,1,36,79,64,75,75,96,32,18,25,79,63,80,90,75,44,71,48,1,62,53,17,98}); param0.add(new int[]{-98,-92,-92,-84,-82,-80,-80,-74,-70,-60,-48,-42,-36,-34,-34,-34,-30,-28,-16,-6,-2,-2,2,12,14,20,24,40,46,50,60,66,70,72,78,82,88,92,94,94,96}); param0.add(new int[]{1,0,1,1,0,0,1,0,0,0,1,1,0}); param0.add(new int[]{10,12,12,19,20,21,24,27,37,47,50,54,55,58,61,63,63,68,73,75,87,90,90,92,92}); param0.add(new int[]{-74,62,74,92,-38,-28,-26,4,88,-68,-76,-20,-4,12,72,6,42,36,88,-96,-80,90,80,-26,-36,-72,-62,38,-20,40,-10,-22,-20,38,82,-84,8,-60,86,-26,44,-72,-70,-16,-22,18,-16,76,-50}); param0.add(new int[]{1,1,1,1,1}); param0.add(new int[]{64,80,47,58,41,3,85,96,51,4,22,89,67,54,88,15,83,31,19,28,40,67,37,13,63,38,27,14,7,68}); List<Integer> param1 = new ArrayList<>(); param1.add(0); param1.add(6); param1.add(13); param1.add(21); param1.add(30); param1.add(12); param1.add(12); param1.add(37); param1.add(3); param1.add(23); List<Integer> param2 = new ArrayList<>(); param2.add(0); param2.add(6); param2.add(19); param2.add(20); param2.add(32); param2.add(9); param2.add(13); param2.add(26); param2.add(4); param2.add(24); List<Integer> param3 = new ArrayList<>(); param3.add(0); param3.add(9); param3.add(11); param3.add(13); param3.add(28); param3.add(10); param3.add(21); param3.add(42); param3.add(2); param3.add(25); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
938
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES.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 CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES{ static int f_gold ( int arr [ ] , int n ) { int LIS [ ] = new int [ n ] ; int len = 0 ; for ( int i = 0 ; i < n ; i ++ ) LIS [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { for ( int j = 0 ; j < i ; j ++ ) { if ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) LIS [ i ] = Math . max ( LIS [ i ] , LIS [ j ] + 1 ) ; } len = Math . max ( len , LIS [ i ] ) ; } return n - len ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,4,12,14,15,18,20,24,25,25,27,33,34,42,46,48,49,50,50,52,55,56,57,58,64,65,66,69,72,75,78,80,84,90,92,95,99}); param0.add(new int[]{-56,6,-74,-30,34,40,-76,-10,-12,-86,-76,36,-72,82,38,68,28,84,98,-84,6,16,-46,8,2,-18,-50,4,-96,88,-84,-38,-82,-54}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{68,79,87,44,3,99,80,6,46,67,72,40,11,18,73,48,18,72,10,38,3,39,26,76,47,15,85,69}); param0.add(new int[]{-96,-94,-94,-74,-68,-60,-58,-56,-56,-52,-52,-50,-44,-40,-26,-24,-10,-8,-6,-2,2,2,12,14,20,24,26,30,38,40,52,52,62,62,68,70,74,76,80,82,90,92}); param0.add(new int[]{1,1,1,0,1}); param0.add(new int[]{1,5,11,20,24,28,29,31,54,58,63,65,66,71,77,80,83,92,93,93}); param0.add(new int[]{-50,-46,-44,-90,2,-38,88,-26,60}); param0.add(new int[]{1,1}); param0.add(new int[]{2,1,19,26,65,47,3,65,9,12,84,59,74,59,30,83,73,67,13,5,64,83,81,92,80,14,58,84,92}); List<Integer> param1 = new ArrayList<>(); param1.add(21); param1.add(22); param1.add(6); param1.add(15); param1.add(31); param1.add(3); param1.add(12); param1.add(7); param1.add(1); param1.add(16); 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()); } }
939
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/C_PROGRAM_FACTORIAL_NUMBER_1.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 C_PROGRAM_FACTORIAL_NUMBER_1{ static int f_gold ( int n ) { int res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(15); param0.add(7); param0.add(16); param0.add(67); param0.add(71); param0.add(16); param0.add(77); param0.add(27); param0.add(37); param0.add(73); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
940
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/EQUILIBRIUM_INDEX_OF_AN_ARRAY_1.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 EQUILIBRIUM_INDEX_OF_AN_ARRAY_1{ static int f_gold ( int arr [ ] , int n ) { int sum = 0 ; int leftsum = 0 ; for ( int i = 0 ; i < n ; ++ i ) sum += arr [ i ] ; for ( int i = 0 ; i < n ; ++ i ) { sum -= arr [ i ] ; if ( leftsum == sum ) return i ; leftsum += arr [ i ] ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{24,31,44,52,78,95}); param0.add(new int[]{-78,-38,22,58,68,-60,-30,6,58,20,-64,-40,-14,80,-2,-88,-68,-16,-4,78,-38,-74,78,-72,46,-12,82,-76,-98,-28,-32,88,72,72,64,-10,98,-24,-96}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{98,69,41,48,40,90,76,61,17,81,74,92,54,16,11,15,8,16,84,86,34,34,75,92,67,54,93,19,31,62,89,26,96,91,32,78,42,84,66,79,29,48,49,5}); param0.add(new int[]{-28,42}); param0.add(new int[]{1,1,1,1,0,0,0,0,0,1,0,1,1,0,1,1,0,1,0,1,0,0,0,1,0,1}); param0.add(new int[]{18,21,23,24,36,37,39,49,55,68,80,81,88,90}); param0.add(new int[]{94,22,42,-42,78,50,96,98,46,74,98,84,-2,-76,48,18,28,-62,78,6,-76,-12,46,62,14,76,44,-26,-92,12,62,-72,-42}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{1,23,18,91,65,2,73,12,91,47,14,48,1,69,95,81,59,36,79,35,9,52,55,73,54,25,8,41,64,96}); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(19); param1.add(11); param1.add(27); param1.add(1); param1.add(25); param1.add(11); param1.add(32); param1.add(14); param1.add(19); 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()); } }
941
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT.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 HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT{ static int f_gold ( int n ) { int sum = 0 ; while ( n != 0 ) { sum = sum + n % 10 ; n = n / 10 ; } return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(57); param0.add(21); param0.add(11); param0.add(64); param0.add(88); param0.add(62); param0.add(17); param0.add(49); param0.add(22); param0.add(19); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
942
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_DIFFERENCE_SUM_ELEMENTS_TWO_ROWS_MATRIX.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 MAXIMUM_DIFFERENCE_SUM_ELEMENTS_TWO_ROWS_MATRIX{ static int f_gold ( int mat [ ] [ ] , int m , int n ) { int rowSum [ ] = new int [ m ] ; for ( int i = 0 ; i < m ; i ++ ) { int sum = 0 ; for ( int j = 0 ; j < n ; j ++ ) sum += mat [ i ] [ j ] ; rowSum [ i ] = sum ; } int max_diff = rowSum [ 1 ] - rowSum [ 0 ] ; int min_element = rowSum [ 0 ] ; for ( int i = 1 ; i < m ; i ++ ) { if ( rowSum [ i ] - min_element > max_diff ) max_diff = rowSum [ i ] - min_element ; if ( rowSum [ i ] < min_element ) min_element = rowSum [ i ] ; } return max_diff ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{1,5,5,6,6,7,7,11,12,15,17,24,25,27,30,33,35,36,38,41,42,44,44,46,50,53,53,56,58,67,71,71,77,78,85,85,87,87,89,91,94,96,97,98,99,99},new int[]{1,3,3,6,7,12,18,19,21,21,23,25,25,26,33,37,38,39,39,39,41,42,43,46,49,50,54,56,57,60,66,67,67,68,69,71,75,76,85,86,88,90,91,93,98,98},new int[]{2,2,3,9,15,18,21,21,23,24,27,28,28,28,30,34,36,38,40,43,45,46,46,49,53,53,55,58,66,66,67,68,70,72,73,73,75,77,78,80,83,84,88,89,95,98},new int[]{1,3,6,6,7,7,8,11,15,21,21,24,28,28,29,30,31,31,33,34,36,46,47,49,51,58,64,65,69,70,70,76,78,81,86,86,87,89,90,92,93,94,97,97,97,99},new int[]{10,11,12,12,17,19,23,24,25,26,28,31,31,33,35,39,41,42,42,45,49,50,53,56,57,60,60,62,63,64,64,65,66,68,71,77,77,80,80,81,84,84,86,86,90,92},new int[]{2,2,3,7,8,10,11,12,13,19,20,22,24,24,27,29,30,32,34,35,37,37,37,38,39,39,39,44,54,54,57,62,63,64,64,70,72,73,84,84,85,87,89,94,95,95},new int[]{1,1,4,4,6,7,20,22,24,25,26,31,31,35,38,41,41,42,47,48,48,50,51,56,56,57,57,58,61,62,67,68,72,75,75,77,80,81,83,83,84,87,88,97,97,98},new int[]{2,3,10,13,16,23,26,27,29,30,35,35,36,39,41,42,45,48,49,49,56,56,59,59,59,60,60,61,62,64,67,67,71,73,76,78,81,83,86,87,87,88,89,92,97,99},new int[]{8,13,14,15,16,16,19,25,25,28,29,30,30,34,36,38,40,41,41,43,46,48,49,49,49,50,53,55,57,63,64,64,66,70,74,74,77,77,78,83,84,92,93,93,96,99},new int[]{2,3,5,5,6,6,6,8,8,14,15,19,22,23,27,28,31,32,33,34,34,36,38,42,43,49,55,57,58,68,71,71,74,77,81,85,85,87,90,91,92,94,96,97,97,98},new int[]{1,4,5,8,9,9,16,16,19,20,21,24,25,25,26,29,30,34,38,39,40,46,48,49,55,56,57,57,59,62,63,64,64,69,70,73,77,78,78,85,85,91,92,93,95,97},new int[]{1,5,11,11,15,15,15,23,30,31,34,37,39,39,44,44,46,47,47,47,48,49,50,53,54,58,62,64,66,67,68,69,73,74,80,82,82,84,85,89,91,91,93,96,97,98},new int[]{2,3,5,7,8,9,9,10,14,18,20,21,25,28,31,33,33,34,34,39,45,47,48,49,49,54,58,64,71,74,74,75,78,82,82,83,84,88,92,92,93,94,95,95,98,99},new int[]{1,2,6,9,9,9,15,15,17,17,24,25,26,27,28,28,30,30,33,34,36,39,41,42,46,46,53,59,62,65,68,69,70,71,72,74,76,78,83,84,90,92,96,98,98,99},new int[]{1,1,3,5,7,8,8,10,11,18,18,18,21,30,35,36,43,51,51,53,54,57,58,58,58,59,60,60,60,61,63,68,70,74,76,82,83,87,87,87,91,91,92,93,97,99},new int[]{3,3,3,6,11,13,13,14,16,16,22,28,29,29,32,35,38,51,51,52,53,57,58,62,67,70,71,73,73,76,76,76,80,80,83,84,84,86,87,91,92,95,95,96,96,99},new int[]{1,3,7,7,7,9,9,10,16,21,23,23,24,24,26,27,36,37,43,44,48,50,51,52,53,56,57,58,59,66,68,69,72,73,74,76,77,77,80,81,81,81,84,84,90,98},new int[]{1,1,2,6,10,12,13,14,15,16,20,22,22,22,24,25,26,30,34,35,35,37,38,39,43,43,43,49,50,56,57,62,64,66,67,68,71,78,82,84,86,86,89,90,94,96},new int[]{2,5,6,7,7,9,9,12,20,21,23,25,30,32,37,40,41,43,43,45,45,45,57,60,61,61,61,63,66,67,67,68,69,70,73,74,75,78,82,83,84,87,89,90,99,99},new int[]{8,11,12,16,22,23,23,27,28,29,31,38,39,41,42,42,48,48,52,52,57,58,60,60,63,66,66,67,69,72,74,75,75,76,76,78,79,80,84,86,92,92,94,94,96,98},new int[]{2,3,4,6,6,14,14,16,17,20,22,23,26,28,28,29,29,31,32,32,38,40,42,45,51,52,54,56,62,65,66,68,73,79,80,81,87,87,88,89,89,89,91,93,96,97},new int[]{4,6,9,12,13,14,16,17,18,23,25,25,26,27,29,33,34,45,45,46,49,51,51,51,52,53,59,59,64,66,67,67,70,71,72,77,77,78,82,82,84,90,93,94,96,99},new int[]{1,2,7,8,9,11,19,20,23,23,24,29,29,34,41,46,48,51,51,53,54,59,61,65,67,72,74,76,76,77,80,81,81,84,87,88,90,91,92,92,93,95,96,96,97,99},new int[]{1,3,4,6,8,9,9,9,9,10,15,23,24,24,25,32,34,35,38,42,43,44,45,45,48,49,53,57,57,60,60,68,70,72,72,73,74,76,76,77,79,80,83,85,94,96},new int[]{2,5,7,11,12,12,14,15,16,18,20,21,25,25,26,29,35,41,43,44,47,47,50,52,52,55,57,58,60,62,67,68,69,73,74,76,78,85,86,87,87,87,90,91,94,96},new int[]{1,3,5,7,7,8,10,11,13,17,24,25,26,29,30,32,33,35,36,40,41,43,44,47,49,51,54,57,59,65,69,73,74,80,80,82,82,82,84,85,85,87,90,94,95,97},new int[]{1,4,6,8,13,13,13,17,17,18,22,23,23,24,24,30,32,33,36,36,36,39,40,41,43,43,45,49,51,55,55,56,57,61,63,65,65,68,69,71,72,72,77,80,96,99},new int[]{1,2,3,6,7,8,10,12,13,14,17,18,19,22,23,25,28,29,31,33,34,36,36,38,41,42,42,45,48,49,49,49,50,53,54,62,70,72,77,79,84,85,92,92,93,99},new int[]{1,1,6,7,11,14,17,17,21,28,29,31,32,37,40,43,44,46,47,52,56,58,59,60,63,65,68,70,75,81,81,81,82,84,85,85,88,92,92,93,94,95,95,95,99,99},new int[]{1,4,4,7,9,11,12,14,14,14,19,24,26,28,29,31,36,39,41,45,45,46,47,49,58,60,60,62,63,71,72,76,76,76,77,78,80,81,83,84,84,85,89,94,97,98},new int[]{1,7,10,13,15,16,16,18,19,22,26,28,33,35,36,37,38,40,41,42,42,45,46,47,48,54,54,54,58,64,65,66,67,67,68,70,71,72,74,77,78,84,85,88,88,93},new int[]{2,2,2,5,8,8,20,22,27,28,30,31,32,33,34,36,37,38,39,41,42,50,50,55,59,63,65,66,71,73,74,76,78,81,86,89,90,91,93,94,94,94,95,96,98,98},new int[]{1,1,2,3,5,5,7,7,7,9,10,10,14,16,20,24,26,31,36,40,44,46,49,50,50,50,54,56,58,60,62,62,63,66,67,74,75,75,79,82,90,91,91,93,93,95},new int[]{3,7,9,9,10,13,15,16,19,20,22,24,28,32,36,37,39,40,42,43,43,43,45,46,50,50,52,57,58,61,69,70,71,72,74,76,78,83,83,87,87,89,91,96,98,99},new int[]{1,8,8,9,16,17,18,20,20,20,22,27,28,29,29,30,31,34,36,41,43,47,51,52,55,56,58,66,67,67,68,70,71,75,76,78,79,80,80,85,87,90,94,94,95,96},new int[]{4,4,5,7,7,18,19,21,22,24,24,26,29,31,33,36,37,38,47,50,50,51,51,52,53,53,53,53,55,55,55,57,58,73,76,76,80,81,83,85,86,87,89,90,91,97},new int[]{1,3,5,12,15,18,18,20,22,26,26,27,28,29,31,32,32,35,36,39,40,42,47,47,49,51,51,51,51,57,62,62,64,66,70,71,72,73,74,84,84,88,89,94,96,97},new int[]{10,11,13,15,15,17,17,18,21,22,24,24,26,28,32,33,34,35,39,40,45,46,48,50,54,55,55,56,57,60,62,62,63,63,67,67,68,68,71,72,78,79,80,90,97,98},new int[]{1,5,7,7,9,11,14,22,25,26,28,31,34,37,38,44,46,47,47,48,48,52,52,53,54,54,54,57,60,61,67,74,75,77,78,80,80,81,81,86,91,92,94,97,98,99},new int[]{2,3,11,15,15,16,22,22,24,31,32,32,32,33,33,35,36,41,43,44,46,46,47,50,54,55,55,57,59,65,67,67,68,70,70,73,74,79,82,84,84,86,87,87,94,97},new int[]{1,2,2,3,5,7,9,12,12,12,13,16,19,19,22,23,23,27,30,32,33,38,43,47,47,47,50,53,53,56,57,59,60,64,67,70,73,78,81,82,88,88,92,95,97,98},new int[]{2,3,3,5,6,8,20,23,24,26,27,28,35,38,38,40,43,44,44,46,47,49,51,53,56,58,59,63,63,64,65,67,68,68,69,70,76,80,82,85,86,87,88,92,92,96},new int[]{1,1,2,2,4,5,8,10,11,14,15,17,17,18,23,31,35,36,42,44,48,49,51,52,52,61,64,66,67,68,70,72,75,77,78,81,84,85,87,95,97,98,98,98,98,99},new int[]{2,6,6,7,9,11,16,17,26,26,28,35,36,43,44,46,48,50,51,53,53,54,56,57,58,67,68,68,68,73,73,74,75,77,78,78,78,79,80,85,86,91,92,92,98,99},new int[]{3,9,9,12,15,19,19,30,31,34,35,35,39,40,47,49,49,53,58,58,59,61,61,63,64,66,67,69,70,70,71,74,77,77,78,82,84,90,90,90,91,92,92,94,95,97},new int[]{3,4,8,8,8,9,10,23,27,27,31,31,36,38,38,39,40,41,41,41,46,48,51,54,55,55,65,65,67,74,74,77,79,83,83,84,86,87,89,89,90,92,93,97,98,99}}); param0.add(new int[][]{new int[]{-38,-60,88,-62,64,-80,-6,-2,92,70,-90,90,-48,12,-90,38,-32,-62,-64,-86,28,-72,42,-56,42,72,80,40,-20,-2,36,-74,70,-76,-98,2,2,12,-4,-36,48,-60,-36,-94},new int[]{46,-60,-56,-72,84,42,-58,20,94,42,40,18,-48,34,-40,-64,38,80,64,-96,-94,34,-24,-30,0,-82,-70,56,-30,-12,-86,-34,18,62,46,90,-82,-60,-60,8,52,58,76,-18},new int[]{-36,-60,-48,96,-22,-96,16,-16,94,20,52,-14,94,-12,-62,-10,24,86,-40,-92,30,-6,-74,60,42,-84,30,-38,70,30,-2,-96,96,-68,54,-38,38,94,-62,-54,0,32,-86,76},new int[]{18,52,-66,-96,-56,10,14,40,-96,-58,72,30,-24,80,-22,46,0,-88,-10,0,-82,-76,-70,-38,-52,72,-60,40,-92,30,18,70,-58,76,-60,98,98,42,-70,-66,26,-18,-24,0},new int[]{6,-98,22,-4,8,84,52,-72,34,-68,-86,-4,-92,92,-74,76,46,30,0,-10,-4,-28,62,72,78,84,96,-12,30,12,-56,46,66,-12,96,-52,-26,-52,-62,68,-8,-84,68,-98},new int[]{-90,42,78,-70,-6,-82,68,26,20,18,30,64,12,-98,-90,22,-64,-60,-34,-24,-30,-76,-62,28,6,-58,-70,-52,34,-72,80,-6,-66,58,28,30,-38,80,-58,26,72,-46,-18,-74},new int[]{-2,-40,-52,-68,-80,86,-78,18,-60,-18,-94,-50,-30,-22,-40,-76,58,4,-88,-82,32,-52,76,62,-22,6,76,-80,38,34,82,-50,18,-4,-96,72,-46,22,-66,46,-50,-34,28,2},new int[]{-18,94,94,-92,-96,64,60,94,8,10,-14,74,12,28,58,18,-68,-66,20,-84,6,-54,88,76,-72,-94,-84,-28,22,-84,-50,-22,66,86,-12,-52,66,-82,-24,0,62,-74,58,10},new int[]{86,26,-24,-10,-46,42,86,-76,-42,0,-74,-86,-32,88,-50,12,-14,-88,-94,8,38,-72,-26,-8,56,-36,82,-80,-12,42,-86,96,-90,-34,-6,-86,-72,52,-42,80,86,26,-72,8},new int[]{-26,-10,44,-70,-22,-40,4,82,40,-18,-64,72,10,36,-76,78,52,-58,4,-60,-52,-32,-58,-68,32,-82,82,-80,6,58,44,26,-44,-48,-98,-42,-48,-46,4,48,-36,-84,10,0},new int[]{50,-64,98,0,-90,80,80,-24,-84,-22,-84,-6,76,26,36,-82,-46,-92,86,54,-18,22,76,98,16,64,-32,62,84,58,-16,-22,46,-76,-58,40,26,28,-62,-66,-60,-20,72,-68},new int[]{-20,14,-4,-90,14,86,22,26,20,-80,96,-20,-90,50,-94,10,-96,46,-74,58,84,24,-60,64,-28,-58,18,-52,-64,-54,52,-26,78,-50,-80,-8,-4,-30,78,-2,32,70,84,-60},new int[]{22,98,26,-72,6,-24,98,74,-48,-48,76,-12,-88,48,-56,-52,78,-58,58,-72,86,-78,-70,36,26,4,-98,-32,90,-96,-42,-18,90,-8,-84,-4,72,24,-6,60,38,-72,14,-2},new int[]{-24,-10,-16,-92,-52,6,-44,-84,0,98,88,-4,58,4,-20,28,-58,32,64,68,-66,96,36,16,-74,42,-96,70,-92,48,-52,-58,40,-46,82,-36,-68,-10,94,-62,-34,-86,-6,4},new int[]{32,96,22,22,-82,-14,-58,-78,44,-70,-30,-62,-56,-52,42,26,-48,18,18,80,-82,50,-12,90,20,6,72,-30,-80,-56,72,68,0,-70,-28,52,-52,-64,86,36,-38,-30,24,-64},new int[]{22,-74,-30,54,76,58,-88,56,-30,-48,4,18,-28,54,42,-2,8,-32,-20,4,-40,-74,78,42,6,26,94,50,94,-78,-16,54,36,-42,-6,-10,-70,84,62,68,-76,-12,-46,-30},new int[]{56,-8,86,-22,-80,28,8,-10,-40,-4,0,-70,-70,26,-70,-70,-84,-24,-10,-84,-12,72,8,-46,38,2,86,-46,48,-62,60,-36,-18,-56,-84,98,6,-24,-22,12,2,72,34,40},new int[]{12,-4,-66,-10,-20,-4,96,2,76,72,40,64,-6,48,32,-76,18,42,66,22,12,62,34,-50,10,68,94,-2,82,20,8,26,22,-48,42,28,-70,-58,88,-18,12,14,-46,-96},new int[]{70,-32,42,-72,54,54,-92,-62,30,-58,50,-96,68,-32,40,-64,76,-54,88,98,86,74,62,28,-62,0,60,-94,24,52,70,44,76,-24,-46,-50,74,-2,40,36,-52,-40,46,88},new int[]{46,-14,-6,56,-94,-18,-24,-36,-2,98,28,-40,36,-36,82,-62,88,-46,-70,-64,-30,34,-14,18,-20,52,-96,-80,-20,-68,-62,-24,60,54,66,40,14,6,20,-90,-20,46,66,56},new int[]{4,14,-78,-26,-16,10,40,-74,60,-80,46,28,80,-66,-28,76,-4,50,-4,66,-38,0,46,52,98,14,-4,92,92,-14,24,24,90,-66,-86,20,-44,80,-26,-50,92,92,86,-38},new int[]{-44,-74,44,-46,-32,-50,52,94,-86,46,8,56,6,12,54,66,-22,18,-74,-54,-88,42,16,8,-22,96,-78,98,18,-16,72,44,-46,36,4,72,-70,-68,-64,20,-60,-50,84,-64},new int[]{8,82,24,-46,-62,78,-72,94,-8,42,18,74,-40,-94,-86,70,-34,-20,58,32,-14,-42,-46,-14,6,2,74,16,92,20,6,-62,40,-40,88,-12,82,18,-22,22,38,-88,28,90},new int[]{82,-92,96,88,-64,38,14,-22,56,-84,2,-16,-88,-4,-50,-74,-10,-36,68,22,-92,50,-12,54,-84,-24,-50,-72,12,38,74,-32,-26,-96,38,14,-50,94,74,-78,-56,96,-68,14},new int[]{-22,46,-52,16,28,-22,-48,-96,92,-54,-40,86,30,-4,-86,-92,-52,-18,-98,-78,38,70,-86,98,72,30,90,-28,36,58,14,12,98,-54,36,-32,-16,-76,88,32,-28,-4,52,30},new int[]{38,-90,44,54,-2,16,-16,-66,62,98,32,-82,-12,12,-66,54,-72,64,-10,30,40,0,-90,90,-54,-92,-48,58,10,-4,-24,-86,-68,70,24,-38,-56,-78,-16,56,70,88,0,54},new int[]{-50,2,18,-6,-12,64,-12,64,-44,16,-16,20,72,32,-54,-22,-12,56,84,-48,-60,-90,-70,-12,-4,-72,-78,16,22,12,48,-2,-82,-94,48,30,76,-12,94,-8,-10,-8,-46,-22},new int[]{96,56,-22,-44,-30,92,-56,26,-42,60,-2,58,52,8,-48,70,-38,-32,-92,14,26,76,48,84,-96,42,32,38,6,-70,-58,4,58,86,-54,-4,80,94,18,28,-82,4,-14,-80},new int[]{-70,-4,88,20,-96,64,-64,-66,-44,50,-72,-56,90,38,46,-84,68,66,-42,52,2,-6,94,78,-48,84,-78,82,-78,96,24,-12,-78,60,54,26,-20,-80,-26,-42,66,-40,-8,-74},new int[]{-60,-36,-16,18,24,54,-52,-28,-48,10,-16,-28,-26,-44,72,38,-56,70,28,42,-38,66,-34,-92,-42,66,-18,6,-64,72,-22,-72,82,4,-14,-98,20,-92,84,98,84,-92,-96,20},new int[]{-66,8,-92,76,-24,-36,-18,-62,-62,12,26,-12,-64,-26,-16,-42,2,82,-16,-74,-60,8,62,-8,0,-66,-52,-44,-54,58,16,94,-90,-60,-2,-14,18,16,-22,-88,-60,-16,26,-18},new int[]{-22,-42,20,-58,72,86,2,-94,32,-16,-68,-96,10,-74,40,-78,96,-92,-94,6,-26,-50,-28,-34,62,10,74,-82,0,4,58,-62,28,14,26,2,-40,-68,42,42,80,4,-48,-74},new int[]{-40,26,-68,-60,-22,-50,70,-42,54,30,-40,-70,66,-8,-66,24,28,-46,68,8,-4,84,66,54,22,-80,-20,-28,2,6,24,88,-70,-80,22,-96,-50,60,-76,-32,26,-58,6,6},new int[]{-60,28,-56,-4,-8,-32,-12,48,48,94,18,30,-56,72,-70,68,-26,-48,22,18,64,78,38,-90,18,-34,90,-98,82,-26,-80,-34,-22,72,58,82,-96,-20,-80,16,-50,-4,24,64},new int[]{-18,-62,54,32,82,-22,70,16,88,-34,70,16,-6,-80,34,-42,78,30,-36,96,96,-62,22,-96,-6,0,-60,-70,40,-62,8,-92,-62,90,-88,-78,86,-38,26,18,82,-96,-42,30},new int[]{-48,-20,-42,-34,76,64,2,4,6,8,56,-98,-50,-16,68,-12,78,-88,62,46,22,28,36,36,-46,78,-86,-78,-10,-98,-24,-48,-62,-26,-4,78,-84,-56,-48,-74,-2,72,-86,14},new int[]{-42,-74,54,-28,-16,94,40,44,-22,10,42,38,46,68,72,32,84,-6,-30,-54,-62,30,94,36,-18,-30,66,52,18,-24,-16,-60,-56,-2,-78,80,-60,20,-72,-24,-48,-86,-16,-12},new int[]{46,-38,-28,-72,80,-8,-28,28,-28,4,-84,56,-48,28,-54,34,84,28,-52,38,-34,20,84,-10,36,-60,54,-66,-8,-54,-44,-82,56,-78,-76,-94,24,30,30,-78,-22,-48,22,44},new int[]{-10,-84,66,60,40,-56,86,16,44,-50,-62,34,-44,30,-62,96,76,-98,-50,-50,36,-74,42,-82,44,-32,-48,58,22,82,82,94,-70,-92,-96,-78,-70,84,-44,-70,82,-92,-96,-50},new int[]{40,-86,66,64,98,86,18,20,54,-92,-26,56,-96,-28,16,52,42,36,-64,44,-96,-56,78,94,-54,24,-62,82,-36,-90,-40,50,-72,-54,80,12,-24,30,-48,2,-64,96,-66,94},new int[]{80,4,-82,-24,18,24,-78,-4,-14,38,-10,-70,-78,-26,6,46,78,16,-48,94,4,46,54,-84,-56,-76,-50,-30,-94,-58,-96,32,-2,-16,76,-94,54,-96,96,-18,80,60,-82,74},new int[]{12,-4,-66,54,82,24,-84,62,-58,-52,8,-74,-62,56,86,-82,30,86,46,78,94,24,44,2,62,-48,58,34,-74,-52,32,46,92,28,72,-36,-14,-98,68,-92,12,56,-40,-64},new int[]{-48,-98,52,-92,88,30,42,90,56,76,44,-58,-72,-28,-54,26,-36,-28,-54,64,22,2,-58,30,12,-92,40,46,54,-16,-74,-2,30,72,56,96,-86,76,-28,-26,76,32,-46,-22},new int[]{6,16,74,-22,-20,-12,50,50,16,50,58,-16,-76,68,66,36,-52,98,64,84,-50,88,-40,-22,-2,-94,48,70,46,-36,20,74,-10,20,-98,-26,-58,80,78,-66,-66,-28,46,-40}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1}}); param0.add(new int[][]{new int[]{73,62,15,20,30,7,64,47,16,52,55,87,49,78,88,59,29,62,70},new int[]{8,6,26,49,12,22,62,79,79,7,38,44,68,23,38,35,52,91,46},new int[]{48,26,67,1,45,46,37,11,25,35,79,3,10,87,65,22,99,20,7},new int[]{56,58,1,24,66,45,43,71,43,66,51,46,95,72,38,13,53,70,70},new int[]{91,38,39,29,88,50,81,47,29,64,26,76,37,24,1,30,70,93,99},new int[]{66,67,92,20,36,5,28,62,57,94,9,89,81,64,55,68,36,44,41},new int[]{85,37,47,87,73,77,56,49,73,35,94,62,26,95,59,96,77,71,21},new int[]{89,38,3,80,35,75,1,39,92,10,94,55,60,95,22,42,85,98,19},new int[]{52,99,43,54,60,70,15,4,25,58,45,28,5,9,40,41,53,63,35},new int[]{76,43,87,77,58,81,44,99,64,16,55,17,76,20,81,74,1,61,10},new int[]{14,44,60,78,72,24,31,26,86,50,77,35,64,87,57,13,79,7,51},new int[]{6,35,77,25,14,30,30,88,60,63,60,30,97,14,44,75,15,82,74},new int[]{16,3,1,29,70,16,42,45,86,16,77,93,69,19,20,93,14,62,84},new int[]{9,40,39,99,39,51,6,26,71,73,41,40,29,69,48,8,98,81,45},new int[]{52,50,89,89,99,72,84,49,86,70,48,34,35,25,79,21,47,68,99},new int[]{15,71,84,46,30,57,73,52,96,40,99,16,68,51,58,48,65,7,29},new int[]{55,2,13,73,91,76,24,80,39,2,34,62,90,81,96,67,31,37,34},new int[]{56,7,51,88,69,1,28,68,19,8,26,36,27,96,80,49,55,8,79},new int[]{74,90,52,48,12,13,9,94,61,8,7,49,53,79,99,71,81,18,55}}); param0.add(new int[][]{new int[]{-92,-78,-78,-52,-46,-42,-38,-24,-18,-6,2,8,14,20,58,80,84},new int[]{-86,-76,-66,-42,-26,-24,-18,-12,2,4,10,10,14,56,62,78,80},new int[]{-82,-76,-60,-40,-40,-34,-22,-8,0,10,16,24,56,64,68,80,92},new int[]{-86,-74,-72,-60,-58,-30,-12,-4,2,10,24,30,34,58,64,84,96},new int[]{-88,-88,-88,-84,-66,-48,-32,-32,-18,-18,-12,2,12,40,58,72,86},new int[]{-80,-70,-64,-50,-48,-44,-26,-24,-20,-16,-8,16,24,26,48,48,76},new int[]{-96,-94,-94,-66,-50,-46,-34,-34,-10,0,2,20,24,40,82,84,98},new int[]{-90,-78,-66,-34,-20,-10,-10,0,10,20,36,44,58,58,80,80,84},new int[]{-96,-92,-56,-46,-44,-20,16,20,24,28,34,40,42,48,60,78,90},new int[]{-98,-54,-46,-46,-44,-40,-34,-26,-24,-16,2,18,24,24,38,64,82},new int[]{-80,-68,-66,-56,-46,-28,-24,-22,-16,18,20,22,24,52,64,82,98},new int[]{-90,-46,-44,-32,-20,-16,12,28,32,52,54,66,70,70,72,86,88},new int[]{-98,-84,-78,-64,-58,-18,-8,4,38,42,46,46,56,62,62,86,90},new int[]{-98,-52,-52,-36,-8,-6,22,24,26,38,40,44,56,60,66,80,94},new int[]{-88,-80,-72,-58,-50,-22,-20,-10,-6,4,4,8,24,48,70,78,80},new int[]{-88,-70,-60,-58,-50,-42,-36,-24,-6,2,14,20,44,58,74,78,80},new int[]{-76,-50,-46,-40,-30,-24,-10,4,10,14,28,36,40,40,46,56,60}}); param0.add(new int[][]{new int[]{0,0,1,0,0,1},new int[]{1,1,1,0,0,0},new int[]{0,1,0,1,0,1},new int[]{1,0,1,1,0,0},new int[]{1,0,0,1,0,0},new int[]{1,1,0,1,0,1}}); param0.add(new int[][]{new int[]{6,13,16,17,27,30,43,43,44,49,55,60,66,68,74,75,77,84},new int[]{5,17,22,32,34,38,40,43,54,57,60,61,63,66,84,86,87,91},new int[]{4,4,14,19,27,29,29,34,34,44,46,51,53,59,64,77,80,82},new int[]{3,8,13,18,19,28,34,35,40,52,53,53,61,73,81,83,89,98},new int[]{1,5,11,19,25,34,35,37,41,50,71,74,74,76,87,95,97,99},new int[]{1,4,12,17,29,30,44,48,49,54,54,59,60,64,74,78,82,96},new int[]{6,15,16,17,17,23,26,28,36,37,40,47,48,51,52,56,81,94},new int[]{7,9,9,43,47,51,52,56,60,65,68,74,82,88,91,97,98,98},new int[]{1,4,10,17,18,24,31,45,51,51,56,65,68,70,73,77,94,95},new int[]{1,1,12,13,26,27,33,37,39,39,40,41,46,51,61,67,74,87},new int[]{4,6,14,15,16,17,20,22,23,45,55,56,79,80,85,85,98,99},new int[]{16,17,23,23,38,43,43,49,51,66,69,69,69,72,81,84,90,97},new int[]{18,23,25,26,26,29,35,37,45,59,67,73,73,76,79,80,81,85},new int[]{2,6,7,8,15,18,24,33,36,46,53,54,54,66,85,91,91,96},new int[]{2,9,17,23,28,28,35,36,39,48,67,69,74,75,80,85,89,96},new int[]{8,15,16,19,20,31,33,43,52,63,72,79,86,88,91,92,97,99},new int[]{4,5,10,14,34,37,41,44,45,49,72,74,81,84,85,93,96,99},new int[]{1,2,19,20,25,27,31,33,40,48,55,61,63,69,76,81,83,84}}); param0.add(new int[][]{new int[]{4,12,-60,-76},new int[]{-56,66,-84,68},new int[]{-8,14,44,-74},new int[]{54,50,78,0}}); param0.add(new int[][]{new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,0,0,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},new int[]{0,0,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},new int[]{0,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},new int[]{0,0,0,0,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},new int[]{0,0,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},new int[]{0,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},new int[]{0,0,0,0,0,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},new int[]{0,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},new int[]{0,0,0,0,0,0,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},new int[]{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,1},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,0,0,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},new int[]{0,0,0,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},new int[]{0,0,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},new int[]{0,0,0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,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},new int[]{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,1},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{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,1},new int[]{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,1},new int[]{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,1,1,1,1,1,1},new int[]{0,0,0,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},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},new int[]{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,1},new int[]{0,0,0,0,0,0,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},new int[]{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,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,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},new int[]{0,0,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},new int[]{0,0,0,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},new int[]{0,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},new int[]{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,1}}); param0.add(new int[][]{new int[]{52,7,95,62,93,89,91,56,59,16,68,28,66,67,28,60,62,73,99,50,82,60,6,98,1,16,98,77,24,53,93,41,57,64},new int[]{58,70,84,33,17,25,71,88,18,52,3,82,29,21,92,7,30,32,22,70,23,3,82,10,51,58,16,8,18,58,88,12,38,24},new int[]{54,57,1,87,51,44,43,24,90,50,11,30,50,76,32,99,28,10,31,90,34,90,96,39,7,22,87,72,49,31,41,71,37,64},new int[]{3,91,36,83,54,80,5,44,86,45,3,33,82,92,49,96,66,97,22,43,39,12,57,97,19,99,14,20,18,24,21,62,50,8},new int[]{84,52,2,31,27,92,11,4,45,39,71,95,86,19,93,93,78,35,49,66,63,57,92,20,42,19,42,71,3,58,8,30,46,36},new int[]{93,21,64,42,14,39,41,71,53,68,17,46,20,66,31,24,84,63,33,58,77,56,25,61,18,26,1,10,17,24,68,39,32,23},new int[]{39,54,68,4,79,78,80,94,47,18,88,9,5,24,15,19,75,50,92,23,95,90,45,21,75,70,54,12,91,15,19,73,95,20},new int[]{6,50,7,65,67,87,75,68,30,89,55,31,22,42,81,71,16,4,53,3,36,69,60,45,57,85,97,99,86,11,62,76,73,7},new int[]{90,92,37,24,45,10,86,79,95,62,61,70,52,84,32,62,51,31,84,58,69,85,96,74,78,11,5,73,22,89,95,86,96,1},new int[]{23,83,80,6,93,80,51,87,21,29,58,92,79,80,57,76,85,49,52,32,38,83,90,14,46,83,68,76,22,58,79,43,78,42},new int[]{3,51,5,9,20,68,89,22,21,39,84,36,23,70,93,33,38,76,43,3,87,9,33,50,52,91,42,76,80,82,96,10,16,98},new int[]{79,84,65,45,18,45,8,42,13,1,62,95,46,53,7,32,43,19,26,63,12,58,56,52,73,50,6,41,14,85,4,35,28,20},new int[]{81,20,82,93,57,57,3,8,93,17,80,34,23,21,71,46,52,77,76,62,67,70,12,99,71,1,4,21,70,56,60,19,79,92},new int[]{39,69,98,82,21,26,68,89,17,8,60,21,36,55,81,44,96,62,87,14,47,14,39,76,49,38,58,84,93,14,15,30,13,16},new int[]{92,70,11,57,19,22,3,39,96,86,46,55,19,40,16,37,50,75,63,50,49,95,89,38,47,8,78,15,64,57,5,8,32,54},new int[]{53,2,4,76,12,39,65,40,70,13,15,42,62,15,23,16,69,47,6,35,54,8,37,53,15,16,62,74,58,31,17,42,50,9},new int[]{55,92,37,74,80,67,21,31,51,10,73,43,54,26,57,40,40,39,67,64,71,4,36,33,85,86,35,97,2,56,25,94,89,29},new int[]{76,13,35,51,17,13,31,6,83,31,5,71,92,2,49,11,89,83,61,82,8,48,91,71,95,55,19,60,85,89,66,25,15,30},new int[]{54,94,58,73,99,27,74,6,89,46,3,16,70,44,6,30,37,50,92,17,79,77,82,69,19,57,95,39,10,13,79,50,20,96},new int[]{78,2,85,80,62,28,17,28,51,37,91,31,99,98,3,19,3,91,12,37,33,18,5,39,93,21,57,71,47,62,76,35,79,6},new int[]{1,90,92,4,33,68,68,31,76,18,81,20,50,97,17,8,38,80,85,56,36,76,20,57,20,5,56,61,2,14,22,8,86,14},new int[]{71,45,94,34,98,3,65,8,88,17,20,98,19,63,11,89,34,62,54,26,94,7,27,28,28,12,7,4,77,12,9,24,65,85},new int[]{70,14,10,88,9,7,56,53,18,17,22,82,79,89,26,52,39,74,21,57,70,71,78,67,27,37,65,90,73,28,78,31,94,91},new int[]{10,99,56,64,46,65,8,74,81,76,44,82,37,84,31,30,93,45,79,35,37,61,51,99,67,19,59,8,28,9,82,88,62,4},new int[]{37,6,2,45,24,60,77,78,78,25,73,25,46,56,99,26,2,59,50,86,18,32,3,82,45,96,88,90,53,91,72,52,20,24},new int[]{51,11,26,53,77,33,83,46,32,63,22,48,64,5,29,95,28,16,5,51,43,27,38,22,5,29,54,54,23,13,80,45,96,85},new int[]{26,54,77,95,90,59,70,7,96,65,33,29,88,79,15,74,52,36,74,56,63,4,42,8,98,55,24,60,68,99,18,86,46,92},new int[]{16,81,86,22,79,79,30,7,77,68,77,50,98,76,98,27,59,10,95,53,55,91,11,18,12,5,22,48,84,3,83,41,7,72},new int[]{62,72,56,90,49,13,25,29,85,47,6,30,59,30,74,55,98,86,75,7,50,34,92,71,28,27,73,76,96,92,67,78,73,36},new int[]{68,91,8,18,61,91,37,26,32,81,77,7,72,88,4,29,67,61,5,23,72,50,79,24,23,72,88,90,51,74,8,2,7,82},new int[]{75,25,11,60,42,36,10,26,11,97,13,77,14,25,39,48,22,39,70,85,42,47,79,96,45,15,10,79,6,93,50,67,66,99},new int[]{43,58,67,95,47,79,13,66,90,52,35,18,87,7,99,6,17,5,84,25,23,46,49,71,23,5,97,50,30,12,99,58,45,19},new int[]{66,54,34,82,61,60,61,18,71,81,67,2,10,90,31,66,54,27,82,58,69,16,30,78,62,66,30,79,86,98,49,43,46,74},new int[]{60,3,19,15,90,29,28,90,96,62,51,37,3,88,71,77,44,40,92,41,96,69,53,41,82,42,49,99,79,21,56,28,7,46}}); List<Integer> param1 = new ArrayList<>(); param1.add(41); param1.add(30); param1.add(10); param1.add(17); param1.add(8); param1.add(5); param1.add(10); param1.add(2); param1.add(19); param1.add(17); List<Integer> param2 = new ArrayList<>(); param2.add(32); param2.add(35); param2.add(9); param2.add(10); param2.add(10); param2.add(3); param2.add(13); param2.add(3); param2.add(18); param2.add(27); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
943
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ADD_1_TO_A_GIVEN_NUMBER_1.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 ADD_1_TO_A_GIVEN_NUMBER_1{ static int f_gold ( int x ) { return ( - ( ~ x ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(20); param0.add(68); param0.add(52); param0.add(61); param0.add(3); param0.add(88); param0.add(41); param0.add(78); param0.add(94); param0.add(18); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
944
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES.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{ static int f_gold ( int arr [ ] , int arr_size ) { int i ; for ( i = 0 ; i < arr_size ; i ++ ) { int count = 0 ; for ( int j = 0 ; j < arr_size ; j ++ ) { if ( arr [ i ] == arr [ j ] ) count ++ ; } if ( count % 2 != 0 ) return arr [ i ] ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,5,5,8,14,15,17,17,18,23,23,25,26,35,36,39,51,53,56,56,60,62,64,64,65,66,67,68,71,75,80,82,83,88,89,91,91,92,93,95,99}); param0.add(new int[]{-56,98,44,30,-88,18,60,86,4,16,10,64,-22,-86,-66,-16,70,-44,98,78,-96,-66,92,10,40,-16}); param0.add(new int[]{0,0,0,0,0,1,1,1}); param0.add(new int[]{36,11,83,41,42,14,46,89,91,96,57,42,74,73,9,26,79,40,31,69,44,39,14,92,34,20,52,47,14}); param0.add(new int[]{-84,-84,-84,-78,-66,-62,-62,-36,-24,-10,-10,-8,-4,-2,12,14,20,22,36,42,46,66,84,96,96,98}); param0.add(new int[]{1,1,0,1,0,1,1,0,1,1,0,1,0,1,0,1,0,0,1,1,1,0,1,1,1,1,1,1}); param0.add(new int[]{11,12,14,28,42,48,50,58,67,74,86,89,95}); param0.add(new int[]{52,-56,-6,74,10,68,74,10,16,-80,82,-32,6,-6,82,20}); param0.add(new int[]{0,0,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,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{4,80,92}); List<Integer> param1 = new ArrayList<>(); param1.add(31); param1.add(19); param1.add(6); param1.add(25); param1.add(23); param1.add(19); param1.add(7); param1.add(11); param1.add(31); param1.add(1); 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()); } }
945
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN.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_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN{ static double f_gold ( int a , int b ) { double AM , GM , HM ; AM = ( a + b ) / 2 ; GM = Math . sqrt ( a * b ) ; HM = ( GM * GM ) / AM ; return HM ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(54); param0.add(42); param0.add(63); param0.add(19); param0.add(41); param0.add(7); param0.add(39); param0.add(11); param0.add(96); param0.add(15); List<Integer> param1 = new ArrayList<>(); param1.add(83); param1.add(56); param1.add(12); param1.add(76); param1.add(50); param1.add(26); param1.add(42); param1.add(64); param1.add(81); param1.add(54); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
946
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_ARRAYS_CONSECUTIVE_ELEMENT_DIFFERENT_VALUES.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 COUNT_ARRAYS_CONSECUTIVE_ELEMENT_DIFFERENT_VALUES{ public static int f_gold ( int n , int k , int x ) { int [ ] dp = new int [ 109 ] ; dp [ 0 ] = 0 ; dp [ 1 ] = 1 ; for ( int i = 2 ; i < n ; i ++ ) dp [ i ] = ( k - 2 ) * dp [ i - 1 ] + ( k - 1 ) * dp [ i - 2 ] ; return ( x == 1 ? ( k - 1 ) * dp [ n - 2 ] : dp [ n - 1 ] ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(9); param0.add(97); param0.add(16); param0.add(16); param0.add(6); param0.add(58); param0.add(6); param0.add(22); param0.add(51); param0.add(58); List<Integer> param1 = new ArrayList<>(); param1.add(40); param1.add(47); param1.add(28); param1.add(82); param1.add(81); param1.add(10); param1.add(47); param1.add(4); param1.add(46); param1.add(25); List<Integer> param2 = new ArrayList<>(); param2.add(38); param2.add(30); param2.add(13); param2.add(70); param2.add(29); param2.add(55); param2.add(20); param2.add(64); param2.add(66); param2.add(53); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
947
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_TWO_LARGE_NUMBERS.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 SUM_TWO_LARGE_NUMBERS{ static String f_gold ( String str1 , String str2 ) { if ( str1 . length ( ) > str2 . length ( ) ) { String t = str1 ; str1 = str2 ; str2 = t ; } String str = "" ; int n1 = str1 . length ( ) , n2 = str2 . length ( ) ; str1 = new StringBuilder ( str1 ) . reverse ( ) . toString ( ) ; str2 = new StringBuilder ( str2 ) . reverse ( ) . toString ( ) ; int carry = 0 ; for ( int i = 0 ; i < n1 ; i ++ ) { int sum = ( ( int ) ( str1 . charAt ( i ) - '0' ) + ( int ) ( str2 . charAt ( i ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } for ( int i = n1 ; i < n2 ; i ++ ) { int sum = ( ( int ) ( str2 . charAt ( i ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } if ( carry > 0 ) str += ( char ) ( carry + '0' ) ; str = new StringBuilder ( str ) . reverse ( ) . toString ( ) ; return str ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("VkfzrPG"); param0.add("0526110506447"); param0.add("011010010"); param0.add("sPAwZACc "); param0.add("3"); param0.add("0101"); param0.add("VTtNu"); param0.add("2317170"); param0.add("111111000010"); param0.add("Ktt"); List<String> param1 = new ArrayList<>(); param1.add("rKZ"); param1.add("903"); param1.add("110100000"); param1.add("liYMsojPiinOV"); param1.add("611"); param1.add("01110101011"); param1.add("Wsmc"); param1.add("898421173423"); param1.add("01100001110111"); param1.add("CTbbVX wGBkE"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)).equals(f_gold(param0.get(i),param1.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
948
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBER_OF_SOLUTIONS_OF_X2_1_MOD_P_IN_GIVEN_RANGE.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 COUNT_NUMBER_OF_SOLUTIONS_OF_X2_1_MOD_P_IN_GIVEN_RANGE{ static int f_gold ( int n , int p ) { int ans = 0 ; for ( int x = 1 ; x < p ; x ++ ) { if ( ( x * x ) % p == 1 ) { int last = x + p * ( n / p ) ; if ( last > n ) last -= p ; ans += ( ( last - x ) / p + 1 ) ; } } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(94); param0.add(11); param0.add(88); param0.add(85); param0.add(74); param0.add(96); param0.add(49); param0.add(50); param0.add(21); param0.add(81); List<Integer> param1 = new ArrayList<>(); param1.add(36); param1.add(79); param1.add(63); param1.add(43); param1.add(89); param1.add(33); param1.add(51); param1.add(24); param1.add(26); param1.add(19); 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()); } }
949
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT.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 MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT{ public static int f_gold ( int grid [ ] [ ] , int n ) { int incl = Math . max ( grid [ 0 ] [ 0 ] , grid [ 1 ] [ 0 ] ) ; int excl = 0 , excl_new ; for ( int i = 1 ; i < n ; i ++ ) { excl_new = Math . max ( excl , incl ) ; incl = excl + Math . max ( grid [ 0 ] [ i ] , grid [ 1 ] [ i ] ) ; excl = excl_new ; } return Math . max ( excl , incl ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{6,10,23,28,35,55,91},new int[]{11,14,15,54,55,62,81},new int[]{18,26,40,43,47,89,93},new int[]{3,11,19,53,65,82,92},new int[]{14,32,43,44,51,77,83},new int[]{6,6,30,30,33,73,74},new int[]{2,2,10,61,70,81,84}}); param0.add(new int[][]{new int[]{-28,-20,-60,92,12,-66,20,-22,72,-90,30,90,-64,38,24,78,42,-72,-86,88,-66,-74,-52,26,-76,-64,-54,-56,-50,-12,-50,-58,-42,20},new int[]{-84,-90,32,4,-54,-96,72,70,-2,62,-20,22,-38,78,-86,-50,64,92,16,22,44,-72,-88,-54,58,72,-28,34,-10,-12,-82,38,-76,86},new int[]{30,94,12,-58,24,-58,82,-96,-84,-76,-56,-2,-82,-12,-24,86,-94,72,36,86,54,76,-96,-94,-70,76,0,-48,-84,6,-90,44,-8,-22},new int[]{-36,90,20,44,-66,-54,54,14,-12,58,-10,84,-4,88,-70,-24,-84,-8,58,-22,2,-32,-28,-60,-74,-12,-10,-6,-58,-54,-8,-94,72,86},new int[]{-20,88,28,76,78,52,0,-60,94,-22,-56,-8,66,-36,-48,-12,42,-84,22,-78,18,-68,46,36,50,-80,18,6,86,-18,-90,-94,54,60},new int[]{44,-44,-52,-24,32,24,-88,-62,-64,24,-24,76,-22,-60,76,12,10,-96,-68,98,-86,20,-40,-30,-22,-14,-68,-68,-52,-72,-68,-36,4,42},new int[]{78,74,-96,46,-36,-14,72,-64,-16,26,74,-82,82,96,-82,70,-66,-90,-72,64,-52,46,-38,70,98,26,-48,-66,-92,-86,-94,-18,90,-58},new int[]{20,56,-12,82,-24,-54,48,22,-58,-94,-4,-78,-74,-82,58,2,32,76,54,76,-54,-32,34,56,-48,22,30,86,-76,-90,20,2,4,10},new int[]{42,98,42,-6,78,92,-44,-14,80,14,48,94,46,-30,40,-64,36,66,40,94,36,94,-2,-92,70,-44,28,-86,44,98,-76,66,-16,-24},new int[]{-64,-44,28,-24,92,18,88,-36,72,0,38,42,46,-94,10,-62,-64,-40,4,44,-42,-66,-62,12,-72,-68,26,58,-64,90,-20,-74,46,28},new int[]{-2,42,94,-52,-46,-14,-80,-74,22,-56,8,-88,0,-58,82,-12,96,40,-86,-30,88,50,28,-40,16,16,-58,-18,-78,40,66,-6,-50,-36},new int[]{-46,-8,-76,-74,38,-76,-2,80,-30,-64,64,34,80,-14,-4,58,-48,30,56,2,98,-82,82,-36,38,14,24,92,-38,40,6,12,90,90},new int[]{-12,24,20,-22,-86,4,48,90,-10,-90,-36,56,-18,-72,-84,68,-18,48,-80,-84,62,4,4,54,-26,-28,-58,-12,-6,32,88,-62,58,-52},new int[]{54,76,2,-98,-64,64,2,-22,18,-78,-44,-78,6,92,-32,14,-98,-70,-52,-20,14,32,40,32,62,42,34,-52,2,52,64,12,44,-12},new int[]{22,-48,30,-98,-94,36,76,52,56,76,-40,-34,-58,-70,26,20,-6,92,90,30,2,-34,96,50,96,-82,-38,-42,54,-80,-82,-10,-94,64},new int[]{-46,-36,-84,54,-64,-48,60,70,78,20,-92,-34,88,-38,-34,40,-70,58,-22,-38,46,-36,28,-24,-16,70,6,-76,-30,58,4,84,92,80},new int[]{24,48,-54,-98,60,18,70,-6,62,-60,80,-66,78,-50,36,84,30,56,-56,56,-70,38,-70,26,-6,-32,86,72,-68,42,30,2,-86,72},new int[]{-84,-98,74,-36,78,-10,-84,26,76,38,-6,-26,76,26,18,44,-96,92,74,-36,34,64,98,84,68,-56,-98,-16,44,-84,68,-66,58,-4},new int[]{72,-68,94,76,-60,-40,-34,78,-8,-28,44,88,60,-20,58,-46,-10,48,-52,-38,-62,12,30,-96,-22,-76,-40,-20,-74,78,94,78,-64,44},new int[]{92,-76,8,8,66,70,-12,32,6,28,20,50,2,78,-98,98,94,82,-58,56,10,-94,26,26,-42,-66,16,-92,24,72,56,56,14,46},new int[]{32,-90,-64,-14,92,-18,-82,36,34,-58,-22,-8,88,76,30,-68,-44,88,66,74,-32,-54,-68,-18,92,60,-30,82,34,26,-60,82,32,54},new int[]{-88,56,76,82,-82,0,74,98,28,2,-26,56,80,44,-10,-38,44,-28,88,18,-68,6,90,-38,-30,-26,56,24,-22,12,78,30,26,-42},new int[]{84,86,48,-84,88,-40,-18,40,-70,10,76,54,-82,-60,-28,-2,-74,82,-64,14,-84,-16,-84,20,16,-52,-12,26,82,2,68,98,-84,76},new int[]{-20,52,-34,56,-58,-34,10,30,14,40,-72,84,-50,-22,-54,-14,12,-66,-38,4,-44,-86,-64,60,-88,32,-60,74,-96,-50,-88,-14,-42,-82},new int[]{46,-72,-10,-70,-8,60,-10,28,-12,-82,84,36,-76,72,-98,-12,-20,-92,-16,-34,68,98,-96,-80,44,-72,22,-46,54,54,8,-42,-84,76},new int[]{38,84,32,70,82,44,52,48,0,42,-18,-80,86,-50,-48,-48,40,72,-76,16,42,-48,-74,64,38,-38,-66,-70,96,-56,38,-68,-34,-18},new int[]{-92,94,84,50,26,38,-16,-18,-86,-52,-12,36,-76,10,-92,78,-94,62,-48,18,-82,-8,-74,-90,6,22,-90,52,84,48,-98,-30,-44,2},new int[]{32,-54,38,-34,90,58,30,86,-52,-82,26,-30,22,-68,44,44,-54,24,-12,18,62,82,86,26,-78,74,36,62,50,-84,80,-2,44,-84},new int[]{42,-32,-36,54,64,54,88,30,26,6,98,34,-40,18,-50,-34,-68,-2,-94,-42,-72,38,22,62,-42,-58,-88,-52,-44,14,14,62,-56,-52},new int[]{-64,-44,14,48,-98,-48,80,-34,10,46,-64,38,72,-80,-72,52,92,-22,-28,2,0,-70,18,-34,60,36,8,2,-94,80,-32,-16,-82,-72},new int[]{94,-90,84,-34,62,70,-86,-20,-30,42,-84,20,-16,90,-90,20,-90,76,72,-12,54,72,80,30,62,66,-96,14,0,4,-78,-40,-8,74},new int[]{-70,20,74,-76,82,-88,88,-90,-8,-24,-30,10,28,-88,-72,4,0,-66,-82,-20,90,-28,48,82,-2,4,38,62,-38,14,56,74,86,58},new int[]{-6,52,94,20,88,-56,-40,-36,68,-24,68,-96,90,28,0,10,-44,-94,18,-60,98,24,26,-62,-88,50,-10,40,64,24,56,-72,30,8},new int[]{62,20,56,-38,-10,48,94,38,60,-60,-4,-56,-20,62,0,0,-82,46,58,4,-8,56,46,-82,-34,14,-38,48,48,-22,38,64,6,94}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}}); param0.add(new int[][]{new int[]{45,7,63,28,82,79,40,94,89,61},new int[]{50,94,80,10,25,12,1,73,84,38},new int[]{82,93,37,59,12,37,96,12,56,39},new int[]{76,56,97,56,32,33,24,31,62,94},new int[]{90,2,52,81,1,52,95,93,75,4},new int[]{8,47,21,75,12,90,91,34,74,73},new int[]{77,76,81,68,64,28,41,84,71,72},new int[]{99,93,47,15,95,76,21,48,80,39},new int[]{32,6,88,96,18,56,74,93,9,13},new int[]{27,8,53,66,4,74,14,25,41,78}}); param0.add(new int[][]{new int[]{-90,-88,-58,-54,-26,-2,6,66},new int[]{-80,-78,-60,-4,-2,58,64,68},new int[]{-98,-78,-22,-6,28,82,86,92},new int[]{-84,-4,52,64,66,84,86,98},new int[]{-62,28,32,76,92,92,96,96},new int[]{-90,-54,-42,6,24,42,44,46},new int[]{-94,-80,-36,-20,-20,-10,24,86},new int[]{-78,-8,2,48,56,66,68,78}}); param0.add(new int[][]{new int[]{0,0,1,0,0,1,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,1,0,1,0,0,1,0,0},new int[]{1,1,0,1,1,0,1,1,0,0,1,0,1,0,0,1,0,0,0,1,1,0,1,1,1,1,0,1,0,0,1},new int[]{0,1,0,0,0,1,1,1,1,0,0,1,0,0,1,1,1,0,1,1,0,0,0,0,1,1,1,1,0,1,1},new int[]{1,1,1,0,1,1,0,0,1,0,0,0,1,0,1,1,0,1,1,0,0,1,1,0,1,0,1,1,1,0,1},new int[]{1,0,0,0,1,1,1,0,0,1,1,0,0,0,1,1,1,0,1,1,1,0,1,0,1,1,0,1,0,1,0},new int[]{1,1,1,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,0,1,0,1,1,1,1,0,0,1,0,0,1},new int[]{0,0,1,0,0,1,1,0,0,0,1,1,0,1,1,1,0,0,1,0,0,1,1,1,0,0,0,1,0,1,0},new int[]{1,1,0,1,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,1,0,0,1,0,0,0,1,0,0,0,1},new int[]{1,0,1,0,1,0,0,0,1,0,1,0,0,0,0,1,1,1,0,0,1,0,0,1,1,0,1,0,1,1,0},new int[]{0,1,1,1,0,1,0,1,0,0,0,0,0,1,1,0,0,1,0,0,0,0,1,0,1,1,1,1,1,0,1},new int[]{0,1,1,1,0,0,0,1,0,0,0,1,1,0,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0,1,1},new int[]{1,1,0,1,1,0,0,0,0,1,1,0,1,0,0,0,1,0,0,0,0,1,0,1,1,1,0,1,1,0,0},new int[]{0,1,1,0,1,1,0,0,1,0,0,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,1,1,1,0,0},new int[]{1,0,1,1,1,0,1,0,1,1,0,0,0,0,0,0,1,0,0,0,1,1,1,1,1,1,1,1,0,1,1},new int[]{0,1,0,1,1,1,1,1,0,1,1,0,1,0,0,0,0,0,1,0,1,0,1,0,0,0,0,1,0,1,0},new int[]{1,0,1,0,0,1,1,1,1,0,0,0,1,1,0,1,1,1,0,1,0,0,0,0,1,1,0,0,0,1,0},new int[]{1,1,0,1,0,0,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,1,1,1,0,0,0,1,0,0},new int[]{0,1,0,0,0,1,0,0,1,1,0,0,0,1,0,1,0,1,0,0,1,0,1,0,1,0,0,1,1,0,0},new int[]{0,0,1,1,0,1,0,0,1,1,1,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,0,1,1,0,1},new int[]{0,0,0,1,1,1,0,0,0,1,0,1,0,1,1,1,1,0,1,0,1,0,0,1,0,1,1,0,0,0,0},new int[]{1,0,1,1,0,0,0,1,1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,1,0,1,0,0,1,1,1},new int[]{1,0,0,1,0,0,0,1,1,0,0,1,0,0,1,0,1,0,0,0,0,0,1,1,0,0,1,0,1,0,1},new int[]{0,1,1,1,1,0,1,1,0,0,0,0,1,0,0,1,0,1,1,0,1,1,0,0,1,0,0,0,1,0,1},new int[]{0,1,1,0,0,0,1,0,0,1,0,1,1,1,0,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,1},new int[]{1,1,0,1,0,1,1,1,0,1,0,1,0,0,1,1,0,1,1,0,1,0,1,1,1,1,0,1,0,1,0},new int[]{1,0,0,1,1,1,1,1,1,0,1,1,0,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0},new int[]{1,1,0,1,0,1,1,1,0,1,1,1,1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0,1,0,1},new int[]{0,1,1,1,1,0,1,1,0,1,0,1,0,1,0,0,0,1,1,1,0,1,0,0,1,1,0,1,1,1,1},new int[]{1,0,1,0,0,0,1,1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,1,0,0,0,1,1,1},new int[]{0,1,1,1,0,0,0,0,1,0,0,0,0,1,1,0,0,1,1,1,0,0,0,0,1,0,0,1,0,0,0},new int[]{0,0,1,1,0,1,0,1,1,0,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1}}); param0.add(new int[][]{new int[]{13,31,35,45,73},new int[]{16,47,54,84,87},new int[]{8,48,50,64,81},new int[]{19,43,79,88,91},new int[]{38,47,53,57,69}}); param0.add(new int[][]{new int[]{-70,-46,18,-10,-88,-22,-68,2,-42,94,64,-98,-74,-88,-60,96,64,42,-26,60,56,56,-92,-72,30},new int[]{12,-34,44,82,94,88,-60,-88,-98,-82,10,-36,94,-64,-26,26,-62,94,-90,12,-76,30,40,62,-84},new int[]{-90,98,-44,58,20,84,76,80,44,98,60,42,-66,2,10,98,28,-38,18,42,2,34,-64,-46,62},new int[]{-36,50,52,-8,-28,52,-76,18,68,-16,34,-38,-90,68,-6,-16,-98,12,-78,-18,-28,-38,26,76,26},new int[]{-70,14,-96,-42,18,-18,72,-18,-78,90,68,-22,58,98,62,-92,-38,86,-40,22,38,86,-60,46,-72},new int[]{-12,-64,-2,62,62,16,40,-58,8,-16,-80,84,-10,10,-58,30,-18,36,4,-88,-50,30,-30,-94,-20},new int[]{28,76,74,80,38,-32,4,56,-52,-24,94,6,12,-66,94,-70,98,-72,22,30,-8,-72,-26,52,98},new int[]{-36,-96,94,-64,-68,78,80,-90,-68,60,-78,-84,34,6,20,60,-86,84,-96,98,-38,-78,50,30,22},new int[]{14,88,88,-34,-76,48,10,-14,36,94,90,90,-90,26,70,-64,64,-92,0,-60,6,-60,8,-44,54},new int[]{-30,-64,-34,-26,-82,-48,-98,-50,76,-40,-16,52,-70,68,82,86,32,-70,98,-80,14,-48,-32,-84,16},new int[]{30,-70,36,34,-16,-96,-62,-62,-8,66,68,-2,16,-26,32,-50,72,-32,72,52,-22,-76,-4,90,20},new int[]{92,-72,-48,84,-98,-80,74,-30,58,6,-10,-84,-96,-60,-18,-42,26,-96,-20,-18,-12,2,58,6,36},new int[]{-74,-44,-20,-58,58,24,-34,6,52,-40,36,-22,-78,82,64,56,-70,-2,-32,74,98,38,30,80,-80},new int[]{58,92,-16,76,-28,-10,60,-80,96,-72,38,-64,8,-84,90,20,64,-74,-78,-94,-68,44,62,14,-74},new int[]{-2,-30,-10,-84,66,-16,58,26,42,-98,18,54,22,-2,-62,10,14,26,32,-56,-84,-14,-50,-48,52},new int[]{-94,-58,38,-76,-46,-98,-14,34,8,8,4,26,48,-74,-62,90,54,88,56,16,-36,-2,-72,-8,84},new int[]{22,-60,-50,50,22,-46,-42,38,74,-2,-66,-94,38,12,8,-84,10,94,56,-16,-38,-84,30,-90,-90},new int[]{-32,-98,24,-80,-24,56,-84,-50,86,0,22,-26,70,-38,-16,-52,70,34,92,24,-88,42,2,-70,-32},new int[]{28,-8,52,64,-50,-24,24,32,70,-54,-34,24,-46,22,-42,-6,-24,62,44,22,-58,-54,16,4,-64},new int[]{-12,44,4,24,76,-82,86,50,-10,-28,44,36,-8,76,-2,-96,52,52,-48,66,80,76,26,-16,20},new int[]{18,-50,-68,30,-36,-4,14,-52,-32,0,68,74,84,4,64,92,24,12,-8,-22,-22,14,-44,-26,80},new int[]{82,26,-46,-10,62,-70,-74,72,-14,98,8,-54,30,26,44,38,-22,24,98,8,56,-96,-94,-62,48},new int[]{32,-10,-72,66,-86,-94,-98,4,22,-54,-74,22,-24,-12,-80,98,-38,-34,-52,-74,96,-62,68,24,34},new int[]{66,-6,-38,-62,-16,82,-78,-20,50,62,96,46,-22,74,-84,54,-32,-16,62,-4,-70,-38,-6,-4,-94},new int[]{-10,0,-30,-28,38,-48,80,4,-52,-88,42,4,-44,-10,56,-22,70,-78,52,0,-32,-30,42,-54,-98}}); param0.add(new int[][]{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},new int[]{0,0,0,0,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},new int[]{0,0,0,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},new int[]{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,1,1,1},new int[]{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},new int[]{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},new int[]{0,0,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},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},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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,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},new int[]{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},new int[]{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,1,1},new int[]{0,0,0,0,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},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},new int[]{0,0,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},new int[]{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},new int[]{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},new int[]{0,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},new int[]{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},new int[]{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},new int[]{0,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},new int[]{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},new int[]{0,0,0,0,0,0,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},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},new int[]{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},new int[]{0,0,0,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},new int[]{0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,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},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},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}}); param0.add(new int[][]{new int[]{65,68,77,53,21,82,84,4,96,27,89,71,45,94,87,29,57,21,97,82,27,78,40,31,8,67,35,75,98,87,69,30,37,16,14},new int[]{71,97,2,46,5,45,45,60,15,42,2,88,29,93,85,25,22,83,62,13,62,38,57,33,33,56,12,87,93,29,43,60,65,24,69},new int[]{57,35,45,69,13,32,55,27,88,3,1,63,93,45,86,69,43,85,12,92,75,15,38,62,35,16,64,15,96,64,58,80,97,40,57},new int[]{20,37,32,74,16,5,20,56,91,43,60,50,59,84,13,19,79,38,27,81,74,36,5,51,48,27,59,54,28,68,71,8,15,29,73},new int[]{20,65,7,34,10,48,70,25,76,41,78,11,12,83,42,92,53,83,29,45,99,23,60,80,60,21,59,40,1,25,16,33,89,22,67},new int[]{67,75,43,52,63,5,25,38,53,16,96,93,70,86,73,10,55,14,84,69,71,54,56,78,57,15,81,84,16,21,75,68,25,66,66},new int[]{91,95,47,72,72,5,22,69,40,48,70,38,71,18,25,67,89,21,95,49,42,80,52,64,86,93,76,46,43,63,1,26,74,25,89},new int[]{4,82,60,43,72,7,17,6,42,44,21,2,13,32,77,29,5,90,96,82,17,84,15,60,79,68,73,44,33,10,47,1,40,73,22},new int[]{26,35,33,10,61,38,19,68,83,7,12,91,32,27,57,85,54,69,83,7,78,73,37,50,9,5,54,48,9,52,30,78,60,3,52},new int[]{24,28,39,55,75,81,82,81,25,14,85,11,47,27,4,51,34,40,71,18,19,82,15,75,12,35,36,12,16,92,44,44,36,59,30},new int[]{16,80,84,9,46,5,95,18,44,86,39,66,58,67,47,92,75,74,84,95,53,51,45,48,22,82,12,79,55,98,45,92,63,64,44},new int[]{15,99,17,75,61,26,29,89,4,27,42,86,24,19,41,91,83,13,95,66,91,64,72,12,29,29,86,30,73,69,13,2,33,4,56},new int[]{74,57,97,2,63,12,16,60,99,56,73,3,92,52,16,83,75,46,31,1,55,30,85,79,16,68,88,40,87,17,99,26,35,79,15},new int[]{27,72,15,72,4,65,25,99,8,49,17,28,70,6,55,1,67,52,73,79,40,84,16,74,78,16,15,41,90,10,60,12,37,14,25},new int[]{94,53,30,59,63,99,79,95,18,71,67,5,89,16,79,84,41,60,86,35,27,12,33,24,26,98,13,92,20,72,50,80,34,96,30},new int[]{99,16,48,9,54,31,19,34,62,80,88,16,79,31,52,56,71,44,15,66,86,24,89,61,12,14,34,20,63,78,82,35,63,81,48},new int[]{45,87,86,49,31,29,25,96,95,6,37,17,31,58,21,2,7,91,22,4,91,45,96,85,99,73,92,10,87,24,57,4,81,48,88},new int[]{58,1,66,40,48,53,6,14,62,36,21,25,54,72,27,78,4,8,91,83,94,92,91,61,37,44,3,49,28,83,91,87,83,57,13},new int[]{94,41,72,29,43,50,50,47,70,56,17,29,56,52,48,2,33,59,39,55,35,31,76,31,26,96,49,60,50,60,3,20,56,47,2},new int[]{63,77,93,63,51,70,42,8,26,54,74,38,56,65,66,43,64,35,65,68,3,88,55,81,27,25,59,84,39,54,51,30,70,71,27},new int[]{5,26,36,11,56,23,3,79,58,44,89,80,96,26,69,10,75,97,92,57,80,44,2,29,2,86,75,35,96,64,5,91,51,76,8},new int[]{3,96,22,63,28,90,45,21,75,27,7,73,47,48,98,43,26,70,76,37,50,44,1,35,68,40,50,72,66,12,72,41,60,31,85},new int[]{95,32,20,83,47,94,73,84,18,77,60,30,29,52,51,30,69,68,50,59,31,42,33,65,19,15,66,68,3,87,60,43,53,70,94},new int[]{23,49,15,47,81,9,66,50,53,93,42,46,95,96,58,1,94,92,90,82,1,41,48,83,99,33,72,91,42,8,58,96,83,30,60},new int[]{10,64,36,16,3,86,86,85,94,27,66,72,43,23,39,38,36,14,95,57,47,51,19,30,16,76,64,60,88,42,38,61,96,50,19},new int[]{40,47,62,69,46,63,47,2,51,96,91,2,37,37,57,22,98,64,91,81,39,87,74,22,15,61,60,50,61,62,40,36,39,16,56},new int[]{28,35,32,52,47,88,63,21,83,32,34,52,82,11,75,82,1,40,1,24,41,86,71,81,49,12,65,67,94,87,59,72,17,6,60},new int[]{56,12,21,75,66,20,64,20,95,36,62,24,86,9,58,49,81,98,53,11,6,59,51,49,87,47,45,49,40,90,9,8,49,52,26},new int[]{12,97,64,71,80,26,89,35,93,50,92,16,83,40,6,91,67,98,17,32,24,99,35,96,53,15,37,25,85,78,23,55,7,5,78},new int[]{83,71,72,68,6,10,50,14,13,71,21,97,11,6,36,75,55,34,94,73,71,46,37,60,18,49,93,85,14,16,26,95,51,75,96},new int[]{90,63,33,60,37,11,20,77,34,60,97,58,43,68,54,72,60,11,66,22,4,42,89,52,44,15,76,97,32,70,1,20,69,37,51},new int[]{2,78,17,50,82,17,31,56,31,36,19,61,32,81,88,4,69,47,41,1,90,42,67,23,13,86,95,61,72,30,46,76,86,43,15},new int[]{30,60,24,25,53,58,2,65,84,45,44,26,8,83,31,79,52,2,66,50,93,97,10,46,58,85,85,13,51,80,83,88,58,62,23},new int[]{4,31,8,25,54,87,11,92,45,87,45,60,64,43,64,47,61,98,48,75,8,34,8,52,81,86,8,62,65,14,69,91,48,87,12},new int[]{64,30,8,66,69,77,81,35,79,12,99,67,10,2,15,63,7,20,60,8,90,58,8,30,84,54,54,95,29,53,94,31,4,29,44}}); List<Integer> param1 = new ArrayList<>(); param1.add(3); param1.add(33); param1.add(9); param1.add(6); param1.add(6); param1.add(27); param1.add(2); param1.add(15); param1.add(21); param1.add(28); 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()); } }
950
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1.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 SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1{ static long f_gold ( int n ) { long sum = 0 ; sum = 1 << n ; return ( sum - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(53); param0.add(3); param0.add(28); param0.add(44); param0.add(84); param0.add(83); param0.add(46); param0.add(3); param0.add(16); param0.add(89); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
951
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1.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; class FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1{ static void f_gold ( char s1 [ ] , char s2 [ ] , int index ) { s2 [ index ] = s1 [ index ] ; if ( index == s1 . length - 1 ) { return ; } f_gold ( s1 , s2 , index + 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<char [ ]> param0 = new ArrayList<>(); param0.add(new char[]{'v'}); param0.add(new char[]{'6','8','3','3','5','2','5','6','9','9','2','6','2','1','9','3','7'}); param0.add(new char[]{'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','1','1'}); param0.add(new char[]{'e','G','a','r','F','U','W','k','u','z','y','v','A','W','m','G','H','O','I','a','u','V','f','B','q','e','E','e','L','c',' ','w','K',' ','K','j','j','s','q','u','n','i','T','a','Y'}); param0.add(new char[]{'0','0','0','0','1','1','1','2','2','2','2','2','2','3','3','3','3','4','4','4','4','5','5','6','6','6','7','7','7','7','7','7','8','8','9','9','9','9'}); param0.add(new char[]{'1','0','0','1','0','1','1','1','0','0','0','1','0','0','0','1','1','0','0','0','0','1','1'}); param0.add(new char[]{' ','B','D','D','D','E','E','E','G','H','J','K','K','K','L','N','O','S','V','W','Y','Z','b','c','d','d','f','f','f','f','f','f','i','k','k','o','t','u','v','x','x','z'}); param0.add(new char[]{'4'}); param0.add(new char[]{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1'}); param0.add(new char[]{'D','I','u','K','e','s','n','z','d','y','S','P','y','r'}); List<char [ ]> param1 = new ArrayList<>(); param1.add(new char[]{'Z'}); param1.add(new char[]{'8','6','0','2','8','0','8','7','0','5','4','5','9','4','5','4','4'}); param1.add(new char[]{'0','0','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'}); param1.add(new char[]{'S','m','d','a','W','N','F','H','B','E','h','M','z','H','c','X','l','a','R','e','D','D','q','V','U','w','o','K','u','n','b','k','Y','M','L','H','L','X','H','r','D','o','A','Y','H'}); param1.add(new char[]{'0','0','0','0','0','1','1','1','2','2','2','3','3','4','4','4','5','5','5','5','6','6','7','7','7','7','7','8','8','8','8','9','9','9','9','9','9','9'}); param1.add(new char[]{'1','1','0','0','0','1','0','1','1','0','0','0','1','0','1','0','1','1','0','1','1','0','1'}); param1.add(new char[]{'G','G','J','K','L','N','Q','R','R','S','U','W','X','Y','Y','a','b','b','b','c','d','e','e','f','f','h','j','j','k','k','l','m','m','n','o','s','t','t','w','z','z','z'}); param1.add(new char[]{'8'}); param1.add(new char[]{'0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'}); param1.add(new char[]{'N','h','M','N','n','F','Y','L','G','w','o','G','y','q'}); List<Integer> param2 = new ArrayList<>(); param2.add(0); param2.add(11); param2.add(34); param2.add(41); param2.add(33); param2.add(13); param2.add(40); param2.add(0); param2.add(12); param2.add(7); List<char [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new char[]{'v'}); filled_function_param0.add(new char[]{'6','8','3','3','5','2','5','6','9','9','2','6','2','1','9','3','7'}); filled_function_param0.add(new char[]{'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','1','1'}); filled_function_param0.add(new char[]{'e','G','a','r','F','U','W','k','u','z','y','v','A','W','m','G','H','O','I','a','u','V','f','B','q','e','E','e','L','c',' ','w','K',' ','K','j','j','s','q','u','n','i','T','a','Y'}); filled_function_param0.add(new char[]{'0','0','0','0','1','1','1','2','2','2','2','2','2','3','3','3','3','4','4','4','4','5','5','6','6','6','7','7','7','7','7','7','8','8','9','9','9','9'}); filled_function_param0.add(new char[]{'1','0','0','1','0','1','1','1','0','0','0','1','0','0','0','1','1','0','0','0','0','1','1'}); filled_function_param0.add(new char[]{' ','B','D','D','D','E','E','E','G','H','J','K','K','K','L','N','O','S','V','W','Y','Z','b','c','d','d','f','f','f','f','f','f','i','k','k','o','t','u','v','x','x','z'}); filled_function_param0.add(new char[]{'4'}); filled_function_param0.add(new char[]{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1'}); filled_function_param0.add(new char[]{'D','I','u','K','e','s','n','z','d','y','S','P','y','r'}); List<char [ ]> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(new char[]{'Z'}); filled_function_param1.add(new char[]{'8','6','0','2','8','0','8','7','0','5','4','5','9','4','5','4','4'}); filled_function_param1.add(new char[]{'0','0','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'}); filled_function_param1.add(new char[]{'S','m','d','a','W','N','F','H','B','E','h','M','z','H','c','X','l','a','R','e','D','D','q','V','U','w','o','K','u','n','b','k','Y','M','L','H','L','X','H','r','D','o','A','Y','H'}); filled_function_param1.add(new char[]{'0','0','0','0','0','1','1','1','2','2','2','3','3','4','4','4','5','5','5','5','6','6','7','7','7','7','7','8','8','8','8','9','9','9','9','9','9','9'}); filled_function_param1.add(new char[]{'1','1','0','0','0','1','0','1','1','0','0','0','1','0','1','0','1','1','0','1','1','0','1'}); filled_function_param1.add(new char[]{'G','G','J','K','L','N','Q','R','R','S','U','W','X','Y','Y','a','b','b','b','c','d','e','e','f','f','h','j','j','k','k','l','m','m','n','o','s','t','t','w','z','z','z'}); filled_function_param1.add(new char[]{'8'}); filled_function_param1.add(new char[]{'0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'}); filled_function_param1.add(new char[]{'N','h','M','N','n','F','Y','L','G','w','o','G','y','q'}); List<Integer> filled_function_param2 = new ArrayList<>(); filled_function_param2.add(0); filled_function_param2.add(11); filled_function_param2.add(34); filled_function_param2.add(41); filled_function_param2.add(33); filled_function_param2.add(13); filled_function_param2.add(40); filled_function_param2.add(0); filled_function_param2.add(12); filled_function_param2.add(7); for(int i = 0; i < param0.size(); ++i) { f_filled(filled_function_param0.get(i),filled_function_param1.get(i),filled_function_param2.get(i)); f_gold(param0.get(i),param1.get(i),param2.get(i)); if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && Arrays.equals(param1.get(i), filled_function_param1.get(i)) && param2.get(i) == filled_function_param2.get(i)) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
952
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_FOR_FACTORIAL_OF_A_NUMBER.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 PROGRAM_FOR_FACTORIAL_OF_A_NUMBER{ static int f_gold ( int n ) { if ( n == 0 ) return 1 ; return n * f_gold ( n - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(79); param0.add(95); param0.add(84); param0.add(12); param0.add(72); param0.add(67); param0.add(82); param0.add(14); param0.add(2); param0.add(69); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
953
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBERS_THAT_DONT_CONTAIN_3.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 COUNT_NUMBERS_THAT_DONT_CONTAIN_3{ static int f_gold ( int n ) { if ( n < 3 ) return n ; if ( n >= 3 && n < 10 ) return n - 1 ; int po = 1 ; while ( n / po > 9 ) po = po * 10 ; int msd = n / po ; if ( msd != 3 ) return f_gold ( msd ) * f_gold ( po - 1 ) + f_gold ( msd ) + f_gold ( n % po ) ; else return f_gold ( msd * po - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(85); param0.add(86); param0.add(3); param0.add(35); param0.add(59); param0.add(38); param0.add(33); param0.add(15); param0.add(75); param0.add(74); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
954
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_DISTINCT_SUBSET_SUBSEQUENCE_SUMS_ARRAY.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_DISTINCT_SUBSET_SUBSEQUENCE_SUMS_ARRAY{ static void f_gold ( int arr [ ] , int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += arr [ i ] ; boolean [ ] [ ] dp = new boolean [ n + 1 ] [ sum + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) dp [ i ] [ 0 ] = true ; for ( int i = 1 ; i <= n ; i ++ ) { dp [ i ] [ arr [ i - 1 ] ] = true ; for ( int j = 1 ; j <= sum ; j ++ ) { if ( dp [ i - 1 ] [ j ] == true ) { dp [ i ] [ j ] = true ; dp [ i ] [ j + arr [ i - 1 ] ] = true ; } } } for ( int j = 0 ; j <= sum ; j ++ ) if ( dp [ n ] [ j ] == true ) System . out . print ( j + " " ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{39,74,36,22,28,82,86,13,47,49,86,85,42,47,56,43,43,19,6}); param0.add(new int[]{69,56,34,64,68,36,95,7,13,38,3,30,74,35,97,84,10,75,22,31,32,36,61,32,98,19}); param0.add(new int[]{79,87,58,4,3,47,95,27,89,52,75,6,84,42,68,48,64,21,65,26,53,45}); param0.add(new int[]{36,20,68,93,75,14,45,39,46,72,74,1,34}); param0.add(new int[]{96,31,82,84,17,89,69,47,79,13,83,45,10,77,9,72,83,39,84,44,36,62,77,61,28,22,46,24,98,37,15}); param0.add(new int[]{69,6,41,35,93,24,68,7,66,34,73,78,98,75,10,62,72,22,15,51,57,86,82,99,17,48,19,59,67,36,82,93,14,59,72,9,59,67,26,93}); param0.add(new int[]{4,59,33,66,41}); param0.add(new int[]{50,7,67,14,85,74,99,79,14,33,17,77,53,18,6,35,82,14,58,96,22}); param0.add(new int[]{14,36,36,46,69,11,55,41,49,49,31,19,8,26,63,30,27,83,80,35,53,47,38,58,51,31,95,77,47,41,49,14,20,76,64,34,24,90,78,25,26,64,3}); param0.add(new int[]{84,49,15,7,28,82,35,74,10,20,6,5,67,60,64,88,75,54,57,11,49,1,85,46,22,16,17,58,2,12,55,49,8,52,37,7,76,91,72,92,75,8,88,20,9}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(22); param1.add(19); param1.add(7); param1.add(28); param1.add(27); param1.add(3); param1.add(17); param1.add(26); param1.add(23); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{39,74,36,22,28,82,86,13,47,49,86,85,42,47,56,43,43,19,6}); filled_function_param0.add(new int[]{69,56,34,64,68,36,95,7,13,38,3,30,74,35,97,84,10,75,22,31,32,36,61,32,98,19}); filled_function_param0.add(new int[]{79,87,58,4,3,47,95,27,89,52,75,6,84,42,68,48,64,21,65,26,53,45}); filled_function_param0.add(new int[]{36,20,68,93,75,14,45,39,46,72,74,1,34}); filled_function_param0.add(new int[]{96,31,82,84,17,89,69,47,79,13,83,45,10,77,9,72,83,39,84,44,36,62,77,61,28,22,46,24,98,37,15}); filled_function_param0.add(new int[]{69,6,41,35,93,24,68,7,66,34,73,78,98,75,10,62,72,22,15,51,57,86,82,99,17,48,19,59,67,36,82,93,14,59,72,9,59,67,26,93}); filled_function_param0.add(new int[]{4,59,33,66,41}); filled_function_param0.add(new int[]{50,7,67,14,85,74,99,79,14,33,17,77,53,18,6,35,82,14,58,96,22}); filled_function_param0.add(new int[]{14,36,36,46,69,11,55,41,49,49,31,19,8,26,63,30,27,83,80,35,53,47,38,58,51,31,95,77,47,41,49,14,20,76,64,34,24,90,78,25,26,64,3}); filled_function_param0.add(new int[]{84,49,15,7,28,82,35,74,10,20,6,5,67,60,64,88,75,54,57,11,49,1,85,46,22,16,17,58,2,12,55,49,8,52,37,7,76,91,72,92,75,8,88,20,9}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(10); filled_function_param1.add(22); filled_function_param1.add(19); filled_function_param1.add(7); filled_function_param1.add(28); filled_function_param1.add(27); filled_function_param1.add(3); filled_function_param1.add(17); filled_function_param1.add(26); filled_function_param1.add(23); for(int i = 0; i < param0.size(); ++i) { f_filled(filled_function_param0.get(i),filled_function_param1.get(i)); f_gold(param0.get(i),param1.get(i)); if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i)) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
955
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1.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_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1{ static int f_gold ( int arr1 [ ] , int arr2 [ ] , int n ) { int index = n ; int left = 0 , right = n - 1 ; while ( left <= right ) { int mid = ( left + right ) / 2 ; if ( arr2 [ mid ] == arr1 [ mid ] ) left = mid + 1 ; else { index = mid ; right = mid - 1 ; } } return index ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,18,19,25,26,27,31,39,44,46,59,60,66,72,78,83,84,92,94}); param0.add(new int[]{-14,-56,92,-90,96,-84,64,-38,-20,84,56,92,18,-78,98,-96,-60,88,-52,-28,30,-90,14,76,56,20,-18,-94,-82,-2,96,-60,-64,-90,42,6,20,-38,82,-86,-4,82,54,-88}); param0.add(new int[]{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,1,1,1,1}); param0.add(new int[]{13,64,73,50,73,19,92,10,64,79,58,41,97,53,53,10,96,45,47,38,99}); param0.add(new int[]{-96,-94,-90,-90,-78,-70,-64,-64,-58,-58,-52,-40,-36,-34,-34,-30,-26,-2,0,2,14,18,24,28,28,30,34,40,42,48,66,72,86,90,92,98}); param0.add(new int[]{1,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,1,1,0}); param0.add(new int[]{10,51,74,74,75,80,90}); param0.add(new int[]{-44,48,20,-38,-48,-26,56,-62,-94,-18,30,66,-16,80,96,-40,-80,32,88,-56,-76,16,72,-94,4,-34,-92,70,-90,-54,64,-90}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{19,53,13,91,52,62,39,84,68,45,32,40,13,68,79,76,11,42,76,30,81,3,30,15,85,76,1}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{2,5,12,13,17,20,22,46,51,63,64,66,66,76,87,87,90,91,96}); param1.add(new int[]{54,44,-50,26,4,-26,-76,98,-14,36,82,0,-60,18,52,82,-12,-8,-26,-58,22,-70,24,48,56,-46,92,98,-50,-72,-66,8,40,12,-80,-86,90,-30,76,-92,80,-62,0,-48}); param1.add(new int[]{0,0,0,0,0,0,0,0,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}); param1.add(new int[]{24,42,54,13,88,63,50,73,64,66,86,84,53,4,44,58,44,42,36,94,34}); param1.add(new int[]{-94,-92,-90,-88,-86,-82,-82,-80,-76,-74,-64,-60,-58,-46,-44,-36,-30,-30,-30,-18,-16,-8,-6,12,14,20,26,38,40,42,42,68,78,82,88,98}); param1.add(new int[]{0,0,1,1,0,0,1,0,1,1,0,1,0,1,1,1,1,1,1,1,0}); param1.add(new int[]{12,20,36,38,61,64,93}); param1.add(new int[]{-76,92,-66,20,86,40,64,16,54,-6,54,-88,-24,38,86,2,30,70,98,-46,28,34,40,-88,-96,92,22,14,-36,-96,-48,-72}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{33,65,36,82,30,95,42,33,9,21,25,90,54,59,21,45,3,93,67,50,97,72,77,54,75,8,6}); List<Integer> param2 = new ArrayList<>(); param2.add(11); param2.add(26); param2.add(31); param2.add(13); param2.add(29); param2.add(19); param2.add(5); param2.add(28); param2.add(14); param2.add(25); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
956
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1.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 PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1{ static boolean f_gold ( int arr [ ] , int n , int x ) { HashSet < Integer > hset = new HashSet < > ( ) ; if ( n < 2 ) return false ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 0 ) { if ( x == 0 ) return true ; else continue ; } if ( x % arr [ i ] == 0 ) { if ( hset . contains ( x / arr [ i ] ) ) return true ; hset . add ( arr [ i ] ) ; } } return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,2,3,7,23,23,25,27,37,42,53,56,58,61,69,78,79,84,85,86,90,93,95}); param0.add(new int[]{-10,-18,88,-36,78,66,-70,-34,-88,-98,-70,-4,-94,-92,-76,-78,-30,-48,-72,86,-64,38,-80,20,70,-32,-90,74,-78,12,-54,88,38,-96,28}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1}); param0.add(new int[]{83,61,55,89,16,78,44,54,22,49,58,62,53,99,35,83,29,19,96,39,60,6,34,67,43,29,46,3,81,78,80,39,86,78,21}); param0.add(new int[]{-96,-88,-80,-62,-58,-56,-54,-52,-34,-20,-6,-2,6,20,52,54,70,72,80,82,94}); param0.add(new int[]{0,1,1,0,0,1,1,1}); param0.add(new int[]{8,11,11,20,22,23,26,27,31,38,40,40,45,46,46,48,50,61,73,76,78,78,79,80,81,84,90,91,93,95}); param0.add(new int[]{18}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,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}); param0.add(new int[]{19,37,47,40,72,59,51,53,92,3,21,81,29,48,97,59,10,74,11,37,49,95,88,85,6,26,76,33}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(17); param1.add(9); param1.add(23); param1.add(18); param1.add(4); param1.add(24); param1.add(0); param1.add(37); param1.add(22); List<Integer> param2 = new ArrayList<>(); param2.add(17); param2.add(22); param2.add(5); param2.add(27); param2.add(12); param2.add(6); param2.add(28); param2.add(0); param2.add(39); param2.add(21); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
957
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MINIMUM_DIFFERENCE_PAIR_1.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_MINIMUM_DIFFERENCE_PAIR_1{ static int f_gold ( int [ ] arr , int n ) { Arrays . sort ( arr ) ; int diff = Integer . MAX_VALUE ; for ( int i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i + 1 ] - arr [ i ] < diff ) diff = arr [ i + 1 ] - arr [ i ] ; return diff ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,25,44,46,54,60,81}); param0.add(new int[]{82,68,-98,-66,-36,-42,98,-38,58,-6,-28,70,-24,18,16,10,92,44,28,-96,-72,24,28,-80,-4,38,88,76}); param0.add(new int[]{1,1,1}); param0.add(new int[]{87,25,80,45,44,20,48,47,51,54,68,47,89,95,15,29,5,45,2,64,53,96,94,22,23,43,61,75,74,50}); param0.add(new int[]{-74,-48,-42,-26,-16,-12,0,4,8,18,46,46,62,70,74,88,92,96,98}); param0.add(new int[]{0,1,1,1,0,1,1,0,0,1,1,1,0,0,1,1,0,1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0}); param0.add(new int[]{27,42,59,80}); param0.add(new int[]{-96,-94,10,-36,18,-40}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{96}); List<Integer> param1 = new ArrayList<>(); param1.add(3); param1.add(22); param1.add(2); param1.add(15); param1.add(18); param1.add(36); param1.add(2); param1.add(4); param1.add(12); param1.add(0); 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()); } }
958
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY.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_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { if ( n < 3 ) return - 1 ; int max_product = Integer . MIN_VALUE ; for ( int i = 0 ; i < n - 2 ; i ++ ) for ( int j = i + 1 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ; return max_product ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{41,66,77}); param0.add(new int[]{92,-34,-36,-50,20,-94,2,-86,22,-50,74,84,52,-84,98,-50,88,26,-36,-36,6,-50,-48,-84,38,-96,-62,34,52,92,40,-84,18,-90,54,-38,-74,-98,-8,-92,-60,86,-36,94,56}); param0.add(new int[]{0,0,1}); param0.add(new int[]{2,77,99,95,78,15,69,39,34,43,66,45,97,27,67,62,64,2,28,94,41,87,97,52,14,61,78,50}); param0.add(new int[]{-62,-28,40,76}); param0.add(new int[]{0,1,1,0,1,1,1,1,1}); param0.add(new int[]{2,6,10,11,12,12,17,18,18,19,20,22,24,25,30,35,36,37,40,41,42,47,60,60,64,69,69,70,73,79,80,83,97,97,97}); param0.add(new int[]{-72,98,68,18,92,-84,50,32,-90,-40,50,60,-50,-50,50,24,30,94,-98,-6,46,-46,-24,-62,-20,62,-76}); param0.add(new int[]{0,0,0,0,0,1,1,1}); param0.add(new int[]{85,36,7,69,9,45,18,47,1,78,72,53,37,20,95,71,58,41}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(40); param1.add(1); param1.add(26); param1.add(3); param1.add(5); param1.add(25); param1.add(14); param1.add(7); param1.add(14); 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()); } }
959
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SET_BITS_IN_AN_INTEGER_1.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 COUNT_SET_BITS_IN_AN_INTEGER_1{ public static int f_gold ( int n ) { if ( n == 0 ) return 0 ; else return ( n & 1 ) + f_gold ( n >> 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(43); param0.add(94); param0.add(72); param0.add(86); param0.add(42); param0.add(33); param0.add(8); param0.add(74); param0.add(29); param0.add(34); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
960
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N.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 COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N{ static int f_gold ( int n ) { if ( n < 10 ) return ( n * ( n + 1 ) / 2 ) ; int d = ( int ) ( Math . log10 ( n ) ) ; int a [ ] = new int [ d + 1 ] ; a [ 0 ] = 0 ; a [ 1 ] = 45 ; for ( int i = 2 ; i <= d ; i ++ ) a [ i ] = a [ i - 1 ] * 10 + 45 * ( int ) ( Math . ceil ( Math . pow ( 10 , i - 1 ) ) ) ; int p = ( int ) ( Math . ceil ( Math . pow ( 10 , d ) ) ) ; int msd = n / p ; return ( msd * a [ d ] + ( msd * ( msd - 1 ) / 2 ) * p + msd * ( 1 + n % p ) + f_gold ( n % p ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(29); param0.add(97); param0.add(71); param0.add(82); param0.add(69); param0.add(30); param0.add(82); param0.add(32); param0.add(77); param0.add(39); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
961
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X.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_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X{ static int f_gold ( int x ) { int i = 1 ; int fact = 1 ; for ( i = 1 ; i < x ; i ++ ) { fact = fact * i ; if ( fact % x == 0 ) break ; } return i ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(67); param0.add(47); param0.add(57); param0.add(89); param0.add(67); param0.add(40); param0.add(16); param0.add(83); param0.add(93); param0.add(43); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
962
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE.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 MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE{ static int f_gold ( int arr [ ] , int n ) { int sum [ ] = new int [ n ] ; if ( n >= 1 ) sum [ 0 ] = arr [ 0 ] ; if ( n >= 2 ) sum [ 1 ] = arr [ 0 ] + arr [ 1 ] ; if ( n > 2 ) sum [ 2 ] = Math . max ( sum [ 1 ] , Math . max ( arr [ 1 ] + arr [ 2 ] , arr [ 0 ] + arr [ 2 ] ) ) ; for ( int i = 3 ; i < n ; i ++ ) sum [ i ] = Math . max ( Math . max ( sum [ i - 1 ] , sum [ i - 2 ] + arr [ i ] ) , arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] ) ; return sum [ n - 1 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,6,8,9,10,10,16,17,17,20,21,22,23,28,29,32,36,37,40,41,42,43,47,47,48,48,49,49,52,52,53,59,61,64,65,79,79,81,87,91,92,98}); param0.add(new int[]{98,76,-80,-30,82,52,-14,28,98,18,82,52,26,-62,-8}); param0.add(new int[]{0,0,0,0,0,1,1,1,1}); param0.add(new int[]{21,26,85,73,47,10,54,9,11,70,42,95,44,91}); param0.add(new int[]{-94,-92,-90,-84,-76,-68,-60,-50,-34,-34,-20,-16,-6,18,50,54,66,70,96}); param0.add(new int[]{1,0,1,1,1,0,1,0,0,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,1}); param0.add(new int[]{2,3,4,4,14,14,18,21,24,26,29,31,32,34,36,37,38,40,42,44,44,54,63,69,77,77,82,82,86,87,90,93,95}); param0.add(new int[]{-46,64,-44,88,-74,54,40,-2,-24,94,40,-44,56,-54,-60,-86,-58,48,-90,12,-76,-30,94,-34,14,12,80,-40,60}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1}); param0.add(new int[]{4,32,63,23,44,57,59,69,88,61,66,61,65,33,79,58,71,2,80,41,83,12,20,9,7,40,36,97,10,98,66,78,71,37,53}); List<Integer> param1 = new ArrayList<>(); param1.add(35); param1.add(7); param1.add(7); param1.add(12); param1.add(9); param1.add(16); param1.add(31); param1.add(22); param1.add(7); param1.add(26); 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()); } }
963
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/K_TH_PRIME_FACTOR_GIVEN_NUMBER.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 K_TH_PRIME_FACTOR_GIVEN_NUMBER{ static int f_gold ( int n , int k ) { while ( n % 2 == 0 ) { k -- ; n = n / 2 ; if ( k == 0 ) return 2 ; } for ( int i = 3 ; i <= Math . sqrt ( n ) ; i = i + 2 ) { while ( n % i == 0 ) { if ( k == 1 ) return i ; k -- ; n = n / i ; } } if ( n > 2 && k == 1 ) return n ; return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(94); param0.add(99); param0.add(64); param0.add(27); param0.add(24); param0.add(84); param0.add(69); param0.add(69); param0.add(22); param0.add(39); List<Integer> param1 = new ArrayList<>(); param1.add(0); param1.add(1); param1.add(3); param1.add(3); param1.add(4); param1.add(6); param1.add(98); param1.add(39); param1.add(60); param1.add(57); 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()); } }
964
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1.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 MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1{ static int f_gold ( int arr [ ] , int N , int k ) { int maxSum = 0 ; Arrays . sort ( arr ) ; for ( int i = N - 1 ; i > 0 ; -- i ) { if ( arr [ i ] - arr [ i - 1 ] < k ) { maxSum += arr [ i ] ; maxSum += arr [ i - 1 ] ; -- i ; } } return maxSum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,10,11,11,12,14,15,17,27,27,28,36,36,44,47,47,54,55,62,64,68,69,70,70,75,76,78,85,85,91,95,97}); param0.add(new int[]{-36,78,10,30,-12,-70,-98,-14,-44,-66,-40,-8,78,2,-70,40,92,58,30,10,-84,-62,-86,-50,82,36,-92,-30,-2,-34,88,2,-4,-72}); param0.add(new int[]{0,0,0,0,0,0,0,0,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,1,1,1,1,1,1}); param0.add(new int[]{77,78,58}); param0.add(new int[]{-88,-88,-88,-82,-58,-54,-48,-46,-46,-44,-20,-2,10,28,28,28,42,42,44,50,50,54,56,58,62,68,70,72,74,76,78,88,90,92}); param0.add(new int[]{0,1,0,0,1,0,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,0,0,0,0,1,0,0,1,1,1,1,1,0,0,0,0,0,0,1,0,1}); param0.add(new int[]{5,7,10,11,15,17,20,20,29,29,32,37,38,39,40,41,45,51,60,64,64,68,68,70,71,71,71,75,76,82,84,87,88,88,95,98}); param0.add(new int[]{-46,-32,76,-28,44,-14,94,-4,60,-88,-52,32,-66,28,94,76,86,-4,74,52,64,-36,-98,-40,70,18,-22,-20,-16,-74,12,60,94,98,-28,-24,4,-34,-60,56}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,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,1}); param0.add(new int[]{79,13,25,22,61,1,2,73,66,94,47,9,1,99,25,39,95,46,95,20,63,15,14,36,9,91,14}); List<Integer> param1 = new ArrayList<>(); param1.add(26); param1.add(26); param1.add(47); param1.add(1); param1.add(21); param1.add(41); param1.add(30); param1.add(33); param1.add(28); param1.add(19); List<Integer> param2 = new ArrayList<>(); param2.add(18); param2.add(25); param2.add(26); param2.add(1); param2.add(24); param2.add(40); param2.add(21); param2.add(23); param2.add(41); param2.add(23); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
965
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING.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 COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING{ static int f_gold ( String str ) { int N = str . length ( ) ; int [ ] [ ] cps = new int [ N + 1 ] [ N + 1 ] ; for ( int i = 0 ; i < N ; i ++ ) cps [ i ] [ i ] = 1 ; for ( int L = 2 ; L <= N ; L ++ ) { for ( int i = 0 ; i < N ; i ++ ) { int k = L + i - 1 ; if ( k < N ) { if ( str . charAt ( i ) == str . charAt ( k ) ) cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] + 1 ; else cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] - cps [ i + 1 ] [ k - 1 ] ; } } } return cps [ 0 ] [ N - 1 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("R"); param0.add("2956350"); param0.add("11100111110101"); param0.add("TZTDLIIfAD"); param0.add("98"); param0.add("1100100001"); param0.add("oKwGeatf"); param0.add("19"); param0.add("00010110100"); param0.add("Cyq"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
966
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_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 SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2{ static int f_gold ( int n ) { n -- ; int sum = 0 ; sum += ( n * ( n + 1 ) ) / 2 ; sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6 ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(12); param0.add(89); param0.add(76); param0.add(2); param0.add(81); param0.add(11); param0.add(26); param0.add(35); param0.add(16); param0.add(66); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
967
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT.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 CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT{ static boolean f_gold ( String str ) { int n = str . length ( ) ; int digitSum = 0 ; for ( int i = 0 ; i < n ; i ++ ) digitSum += ( str . charAt ( i ) - '0' ) ; return ( digitSum % 3 == 0 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("Xy"); param0.add("4827182"); param0.add("110011"); param0.add("GdOXZk"); param0.add("8970294"); param0.add("000110"); param0.add("xMRGdAgsGlH"); param0.add("34643260819239"); param0.add("00"); param0.add("DcCK"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
968
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SORT_ARRAY_TWO_HALVES_SORTED.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; class SORT_ARRAY_TWO_HALVES_SORTED{ static void f_gold ( int [ ] A , int n ) { Arrays . sort ( A ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,11,13,18,24,26,30,31,34,42,43,43,44,44,47,49,52,53,55,56,57,58,58,60,64,66,67,69,70,70,71,74,76,77,82,85,89,90,96,98}); param0.add(new int[]{-78,81,87,14,25,24,-70,-92,-2,-43,11,-27,15,-80,-75,-81,-95,-25,28,-28,55,-60,-74,-73,90,-17,28,78,70,57,67,88,69,-67,-3,11,-84,-77,35,-74,-4,-88,-28,33}); param0.add(new int[]{0,0,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}); param0.add(new int[]{6,46,50,38,88,18,27,41,72,92,74,17,62,29,58,70,78,22,6,26,39,12,99,14,22,51,23,48,71,50,89,13,85,10,55,9,79,52,2,25,13,98,51,58,34,35,3,59,70}); param0.add(new int[]{-98,-88,-76,-71,-71,-63,-59,-58,-57,-42,-40,-37,-36,-34,-33,-33,-27,-26,-23,-9,-8,-6,-5,-1,0,3,16,21,29,30,33,39,39,43,47,50,52,60,63,66,73,74,76,77,92,92,96,97}); param0.add(new int[]{1,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,1,0}); param0.add(new int[]{46,86}); param0.add(new int[]{58,-31,37,-15,-89,-31,-1,-9,94,59,61,67,-6,74,65,15,88,-69,-89,-13,21,30,5}); param0.add(new int[]{0,0,0,0,0,0,0,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}); param0.add(new int[]{94,5,98,22,77,57,47,54,3,53,84,31}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(31); param1.add(15); param1.add(46); param1.add(42); param1.add(31); param1.add(1); param1.add(21); param1.add(19); param1.add(10); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{2,3,11,13,18,24,26,30,31,34,42,43,43,44,44,47,49,52,53,55,56,57,58,58,60,64,66,67,69,70,70,71,74,76,77,82,85,89,90,96,98}); filled_function_param0.add(new int[]{-78,81,87,14,25,24,-70,-92,-2,-43,11,-27,15,-80,-75,-81,-95,-25,28,-28,55,-60,-74,-73,90,-17,28,78,70,57,67,88,69,-67,-3,11,-84,-77,35,-74,-4,-88,-28,33}); filled_function_param0.add(new int[]{0,0,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}); filled_function_param0.add(new int[]{6,46,50,38,88,18,27,41,72,92,74,17,62,29,58,70,78,22,6,26,39,12,99,14,22,51,23,48,71,50,89,13,85,10,55,9,79,52,2,25,13,98,51,58,34,35,3,59,70}); filled_function_param0.add(new int[]{-98,-88,-76,-71,-71,-63,-59,-58,-57,-42,-40,-37,-36,-34,-33,-33,-27,-26,-23,-9,-8,-6,-5,-1,0,3,16,21,29,30,33,39,39,43,47,50,52,60,63,66,73,74,76,77,92,92,96,97}); filled_function_param0.add(new int[]{1,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,1,0}); filled_function_param0.add(new int[]{46,86}); filled_function_param0.add(new int[]{58,-31,37,-15,-89,-31,-1,-9,94,59,61,67,-6,74,65,15,88,-69,-89,-13,21,30,5}); filled_function_param0.add(new int[]{0,0,0,0,0,0,0,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}); filled_function_param0.add(new int[]{94,5,98,22,77,57,47,54,3,53,84,31}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(33); filled_function_param1.add(31); filled_function_param1.add(15); filled_function_param1.add(46); filled_function_param1.add(42); filled_function_param1.add(31); filled_function_param1.add(1); filled_function_param1.add(21); filled_function_param1.add(19); filled_function_param1.add(10); for(int i = 0; i < param0.size(); ++i) { f_filled(filled_function_param0.get(i),filled_function_param1.get(i)); f_gold(param0.get(i),param1.get(i)); if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i)) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
969
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS.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_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS{ static int f_gold ( int arr [ ] , int n , int x , int y ) { int i , j ; int min_dist = Integer . MAX_VALUE ; for ( i = 0 ; i < n ; i ++ ) { for ( j = i + 1 ; j < n ; j ++ ) { if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > Math . abs ( i - j ) ) min_dist = Math . abs ( i - j ) ; } } return min_dist ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,7,7,8,11,14,16,25,34,35,36,36,38,40,41,43,45,47,57,60,64,72,73,74,75,82,83,83,84,84,84,92}); param0.add(new int[]{96,70,88,-64,-42,58,92,66,-14,90,-66,12,88,-12,48,-4,90,24,98,14,32,38,98,78,2,26,12,-36,90,80,40,58,88,64,16}); param0.add(new int[]{0,0,1}); param0.add(new int[]{46,96,82,73,30,36,56,20,5,36,4,7,89,63,54,97,80,56,93,34,90,56,25,27,75,68,14,90}); param0.add(new int[]{-96,-88,-82,-66,-62,-52,-52,-46,-46,-40,-40,-28,-24,-12,0,4,10,24,42,46,48,48,50,60,62,64,64,70,92,98}); param0.add(new int[]{0,0,1,0,1,1,0,1,1,1,1}); param0.add(new int[]{1,2,2,6,10,14,15,18,19,22,23,29,30,37,40,40,41,41,42,42,44,46,46,54,56,72,73,81,83,83,86,88,93}); param0.add(new int[]{46,86,-52,18,-32,86,2,38,72,72,-60,70,-58,66,-66,-72,-74,58,52,58,16,64,62,-62,80,-70,-96,-44,-20,-74,-10,14,-32,48,30,76,-16,80,66,-46,-92,26,-86,28,-76,-24,-98,54,50}); param0.add(new int[]{0,0,0,0,0,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,1,1,1,1}); param0.add(new int[]{32,65,10,72,17,58,79,28,67,36,18,35}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(25); param1.add(1); param1.add(26); param1.add(24); param1.add(10); param1.add(27); param1.add(30); param1.add(38); param1.add(7); List<Integer> param2 = new ArrayList<>(); param2.add(7); param2.add(58); param2.add(1); param2.add(54); param2.add(0); param2.add(0); param2.add(1); param2.add(25); param2.add(0); param2.add(10); List<Integer> param3 = new ArrayList<>(); param3.add(40); param3.add(70); param3.add(1); param3.add(82); param3.add(4); param3.add(1); param3.add(42); param3.add(45); param3.add(0); param3.add(7); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
970
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO.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 WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO{ static boolean f_gold ( int n ) { if ( n == 0 ) return false ; while ( n != 1 ) { if ( n % 2 != 0 ) return false ; n = n / 2 ; } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(1); param0.add(2); param0.add(8); param0.add(1024); param0.add(24); param0.add(7); param0.add(46); param0.add(61); param0.add(73); param0.add(66); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
971
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_XOR_VALUE_PAIR.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 MINIMUM_XOR_VALUE_PAIR{ static int f_gold ( int arr [ ] , int n ) { int min_xor = Integer . MAX_VALUE ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) min_xor = Math . min ( min_xor , arr [ i ] ^ arr [ j ] ) ; return min_xor ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,5,7,10,10,11,14,19,21,24,27,27,27,28,28,28,33,34,41,42,43,48,52,53,53,59,62,64,66,71,77,78,78,79,80,82,90,97,99,99}); param0.add(new int[]{-68,-58,52,88,90,66,-66,-84,-70,-64,56,42,94,-10,0,80,8,28,-94,36,90,56,56,80,-94,50,90,-28,-22,-2,-96,74,-16,-14}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{57,63,11,73,60,73,25,65,39,48,31,17,23,94,10,97,42,45,83,75,97,96}); param0.add(new int[]{-92,-92,-90,-88,-84,-82,-66,-64,-64,-62,-44,-42,-40,-28,-22,-12,-4,-2,0,4,16,22,28,34,54,60,72,74,78,86,94}); param0.add(new int[]{1,1,1,0,0,0,1,0,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0}); param0.add(new int[]{2,2,6,13,16,16,17,19,19,20,22,25,27,29,34,34,34,36,38,39,42,49,49,53,59,59,71,77,79,82,83,83,84,84,86,86,87,88,93,96}); param0.add(new int[]{-14,20,36,12,-54,-50,92,-28,44,-46,6,96,82,70,-20,24,-96,-14,46,-28,-46,-28,22,-82,36,-94,-48,-92,96,74,14}); param0.add(new int[]{0,0,0,0,0,0,0,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,1,1,1,1,1,1,1}); param0.add(new int[]{50,48,94,64,60,48,79,75,77,62,33,42,22,78,32,99,27,23,76,51,34,54,70,12,19,17,13,82,96,70,4,12,5,11,23,23,18,93,38,69}); List<Integer> param1 = new ArrayList<>(); param1.add(34); param1.add(17); param1.add(9); param1.add(21); param1.add(18); param1.add(36); param1.add(36); param1.add(20); param1.add(39); param1.add(30); 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()); } }
972
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_DIVISORS_1_N_1.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 SUM_DIVISORS_1_N_1{ static int f_gold ( int n ) { int sum = 0 ; for ( int i = 1 ; i <= n ; ++ i ) sum += ( n / i ) * i ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(73); param0.add(41); param0.add(36); param0.add(28); param0.add(49); param0.add(24); param0.add(85); param0.add(59); param0.add(82); param0.add(40); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
973
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.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 PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES{ static int f_gold ( int n ) { return 1 + n * ( n + 1 ) / 2 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(46); param0.add(68); param0.add(4); param0.add(12); param0.add(56); param0.add(14); param0.add(81); param0.add(29); param0.add(26); param0.add(40); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
974
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_TRIPLET_SUM_ARRAY.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 MAXIMUM_TRIPLET_SUM_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int sum = - 1000000 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( sum < arr [ i ] + arr [ j ] + arr [ k ] ) sum = arr [ i ] + arr [ j ] + arr [ k ] ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{6,10,14,19,24,29,42,43,44,47,47,55,57,59,60,61,76,76,77,81,84,92,92,93,95,97}); param0.add(new int[]{-98,72,52,-62,74,-26,-82,-74,90,58,94,-2,76,-28,12,64,-94,86,56,10,40,20,92,-4,-80,26,-40,36,66,-46,4,-42,-76,76,-90,-48,22,30,48,38,78}); param0.add(new int[]{0,0,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}); param0.add(new int[]{96,96,38,26,2,36,15,51,78,98,94,31,62,21,7,68,37,4}); param0.add(new int[]{-8,12,68,78,78}); param0.add(new int[]{0,0,0,0,1,0,0,0,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,0,0,0}); param0.add(new int[]{1,15,16,17,28,28,28,30,31,37,38,38,45,45,46,46,50,51,53,53,55,55,56,58,58,64,78,82,82,85,87,89,89,90,94,95}); param0.add(new int[]{-56,-72,-20,88,20,86,30,36,-44,-66,-26,-88,12,-76,78,62,62,68,-34,0,-22,64,72,56,-64,-16,-4,86,0,98,-70,98,-68,92,-84,-56,28,-74,6,-10,-82,36,-12,-26,66,-60,-68,70,2}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{85,31,15,68,92,89,32,56,27,70,82,58,63,83,89,95,78,9,27,34,24,42,66,6,1,71,55,23,75,26,19,58,25}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(28); param1.add(22); param1.add(10); param1.add(4); param1.add(35); param1.add(29); param1.add(36); param1.add(11); param1.add(16); 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()); } }
975
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY.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 MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY{ static int f_gold ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int a = 0 , b = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i % 2 != 0 ) a = a * 10 + arr [ i ] ; else b = b * 10 + arr [ i ] ; } return a + b ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,4,5,10,14,16,18,42,43,43,45,46,51,52,53,58,61,66,79,81,82,84}); param0.add(new int[]{48,-22,60,32,48,-2,-76,-50,-26,56,-86,98,-30,-22,82,-20,58,40,76,-2,82,-90,8,-46,22,94}); param0.add(new int[]{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}); param0.add(new int[]{79,45}); param0.add(new int[]{-90,-68,-38,-34,-4,6,10,28,48,52,54,68,88,90}); param0.add(new int[]{1,0,0,1,0,1,0,1,0,1,0,0,1,1,1,1,0,0,1,1,0,1,1,0}); param0.add(new int[]{4,8,8,23,26,27,30,42,44,55,59,64,67,69,74,77,82,82,87,96,97}); param0.add(new int[]{0,-18,-98,-36,-62,0,-32,-98,46,72,-18,30,-86,-42,-82,2,-76,-64,-66,-48,-28,52,-46,-76,76,10,70,4,18,94,88,80,-60,-36,62,96,-4,88,50}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{8,71,75,58,97,24,56,98,71,69,32,64,54,96,69,22,7,47,45,68,17,36,90,9,71,86,16,61,53,63,9,74,38,87,14,86,42,42,14,43,58,82,72,73,32}); List<Integer> param1 = new ArrayList<>(); param1.add(19); param1.add(25); param1.add(23); param1.add(1); param1.add(11); param1.add(22); param1.add(17); param1.add(32); param1.add(6); param1.add(25); 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()); } }
976
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_PREFIX_ALSO_SUFFIX_1.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 LONGEST_PREFIX_ALSO_SUFFIX_1{ static int f_gold ( String s ) { int n = s . length ( ) ; int lps [ ] = new int [ n ] ; lps [ 0 ] = 0 ; int len = 0 ; int i = 1 ; while ( i < n ) { if ( s . charAt ( i ) == s . charAt ( len ) ) { len ++ ; lps [ i ] = len ; i ++ ; } else { if ( len != 0 ) { len = lps [ len - 1 ] ; } else { lps [ i ] = 0 ; i ++ ; } } } int res = lps [ n - 1 ] ; return ( res > n / 2 ) ? n / 2 : res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("aabcdaabc"); param0.add("1372494598"); param0.add("110000100001"); param0.add("abcab"); param0.add("488938"); param0.add("011010101011"); param0.add("aaaa"); param0.add("3356203205"); param0.add("1010"); param0.add("kkXiiTZkGeh"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
977
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SEARCHING_ARRAY_ADJACENT_DIFFER_K.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 SEARCHING_ARRAY_ADJACENT_DIFFER_K{ static int f_gold ( int arr [ ] , int n , int x , int k ) { int i = 0 ; while ( i < n ) { if ( arr [ i ] == x ) return i ; i = i + Math . max ( 1 , Math . abs ( arr [ i ] - x ) / k ) ; } System . out . println ( "number is " + "not present!" ) ; return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,5,9,11,14,18,19,21,26,32,38,38,43,47,49,52,55,61,65,67,69,73,74,79,84,90,91,91,92,93,94,99}); param0.add(new int[]{12,-86,-66,-50,-48,78,-92,-56,-2,66,64}); param0.add(new int[]{0,0,0,0,0,0,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,1,1,1,1,1,1,1}); param0.add(new int[]{10,87,39,87,45,33,5,37,70,69,88,78,90,3}); param0.add(new int[]{-78,-70,-68,-60,-52,-34,-24,-4,12,18,58,58,64,76,84,94}); param0.add(new int[]{0,1,0,1,1,1,0,0,1,0,0,1,0,0,1,0,0,0,1,0,0,1,1,0,0,1,1,1,0,1,0,1,0,0,1,1,0,0,1,0,1,0,1,0}); param0.add(new int[]{5,5,7,11,11,15,22,23,28,38,41,53,54,57,59,68,71,89}); param0.add(new int[]{-4,0,60,-14,-48,54,-96,-68,-40,64,-50,-74,-20,-22,48,-48,42,62,66,84,54,-52,-52,6,46,-90,-18,90}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1}); param0.add(new int[]{30,91,34,44,3,76,43,75,49,33,74,72,68,79,26,62,23,5,32,75,82,25,7,19,32,87,87,94,34,62,3,32,59}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(5); param1.add(35); param1.add(9); param1.add(14); param1.add(26); param1.add(16); param1.add(18); param1.add(9); param1.add(32); List<Integer> param2 = new ArrayList<>(); param2.add(19); param2.add(10); param2.add(37); param2.add(8); param2.add(9); param2.add(36); param2.add(17); param2.add(14); param2.add(8); param2.add(30); List<Integer> param3 = new ArrayList<>(); param3.add(26); param3.add(5); param3.add(43); param3.add(10); param3.add(13); param3.add(32); param3.add(16); param3.add(23); param3.add(9); param3.add(24); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
978
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1.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 COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1{ static int f_gold ( int m , int n ) { int count [ ] [ ] = new int [ m ] [ n ] ; for ( int i = 0 ; i < m ; i ++ ) count [ i ] [ 0 ] = 1 ; for ( int j = 0 ; j < n ; j ++ ) count [ 0 ] [ j ] = 1 ; for ( int i = 1 ; i < m ; i ++ ) { for ( int j = 1 ; j < n ; j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ] + count [ i ] [ j - 1 ] ; } return count [ m - 1 ] [ n - 1 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(79); param0.add(95); param0.add(15); param0.add(71); param0.add(16); param0.add(91); param0.add(10); param0.add(98); param0.add(30); param0.add(58); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(62); param1.add(9); param1.add(18); param1.add(85); param1.add(52); param1.add(91); param1.add(81); param1.add(42); param1.add(69); 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()); } }
979
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS.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 MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS{ static int f_gold ( int x , int y ) { if ( y == 0 ) return 0 ; if ( y > 0 ) return ( x + f_gold ( x , y - 1 ) ) ; if ( y < 0 ) return - f_gold ( x , - y ) ; return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(18); param0.add(23); param0.add(24); param0.add(75); param0.add(25); param0.add(57); param0.add(31); param0.add(8); param0.add(12); param0.add(74); List<Integer> param1 = new ArrayList<>(); param1.add(94); param1.add(36); param1.add(22); param1.add(92); param1.add(43); param1.add(32); param1.add(57); param1.add(17); param1.add(76); param1.add(70); 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()); } }
980
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_NUMBER_PAIRS_ARRAY_XOR_0.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_NUMBER_PAIRS_ARRAY_XOR_0{ static int f_gold ( int a [ ] , int n ) { Arrays . sort ( a ) ; int count = 1 ; int answer = 0 ; for ( int i = 1 ; i < n ; i ++ ) { if ( a [ i ] == a [ i - 1 ] ) { count += 1 ; } else { answer = answer + ( count * ( count - 1 ) ) / 2 ; count = 1 ; } } answer = answer + ( count * ( count - 1 ) ) / 2 ; return answer ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,7,9,12,13,13,14,16,19,23,24,25,28,29,38,38,41,42,44,51,55,56,58,59,61,62,62,63,63,64,67,68,69,71,78,78,80,82,82,82,83,85,86,92,94,98}); param0.add(new int[]{42,-20,52,34,58,62,-60,70,36,-8,-26,68,34,-92,42,94,56,84,-70,70}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,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}); param0.add(new int[]{31,87,75,69,11,65,25,27}); param0.add(new int[]{-92,-88,-86,-74,-72,-70,-70,-66,-62,-60,-52,-42,-42,8,14,30,36,84,88}); param0.add(new int[]{1,0,0,0}); param0.add(new int[]{2,8,9,12,21,23,30,31,33,34,34,41,43,45,52,53,53,55,56,61,73,73,73,74,76,79,81,81,81,90,91,92,92,97,99,99}); param0.add(new int[]{84,6,-36,62,-2,-32,-82,-78,20,8,-50,-70,20,-58,94,-28,-84,-22,-44,-84,2,-68,-34,58,-64,-86,-40,-80,74,-26,12,2,-20,20,76,-14,-40,56,24,-16,-66,14,-42,0,72,82,-70}); param0.add(new int[]{0,0,0,0,0,0,0,1,1}); param0.add(new int[]{67,93,54,91,74,88,48,68,17,6,15,25}); List<Integer> param1 = new ArrayList<>(); param1.add(24); param1.add(17); param1.add(37); param1.add(5); param1.add(13); param1.add(3); param1.add(30); param1.add(31); param1.add(8); param1.add(9); 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()); } }
981
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY.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_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { int result = - 1 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max ( result , arr [ i ] ) ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,78,84}); param0.add(new int[]{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18}); param0.add(new int[]{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}); param0.add(new int[]{39,49,94,80,48,34,63,82,47,51,60,68,79,23,97,22,54,53,40,2,25}); param0.add(new int[]{-90,-52,-10,12,72}); param0.add(new int[]{1,0,0}); param0.add(new int[]{2,9,11,14,16,17,17,18,19,21,24,25,28,29,30,33,33,39,41,41,43,46,50,51,60,62,67,80,84,86,91,92,97}); param0.add(new int[]{4}); param0.add(new int[]{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}); param0.add(new int[]{52,8,31,92,20,18,34,5,15,8,73,20,40,61,80,51,95,73,38,30,21,69,52,38,68,77}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(26); param1.add(22); param1.add(10); param1.add(3); param1.add(2); param1.add(27); param1.add(0); param1.add(16); 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()); } }
982
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1.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 NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1{ public static int f_gold ( int a , int b ) { if ( a == 0 || b == 0 ) return 1 ; return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(97); param0.add(52); param0.add(95); param0.add(35); param0.add(40); param0.add(18); param0.add(92); param0.add(73); param0.add(10); param0.add(82); List<Integer> param1 = new ArrayList<>(); param1.add(91); param1.add(49); param1.add(34); param1.add(40); param1.add(85); param1.add(97); param1.add(15); param1.add(98); param1.add(62); 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()); } }
983
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS.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 COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS{ static long f_gold ( int n ) { long dp [ ] [ ] = new long [ 2 ] [ n + 1 ] ; dp [ 0 ] [ 1 ] = 1 ; dp [ 1 ] [ 1 ] = 2 ; for ( int i = 2 ; i <= n ; i ++ ) { dp [ 0 ] [ i ] = dp [ 0 ] [ i - 1 ] + dp [ 1 ] [ i - 1 ] ; dp [ 1 ] [ i ] = dp [ 0 ] [ i - 1 ] * 2 + dp [ 1 ] [ i - 1 ] ; } return dp [ 0 ] [ n ] + dp [ 1 ] [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(68); param0.add(91); param0.add(99); param0.add(79); param0.add(61); param0.add(48); param0.add(89); param0.add(20); param0.add(83); param0.add(1); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
984
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_FIND_CIRCUMFERENCE_CIRCLE.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 PROGRAM_FIND_CIRCUMFERENCE_CIRCLE{ static double f_gold ( double r ) { double PI = 3.1415 ; double cir = 2 * PI * r ; return cir ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(8650.932760642281); param0.add(-9475.213251789266); param0.add(3895.3903681587985); param0.add(-2977.0280936855806); param0.add(8513.1890392562); param0.add(-239.5023899621529); param0.add(3460.951135898811); param0.add(-8717.439885353786); param0.add(6512.42862487631); param0.add(-2607.390557447935); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
985
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NTH_NON_FIBONACCI_NUMBER.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 NTH_NON_FIBONACCI_NUMBER{ static int f_gold ( int n ) { int prevPrev = 1 , prev = 2 , curr = 3 ; while ( n > 0 ) { prevPrev = prev ; prev = curr ; curr = prevPrev + prev ; n = n - ( curr - prev - 1 ) ; } n = n + ( curr - prev - 1 ) ; return prev + n ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(76); param0.add(91); param0.add(62); param0.add(65); param0.add(83); param0.add(57); param0.add(76); param0.add(6); param0.add(2); param0.add(86); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
986
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT.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 PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT{ static boolean f_gold ( int n ) { boolean arr [ ] = new boolean [ 10 ] ; for ( int i = 0 ; i < 10 ; i ++ ) arr [ i ] = false ; while ( n > 0 ) { int digit = n % 10 ; if ( arr [ digit ] ) return false ; arr [ digit ] = true ; n = n / 10 ; } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(474); param0.add(9445); param0.add(90); param0.add(30); param0.add(37453); param0.add(27); param0.add(2400); param0.add(98); param0.add(46); param0.add(722); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
987
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/AREA_OF_A_HEXAGON.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 AREA_OF_A_HEXAGON{ public static double f_gold ( double s ) { return ( ( 3 * Math . sqrt ( 3 ) * ( s * s ) ) / 2 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(1772.6589509256596); param0.add(-599.737107809315); param0.add(1074.1765931782); param0.add(-1182.4087746714795); param0.add(8083.035797247716); param0.add(-6126.414356565494); param0.add(5370.057504189614); param0.add(-6947.020794285176); param0.add(2110.5107873533325); param0.add(-6458.751326919488); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
988
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT.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 REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT{ static int f_gold ( int dp [ ] [ ] , int a [ ] , int low , int high , int turn ) { if ( low == high ) { return a [ low ] * turn ; } if ( dp [ low ] [ high ] != 0 ) { return dp [ low ] [ high ] ; } dp [ low ] [ high ] = Math . max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , high - 1 , turn + 1 ) ) ; return dp [ low ] [ high ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{23,37,54,57,59,75,97},new int[]{9,15,34,39,80,96,99},new int[]{15,25,26,31,43,47,93},new int[]{22,31,37,44,54,62,91},new int[]{7,19,32,56,57,70,81},new int[]{16,37,49,77,81,82,85},new int[]{44,48,64,74,79,89,99}}); param0.add(new int[][]{new int[]{-24,-34,-86,-16,-34,14,76,4,18,60,-4,-24,46,-26,-74,6,50,-34,8,-30,-62,56,-78,-50,76,-98,-64,-72,-76,46,-70,4,-92,-18,10,-76,78,-26},new int[]{-34,-30,-96,-4,76,48,-10,96,-88,96,90,40,-24,68,-42,-48,-30,-32,-44,-50,-98,34,-78,-52,-88,-38,54,-64,-94,-48,-80,-2,-90,-14,-8,90,-78,-36},new int[]{30,-80,-58,48,-80,-78,40,-48,-40,-84,2,44,72,6,78,-84,-30,-70,32,86,16,68,40,-36,80,-46,66,-92,8,72,-56,58,-72,44,40,6,66,-66},new int[]{16,-72,-66,-30,66,-94,36,-34,-78,14,-74,-54,48,6,-40,-40,-24,-6,18,-20,-88,-8,82,-56,-96,-32,30,-22,70,-4,98,-40,-72,66,-54,-60,52,66},new int[]{-28,-52,90,-52,12,98,42,-52,38,-60,-28,94,86,-22,-62,68,12,92,-82,18,-2,82,-28,72,-78,-70,40,-54,-24,-68,-74,-40,-32,14,88,94,-46,-14},new int[]{-38,-30,62,-52,54,56,12,32,-78,24,38,-82,6,-64,-96,-56,-30,62,-94,-26,-64,-38,96,72,54,-56,56,82,6,-30,94,80,-68,18,84,58,-48,-34},new int[]{82,-44,14,-26,-14,-92,62,-48,-52,26,-30,-76,-26,28,54,-16,-60,16,-76,-90,20,-8,56,-86,66,-84,92,-52,90,30,38,-2,90,-50,88,44,-66,-80},new int[]{-22,68,62,-84,-76,-12,82,70,-58,86,20,-66,96,-28,6,60,-90,52,-28,8,34,90,38,24,76,-22,6,16,-46,-4,84,-6,6,30,50,26,8,-8},new int[]{34,-62,-26,18,-14,42,-50,72,16,-62,-76,32,-20,82,8,74,60,-60,-16,-50,-38,-88,68,-26,66,-14,64,42,98,40,-56,28,-96,36,-82,-74,38,-26},new int[]{-66,-58,-84,16,-42,4,-38,-6,-32,-98,20,-96,60,-38,24,-8,-74,52,98,52,-10,-24,-22,78,-20,58,-24,-98,-76,0,-94,6,28,42,20,-36,68,-68},new int[]{-20,70,-80,68,-26,-26,-22,88,86,12,-98,-80,2,-22,-2,2,-52,-50,30,12,74,34,-14,-54,70,16,-76,-56,16,-50,-14,-4,30,48,-14,84,-34,30},new int[]{68,68,-86,66,-64,60,-28,52,14,-40,-98,22,-30,28,-48,-76,66,94,-28,32,88,86,-76,-4,68,-56,76,-4,36,16,-4,8,-44,-84,74,74,96,-22},new int[]{-14,-88,-52,-72,-60,-50,32,86,14,-26,36,-84,38,80,-86,-64,14,-96,86,-52,-48,-16,-78,-66,-10,-24,70,22,90,46,-74,36,-74,2,96,6,4,34},new int[]{-34,72,-40,34,-30,18,54,-50,0,94,-62,80,4,84,10,98,56,-36,-94,88,10,-30,90,-52,14,-46,30,82,-66,8,-98,86,-90,46,-44,-92,22,58},new int[]{70,-44,-28,-78,-62,-78,-96,-6,-92,-86,-82,72,-50,26,-4,82,-42,58,28,-88,98,-98,-14,72,-24,58,72,-72,6,-78,34,-34,58,-62,78,-98,0,50},new int[]{84,48,-82,-32,-22,16,-34,-28,-76,40,26,30,70,28,-64,-90,70,-90,82,60,10,-52,0,50,-38,-32,-18,2,48,20,-96,4,62,-28,28,-12,50,-90},new int[]{64,58,-34,10,-44,-72,62,70,60,84,-12,-46,-82,-12,80,46,44,-58,-18,10,44,50,-60,-20,82,-10,18,-4,48,22,-14,12,-76,-32,8,-60,-54,-6},new int[]{22,-58,58,-24,-58,-64,62,-38,-36,44,-82,46,-78,54,96,24,84,90,-2,-98,-74,8,44,-94,84,48,-2,66,-44,52,-42,-36,34,-98,-6,54,26,18},new int[]{-28,30,-66,-14,-20,-44,-62,-20,90,-92,-38,64,44,-60,90,-60,-82,36,-46,52,-60,26,12,80,-64,92,-22,-68,-10,54,-96,44,70,10,4,-4,-94,66},new int[]{-70,54,-32,92,-26,-66,28,-98,-14,-20,40,-36,-6,-60,-36,-32,26,90,34,-34,82,48,-82,-8,-86,-74,-58,-68,-68,-16,-26,-88,-6,-76,-12,-68,-98,-94},new int[]{14,-84,90,88,80,-28,-46,4,-4,36,-56,-44,68,24,24,70,36,-4,58,-78,14,-48,-46,58,-44,-66,72,-36,84,70,-26,72,76,30,-30,92,4,-40},new int[]{-24,-28,0,-44,-48,74,76,50,-88,36,-24,62,-34,82,-20,38,-76,16,-70,92,-82,56,72,78,40,52,-52,-38,36,-44,92,46,-60,-54,58,96,74,-18},new int[]{70,-30,-62,-74,-88,-92,72,-42,34,76,-4,-94,22,-82,56,2,44,-64,-88,-20,96,0,-12,-20,-40,-56,-8,18,-8,18,98,28,50,-14,72,50,4,38},new int[]{72,-66,16,-44,94,10,60,96,24,12,92,30,2,64,4,58,74,-24,-96,-52,72,10,-2,-18,-74,-2,70,-6,-60,72,-32,34,-78,-10,-2,-30,54,42},new int[]{80,92,18,54,-42,50,-62,76,94,38,84,78,44,98,78,-54,-36,-80,62,14,24,86,52,4,78,96,20,58,-64,-42,20,-98,-90,6,30,56,-66,-34},new int[]{-86,60,-62,-32,-12,92,-54,-2,8,58,68,42,-46,-8,82,-28,-96,62,46,-12,0,88,82,-26,-42,36,46,-46,54,-58,-58,-62,32,-48,-60,86,4,56},new int[]{88,-36,4,60,24,6,72,58,44,14,-40,-64,36,-92,36,-56,-78,86,80,80,-94,64,-4,-2,86,26,-98,-56,62,-56,-18,40,12,26,50,72,-16,-58},new int[]{-88,4,-66,64,42,94,54,-38,8,-18,-8,88,46,42,64,-88,94,58,-50,26,38,92,-66,82,8,38,-92,-32,50,-44,-88,-6,34,12,66,54,-52,-86},new int[]{20,-90,2,-94,-76,-28,-76,44,-12,-56,50,4,34,-88,46,2,60,52,22,98,-84,6,-26,-90,-4,48,-66,-42,58,-22,30,-22,-82,-50,42,84,94,4},new int[]{-56,4,-4,54,64,82,88,8,50,66,-2,80,-4,12,24,-56,-52,80,66,82,-66,-92,-42,-56,66,-92,-60,-92,-52,-54,32,22,-42,-46,-66,60,10,-62},new int[]{-44,0,6,-54,-98,72,-98,-28,-4,-86,-10,-76,-64,-66,58,60,24,90,-6,-54,-22,84,-34,64,36,18,14,-32,-88,-32,84,-8,60,98,28,-6,14,-88},new int[]{-94,-92,74,96,28,34,56,74,-62,-46,-8,10,-96,-72,50,-98,-28,72,2,46,68,14,-72,-78,-76,68,52,-30,-32,90,40,50,50,20,98,2,72,44},new int[]{-6,94,16,-70,-74,-46,22,24,44,-40,52,-50,94,-66,84,-66,14,-12,48,-6,64,-12,-44,-14,2,-48,-22,52,-28,-18,8,72,-28,68,44,-28,-20,62},new int[]{12,-94,-86,-52,-92,-76,-78,10,-8,30,34,26,-80,-8,68,92,66,16,-48,70,30,-56,-80,-78,58,94,-56,-12,56,-94,-60,-70,0,-94,6,36,48,-98},new int[]{74,72,20,-84,96,-84,40,-36,-88,-14,60,-70,36,-28,-18,-82,-36,92,-86,44,-16,-66,28,-88,-18,-52,66,-26,-90,-12,-16,80,-28,82,-92,82,-76,-80},new int[]{40,-38,-48,72,-30,70,-14,14,90,42,-6,52,-94,44,-32,-8,-74,80,-18,-10,74,-80,86,-82,-2,10,-12,58,-70,-18,86,40,62,76,88,68,68,4},new int[]{86,4,16,86,-66,72,-38,-40,-52,14,-60,-88,-44,-60,-64,84,-50,-78,-44,-18,78,74,-66,-64,18,26,74,98,-18,-96,-82,4,-74,-40,-50,-46,-4,94},new int[]{-70,-64,-10,-22,-88,-48,84,78,16,64,78,-48,66,-88,44,60,-10,-48,60,-40,86,-40,32,16,28,-30,32,-74,10,-34,38,-36,-30,2,14,-92,-48,88}}); param0.add(new int[][]{new int[]{0,0,0,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},new int[]{0,0,0,0,0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,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},new int[]{0,0,0,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},new int[]{0,0,0,0,0,0,0,0,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},new int[]{0,0,0,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},new int[]{0,0,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,1},new int[]{0,0,0,0,0,0,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},new int[]{0,0,0,0,0,0,0,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},new int[]{0,0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,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,1},new int[]{0,0,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,1},new int[]{0,0,0,0,0,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},new int[]{0,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,1,1},new int[]{0,0,0,0,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},new int[]{0,0,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,1},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,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},new int[]{0,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,1,1},new int[]{0,0,0,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},new int[]{0,0,0,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},new int[]{0,0,0,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},new int[]{0,0,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,1},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,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},new int[]{0,0,0,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},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,1,1,1},new int[]{0,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,1,1},new int[]{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,1,1,1,1,1,1},new int[]{0,0,0,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},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,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}}); param0.add(new int[][]{new int[]{84,65,61,9,50,58,19,98,63,92,42,82,5,55,81,77,1,92,74,40,13,59,48,51,18,42,34,78,41,82,13,6,92},new int[]{31,76,5,83,74,92,29,9,40,28,36,36,4,73,32,6,79,8,45,89,60,34,82,27,68,24,68,47,27,42,3,61,19},new int[]{56,19,38,73,69,25,38,90,20,50,27,8,1,84,9,44,54,64,8,74,19,52,40,9,75,66,58,8,40,46,55,54,75},new int[]{12,13,58,11,23,52,60,91,95,86,63,25,62,93,35,36,60,87,94,46,3,85,35,77,28,22,33,7,92,76,33,53,30},new int[]{2,4,55,27,47,76,45,70,34,36,5,2,50,24,32,85,81,34,5,35,56,72,21,39,58,90,49,75,74,49,76,22,30},new int[]{35,66,31,4,44,70,53,57,36,36,54,26,96,4,22,34,1,87,57,51,16,36,47,91,39,5,25,45,61,5,37,51,88},new int[]{45,98,42,35,56,86,16,75,9,32,14,92,40,25,24,29,5,1,75,13,3,8,71,79,96,33,22,13,30,20,41,84,59},new int[]{74,33,15,13,27,6,87,95,74,82,7,52,29,66,44,89,74,21,57,22,32,13,14,42,12,99,55,9,16,94,37,72,29},new int[]{64,47,16,76,77,39,94,53,65,65,80,12,25,14,6,77,66,12,37,63,78,17,32,16,22,7,40,25,8,27,32,55,39},new int[]{27,52,60,70,10,52,14,60,35,31,27,50,74,87,32,28,55,98,68,9,72,48,53,39,29,64,84,64,47,7,69,22,72},new int[]{89,58,93,44,1,12,98,64,65,97,36,4,84,47,49,77,81,11,30,3,69,73,30,68,73,10,96,40,71,57,3,81,46},new int[]{39,71,95,88,22,67,25,57,53,22,98,68,19,28,10,26,79,13,50,2,10,54,44,88,69,97,75,31,18,77,17,22,53},new int[]{85,17,87,79,24,25,49,13,15,16,36,98,41,78,77,89,31,91,20,85,51,29,55,94,69,16,85,91,83,9,66,96,16},new int[]{67,72,45,87,18,95,50,29,69,80,43,78,53,37,71,67,41,16,66,77,69,74,50,11,37,80,5,60,5,56,85,9,92},new int[]{92,36,57,21,48,29,77,51,52,74,68,1,18,60,70,47,98,75,81,17,12,74,1,52,50,21,30,24,17,56,29,65,18},new int[]{63,47,21,28,54,39,53,42,30,59,74,9,14,66,94,45,27,44,43,98,60,57,1,65,35,19,35,58,27,38,82,96,96},new int[]{29,64,7,9,34,80,65,45,40,56,95,7,32,36,9,70,83,73,92,73,20,19,65,27,87,2,88,64,48,71,20,57,11},new int[]{85,39,35,38,44,69,64,28,47,77,38,4,84,50,54,72,62,33,31,60,68,37,80,62,74,96,81,17,64,11,91,85,64},new int[]{45,96,40,46,4,53,91,75,80,53,8,29,93,10,11,48,15,96,80,13,47,23,81,23,41,59,28,37,6,16,46,49,89},new int[]{1,59,53,1,36,70,18,90,6,18,15,1,74,7,57,87,54,92,8,41,47,60,60,18,77,5,79,47,83,23,9,42,55},new int[]{45,22,54,33,86,86,2,52,34,74,17,40,78,5,77,8,52,13,8,24,27,97,9,8,28,91,74,98,99,8,18,12,85},new int[]{43,68,81,7,74,86,13,75,46,95,62,39,98,22,51,53,46,62,25,90,54,5,26,45,31,84,95,63,11,27,2,43,7},new int[]{20,68,7,65,20,49,16,59,39,68,20,43,2,37,39,14,90,45,94,31,68,94,88,72,80,95,1,88,19,93,21,71,27},new int[]{41,67,5,99,99,88,90,4,31,54,22,28,1,27,2,46,94,37,21,43,21,4,44,74,72,49,39,58,91,76,39,70,43},new int[]{23,23,33,86,60,69,14,39,49,89,1,32,65,67,62,63,16,70,59,20,53,50,8,93,52,75,77,20,16,13,92,16,18},new int[]{97,3,56,96,41,64,6,95,92,95,30,15,1,13,55,68,88,8,99,55,81,9,87,46,93,83,54,51,32,52,62,54,41},new int[]{81,13,63,13,67,97,51,72,40,49,87,12,24,92,46,46,45,38,95,67,51,51,88,62,71,66,32,57,23,27,21,13,52},new int[]{6,91,35,9,74,55,71,71,28,63,89,65,95,45,26,47,64,27,88,10,42,45,14,27,32,93,95,64,14,88,53,30,41},new int[]{55,51,89,7,37,36,89,43,26,78,33,2,21,94,58,40,95,46,68,89,38,75,97,58,78,12,6,57,18,3,96,61,17},new int[]{56,24,53,35,66,26,30,60,27,57,82,78,84,84,94,31,48,59,33,27,54,33,20,67,46,19,71,91,70,29,26,17,66},new int[]{85,48,88,33,78,98,69,3,81,70,80,66,84,61,48,17,8,25,8,29,82,59,62,1,58,71,74,86,8,94,15,22,79},new int[]{43,32,57,81,97,19,68,26,21,12,12,44,10,81,42,92,44,58,10,11,2,5,33,1,86,46,85,40,13,16,44,70,42},new int[]{31,28,33,90,54,30,46,18,1,95,73,79,87,16,87,39,92,26,85,75,42,56,11,78,50,6,63,77,46,77,45,35,83}}); param0.add(new int[][]{new int[]{-82,-82,-76,-74,-72,-70,-70,-68,-66,-56,-56,-50,-48,-44,-42,-38,-36,-32,-26,-20,-20,-18,-8,6,8,12,12,14,18,20,24,24,30,32,36,38,40,44,50,56,60,62,66,70,76,78,90,98,98},new int[]{-92,-80,-76,-70,-58,-58,-50,-48,-38,-36,-34,-32,-30,-30,-24,-20,-20,-18,-10,-10,-8,-6,-6,-6,-4,2,10,14,24,26,30,34,36,44,52,54,64,76,78,82,86,86,86,86,86,88,88,92,94},new int[]{-98,-94,-86,-82,-80,-76,-74,-74,-72,-70,-70,-68,-66,-62,-50,-50,-48,-42,-34,-24,-22,-22,2,8,8,10,12,22,22,26,26,26,30,38,44,54,56,58,68,68,72,78,80,80,84,88,92,94,98},new int[]{-92,-88,-84,-84,-82,-78,-78,-66,-60,-48,-48,-46,-42,-40,-40,-38,-36,-34,-30,-30,-26,-26,-22,-22,-20,-14,-12,6,28,36,38,44,46,46,48,50,52,52,56,58,60,70,80,80,80,86,92,96,98},new int[]{-98,-94,-80,-76,-72,-70,-70,-70,-68,-64,-64,-62,-60,-56,-54,-52,-50,-48,-46,-42,-40,-30,-28,-28,-24,-22,-6,-4,0,2,10,12,18,18,32,36,58,60,68,70,72,74,80,84,86,88,88,94,98},new int[]{-96,-96,-86,-84,-84,-72,-72,-70,-70,-66,-64,-60,-58,-58,-46,-38,-38,-28,-22,-18,-14,16,18,20,20,24,24,26,32,32,34,40,42,42,44,44,46,56,58,60,62,64,66,68,68,68,74,78,86},new int[]{-98,-92,-70,-58,-54,-50,-50,-50,-46,-40,-40,-36,-34,-24,-22,-22,-18,-8,-6,-6,-2,2,2,10,16,16,20,22,24,26,28,28,30,32,38,40,42,48,56,56,58,60,66,66,72,84,90,94,96},new int[]{-98,-90,-82,-80,-78,-78,-70,-66,-60,-54,-48,-48,-38,-28,-18,-16,-14,-12,-12,-10,-8,-4,-4,-4,-2,0,2,6,6,12,16,18,20,24,36,46,52,54,60,62,66,66,70,70,82,82,86,86,88},new int[]{-98,-90,-88,-86,-78,-76,-76,-70,-66,-60,-56,-56,-56,-54,-52,-46,-40,-28,-26,-22,-20,-20,-18,-14,-12,-8,0,18,18,28,34,36,36,36,38,46,50,54,56,56,60,66,70,72,74,74,80,80,82},new int[]{-98,-92,-90,-86,-84,-82,-78,-70,-66,-60,-58,-44,-42,-34,-32,-30,-24,-20,-16,-8,-4,8,8,14,14,14,14,20,20,32,38,42,52,62,62,66,68,70,72,72,78,78,78,78,84,96,98,98,98},new int[]{-90,-88,-82,-82,-82,-80,-74,-68,-68,-64,-58,-56,-54,-50,-42,-36,-32,-28,-20,-20,-20,-18,-16,-14,-6,-6,-2,6,8,10,20,24,26,32,38,44,46,48,56,56,58,60,64,68,74,80,88,92,96},new int[]{-96,-94,-88,-72,-72,-72,-70,-70,-64,-52,-46,-46,-44,-38,-34,-34,-28,-26,-20,-16,-14,-10,-8,-2,-2,2,6,8,10,30,34,34,36,44,52,58,60,70,72,72,74,76,76,80,90,92,92,94,98},new int[]{-98,-98,-96,-96,-84,-82,-80,-76,-62,-52,-46,-44,-44,-40,-38,-38,-36,-30,-22,-8,-4,-2,0,2,4,8,12,20,22,26,26,30,34,46,46,52,54,56,58,60,62,66,72,74,78,80,90,92,96},new int[]{-94,-94,-92,-92,-80,-80,-74,-64,-56,-54,-52,-50,-50,-42,-42,-42,-40,-36,-36,-32,-24,-16,-14,-4,0,2,4,10,12,16,22,24,26,28,28,30,40,46,48,56,58,62,62,62,80,88,88,96,98},new int[]{-96,-94,-94,-92,-84,-82,-80,-74,-70,-58,-54,-52,-52,-48,-44,-34,-34,-30,-28,-24,-14,-12,-4,-2,2,2,4,10,12,14,24,28,38,40,46,58,62,68,72,72,74,76,82,84,84,84,84,90,98},new int[]{-98,-90,-84,-82,-76,-70,-66,-62,-60,-60,-58,-56,-54,-54,-50,-50,-46,-40,-40,-38,-32,-24,-22,-22,-20,-12,-12,-8,6,6,8,8,8,22,26,40,42,50,50,50,50,56,64,86,92,92,94,94,96},new int[]{-92,-78,-74,-68,-66,-62,-62,-62,-60,-60,-54,-40,-36,-34,-34,-32,-22,-22,-18,-14,-12,-10,-6,-4,-2,0,12,14,18,28,32,32,38,44,48,50,52,52,60,64,66,66,82,86,90,90,94,94,96},new int[]{-96,-94,-92,-90,-88,-86,-84,-76,-74,-72,-72,-68,-66,-66,-58,-52,-50,-46,-42,-34,-32,-32,-30,-14,-10,-6,-6,-2,-2,10,14,20,30,30,34,36,36,38,38,42,44,50,52,64,68,82,90,90,98},new int[]{-98,-88,-82,-80,-80,-78,-76,-72,-70,-66,-66,-58,-56,-52,-52,-50,-50,-44,-42,-42,-32,-32,-30,-26,-22,-20,-20,-2,0,10,12,18,20,24,24,26,36,38,42,56,66,74,76,78,78,84,86,96,98},new int[]{-94,-94,-94,-80,-76,-74,-68,-56,-52,-50,-44,-42,-38,-36,-34,-28,-26,-24,-16,-2,0,4,8,14,16,20,22,32,34,38,46,46,48,50,52,54,62,64,66,66,72,76,78,78,80,82,82,84,94},new int[]{-98,-98,-90,-86,-80,-78,-76,-74,-74,-72,-72,-60,-58,-54,-50,-46,-32,-24,-22,-18,-18,-14,-12,-12,-10,-8,8,14,24,30,36,46,48,50,58,58,62,66,66,74,74,74,78,78,80,84,86,90,92},new int[]{-98,-94,-82,-80,-72,-64,-60,-58,-48,-46,-46,-40,-32,-26,-24,-16,-14,-12,-10,-8,-6,-4,-4,2,4,4,12,12,14,26,34,36,40,46,48,54,66,66,66,66,66,72,78,80,80,80,94,96,98},new int[]{-96,-92,-86,-72,-70,-70,-68,-68,-66,-64,-62,-56,-50,-44,-32,-30,-28,-24,-12,-4,-4,-4,2,10,16,18,18,22,32,32,36,36,40,42,46,46,50,50,50,50,52,54,64,68,70,72,74,90,96},new int[]{-98,-98,-98,-90,-86,-82,-64,-60,-58,-54,-48,-36,-36,-32,-30,-28,-18,-16,-14,-6,-2,4,6,6,10,12,14,18,24,32,34,46,48,50,52,58,66,68,70,80,80,82,84,84,86,92,94,96,98},new int[]{-98,-96,-88,-86,-86,-86,-86,-86,-84,-78,-78,-74,-72,-72,-70,-70,-70,-66,-64,-56,-42,-40,-38,-36,-34,-32,-30,-28,-26,-20,-8,-6,0,2,2,14,24,30,34,36,44,50,52,60,66,68,74,78,86},new int[]{-96,-86,-72,-72,-70,-70,-68,-68,-64,-58,-58,-58,-54,-54,-52,-48,-46,-40,-38,-28,-14,-10,-6,-4,0,10,10,12,16,18,18,20,20,22,34,34,40,40,46,46,58,58,62,66,68,68,72,84,92},new int[]{-96,-90,-88,-88,-82,-82,-76,-74,-70,-68,-62,-56,-52,-48,-46,-38,-22,-22,-16,-12,-8,0,4,8,14,20,22,24,28,34,36,38,44,46,48,58,66,68,68,76,84,84,86,86,88,88,90,92,94},new int[]{-96,-96,-96,-94,-90,-88,-88,-84,-76,-72,-72,-58,-54,-52,-52,-50,-40,-38,-32,-12,-12,-6,-4,-2,0,2,2,10,12,22,28,28,30,34,42,42,54,56,58,64,70,70,74,74,84,86,88,88,90},new int[]{-94,-92,-84,-82,-82,-70,-66,-64,-60,-60,-58,-58,-54,-52,-52,-42,-36,-32,-30,-28,-26,-24,-22,-20,-16,-12,0,4,6,8,14,20,30,32,46,54,60,62,62,64,66,68,68,70,70,72,72,76,88},new int[]{-90,-90,-90,-88,-88,-86,-78,-68,-62,-62,-60,-54,-54,-48,-48,-36,-36,-32,-28,-28,-22,-20,-6,-2,4,6,8,10,14,24,28,28,28,34,34,36,44,52,54,54,66,70,70,72,78,80,84,88,88},new int[]{-98,-94,-94,-90,-84,-76,-72,-70,-68,-68,-60,-54,-54,-48,-46,-46,-44,-34,-28,-28,-26,-12,-8,-4,2,6,6,8,14,32,32,38,38,40,44,46,46,50,50,52,54,58,60,62,70,78,86,92,92},new int[]{-98,-94,-94,-92,-90,-86,-82,-76,-74,-74,-66,-66,-66,-60,-60,-60,-56,-54,-50,-38,-30,-28,-18,-16,-16,-2,0,6,14,16,16,18,28,30,30,32,34,40,46,52,52,54,60,70,82,84,88,90,94},new int[]{-96,-88,-84,-80,-78,-78,-78,-68,-62,-60,-52,-44,-36,-36,-36,-34,-32,-32,-30,-26,-22,-14,-10,-6,-4,-4,0,0,0,10,12,14,14,16,24,34,38,44,52,54,54,56,58,60,64,66,66,92,98},new int[]{-98,-88,-80,-80,-74,-72,-70,-68,-64,-62,-62,-62,-58,-56,-52,-50,-50,-46,-34,-30,-30,-26,-18,-12,4,10,14,22,24,30,32,38,42,42,46,56,56,58,68,72,80,82,86,90,90,92,96,98,98},new int[]{-96,-92,-92,-90,-90,-90,-88,-82,-82,-82,-80,-68,-64,-60,-50,-34,-30,-16,-10,-10,-8,-4,-4,-2,0,18,20,24,24,24,30,30,36,38,38,40,42,42,44,48,52,52,56,76,84,88,92,94,98},new int[]{-98,-90,-82,-80,-74,-74,-72,-72,-72,-72,-64,-60,-56,-56,-56,-52,-40,-38,-24,-20,-18,-18,-12,-10,-6,10,18,22,24,24,26,26,30,34,40,40,44,50,58,60,62,64,70,76,80,80,86,88,96},new int[]{-96,-94,-86,-82,-72,-68,-68,-64,-62,-56,-54,-50,-50,-48,-44,-26,-20,-16,-10,-8,-6,6,8,10,10,10,16,20,28,28,32,40,42,44,44,46,46,48,58,62,72,76,80,84,86,88,92,96,98},new int[]{-96,-94,-94,-94,-92,-92,-90,-84,-82,-78,-76,-74,-74,-62,-58,-58,-58,-42,-42,-22,-20,-14,-14,-12,-4,-2,4,4,4,8,16,20,24,26,32,40,42,46,52,54,56,56,60,60,62,62,82,90,96},new int[]{-98,-96,-96,-76,-70,-66,-54,-54,-52,-50,-46,-40,-36,-34,-32,-30,-28,-28,-26,-26,-22,-20,-18,-6,6,10,20,22,28,30,30,32,32,34,38,42,46,54,58,70,76,76,84,90,94,94,98,98,98},new int[]{-90,-86,-82,-72,-70,-70,-66,-62,-60,-58,-54,-54,-40,-36,-32,-30,-28,-26,-26,-24,-16,-14,-10,-8,-8,-8,-8,4,6,8,14,16,18,18,22,26,30,58,66,82,84,92,92,94,96,96,96,96,98},new int[]{-92,-86,-80,-74,-68,-66,-64,-64,-52,-44,-36,-34,-32,-30,-26,-22,-20,-18,-14,-12,-8,2,10,10,12,16,24,32,32,44,46,48,52,52,54,66,68,70,72,74,82,84,88,90,94,94,96,96,96},new int[]{-92,-90,-80,-78,-78,-78,-74,-66,-50,-50,-46,-46,-44,-44,-40,-38,-34,-32,-32,-30,-18,-18,-16,-14,-12,4,10,10,10,18,20,20,22,24,24,26,26,46,46,48,48,52,58,62,64,72,80,96,96},new int[]{-98,-96,-94,-92,-88,-86,-84,-82,-76,-76,-60,-58,-58,-58,-56,-50,-48,-38,-34,-30,-20,-16,-16,-10,-4,-2,10,12,18,26,32,34,48,48,52,64,64,68,70,74,76,78,80,90,92,92,92,94,96},new int[]{-96,-88,-88,-82,-76,-70,-62,-58,-56,-48,-48,-38,-36,-30,-18,-18,-16,-16,-14,-12,-6,4,8,10,10,12,14,24,28,28,34,38,44,50,58,60,62,66,66,72,74,76,76,78,78,84,86,88,96},new int[]{-98,-94,-94,-94,-90,-86,-78,-74,-68,-66,-62,-58,-56,-54,-52,-52,-48,-44,-44,-44,-30,-26,-26,-12,-4,2,4,4,6,6,12,12,14,16,16,22,22,30,30,34,36,42,50,50,64,70,80,88,98},new int[]{-98,-96,-96,-94,-88,-84,-58,-56,-52,-48,-44,-30,-26,-26,-20,-18,-16,-8,-8,-8,-6,-6,-4,-4,-2,0,6,12,12,14,24,34,42,46,48,56,60,62,62,72,72,80,84,88,88,90,90,94,96},new int[]{-98,-90,-82,-78,-70,-68,-64,-62,-56,-52,-50,-44,-44,-42,-36,-26,-24,-22,-12,-10,-6,-4,0,2,6,10,18,32,32,36,38,42,48,52,54,56,62,64,66,66,66,66,70,72,74,74,78,86,92},new int[]{-96,-90,-88,-78,-74,-72,-70,-68,-66,-60,-58,-56,-56,-50,-50,-44,-36,-26,-24,-18,-16,-16,-12,-6,2,6,8,10,10,18,18,22,24,26,42,46,64,64,66,72,74,74,76,88,94,94,96,98,98},new int[]{-94,-82,-78,-78,-76,-64,-64,-58,-58,-56,-56,-52,-44,-42,-38,-36,-22,-16,-14,-6,-2,4,4,8,8,12,14,14,14,16,16,22,30,34,38,42,44,58,62,66,66,68,76,78,80,80,84,90,98}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0,0,0,1,0,0,0,0},new int[]{0,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,0,0,0},new int[]{0,0,1,0,0,1,1,1,0,0,1,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,1,0,1,0,0,1,0,0,1,0,1,1,0},new int[]{0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,1,0,1,1,1,1,0,1,0,1,0,1,0,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,0},new int[]{0,1,0,1,1,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,0,1,1,0,1,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,1,0,1,0,0},new int[]{0,0,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,0,1,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,0,0,0},new int[]{1,1,0,1,0,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,1,0,1,1,0,0},new int[]{0,1,1,1,1,0,1,1,1,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,1},new int[]{1,1,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0,0,1,1,1,0,0,1,1,0,0,0,1},new int[]{0,0,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,0,1},new int[]{0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,0,1,1,1,1,0,0,0},new int[]{1,1,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,1,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0},new int[]{1,0,1,0,0,1,0,0,0,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1,0,1,0},new int[]{0,0,1,0,0,1,1,0,0,1,1,0,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,1,0,0,1,1,0,1,0,1,0,1},new int[]{1,1,0,1,1,0,1,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,1,0,0,1,1},new int[]{0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,1,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,0,0,1,1},new int[]{1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,0,1,0},new int[]{1,1,1,0,0,0,1,1,0,0,1,0,1,0,0,0,0,0,0,1,0,1,0,0,0,1,1,1,1,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,0,1},new int[]{0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,1,0,0},new int[]{1,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,1,0,1,1,1,1,1,1,1,0,1,0,1,0,1,1,1,0,0,1,1,1,1,1,0},new int[]{1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1,0},new int[]{1,1,0,0,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,0},new int[]{1,0,1,1,0,1,1,0,0,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1},new int[]{1,0,1,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,1,0,0,1,1,1,0},new int[]{1,1,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,0,0,0,1,1,1,0,1,0,0,1,0,0,1,0,1,1,0,0,0,0,0,0,1,0,1,1,0},new int[]{0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,0,1,0,0,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,0},new int[]{0,1,0,1,1,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0},new int[]{1,1,0,0,1,0,0,1,1,0,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,0,0,1,1,1,1,0,1,1,0},new int[]{1,1,1,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,1},new int[]{1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,0},new int[]{1,1,1,1,1,0,0,1,1,0,1,1,0,1,1,1,0,0,1,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,0,0,0,0,1,1,0,1,1,1},new int[]{0,1,1,0,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,1,0,1,0,0,0,0,0},new int[]{0,1,0,0,0,1,0,0,1,0,1,1,0,0,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,0,0,1,0,0,1},new int[]{1,1,0,0,0,0,0,0,1,0,1,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,1,1,0,0,1,0,0,0,1,1},new int[]{0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,1,1,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,1,0,1,0,0,1,1,0,0,1,1,0},new int[]{0,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,0,0,0,0,1,1,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,0,0,1,1,0,0,1,0},new int[]{0,1,1,1,0,0,0,0,0,0,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,1,0,1,1,1,1},new int[]{1,0,1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,1,0,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,0,1,1,1,0,0,0,1,0,1},new int[]{1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,1,1,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,1},new int[]{0,0,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1,1,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,0},new int[]{1,1,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,1,0,0,0,0,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0},new int[]{0,0,1,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,1,1,1,0,1,1,0,1,1},new int[]{0,0,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0,0,1,0,1,1,0,1},new int[]{0,1,1,1,0,0,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0,0,1},new int[]{0,0,0,0,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1},new int[]{0,0,1,1,1,1,0,1,0,1,1,0,1,1,0,0,0,1,1,1,0,1,0,0,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0,1}}); param0.add(new int[][]{new int[]{13,16,26,38,44,71,73},new int[]{16,28,39,47,48,59,61},new int[]{15,30,50,59,60,89,90},new int[]{24,61,63,71,72,76,83},new int[]{14,36,39,42,64,76,77},new int[]{4,6,11,24,34,36,58},new int[]{22,35,63,70,81,91,98}}); param0.add(new int[][]{new int[]{-48,-22,-52,-86,-22},new int[]{-54,-6,-16,-84,-34},new int[]{-46,-16,-80,-82,-38},new int[]{-44,98,-54,-32,-88},new int[]{42,52,38,-20,-36}}); param0.add(new int[][]{new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1}}); param0.add(new int[][]{new int[]{62,15,2,68,63,42,57,46,37,30,1,51,47,75,50,24,48,56,93,9,50,79,58,74,81,64,63,60,49,24,46,55,89,10,49,46,17,86,24,51,69,21,16,97,66,14},new int[]{95,91,93,6,64,52,1,29,77,42,16,76,40,30,32,7,36,72,1,94,12,25,11,75,52,95,64,4,54,78,40,67,81,92,5,42,65,94,59,12,35,75,82,83,72,47},new int[]{69,96,79,34,12,8,27,58,49,56,43,17,26,87,1,19,99,48,80,25,56,40,42,63,92,27,76,55,15,2,30,81,79,4,15,52,21,94,80,27,93,33,44,20,45,34},new int[]{18,47,49,73,19,87,86,72,52,21,36,27,96,2,87,35,22,20,97,92,69,13,15,95,80,58,84,66,56,12,57,36,90,25,14,43,43,80,2,53,42,65,52,42,5,48},new int[]{85,40,51,5,9,71,80,70,2,18,87,36,78,90,57,60,27,92,15,64,47,22,99,53,87,28,97,94,28,83,64,10,10,34,30,90,17,87,31,7,29,68,29,69,47,35},new int[]{15,32,84,9,45,6,37,97,12,69,91,45,39,58,49,85,76,2,48,71,81,88,16,71,49,32,68,5,23,65,93,47,88,59,43,43,36,59,52,77,1,25,36,86,26,42},new int[]{39,15,66,15,13,29,80,10,75,3,21,65,41,19,76,82,64,55,63,46,24,94,40,75,24,20,2,86,90,24,53,70,65,90,45,70,96,98,68,60,12,31,27,57,63,17},new int[]{79,58,4,37,50,72,71,69,45,86,47,25,98,59,63,16,13,97,66,2,8,13,4,54,96,1,80,3,35,15,62,20,74,58,80,65,85,37,74,6,93,29,10,19,80,61},new int[]{53,59,23,20,92,20,65,17,71,81,41,50,37,86,75,62,21,49,59,34,56,94,41,71,70,94,44,6,25,19,37,3,13,39,86,98,19,30,52,26,35,25,65,74,9,69},new int[]{15,92,20,89,35,8,50,32,17,2,21,64,76,26,9,49,25,63,17,51,58,1,97,3,28,80,11,89,23,86,9,27,5,52,31,62,77,63,86,41,59,19,28,78,6,63},new int[]{76,97,67,74,17,13,95,60,16,63,87,95,84,66,82,69,80,44,54,32,29,37,47,62,78,79,45,10,63,11,20,53,95,72,40,75,89,81,1,37,56,15,85,93,84,9},new int[]{72,60,72,79,28,8,48,76,89,84,89,46,42,83,65,90,71,93,64,50,55,88,66,29,6,6,47,99,61,98,24,57,4,83,56,56,46,21,46,33,78,85,15,28,80,33},new int[]{49,8,68,50,35,16,35,44,22,80,94,48,98,13,43,79,28,68,15,99,5,27,62,63,85,66,55,31,44,48,73,58,71,50,94,22,19,79,76,13,97,27,91,19,47,12},new int[]{52,75,69,55,13,16,39,7,82,28,77,88,84,98,47,21,21,43,40,92,82,92,33,94,3,21,42,47,89,40,59,78,13,97,62,96,74,69,95,73,90,11,67,10,48,47},new int[]{37,21,84,6,27,11,42,18,62,58,81,7,9,71,77,38,69,12,16,61,2,44,81,71,2,99,22,38,30,51,39,11,62,73,95,74,13,87,33,17,23,8,90,45,36,73},new int[]{80,14,37,80,75,12,38,69,25,91,72,14,3,36,97,93,61,20,22,9,56,89,37,99,9,50,59,95,67,25,48,36,91,66,48,61,71,13,50,54,51,29,58,48,14,19},new int[]{64,64,97,27,3,7,54,36,57,24,82,5,83,49,78,87,87,93,70,62,68,26,40,84,82,76,98,27,41,71,23,56,3,46,85,39,62,92,73,74,16,79,40,24,91,63},new int[]{88,29,39,88,15,76,44,40,66,67,26,9,61,5,24,71,8,56,35,89,71,12,72,54,26,84,57,58,46,73,92,24,20,59,70,86,84,15,98,51,29,15,74,7,19,64},new int[]{14,46,80,84,53,57,50,32,23,48,35,83,89,10,67,51,96,63,84,18,6,41,48,79,66,17,17,45,51,7,65,79,29,34,92,17,45,36,2,36,66,30,65,4,55,61},new int[]{23,37,69,52,89,17,78,39,81,83,94,61,33,11,46,34,27,35,55,1,22,99,91,24,56,28,70,88,23,48,77,57,57,72,69,79,95,58,37,68,17,66,11,82,97,20},new int[]{24,46,12,76,76,15,6,97,22,95,83,52,69,59,17,24,54,85,60,41,2,84,71,76,71,27,36,54,79,32,66,65,27,15,39,30,38,58,6,66,73,31,73,74,64,51},new int[]{71,37,75,62,93,88,55,77,22,54,67,34,50,89,66,77,17,54,1,53,83,3,74,37,41,38,48,39,25,46,72,61,70,77,7,58,5,77,60,64,95,22,81,95,53,14},new int[]{52,25,79,20,16,26,40,49,23,82,56,61,40,89,99,58,90,17,22,20,1,14,5,99,34,63,71,7,51,56,8,3,8,39,45,90,97,24,45,77,51,57,41,59,47,15},new int[]{98,5,15,87,54,20,2,88,73,98,90,4,79,94,74,26,3,91,65,28,25,93,61,63,3,97,15,40,1,79,88,71,15,55,94,93,38,56,10,41,68,28,85,74,71,19},new int[]{10,27,56,25,36,22,54,74,28,72,53,19,66,49,49,56,94,55,24,82,54,66,1,7,37,45,49,85,34,51,91,74,64,28,87,81,39,42,93,60,43,10,85,12,7,62},new int[]{73,51,16,10,70,67,50,75,37,60,45,31,57,94,44,51,23,74,16,79,78,57,63,90,28,24,63,5,61,2,20,86,57,46,42,5,34,72,35,68,37,6,19,15,48,93},new int[]{70,43,61,32,77,46,11,98,66,70,44,73,51,53,55,69,54,3,65,25,75,37,47,44,78,78,3,98,73,71,34,54,80,69,20,35,1,27,42,18,93,96,60,9,80,57},new int[]{2,31,55,74,66,86,59,31,40,18,55,86,79,74,45,19,83,26,24,28,15,34,34,28,66,68,94,87,19,66,67,48,38,39,67,75,23,28,23,10,65,75,50,23,85,55},new int[]{91,22,56,89,33,23,8,81,56,97,2,88,94,38,61,8,56,85,68,31,99,30,75,61,23,68,10,95,53,57,55,42,48,97,23,40,61,99,30,54,18,66,83,58,6,35},new int[]{46,84,95,99,63,16,14,13,55,83,6,77,77,40,1,85,53,14,66,46,99,67,42,55,11,27,40,38,81,54,80,3,52,77,5,22,75,50,95,54,88,27,1,85,6,60},new int[]{38,32,53,70,13,71,48,20,37,38,25,23,58,93,34,66,47,71,50,64,11,60,45,49,57,25,42,75,78,97,58,31,83,60,53,72,45,71,22,43,79,1,81,8,62,39},new int[]{53,8,61,2,80,52,70,9,47,23,87,99,41,89,23,54,5,50,50,96,51,30,41,93,90,77,30,4,63,52,89,30,72,96,75,55,74,12,67,62,3,38,53,62,80,80},new int[]{88,65,51,42,27,28,91,20,8,18,46,12,36,12,41,29,31,18,27,84,84,83,96,70,2,3,40,53,1,39,16,29,8,23,38,71,89,87,92,83,83,57,3,64,62,51},new int[]{76,38,28,18,53,19,90,48,7,74,89,6,10,5,29,51,59,32,33,66,4,90,39,9,90,77,35,48,29,58,35,14,72,89,17,75,45,8,54,58,40,65,6,90,26,47},new int[]{93,31,76,38,69,20,19,44,28,53,95,64,50,11,27,64,77,18,24,1,46,8,77,72,48,14,87,28,54,9,63,68,67,59,37,20,17,74,6,30,49,65,50,80,75,77},new int[]{76,40,73,71,21,7,8,38,60,4,40,32,18,36,82,31,29,74,73,19,51,98,46,74,98,53,24,66,7,14,71,95,4,86,60,14,80,28,34,18,49,68,76,55,72,35},new int[]{66,6,48,50,62,34,10,41,14,93,60,58,8,51,31,89,42,67,29,75,90,98,58,4,87,82,29,27,38,13,70,4,40,30,81,29,57,61,90,10,82,36,9,32,45,87},new int[]{76,45,58,23,90,81,1,48,12,36,90,35,36,83,19,6,17,6,90,88,26,12,53,49,23,13,52,17,30,92,22,83,64,1,82,71,67,30,54,67,64,93,93,8,45,71},new int[]{65,37,45,41,91,59,22,56,29,22,12,44,56,7,73,87,77,98,9,38,37,62,86,66,53,64,73,86,8,20,8,3,46,51,11,53,50,57,26,93,80,41,34,70,82,82},new int[]{77,1,52,73,66,59,96,50,60,63,38,44,26,95,62,99,37,34,8,44,31,10,82,75,82,92,54,61,3,52,55,7,48,22,43,71,50,96,27,56,44,66,48,25,27,22},new int[]{5,86,67,70,46,7,43,52,7,19,85,27,99,55,1,48,16,41,2,47,59,51,21,19,80,80,8,41,51,75,74,49,54,48,73,15,69,24,96,19,97,23,28,90,60,50},new int[]{76,65,97,12,56,95,81,27,85,46,42,56,77,90,55,6,91,41,81,93,62,83,56,21,31,28,10,28,47,92,29,85,9,30,94,62,88,86,52,16,30,50,47,1,51,11},new int[]{83,14,96,9,59,84,27,94,5,20,93,58,99,71,9,5,78,38,97,97,42,88,50,51,28,64,62,32,22,50,18,57,12,61,86,72,35,53,64,42,90,32,46,84,82,65},new int[]{28,99,16,15,46,15,57,32,82,90,2,29,28,8,41,33,74,61,87,64,7,51,79,30,70,33,88,9,24,7,61,22,5,12,37,19,91,38,55,23,54,62,82,8,44,73},new int[]{30,77,76,3,41,88,95,36,78,76,33,86,54,38,92,36,65,99,67,8,72,33,71,88,8,63,43,89,57,6,20,74,52,50,61,66,52,3,3,60,28,6,90,51,60,15},new int[]{32,86,94,46,87,40,20,75,67,86,63,63,48,42,81,69,30,11,45,18,58,68,58,79,95,51,81,1,88,58,49,75,89,60,52,24,80,70,47,17,45,94,69,17,11,97}}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{31,50,50,68,69,80,87}); param1.add(new int[]{-74,-50,-90,-52,96,78,-16,14,-14,66,-50,74,-34,-88,84,80,34,18,-38,62,56,-48,-22,94,94,94,92,-46,-32,10,-48,46,20,80,32,30,88,60}); param1.add(new int[]{0,0,0,0,0,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}); param1.add(new int[]{23,36,42,49,50,88,97,51,1,27,4,72,11,61,24,49,75,29,96,16,11,65,13,22,13,23,84,23,20,63,35,76,22}); param1.add(new int[]{-96,-90,-90,-86,-86,-86,-84,-76,-76,-74,-72,-70,-52,-50,-34,-32,-26,-20,-16,-14,-10,-8,-8,-6,4,12,14,16,18,24,26,32,34,38,42,42,48,48,48,48,64,66,70,76,76,82,86,86,96}); param1.add(new int[]{0,1,1,1,1,0,1,1,1,0,0,0,0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,1,1,0,1,1,0,0,0}); param1.add(new int[]{3,9,32,55,78,85,90}); param1.add(new int[]{48,-68,0,-54,-80}); param1.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1}); param1.add(new int[]{19,39,31,50,61,70,43,64,45,82,49,80,21,37,96,30,42,82,96,30,22,26,42,88,57,12,59,58,83,64,66,2,37,60,5,76,20,81,10,57,70,74,65,72,15,84}); List<Integer> param2 = new ArrayList<>(); param2.add(6); param2.add(25); param2.add(28); param2.add(25); param2.add(37); param2.add(43); param2.add(5); param2.add(4); param2.add(7); param2.add(34); List<Integer> param3 = new ArrayList<>(); param3.add(5); param3.add(20); param3.add(28); param3.add(30); param3.add(38); param3.add(32); param3.add(3); param3.add(4); param3.add(10); param3.add(25); List<Integer> param4 = new ArrayList<>(); param4.add(4); param4.add(25); param4.add(32); param4.add(19); param4.add(26); param4.add(35); param4.add(3); param4.add(3); param4.add(9); param4.add(32); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
989
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/STEINS_ALGORITHM_FOR_FINDING_GCD.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 STEINS_ALGORITHM_FOR_FINDING_GCD{ static int f_gold ( int a , int b ) { if ( a == 0 ) return b ; if ( b == 0 ) return a ; int k ; for ( k = 0 ; ( ( a | b ) & 1 ) == 0 ; ++ k ) { a >>= 1 ; b >>= 1 ; } while ( ( a & 1 ) == 0 ) a >>= 1 ; do { while ( ( b & 1 ) == 0 ) b >>= 1 ; if ( a > b ) { int temp = a ; a = b ; b = temp ; } b = ( b - a ) ; } while ( b != 0 ) ; return a << k ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(37); param0.add(58); param0.add(89); param0.add(75); param0.add(59); param0.add(84); param0.add(47); param0.add(37); param0.add(83); param0.add(28); List<Integer> param1 = new ArrayList<>(); param1.add(93); param1.add(13); param1.add(27); param1.add(14); param1.add(47); param1.add(39); param1.add(76); param1.add(75); param1.add(62); param1.add(58); 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()); } }
990
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.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_WHETHER_GIVEN_INTEGER_POWER_3_NOT{ static boolean f_gold ( int n ) { return 1162261467 % n == 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(1); param0.add(3); param0.add(27); param0.add(9); param0.add(-9); param0.add(11); param0.add(57); param0.add(21); param0.add(60); param0.add(44); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
991
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L.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 MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L{ static int f_gold ( int [ ] arr , int n ) { if ( n < 4 ) { System . out . println ( "The array should have" + " atleast 4 elements" ) ; } int table1 [ ] = new int [ n + 1 ] ; int table2 [ ] = new int [ n ] ; int table3 [ ] = new int [ n - 1 ] ; int table4 [ ] = new int [ n - 2 ] ; Arrays . fill ( table1 , Integer . MIN_VALUE ) ; Arrays . fill ( table2 , Integer . MIN_VALUE ) ; Arrays . fill ( table3 , Integer . MIN_VALUE ) ; Arrays . fill ( table4 , Integer . MIN_VALUE ) ; for ( int i = n - 1 ; i >= 0 ; i -- ) { table1 [ i ] = Math . max ( table1 [ i + 1 ] , arr [ i ] ) ; } for ( int i = n - 2 ; i >= 0 ; i -- ) { table2 [ i ] = Math . max ( table2 [ i + 1 ] , table1 [ i + 1 ] - arr [ i ] ) ; } for ( int i = n - 3 ; i >= 0 ; i -- ) table3 [ i ] = Math . max ( table3 [ i + 1 ] , table2 [ i + 1 ] + arr [ i ] ) ; for ( int i = n - 4 ; i >= 0 ; i -- ) table4 [ i ] = Math . max ( table4 [ i + 1 ] , table3 [ i + 1 ] - arr [ i ] ) ; return table4 [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{18,27,36,51,67,70,71,72,79,85,86,89,93,94,97}); param0.add(new int[]{4,70,88,90,-34,-4,-36,-38,16,-46,-60,-50,-72,-68,-42,-96,46,32,-80,46,-4,-86,-72,16,40,-74,78,-64,-38}); param0.add(new int[]{0,0,0,0,0,0,1,1,1}); param0.add(new int[]{67,75,6,31,18,44,55,99,83,8}); param0.add(new int[]{-94,-94,-84,-82,-74,-70,-70,-70,-56,-56,-52,-50,-48,-46,-44,-38,-36,-34,-34,-28,-26,-16,-16,0,0,2,2,4,6,10,24,30,32,32,34,36,48,62,64,78,78,84,90,92}); param0.add(new int[]{0,1,0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,1,1,0,1,1}); param0.add(new int[]{1,6,15,20,21,23,24,25,25,40,44,46,59,61,63,68,69,69,72,76,76,79,79,87,88,89,94,94,99}); param0.add(new int[]{8,70,-66,0,-82,-72,64,-88,40,10,24,-20,88}); param0.add(new int[]{0,0,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}); param0.add(new int[]{15,89,48,67,30,95,8,22,41,22,12,18,23,15,33,41,50,77,71,53,11,9,53,42,61,56,25,57,28,48,14,86,95,74,54,70,12,36,1,18,42,35,94,18,54,35,1,95,53}); List<Integer> param1 = new ArrayList<>(); param1.add(9); param1.add(24); param1.add(8); param1.add(9); param1.add(36); param1.add(14); param1.add(16); param1.add(7); param1.add(28); param1.add(37); 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()); } }
992
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS.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 COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS{ static int f_gold ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int count = 1 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++ ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,7,7,11,14,14,14,16,17,17,21,22,24,27,27,27,31,33,35,36,36,37,38,43,45,49,52,54,57,59,59,60,67,73,74,74,74,75,75,79,83,87,90,93,97}); param0.add(new int[]{-28,72,60,62,40,64,50,-36,-24,40,-6,78,-80,-82,2,-30,70,94,-2,-30,92,12,-46,32,-96,-2,36,-40,-42,66,98}); param0.add(new int[]{1,1}); param0.add(new int[]{96,89,24,28,70,78,78,35,98,65,18,81,35,91,33,88,69,52,66,17,73,79,30,33,78,60,42,8,36,6,47,87,8,98,9,77,78,24,86,91,13,79,50,85,3,7,61,94,86}); param0.add(new int[]{-92,-92,-90,-84,-78,-66,-60,-60,-46,-42,-38,-32,-24,-20,-18,-16,-14,-10,0,4,6,12,24,32,34,44,48,50,50,64,66,68,80,84,86,86,88,90,90,90,92,94,96,98,98}); param0.add(new int[]{0,1,1,0,1,0,0,1,0,0,1,0,0,1,1,1,0,1,0,1,1,1,0,1,0,1,0,0,0,1,0,1,1,0,0,1,1,1,1,1,0,1,0,0,0}); param0.add(new int[]{8,12,13,14,16,20,20,21,23,23,24,27,29,29,29,29,35,35,38,39,40,46,50,52,60,62,62,65,65,65,70,71,72,73,75,76,80,81,82,83,85,91,95,97,98,98}); param0.add(new int[]{-84,92,70,-46,26,-94,-82,-26,-90,-62,52,62,-58,44,-14,-6,58,2,10,76,-34,42,-26,80,26,32,-82,38,2,72,68,44,24,84,-32,54,-96,-8,36,80,-82,32,98,-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}); param0.add(new int[]{64,10,6,3,67,95,72,96,72,30,99,21,46,23,48,38,48,50,53,91,59,58,27,95,63,20,27,22,58,3,11,75,77,64,46,1,67,79,6,46,57,79,49,83,21,36,44}); List<Integer> param1 = new ArrayList<>(); param1.add(42); param1.add(24); param1.add(1); param1.add(26); param1.add(42); param1.add(27); param1.add(29); param1.add(25); param1.add(21); param1.add(46); 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()); } }
993
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/EQUILIBRIUM_INDEX_OF_AN_ARRAY.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 EQUILIBRIUM_INDEX_OF_AN_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int i , j ; int leftsum , rightsum ; for ( i = 0 ; i < n ; ++ i ) { leftsum = 0 ; for ( j = 0 ; j < i ; j ++ ) leftsum += arr [ j ] ; rightsum = 0 ; for ( j = i + 1 ; j < n ; j ++ ) rightsum += arr [ j ] ; if ( leftsum == rightsum ) return i ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,6,7,8,15,15,19,23,27,28,29,31,37,40,41,42,50,51,57,58,63,63,64,70,71,72,78,83,85,90,90}); param0.add(new int[]{-68,-92}); param0.add(new int[]{0,0,0,0,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}); param0.add(new int[]{80,74,45,81,62,88,90,54}); param0.add(new int[]{-92,-84,-84,-66,-64,-50,-50,-48,-46,-44,-36,-36,-30,-24,-22,-16,-6,-2,24,48,54,62,66,74,74,80,82,88,98,98}); param0.add(new int[]{0,0,1,1,0,0,1,0,1,0,1,1,0,1,0,0,1,1,0,0,1,1,1,1,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,1,0,0,1,1,1}); param0.add(new int[]{2,6,11,12,14,36,45,49,52,52,58,63,70,73,74,80,82,89,89}); param0.add(new int[]{16,-58,-14,-58,-36,-70,36,-8,-14,-78,-26,42,16,18,0,-44,32,50,-78,58,78,16,-34,-54,50,0,46,-12,52,-74,78,-82,-26,-72,-86,-14,86,40,-8}); param0.add(new int[]{0,0,0,0,0,0,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}); param0.add(new int[]{58,82,79,77,84,79,39,98,53,84,19,9,93,30,6,82,8,43,17,44,62,21,34,86,98,44,81,14,82,54,44,53,36,33,2,68,19,37}); List<Integer> param1 = new ArrayList<>(); param1.add(25); param1.add(1); param1.add(26); param1.add(4); param1.add(27); param1.add(43); param1.add(17); param1.add(26); param1.add(33); 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()); } }
994
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_REPEATING_SUBSEQUENCE.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 LONGEST_REPEATING_SUBSEQUENCE{ static int f_gold ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= n ; j ++ ) { if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; } } return dp [ n ] [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("JxZFz"); param0.add("7648992235770"); param0.add("11100000"); param0.add("cRN SgYjPsctJ"); param0.add("434"); param0.add("1"); param0.add("JRfZIAsbrPBZ"); param0.add("03779368305592"); param0.add("1111000"); param0.add("BkULuIi"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
995
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM.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 FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM{ static int f_gold ( int a , int b ) { int res = 0 ; while ( b > 0 ) { if ( ( b & 1 ) != 0 ) res = res + a ; a = a << 1 ; b = b >> 1 ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(4); param0.add(36); param0.add(65); param0.add(55); param0.add(35); param0.add(69); param0.add(84); param0.add(5); param0.add(15); param0.add(67); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(67); param1.add(52); param1.add(37); param1.add(76); param1.add(98); param1.add(62); param1.add(80); param1.add(36); param1.add(84); 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()); } }
996
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1.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_1{ static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > hmap = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( hmap . containsKey ( arr [ i ] ) ) { int val = hmap . get ( arr [ i ] ) ; hmap . put ( arr [ i ] , val + 1 ) ; } else hmap . put ( arr [ i ] , 1 ) ; } for ( Integer a : hmap . keySet ( ) ) { if ( hmap . get ( a ) % 2 != 0 ) return a ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{49,90}); param0.add(new int[]{-96,94,92,-24,48,54,-30,-86,28,-18,12,-64,-36,68,68,-78,-6,30,-84,20,52,-36,40,-62,90,-48,86,98,12,44,98,-66,52,34,36,76,-50,-20,-20,-20}); param0.add(new int[]{0,1}); param0.add(new int[]{79,55,18,99,38,93,19,49,21,74,16,76,82,52,86,17,42,9,6,63,1,40,75,59,41,81}); param0.add(new int[]{-90,-84,-82,-68,-66,-66,-60,-60,-48,-44,-36,-34,-30,-16,-14,-12,-10,-6,2,10,10,14,22,26,30,34,46,50,52,62,64,64,66,72,74,78,78,82,84,88,92}); param0.add(new int[]{1,1,0,0,1,0,1,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,0,1,0,1}); param0.add(new int[]{2,4,5,7,7,18,18,23,23,25,25,31,41,43,45,46,52,52,55,64,69,69,80,81,84,90,91,93,94,94,94,94,96,98,99}); param0.add(new int[]{86,66,-8,2,-18,-22,38,4,-38,-54,78,64,78,20,-32,84,-70,66,-46,12,-12,8,44,14,20}); param0.add(new int[]{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}); param0.add(new int[]{11,4,98,38,20,41,1,8}); List<Integer> param1 = new ArrayList<>(); param1.add(1); param1.add(39); param1.add(1); param1.add(23); param1.add(23); param1.add(18); param1.add(20); param1.add(20); param1.add(21); param1.add(7); 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()); } }
997
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_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 SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{ static int f_gold ( int n ) { n -- ; n |= n >> 1 ; n |= n >> 2 ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(60); param0.add(20); param0.add(33); param0.add(34); param0.add(68); param0.add(79); param0.add(20); param0.add(41); param0.add(36); param0.add(17); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
998
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D.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_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D{ static int f_gold ( int [ ] S , int n ) { boolean found = false ; Arrays . sort ( S ) ; for ( int i = n - 1 ; i >= 0 ; i -- ) { for ( int j = 0 ; j < n ; j ++ ) { if ( i == j ) continue ; for ( int k = j + 1 ; k < n ; k ++ ) { if ( i == k ) continue ; for ( int l = k + 1 ; l < n ; l ++ ) { if ( i == l ) continue ; if ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) { found = true ; return S [ i ] ; } } } } } if ( found == false ) return Integer . MAX_VALUE ; return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8,12,14,15,16,20,27,28,29,30,35,41,46,51,53,55,55,58,63,64,72,73,75,75,75,82,82,86,89,91,92,94,95,95,97,97,98}); param0.add(new int[]{-62,48,-22,-44,-58,-50,-82,34,26,-2,86,-44,92,-96,42,-20,10,74,-56,-12,-28,-40}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1}); param0.add(new int[]{84,58,10,67,77,66,10,47,65,55,54}); param0.add(new int[]{-46,-28,-20,-18,4,8,18,38,90,90}); param0.add(new int[]{0,1,1,1,0,1,1,0,0,1,1,0,0,0,0,1,1,1,1,0,0,1,0,0,0,0,1,0,1,0,0,1,1,0,1,1,0,0,1,0,0,1,0,1,0}); param0.add(new int[]{11,13,14,21,26,28,36,39,41,42,43,44,49,49,57,58,59,59,63,64,67,69,70,75,78,79,83,83,86,91,92,93,96,96,96,97}); param0.add(new int[]{74,52,-16,34,-88,62,54,46,-82,76,-48,54,50,-66,-18,78,-48,38,96,-32,-82,0,-76,46,-56,4,-30,-70,-62}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{55,74,18,4,68,66,33,61,66,92,21,9,49,14,99,87,74,6,11,25,5,58,56,20}); List<Integer> param1 = new ArrayList<>(); param1.add(24); param1.add(19); param1.add(8); param1.add(5); param1.add(6); param1.add(35); param1.add(30); param1.add(16); param1.add(17); param1.add(23); 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()); } }
999