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/SPLIT_ARRAY_ADD_FIRST_PART_END.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 SPLIT_ARRAY_ADD_FIRST_PART_END{ public static void f_gold ( int arr [ ] , int n , int k ) { for ( int i = 0 ; i < k ; i ++ ) { int x = arr [ 0 ] ; for ( int j = 0 ; j < n - 1 ; ++ j ) arr [ j ] = arr [ j + 1 ] ; arr [ n - 1 ] = x ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{75}); param0.add(new int[]{-58,-60,-38,48,-2,32,-48,-46,90,-54,-18,28,72,86,0,-2,-74,12,-58,90,-30,10,-88,2,-14,82,-82,-46,2,-74}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{45,51,26,36,10,62,62,56,61,67,86,97,31,93,32,1,14,25,24,30,1,44,7,98,56,68,53,59,30,90,79,22}); param0.add(new int[]{-88,-72,-64,-46,-40,-16,-8,0,22,34,44}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,1,0,1,1,0,1,0,1,1,1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,1,0,0,1,1,1,1,0}); param0.add(new int[]{8,17,20,23,31,32,37,37,44,45,48,64,64,67,69,71,75,77,78,81,83,87,89,92,94}); param0.add(new int[]{-8,-88,-68,48,8,50,30,-88,74,-16,6,74,36,32,22,96,-2,70,40,-46,98,34,2,94}); param0.add(new int[]{0,0,0,0,1,1,1,1,1}); param0.add(new int[]{80,14,35,25,60,86,45,95,32,29,94,6,63,66,38}); List<Integer> param1 = new ArrayList<>(); param1.add(0); param1.add(27); param1.add(7); param1.add(23); param1.add(6); param1.add(23); param1.add(21); param1.add(23); param1.add(5); param1.add(9); List<Integer> param2 = new ArrayList<>(); param2.add(0); param2.add(17); param2.add(7); param2.add(24); param2.add(6); param2.add(30); param2.add(20); param2.add(13); param2.add(8); param2.add(7); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{75}); filled_function_param0.add(new int[]{-58,-60,-38,48,-2,32,-48,-46,90,-54,-18,28,72,86,0,-2,-74,12,-58,90,-30,10,-88,2,-14,82,-82,-46,2,-74}); filled_function_param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1}); filled_function_param0.add(new int[]{45,51,26,36,10,62,62,56,61,67,86,97,31,93,32,1,14,25,24,30,1,44,7,98,56,68,53,59,30,90,79,22}); filled_function_param0.add(new int[]{-88,-72,-64,-46,-40,-16,-8,0,22,34,44}); filled_function_param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,1,0,1,1,0,1,0,1,1,1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,1,0,0,1,1,1,1,0}); filled_function_param0.add(new int[]{8,17,20,23,31,32,37,37,44,45,48,64,64,67,69,71,75,77,78,81,83,87,89,92,94}); filled_function_param0.add(new int[]{-8,-88,-68,48,8,50,30,-88,74,-16,6,74,36,32,22,96,-2,70,40,-46,98,34,2,94}); filled_function_param0.add(new int[]{0,0,0,0,1,1,1,1,1}); filled_function_param0.add(new int[]{80,14,35,25,60,86,45,95,32,29,94,6,63,66,38}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(0); filled_function_param1.add(27); filled_function_param1.add(7); filled_function_param1.add(23); filled_function_param1.add(6); filled_function_param1.add(23); filled_function_param1.add(21); filled_function_param1.add(23); filled_function_param1.add(5); filled_function_param1.add(9); List<Integer> filled_function_param2 = new ArrayList<>(); filled_function_param2.add(0); filled_function_param2.add(17); filled_function_param2.add(7); filled_function_param2.add(24); filled_function_param2.add(6); filled_function_param2.add(30); filled_function_param2.add(20); filled_function_param2.add(13); filled_function_param2.add(8); 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)) && 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()); } }
1,500
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/K_TH_LARGEST_SUM_CONTIGUOUS_SUBARRAY.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_LARGEST_SUM_CONTIGUOUS_SUBARRAY{ static int f_gold ( int arr [ ] , int n , int k ) { int sum [ ] = new int [ n + 1 ] ; sum [ 0 ] = 0 ; sum [ 1 ] = arr [ 0 ] ; for ( int i = 2 ; i <= n ; i ++ ) sum [ i ] = sum [ i - 1 ] + arr [ i - 1 ] ; PriorityQueue < Integer > Q = new PriorityQueue < Integer > ( ) ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = i ; j <= n ; j ++ ) { int x = sum [ j ] - sum [ i - 1 ] ; if ( Q . size ( ) < k ) Q . add ( x ) ; else { if ( Q . peek ( ) < x ) { Q . poll ( ) ; Q . add ( x ) ; } } } } return Q . poll ( ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,5,7,8,29,29,44,47,52,60,65,73,83,87,92,92,95}); param0.add(new int[]{44,-98,-10,14,-6,-46,6,-74,-4,36,10,-2,30,28,96,-84,-36,-76,64,-74,-20,94,-4,14,78,52,-56,98,-68,-76,-10,20,88,-98,96,80,96,-32,-40,-30,82}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{58,21,97,78,78,57,29,33,57,81,66,32,11,82,28,72,46,67,42,15,60,45,16,37}); param0.add(new int[]{-92,-90,-88,-84,-68,-66,-62,-58,-52,-44,-22,-16,-4,-4,2,12,14,14,24,26,44,56,80,90,92,94,98}); param0.add(new int[]{1,1,1,1,1,1,1,1,0,0,0}); param0.add(new int[]{3,4,8,12,13,14,17,19,23,24,28,29,30,35,35,38,44,47,47,53,55,56,56,58,66,67,70,71,72,73,74,75,77,78,82,84,87,87,87,88,88,93,94,96}); param0.add(new int[]{20,-58,94,-70,18,16,-46,38,-44,-92,-20,-70,-30,50}); 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}); param0.add(new int[]{90,77,82,38,96,62,66,4,93,30,75,22,26,61,40,11,38,55,88,24,66,47,40,71,21,5,18,31,26,56,19,47,71,34}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(34); param1.add(16); param1.add(14); param1.add(15); param1.add(5); param1.add(26); param1.add(11); param1.add(19); param1.add(28); List<Integer> param2 = new ArrayList<>(); param2.add(12); param2.add(37); param2.add(15); param2.add(20); param2.add(25); param2.add(5); param2.add(25); param2.add(7); param2.add(23); param2.add(32); 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()); } }
1,501
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/TEMPLE_OFFERINGS.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 TEMPLE_OFFERINGS{ static int f_gold ( int n , int templeHeight [ ] ) { int sum = 0 ; for ( int i = 0 ; i < n ; ++ i ) { int left = 0 , right = 0 ; for ( int j = i - 1 ; j >= 0 ; -- j ) { if ( templeHeight [ j ] < templeHeight [ j + 1 ] ) ++ left ; else break ; } for ( int j = i + 1 ; j < n ; ++ j ) { if ( templeHeight [ j ] < templeHeight [ j - 1 ] ) ++ right ; else break ; } sum += Math . max ( right , left ) + 1 ; } return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(12); param0.add(46); param0.add(16); param0.add(9); param0.add(0); param0.add(38); param0.add(28); param0.add(9); param0.add(18); param0.add(29); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{3,11,12,15,16,21,24,29,32,39,42,44,51,68,79,81,81,85,92,94}); param1.add(new int[]{76,48,88,70,-64,66,-6,-58,26,-28,-42,-94,80,-4,-56,-46,4,90,-12,-78,64,18,-38,26,56,-24,66,-18,-12,0,-94,12,-10,4,-68,-20,88,2,-58,16,46,-80,-42,44,-86,96,-44}); 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}); param1.add(new int[]{2,95,20,50,2,58,20,14,65,69,78,7}); param1.add(new int[]{-88}); param1.add(new int[]{0,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,0}); param1.add(new int[]{2,3,6,8,9,10,14,17,17,22,25,27,29,29,30,32,33,35,38,42,50,51,51,57,59,59,59,60,62,62,63,67,70,75,76,77,81,81,83,84}); param1.add(new int[]{-52,62,74,-62,-58,62,38,42,-50,20}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{96,15,9,9,40,34,17,4,51,49,34,66,97,28,64,65,92,56,74,48,43,17,82,8,21,39,83,35,42,37,64,34,42,59,45,61,55,93,94,29,20,96,77,66}); 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()); } }
1,502
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_1S_SORTED_BINARY_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 COUNT_1S_SORTED_BINARY_ARRAY{ static int f_gold ( int arr [ ] , int low , int high ) { if ( high >= low ) { int mid = low + ( high - low ) / 2 ; if ( ( mid == high || arr [ mid + 1 ] == 0 ) && ( arr [ mid ] == 1 ) ) return mid + 1 ; if ( arr [ mid ] == 1 ) return f_gold ( arr , ( mid + 1 ) , high ) ; return f_gold ( arr , low , ( mid - 1 ) ) ; } return 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,21,38,46,89,91}); param0.add(new int[]{-48,46,12,-68,-82,-16,86,32,98,86,44,-86,60,-28,-60,-6,12,88,-82,-84,28,4,64,30,82,94,64,-34,-46,90,60,52,46,-24,10}); param0.add(new int[]{0,0,1,1}); param0.add(new int[]{19,99,62,68,41,32,55,20,1,18,5,73,10,17,7,19,18,51,88,47,36,80,3,75,35,67,7,83,36,70,19,95,15,61,99,88,26}); param0.add(new int[]{-98,-98,-94,-92,-84,-74,-32,-14,0,0,6,36,48,50,52,60,64,68,72,84,86,88,96}); param0.add(new int[]{1,0,0,0,1,1,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,1,1,1,1,0}); param0.add(new int[]{2,4,4,8,9,13,16,16,18,19,20,21,22,26,27,28,29,30,37,40,40,41,48,51,54,54,55,61,66,67,68,74,75,77,77,80,80,81,82,84,84,86,88,90,91,95}); param0.add(new int[]{18,78,96,10,82,66,60,-48,-96,72,-66,72,-6,-84,28,90,-50,70,-6,-30,-20,94,30,-56,-16,-52,-16,76,36,50,70,-22,76,-16,-84,-44,-14,-22,-78,86,-60,-4,-22,76,20,56}); param0.add(new int[]{0}); param0.add(new int[]{38,25,44,82,89,86,5,22}); List<Integer> param1 = new ArrayList<>(); param1.add(3); param1.add(27); param1.add(3); param1.add(33); param1.add(11); param1.add(14); param1.add(29); param1.add(29); param1.add(0); param1.add(5); List<Integer> param2 = new ArrayList<>(); param2.add(3); param2.add(27); param2.add(3); param2.add(28); param2.add(14); param2.add(15); param2.add(36); param2.add(29); param2.add(0); param2.add(5); 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()); } }
1,503
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_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 MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_2{ static int f_gold ( int arr [ ] , int n ) { int [ ] jumps = new int [ n ] ; int min ; jumps [ n - 1 ] = 0 ; for ( int i = n - 2 ; i >= 0 ; i -- ) { if ( arr [ i ] == 0 ) jumps [ i ] = Integer . MAX_VALUE ; else if ( arr [ i ] >= n - i - 1 ) jumps [ i ] = 1 ; else { min = Integer . MAX_VALUE ; for ( int j = i + 1 ; j < n && j <= arr [ i ] + i ; j ++ ) { if ( min > jumps [ j ] ) min = jumps [ j ] ; } if ( min != Integer . MAX_VALUE ) jumps [ i ] = min + 1 ; else jumps [ i ] = min ; } } return jumps [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,6,7,14,22,32,42,42,43,48,54,57,59,69,84,92,98}); param0.add(new int[]{98,-66,-70,-64,-88,-76,-90,16,58,68,-10,-42,-28,10,72,68,-30,60,92,-56,80,-4,-82,30,58,98,-56,98,-14,-38,-20,-74,-46,-22,78,36,-54,-64,80,-10,-26,82,96,-72,-36,-36,-32,-88,0}); 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}); param0.add(new int[]{64,25,63,54,7,43,79,27,34,13,84,80,34,48,5,56,67,2}); param0.add(new int[]{2,28,68}); param0.add(new int[]{1,0,0,0,0,1,1,1,1,0,1,0,0}); param0.add(new int[]{1,1,9,16,17,18,19,20,21,22,25,28,29,29,36,37,40,40,42,48,49,49,55,63,65,66,69,70,72,73,76,77,77,79,79,81,81,93,95,99}); param0.add(new int[]{38,-42,-8,98,-90,38,88,-8,70,-28,-50,-22,28,24,88,-26,58,48,6,0,68,-6,8,54,-2,46,-44,96,-82,-14,-48,-18,-16,-48,-44,-16,-58,-64}); 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[]{98,46,12,55,57,11,25,64,92,35,90,72,95,30,75,67,64,12,31,84,70,96,71,80,62,34,70,10,54}); List<Integer> param1 = new ArrayList<>(); param1.add(11); param1.add(26); param1.add(41); param1.add(10); param1.add(2); param1.add(11); param1.add(24); param1.add(34); param1.add(14); 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()); } }
1,504
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED.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_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED{ static int f_gold ( int [ ] arr , int n ) { int [ ] dp = new int [ n ] ; if ( n == 1 ) return arr [ 0 ] ; if ( n == 2 ) return Math . min ( arr [ 0 ] , arr [ 1 ] ) ; if ( n == 3 ) return Math . min ( arr [ 0 ] , Math . min ( arr [ 1 ] , arr [ 2 ] ) ) ; if ( n == 4 ) return Math . min ( Math . min ( arr [ 0 ] , arr [ 1 ] ) , Math . min ( arr [ 2 ] , arr [ 3 ] ) ) ; dp [ 0 ] = arr [ 0 ] ; dp [ 1 ] = arr [ 1 ] ; dp [ 2 ] = arr [ 2 ] ; dp [ 3 ] = arr [ 3 ] ; for ( int i = 4 ; i < n ; i ++ ) dp [ i ] = arr [ i ] + Math . min ( Math . min ( dp [ i - 1 ] , dp [ i - 2 ] ) , Math . min ( dp [ i - 3 ] , dp [ i - 4 ] ) ) ; return Math . min ( Math . min ( dp [ n - 1 ] , dp [ n - 2 ] ) , Math . min ( dp [ n - 4 ] , dp [ n - 3 ] ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,7,11,12,13,14,18,20,22,26,28,29,31,32,33,35,38,38,40,40,41,42,43,44,45,53,54,54,59,62,69,72,74,75,75,76,79,83,84,89,91,96,97,98,99,99}); param0.add(new int[]{50,-22,90,-40,46,86,50,44,12,-42,-58,6,52,-16,4,46,44,0,-64,78,-14,-80,30,-66,78,24,28,10,-72,-44,-28,-32,-30,94,-22,26,16,20,-52,-16,-80,2,-56,-70,-76,60,62}); 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}); param0.add(new int[]{63,18,13,2,1,94,11,49,82,97,75,98,25,20,96,82,60,94,24,15,79,48,40,60,9,62,24,69,31,78,34,83,22,88}); param0.add(new int[]{-74,16,96}); param0.add(new int[]{0,0,1,0,1,1}); param0.add(new int[]{2,5,6,8,10,16,18,19,20,21,24,30,34,36,39,42,52,53,54,55,56,57,70,71,72,73,75,75,77,78,82,85,87,88,89,91}); param0.add(new int[]{-40,12,-86,-54,-68,32,10,-24,-46,54,-64,20,22,88,62,-4,-2,-8,-32,88,-4,38,4,86,82,-16,-76,-44,54,-24,-92,74,50,-52,52}); 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}); param0.add(new int[]{4,53,96,86,69,81,86,95,80,43,25,66,24,72}); List<Integer> param1 = new ArrayList<>(); param1.add(30); param1.add(40); param1.add(14); param1.add(33); param1.add(1); param1.add(5); param1.add(25); param1.add(22); param1.add(20); param1.add(12); 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()); } }
1,505
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE.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_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE{ static int f_gold ( int arr [ ] , int n ) { if ( n == 1 || n == 0 ) return 1 ; if ( arr [ n - 1 ] < arr [ n - 2 ] ) return 0 ; return f_gold ( arr , n - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,4,19,21,28,32,35,44,51,55,62,80,80,83,90,93,93}); param0.add(new int[]{84,-28,-42,38,-94,-70,34,54,38,-58,-54,-6,72,-32,-18,80,-6,-38,-30,-86,-10,14,92,-56,40,-58,-2,-6,-46,-80,72,-12,2,-64,36,98,-24}); param0.add(new int[]{0,1,1,1}); param0.add(new int[]{74,75,9,13,57,82,57,37,47,11,28,6,33,14,47,29,15,56,69,86,31,19,18,58,70,73,30,95,35,17,16,97,68,95,33,36,11,60,4,63,5,64,85,77,4}); param0.add(new int[]{-96,-92,-84,-78,-74,-68,-66,-64,-62,-50,-48,-48,-46,-38,-28,-28,-26,-24,-24,-20,-14,-12,-4,16,18,28,32,48,50,62,70,72,78,90,92}); param0.add(new int[]{0,1,0,1,0,0,0,1,1,1,1,1,0,1,0,1,1,1,0,1,0,0,0,1,1,1,0,1,1,1,1,1,1,0,1,0,1,1,1,0,0,1,0,1,1,1,0,0}); param0.add(new int[]{6,8,11,21,29,31,41,50,56,56,69,69,74,79,86,88,93,95,99}); param0.add(new int[]{10,-12,-36,72,-42,-94,38,-78,-4,6,12,6,-48}); 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,1,1}); param0.add(new int[]{97,58,88,20,63,1,23,33,57,81,54,66,95,31,54,16,37,7,1,94,18,42,39,26,75,65,57,69,86,77,17,7,71,12,38,87,48,55,54,72,15,30,55}); List<Integer> param1 = new ArrayList<>(); param1.add(8); param1.add(21); param1.add(2); param1.add(31); param1.add(31); param1.add(38); param1.add(10); param1.add(6); param1.add(35); param1.add(29); 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()); } }
1,506
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_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 PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING{ static int f_gold ( String tree , int k ) { int level = - 1 ; int product = 1 ; int n = tree . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tree . charAt ( i ) == '(' ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) product *= ( tree . charAt ( i ) - '0' ) ; } } return product ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("0010"); param0.add("kjtdgmy"); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(3); param1.add(1); param1.add(2); param1.add(4); param1.add(100); param1.add(3); param1.add(0); param1.add(12); param1.add(97); 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()); } }
1,507
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SIZE_SUBARRAY_MAXIMUM_SUM.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 SIZE_SUBARRAY_MAXIMUM_SUM{ static int f_gold ( int a [ ] , int size ) { int max_so_far = Integer . MIN_VALUE , max_ending_here = 0 , start = 0 , end = 0 , s = 0 ; for ( int i = 0 ; i < size ; i ++ ) { max_ending_here += a [ i ] ; if ( max_so_far < max_ending_here ) { max_so_far = max_ending_here ; start = s ; end = i ; } if ( max_ending_here < 0 ) { max_ending_here = 0 ; s = i + 1 ; } } return ( end - start + 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,7,16,20,21,22,34,34,37,37,49,53,54,55,58,59,60,66,67,68,73,80,80,88,90,98,99,99}); param0.add(new int[]{-90,-98,-10,-84,24}); 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[]{94,2,83,94,10,94,58,99,60,19,3,71,36,84,71,14,50,15}); param0.add(new int[]{-98,-96,-70,-64,-56,-38,-34,-24,-22,-2,26,32,36,50,62,70,70,72,72,74,78,82,84,86}); param0.add(new int[]{0,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,1,1,0,1,0,1,0}); param0.add(new int[]{1,2,2,5,13,14,15,18,21,34,42,48,50,63,67,68,69,75,80,80,81,83,84,89,90,90,91,92,95,98}); param0.add(new int[]{-88,-10,-88,-90,92,14,68,-90,-86}); 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,1,1,1,1,1,1,1,1}); param0.add(new int[]{28,39,90,39,12,90,24,89,54,44,3,26,44,36,67,92,3,79,10,45,22,21,39,91,2,5,72,21,55,48,75,47}); List<Integer> param1 = new ArrayList<>(); param1.add(21); param1.add(2); param1.add(19); param1.add(14); param1.add(13); param1.add(35); param1.add(22); param1.add(5); param1.add(24); param1.add(27); 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()); } }
1,508
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_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 RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_ARRAY{ static int f_gold ( int arr [ ] , int l , int r , int x ) { if ( r < l ) return - 1 ; if ( arr [ l ] == x ) return l ; if ( arr [ r ] == x ) return r ; return f_gold ( arr , l + 1 , r - 1 , x ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{10,74,5}); param0.add(new int[]{-90,72,36,96,42,0,-66,5}); param0.add(new int[]{0,5}); param0.add(new int[]{99,70,67,5}); param0.add(new int[]{-98,-98,-26,-26,-24,-18,-16,80,5}); param0.add(new int[]{1,1,1,1,0,1,5}); param0.add(new int[]{1,5,12,12,17,17,12,95,96,98,5}); param0.add(new int[]{50,-70,-30,-54,6,-10,70,84,5}); param0.add(new int[]{0,1,5}); param0.add(new int[]{59,21,28,3,14,5}); List<Integer> param1 = new ArrayList<>(); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(0); List<Integer> param2 = new ArrayList<>(); param2.add(2); param2.add(7); param2.add(1); param2.add(3); param2.add(8); param2.add(6); param2.add(10); param2.add(8); param2.add(2); param2.add(5); List<Integer> param3 = new ArrayList<>(); param3.add(1); param3.add(96); param3.add(-1); param3.add(3); param3.add(80); param3.add(1); param3.add(12); param3.add(27); param3.add(14); param3.add(28); 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()); } }
1,509
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED.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_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED{ static boolean f_gold ( int arr [ ] , int n ) { for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( arr [ i ] > arr [ i + 1 ] ) { if ( arr [ i ] - arr [ i + 1 ] == 1 ) { int temp = arr [ i ] ; arr [ i ] = arr [ i + 1 ] ; arr [ i + 1 ] = temp ; } else return false ; } } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,4,12,16,37,44,47,51,55,57,57,62,62,62,64,69,69,70,72,81,81,88,89,97}); param0.add(new int[]{-86,0,14,-16,-12,-72,62,-34,-72,30,84,-60,84,-64,50,74,18,-82,-64,-64,-74,-56,86,84,-32,-10,20,4,8,96,82,26,42}); 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}); param0.add(new int[]{48,66,83,12,77,98,18,33,21,16,28,24,46,43}); param0.add(new int[]{-92,-58,-36,-28,-6,2,4,26,48,58,60,62,62,98}); param0.add(new int[]{1,0,0,0,0,1}); param0.add(new int[]{22,38,41,41,42,51,54,58,68,76,80,85}); param0.add(new int[]{84,-38,52,-72,-24,82,54,74,0}); param0.add(new int[]{0,1,1}); param0.add(new int[]{63,31,14,19,77,64,62,23,22,19,39,9,79,1,87,29,58,3,3,39,1,39,35,64,64}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(18); param1.add(31); param1.add(13); param1.add(10); param1.add(4); param1.add(9); param1.add(8); param1.add(2); 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()); } }
1,510
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/C_PROGRAM_FACTORIAL_NUMBER_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 C_PROGRAM_FACTORIAL_NUMBER_2{ static int f_gold ( int n ) { return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(66); param0.add(93); param0.add(39); param0.add(93); param0.add(68); param0.add(20); param0.add(37); param0.add(52); param0.add(52); 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()); } }
1,511
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_SERIES_23_45_67_89_UPTO_N_TERMS.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_SERIES_23_45_67_89_UPTO_N_TERMS{ static double f_gold ( int n ) { int i = 1 ; double res = 0.0 ; boolean sign = true ; while ( n > 0 ) { n -- ; if ( sign ) { sign = ! sign ; res = res + ( double ) ++ i / ++ i ; } else { sign = ! sign ; res = res - ( double ) ++ i / ++ i ; } } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(49); param0.add(4); param0.add(60); param0.add(90); param0.add(96); param0.add(29); param0.add(86); param0.add(47); param0.add(77); param0.add(87); 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()); } }
1,512
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBER_PAIRS_N_B_N_GCD_B_B.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_PAIRS_N_B_N_GCD_B_B{ static int f_gold ( int n ) { int k = n ; int imin = 1 ; int ans = 0 ; while ( imin <= n ) { int imax = n / k ; ans += k * ( imax - imin + 1 ) ; imin = imax + 1 ; k = n / imin ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(17); param0.add(72); param0.add(43); param0.add(55); param0.add(62); param0.add(22); param0.add(17); param0.add(68); param0.add(20); 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()); } }
1,513
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CALCULATE_VOLUME_DODECAHEDRON.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 CALCULATE_VOLUME_DODECAHEDRON{ static double f_gold ( int side ) { return ( ( ( 15 + ( 7 * ( Math . sqrt ( 5 ) ) ) ) / 4 ) * ( Math . pow ( side , 3 ) ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(56); param0.add(73); param0.add(22); param0.add(10); param0.add(84); param0.add(20); param0.add(51); param0.add(91); param0.add(10); param0.add(83); 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()); } }
1,514
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SORT_ARRAY_CONTAIN_1_N_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; class SORT_ARRAY_CONTAIN_1_N_VALUES{ static void f_gold ( int [ ] arr , int n ) { for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = i + 1 ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,3,6,7,9,11,15,15,17,19,21,23,26,27,37,48,48,51,53,53,59,64,69,69,70,71,72,84,93,96}); param0.add(new int[]{66,-28,6,25,-65,19,-86,-86,-90,40,-62}); 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}); param0.add(new int[]{85,84,8,36,93,76,14,54,85,86}); param0.add(new int[]{-90,-82,-80,-73,-67,-62,-62,-61,-58,-56,-56,-52,-50,-49,-49,-43,-43,-30,-26,-26,-15,-14,-13,-4,10,19,20,22,26,29,34,35,37,45,49,52,54,66,67,80,84,87,89,90}); param0.add(new int[]{1,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,1,1,1}); param0.add(new int[]{10,11,13,19,19,30,33,36,40,42,44,47,49,52,53,58,66,68,72,82,87,89,90,94}); param0.add(new int[]{-46,-35,40,-76,-66,-47,36,-82,-43,12,-95,54,58,82,-87,-17,-71,-97,-10,4,23,86,-24}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{88,76,16,23,40,60,73,32,15,13,5,75,74,52,77,41,53,50,15,7,40,28,32,99,15,85}); List<Integer> param1 = new ArrayList<>(); param1.add(19); param1.add(8); param1.add(26); param1.add(9); param1.add(31); param1.add(29); param1.add(21); param1.add(12); param1.add(6); param1.add(18); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{3,3,6,7,9,11,15,15,17,19,21,23,26,27,37,48,48,51,53,53,59,64,69,69,70,71,72,84,93,96}); filled_function_param0.add(new int[]{66,-28,6,25,-65,19,-86,-86,-90,40,-62}); 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,0,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[]{85,84,8,36,93,76,14,54,85,86}); filled_function_param0.add(new int[]{-90,-82,-80,-73,-67,-62,-62,-61,-58,-56,-56,-52,-50,-49,-49,-43,-43,-30,-26,-26,-15,-14,-13,-4,10,19,20,22,26,29,34,35,37,45,49,52,54,66,67,80,84,87,89,90}); filled_function_param0.add(new int[]{1,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,1,1,1}); filled_function_param0.add(new int[]{10,11,13,19,19,30,33,36,40,42,44,47,49,52,53,58,66,68,72,82,87,89,90,94}); filled_function_param0.add(new int[]{-46,-35,40,-76,-66,-47,36,-82,-43,12,-95,54,58,82,-87,-17,-71,-97,-10,4,23,86,-24}); filled_function_param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1}); filled_function_param0.add(new int[]{88,76,16,23,40,60,73,32,15,13,5,75,74,52,77,41,53,50,15,7,40,28,32,99,15,85}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(19); filled_function_param1.add(8); filled_function_param1.add(26); filled_function_param1.add(9); filled_function_param1.add(31); filled_function_param1.add(29); filled_function_param1.add(21); filled_function_param1.add(12); filled_function_param1.add(6); filled_function_param1.add(18); 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()); } }
1,515
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_CHECK_INPUT_INTEGER_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 PROGRAM_CHECK_INPUT_INTEGER_STRING{ static boolean f_gold ( String s ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) if ( Character . isDigit ( s . charAt ( i ) ) == false ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("MgTOyHo NT"); param0.add("033675175"); param0.add("011001"); param0.add("XLlccG"); param0.add("8223900094410"); param0.add("000"); param0.add("aupp"); param0.add("90202721499"); param0.add("110000100011"); param0.add("MhYHsMQeLhG"); 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()); } }
1,516
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_XOR_VALUE_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 MINIMUM_XOR_VALUE_PAIR_1{ static int f_gold ( int arr [ ] , int n ) { Arrays . parallelSort ( arr ) ; int minXor = Integer . MAX_VALUE ; int val = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { val = arr [ i ] ^ arr [ i + 1 ] ; minXor = Math . min ( minXor , val ) ; } return minXor ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8,11,12,27,32,32,36,56,57,66,68,70,74,78,82,83,96}); param0.add(new int[]{40,48,66,4,-60,42,-8,38}); 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}); param0.add(new int[]{98,6,82,95,87,20,11,63,78,70,37,12,57,67,10,49,38,28,86,7,61,50,32,68,91,66,57,29,2,64,65,15,16,4,7,76,44,52,81,89,3,36,57,95,48,24}); param0.add(new int[]{-88,-84,-76,-58,-40,-38,-28,-24,-20,-14,-12,16,20,28,28,30,40,44,56,58,60,92,92}); param0.add(new int[]{0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,1,1,1,0,1,1,0,1,0}); param0.add(new int[]{6,6,19,31,41,45,49,56,78,96,98}); param0.add(new int[]{62,-90,22,-84,-4}); 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[]{83,13,43,99,34,74,56,20,93,65,92,58,91,72,37,10,39,7,29,69,42,28}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(7); param1.add(19); param1.add(36); param1.add(13); param1.add(20); param1.add(6); param1.add(3); param1.add(21); 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()); } }
1,517
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_K_TH_GROUP_ODD_POSITIVE_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_K_TH_GROUP_ODD_POSITIVE_NUMBERS{ public static int f_gold ( int k ) { int cur = ( k * ( k - 1 ) ) + 1 ; int sum = 0 ; while ( k -- > 0 ) { sum += cur ; cur += 2 ; } return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(91); param0.add(52); param0.add(78); param0.add(51); param0.add(65); param0.add(39); param0.add(42); param0.add(12); param0.add(56); param0.add(98); 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()); } }
1,518
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_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_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int res = 1 ; for ( int i = 0 ; i < n && arr [ i ] <= res ; i ++ ) res = res + arr [ i ] ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{16,23,24,41,48,58,72,75}); param0.add(new int[]{-14,-82,12,-14,-38,12,40,12,-74,42,-36,64}); param0.add(new int[]{0,0,1,1,1,1}); param0.add(new int[]{17,89,44}); param0.add(new int[]{-94,-92,-84,-82,-72,-58,-56,-40,-34,-34,-24,-22,-8,-8,12,14,16,16,22,22,34,46,54,58,68,72,74,78,88,96}); param0.add(new int[]{0,0,0,0,0,1,0,0,1,0,1,0}); param0.add(new int[]{2,12,13,13,13,16,28,32,34,41,41,47,49,49,50,52,58,61,63,65,67,68,68,74,80,80,84,84,89,93,94,98,99,99}); param0.add(new int[]{-54}); 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}); param0.add(new int[]{42,50,76,45,6,63,46,73,65,70,87,5,41,63,96,75,38,76,27,7,71,9,65,44,76,37,94,52,55,3,38,68,45,15,35,90,36,46,13,92,32,22,49,35,83}); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(8); param1.add(5); param1.add(2); param1.add(25); param1.add(8); param1.add(23); param1.add(0); param1.add(33); param1.add(35); 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()); } }
1,519
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10.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 EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10{ static boolean f_gold ( int n ) { if ( n % 15 == 0 ) return true ; return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(30); param0.add(-30); param0.add(60); param0.add(90); param0.add(99); param0.add(32); param0.add(21); param0.add(65); param0.add(21); param0.add(99); 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()); } }
1,520
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_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 DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_SUBSEQUENCE{ static int f_gold ( int arr [ ] , int n ) { int i , j , max = 0 ; int msis [ ] = new int [ n ] ; for ( i = 0 ; i < n ; i ++ ) msis [ i ] = arr [ i ] ; for ( i = 1 ; i < n ; i ++ ) for ( j = 0 ; j < i ; j ++ ) if ( arr [ i ] > arr [ j ] && msis [ i ] < msis [ j ] + arr [ i ] ) msis [ i ] = msis [ j ] + arr [ i ] ; for ( i = 0 ; i < n ; i ++ ) if ( max < msis [ i ] ) max = msis [ 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,7,12,23,31,31,45,47,60,67,70,84,85,91,96}); param0.add(new int[]{-88,-38,-50,-14,36,-32,0,-8,-12,-62,-46,66,-46,-26,6,-44,14,-74,-84,52,-28}); 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,1}); param0.add(new int[]{85,42,7,35,35,21,97,59,88,50,12,44,85,22,38,23,42,61,44,63,23,69,28,17,73,20,71,80,15,42,28,10,56,77,43}); param0.add(new int[]{-92,-82,-82,-74,-72,-68,-68,-66,-60,-54,-42,-38,-36,-32,-30,-16,-14,-12,-10,14,24,28,34,34,38,42,44,52,70,72,80,84,86,94}); param0.add(new int[]{0,1,1,1,1,1,0,1,1,0,1,0,0,0}); param0.add(new int[]{33}); param0.add(new int[]{76,86,46,-70,92,6,70,-66,64,46,86,-42,-46,-24,8,76,4,-96,-86,18,70,-72,-56,-88,-96,62,22,20,42}); 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[]{25,46,41,61,93,29,65,24,10,89,22,51,18,65,70,59,87,82,97,99,15,64,20,97,12,23,76}); List<Integer> param1 = new ArrayList<>(); param1.add(11); param1.add(18); param1.add(39); param1.add(26); param1.add(32); param1.add(8); param1.add(0); param1.add(21); param1.add(24); 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()); } }
1,521
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_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 SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING{ static int f_gold ( String tree , int k ) { int level = - 1 ; int sum = 0 ; int n = tree . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tree . charAt ( i ) == '(' ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) sum += ( tree . charAt ( i ) - '0' ) ; } } return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))"); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("(0(5(6()())(4()(9()())))(7(1()())(3()())))"); param0.add("0010"); param0.add("kjtdgmy"); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(3); param1.add(1); param1.add(2); param1.add(4); param1.add(100); param1.add(3); param1.add(0); param1.add(12); param1.add(97); 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()); } }
1,522
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_OCTAL_DECIMAL_CONVERSION.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_OCTAL_DECIMAL_CONVERSION{ static int f_gold ( int n ) { int num = n ; int dec_value = 0 ; int base = 1 ; int temp = num ; while ( temp > 0 ) { int last_digit = temp % 10 ; temp = temp / 10 ; dec_value += last_digit * base ; base = base * 8 ; } return dec_value ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(37); param0.add(25); param0.add(63); param0.add(66); param0.add(32); param0.add(5); param0.add(41); param0.add(82); param0.add(54); 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()); } }
1,523
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE_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 REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE_1{ public static void f_gold ( int arr [ ] , int n ) { int max_ele = arr [ n - 1 ] ; int min_ele = arr [ 0 ] ; for ( int i = 0 ; i < n ; i ++ ) { if ( i % 2 == 0 ) { arr [ i ] = max_ele ; max_ele -= 1 ; } else { arr [ i ] = min_ele ; min_ele += 1 ; } } } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,4,8,10,12,14,14,17,18,19,20,25,28,29,30,31,34,35,37,38,40,41,42,45,47,49,54,54,55,58,58,63,65,66,66,67,67,72,74,75,75,80,82,86,92,95,96,99}); param0.add(new int[]{45,42,-91,90,-6,49,65,39,-80,-65,-47,75,10,80,36,-96,55,72,68,2,-53,-6,72,-52,-9,80,-16,-32,39,25,-27,-96,-24,-27,-23,-52}); 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}); param0.add(new int[]{12,84,16}); param0.add(new int[]{-85,-77,-70,-67,-55,-51,-49,-41,-37,-24,-18,-8,-6,77,87,90}); param0.add(new int[]{0,0,1,1,1,1,1,1,1,0,1,1,0,0,0}); param0.add(new int[]{5,8,15,16,20,22,25,33,46,48,52,54,55,57,57,61,61,66,72,73,83,87,88,89,98}); param0.add(new int[]{31,2,-46,-86,-64,5,-18,-33,-90,-51,11,-35,-43,-73,13,33,-29,-17,-43,20,-7,-85}); 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,1,1,1,1,1}); param0.add(new int[]{20,75,12,62,18,94,63,84,25,12}); List<Integer> param1 = new ArrayList<>(); param1.add(40); param1.add(23); param1.add(28); param1.add(2); param1.add(13); param1.add(12); param1.add(12); param1.add(13); param1.add(31); param1.add(9); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{3,4,8,10,12,14,14,17,18,19,20,25,28,29,30,31,34,35,37,38,40,41,42,45,47,49,54,54,55,58,58,63,65,66,66,67,67,72,74,75,75,80,82,86,92,95,96,99}); filled_function_param0.add(new int[]{45,42,-91,90,-6,49,65,39,-80,-65,-47,75,10,80,36,-96,55,72,68,2,-53,-6,72,-52,-9,80,-16,-32,39,25,-27,-96,-24,-27,-23,-52}); 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,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[]{12,84,16}); filled_function_param0.add(new int[]{-85,-77,-70,-67,-55,-51,-49,-41,-37,-24,-18,-8,-6,77,87,90}); filled_function_param0.add(new int[]{0,0,1,1,1,1,1,1,1,0,1,1,0,0,0}); filled_function_param0.add(new int[]{5,8,15,16,20,22,25,33,46,48,52,54,55,57,57,61,61,66,72,73,83,87,88,89,98}); filled_function_param0.add(new int[]{31,2,-46,-86,-64,5,-18,-33,-90,-51,11,-35,-43,-73,13,33,-29,-17,-43,20,-7,-85}); 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,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}); filled_function_param0.add(new int[]{20,75,12,62,18,94,63,84,25,12}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(40); filled_function_param1.add(23); filled_function_param1.add(28); filled_function_param1.add(2); filled_function_param1.add(13); filled_function_param1.add(12); filled_function_param1.add(12); filled_function_param1.add(13); filled_function_param1.add(31); filled_function_param1.add(9); 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()); } }
1,524
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_IF_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS.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_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS{ static boolean f_gold ( String str , int n ) { int len = str . length ( ) ; if ( len >= n ) return true ; return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("ZCoQhuM"); param0.add("7437725"); param0.add("11"); param0.add("buGlvR"); param0.add("9"); param0.add("101101010110"); param0.add("YguiM"); param0.add("8198"); param0.add("11101"); param0.add("hUInqJXNdbfP"); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(53); param1.add(30); param1.add(1); param1.add(92); param1.add(3); param1.add(18); param1.add(90); param1.add(71); param1.add(4); 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()); } }
1,525
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_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_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_3{ static int f_gold ( int m , int n ) { int path = 1 ; for ( int i = n ; i < ( m + n - 1 ) ; i ++ ) { path *= i ; path /= ( i - n + 1 ) ; } return path ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(10); param0.add(52); param0.add(5); param0.add(84); param0.add(27); param0.add(77); param0.add(52); param0.add(3); param0.add(5); param0.add(14); List<Integer> param1 = new ArrayList<>(); param1.add(3); param1.add(8); param1.add(23); param1.add(56); param1.add(30); param1.add(90); param1.add(50); param1.add(25); param1.add(75); 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()); } }
1,526
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_INDEXES_EQUAL_ELEMENTS_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 NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE{ static int f_gold ( int a [ ] , int n , int l , int r ) { int count = 0 ; for ( int i = l ; i < r ; i ++ ) if ( a [ i ] == a [ i + 1 ] ) count += 1 ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,13,13,16,16,19,39,41,48,52,57,62,65,67,76,84,88,91,95,96,97,98}); param0.add(new int[]{62,76,86,-8,84,-6,72,84,6,-50,-18,-94,54,90,-74,-64,-26,-14,-32,62,10,4,70,-28,8,18,4,-62,-76,84,-78,-4,84,98,58,-68,42,-6,34,-38,52,-84,78}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{11,75,98,29,62,53,48,91,86,66,48,94}); param0.add(new int[]{-94,-84,-70,-70,-40,-40,-36,-24,10,48,62,74}); param0.add(new int[]{1,0,1,1,0,1,0,1,1,1,1,0,1,1,0,1,1,1,1,1,1,0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,0,0,1,0,1,1,0,0}); param0.add(new int[]{1,2,6,7,10,11,13,19,19,25,29,30,32,34,35,45,45,46,47,48,48,53,58,61,64,65,67,75,76,81,81,84,84,85,86,94,94,96,99}); param0.add(new int[]{-56,42,-34,-12,-86,82,-96,-66,30,16,-40,72,84,94,-48,-30,26,50,42,-44,-50,22,-38,8,34,94,2,16,-32,18,-58,12,-26,28,-62}); param0.add(new int[]{0,0,0,0,1,1,1}); param0.add(new int[]{6,29}); List<Integer> param1 = new ArrayList<>(); param1.add(18); param1.add(32); param1.add(10); param1.add(8); param1.add(11); param1.add(36); param1.add(25); param1.add(21); param1.add(4); param1.add(1); List<Integer> param2 = new ArrayList<>(); param2.add(12); param2.add(38); param2.add(6); param2.add(6); param2.add(7); param2.add(40); param2.add(19); param2.add(30); param2.add(5); param2.add(1); List<Integer> param3 = new ArrayList<>(); param3.add(17); param3.add(23); param3.add(6); param3.add(6); param3.add(8); param3.add(37); param3.add(37); param3.add(26); param3.add(5); param3.add(1); 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()); } }
1,527
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_FIND_REMAINDER_LARGE_NUMBER_DIVIDED_11.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_REMAINDER_LARGE_NUMBER_DIVIDED_11{ static int f_gold ( String str ) { int len = str . length ( ) ; int num , rem = 0 ; for ( int i = 0 ; i < len ; i ++ ) { num = rem * 10 + ( str . charAt ( i ) - '0' ) ; rem = num % 11 ; } return rem ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("DvsNZVNZ"); param0.add("1170"); param0.add("10"); param0.add("evsPwREbSY"); param0.add("09219178704"); param0.add("1001010"); param0.add("SkZbWSajDKmiG"); param0.add("0287976763"); param0.add("011011000111"); param0.add("lUn"); 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()); } }
1,528
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SET_BITS_IN_AN_INTEGER_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 COUNT_SET_BITS_IN_AN_INTEGER_2{ static int f_gold ( int n ) { int count = 0 ; while ( n > 0 ) { n &= ( n - 1 ) ; count ++ ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(32); param0.add(94); param0.add(33); param0.add(99); param0.add(17); param0.add(64); param0.add(80); param0.add(42); param0.add(12); 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()); } }
1,529
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/TRIANGULAR_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 TRIANGULAR_NUMBERS{ static boolean f_gold ( int num ) { if ( num < 0 ) return false ; int sum = 0 ; for ( int n = 1 ; sum <= num ; n ++ ) { sum = sum + n ; if ( sum == num ) return true ; } return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(97); param0.add(97); param0.add(32); param0.add(40); param0.add(18); param0.add(14); param0.add(90); param0.add(39); param0.add(1); param0.add(57); 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()); } }
1,530
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10.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 ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10{ static int f_gold ( int n ) { int a = ( n / 10 ) * 10 ; int b = a + 10 ; return ( n - a > b - n ) ? b : a ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(31); param0.add(78); param0.add(19); param0.add(36); param0.add(77); param0.add(94); param0.add(86); param0.add(16); param0.add(95); param0.add(2); 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()); } }
1,531
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_FACTORS_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 SUM_FACTORS_NUMBER_1{ static int f_gold ( int n ) { int res = 1 ; for ( int i = 2 ; i <= Math . sqrt ( n ) ; i ++ ) { int curr_sum = 1 ; int curr_term = 1 ; while ( n % i == 0 ) { n = n / i ; curr_term *= i ; curr_sum += curr_term ; } res *= curr_sum ; } if ( n > 2 ) res *= ( 1 + n ) ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(96); param0.add(32); param0.add(93); param0.add(78); param0.add(30); param0.add(5); param0.add(62); param0.add(27); param0.add(95); param0.add(45); 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()); } }
1,532
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_ROTATIONS_DIVISIBLE_8.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_ROTATIONS_DIVISIBLE_8{ static int f_gold ( String n ) { int len = n . length ( ) ; int count = 0 ; if ( len == 1 ) { int oneDigit = n . charAt ( 0 ) - '0' ; if ( oneDigit % 8 == 0 ) return 1 ; return 0 ; } if ( len == 2 ) { int first = ( n . charAt ( 0 ) - '0' ) * 10 + ( n . charAt ( 1 ) - '0' ) ; int second = ( n . charAt ( 1 ) - '0' ) * 10 + ( n . charAt ( 0 ) - '0' ) ; if ( first % 8 == 0 ) count ++ ; if ( second % 8 == 0 ) count ++ ; return count ; } int threeDigit ; for ( int i = 0 ; i < ( len - 2 ) ; i ++ ) { threeDigit = ( n . charAt ( i ) - '0' ) * 100 + ( n . charAt ( i + 1 ) - '0' ) * 10 + ( n . charAt ( i + 2 ) - '0' ) ; if ( threeDigit % 8 == 0 ) count ++ ; } threeDigit = ( n . charAt ( len - 1 ) - '0' ) * 100 + ( n . charAt ( 0 ) - '0' ) * 10 + ( n . charAt ( 1 ) - '0' ) ; if ( threeDigit % 8 == 0 ) count ++ ; threeDigit = ( n . charAt ( len - 2 ) - '0' ) * 100 + ( n . charAt ( len - 1 ) - '0' ) * 10 + ( n . charAt ( 0 ) - '0' ) ; if ( threeDigit % 8 == 0 ) count ++ ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add(" MwBVIb"); param0.add("37291205493"); param0.add("0111111"); param0.add("BrrQon"); param0.add("226051"); param0.add("1001101"); param0.add("eREctoEen"); param0.add("299967"); param0.add("000111"); param0.add("GJUYuqbampKo"); 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()); } }
1,533
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_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 SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1{ static int f_gold ( int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += i * ( n - i ) ; return 2 * sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(63); param0.add(72); param0.add(28); param0.add(35); param0.add(6); param0.add(70); param0.add(20); param0.add(8); param0.add(8); param0.add(35); 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()); } }
1,534
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE.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_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE{ static int f_gold ( int a , int b , int d ) { int temp = a ; a = Math . min ( a , b ) ; b = Math . max ( temp , b ) ; if ( d >= b ) return ( d + b - 1 ) / b ; if ( d == 0 ) return 0 ; if ( d == a ) return 1 ; return 2 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(35); param0.add(85); param0.add(22); param0.add(8); param0.add(12); param0.add(58); param0.add(65); param0.add(10); param0.add(23); param0.add(5); List<Integer> param1 = new ArrayList<>(); param1.add(8); param1.add(55); param1.add(23); param1.add(43); param1.add(64); param1.add(25); param1.add(4); param1.add(95); param1.add(13); param1.add(50); List<Integer> param2 = new ArrayList<>(); param2.add(77); param2.add(33); param2.add(64); param2.add(29); param2.add(11); param2.add(26); param2.add(28); param2.add(55); param2.add(54); param2.add(71); 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()); } }
1,535
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_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 CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER{ public static boolean f_gold ( int x , int y ) { if ( x == 1 ) return ( y == 1 ) ; int pow = 1 ; while ( pow < y ) pow = pow * x ; return ( pow == y ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(57); param0.add(3); param0.add(10); param0.add(10); param0.add(6); param0.add(2); param0.add(1); param0.add(20); param0.add(96); param0.add(25); List<Integer> param1 = new ArrayList<>(); param1.add(1); param1.add(9); param1.add(101); param1.add(10000); param1.add(46656); param1.add(2048); param1.add(40); param1.add(79); param1.add(98); param1.add(5); 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()); } }
1,536
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC_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_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC_1{ static int f_gold ( int mat [ ] [ ] , int n ) { int flip = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( mat [ i ] [ j ] != mat [ j ] [ i ] ) flip ++ ; return flip ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{16,16,47,49,50,64,70,83,88},new int[]{11,12,24,32,36,39,48,58,62},new int[]{29,31,35,49,71,78,82,92,96},new int[]{6,21,46,53,83,88,94,94,97},new int[]{29,36,41,52,83,89,89,90,90},new int[]{3,11,35,45,47,79,81,85,96},new int[]{31,43,62,62,62,65,66,68,81},new int[]{8,9,10,26,36,43,58,70,95},new int[]{2,8,24,31,42,43,58,90,94}}); param0.add(new int[][]{new int[]{20,8,-42,-16,58,58,80},new int[]{-28,-20,54,94,62,22,-86},new int[]{-26,86,48,-28,10,90,-40},new int[]{68,76,16,-50,-58,18,-86},new int[]{40,-52,8,-14,-8,54,78},new int[]{82,92,2,54,62,80,14},new int[]{-56,-90,74,-16,-92,76,32}}); 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,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,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,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,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,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},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,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,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,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,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,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,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,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,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,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,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,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,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,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,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},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,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,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,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,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,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,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,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},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,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,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,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},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,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,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,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,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,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,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,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,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,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,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},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,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,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,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,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,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,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,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},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,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,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,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[]{66,95,76,26,11,80,1,59,16},new int[]{79,5,47,12,55,11,49,12,84},new int[]{77,16,8,92,95,71,16,71,44},new int[]{14,17,30,80,42,42,35,62,87},new int[]{47,75,69,34,25,54,87,49,62},new int[]{9,20,35,98,95,57,51,64,72},new int[]{66,38,22,59,82,49,40,46,64},new int[]{31,15,63,84,6,18,93,36,62},new int[]{96,13,34,87,16,6,91,65,13}}); param0.add(new int[][]{new int[]{-94,-68,-54,-36,-32,-28,-10,10,30,38,58,66,78,90},new int[]{-98,-62,-44,-38,-36,-34,-34,-26,28,30,34,64,90,98},new int[]{-90,-88,-84,-62,-54,-24,4,6,30,32,40,50,56,68},new int[]{-98,-80,-74,-48,-18,-14,-10,10,24,42,54,54,74,96},new int[]{-84,-68,-52,-32,-16,-8,-4,6,44,48,50,78,80,84},new int[]{-96,-84,-78,-42,-38,-36,-16,-14,2,14,16,24,28,40},new int[]{-94,-92,-86,-84,-62,-58,-52,-46,-22,-12,16,32,62,68},new int[]{-92,-72,-68,-62,-50,-50,-38,-12,22,40,40,42,48,70},new int[]{-90,-72,-42,-28,16,22,26,36,42,50,68,82,90,94},new int[]{-86,-78,-66,-60,-46,-30,-26,-20,-14,54,60,66,76,84},new int[]{-98,-96,-76,-64,-30,-16,-4,14,22,28,48,64,74,96},new int[]{-88,-68,-58,-50,-28,-16,-8,2,18,20,28,58,60,82},new int[]{-94,-82,-70,14,14,24,30,36,48,50,50,76,78,96},new int[]{-88,-74,-12,6,10,18,28,46,56,58,84,90,90,96}}); param0.add(new int[][]{new int[]{1,0,1,1,1,0,0,1,1,1,0,0,0,0,0,1,1,0,0,0,1,1,1,0,0,1,1,1,1},new int[]{0,0,0,0,0,1,0,1,0,0,0,0,1,1,0,0,1,0,1,0,0,1,1,0,1,0,1,1,0},new int[]{0,1,0,0,0,1,1,1,1,1,0,0,1,0,1,0,0,0,1,0,0,0,1,0,0,1,1,1,1},new int[]{0,0,1,1,0,1,0,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,0,1,0,1},new int[]{1,0,0,0,1,0,1,0,0,0,0,0,1,1,0,1,1,0,1,0,1,0,0,1,1,1,1,1,1},new int[]{0,0,1,1,1,1,0,1,1,0,1,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,0,0},new int[]{1,1,0,1,1,1,1,1,0,0,0,0,0,1,1,0,0,0,1,0,1,0,0,0,1,1,1,1,0},new int[]{0,1,1,1,0,0,0,1,0,0,0,1,1,1,0,0,0,0,0,1,0,1,1,0,0,0,0,1,0},new int[]{0,0,1,1,1,0,1,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,1,0,1,1,1},new int[]{1,1,1,0,0,0,1,0,0,0,1,0,0,1,0,1,0,0,1,1,1,0,1,1,1,1,1,1,0},new int[]{0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,1,1,0,1,1,1,1,1,0,1,0,1},new int[]{1,0,1,0,1,1,0,1,1,0,1,1,1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0,0},new int[]{0,1,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,1,1,0,0,0,0,1,0,0,0,1},new int[]{1,1,0,0,0,1,0,0,1,0,1,0,0,0,1,1,1,1,1,0,1,1,1,0,1,1,1,0,0},new int[]{1,1,1,1,1,0,0,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,1,0,0,1,0,0,1},new int[]{1,0,0,1,0,1,1,0,1,0,1,1,1,1,1,1,1,0,0,1,1,0,0,0,1,0,0,1,1},new int[]{1,0,0,1,0,1,1,1,0,1,1,0,1,0,0,1,1,0,1,0,0,0,1,1,0,1,1,1,1},new int[]{1,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,1,1,0,1,0,0,1},new int[]{0,1,1,0,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1,1,1,1,0,0,1,0},new int[]{1,0,1,1,1,0,1,1,1,0,0,1,1,0,1,0,1,1,0,0,0,0,1,1,1,1,0,1,0},new int[]{1,1,1,0,0,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,1,1,0,1,1,1,1,1,1},new int[]{0,0,0,1,1,0,0,0,0,1,1,1,1,1,1,1,0,1,1,0,1,0,0,1,0,1,1,0,1},new int[]{0,1,1,1,1,0,1,1,0,1,1,0,0,1,0,0,1,0,0,0,1,1,0,1,1,0,1,0,1},new int[]{0,1,0,0,0,1,1,1,0,0,1,0,0,1,0,1,0,0,1,0,1,0,0,1,1,0,0,0,1},new int[]{0,1,0,1,0,1,1,1,1,1,0,1,0,1,0,0,1,0,1,1,1,1,0,0,1,0,1,0,0},new int[]{1,1,1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0,0,0,1,1,1,0,1,0,1,0,1},new int[]{0,1,1,1,1,0,1,0,1,0,0,1,0,0,1,0,0,1,1,0,1,0,0,0,0,1,0,1,0},new int[]{1,1,1,0,0,1,1,1,0,0,1,1,1,1,0,0,1,1,1,0,1,1,1,0,1,1,1,0,0},new int[]{0,0,1,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,1,1,0,0,0,1,0,1,0,1,1}}); param0.add(new int[][]{new int[]{1,4,11,16,18,19,20,25,27,29,30,30,33,34,35,36,37,38,40,40,49,49,51,51,53,56,57,59,60,61,61,62,63,69,72,77,79,82,85,86,89,94,97,98},new int[]{2,6,8,10,11,11,11,14,15,19,20,21,21,23,26,31,31,34,37,37,40,40,41,47,47,48,52,53,55,59,67,77,81,82,82,83,88,92,92,93,94,96,97,98},new int[]{3,4,4,6,10,13,13,13,16,18,24,25,26,27,28,31,32,34,35,38,45,50,52,53,55,57,57,58,62,64,65,70,71,72,75,77,82,86,86,92,93,94,98,99},new int[]{2,4,5,8,10,10,13,14,15,18,19,21,21,21,24,24,28,30,30,31,36,37,38,48,48,52,53,58,59,60,61,67,75,77,77,78,80,81,86,87,89,89,96,96},new int[]{2,4,8,16,20,20,24,26,27,28,29,36,37,43,43,43,44,45,46,46,47,48,49,50,51,52,56,59,59,62,70,71,71,72,73,79,79,86,86,89,91,91,91,97},new int[]{1,1,2,5,6,10,17,21,22,23,23,28,31,34,36,38,41,42,43,44,52,53,54,56,56,58,59,62,64,67,67,68,70,71,77,81,82,83,83,85,88,89,90,98},new int[]{1,1,2,3,3,4,6,6,7,10,11,12,13,14,15,15,19,21,25,27,42,45,46,50,51,51,52,55,60,60,67,70,71,71,77,78,81,85,86,86,87,90,95,99},new int[]{2,4,7,9,9,11,15,17,19,22,27,27,30,32,34,35,35,36,41,42,46,46,48,54,55,56,59,61,61,65,66,67,70,73,80,81,85,89,90,91,92,96,96,97},new int[]{7,8,12,14,17,19,21,24,27,28,34,36,38,48,54,57,59,59,62,66,66,67,70,71,71,71,72,73,74,74,76,76,78,79,80,80,83,88,88,90,92,95,96,98},new int[]{3,3,8,10,10,15,16,20,25,25,25,29,34,36,42,50,52,54,56,58,59,63,64,65,71,73,73,74,75,75,76,76,78,80,82,86,86,87,87,92,94,94,96,99},new int[]{7,9,12,15,24,24,25,26,27,28,32,37,38,43,44,46,50,50,52,52,55,56,56,56,58,58,59,62,64,65,68,72,72,80,85,85,86,90,91,92,98,98,98,99},new int[]{2,7,9,18,28,29,31,32,32,38,39,39,41,41,45,48,49,49,49,50,50,58,58,62,62,63,68,69,69,71,72,74,74,75,77,78,79,81,82,82,83,83,95,98},new int[]{3,5,6,6,7,10,10,13,15,17,22,23,25,25,25,25,27,29,35,37,38,46,47,50,50,51,53,56,56,59,71,71,72,74,77,79,80,83,84,90,90,92,95,98},new int[]{1,9,19,20,22,22,22,23,24,28,32,32,32,36,36,37,37,39,45,50,53,56,58,58,60,64,66,68,68,69,72,73,73,73,75,75,79,80,80,82,86,87,91,99},new int[]{5,9,12,13,14,18,23,25,25,28,29,32,33,34,39,41,46,49,50,52,55,55,56,59,61,63,65,65,67,69,69,74,75,78,80,81,85,85,86,88,88,92,96,98},new int[]{4,4,9,11,12,20,23,23,24,27,33,35,37,40,41,43,44,45,45,49,50,51,54,54,56,58,63,65,71,71,72,73,75,76,76,78,81,84,86,88,90,90,96,99},new int[]{1,2,8,9,10,15,17,18,18,19,20,21,21,21,26,27,29,32,33,34,34,39,44,47,55,56,58,60,62,64,65,70,70,72,74,74,75,76,79,81,84,86,90,93},new int[]{2,2,6,8,9,13,15,16,16,17,18,20,24,28,33,34,36,39,40,44,46,48,50,53,53,54,61,67,69,71,72,75,76,78,83,87,88,91,93,94,94,96,97,98},new int[]{2,6,9,10,12,13,14,15,16,17,21,22,29,29,31,31,34,38,38,39,40,43,44,46,48,50,52,52,57,62,65,66,68,69,69,73,74,77,79,80,83,84,87,95},new int[]{7,7,13,14,19,22,24,24,25,30,30,32,39,41,43,48,49,50,50,52,53,54,58,61,62,65,65,66,66,67,69,70,73,73,75,77,88,89,92,92,96,96,97,98},new int[]{1,3,3,4,12,14,27,32,32,33,33,37,42,42,42,43,47,49,53,55,56,57,59,60,61,61,61,65,66,66,67,71,72,73,78,79,80,82,87,89,92,94,95,96},new int[]{5,6,6,11,11,13,18,18,19,21,25,28,31,37,40,40,43,45,51,53,53,58,63,64,67,68,73,75,75,77,82,84,84,86,88,91,92,94,94,96,97,97,98,99},new int[]{1,2,3,7,8,8,8,17,23,23,24,31,33,33,36,37,38,38,43,44,47,47,47,49,52,55,56,56,59,68,71,72,72,75,79,79,80,82,83,92,93,97,97,98},new int[]{1,2,6,6,11,13,15,15,17,20,20,24,27,27,28,30,30,33,36,37,38,40,40,40,40,42,46,51,58,60,64,65,67,71,72,75,78,82,85,87,89,97,98,98},new int[]{1,2,3,5,7,7,7,16,16,18,20,20,23,23,32,32,33,33,34,38,39,41,42,43,45,47,47,50,50,53,53,56,59,60,61,64,72,79,79,84,85,89,94,98},new int[]{2,9,11,11,14,25,26,27,29,31,32,34,35,38,38,38,40,46,47,47,48,49,51,55,58,63,63,66,67,67,68,69,70,77,80,81,83,85,89,90,92,95,97,98},new int[]{1,2,5,8,8,9,12,12,17,19,20,28,29,35,38,38,38,41,43,45,48,51,56,62,68,69,70,73,74,74,77,79,81,83,84,87,88,89,92,93,93,97,98,99},new int[]{2,3,4,5,6,6,10,11,11,13,14,14,18,18,19,20,26,30,31,32,32,34,34,35,38,42,43,44,48,53,55,56,59,59,65,72,78,84,85,88,90,97,97,98},new int[]{1,9,10,15,17,17,18,18,20,24,25,26,30,31,33,35,36,42,43,43,44,46,46,48,49,49,49,49,51,51,52,59,62,64,65,71,72,74,79,79,89,90,94,97},new int[]{1,2,10,11,15,18,18,19,21,22,25,28,28,30,37,38,40,41,46,46,49,51,52,53,53,56,64,69,69,72,72,74,77,77,77,78,78,84,85,96,97,98,98,99},new int[]{1,6,6,6,7,7,10,11,16,17,18,18,27,27,33,33,35,38,41,46,47,53,54,54,56,62,63,63,66,67,67,77,77,78,79,83,88,88,89,92,95,95,96,99},new int[]{3,4,6,8,8,8,10,12,15,17,19,19,22,22,25,28,28,29,34,34,39,41,42,43,46,46,46,53,53,54,56,56,56,63,64,68,70,75,82,84,85,94,95,96},new int[]{3,4,4,5,8,9,17,21,23,25,31,32,35,38,38,39,39,43,49,54,56,61,61,64,64,65,65,65,69,70,70,70,71,72,74,74,77,78,78,80,84,90,96,99},new int[]{1,3,6,12,13,13,13,20,21,21,24,29,33,33,38,40,42,42,45,46,47,49,55,57,58,60,60,62,63,63,67,68,69,70,72,72,74,75,75,77,77,88,95,99},new int[]{3,4,4,8,9,9,9,11,12,12,15,16,17,18,20,21,22,22,25,28,29,33,34,35,36,43,46,57,58,59,63,68,69,72,76,78,83,89,90,91,93,96,97,99},new int[]{1,9,11,12,13,15,19,26,27,32,34,42,42,44,48,54,54,56,57,58,60,64,76,80,81,82,82,82,83,84,85,85,85,86,87,92,94,95,96,97,97,97,98,98},new int[]{5,7,16,20,21,22,27,29,30,31,32,33,36,37,38,44,47,47,50,53,54,56,58,60,60,61,62,63,63,64,64,68,69,77,81,81,82,82,84,86,87,90,92,96},new int[]{3,3,6,6,8,8,9,13,20,21,27,27,29,32,34,40,43,47,49,49,50,53,54,54,57,61,63,65,66,71,72,72,73,73,74,75,75,75,79,82,85,90,92,94},new int[]{2,3,5,5,9,9,14,17,20,21,23,27,29,31,33,36,38,42,43,45,45,46,47,47,48,53,54,55,56,58,60,64,67,67,69,77,77,84,87,92,92,93,94,98},new int[]{4,9,10,12,13,15,16,20,24,25,26,27,31,34,38,38,40,41,43,44,46,46,47,47,48,57,64,74,77,78,79,82,82,85,87,87,88,89,91,92,94,96,97,99},new int[]{2,2,4,8,10,12,13,20,21,21,29,32,34,40,40,40,43,45,46,47,47,48,49,51,57,67,68,68,70,72,76,76,77,78,79,81,84,88,89,91,94,95,97,98},new int[]{3,4,4,6,8,8,9,11,14,14,15,16,16,22,22,23,25,30,30,33,33,35,36,37,40,40,42,42,44,52,55,56,56,58,60,64,64,66,67,69,80,81,81,91},new int[]{7,10,10,11,13,13,13,15,23,25,27,28,28,30,34,35,37,38,39,44,45,46,49,50,53,53,56,60,60,64,64,65,66,68,68,70,77,78,79,80,81,85,92,95},new int[]{1,3,7,7,9,11,12,19,19,20,22,22,25,26,34,38,43,45,47,49,50,54,55,55,57,60,62,62,64,69,70,72,72,76,77,79,83,89,93,94,95,98,99,99}}); param0.add(new int[][]{new int[]{-6}}); 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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,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,1,1,1,1,1}}); param0.add(new int[][]{new int[]{57,35,39,48,79,25,49,44,40,59,90,18,4,14,32,39,2,15,34,91,11,16,23,1,7,3,40,93,14,33,51,35,78,35,67,3,38,71},new int[]{57,4,10,9,40,48,47,9,33,91,47,12,66,45,90,89,94,69,71,43,83,23,30,15,52,78,42,34,65,45,35,9,48,4,6,1,40,13},new int[]{58,15,43,30,58,15,58,90,96,92,80,66,14,16,79,49,91,19,1,64,21,27,41,48,21,21,21,26,70,97,63,35,92,96,61,3,86,47},new int[]{92,91,51,18,77,83,67,81,77,78,53,40,53,35,43,16,39,69,10,38,19,3,33,94,60,84,95,76,23,52,72,67,14,61,26,52,81,62},new int[]{27,60,67,50,57,97,65,22,57,91,71,61,5,56,59,55,67,23,89,88,61,21,70,69,63,59,36,29,63,60,82,33,60,83,24,22,69,96},new int[]{89,59,51,55,68,44,41,11,19,44,14,47,14,3,23,84,76,95,19,69,67,62,42,69,43,18,93,93,6,18,16,37,28,46,53,82,5,64},new int[]{73,22,7,71,4,28,4,43,3,28,82,66,45,52,59,66,80,50,84,82,22,52,98,13,48,33,58,15,44,79,91,80,30,67,72,23,14,1},new int[]{70,78,31,58,42,81,50,88,23,99,7,59,1,63,60,8,69,81,19,96,61,16,37,47,69,83,70,77,72,45,41,34,78,71,71,6,94,53},new int[]{38,46,91,77,24,94,98,68,4,23,30,65,12,71,20,21,84,39,83,98,79,72,76,71,99,73,27,47,55,43,4,10,38,93,14,65,18,98},new int[]{66,76,94,19,66,43,17,53,69,25,48,29,70,65,90,93,6,85,21,33,12,90,66,32,14,88,13,6,12,5,57,75,87,44,72,45,66,48},new int[]{66,44,52,38,99,65,41,88,18,93,96,39,45,19,35,53,68,76,14,6,74,30,18,28,39,67,20,48,9,77,25,45,72,48,36,24,36,16},new int[]{14,90,11,65,5,97,61,91,5,47,11,85,83,39,69,12,76,44,52,24,35,99,23,94,56,55,71,19,3,86,7,1,44,20,95,81,77,43},new int[]{10,93,48,53,66,88,68,58,67,17,7,54,16,33,46,15,34,56,84,18,46,93,54,99,63,47,28,48,35,94,77,34,56,36,43,12,73,90},new int[]{8,56,60,26,78,18,28,30,65,81,84,40,74,17,52,46,28,4,14,41,2,91,9,16,85,82,59,58,63,35,1,13,48,39,1,12,31,34},new int[]{48,3,7,11,44,41,4,35,30,23,86,98,35,82,72,49,58,32,71,58,92,49,88,84,80,3,86,37,65,91,12,7,44,74,50,65,52,16},new int[]{27,21,48,22,70,83,45,34,84,45,39,9,33,76,51,19,82,27,30,83,93,62,21,84,13,24,22,95,86,33,18,74,88,95,41,91,51,7},new int[]{62,22,26,38,15,3,28,93,54,23,46,10,36,83,66,14,32,80,73,58,79,51,34,94,70,24,7,64,76,96,3,85,93,79,12,37,94,93},new int[]{33,20,76,50,37,56,92,79,66,76,28,69,38,6,90,30,51,95,34,15,40,24,47,99,50,3,5,8,50,35,27,30,44,31,64,79,13,73},new int[]{69,56,99,12,4,16,97,89,62,15,41,67,82,6,20,80,98,42,78,86,77,59,21,11,96,96,34,69,84,67,91,64,67,75,50,47,59,79},new int[]{82,78,57,77,3,60,27,93,26,98,24,38,49,31,57,44,23,33,68,66,26,17,4,76,11,10,7,98,73,57,55,37,41,57,82,29,80,86},new int[]{78,61,89,44,96,59,79,39,55,23,94,23,59,4,37,19,10,94,72,90,25,86,50,68,71,34,56,72,46,45,28,85,91,50,34,71,49,68},new int[]{46,60,27,21,44,61,86,9,64,78,53,97,30,57,24,67,38,30,61,87,79,40,20,59,31,20,2,22,96,63,9,8,81,96,19,60,97,40},new int[]{61,59,30,75,21,33,92,89,85,72,98,3,23,61,87,93,92,83,9,82,44,89,68,54,14,76,49,29,44,33,94,23,17,46,45,50,1,88},new int[]{53,90,59,33,63,59,94,93,7,61,96,16,51,52,3,42,9,10,94,66,14,89,72,94,99,14,74,45,78,99,54,53,80,19,87,48,12,38},new int[]{9,17,96,94,10,97,46,40,35,37,16,11,88,65,94,87,75,42,16,32,95,4,54,42,62,10,90,31,79,45,42,88,96,47,88,4,10,76},new int[]{1,14,14,41,6,62,47,66,23,51,65,6,16,47,32,22,93,54,72,82,40,24,94,62,25,61,41,14,95,50,98,30,65,22,85,79,3,10},new int[]{64,40,52,51,32,35,71,5,89,12,91,33,78,88,39,68,44,30,5,57,18,30,58,57,22,44,12,16,50,42,80,85,53,29,5,56,14,92},new int[]{35,81,5,71,97,39,34,19,78,75,51,49,39,12,80,2,90,35,25,48,87,75,23,92,33,78,39,37,70,74,62,92,12,99,18,33,89,28},new int[]{79,82,20,51,35,70,24,9,34,25,27,53,84,45,31,20,58,55,12,51,78,45,48,66,92,7,93,72,93,59,70,66,67,11,10,95,57,65},new int[]{56,23,53,92,41,98,86,27,56,38,95,34,5,83,80,49,10,71,54,40,81,44,91,61,96,22,53,7,60,35,65,93,2,59,92,60,80,70},new int[]{58,75,10,84,37,32,71,91,66,98,51,28,17,91,45,22,13,19,93,85,19,11,66,2,87,58,24,42,15,21,95,59,67,27,39,48,94,53},new int[]{48,39,19,44,34,20,42,38,95,24,69,5,12,75,17,5,72,70,91,24,20,45,14,29,43,10,27,98,93,21,89,23,40,38,36,99,90,82},new int[]{38,1,96,18,20,6,20,88,73,92,41,90,2,18,78,89,7,81,34,8,36,88,60,64,56,70,53,27,41,54,35,94,30,20,90,47,18,75},new int[]{49,44,96,84,67,89,40,83,21,42,41,3,19,59,94,65,56,16,79,61,59,63,35,32,2,8,73,65,87,56,83,16,85,83,80,11,92,74},new int[]{59,63,9,66,85,47,15,81,41,75,3,5,73,2,99,89,87,67,10,2,97,20,57,75,18,77,66,36,78,43,5,76,31,3,87,62,13,38},new int[]{68,88,92,3,70,43,61,91,7,17,56,91,74,15,31,8,17,25,75,5,55,46,73,48,21,53,9,23,45,30,63,67,29,53,30,68,58,41},new int[]{14,51,22,93,95,99,28,63,48,48,31,5,8,96,86,98,21,34,16,31,2,27,25,34,30,68,27,86,30,24,25,14,72,6,28,5,30,97},new int[]{93,73,8,62,72,47,31,64,16,42,84,12,40,49,52,62,96,3,95,10,35,62,69,77,31,90,51,13,91,58,6,77,5,86,81,19,76,12}}); List<Integer> param1 = new ArrayList<>(); param1.add(8); param1.add(6); param1.add(38); param1.add(7); param1.add(11); param1.add(14); param1.add(22); param1.add(0); param1.add(37); 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()); } }
1,537
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_SERIES_12_32_52_2N_12.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_SERIES_12_32_52_2N_12{ static int f_gold ( int n ) { int sum = 0 ; for ( int i = 1 ; i <= n ; i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 ) ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(14); param0.add(61); param0.add(37); param0.add(86); param0.add(47); param0.add(98); param0.add(70); param0.add(24); param0.add(76); param0.add(24); 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()); } }
1,538
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SWAP_TWO_NUMBERS_WITHOUT_USING_TEMPORARY_VARIABLE.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 SWAP_TWO_NUMBERS_WITHOUT_USING_TEMPORARY_VARIABLE{ static void f_gold ( int [ ] xp , int [ ] yp ) { xp [ 0 ] = xp [ 0 ] ^ yp [ 0 ] ; yp [ 0 ] = xp [ 0 ] ^ yp [ 0 ] ; xp [ 0 ] = xp [ 0 ] ^ yp [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,7,12,13,15,17,24,27,28,31,36,44,55,55,56,58,60,62,64,73,75,77,89,90,93,93,95,97,98}); param0.add(new int[]{36,51,6,25,13,-36,23,14,-80,-84,45,-81,20,36,66,-62,81,-7,5,0,-10,59,-56,88,-24,45,-21,-27,67,70,76,40,-4,-11,3,46,-94,22,71,16,63,82,-38,97,44,36,-11,-4}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{63,87,32,10,11,70,62,47,34,17,54,76,85,40,19,67,82,53,64,83,47,6,16,72,18,52,48,43,39,49,12,10,71,55,1,49,36,21,37,24,55,25,7,81,93,94,71,97,71}); param0.add(new int[]{-85,3}); param0.add(new int[]{1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,1,0,0,0,0,1}); param0.add(new int[]{2,3,4,5,6,8,14,16,16,17,19,21,21,25,26,26,29,33,36,39,46,53,55,56,66,77,81,84,84,86,86,88,89,89,92,97}); param0.add(new int[]{15,-37,13,-6,-52,91,-88,56,72,71,45,-60,77,-15,-43,-13,-16,92,85,21,-26,7,24,98,0,-57,19,-77,55,86,-63,34,-35,34,78,-78,5,-12,53,25,-21,-10,-49,76,2,98,6}); 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}); param0.add(new int[]{75,24,60,95,55}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{5,8,12,13,14,20,23,25,27,28,31,33,33,37,38,39,42,42,43,47,52,54,62,67,71,72,73,76,77,79,81,81,85,86,89,91,91,96,96,99}); param1.add(new int[]{-14,59,38,84,21,-24,-8,-30,48,33,-77,37,-42,87,82,-54,-78,92,-92,23,-80,79,-22,-61,-63,78}); param1.add(new int[]{0,0,0,0,0,1,1,1,1,1}); param1.add(new int[]{11,73,12,35,63,68,92,57,13,23,83,39,88,80,97,12,34,71,75,31,93,62,13,31}); param1.add(new int[]{-84,-71,-66,-63,-25,-23,-19,3,67,94,96}); param1.add(new int[]{0,0,0,1,0,1,1,1,0,0,0,0,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,0}); param1.add(new int[]{5,13,22,24,27,33,46,67,74,77,78,82,86,90,91}); param1.add(new int[]{-40}); param1.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}); param1.add(new int[]{80,24,77,24,54,26,66,80,38,65,75,51,35}); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{2,7,12,13,15,17,24,27,28,31,36,44,55,55,56,58,60,62,64,73,75,77,89,90,93,93,95,97,98}); filled_function_param0.add(new int[]{36,51,6,25,13,-36,23,14,-80,-84,45,-81,20,36,66,-62,81,-7,5,0,-10,59,-56,88,-24,45,-21,-27,67,70,76,40,-4,-11,3,46,-94,22,71,16,63,82,-38,97,44,36,-11,-4}); filled_function_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}); filled_function_param0.add(new int[]{63,87,32,10,11,70,62,47,34,17,54,76,85,40,19,67,82,53,64,83,47,6,16,72,18,52,48,43,39,49,12,10,71,55,1,49,36,21,37,24,55,25,7,81,93,94,71,97,71}); filled_function_param0.add(new int[]{-85,3}); filled_function_param0.add(new int[]{1,1,0,0,1,1,0,0,1,0,1,0,1,1,0,1,0,0,0,0,1}); filled_function_param0.add(new int[]{2,3,4,5,6,8,14,16,16,17,19,21,21,25,26,26,29,33,36,39,46,53,55,56,66,77,81,84,84,86,86,88,89,89,92,97}); filled_function_param0.add(new int[]{15,-37,13,-6,-52,91,-88,56,72,71,45,-60,77,-15,-43,-13,-16,92,85,21,-26,7,24,98,0,-57,19,-77,55,86,-63,34,-35,34,78,-78,5,-12,53,25,-21,-10,-49,76,2,98,6}); 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,1,1,1,1,1,1,1,1,1,1,1}); filled_function_param0.add(new int[]{75,24,60,95,55}); List<int [ ]> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(new int[]{5,8,12,13,14,20,23,25,27,28,31,33,33,37,38,39,42,42,43,47,52,54,62,67,71,72,73,76,77,79,81,81,85,86,89,91,91,96,96,99}); filled_function_param1.add(new int[]{-14,59,38,84,21,-24,-8,-30,48,33,-77,37,-42,87,82,-54,-78,92,-92,23,-80,79,-22,-61,-63,78}); filled_function_param1.add(new int[]{0,0,0,0,0,1,1,1,1,1}); filled_function_param1.add(new int[]{11,73,12,35,63,68,92,57,13,23,83,39,88,80,97,12,34,71,75,31,93,62,13,31}); filled_function_param1.add(new int[]{-84,-71,-66,-63,-25,-23,-19,3,67,94,96}); filled_function_param1.add(new int[]{0,0,0,1,0,1,1,1,0,0,0,0,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,0}); filled_function_param1.add(new int[]{5,13,22,24,27,33,46,67,74,77,78,82,86,90,91}); filled_function_param1.add(new int[]{-40}); filled_function_param1.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}); filled_function_param1.add(new int[]{80,24,77,24,54,26,66,80,38,65,75,51,35}); 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)) && Arrays.equals(param1.get(i), filled_function_param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
1,539
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_IF_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS.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_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS{ static boolean f_gold ( int [ ] a , int n ) { int count_odd = 0 , count_even = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ( a [ i ] & 1 ) == 1 ) count_odd ++ ; else count_even ++ ; } if ( count_odd % 2 == 1 && count_even % 2 == 1 ) return false ; else return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,1,1,7,7,8,10,10,10,14,15,18,20,23,24,24,26,30,32,32,33,36,42,43,46,48,51,51,52,53,58,58,59,59,59,60,67,71,72,74,76,77,83,84,86,90,91}); param0.add(new int[]{-90,-20,-60,-64,-24,84,-2,-32,28,-54,44,-96,52,88,20,-56,-2}); 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}); param0.add(new int[]{98,70,24,18,7,4,78,19,70,56,99,54,69,15,88,20,40,13,19,56,62}); param0.add(new int[]{-72,-66,-58,-20,36,80,92}); param0.add(new int[]{0,1}); param0.add(new int[]{6,13,14,16,21,26,26,28,29,35,38,42,47,47,62,67,77,81,81,83,84,88,90,96,97,98}); param0.add(new int[]{-48,-8,20,32,-90,-42,-6,-88,-72,42,66,-62,82,-4,8,12,-22,82,56,96,-54,92,-42,30,-18,14,-6,-66,34,16,-84,-94,48,-48,52,-60,-92,-16}); 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[]{45,86,53,80,27,45,1,85,91,93,92,43,75,86,81,48,21,34,5,10,88,42,7,15,96,85,62,86,52,37}); List<Integer> param1 = new ArrayList<>(); param1.add(30); param1.add(12); param1.add(36); param1.add(19); param1.add(6); param1.add(1); param1.add(17); param1.add(35); param1.add(14); param1.add(29); 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()); } }
1,540
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN.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_TRIANGLE_VALID_NOT_SIDES_GIVEN{ public static int f_gold ( int a , int b , int c ) { if ( a + b <= c || a + c <= b || b + c <= a ) return 0 ; else return 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(29); param0.add(83); param0.add(48); param0.add(59); param0.add(56); param0.add(68); param0.add(63); param0.add(95); param0.add(2); param0.add(11); List<Integer> param1 = new ArrayList<>(); param1.add(19); param1.add(34); param1.add(14); param1.add(12); param1.add(39); param1.add(85); param1.add(36); param1.add(34); param1.add(90); param1.add(16); List<Integer> param2 = new ArrayList<>(); param2.add(52); param2.add(49); param2.add(65); param2.add(94); param2.add(22); param2.add(9); param2.add(41); param2.add(37); param2.add(27); param2.add(1); 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()); } }
1,541
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.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{ static int f_gold ( int n ) { int dp [ ] [ ] = new int [ 10 ] [ n + 1 ] ; for ( int i = 0 ; i < 10 ; i ++ ) dp [ i ] [ 1 ] = 1 ; for ( int digit = 0 ; digit <= 9 ; digit ++ ) { for ( int len = 2 ; len <= n ; len ++ ) { for ( int x = 0 ; x <= digit ; x ++ ) dp [ digit ] [ len ] += dp [ x ] [ len - 1 ] ; } } int count = 0 ; for ( int i = 0 ; i < 10 ; i ++ ) count += dp [ i ] [ n ] ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(21); param0.add(40); param0.add(83); param0.add(93); param0.add(43); param0.add(98); param0.add(35); param0.add(86); param0.add(76); param0.add(88); 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()); } }
1,542
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE.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_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE{ static int f_gold ( int price [ ] , int n ) { int profit [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) profit [ i ] = 0 ; int max_price = price [ n - 1 ] ; for ( int i = n - 2 ; i >= 0 ; i -- ) { if ( price [ i ] > max_price ) max_price = price [ i ] ; profit [ i ] = Math . max ( profit [ i + 1 ] , max_price - price [ i ] ) ; } int min_price = price [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) { if ( price [ i ] < min_price ) min_price = price [ i ] ; profit [ i ] = Math . max ( profit [ i - 1 ] , profit [ i ] + ( price [ i ] - min_price ) ) ; } int result = profit [ n - 1 ] ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{9,10,10,12,17,18,23,32,41,44,47,50,59,69,69,75,82,84,87,89,97,99}); param0.add(new int[]{6,6,60,40,32,-70,-92,88,10,-8,-54,4,16,8,-44,80,-70,36,36,-74,-94,18,-64,-66,-46,0,-54,-84,16,-88,-34,-24,92,84,62}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{2,67,50,8,20,42,37,69,86,74,85,96,78,89,91}); param0.add(new int[]{-68,-52,-14,-2,18,22,30,34,64,64,70}); param0.add(new int[]{1,1,0,0,0,1,0,0,1,1,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,1,0,1}); param0.add(new int[]{4,17,19,28,29,30,30,30,35,36,36,38,40,40,42,43,45,51,55,57,58,59,64,65,66,82,84,85,87,91,92,94,98,98}); param0.add(new int[]{52,88,-40,60,30,8,-96,66,-96,-28,-56,-14,76,-92,56,58,64,-60,-90,26,64,-2,54,-24,54,-46,-44}); 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,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{82,14,51,12,5,15,50,88,91,82,16,98,23,58,86,91,30,81,7,73,67,47,10,50,43,31,19,2,22}); List<Integer> param1 = new ArrayList<>(); param1.add(20); param1.add(34); param1.add(13); param1.add(8); param1.add(9); param1.add(21); param1.add(25); param1.add(14); param1.add(22); 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()); } }
1,543
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE.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_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE{ static int f_gold ( int A [ ] , int B [ ] , int n ) { Set < Integer > mp = new HashSet < Integer > ( ) ; int result = 0 ; int curr_sum = 0 , curr_begin = 0 ; for ( int i = 0 ; i < n ; ++ i ) { while ( mp . contains ( A [ i ] ) ) { mp . remove ( A [ curr_begin ] ) ; curr_sum -= B [ curr_begin ] ; curr_begin ++ ; } mp . add ( A [ i ] ) ; curr_sum += B [ i ] ; result = Integer . max ( result , curr_sum ) ; } return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,8,10,10,16,23,33,36,43,47,50,55,56,72,84,85,86,86,88,90,92,99}); param0.add(new int[]{48,-22,84,76,50,-14,-82,28,86,-50,-40,10,48,20,-48,-84,-64,-48,-32,-84,-32,10,42,-10,-68,-16,-94,-76,42,-96,16,-64,60,8,-88,-62,82,-24,-28,40,18,8}); param0.add(new int[]{0,0,0,1}); param0.add(new int[]{74,64,93,72,75,90,46,72,91,98,57,58,76,29,88,3,86,1,78,74,56,54,57,3,94,2,14,32,67,62,1,30,78,95,40}); param0.add(new int[]{-94,-88,-68,-24,60,94}); param0.add(new int[]{0,0,0,0,0,1,0,0,1,0,0,0,0,1,1,0,0,0,0,0,1,0,1,0,1,1,1,0,0}); param0.add(new int[]{3,7,12,15,17,23,31,31,32,37,41,54,57,60,62,62,64,70,71,74,75,83,97,98}); param0.add(new int[]{-2,26,-74,96,-70,56,92,-74,-38,-18,36,44,-10,-26,26,-22,-58,78,86,22,76,50,88,-86,-80,-36,-48,90,-34,62,46,-56,-32}); 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}); param0.add(new int[]{86,30,87,99,8,1,24,46,12,21,43,73,28,3,35,49,14,37,63,98,65,43,86,69,27,60,45,88,25,86,11,9,86,73,40,70,49,50,95,69,94}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{8,26,30,35,45,47,55,56,59,61,64,66,67,69,73,77,78,81,82,85,86,99}); param1.add(new int[]{82,94,34,12,18,-68,14,-16,-30,-16,6,74,-68,76,-76,52,-32,-38,78,64,-60,-46,82,-60,98,-70,-52,-96,-6,-44,66,-66,22,-42,-66,4,-2,-48,-94,72,56,88}); param1.add(new int[]{0,0,1,1}); param1.add(new int[]{9,50,22,60,36,46,76,48,90,64,16,24,41,12,36,36,93,52,26,38,68,5,55,19,35,5,7,96,67,64,24,85,6,33,7}); param1.add(new int[]{-80,-72,-60,-42,-24,-6}); param1.add(new int[]{1,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,1,1,0,1,1,0,1,1,1,1,1,0}); param1.add(new int[]{3,10,10,12,12,14,15,19,19,20,25,27,27,28,40,41,50,51,53,57,60,65,75,99}); param1.add(new int[]{76,42,0,4,-96,-24,-50,-54,26,-8,-38,-46,42,-50,16,-2,-6,2,-8,56,64,-58,-96,2,-64,-66,-14,58,-76,-26,78,-96,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,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,66,77,34,98,75,43,27,79,32,54,40,29,47,63,15,23,33,59,76,27,31,92,43,12,20,97,67,11,12,83,79,52,46,51,36,87,96,90,6,62}); List<Integer> param2 = new ArrayList<>(); param2.add(20); param2.add(30); param2.add(2); param2.add(20); param2.add(4); param2.add(22); param2.add(22); param2.add(17); param2.add(39); param2.add(34); 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()); } }
1,544
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_WEIGHT_PATH_ENDING_ELEMENT_LAST_ROW_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_WEIGHT_PATH_ENDING_ELEMENT_LAST_ROW_MATRIX{ public static int f_gold ( int mat [ ] [ ] , int N ) { int dp [ ] [ ] = new int [ N ] [ N ] ; dp [ 0 ] [ 0 ] = mat [ 0 ] [ 0 ] ; for ( int i = 1 ; i < N ; i ++ ) dp [ i ] [ 0 ] = mat [ i ] [ 0 ] + dp [ i - 1 ] [ 0 ] ; for ( int i = 1 ; i < N ; i ++ ) for ( int j = 1 ; j < i + 1 && j < N ; j ++ ) dp [ i ] [ j ] = mat [ i ] [ j ] + Math . max ( dp [ i - 1 ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; int result = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( result < dp [ N - 1 ] [ i ] ) result = dp [ N - 1 ] [ i ] ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{1,3,17,22,24,29,36,38,41,42,44,44,47,48,49,51,52,54,64,69,70,77,79,82,86,86,87,88,97,99},new int[]{5,6,17,21,27,27,37,39,47,48,48,52,53,54,57,59,61,63,68,72,75,77,78,81,88,89,91,95,95,97},new int[]{2,8,10,16,17,18,18,18,20,27,33,35,36,42,48,51,56,66,72,72,75,76,76,76,84,85,91,94,96,98},new int[]{1,2,4,11,12,12,14,21,24,26,30,33,37,42,43,47,54,56,62,64,67,68,69,71,72,73,86,86,90,93},new int[]{1,1,3,7,9,10,11,12,14,14,15,17,21,25,26,40,45,46,46,48,49,54,56,60,64,68,68,73,93,93},new int[]{8,11,12,13,13,15,19,20,24,27,29,31,32,33,34,37,39,42,45,50,51,61,65,68,75,81,84,85,87,94},new int[]{12,16,17,24,34,34,35,40,43,48,50,51,53,55,60,60,62,66,68,70,71,73,77,83,84,86,88,95,96,97},new int[]{1,5,7,18,18,22,32,36,38,38,40,43,46,49,50,54,58,61,71,74,78,78,79,82,86,87,87,88,90,95},new int[]{4,11,22,26,28,35,35,37,39,42,45,46,51,57,60,61,62,63,65,65,79,79,79,82,83,87,89,90,91,98},new int[]{6,7,7,8,9,11,13,16,18,23,29,37,38,41,44,46,50,50,51,56,58,67,71,74,77,79,80,90,91,97},new int[]{3,7,10,15,19,20,22,28,28,32,33,36,36,38,41,49,51,54,63,66,66,70,72,79,87,88,89,92,93,98},new int[]{3,8,10,14,21,25,33,35,37,37,43,44,45,50,59,62,63,75,79,79,79,84,85,86,87,87,88,90,91,96},new int[]{2,4,7,12,13,18,23,23,28,29,32,34,37,37,37,38,41,44,45,47,48,49,59,64,72,75,87,92,93,98},new int[]{2,4,5,5,11,14,18,23,24,27,32,35,35,37,39,40,45,48,49,52,60,66,68,71,72,74,78,81,91,92},new int[]{4,4,4,6,11,18,20,23,24,29,32,33,37,40,42,47,51,52,58,59,62,67,68,75,77,78,80,85,89,95},new int[]{5,5,19,21,22,23,29,30,32,39,42,42,44,44,45,46,52,55,59,63,65,76,78,80,81,82,84,93,94,97},new int[]{3,4,6,8,10,15,15,17,27,28,34,36,39,42,53,54,59,63,65,66,70,71,72,80,80,91,92,94,95,99},new int[]{1,7,12,13,16,25,32,32,36,46,46,49,52,55,61,61,67,68,69,72,74,76,77,78,79,81,85,90,90,92},new int[]{2,12,12,13,18,20,25,28,31,31,34,36,38,39,42,43,44,47,54,60,75,76,77,80,82,83,86,90,91,91},new int[]{3,8,9,11,12,14,14,14,19,25,27,29,43,45,48,50,50,56,58,61,63,65,68,71,73,81,83,83,86,93},new int[]{11,15,15,15,15,18,28,29,33,33,36,43,44,48,50,50,53,55,59,59,60,61,62,63,75,78,81,82,87,94},new int[]{4,7,8,10,11,12,19,24,31,36,36,37,40,41,46,48,49,51,57,62,73,75,78,81,82,86,86,91,97,97},new int[]{5,5,7,8,10,14,15,17,19,21,22,23,31,34,36,43,46,58,60,72,72,75,77,81,83,84,86,91,96,98},new int[]{6,10,13,15,22,27,28,29,30,31,32,35,35,36,37,39,39,43,44,47,55,68,68,69,77,83,94,94,98,99},new int[]{4,4,5,6,6,10,18,27,28,29,31,33,34,41,43,44,54,56,63,74,76,77,80,80,83,89,89,90,98,99},new int[]{2,7,15,19,23,23,36,41,44,46,47,49,53,58,58,60,60,66,70,73,76,77,78,80,80,88,88,91,93,94},new int[]{3,3,9,9,10,13,15,19,20,23,25,33,36,37,47,54,58,60,60,65,71,73,81,88,89,90,92,94,94,96},new int[]{6,7,11,19,22,27,27,31,31,33,34,44,46,47,47,48,49,53,53,56,60,60,70,72,79,80,86,93,94,96},new int[]{2,7,7,7,8,10,13,15,17,18,27,27,30,33,33,34,37,41,43,47,55,55,59,71,71,75,78,78,84,85},new int[]{5,6,7,7,14,21,24,26,29,31,32,34,40,42,43,45,46,53,57,58,67,73,74,77,81,85,88,91,91,92}}); param0.add(new int[][]{new int[]{62,44,46,46,-20,-40,24,42,-66,-90,62,-98,60},new int[]{62,88,-38,-30,44,-40,70,-70,96,12,20,-46,-96},new int[]{48,28,-90,82,36,-74,62,70,-54,94,0,58,56},new int[]{46,-26,-40,86,-54,-32,28,10,42,-82,-92,32,82},new int[]{-34,-36,-12,-26,82,84,34,20,18,-28,-2,2,-84},new int[]{0,-18,-24,72,56,58,10,36,-64,30,28,-76,-18},new int[]{-16,20,0,62,66,-28,-4,42,46,-84,-50,-86,-84},new int[]{76,62,52,-38,-76,14,32,-76,-46,-8,-86,22,16},new int[]{16,-74,6,30,-2,-30,88,90,-66,44,34,-80,-32},new int[]{72,-92,92,-42,-8,50,-8,54,18,22,36,32,-32},new int[]{72,-90,-82,-60,-58,-66,-76,84,64,34,-90,20,6},new int[]{4,56,-4,80,-62,-66,8,36,-30,76,-18,-74,-34},new int[]{-70,26,-70,-38,-44,-80,14,42,-34,-86,-90,80,60}}); param0.add(new int[][]{new int[]{0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1},new int[]{0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,0,0,1},new int[]{0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1},new int[]{0,0,0,0,0,0,0,1},new int[]{0,0,0,0,0,1,1,1}}); param0.add(new int[][]{new int[]{89,8,34,49,96},new int[]{58,75,47,25,3},new int[]{45,52,96,99,96},new int[]{34,69,92,92,8},new int[]{27,80,63,82,25}}); param0.add(new int[][]{new int[]{-98,-94,-92,-86,-86,-86,-84,-78,-76,-70,-68,-66,-64,-58,-56,-52,-42,-40,-38,-38,-36,-32,-30,-24,-20,-12,-8,4,4,6,8,12,18,22,26,30,32,56,58,72,76,78,80,82,88,94,96,98},new int[]{-94,-94,-92,-84,-84,-82,-80,-80,-80,-78,-78,-76,-74,-68,-64,-64,-58,-54,-48,-46,-40,-38,-36,-30,-22,-22,-12,-12,-6,-2,2,4,6,22,22,22,24,24,24,24,26,42,44,50,52,54,66,80},new int[]{-98,-92,-92,-84,-80,-76,-76,-70,-64,-60,-60,-52,-48,-48,-46,-46,-36,-32,-30,-24,-22,-16,-14,-8,-8,-4,-2,0,2,2,2,8,10,12,22,32,38,38,40,48,64,68,76,78,78,86,96,96},new int[]{-98,-96,-88,-86,-78,-78,-70,-68,-62,-60,-58,-42,-38,-38,-38,-36,-36,-32,-28,-26,-24,-12,-10,-4,2,12,12,18,26,32,34,36,38,44,44,50,52,54,54,56,56,58,70,74,76,82,86,90},new int[]{-98,-96,-96,-94,-90,-90,-90,-86,-82,-78,-76,-74,-72,-68,-66,-60,-52,-46,-44,-44,-38,-38,-34,-32,-22,-20,-18,-14,8,8,12,12,12,16,20,38,40,44,52,76,78,80,82,86,90,90,96,98},new int[]{-88,-84,-84,-80,-78,-70,-68,-66,-62,-62,-54,-52,-48,-42,-42,-40,-32,-30,-26,-26,-24,-24,-14,-6,-4,-2,-2,4,4,8,22,24,40,42,52,52,56,56,58,64,72,72,74,74,86,92,96,98},new int[]{-98,-98,-92,-82,-76,-72,-68,-66,-64,-62,-56,-50,-48,-46,-46,-40,-40,-40,-38,-28,-28,-24,-22,-20,-20,-10,-6,4,6,10,12,26,32,38,38,40,42,56,60,64,64,72,72,76,84,90,94,98},new int[]{-98,-86,-72,-72,-66,-66,-64,-58,-56,-54,-54,-50,-44,-44,-36,-32,-30,-28,-26,-18,-14,-6,-4,6,6,10,10,14,22,28,38,40,46,46,50,52,54,56,60,68,68,72,76,90,90,92,92,98},new int[]{-90,-86,-86,-84,-76,-74,-70,-66,-58,-58,-54,-50,-48,-44,-38,-38,-36,-34,-30,-22,-22,-8,-6,4,6,6,6,8,10,24,24,28,32,32,32,36,44,48,48,50,52,64,70,74,76,92,94,96},new int[]{-96,-94,-84,-76,-76,-70,-68,-66,-56,-50,-50,-48,-46,-42,-42,-40,-40,-38,-38,-36,-36,-34,-30,-24,-22,-6,-4,-2,2,4,10,12,16,24,28,32,38,46,50,56,56,62,64,66,74,74,98,98},new int[]{-98,-96,-92,-88,-88,-84,-82,-78,-68,-66,-54,-52,-52,-50,-44,-40,-40,-38,-34,-34,-30,-26,-26,-24,-18,-14,-10,4,6,6,16,20,24,26,26,32,36,38,56,66,70,78,78,84,86,88,88,90},new int[]{-94,-90,-86,-86,-86,-86,-84,-82,-78,-78,-76,-72,-68,-64,-64,-62,-46,-42,-42,-28,-26,-18,-16,-10,-8,-2,0,10,10,12,18,18,26,26,32,34,34,40,50,54,56,58,62,66,66,82,84,94},new int[]{-98,-94,-88,-86,-84,-80,-80,-78,-78,-74,-72,-72,-70,-70,-68,-66,-66,-64,-50,-44,-28,-24,-16,-6,-4,0,2,8,12,22,26,32,38,38,50,54,58,58,64,64,66,70,78,86,88,90,96,98},new int[]{-96,-94,-90,-82,-78,-76,-76,-72,-64,-62,-54,-52,-50,-46,-44,-36,-30,-28,-28,-28,-22,-14,-12,0,0,2,6,6,10,18,22,22,24,28,28,30,34,36,36,42,46,48,54,66,72,76,86,96},new int[]{-98,-96,-92,-92,-90,-88,-86,-82,-78,-70,-68,-66,-60,-58,-48,-48,-46,-30,-26,-22,-20,-16,-12,-8,-4,-4,4,16,22,32,34,34,36,36,40,52,60,62,64,66,66,74,74,78,82,82,86,94},new int[]{-92,-90,-88,-84,-82,-80,-78,-76,-74,-60,-56,-48,-48,-48,-48,-42,-38,-38,-30,-28,-28,-26,-12,-12,-10,-10,-2,14,16,22,26,34,42,44,52,54,56,58,58,60,62,66,70,82,84,90,94,96},new int[]{-96,-92,-92,-84,-80,-76,-74,-74,-72,-70,-66,-66,-62,-60,-58,-56,-56,-50,-36,-34,-26,-10,2,2,10,10,10,10,12,18,22,22,34,34,40,60,62,62,68,72,76,78,82,82,82,82,94,96},new int[]{-96,-96,-88,-84,-78,-72,-68,-62,-56,-56,-52,-38,-32,-24,-20,-18,-18,-16,-10,-6,8,8,12,18,24,24,26,28,30,30,32,32,56,62,64,66,66,72,74,74,78,84,84,86,88,92,92,98},new int[]{-92,-86,-78,-68,-68,-68,-64,-58,-56,-48,-44,-38,-36,-34,-26,-22,-20,-18,-8,-6,0,2,4,12,12,18,20,22,30,32,36,38,42,44,46,50,50,52,56,58,62,64,68,70,70,82,90,98},new int[]{-94,-92,-92,-90,-88,-84,-80,-76,-74,-72,-72,-68,-62,-62,-56,-54,-50,-44,-42,-42,-30,-20,-16,-6,-6,12,14,16,18,30,30,40,42,44,54,58,58,68,74,74,80,84,84,86,88,94,96,96},new int[]{-90,-86,-84,-84,-78,-78,-70,-70,-64,-56,-52,-50,-48,-48,-48,-46,-42,-40,-40,-30,-30,-28,-24,-22,-18,-16,-14,-6,-2,4,10,12,14,14,20,26,32,44,58,64,68,68,74,76,76,82,86,88},new int[]{-98,-84,-80,-80,-78,-78,-78,-76,-68,-62,-56,-50,-34,-30,-30,-12,-8,-4,2,8,10,12,14,22,24,26,36,38,38,44,46,48,56,58,62,64,64,66,66,70,70,74,78,82,88,90,94,96},new int[]{-96,-96,-96,-96,-94,-94,-90,-86,-84,-80,-78,-74,-64,-60,-56,-54,-42,-38,-38,-38,-36,-34,-18,-16,-14,-14,-10,-10,-10,-6,-4,8,14,20,32,42,44,48,54,54,56,70,70,72,74,80,84,94},new int[]{-96,-94,-86,-84,-78,-76,-70,-66,-62,-60,-56,-56,-54,-54,-52,-52,-50,-46,-46,-34,-32,-32,-28,-16,-12,-6,0,16,18,18,20,20,28,34,38,40,42,42,52,56,62,66,66,70,82,84,88,98},new int[]{-86,-84,-80,-78,-62,-60,-58,-56,-54,-52,-48,-44,-40,-38,-38,-26,-26,-24,-24,-18,-10,-6,2,8,12,16,22,26,32,36,42,44,46,48,52,52,52,62,66,70,78,78,78,80,84,90,92,92},new int[]{-98,-96,-88,-86,-82,-78,-78,-72,-72,-70,-64,-64,-60,-58,-54,-52,-46,-42,-30,-18,-14,-2,2,2,6,12,20,24,24,28,32,38,38,48,54,58,60,66,68,70,70,74,78,80,82,84,86,90},new int[]{-98,-88,-82,-82,-76,-76,-74,-70,-70,-68,-66,-64,-62,-58,-56,-52,-40,-38,-38,-38,-38,-36,-30,-26,-26,-12,-2,4,6,16,20,24,26,26,28,34,44,50,60,68,72,74,78,84,84,88,90,90},new int[]{-98,-98,-96,-94,-88,-88,-86,-82,-66,-64,-62,-62,-40,-38,-34,-20,-14,-12,-10,-8,0,6,10,10,12,18,22,26,26,28,32,36,40,44,44,46,64,68,70,72,74,78,80,82,82,82,92,96},new int[]{-94,-94,-92,-88,-88,-84,-82,-78,-78,-76,-72,-64,-60,-56,-54,-54,-50,-48,-46,-42,-32,-28,-28,-24,-22,-22,-16,-14,-12,-12,4,10,16,16,16,28,30,40,48,56,62,64,68,76,88,90,92,98},new int[]{-94,-90,-88,-80,-76,-76,-76,-76,-72,-72,-68,-68,-68,-68,-66,-64,-62,-62,-54,-52,-46,-44,-36,-34,-20,-20,-16,-16,-10,-8,0,4,22,24,28,36,38,44,50,52,60,64,68,72,76,84,86,88},new int[]{-98,-98,-96,-94,-92,-80,-74,-72,-68,-68,-66,-64,-64,-62,-54,-52,-52,-28,-28,-28,-20,-10,2,6,6,14,16,16,24,28,28,32,32,36,38,44,44,46,50,58,64,68,78,86,90,90,96,98},new int[]{-96,-92,-80,-78,-68,-56,-54,-54,-44,-44,-36,-34,-34,-32,-30,-26,-22,-12,-8,-2,-2,-2,6,8,8,20,20,24,28,32,36,36,38,40,42,44,44,46,48,52,54,56,60,68,70,76,80,86},new int[]{-96,-86,-82,-82,-78,-76,-74,-68,-62,-54,-50,-48,-40,-38,-36,-34,-32,-26,-14,-12,-12,-6,-4,0,8,10,14,20,20,26,28,40,44,46,48,56,58,60,62,66,68,76,78,86,88,88,90,94},new int[]{-98,-96,-86,-86,-84,-76,-76,-72,-72,-70,-64,-62,-58,-58,-54,-48,-46,-42,-32,-28,-28,-26,-24,-20,-14,0,0,0,0,2,10,14,18,48,50,50,52,56,58,60,62,68,76,82,86,88,94,94},new int[]{-96,-92,-86,-82,-82,-80,-80,-78,-76,-74,-72,-62,-62,-56,-56,-50,-40,-30,-28,-18,-18,-12,-10,0,4,10,12,12,16,18,18,18,22,30,34,42,68,74,82,86,86,90,90,90,92,92,94,94},new int[]{-92,-90,-88,-82,-82,-80,-74,-70,-66,-60,-58,-54,-48,-44,-40,-38,-32,-30,-26,-4,2,2,10,16,18,26,30,32,32,54,56,56,58,60,62,64,64,66,72,76,78,78,78,80,80,82,86,92},new int[]{-82,-82,-76,-74,-70,-66,-62,-62,-56,-54,-46,-46,-42,-36,-32,-30,-30,-26,-24,-22,-20,-10,-8,4,8,14,20,22,26,36,38,46,46,46,50,50,52,54,54,58,68,76,80,84,86,86,90,98},new int[]{-98,-92,-92,-82,-78,-76,-62,-56,-54,-50,-50,-48,-48,-46,-44,-44,-34,-26,-24,-20,-16,-2,16,16,22,28,28,30,36,36,38,38,40,42,42,44,50,56,56,60,62,74,78,90,92,94,96,98},new int[]{-96,-92,-92,-86,-84,-74,-56,-54,-50,-42,-38,-36,-30,-28,-24,-22,-14,-10,-10,-10,-8,-8,0,4,8,8,10,18,24,24,30,30,34,38,38,42,44,44,50,54,54,66,72,74,78,84,92,98},new int[]{-90,-88,-80,-70,-56,-56,-54,-54,-50,-44,-44,-42,-40,-38,-26,-22,-22,-16,-14,-8,0,2,18,20,34,36,36,40,42,44,46,46,48,54,54,54,56,68,68,72,72,72,76,84,86,90,92,96},new int[]{-98,-96,-94,-86,-82,-76,-76,-70,-70,-68,-64,-48,-38,-38,-36,-28,-28,-26,-20,-18,-6,-2,-2,2,4,6,8,8,12,12,14,16,26,30,30,34,44,44,48,48,56,72,80,80,84,84,92,94},new int[]{-90,-88,-84,-74,-74,-72,-70,-70,-68,-68,-64,-56,-52,-50,-40,-38,-32,-28,-22,-14,-14,-12,-8,-4,-2,8,10,14,14,18,22,24,30,32,36,40,58,62,64,64,64,68,72,74,82,94,98,98},new int[]{-98,-92,-88,-80,-76,-70,-70,-66,-58,-56,-56,-40,-32,-26,-18,-6,-4,-2,0,0,0,2,2,6,18,20,26,32,46,46,48,48,48,52,66,68,68,68,70,70,82,82,84,86,92,96,96,98},new int[]{-98,-96,-92,-92,-92,-82,-72,-68,-66,-62,-46,-44,-44,-42,-38,-34,-32,-26,-26,-16,-12,-12,-10,-6,-6,-2,0,0,4,10,12,12,14,30,36,42,46,54,58,58,66,68,68,70,90,92,96,98},new int[]{-92,-86,-76,-76,-76,-72,-72,-68,-68,-58,-48,-40,-40,-36,-36,-26,-18,-14,-12,-10,-8,-8,2,8,12,16,20,24,26,30,30,34,42,42,46,56,60,62,66,72,78,78,82,82,88,90,92,92},new int[]{-92,-90,-90,-88,-84,-78,-70,-64,-60,-54,-42,-36,-34,-32,-30,-20,-14,-10,-8,-2,0,8,10,10,20,24,28,32,42,42,42,50,54,56,60,60,60,68,68,72,78,78,86,86,92,92,98,98},new int[]{-98,-98,-96,-96,-94,-90,-88,-86,-80,-78,-76,-72,-58,-52,-48,-34,-34,-28,-28,-24,-24,-18,-16,-12,-8,-8,-6,8,10,12,12,12,12,26,30,30,38,52,52,64,68,72,74,80,80,82,88,90},new int[]{-92,-90,-82,-80,-72,-66,-52,-44,-44,-42,-42,-36,-34,-32,-26,-24,-22,-20,-18,-18,-16,-16,-16,-2,2,4,8,10,16,22,24,36,38,40,46,50,56,58,64,66,74,74,84,84,88,92,96,98}}); param0.add(new int[][]{new int[]{0,1,0,0,0,1,0,1,0,0,1,0,1,1,0,1,1,1,1,0,1,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0},new int[]{0,0,1,0,1,0,0,1,0,0,0,0,1,0,0,0,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,0,0,1,1,0,1},new int[]{0,0,0,1,0,1,1,1,1,0,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0,1,1,0,0,0,1},new int[]{1,0,1,0,0,1,1,1,1,0,0,1,1,1,0,0,1,0,0,0,0,1,1,1,1,0,1,1,1,1,1,0,1,0,0,0,0},new int[]{0,0,1,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,1,1,0,0,0,0,1,1,1,0,1,1,0,0,0,0,0,0,1},new int[]{0,0,1,1,1,1,1,0,0,1,1,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,1,1,1,0,0,0,1,0},new int[]{0,1,1,0,0,1,1,1,0,0,1,0,0,0,1,0,1,0,1,1,0,0,1,1,0,1,1,0,0,0,0,1,0,0,0,0,1},new int[]{1,0,0,0,0,1,1,1,1,0,1,1,0,1,1,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,1,0},new int[]{1,0,1,0,0,1,0,1,1,1,0,1,0,1,0,1,1,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,0,1},new int[]{1,1,0,1,1,0,1,1,1,1,1,1,1,1,0,1,1,1,0,1,0,1,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0},new int[]{1,0,1,1,0,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0},new int[]{1,0,1,1,0,1,1,1,1,0,1,0,1,1,1,0,0,0,0,1,0,1,0,1,1,0,1,1,1,1,1,0,0,1,1,0,0},new int[]{0,1,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,0,0,1,1,1,0,1,0,1,0,0,1,0,0,0,0,1},new int[]{0,0,0,1,1,0,1,1,1,1,1,1,1,0,0,0,1,0,1,1,0,0,0,0,1,0,0,1,1,1,1,1,0,0,1,0,1},new int[]{0,0,0,0,0,1,0,0,0,0,1,1,1,0,1,1,1,1,0,0,0,0,1,0,0,0,1,1,1,0,0,0,0,1,0,1,1},new int[]{0,1,0,0,0,0,1,1,0,1,1,1,0,0,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,0,0,1,1,0,0,0,1},new int[]{1,1,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,1,0,1,1,1,0,1,0,1,1,0,0,1,1,1,1,1,1,0,1},new int[]{0,1,1,0,1,1,0,1,0,1,1,0,0,1,0,0,0,1,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0,0,1,0,0},new int[]{1,1,0,0,1,1,0,0,1,0,1,1,1,0,0,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,0,0,1,1,0,1,0},new int[]{1,0,0,1,1,0,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0,0,0,1,0,1,0,0,1},new int[]{0,0,1,0,0,0,1,1,1,1,1,0,1,0,1,0,1,1,0,0,0,0,1,0,0,1,0,0,0,1,0,1,0,1,1,0,0},new int[]{0,0,0,0,1,1,0,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0,0,0,0,0,0,1,1,0,1,0,1,0,0,0,1},new int[]{0,0,1,1,0,1,1,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,1,1,0,1,1,0,0,1,0,0,0,0,1},new int[]{0,1,0,0,1,1,1,1,0,0,1,0,0,0,1,1,1,1,1,1,1,0,0,1,0,0,1,0,0,1,1,0,1,1,0,1,0},new int[]{1,0,1,0,1,0,1,0,1,0,0,1,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,0,0,1,1,0,1,0},new int[]{0,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,1,1,1,1,1,0,1,1,0,0,1,0,1,0,0,0,1,0},new int[]{1,1,1,0,1,0,0,1,1,1,1,1,0,0,1,1,1,0,0,1,1,0,0,1,1,0,0,0,0,0,1,1,0,0,0,0,1},new int[]{1,1,1,0,0,1,0,1,0,0,1,0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,1,1,0,0,0,1,0,1,0},new int[]{1,1,1,0,1,1,0,1,1,0,1,0,0,0,1,0,1,1,1,1,0,0,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1},new int[]{0,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,0,0,0,0,1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,0},new int[]{0,1,1,1,0,0,1,1,1,0,1,0,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,0,0,0,0,0,0,1,0,0,0},new int[]{1,1,1,1,0,0,1,1,0,1,1,1,1,0,1,0,1,1,0,0,1,1,1,0,1,1,0,1,1,1,0,1,1,1,1,0,1},new int[]{1,1,1,0,1,1,0,1,0,1,0,0,1,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0},new int[]{1,0,0,1,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0,0,1,0,0,0,0,0,0,1,1,1,1,1,0,0,1,0,1},new int[]{0,1,0,1,0,1,0,0,1,1,1,1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0,0,1,1,0,0,0,1,1,1,1},new int[]{1,1,0,1,1,0,0,1,1,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,1,1,1,1,1,0,0,0},new int[]{1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,0,1,0,1,1,1,1,1,1,0,0,0,1,1,0,0,0,1,0,0,0}}); param0.add(new int[][]{new int[]{1,3,3,4,4,5,8,11,13,15,16,18,20,21,24,25,25,35,36,37,39,40,40,41,41,42,42,44,44,44,45,47,49,54,61,62,64,64,70,72,82,85,87,92,93,93,94,95},new int[]{1,2,2,3,4,5,5,6,8,8,9,11,15,16,19,20,20,22,22,25,33,36,37,39,40,41,41,44,54,60,62,65,67,68,68,70,72,77,77,78,78,79,85,86,87,88,93,99},new int[]{1,1,1,1,3,5,6,7,7,10,12,13,13,15,17,20,21,21,22,25,31,33,37,40,41,41,46,50,53,54,55,57,61,63,64,65,68,69,76,76,81,81,82,82,84,87,89,90},new int[]{1,1,1,1,4,6,19,19,19,20,21,21,22,22,23,23,25,25,26,26,29,30,34,34,35,37,48,48,50,52,59,60,62,63,64,66,68,68,75,85,88,89,91,92,94,95,97,99},new int[]{2,3,7,12,15,16,18,20,20,23,24,27,29,31,33,36,36,37,38,44,47,52,52,54,55,61,62,62,64,66,66,73,74,75,76,80,81,81,83,83,84,87,87,89,92,92,96,99},new int[]{1,4,4,5,6,8,12,12,14,16,21,24,24,27,29,34,35,39,41,44,44,46,48,50,52,52,53,56,60,62,64,67,72,77,78,80,81,83,84,84,85,88,91,93,93,94,94,95},new int[]{3,3,4,11,11,12,15,15,17,17,18,20,24,24,27,27,29,32,35,37,39,39,41,43,43,44,48,49,53,60,69,70,73,74,75,76,76,84,85,85,85,87,87,89,90,91,93,93},new int[]{1,11,11,12,15,15,16,16,17,17,18,19,20,23,27,27,31,32,32,35,37,39,39,41,43,45,47,49,49,49,56,60,61,64,67,71,73,78,79,79,81,82,83,85,87,89,92,98},new int[]{5,6,9,13,14,16,17,20,20,22,22,23,28,29,29,30,32,33,36,37,45,47,49,49,50,50,52,56,60,62,65,66,69,70,71,77,78,78,80,82,83,86,86,88,88,90,90,99},new int[]{3,11,12,13,14,14,15,19,19,20,26,27,28,31,32,32,32,35,35,39,39,42,43,49,54,55,57,58,59,60,61,62,62,65,65,67,73,74,81,82,83,86,88,88,93,95,95,97},new int[]{1,3,3,5,7,11,17,20,20,21,21,23,24,25,26,26,30,32,35,37,38,39,42,44,47,47,48,49,51,57,57,59,60,61,62,63,66,69,70,73,78,80,84,84,89,92,96,97},new int[]{1,1,2,11,12,13,15,17,19,21,22,24,27,28,28,29,30,34,39,40,40,44,45,48,57,58,58,59,61,63,63,64,66,66,68,69,70,71,74,78,79,82,84,86,89,90,94,97},new int[]{2,3,7,10,10,12,13,13,17,17,19,21,36,47,48,48,51,51,52,55,57,61,61,61,65,70,71,73,74,74,75,75,76,78,79,80,80,85,86,87,87,89,91,94,95,97,97,97},new int[]{1,2,2,8,9,9,9,14,16,17,23,24,27,29,30,30,34,35,36,43,44,44,47,49,50,54,56,57,58,63,67,68,69,70,72,76,77,80,81,84,84,86,88,90,93,96,96,96},new int[]{2,3,3,5,5,7,7,11,18,19,19,20,23,24,27,27,28,30,30,36,38,39,40,48,50,51,53,57,57,66,67,68,73,77,78,79,82,84,85,87,88,89,95,96,97,98,99,99},new int[]{3,8,10,10,12,13,13,15,16,16,17,21,21,22,23,24,26,26,27,29,32,34,35,37,42,42,52,54,61,61,65,65,66,70,73,74,76,79,83,83,85,89,91,93,94,96,97,97},new int[]{3,5,6,7,9,10,13,16,16,19,23,24,24,26,28,29,30,32,33,36,37,37,41,41,41,42,42,44,45,49,50,52,55,57,58,60,61,63,75,77,77,79,80,81,86,89,94,99},new int[]{1,10,13,14,15,17,18,20,21,22,23,25,26,28,32,37,39,44,46,47,47,47,47,50,51,52,55,55,58,61,69,72,73,77,77,78,80,81,82,84,88,91,93,94,95,96,97,98},new int[]{1,5,5,13,13,17,26,28,30,32,34,41,43,44,45,45,46,46,49,52,53,56,57,61,61,62,63,63,63,64,65,67,69,70,73,76,77,80,80,81,82,87,87,88,89,89,93,96},new int[]{5,11,12,12,18,19,19,22,24,26,26,26,30,32,33,35,35,36,38,39,42,44,46,48,52,56,57,58,59,65,65,66,67,67,68,70,73,73,75,76,77,78,80,83,84,88,92,99},new int[]{5,6,9,13,17,20,20,21,22,24,25,26,30,32,33,36,37,38,38,40,44,45,48,53,55,58,58,58,59,61,63,63,63,65,67,72,75,75,75,77,77,77,79,82,88,93,97,97},new int[]{9,13,14,16,17,18,21,22,22,23,24,25,33,37,40,41,42,46,49,49,51,54,57,58,58,60,67,71,73,74,74,75,77,78,80,82,85,85,86,86,86,87,91,92,93,95,97,98},new int[]{1,3,10,11,14,18,18,19,23,24,26,28,33,36,37,42,42,47,47,48,48,52,53,56,57,59,61,63,63,64,65,67,69,71,75,77,78,79,83,83,83,85,86,86,92,96,97,97},new int[]{3,5,6,7,7,9,13,13,18,25,27,28,29,30,32,34,37,43,44,51,52,53,54,59,63,63,64,66,68,70,70,72,72,73,77,78,80,82,83,83,84,85,85,93,95,97,99,99},new int[]{4,6,7,9,9,20,20,22,31,33,34,35,35,38,40,41,42,42,44,46,47,50,52,54,57,58,60,61,62,63,63,64,65,70,72,74,80,81,87,87,88,88,92,92,95,99,99,99},new int[]{3,5,9,10,10,15,18,20,21,21,23,25,28,29,37,38,40,40,40,46,51,53,55,57,59,59,60,67,68,71,72,73,75,76,79,79,81,83,86,87,88,90,90,90,92,95,96,98},new int[]{5,7,8,9,9,12,14,16,18,18,18,24,25,26,28,28,29,30,32,37,38,44,44,45,46,48,51,55,55,56,58,58,62,63,64,67,71,74,76,81,86,87,88,90,90,91,95,97},new int[]{4,5,13,13,16,19,19,20,22,26,27,28,30,30,31,32,33,39,39,41,41,43,45,49,50,51,64,66,67,71,73,75,78,78,79,82,84,86,87,87,88,90,91,91,92,93,96,97},new int[]{2,3,5,11,16,20,21,21,25,29,31,34,36,36,37,37,38,38,44,45,46,54,60,60,61,61,67,67,67,70,71,72,76,77,79,80,83,84,84,87,87,88,90,92,93,98,99,99},new int[]{1,2,5,5,12,13,13,15,18,19,24,25,25,26,28,29,30,33,34,35,35,36,36,37,38,42,44,49,50,53,58,58,58,60,65,67,72,75,77,78,81,84,88,88,90,91,94,97},new int[]{5,5,6,7,8,11,11,13,19,23,25,35,37,40,40,46,47,48,48,49,51,58,60,61,63,65,67,68,71,72,76,77,79,80,84,87,88,88,89,90,92,94,94,96,96,97,97,99},new int[]{1,2,3,3,5,5,13,18,19,23,31,32,34,35,36,38,39,40,42,49,51,53,54,56,62,64,64,64,66,67,67,67,69,72,74,74,80,81,83,83,84,85,91,91,94,95,96,98},new int[]{1,2,5,9,10,11,14,15,16,16,24,27,30,32,35,37,39,39,40,43,48,49,50,54,57,57,58,59,60,63,63,64,64,64,68,70,76,77,80,82,85,87,88,90,91,94,94,97},new int[]{10,14,15,17,17,18,22,22,28,29,29,32,32,34,36,36,38,39,40,42,43,45,45,45,54,54,55,55,59,63,67,68,74,75,75,77,77,79,80,86,86,87,87,87,87,88,93,96},new int[]{2,2,5,5,9,14,17,17,20,22,22,23,25,32,32,32,35,37,37,38,39,40,47,52,55,56,60,62,63,63,63,63,64,69,73,73,74,75,77,79,82,85,88,88,90,92,92,93},new int[]{3,4,4,6,8,10,12,15,16,16,17,20,21,21,24,26,27,28,28,29,30,32,38,44,49,49,50,54,59,59,61,62,64,64,65,70,70,71,72,72,73,74,75,80,83,90,92,92},new int[]{4,5,9,9,13,15,16,16,17,23,25,27,28,29,29,37,37,40,43,45,49,50,51,51,53,55,56,60,61,61,64,67,68,73,74,75,76,77,79,80,85,89,89,89,91,97,97,97},new int[]{2,5,9,10,11,11,11,15,15,16,18,20,21,22,23,24,40,41,47,47,48,48,49,51,53,53,54,55,61,63,65,68,70,73,74,74,77,78,79,80,82,83,85,85,86,87,98,99},new int[]{1,12,13,14,16,17,18,19,20,21,23,23,27,27,30,34,36,36,38,42,43,43,44,44,48,49,53,54,55,61,62,66,67,72,72,73,73,77,78,78,86,88,89,92,93,98,98,99},new int[]{1,2,4,6,9,13,13,13,17,18,20,28,28,30,32,33,37,38,42,42,44,47,50,52,53,54,56,57,59,60,66,68,70,71,72,74,76,77,79,83,83,84,85,90,94,94,97,99},new int[]{1,1,9,9,10,10,11,12,12,15,21,22,24,24,25,26,26,27,30,31,34,35,40,41,43,47,47,53,53,53,57,60,61,61,64,66,68,71,71,79,82,82,84,88,88,90,96,99},new int[]{4,4,6,6,6,6,8,9,11,11,14,16,21,25,29,37,38,40,44,45,50,51,51,53,53,56,57,58,59,59,63,69,71,72,74,76,79,80,82,83,87,93,94,96,98,98,99,99},new int[]{2,2,5,9,10,12,13,13,13,13,19,22,27,32,33,34,34,38,41,45,46,47,48,50,51,51,52,54,54,57,57,60,61,74,76,76,77,79,81,83,85,92,93,95,96,97,99,99},new int[]{4,4,4,6,7,9,14,15,16,18,19,23,27,37,38,39,40,41,41,44,45,51,52,53,54,54,56,57,58,59,60,63,65,65,69,79,85,85,88,89,90,90,93,94,95,95,95,99},new int[]{6,6,7,9,10,10,11,15,15,16,16,17,19,20,24,28,30,31,31,33,35,37,38,40,40,43,44,44,45,46,48,58,59,62,72,73,74,80,82,82,83,85,88,90,91,91,91,96},new int[]{2,2,2,2,3,4,5,12,12,15,23,23,24,24,29,35,36,38,40,41,47,47,48,49,51,54,56,57,60,62,63,64,70,75,75,76,77,80,82,83,87,90,91,91,92,93,94,94},new int[]{3,4,4,7,8,9,11,12,15,19,21,22,23,24,28,28,31,37,37,37,39,48,52,52,55,55,55,57,61,66,72,75,76,77,79,83,84,84,84,88,90,92,93,94,98,98,98,99},new int[]{2,5,7,11,13,15,27,29,29,31,35,38,41,42,44,44,46,47,49,52,52,53,53,53,54,54,55,56,58,60,61,61,63,69,72,72,77,77,79,80,84,84,86,87,90,92,92,93}}); param0.add(new int[][]{new int[]{28,84,-76,-76,-28,-42,-78,6,40,70,48,92,-6,-34,62,34,-14,-64},new int[]{48,6,-22,44,-32,-26,-18,94,-2,-80,-20,-64,-50,-18,-28,-96,66,48},new int[]{-2,34,6,-62,-48,8,2,-50,-66,48,22,-8,10,0,50,-78,-76,-20},new int[]{-4,12,-84,76,-72,74,12,8,-66,-10,-90,-94,-82,68,-60,66,-58,60},new int[]{-34,-90,-52,26,58,-48,78,84,-34,-64,-64,-24,-34,-46,-2,0,-70,54},new int[]{4,96,36,98,-62,90,-50,52,52,-50,-34,20,-26,84,-14,-82,-72,-94},new int[]{38,12,-48,6,-18,64,-58,-22,60,-54,86,48,16,38,50,-42,24,6},new int[]{-10,-46,-32,-72,-18,48,20,-16,2,50,-78,-30,-62,76,30,52,22,-6},new int[]{-72,34,4,-36,60,-80,-66,-20,36,26,-70,94,-22,14,-80,42,94,-66},new int[]{52,-66,-68,56,-94,2,88,-8,10,98,-48,52,-38,62,44,-62,80,36},new int[]{-70,16,56,-40,-4,12,-16,-52,4,-14,-32,20,66,-94,36,-78,-74,0},new int[]{64,-62,-12,-34,-24,-94,98,30,-30,-28,-24,-22,-50,28,-74,36,40,50},new int[]{-98,44,8,96,-82,-28,-26,18,-58,-60,-98,98,18,-44,42,12,-82,30},new int[]{-28,96,-32,62,-36,32,-50,2,26,80,-10,-48,-58,64,86,2,-52,84},new int[]{-76,-78,-46,-54,-34,60,84,84,-24,10,40,-16,-42,-32,14,-94,-88,-4},new int[]{28,-74,-28,58,40,-34,52,14,10,-74,94,2,84,6,-28,-90,-50,62},new int[]{-26,-62,-30,-32,8,-8,-88,66,-98,42,-32,12,66,94,-48,-16,82,-24},new int[]{-48,98,18,68,-52,-58,20,80,-60,-88,34,-80,-76,94,-56,24,22,60}}); param0.add(new int[][]{new int[]{0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1},new int[]{0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,1},new int[]{0,0,0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1},new int[]{0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1}}); param0.add(new int[][]{new int[]{93,9,33,88,35,75,39,77,87,25},new int[]{80,56,48,85,10,41,83,99,59,28},new int[]{41,66,51,62,30,40,40,69,62,15},new int[]{3,24,41,63,48,61,48,47,56,76},new int[]{8,78,18,84,23,69,65,46,66,80},new int[]{69,22,65,12,19,22,55,62,51,48},new int[]{17,13,28,67,5,60,15,81,44,46},new int[]{29,68,96,49,43,68,77,20,18,64},new int[]{49,42,12,89,94,79,36,8,28,86},new int[]{60,49,38,80,58,5,46,98,75,2}}); List<Integer> param1 = new ArrayList<>(); param1.add(29); param1.add(9); param1.add(4); param1.add(3); param1.add(28); param1.add(26); param1.add(44); param1.add(9); param1.add(5); param1.add(5); 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()); } }
1,545
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.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{ static boolean f_gold ( int arr [ ] , int i , int n ) { if ( i > ( n - 2 ) / 2 ) { return true ; } if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && f_gold ( arr , 2 * i + 1 , n ) && f_gold ( arr , 2 * i + 2 , n ) ) { return true ; } 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,5,24,24,25,25,36,37,37,39,42,44,46,50,51,54,56,60,62,70,71,73,75,80,80,85,86,89,91,95,99}); param0.add(new int[]{-44,-58,88,-42,42,-14,-44,42,64,94,-46,-70,34,-10,-46,-52,-6,-78,64,56,74,98,-34,-4,-92,6,-52,-20,78,-72,-40}); 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[]{10,2,1,34,21,37,49,31,70,97,87,50,76,55}); param0.add(new int[]{-94,-84,-82,-66,-64,-62,-56,-38,-24,-24,-4,2,4,4,8,14,16,20,30,34,34,48,58,58,70,76,78,86,88,96,98}); param0.add(new int[]{1,0,1,0,1,1,1,1,1,0,0,0,1,0,1,1,0,0}); param0.add(new int[]{5,20,30,5,10,21,5}); param0.add(new int[]{50,20,30,5,10,21,5}); param0.add(new int[]{50,20,30,5,10,21,5}); param0.add(new int[]{50,20,30,5,10,21,5}); List<Integer> param1 = new ArrayList<>(); param1.add(0); param1.add(0); param1.add(0); param1.add(0); param1.add(29); param1.add(12); param1.add(0); param1.add(0); param1.add(2); param1.add(7); List<Integer> param2 = new ArrayList<>(); param2.add(18); param2.add(27); param2.add(20); param2.add(8); param2.add(26); param2.add(11); param2.add(7); param2.add(7); param2.add(7); param2.add(7); 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()); } }
1,546
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION.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 COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION{ static int f_gold ( int n , int r , int p ) { int C [ ] = new int [ r + 1 ] ; Arrays . fill ( C , 0 ) ; C [ 0 ] = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = Math . min ( i , r ) ; j > 0 ; j -- ) C [ j ] = ( C [ j ] + C [ j - 1 ] ) % p ; } return C [ r ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(82); param0.add(45); param0.add(44); param0.add(88); param0.add(90); param0.add(98); param0.add(80); param0.add(60); param0.add(52); param0.add(71); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(24); param1.add(68); param1.add(24); param1.add(75); param1.add(55); param1.add(54); param1.add(75); param1.add(73); param1.add(26); List<Integer> param2 = new ArrayList<>(); param2.add(94); param2.add(95); param2.add(61); param2.add(43); param2.add(57); param2.add(43); param2.add(88); param2.add(65); param2.add(86); param2.add(45); 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()); } }
1,547
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SQUARE_ROOT_OF_AN_INTEGER.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 SQUARE_ROOT_OF_AN_INTEGER{ static int f_gold ( int x ) { if ( x == 0 || x == 1 ) return x ; int i = 1 , result = 1 ; while ( result <= x ) { i ++ ; result = i * i ; } return i - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(89); param0.add(11); param0.add(14); param0.add(92); param0.add(76); param0.add(63); param0.add(51); param0.add(16); param0.add(83); 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()); } }
1,548
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_SUBSEQUENCE_DIFFERENCE_ADJACENTS_ONE_SET_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 LONGEST_SUBSEQUENCE_DIFFERENCE_ADJACENTS_ONE_SET_2{ static int f_gold ( int [ ] arr , int n ) { HashMap < Integer , Integer > um = new HashMap < Integer , Integer > ( ) ; int longLen = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int len = 0 ; if ( um . containsKey ( arr [ i ] - 1 ) && len < um . get ( arr [ i ] - 1 ) ) len = um . get ( arr [ i ] - 1 ) ; if ( um . containsKey ( arr [ i ] + 1 ) && len < um . get ( arr [ i ] + 1 ) ) len = um . get ( arr [ i ] + 1 ) ; um . put ( arr [ i ] , len + 1 ) ; if ( longLen < um . get ( arr [ i ] ) ) longLen = um . get ( arr [ i ] ) ; } return longLen ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{20,48,58}); param0.add(new int[]{-36,94,-20,-90,-80,88,46,-8,-36,22,70,-16,-48,-54,-82,38,10,-84,12,10,-14,50,12,-28,-64,-38,-84,-62,-56,32,-78,34,-34,48}); param0.add(new int[]{0,0,0}); param0.add(new int[]{50,28,14,52,92,30,30,27,66,77,39,42,28,84,63,55,18,34,57,45,81,38,23,31,9,35,25,39,30,5,28,7,42,42}); param0.add(new int[]{-96,-70,-64,-60,-56,-44,-40,-32,-30,-22,-10,14,26,28,28,38,58,78,80}); param0.add(new int[]{1,0,0,0,1,0,0,1,0,1}); param0.add(new int[]{8,19,30,37,44,46,49,50,51,57,65,67,70,70,76,83,91,92}); param0.add(new int[]{40,62,-6,88,58,66,-40,46,-32,80,22,-30,32,-74,20,-82,-58,-18,30,68,-2,38,-76,-58,22,-22,74}); 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}); param0.add(new int[]{46,6,71,56,21,97,80,67,26,25,79,86,64,84,53,50,29,19,95,58,14,15,63,1,76,64,11,47,9,97,54,27}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(29); param1.add(1); param1.add(22); param1.add(11); param1.add(8); param1.add(13); param1.add(20); param1.add(12); param1.add(17); 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()); } }
1,549
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES.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_VOLUME_CUBOID_GIVEN_SUM_SIDES{ static int f_gold ( int s ) { int maxvalue = 0 ; for ( int i = 1 ; i <= s - 2 ; i ++ ) { for ( int j = 1 ; j <= s - 1 ; j ++ ) { int k = s - i - j ; maxvalue = Math . max ( maxvalue , i * j * k ) ; } } return maxvalue ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(67); param0.add(48); param0.add(59); param0.add(22); param0.add(14); param0.add(66); param0.add(1); param0.add(75); param0.add(58); param0.add(78); 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()); } }
1,550
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_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 PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1{ static int f_gold ( long n ) { return ( int ) Math . pow ( n , 2 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Long> param0 = new ArrayList<>(); param0.add(42L); param0.add(40L); param0.add(67L); param0.add(73L); param0.add(18L); param0.add(16L); param0.add(74L); param0.add(33L); param0.add(92L); param0.add(22L); 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()); } }
1,551
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REARRANGE_POSITIVE_AND_NEGATIVE_NUMBERS_PUBLISH.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 REARRANGE_POSITIVE_AND_NEGATIVE_NUMBERS_PUBLISH{ static void f_gold ( int arr [ ] , int n ) { int i = - 1 , temp = 0 ; for ( int j = 0 ; j < n ; j ++ ) { if ( arr [ j ] < 0 ) { i ++ ; temp = arr [ i ] ; arr [ i ] = arr [ j ] ; arr [ j ] = temp ; } } int pos = i + 1 , neg = 0 ; while ( pos < n && neg < pos && arr [ neg ] < 0 ) { temp = arr [ neg ] ; arr [ neg ] = arr [ pos ] ; arr [ pos ] = temp ; pos ++ ; neg += 2 ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,5,6,7,8,10,13,15,15,27,27,29,29,29,29,31,33,33,36,38,38,39,42,47,47,51,51,51,52,53,55,56,57,64,66,66,67,68,70,72,74,78,86,88,94,97,97}); param0.add(new int[]{73,30,55,-5,15,64,-64,-74,-57,-73,-31,48}); param0.add(new int[]{0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{62,82,89,97,60,43,76,68,5,37,72,92,31}); param0.add(new int[]{-99,-89,-71,-60,-59,-54,-49,1,51}); param0.add(new int[]{1,1,1,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,1,0,0,1,0,0,0,1}); param0.add(new int[]{2,7,17,22,24,25,26,28,29,33,34,38,43,49,51,52,54,59,63,70,71,75,82,88,91,91}); param0.add(new int[]{-51,99,-19,-16,5,77,48,18,-14,-37,89,4,-51,-29,-99,41,79,23,84,-38,-68}); 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}); param0.add(new int[]{88,87,59}); List<Integer> param1 = new ArrayList<>(); param1.add(26); param1.add(8); param1.add(6); param1.add(7); param1.add(8); param1.add(21); param1.add(14); param1.add(10); param1.add(44); param1.add(1); List<int [ ]> filled_function_param0 = new ArrayList<>(); filled_function_param0.add(new int[]{5,5,6,7,8,10,13,15,15,27,27,29,29,29,29,31,33,33,36,38,38,39,42,47,47,51,51,51,52,53,55,56,57,64,66,66,67,68,70,72,74,78,86,88,94,97,97}); filled_function_param0.add(new int[]{73,30,55,-5,15,64,-64,-74,-57,-73,-31,48}); filled_function_param0.add(new int[]{0,0,0,1,1,1,1,1,1,1}); filled_function_param0.add(new int[]{62,82,89,97,60,43,76,68,5,37,72,92,31}); filled_function_param0.add(new int[]{-99,-89,-71,-60,-59,-54,-49,1,51}); filled_function_param0.add(new int[]{1,1,1,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,1,0,0,1,0,0,0,1}); filled_function_param0.add(new int[]{2,7,17,22,24,25,26,28,29,33,34,38,43,49,51,52,54,59,63,70,71,75,82,88,91,91}); filled_function_param0.add(new int[]{-51,99,-19,-16,5,77,48,18,-14,-37,89,4,-51,-29,-99,41,79,23,84,-38,-68}); 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,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[]{88,87,59}); List<Integer> filled_function_param1 = new ArrayList<>(); filled_function_param1.add(26); filled_function_param1.add(8); filled_function_param1.add(6); filled_function_param1.add(7); filled_function_param1.add(8); filled_function_param1.add(21); filled_function_param1.add(14); filled_function_param1.add(10); filled_function_param1.add(44); filled_function_param1.add(1); 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()); } }
1,552
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PARTITION_INTO_TWO_SUBARRAYS_OF_LENGTHS_K_AND_N_K_SUCH_THAT_THE_DIFFERENCE_OF_SUMS_IS_MAXIMUM.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 PARTITION_INTO_TWO_SUBARRAYS_OF_LENGTHS_K_AND_N_K_SUCH_THAT_THE_DIFFERENCE_OF_SUMS_IS_MAXIMUM{ static int f_gold ( int arr [ ] , int N , int k ) { int M , S = 0 , S1 = 0 , max_difference = 0 ; for ( int i = 0 ; i < N ; i ++ ) S += arr [ i ] ; int temp ; for ( int i = 0 ; i < N ; i ++ ) { for ( int j = i + 1 ; j < N ; j ++ ) { if ( arr [ i ] < arr [ j ] ) { temp = arr [ i ] ; arr [ i ] = arr [ j ] ; arr [ j ] = temp ; } } } M = Math . max ( k , N - k ) ; for ( int i = 0 ; i < M ; i ++ ) S1 += arr [ i ] ; max_difference = S1 - ( S - S1 ) ; return max_difference ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,5,5,9,9,19,22,24,27,33,39,39,40,41,42,43,44,45,48,52,52,53,53,55,55,56,57,57,60,60,61,62,65,66,67,70,71,72,73,77,78,79,84,87,89,91,95,98}); param0.add(new int[]{-22,-28}); 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}); param0.add(new int[]{63,72,2,94,89,11,95,79,90,9,70,28,25,74,16,36,50,91,38,47,47,13,27,29,31,35}); param0.add(new int[]{-86,-78,-76,-76,-66,-62,-62,-38,-34,-32,-30,-26,-22,-4,-4,2,8,8,10,22,52,52,58,64,66,66,66,70,82,82}); param0.add(new int[]{0,0,0,1,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,0,0}); param0.add(new int[]{1,2,2,9,9,12,13,26,26,33,34,35,51,57,70,79,83}); param0.add(new int[]{98,-72,2,40,-20,-14,42,8,14,-58,-18,-70,-8,-66,-68,72,82,-38,-78,2,-66,-88,-34,52,12,84,72,-28,-34,60,-60,12,-28,-42,22,-66,88,-96}); 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,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{21,85,64,20,4,5,2}); List<Integer> param1 = new ArrayList<>(); param1.add(41); param1.add(1); param1.add(20); param1.add(23); param1.add(29); param1.add(42); param1.add(9); param1.add(28); param1.add(37); param1.add(5); List<Integer> param2 = new ArrayList<>(); param2.add(44); param2.add(1); param2.add(29); param2.add(16); param2.add(24); param2.add(32); param2.add(16); param2.add(28); param2.add(27); param2.add(6); 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()); } }
1,553
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_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 GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_1{ static int f_gold ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i ] > arr [ i + 1 ] ) break ; int l = ( i + 1 ) % n ; int r = i ; int cnt = 0 ; while ( l != r ) { if ( arr [ l ] + arr [ r ] == x ) { cnt ++ ; if ( l == ( r - 1 + n ) % n ) { return cnt ; } l = ( l + 1 ) % n ; r = ( r - 1 + n ) % n ; } else if ( arr [ l ] + arr [ r ] < x ) l = ( l + 1 ) % n ; else r = ( n + r - 1 ) % n ; } return cnt ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{24,54}); param0.add(new int[]{68,-30,-18,-6,70,-40,86,98,-24,-48}); 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}); param0.add(new int[]{84,44,40,45,2,41,52,17,50,41,5,52,48,90,13,55,34,55,94,44,41,2}); param0.add(new int[]{-92,-76,-74,-72,-68,-64,-58,-44,-44,-38,-26,-24,-20,-12,-8,-8,-4,10,10,10,20,20,26,26,28,50,52,54,60,66,72,74,78,78,78,80,86,88}); param0.add(new int[]{1,1,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,1}); param0.add(new int[]{5,5,15,19,22,24,26,27,28,32,37,39,40,43,49,52,55,56,58,58,59,62,67,68,77,79,79,80,81,87,95,95,96,98,98}); param0.add(new int[]{-98,28,54,44,-98,-70,48,-98,56,4,-18,26,-8,-58,30,82,4,-38,42,64,-28}); 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}); param0.add(new int[]{26,72,74,86,98,86,22,6,95,36,11,82,34,3,50,36,81,94,55,30,62,53,50,95,32,83,9,16}); List<Integer> param1 = new ArrayList<>(); param1.add(1); param1.add(8); param1.add(33); param1.add(18); param1.add(29); param1.add(19); param1.add(28); param1.add(17); param1.add(24); param1.add(19); List<Integer> param2 = new ArrayList<>(); param2.add(1); param2.add(8); param2.add(28); param2.add(16); param2.add(30); param2.add(10); param2.add(34); param2.add(14); param2.add(24); param2.add(16); 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()); } }
1,554
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_DISTANCE_TWO_POINTS_EARTH.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_DISTANCE_TWO_POINTS_EARTH{ public static double f_gold ( double lat1 , double lat2 , double lon1 , double lon2 ) { lon1 = Math . toRadians ( lon1 ) ; lon2 = Math . toRadians ( lon2 ) ; lat1 = Math . toRadians ( lat1 ) ; lat2 = Math . toRadians ( lat2 ) ; double dlon = lon2 - lon1 ; double dlat = lat2 - lat1 ; double a = Math . pow ( Math . sin ( dlat / 2 ) , 2 ) + Math . cos ( lat1 ) * Math . cos ( lat2 ) * Math . pow ( Math . sin ( dlon / 2 ) , 2 ) ; double c = 2 * Math . asin ( Math . sqrt ( a ) ) ; double r = 6371 ; return ( c * r ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(6578.099266893886); param0.add(-9410.77783405426); param0.add(6641.858718352012); param0.add(-4142.202863100186); param0.add(4181.4508741498075); param0.add(-7745.655002884576); param0.add(7725.024650172891); param0.add(-5881.135770052704); param0.add(8322.143446980337); param0.add(-1772.9564288056765); List<Double> param1 = new ArrayList<>(); param1.add(482.6430542568438); param1.add(-1203.2861272633245); param1.add(3498.0959749989424); param1.add(-6286.669946106916); param1.add(3845.247033476332); param1.add(-8197.864556657836); param1.add(9295.96418476119); param1.add(-4802.015139707946); param1.add(1841.108539911126); param1.add(-8246.345733364455); List<Double> param2 = new ArrayList<>(); param2.add(1342.7044674704348); param2.add(-1947.91060583419); param2.add(228.4572635598181); param2.add(-2742.3608603803173); param2.add(4909.334120366857); param2.add(-3667.1524343381157); param2.add(588.3703338670609); param2.add(-35.713164290259726); param2.add(9049.321929418034); param2.add(-9716.057194373958); List<Double> param3 = new ArrayList<>(); param3.add(3416.2819128903197); param3.add(-781.7419983063755); param3.add(5599.787943215038); param3.add(-6584.987721971118); param3.add(5159.242793722949); param3.add(-8067.806767671396); param3.add(1220.0418662747136); param3.add(-4696.734461092275); param3.add(4470.7365519306095); param3.add(-8367.588380851601); 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),param3.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
1,555
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_TOTAL_SET_BITS_IN_ALL_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_TOTAL_SET_BITS_IN_ALL_NUMBERS_FROM_1_TO_N{ static int f_gold ( int n ) { int i = 0 ; int ans = 0 ; while ( ( 1 << i ) <= n ) { boolean k = false ; int change = 1 << i ; for ( int j = 0 ; j <= n ; j ++ ) { if ( k == true ) ans += 1 ; else ans += 0 ; if ( change == 1 ) { k = ! k ; change = 1 << i ; } else { change -- ; } } i ++ ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(90); param0.add(56); param0.add(43); param0.add(31); param0.add(77); param0.add(35); param0.add(43); param0.add(66); param0.add(15); param0.add(95); 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()); } }
1,556
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_GIVEN_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES.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_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES{ static boolean f_gold ( char [ ] str ) { int len = str . length ; if ( str [ 0 ] < 'A' || str [ 0 ] > 'Z' ) return false ; if ( str [ len - 1 ] != '.' ) return false ; int prev_state = 0 , curr_state = 0 ; int index = 1 ; while ( index <= str . length ) { if ( str [ index ] >= 'A' && str [ index ] <= 'Z' ) curr_state = 0 ; else if ( str [ index ] == ' ' ) curr_state = 1 ; else if ( str [ index ] >= 'a' && str [ index ] <= 'z' ) curr_state = 2 ; else if ( str [ index ] == '.' ) curr_state = 3 ; if ( prev_state == curr_state && curr_state != 2 ) return false ; if ( prev_state == 2 && curr_state == 0 ) return false ; if ( curr_state == 3 && prev_state != 1 ) return ( index + 1 == str . length ) ; index ++ ; prev_state = curr_state ; } return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = Arrays.asList("I love cinema.", "The vertex is S.", "I am single.", "My name is KG.", "I lovE cinema.", "GeeksQuiz. is a quiz site.", "I love Geeksquiz and Geeksforgeeks.", " You are my friend.", "I love cinema", "Hello world !"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i).toCharArray()) == f_gold(param0.get(i).toCharArray())) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
1,557
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_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 CHECK_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_ARRAY{ static boolean f_gold ( int arr [ ] , int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { sum += arr [ i ] ; } if ( sum % 2 != 0 ) { return false ; } sum = sum / 2 ; HashSet < Integer > s = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int val = sum - arr [ i ] ; if ( s . contains ( val ) && val == ( int ) s . toArray ( ) [ s . size ( ) - 1 ] ) { System . out . printf ( "Pair elements are %d and %d\n" , arr [ i ] , val ) ; return true ; } s . 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[]{2, 11, 5, 1, 4, 7}); param0.add(new int[]{2, 4, 2, 1, 11, 15}); 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[]{69,6,24,30,75,37,61,76,19,18,90,9,49,24,58,97,18,85,24,93,71,98,92,59,75,75,75,70,35,58,50,1,64,66,33}); param0.add(new int[]{-94,-94,-92,-74,-60,-58,-56,-44,-42,-40,-28,-14,2,4,14,20,24,28,40,42,42,66,78,78,80,82,96}); param0.add(new int[]{1,0,1,1,0,0,1,1,0,0,1,1,0,1}); param0.add(new int[]{21,26,26,27,61,62,96}); param0.add(new int[]{-54,86,20,26}); param0.add(new int[]{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[]{44,35,26,15,56,6,36,53,15,66,20,53,99,96,51,12,61,19,79,40,99,42,86,8,11,54,93,46,23,47,41,26,66,5,86,52,64,51,4,21,63,14,7,53,31,8,9,63}); List<Integer> param1 = new ArrayList<>(); param1.add(6); param1.add(6); param1.add(13); param1.add(18); param1.add(26); param1.add(10); param1.add(6); param1.add(3); param1.add(4); 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()); } }
1,558
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER.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_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER{ static boolean f_gold ( String s1 , String s2 ) { int n = s1 . length ( ) ; int m = s2 . length ( ) ; boolean dp [ ] [ ] = new boolean [ n + 1 ] [ m + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= m ; j ++ ) { dp [ i ] [ j ] = false ; } } dp [ 0 ] [ 0 ] = true ; for ( int i = 0 ; i < s1 . length ( ) ; i ++ ) { for ( int j = 0 ; j <= s2 . length ( ) ; j ++ ) { if ( dp [ i ] [ j ] ) { if ( j < s2 . length ( ) && ( Character . toUpperCase ( s1 . charAt ( i ) ) == s2 . charAt ( j ) ) ) dp [ i + 1 ] [ j + 1 ] = true ; if ( ! Character . isUpperCase ( s1 . charAt ( i ) ) ) dp [ i + 1 ] [ j ] = true ; } } } return ( dp [ n ] [ m ] ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("daBcd"); param0.add("417514"); param0.add("010000"); param0.add("ZcKYguiMrdyn"); param0.add("argaju"); param0.add("1110101101"); param0.add("ySOCoSaygi"); param0.add("204"); param0.add("10011100000010"); param0.add("nMAioozPmY"); List<String> param1 = new ArrayList<>(); param1.add("ABC"); param1.add("9"); param1.add("1111011010"); param1.add("iz"); param1.add("RAJ"); param1.add("110101001"); param1.add("aRhxkYqh"); param1.add("6986871066"); param1.add("0"); param1.add("WZFdDKw"); 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()); } }
1,559
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_SUM_EVEN_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 FIND_SUM_EVEN_FACTORS_NUMBER{ public static int f_gold ( int n ) { if ( n % 2 != 0 ) return 0 ; int res = 1 ; for ( int i = 2 ; i <= Math . sqrt ( n ) ; i ++ ) { int count = 0 , curr_sum = 1 ; int curr_term = 1 ; while ( n % i == 0 ) { count ++ ; n = n / i ; if ( i == 2 && count == 1 ) curr_sum = 0 ; curr_term *= i ; curr_sum += curr_term ; } res *= curr_sum ; } if ( n >= 2 ) res *= ( 1 + n ) ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(71); param0.add(78); param0.add(39); param0.add(36); param0.add(49); param0.add(17); param0.add(53); param0.add(66); param0.add(92); param0.add(71); 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()); } }
1,560
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CALCULATE_AREA_TETRAHEDRON.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 CALCULATE_AREA_TETRAHEDRON{ static double f_gold ( int side ) { double volume = ( Math . pow ( side , 3 ) / ( 6 * Math . sqrt ( 2 ) ) ) ; return volume ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(58); param0.add(56); param0.add(35); param0.add(99); param0.add(13); param0.add(45); param0.add(40); param0.add(92); param0.add(7); param0.add(13); 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()); } }
1,561
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DYNAMIC_PROGRAMMING_SET_13_CUTTING_A_ROD.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 DYNAMIC_PROGRAMMING_SET_13_CUTTING_A_ROD{ static int f_gold ( int price [ ] , int n ) { int val [ ] = new int [ n + 1 ] ; val [ 0 ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { int max_val = Integer . MIN_VALUE ; for ( int j = 0 ; j < i ; j ++ ) max_val = Math . max ( max_val , price [ j ] + val [ i - j - 1 ] ) ; val [ i ] = max_val ; } return val [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,7,15,16,18,22,22,30,34,35,37,41,42,42,43,47,49,52,53,55,58,60,62,62,62,65,65,67,69,73,73,73,75,78,83,84,86,90,91,91,93,94,96}); param0.add(new int[]{50,-30,-84,-2,-96,-54,-14,56,-48,70,38,-86,16,-48,66,34,36,40,40,36,-16,-92,30}); 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,1}); param0.add(new int[]{79,33,54,12,53,9,29,45,85,20,6,52,8,26,43,42,17,54,8,70,5,71,1,81,42,59,42,63,8,86,29,16,72}); param0.add(new int[]{-78,-64,-38,-22,2,8,28,32,58,72,72,90}); param0.add(new int[]{1,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0}); param0.add(new int[]{1,3,6,7,10,17,18,22,23,24,28,31,37,43,48,54,56,65,70,71,73,74,79,84,87,95,96}); param0.add(new int[]{-30,20,-72,-86,-8}); 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}); param0.add(new int[]{96,99,20,87,17,13,45,65,33,13,59,77,35,79,20,51,69,71,55,37,23,35,82,70}); List<Integer> param1 = new ArrayList<>(); param1.add(37); param1.add(19); param1.add(29); param1.add(22); param1.add(11); param1.add(20); param1.add(21); param1.add(3); param1.add(21); 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()); } }
1,562
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SQUARED_TRIANGULAR_NUMBER_SUM_CUBES.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 SQUARED_TRIANGULAR_NUMBER_SUM_CUBES{ static int f_gold ( int s ) { int sum = 0 ; for ( int n = 1 ; sum < s ; n ++ ) { sum += n * n * n ; if ( sum == s ) return n ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(15); param0.add(36); param0.add(39); param0.add(43); param0.add(75); param0.add(49); param0.add(56); param0.add(14); param0.add(62); param0.add(97); 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()); } }
1,563
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FREQUENT_ELEMENT_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 FREQUENT_ELEMENT_ARRAY{ static int f_gold ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int max_count = 1 , res = arr [ 0 ] ; int curr_count = 1 ; for ( int i = 1 ; i < n ; i ++ ) { if ( arr [ i ] == arr [ i - 1 ] ) curr_count ++ ; else { if ( curr_count > max_count ) { max_count = curr_count ; res = arr [ i - 1 ] ; } curr_count = 1 ; } } if ( curr_count > max_count ) { max_count = curr_count ; res = arr [ n - 1 ] ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,1,3,11,11,11,18,20,26,26,27,30,33,39,39,42,42,48,51,51,51,51,60,66,66,68,68,69,71,72,73,76,76,77,77,77,78,90,96}); param0.add(new int[]{46,-8,64,-46,-38,92,-14,-22,-32,48,72,96,30,66,94,36,42,-18,14,-74,80,96,-4}); param0.add(new int[]{0,0,0,0,0,0,1}); param0.add(new int[]{93,32,3,31,67,96,52,80,70,49,45,23,58,87,31,56,21,71,55,97}); param0.add(new int[]{-98,-96,-84,-82,-72,-64,-62,-56,-52,-52,-48,-46,-42,-36,-32,-30,-30,-18,-16,-10,-2,0,6,18,22,22,40,42,50,54,64,68,68,72,80,82,84,96}); param0.add(new int[]{1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,0,1,1,0}); param0.add(new int[]{9,12,13,28,43,46,64,66,68,89,92}); param0.add(new int[]{22,-8,-56,68,-12,-26,-40,-46,-42,-80,4,-42,-72,-22,36,22,-94,48,96,80,-52,46,90,94,36,92,-12,-24,-60,-32,92,18,76,40,-32,6,-22,86,86,-88,38,50,32,78,-82,54,-40,18}); param0.add(new int[]{0,0,0,0,0,0,1,1,1}); param0.add(new int[]{81,74,32,41,85,65,81,74,40,64,97,4,61,43,54,96,62,2,97,86,80,25,9,31,16,29,4,63,76,41,5,95}); List<Integer> param1 = new ArrayList<>(); param1.add(25); param1.add(18); param1.add(6); param1.add(15); param1.add(20); param1.add(29); param1.add(6); param1.add(41); param1.add(4); 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()); } }
1,564
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_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_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1{ static int f_gold ( int n ) { return ( 1 << ( n - 1 ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(56); param0.add(28); param0.add(4); param0.add(24); param0.add(72); param0.add(30); param0.add(48); param0.add(32); param0.add(13); 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()); } }
1,565
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_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 PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1{ static int f_gold ( int l , int w ) { return ( 2 * ( l + w ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(58); param0.add(37); param0.add(56); param0.add(22); param0.add(77); param0.add(34); param0.add(74); param0.add(37); param0.add(21); param0.add(75); List<Integer> param1 = new ArrayList<>(); param1.add(39); param1.add(49); param1.add(52); param1.add(43); param1.add(12); param1.add(31); param1.add(54); param1.add(52); param1.add(37); 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()); } }
1,566
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_REPEATING_AND_NON_OVERLAPPING_SUBSTRING.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_AND_NON_OVERLAPPING_SUBSTRING{ static String f_gold ( String str ) { int n = str . length ( ) ; int LCSRe [ ] [ ] = new int [ n + 1 ] [ n + 1 ] ; String res = "" ; int res_length = 0 ; int i , index = 0 ; for ( i = 1 ; i <= n ; i ++ ) { for ( int j = i + 1 ; j <= n ; j ++ ) { if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && LCSRe [ i - 1 ] [ j - 1 ] < ( j - i ) ) { LCSRe [ i ] [ j ] = LCSRe [ i - 1 ] [ j - 1 ] + 1 ; if ( LCSRe [ i ] [ j ] > res_length ) { res_length = LCSRe [ i ] [ j ] ; index = Math . max ( i , index ) ; } } else { LCSRe [ i ] [ j ] = 0 ; } } } if ( res_length > 0 ) { for ( i = index - res_length + 1 ; i <= index ; i ++ ) { res += str . charAt ( i - 1 ) ; } } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("fbfHTjE"); param0.add("09285256323"); param0.add("0011000101110"); param0.add("ue JkVZTt"); param0.add("48387612426300"); param0.add("010"); param0.add("ddRrUz"); param0.add("1049162633793"); param0.add("100011"); param0.add("iJfadiVaQqv"); 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()); } }
1,567
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_N_DIGIT_STEPPING_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 NUMBER_N_DIGIT_STEPPING_NUMBERS{ static long f_gold ( int n ) { int dp [ ] [ ] = new int [ n + 1 ] [ 10 ] ; if ( n == 1 ) return 10 ; for ( int j = 0 ; j <= 9 ; j ++ ) dp [ 1 ] [ j ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= 9 ; j ++ ) { if ( j == 0 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j + 1 ] ; else if ( j == 9 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ] ; } } long sum = 0 ; for ( int j = 1 ; j <= 9 ; j ++ ) sum += dp [ n ] [ j ] ; return sum ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(18); param0.add(66); param0.add(73); param0.add(70); param0.add(26); param0.add(41); param0.add(20); param0.add(25); param0.add(52); param0.add(13); 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()); } }
1,568
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_FIND_STRING_START_END_GEEKS.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_STRING_START_END_GEEKS{ static boolean f_gold ( String str , String corner ) { int n = str . length ( ) ; int cl = corner . length ( ) ; if ( n < cl ) return false ; return ( str . substring ( 0 , cl ) . equals ( corner ) && str . substring ( n - cl , n ) . equals ( corner ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("geeksmanishgeeks"); param0.add("shreyadhatwalia"); param0.add("10000100"); param0.add("abaa"); param0.add("30645530"); param0.add("0000011011001"); param0.add("dkqEd"); param0.add("48694119324654"); param0.add("1101010010"); param0.add("Ks"); List<String> param1 = new ArrayList<>(); param1.add("geeks"); param1.add("abc"); param1.add("100"); param1.add("a"); param1.add("30"); param1.add("001"); param1.add("d"); param1.add("654"); param1.add("11"); param1.add("KsFLmngGGOmHKs"); 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()); } }
1,569
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_NUMBER_ENDLESS_POINTS.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_ENDLESS_POINTS{ static int f_gold ( boolean input [ ] [ ] , int n ) { boolean row [ ] [ ] = new boolean [ n ] [ n ] ; boolean col [ ] [ ] = new boolean [ n ] [ n ] ; for ( int j = 0 ; j < n ; j ++ ) { boolean isEndless = true ; for ( int i = n - 1 ; i >= 0 ; i -- ) { if ( input [ i ] [ j ] == false ) isEndless = false ; col [ i ] [ j ] = isEndless ; } } for ( int i = 0 ; i < n ; i ++ ) { boolean isEndless = true ; for ( int j = n - 1 ; j >= 0 ; j -- ) { if ( input [ i ] [ j ] == false ) isEndless = false ; row [ i ] [ j ] = isEndless ; } } int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 1 ; j < n ; j ++ ) if ( row [ i ] [ j ] && col [ i ] [ j ] ) ans ++ ; return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<boolean [ ] [ ]> param0 = new ArrayList<>(); param0.add(new boolean[][]{new boolean[]{false,false,false,true},new boolean[]{false,true,true,true},new boolean[]{false,false,true,true},new boolean[]{true,true,true,true}}); param0.add(new boolean[][]{new boolean[]{true,false,true,true,true,true,false,false,false},new boolean[]{false,true,true,true,true,true,false,true,true},new boolean[]{false,true,false,true,false,true,true,true,false},new boolean[]{false,false,false,false,true,true,false,false,true},new boolean[]{true,true,true,true,false,true,true,false,false},new boolean[]{false,false,true,true,false,true,false,false,true},new boolean[]{true,true,false,false,false,true,true,false,true},new boolean[]{false,true,true,false,false,false,false,false,false},new boolean[]{true,false,false,false,true,true,false,false,true}}); param0.add(new boolean[][]{new boolean[]{false,false,false,true},new boolean[]{false,false,true,true},new boolean[]{false,false,false,true},new boolean[]{false,false,true,true}}); param0.add(new boolean[][]{new boolean[]{false,true,true,false,false,true,false,false,true,false,false,false,true,false,false,true,false,true,true,false,false,true,true,true,true,true,true,false,false,true,false,false,false,true,false,true,true,true,false},new boolean[]{false,true,true,true,false,false,true,false,true,true,true,true,true,false,true,false,false,true,false,true,true,true,true,false,false,true,false,true,true,false,true,false,true,false,false,false,true,true,false},new boolean[]{false,true,true,false,true,false,false,true,false,true,true,false,true,true,false,true,false,true,false,true,false,true,true,false,true,false,true,false,true,false,false,false,false,true,false,false,true,true,true},new boolean[]{false,false,false,true,false,true,true,true,true,false,true,true,true,false,false,false,false,true,false,false,false,true,true,false,true,true,false,true,false,false,false,false,false,true,true,true,false,false,false},new boolean[]{true,false,false,true,false,false,false,true,false,true,true,false,false,true,true,true,false,false,false,false,false,true,true,false,true,false,false,true,false,true,false,false,false,true,false,true,false,true,false},new boolean[]{false,true,true,false,false,true,false,true,false,true,false,true,true,true,true,true,false,true,false,false,false,true,true,true,false,false,false,false,true,true,true,false,true,false,true,true,false,true,true},new boolean[]{false,false,true,false,true,true,true,true,false,true,true,true,true,false,false,true,false,true,false,false,false,true,true,true,false,true,true,true,false,false,false,false,false,true,true,false,true,true,false},new boolean[]{false,true,false,false,true,false,false,false,true,false,true,true,true,false,true,true,false,false,false,true,true,true,false,true,false,false,true,false,true,false,false,true,false,true,true,false,true,false,true},new boolean[]{true,true,true,false,true,true,true,false,false,false,false,true,true,false,false,false,true,false,false,true,false,false,false,true,true,false,false,false,true,true,false,true,false,true,false,false,false,true,false},new boolean[]{false,false,true,false,true,true,true,false,true,false,false,false,true,false,true,false,true,false,false,false,false,true,false,false,true,false,true,false,false,true,false,true,true,false,true,false,false,false,false},new boolean[]{true,false,true,true,true,false,true,true,false,true,false,true,false,false,false,true,true,true,true,true,false,true,true,false,true,true,true,true,false,false,true,false,false,false,false,true,false,false,false},new boolean[]{false,true,true,false,true,false,true,true,true,true,false,false,false,false,true,false,true,true,true,false,true,false,false,true,true,true,true,false,false,true,false,false,true,false,false,true,false,true,true},new boolean[]{false,false,false,false,true,false,false,true,true,true,false,true,true,false,true,false,false,false,true,true,true,true,true,false,false,true,false,false,true,false,true,false,false,false,true,true,true,false,false},new boolean[]{false,true,false,true,false,true,true,true,false,false,true,true,true,false,false,true,true,false,true,true,false,true,false,true,true,false,false,true,false,false,true,false,false,true,true,false,false,false,true},new boolean[]{false,false,true,false,true,true,false,false,false,true,true,true,true,true,false,true,false,false,false,false,false,false,true,false,false,false,false,false,true,true,false,false,false,true,false,true,true,false,false},new boolean[]{false,true,false,true,true,true,true,false,false,false,true,true,false,true,true,false,false,true,false,true,true,true,true,true,false,true,false,true,true,true,false,false,true,true,false,false,false,false,false},new boolean[]{true,true,false,false,true,true,true,false,false,false,true,true,true,true,false,true,false,false,true,true,false,true,true,true,false,true,true,false,false,false,true,true,false,false,false,false,true,false,true},new boolean[]{false,false,false,true,false,false,true,false,true,true,false,true,true,true,false,true,false,false,true,true,false,false,true,false,false,true,false,false,false,true,false,false,false,true,false,false,false,false,false},new boolean[]{false,true,false,false,true,false,true,true,true,false,true,true,true,true,true,false,false,false,true,false,true,true,true,false,true,false,true,false,false,true,true,true,true,true,false,true,true,true,true},new boolean[]{true,false,true,false,true,true,false,false,false,true,true,false,true,true,true,true,true,false,false,true,false,true,false,true,true,true,true,true,false,false,true,true,false,true,false,true,false,false,false},new boolean[]{true,true,false,false,false,false,false,true,true,true,false,true,false,true,true,true,false,true,false,true,true,false,true,true,true,false,false,true,true,true,false,true,false,true,true,false,true,false,true},new boolean[]{false,false,false,false,true,true,true,false,false,true,true,true,false,false,true,true,true,false,true,false,false,true,false,false,true,false,true,true,true,true,false,true,true,false,false,true,false,true,true},new boolean[]{false,true,true,false,true,true,true,true,false,false,true,false,false,true,true,true,false,false,false,true,true,true,false,true,true,true,true,false,true,false,true,false,false,false,true,false,false,true,true},new boolean[]{true,false,false,false,false,true,true,false,false,true,false,false,true,true,false,false,true,true,true,false,true,true,false,false,true,false,true,false,false,true,true,true,true,true,false,false,true,true,true},new boolean[]{true,true,true,false,false,true,false,true,false,true,true,true,true,false,false,true,true,true,false,false,false,true,false,false,false,false,false,true,true,true,false,true,true,false,false,false,true,true,true},new boolean[]{true,false,true,true,true,false,false,true,true,false,false,false,true,true,false,true,false,true,true,true,false,false,false,true,false,false,true,true,true,false,true,false,false,true,true,true,false,false,true},new boolean[]{false,false,false,true,true,false,false,false,true,true,false,false,false,true,false,true,false,false,false,false,true,true,true,true,true,true,true,false,false,false,false,false,false,false,false,true,false,false,true},new boolean[]{false,false,false,true,false,false,false,true,false,false,true,false,false,true,false,true,true,false,true,true,true,true,true,true,false,false,false,true,true,true,true,false,false,false,false,false,true,true,true},new boolean[]{false,true,false,true,true,false,true,true,true,true,true,true,false,false,true,true,true,true,false,false,true,false,true,false,true,true,true,true,true,true,false,true,true,true,true,false,true,true,false},new boolean[]{true,false,false,true,false,true,true,true,true,false,false,true,false,false,false,true,true,true,false,false,true,false,false,false,false,true,false,true,true,false,false,true,false,false,true,true,true,true,true},new boolean[]{false,true,true,true,false,false,true,false,false,true,false,false,true,true,true,false,false,true,false,false,false,true,false,true,true,true,false,true,false,false,true,true,false,false,false,true,false,true,false},new boolean[]{false,false,true,false,true,false,false,false,false,true,false,false,false,true,true,false,false,true,false,false,true,false,true,false,true,false,false,false,true,true,false,true,false,false,false,true,false,true,true},new boolean[]{false,true,false,false,true,true,true,true,true,true,false,false,true,false,true,false,false,true,true,true,true,false,false,true,false,true,false,true,true,true,true,true,true,false,true,false,false,true,true},new boolean[]{false,false,false,true,true,true,false,false,false,false,true,true,false,true,false,false,true,false,false,false,true,true,true,true,false,true,false,true,true,true,false,true,true,true,false,false,false,false,false},new boolean[]{false,false,true,true,true,false,true,false,true,true,true,true,false,true,false,true,false,false,true,false,false,true,false,true,false,true,false,true,true,false,false,false,true,false,false,false,true,false,true},new boolean[]{false,false,false,false,true,true,false,true,false,true,false,true,true,true,false,false,false,true,false,false,true,false,false,false,false,false,true,false,true,true,true,false,false,true,true,true,true,true,false},new boolean[]{true,true,true,true,false,false,false,true,false,false,false,true,false,false,true,false,false,false,false,false,true,true,false,false,false,false,false,true,true,true,true,true,true,true,true,false,true,true,true},new boolean[]{true,false,false,true,true,false,true,false,false,false,true,false,true,false,false,false,false,true,true,false,false,false,true,false,false,true,true,true,false,true,true,false,false,false,false,true,false,false,false},new boolean[]{true,true,false,true,true,false,true,true,false,false,true,true,true,false,true,false,true,false,true,false,true,false,true,true,true,true,false,false,false,false,false,true,true,false,false,true,true,false,false}}); param0.add(new boolean[][]{new boolean[]{false,false,false,false,false,true,true,true,true},new boolean[]{false,false,false,false,true,true,true,true,true},new boolean[]{false,false,false,false,false,true,true,true,true},new boolean[]{false,false,false,false,false,true,true,true,true},new boolean[]{false,false,false,false,false,false,true,true,true},new boolean[]{true,true,true,true,true,true,true,true,true},new boolean[]{false,false,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,true,true,true,true},new boolean[]{false,false,false,false,false,false,true,true,true}}); param0.add(new boolean[][]{new boolean[]{false,true,true,true,true,false,false,true,false,false,false,true,true,false,true,false,false,false,false,true,true,true,true,false,false},new boolean[]{false,true,false,false,false,false,true,true,true,true,false,true,true,false,true,true,true,false,true,false,true,true,false,false,true},new boolean[]{true,false,false,false,true,false,false,true,true,false,true,false,true,true,false,false,true,false,true,true,true,false,false,true,true},new boolean[]{false,true,true,false,true,true,true,true,false,true,false,false,false,true,false,false,false,false,true,false,true,true,false,true,false},new boolean[]{true,true,true,false,true,true,false,false,true,true,false,false,false,true,true,false,true,false,false,true,true,false,false,true,false},new boolean[]{true,false,false,true,false,false,true,false,true,true,true,false,false,true,false,true,true,false,false,false,false,false,true,true,false},new boolean[]{true,false,false,false,false,false,false,false,true,false,true,false,true,false,false,false,true,true,true,true,false,true,false,false,false},new boolean[]{true,false,true,false,false,false,false,false,true,false,true,false,true,false,true,false,false,true,true,false,false,true,false,true,false},new boolean[]{true,true,true,false,true,true,true,false,false,false,true,true,false,true,true,false,true,true,false,false,false,true,false,true,false},new boolean[]{true,false,true,false,true,false,true,true,false,true,true,false,false,true,true,true,true,true,false,false,true,false,true,true,false},new boolean[]{true,false,false,false,true,true,false,false,true,false,false,false,true,true,false,true,false,false,true,true,false,false,false,false,true},new boolean[]{false,true,false,true,true,false,true,false,false,true,false,false,false,false,false,true,false,true,true,true,false,true,true,false,false},new boolean[]{true,false,false,true,true,false,false,true,false,true,false,false,false,true,false,false,true,true,false,true,true,true,true,true,false},new boolean[]{false,true,true,true,true,false,false,false,false,true,true,true,true,false,true,true,false,false,true,true,true,true,true,true,false},new boolean[]{true,false,true,false,false,true,false,true,true,true,true,false,true,true,false,true,false,true,true,false,true,true,true,false,true},new boolean[]{true,true,true,false,false,false,true,false,true,false,true,false,true,true,false,false,true,true,true,false,false,true,true,false,true},new boolean[]{false,false,true,true,true,false,false,false,true,true,false,true,true,true,false,true,false,true,true,false,false,false,false,false,false},new boolean[]{false,false,false,true,true,true,true,false,false,true,true,true,false,true,true,false,true,true,true,false,false,true,false,true,false},new boolean[]{false,false,true,false,false,true,false,true,false,false,false,false,true,false,false,false,false,true,false,true,false,false,true,false,false},new boolean[]{false,false,true,true,false,false,false,true,true,true,false,false,true,false,false,true,true,false,false,false,false,true,false,true,false},new boolean[]{true,false,false,false,false,true,false,true,false,false,false,false,true,false,true,false,false,true,true,true,false,false,false,true,true},new boolean[]{false,true,false,false,true,false,false,true,false,true,true,true,true,false,true,false,true,true,false,true,true,false,false,false,false},new boolean[]{true,false,true,true,false,true,true,true,true,true,true,false,false,true,true,true,false,false,false,true,false,true,true,false,false},new boolean[]{true,true,true,false,true,false,true,true,true,false,true,true,true,false,false,false,false,true,false,true,true,true,true,false,true},new boolean[]{true,true,true,true,false,true,false,false,false,true,false,false,true,false,true,false,true,true,false,false,false,true,false,false,true}}); param0.add(new boolean[][]{new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true,true,true},new boolean[]{false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,true,true,true,true,true,true,true,true,true,true}}); param0.add(new boolean[][]{new boolean[]{true,false,true,false,false,false,true,true,false,true,false,true,true,true,false,false,false,false,true,false,true,false,false,true,false,false,true},new boolean[]{false,true,false,true,false,false,true,true,false,false,false,true,true,false,true,false,true,false,true,false,true,false,false,false,false,true,true},new boolean[]{true,false,true,true,true,false,false,true,true,true,true,true,true,true,true,false,false,false,true,false,true,true,false,false,true,false,true},new boolean[]{true,true,false,false,false,false,false,false,false,false,false,false,false,false,false,false,true,false,true,false,false,true,true,true,false,false,true},new boolean[]{true,false,true,false,false,true,true,false,false,true,true,true,false,false,false,true,false,true,false,true,true,true,true,true,true,false,false},new boolean[]{true,false,false,true,true,false,false,true,false,true,true,true,true,false,false,true,true,true,false,false,true,false,false,true,true,true,false},new boolean[]{true,false,true,true,true,true,false,true,false,false,false,true,true,false,true,true,false,true,true,false,true,false,false,false,false,false,false},new boolean[]{true,false,false,true,false,false,true,true,true,false,true,false,false,false,true,true,true,true,false,true,false,false,true,false,true,false,true},new boolean[]{false,true,false,true,false,true,true,true,false,true,true,false,false,false,true,false,false,false,false,true,true,false,true,false,true,false,true},new boolean[]{false,true,true,true,false,true,false,true,false,true,true,false,true,true,true,true,true,true,true,false,true,true,false,false,true,false,true},new boolean[]{false,true,false,false,true,true,false,false,false,false,true,true,false,false,true,false,false,true,true,true,true,false,false,true,false,false,true},new boolean[]{false,false,true,true,false,true,true,true,false,false,false,false,true,false,true,false,true,false,false,true,false,false,true,true,true,false,false},new boolean[]{true,true,false,false,true,true,false,false,true,true,true,false,false,true,true,false,false,false,true,false,false,false,true,false,false,false,true},new boolean[]{false,true,true,true,false,true,true,true,false,false,false,false,false,true,true,false,false,false,false,false,true,false,true,true,false,true,false},new boolean[]{true,true,true,true,true,true,true,true,true,false,true,true,true,true,false,false,false,false,false,true,false,false,false,false,false,false,true},new boolean[]{false,false,false,true,false,false,false,false,false,true,false,false,false,false,false,false,false,true,false,true,false,true,false,true,false,true,false},new boolean[]{true,true,false,true,true,true,true,true,true,false,false,true,true,false,true,true,false,false,false,false,false,true,true,false,false,false,false},new boolean[]{false,false,false,false,true,true,true,false,true,true,false,true,false,false,true,true,false,false,false,false,true,true,false,true,true,false,false},new boolean[]{true,false,true,true,false,true,false,false,false,false,false,false,false,false,true,false,true,true,false,true,true,true,true,false,false,false,true},new boolean[]{true,false,false,false,true,false,true,false,true,true,false,false,false,true,false,true,true,true,false,false,false,true,false,true,true,false,true},new boolean[]{true,false,true,true,true,true,false,true,true,false,true,true,true,false,false,true,true,false,false,false,false,false,true,false,true,true,true},new boolean[]{true,true,false,false,false,true,false,true,true,true,true,false,true,true,true,true,true,true,false,false,false,false,true,true,false,false,false},new boolean[]{true,false,false,false,false,false,false,true,true,true,false,true,false,false,false,false,true,false,false,false,true,true,false,true,true,true,true},new boolean[]{false,true,true,true,true,false,false,false,true,true,false,true,false,false,false,true,false,false,true,true,true,false,false,false,true,true,true},new boolean[]{false,false,true,true,false,true,true,false,false,true,true,true,false,false,true,false,true,true,true,true,false,true,true,true,true,false,false},new boolean[]{true,true,false,true,false,true,false,true,true,false,false,true,false,false,true,true,false,false,true,true,false,true,true,true,true,false,false},new boolean[]{true,false,true,false,true,true,true,true,true,false,false,false,false,false,false,true,true,false,false,false,false,false,false,true,false,true,true}}); param0.add(new boolean[][]{new boolean[]{false,false,false,true},new boolean[]{false,true,true,true},new boolean[]{false,false,false,true},new boolean[]{false,true,true,true}}); param0.add(new boolean[][]{new boolean[]{true,true,false,false,true,true,true,true,true,false,true,true,false,true,true,false,false,false,false,false,true,false,true,false,true,true,false,true},new boolean[]{false,false,true,true,false,false,false,true,true,false,false,true,false,true,false,false,true,true,false,false,true,true,true,true,false,true,false,false},new boolean[]{true,true,false,false,false,true,false,true,true,true,false,true,false,true,false,false,true,true,false,true,true,false,true,true,false,false,false,false},new boolean[]{true,false,true,false,true,false,true,false,false,true,true,true,true,true,true,false,true,false,false,true,false,false,false,true,false,true,false,true},new boolean[]{true,true,true,true,false,false,false,true,true,false,true,false,true,false,true,true,true,true,false,false,true,true,true,true,false,true,true,true},new boolean[]{true,false,true,true,true,true,true,true,false,true,false,false,false,false,false,true,false,true,true,false,true,true,false,true,false,false,false,true},new boolean[]{true,true,false,false,false,true,true,false,true,false,true,false,false,false,true,true,true,false,false,true,true,false,true,false,false,false,true,false},new boolean[]{false,true,true,true,true,false,false,true,false,false,false,false,false,false,false,false,true,false,true,false,false,true,false,true,true,true,false,true},new boolean[]{true,false,true,false,false,false,true,false,true,true,true,true,false,true,true,true,false,false,true,true,false,false,false,false,true,false,false,false},new boolean[]{false,false,true,true,false,true,false,false,true,true,true,true,false,false,true,false,false,true,true,false,true,false,true,true,false,true,true,true},new boolean[]{true,false,true,true,true,true,false,true,true,true,false,true,true,false,false,false,true,false,true,true,true,true,true,false,false,false,false,false},new boolean[]{false,false,false,false,true,false,true,true,true,false,false,false,false,true,false,false,true,true,false,true,true,true,true,true,true,true,true,false},new boolean[]{false,false,false,true,true,false,false,true,false,false,false,false,true,true,true,true,false,false,true,true,true,true,true,true,true,true,false,false},new boolean[]{false,true,true,true,true,true,true,true,true,true,true,true,true,true,false,true,true,true,true,true,false,false,false,false,true,false,true,false},new boolean[]{false,true,false,false,false,true,true,false,false,true,false,true,false,true,false,true,true,false,true,true,false,false,true,false,true,false,false,true},new boolean[]{true,true,false,true,true,true,true,true,false,false,false,true,true,false,false,true,true,true,false,false,false,false,true,false,true,true,false,true},new boolean[]{true,false,true,false,false,false,true,true,false,true,true,false,true,true,true,true,true,true,true,false,false,false,false,false,false,false,false,true},new boolean[]{true,false,true,false,true,false,false,false,true,true,true,false,true,true,true,false,false,false,false,false,true,true,true,true,true,true,false,false},new boolean[]{true,false,true,false,true,true,true,false,false,false,false,false,false,false,true,true,false,false,false,true,true,true,true,false,true,false,false,false},new boolean[]{false,false,true,false,true,false,true,false,true,true,false,true,true,true,false,false,true,true,true,false,false,false,false,false,false,false,false,false},new boolean[]{true,false,true,false,true,true,true,true,false,true,true,false,false,true,true,false,true,false,true,true,true,true,true,true,false,false,true,false},new boolean[]{true,false,false,true,false,false,false,false,false,true,true,false,false,true,false,false,true,false,true,false,true,false,true,true,false,true,false,false},new boolean[]{false,true,true,true,true,true,true,false,false,true,true,false,true,false,true,true,true,false,true,true,true,true,false,true,false,false,false,false},new boolean[]{true,true,false,false,true,true,false,false,true,false,false,false,true,false,false,false,false,false,true,true,true,false,true,true,false,false,true,false},new boolean[]{false,true,true,true,true,true,true,true,false,true,false,false,false,true,true,false,false,true,true,false,false,true,false,true,true,false,true,false},new boolean[]{true,true,true,true,true,true,true,true,false,true,false,false,true,false,true,false,true,true,true,true,false,false,true,false,true,false,true,true},new boolean[]{true,false,true,true,true,false,false,true,false,true,true,false,false,false,true,true,true,false,false,true,false,false,true,true,true,true,false,true},new boolean[]{false,true,true,false,false,false,true,true,true,true,false,true,true,false,false,false,true,true,true,true,false,true,true,true,true,false,true,false}}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(4); param1.add(2); param1.add(30); param1.add(7); param1.add(13); param1.add(19); param1.add(15); param1.add(3); 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()); } }
1,570
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_STRING_FOLLOWS_ANBN_PATTERN_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_STRING_FOLLOWS_ANBN_PATTERN_NOT{ public static boolean f_gold ( String s ) { int l = s . length ( ) ; if ( l % 2 == 1 ) { return false ; } int i = 0 ; int j = l - 1 ; while ( i < j ) { if ( s . charAt ( i ) != 'a' || s . charAt ( j ) != 'b' ) { return false ; } i ++ ; j -- ; } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("ba"); param0.add("aabb"); param0.add("abab"); param0.add("aaabb"); param0.add("aabbb"); param0.add("abaabbaa"); param0.add("abaababb"); param0.add("bbaa"); param0.add("11001000"); param0.add("ZWXv te"); 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()); } }
1,571
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUBARRAY_SUM_USING_PREFIX_SUM.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_SUBARRAY_SUM_USING_PREFIX_SUM{ static int f_gold ( int arr [ ] , int n ) { int min_prefix_sum = 0 ; int res = Integer . MIN_VALUE ; int prefix_sum [ ] = new int [ n ] ; prefix_sum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) prefix_sum [ i ] = prefix_sum [ i - 1 ] + arr [ i ] ; for ( int i = 0 ; i < n ; i ++ ) { res = Math . max ( res , prefix_sum [ i ] - min_prefix_sum ) ; min_prefix_sum = Math . min ( min_prefix_sum , prefix_sum [ i ] ) ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8,9,11,17,18,19,23,24,27,30,31,31,35,44,46,47,49,51,55,58,59,61,65,67,71,71,71,71,78,78,82,91,98}); param0.add(new int[]{-82,-28,-66,-52,-36,36,-88,52,-62,46,42,26,-60,18,-52,38,94,-68,44,-94,14,36,-70}); 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,1,1,1,1}); param0.add(new int[]{28,36,42,42,5,52,74,86,55,82,59,81,4,90,24,34,20,99,86,25,52,48,62,5,67,83,60,72,80,73,38,55,8,70,95}); param0.add(new int[]{-92,-52,-24,36,56}); param0.add(new int[]{0,1,1,1,0,1,0,1,0,0,1,1,0,1,1,0,0,0}); param0.add(new int[]{1,1,4,4,7,7,17,18,20,26,26,32,37,38,42,44,44,46,50,53,57,58,58,60,61,61,64,74,75,77,83,83,84,84,85,87,88,90,95,96,97,98,99,99}); param0.add(new int[]{-86,2,26,54,-16,16,48,24,50,-10,-32,-62,48,-12,-66}); 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[]{58,14,79,11,31,28,61,86,25,27,75,78,32,55,86,48,15,51,6,78,23,82,16,62,35,51,91,16,79,38,97,30,23,58,95,57,82,35,57,43,22,41,58,69,25,65,13,79}); List<Integer> param1 = new ArrayList<>(); param1.add(20); param1.add(15); param1.add(19); param1.add(19); param1.add(3); param1.add(13); param1.add(25); param1.add(13); param1.add(14); param1.add(39); 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()); } }
1,572
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_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 COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY_1{ public static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > hm = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( hm . containsKey ( arr [ i ] ) ) hm . put ( arr [ i ] , hm . get ( arr [ i ] ) + 1 ) ; else hm . put ( arr [ i ] , 1 ) ; } int ans = 0 ; for ( Map . Entry < Integer , Integer > it : hm . entrySet ( ) ) { int count = it . getValue ( ) ; ans += ( count * ( count - 1 ) ) / 2 ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,11,18,22,40,46,50,51,53,55,64,67,73,78,86}); param0.add(new int[]{14,-98,98,58,-82,90,-80,-56,-30,-36,-56,-30,-58,68,72,-76,38,-90,-72,4,-32,32,-28,2,12,-72,54,2,0,-74,8,12,46,72,-84,-66,70,18,26,72,-26,44,-8,20,-32,-56,28}); 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[]{93,23,62,64,31,78,99}); param0.add(new int[]{-94,-94,-92,-86,-84,-76,-76,-68,-66,-56,-56,-54,-50,-46,-38,-34,-34,-30,-26,-18,-16,2,8,42,52,54,56,64,68,82,82,82,94,96,98}); param0.add(new int[]{0}); param0.add(new int[]{3,18,18,20,21,23,24,27,35,36,38,40,46,50,50,51,52,53,59,61,63,63,65,66,68,68,70,71,74,75,96,98}); param0.add(new int[]{-68,40,16,50,36,42,-20,-46,-92,4,-18,-12,48,0,-46,64,-74,-50,42,44,-56,28,-10,78,62,70,-60,12,-44,-78}); 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}); param0.add(new int[]{31,5}); List<Integer> param1 = new ArrayList<>(); param1.add(14); param1.add(24); param1.add(13); param1.add(4); param1.add(19); param1.add(0); param1.add(19); param1.add(23); param1.add(30); 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()); } }
1,573
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HOW_TO_COMPUTE_MOD_OF_A_BIG_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 HOW_TO_COMPUTE_MOD_OF_A_BIG_NUMBER{ static int f_gold ( String num , int a ) { int res = 0 ; for ( int i = 0 ; i < num . length ( ) ; i ++ ) res = ( res * 10 + ( int ) num . charAt ( i ) - '0' ) % a ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("RElCP"); param0.add("0139035510"); param0.add("00011110"); param0.add("TwanZWwLNXhFN"); param0.add("6247009752778"); param0.add("0100001011011"); param0.add("NCh"); param0.add("00714746542"); param0.add("101000100"); param0.add("MSTkXmlbPkV"); List<Integer> param1 = new ArrayList<>(); param1.add(13); param1.add(44); param1.add(86); param1.add(66); param1.add(55); param1.add(33); param1.add(75); param1.add(54); param1.add(93); param1.add(78); 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()); } }
1,574
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S.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 LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S{ static int f_gold ( int arr [ ] , int n ) { int sum = 0 ; int maxsize = - 1 , startindex = 0 ; int endindex = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { sum = ( arr [ i ] == 0 ) ? - 1 : 1 ; for ( int j = i + 1 ; j < n ; j ++ ) { if ( arr [ j ] == 0 ) sum += - 1 ; else sum += 1 ; if ( sum == 0 && maxsize < j - i + 1 ) { maxsize = j - i + 1 ; startindex = i ; } } } endindex = startindex + maxsize - 1 ; if ( maxsize == - 1 ) System . out . println ( "No such subarray" ) ; else System . out . println ( startindex + " to " + endindex ) ; return maxsize ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{56,8,67,35,19,82,81,66,10,24,82,2,42,48,18,63,48,74,60,64,64,95,95,20,95,55,63,96,54}); param0.add(new int[]{78,67,1,78,48,83,17,19,21,44,99,68,16,54,9}); param0.add(new int[]{3,69,97,21,12,67,45,53,77,70,26,43}); param0.add(new int[]{21,80,29,22,77,64,42,4,71,75,62,27,30,36,66,37,49,97}); param0.add(new int[]{18,66,9,90,21,95,74,48,44,9,43,17}); param0.add(new int[]{42,41,87,3,64,25,96,55,99,57,32,64,10,75,69,95,11,36,15,2,78,70,14,54,11,28,55,47,27,85,47,62,97,68,44,70,12,27,36,85,76,91,17,75,83,34,32,89,55}); param0.add(new int[]{44}); param0.add(new int[]{1,43,28,17,30,46,89,51,15,70,96,79,65,55,8}); param0.add(new int[]{25,91,68,4,35,49,33}); param0.add(new int[]{14,86,22,42,94,54,28,41,48,8,82,84,99,92,33,75,38,31,59,86,21,6,77,89,79,83,57,26,89,45,60,55,60,76,76,6,40,57,38,44,7,98,64,65,88,73,88,99}); List<Integer> param1 = new ArrayList<>(); param1.add(26); param1.add(8); param1.add(9); param1.add(10); param1.add(10); param1.add(41); param1.add(0); param1.add(9); param1.add(4); 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()); } }
1,575
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_PAIRS_DIFFERENCE_EQUAL_K_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_PAIRS_DIFFERENCE_EQUAL_K_1{ static int f_gold ( int arr [ ] , int n , int k ) { int count = 0 ; Arrays . sort ( arr ) ; int l = 0 ; int r = 0 ; while ( r < n ) { if ( arr [ r ] - arr [ l ] == k ) { count ++ ; l ++ ; r ++ ; } else if ( arr [ r ] - arr [ l ] > k ) l ++ ; else r ++ ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,5,10,19,29,32,40,60,65,70,72,89,92}); param0.add(new int[]{-38,40,8,64,-38,56,4,8,84,60,-48,-78,-82,-88,-30,58,-58,62,-52,-98,24,22,14,68,-74,48,-56,-72,-90,26,-10,58,40,36,-80,68,58,-74,-46,-62,-12,74,-58}); param0.add(new int[]{0,0,1}); param0.add(new int[]{16,80,59,29,14,44,13,76,7,65,62,1,34,49,70,96,73,71,42,73,66,96}); param0.add(new int[]{-98,-88,-58,-56,-48,-34,-22,-18,-14,-14,-8,-4,-2,2,18,38,42,46,54,68,70,90,94,96,98}); param0.add(new int[]{0,1,1}); param0.add(new int[]{11,43,50,58,60,68,75}); param0.add(new int[]{86,94,-80,0,52,-56,42,88,-10,24,6,8}); 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}); param0.add(new int[]{54,99,4,14,9,34,81,36,80,50,34,9,7}); List<Integer> param1 = new ArrayList<>(); param1.add(7); param1.add(24); param1.add(1); param1.add(12); param1.add(23); param1.add(2); param1.add(4); param1.add(11); param1.add(29); param1.add(9); List<Integer> param2 = new ArrayList<>(); param2.add(12); param2.add(36); param2.add(1); param2.add(16); param2.add(22); param2.add(1); param2.add(4); param2.add(9); param2.add(30); param2.add(8); 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()); } }
1,576
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_ROTATIONS_DIVISIBLE_4.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_ROTATIONS_DIVISIBLE_4{ static int f_gold ( String n ) { int len = n . length ( ) ; if ( len == 1 ) { int oneDigit = n . charAt ( 0 ) - '0' ; if ( oneDigit % 4 == 0 ) return 1 ; return 0 ; } int twoDigit , count = 0 ; for ( int i = 0 ; i < ( len - 1 ) ; i ++ ) { twoDigit = ( n . charAt ( i ) - '0' ) * 10 + ( n . charAt ( i + 1 ) - '0' ) ; if ( twoDigit % 4 == 0 ) count ++ ; } twoDigit = ( n . charAt ( len - 1 ) - '0' ) * 10 + ( n . charAt ( 0 ) - '0' ) ; if ( twoDigit % 4 == 0 ) count ++ ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("MRRuQJvxe"); param0.add("87395768"); param0.add("10111100110111"); param0.add("aVDUEfzG"); param0.add("55794792"); param0.add("111010"); param0.add("cndMLMJVmzuH"); param0.add("487717559382"); param0.add("11110"); param0.add("dRMDPyr"); 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()); } }
1,577
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE_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 DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE_1{ static boolean f_gold ( int arr [ ] , int n , int k ) { HashMap < Integer , Integer > hash = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( ! hash . containsKey ( arr [ i ] ) ) hash . put ( arr [ i ] , 0 ) ; hash . put ( arr [ i ] , hash . get ( arr [ i ] ) + 1 ) ; } for ( Map . Entry x : hash . entrySet ( ) ) if ( ( int ) x . getValue ( ) > 2 * k ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,1,2,3,1}); param0.add(new int[]{2,3,3,5,3,3}); param0.add(new int[]{0,0,1,1,1}); param0.add(new int[]{7,60,78,91,80,75,85,21,41,63,1,84,69,13,94,25,54,54,52,68,53,35,17,37,98,27,2,31}); param0.add(new int[]{-96,-94,-82,-80,-78,-66,-36,-24,-18,-12,-2,-2,6,8,10,12,36,38,42,58,64,68,82,84,86,88,94}); param0.add(new int[]{0,1,1,1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,0,0,1,0,0,1,1,1,0}); param0.add(new int[]{16,19,25,25,32,37,48,59,60,60,71,74,77,81,91,94}); param0.add(new int[]{-62,-94,72,-22,86,-80,64,98,-82,-50,12,-4,56,46,-80,2,-86,-44,-26,68,-94,-82,74,26,94,40,50,-40,-42,-10}); param0.add(new int[]{0,0,0,0,0,1,1,1}); param0.add(new int[]{83,57,2,47,70,22,49,51,25,57,32,7,8,99,6,86,24,79,42,43,1,24,68,11,24,12,43,40,14,45,11,46,12,80,66}); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(6); param1.add(2); param1.add(24); param1.add(24); param1.add(34); param1.add(10); param1.add(20); param1.add(5); param1.add(21); List<Integer> param2 = new ArrayList<>(); param2.add(2); param2.add(2); param2.add(1); param2.add(2); param2.add(3); param2.add(2); param2.add(8); param2.add(4); param2.add(2); param2.add(33); 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()); } }
1,578
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS_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_SUBSETS_DISTINCT_ELEMENTS_1{ static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > mp = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) mp . put ( arr [ i ] , mp . get ( arr [ i ] ) == null ? 1 : mp . get ( arr [ i ] ) + 1 ) ; int res = 0 ; for ( Map . Entry < Integer , Integer > entry : mp . entrySet ( ) ) res = Math . max ( res , entry . getValue ( ) ) ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,6,9,12,15,19,21,23,24,24,25,27,29,35,36,37,41,44,44,47,48,51,56,59,59,59,60,64,64,66,67,68,68,69,73,74,77,78,81,82,83,85,89,94,95,96,98,99}); param0.add(new int[]{96,20,-40,74,-44,98,-24,92,58,-84,-76,-14,64,-2,-84,52,-8,38,-26,-10,-62,-30,-76,58}); 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}); param0.add(new int[]{35,16,42,3,57,70,4,31,93,60,98,97,81,57,62,98,88,51,5,58,48,14,58,22,40,26,66,41,9,78,62,32,79,88,65,75,80,12,15,93,92,13,83,26}); param0.add(new int[]{-62,-44,-36,-18,-16,-6,4,14,22,42,68,90}); param0.add(new int[]{1,0,1,0,1,1,1,1,0,1,0,1,0,0,0,0}); param0.add(new int[]{20,25,27,29,47,47,49,53,59,66,74,82,86,86,94,94,97}); param0.add(new int[]{92,50,76,46,14,40,22}); 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}); param0.add(new int[]{8,82,92,42,55,4,94,73,57,7,21,71,68,97}); List<Integer> param1 = new ArrayList<>(); param1.add(30); param1.add(20); param1.add(31); param1.add(37); param1.add(11); param1.add(12); param1.add(13); param1.add(3); param1.add(27); param1.add(12); 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()); } }
1,579
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SORTED_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 COUNT_SORTED_ROWS_MATRIX{ static int f_gold ( int mat [ ] [ ] , int r , int c ) { int result = 0 ; for ( int i = 0 ; i < r ; i ++ ) { int j ; for ( j = 0 ; j < c - 1 ; j ++ ) if ( mat [ i ] [ j + 1 ] <= mat [ i ] [ j ] ) break ; if ( j == c - 1 ) result ++ ; } for ( int i = 0 ; i < r ; i ++ ) { int j ; for ( j = c - 1 ; j > 0 ; j -- ) if ( mat [ i ] [ j - 1 ] <= mat [ i ] [ j ] ) break ; if ( c > 1 && j == 0 ) result ++ ; } return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{4,12,13,24,25,26,27,35,41,60,69,71,73,78,85,86,95,99},new int[]{1,13,18,25,41,42,44,45,49,49,51,52,59,63,64,67,78,97},new int[]{1,2,11,18,23,26,30,31,41,42,45,71,75,90,91,92,95,97},new int[]{26,30,44,46,46,54,56,60,67,68,75,77,77,83,87,87,94,98},new int[]{19,20,27,31,33,34,37,41,42,49,60,60,64,67,71,73,77,92},new int[]{2,6,9,11,20,29,37,41,42,44,49,58,62,76,87,89,94,97},new int[]{7,8,9,14,20,45,49,54,63,63,64,71,72,73,73,89,94,95},new int[]{2,3,7,16,17,23,23,25,44,50,58,58,59,78,83,87,90,99},new int[]{4,16,18,22,23,33,34,43,43,46,51,56,62,75,79,85,97,97},new int[]{16,18,29,32,39,53,54,55,67,70,72,72,76,76,86,87,96,96},new int[]{6,30,34,37,38,42,52,54,59,67,71,71,72,81,85,87,91,93},new int[]{2,6,6,16,18,20,21,31,40,42,50,56,62,80,80,83,91,96},new int[]{2,5,6,14,16,21,23,37,52,59,72,86,86,87,87,89,90,91},new int[]{1,10,17,20,22,25,27,32,37,37,44,49,65,78,80,81,85,95},new int[]{1,13,14,21,43,50,52,58,62,64,65,66,66,66,67,70,81,82},new int[]{1,2,9,16,17,23,25,29,30,31,42,65,73,74,82,87,92,92},new int[]{1,5,9,13,21,28,32,33,34,38,46,60,80,86,93,94,96,98},new int[]{11,18,23,24,25,26,28,48,59,59,67,72,82,83,86,89,92,96}}); param0.add(new int[][]{new int[]{82,82,2,8,-32,90,-76,-64,-66,-46,-72,-58,-28,-86,-8,-96,-62,-32,54,-16,96,28,76,90,-40,98,88,-90,4,-50,70,32,-74,-72,-72,10,36,50,-16,-36},new int[]{-52,-6,12,-6,-64,6,38,-14,-86,74,-74,82,54,2,46,-94,88,86,-32,-72,72,88,90,-8,-58,32,-90,-68,-70,72,34,74,-30,92,90,-88,82,-54,42,94},new int[]{-4,-32,-12,-96,16,-32,32,52,2,-6,2,-10,40,-64,4,-56,-50,46,54,-6,-14,-40,-98,-4,-20,98,94,60,-70,-94,52,-4,32,20,-30,-94,-50,50,-86,-66},new int[]{10,84,2,-44,-54,-82,-64,70,-20,-40,-50,10,26,-14,-88,10,-80,-48,10,16,-14,-52,74,-60,48,-60,-62,38,56,-34,86,20,74,-20,28,-46,-44,96,-58,-8},new int[]{-48,-36,-18,-66,-20,60,-36,34,-94,44,-14,-34,-84,-26,38,48,14,12,72,-76,26,50,-58,40,90,14,-40,22,-26,-24,66,-62,-34,16,-34,-30,54,-76,-26,4},new int[]{-26,56,74,-82,58,-42,-98,96,-24,-36,-86,-80,42,78,-2,-90,-8,-52,46,-20,-16,64,-36,-8,-16,-60,96,40,66,98,14,-36,-78,-40,52,60,-20,38,26,-98},new int[]{-12,60,-56,-66,68,-20,-74,30,14,-36,-22,-54,50,62,-44,14,90,66,80,76,-86,92,-80,-6,48,44,24,40,94,-42,68,28,-20,98,40,50,-18,90,6,2},new int[]{-98,4,-32,-34,-64,58,16,48,82,10,36,32,-60,-40,2,-14,-58,28,-44,60,-28,-6,-68,46,-50,62,10,44,-4,76,60,-26,52,40,-88,-56,-36,-70,-66,-22},new int[]{18,-66,-82,52,34,-86,-50,-64,18,10,-14,8,80,-76,20,76,96,-12,-36,86,-10,16,-14,66,-4,14,-82,0,2,90,78,-48,42,-60,90,-16,80,16,-64,-58},new int[]{12,8,-74,78,46,-84,20,14,-2,-42,-80,-66,-64,34,58,0,28,-8,34,92,-14,-54,82,68,64,6,30,78,-50,-28,-74,-12,-18,82,-50,-86,-2,-78,94,-66},new int[]{10,-76,58,32,-44,60,-14,24,-92,24,16,80,90,-60,-6,8,-50,90,60,82,6,84,74,-48,-98,-2,-38,74,64,52,8,-32,-58,-58,70,-14,68,46,32,74},new int[]{84,98,78,34,-94,84,10,84,10,-58,-70,-30,98,-28,-80,56,-36,96,82,38,2,-38,28,18,82,60,-16,-64,90,34,-10,98,36,40,-6,-32,-32,-24,92,12},new int[]{54,92,-30,-12,40,48,8,34,-20,-58,8,-14,0,-34,98,-32,-98,40,-44,34,94,-56,-90,64,4,-76,-34,-68,48,28,84,-4,-46,-54,72,-82,0,-82,38,-6},new int[]{44,-66,-86,54,-4,36,62,88,-16,-88,-26,-50,-84,-90,38,14,62,14,-92,64,-50,-2,-96,-4,94,-84,26,-86,-68,6,-18,-66,-56,-88,-92,-86,64,-6,-92,-12},new int[]{-36,80,-28,-42,58,-12,-66,-38,-76,34,-52,-32,-80,66,54,-2,-40,78,14,-54,6,-92,68,-40,72,-80,52,-60,98,-60,-92,26,-24,26,46,34,80,-92,16,16},new int[]{-4,60,-72,-6,46,76,-8,82,42,-68,-86,10,20,80,-22,64,-40,22,-6,-58,-74,-86,-16,-14,-76,-54,-98,-50,-74,80,-44,18,-70,-80,58,-48,-70,44,46,88},new int[]{-80,-76,-46,-92,-78,-72,-56,72,-52,-86,-48,6,84,38,-14,66,48,86,36,-80,-54,-44,-88,-18,-50,-56,-20,-14,-52,-98,-44,-76,-42,-66,-20,62,0,-54,-82,-70},new int[]{44,98,78,56,-14,-70,-24,62,88,70,-42,72,80,42,22,-90,-50,-22,14,40,42,34,66,-58,70,22,-86,58,-82,54,-20,72,20,32,8,30,52,-6,-12,-62},new int[]{-4,70,-76,22,22,44,-84,-74,34,-36,64,-78,50,72,-40,-78,-26,-66,-84,-28,-40,-96,66,36,-28,-18,4,0,20,18,78,-74,-58,-64,-68,68,-84,20,-56,-16},new int[]{0,24,64,-50,-36,70,-88,-34,70,68,-68,80,88,12,-50,74,32,18,-14,74,58,68,-62,-30,20,94,-68,96,-32,-94,-70,-44,-76,-94,34,54,-74,62,-80,-10},new int[]{-64,-26,-26,44,14,-72,-74,36,-8,-64,-34,6,18,14,74,-90,66,-12,-6,-6,-12,-58,72,18,62,-44,12,-56,66,34,44,0,-98,96,-94,-60,76,52,48,-6},new int[]{6,-58,14,82,-72,0,92,8,-6,-18,74,-66,68,-24,-20,90,-48,54,18,-24,-8,-48,72,-78,-54,84,18,-52,-36,-30,-82,-34,8,-94,-34,-78,-28,44,92,-78},new int[]{-50,-84,-82,-12,62,-72,-36,84,-36,-82,12,-52,12,-34,36,8,-24,58,6,-34,0,-22,46,98,62,80,-88,-24,98,30,22,94,-38,-24,78,62,0,-10,2,52},new int[]{94,-10,-88,-12,-10,56,-86,18,54,-20,22,-18,76,-88,-38,38,-88,-20,82,88,-80,-34,14,54,28,-46,-88,-84,-86,38,86,26,98,-28,14,-24,-22,-80,-98,58},new int[]{60,52,12,-86,-54,-30,10,-2,-54,-74,56,74,-74,92,86,-92,-28,-54,30,-56,40,96,92,16,82,-70,-80,92,-80,14,56,-6,8,-92,20,10,-50,-64,-34,50},new int[]{64,70,-74,-72,78,46,42,44,-96,-18,-62,56,-90,-14,38,82,8,-58,52,92,-90,22,-60,62,60,-64,-56,-74,92,-2,-90,-14,-56,-64,38,18,-52,-92,30,-36},new int[]{50,84,82,36,60,34,-50,-64,-72,30,8,84,48,-24,78,80,-10,-90,82,-80,-4,-94,24,92,92,-16,-80,68,60,98,-92,52,60,8,-72,12,-60,-84,-44,-34},new int[]{-98,-30,30,36,96,74,-82,-2,-72,-38,-40,10,92,30,98,-28,56,70,-84,66,40,92,42,-86,-58,-90,-10,98,-12,-80,94,4,-84,60,94,-90,74,-68,64,-76},new int[]{2,94,38,-6,64,4,-42,92,-12,54,82,90,-64,32,0,-24,-16,-68,78,54,28,-86,-56,4,16,98,32,-18,-76,90,-6,72,40,20,6,-90,52,-62,4,30},new int[]{22,90,54,-34,-30,0,-72,-6,36,28,-96,86,-2,-48,-30,8,-60,-32,24,-50,-76,-86,32,28,-66,-88,24,86,72,96,22,-32,-92,-26,48,-52,-12,4,-94,2},new int[]{-44,70,38,36,-36,46,-68,-44,-36,34,-32,-44,-22,-80,-64,28,60,92,-52,14,42,-80,-70,50,24,-34,16,64,62,-94,18,-48,-68,16,76,-42,30,-88,46,-12},new int[]{46,46,44,16,-70,-6,-78,-46,70,30,70,88,66,56,-12,4,76,-50,-28,-98,-16,-86,-68,36,28,-92,-46,-86,-2,90,6,36,-62,-30,-26,-38,22,-60,-20,-70},new int[]{80,38,-94,-42,70,-20,42,-62,-30,54,82,-94,-78,74,60,54,-52,-56,66,86,-30,-14,0,-6,-22,56,70,-86,50,82,72,-10,54,24,-46,-26,-20,-54,-96,30},new int[]{-48,94,54,-16,70,20,-20,-2,-8,84,-60,30,-18,-14,32,42,24,26,-12,-62,2,-94,26,36,-88,-22,-64,46,36,74,-44,-56,-36,-98,70,72,-68,68,76,-32},new int[]{-4,36,0,14,-42,-38,-98,-2,-44,-90,82,80,-66,38,62,34,52,44,-22,80,-74,-88,-74,24,98,8,18,-26,-4,-82,-60,44,-2,30,20,52,26,-22,-54,96},new int[]{98,-54,-12,-12,-74,34,-6,-36,-94,40,96,42,-32,-46,-46,88,-90,26,-98,30,92,-34,74,-94,36,-68,-66,74,-2,6,94,-12,82,90,-2,78,-80,-84,18,74},new int[]{-42,30,56,-74,-16,-44,4,-62,-12,-62,-22,64,56,96,-16,40,10,88,-66,54,56,96,74,-6,-36,-70,-82,74,-14,-18,-32,-70,60,26,-88,-78,-8,32,-84,90},new int[]{-44,-14,-44,96,0,54,2,74,36,-56,-98,-16,-70,68,-88,26,-18,30,62,-88,-28,-58,62,-38,-62,28,-80,-6,88,-16,64,-58,14,94,-40,2,-12,-16,-24,-64},new int[]{20,18,-94,94,-2,-74,-56,-46,62,-88,-16,-30,-10,-54,38,22,-42,32,28,-42,44,64,46,66,-96,70,-32,10,-14,72,-42,98,-54,36,76,24,-96,86,54,-88},new int[]{74,-48,90,78,-44,0,76,-16,-28,-92,10,-32,-30,-78,-8,40,-90,74,-40,16,-78,22,-42,36,68,44,42,6,-60,36,-74,-92,92,-44,40,-92,-46,56,-36,-94}}); param0.add(new int[][]{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},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},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},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},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},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},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},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},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},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},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},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},new int[]{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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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}}); param0.add(new int[][]{new int[]{91,8,34,7,66,59,90,78,54,77,55,29,90,69,85,42,39,49,83,59,3,41,65,60,4,45,65,29,47,40,96,11,21,74,34,83,12,3,6,67,30,29,40,87,35,73,17,13,20},new int[]{38,36,55,16,85,38,67,15,37,25,81,61,31,68,31,11,23,39,35,21,66,66,52,49,55,35,40,47,99,25,91,6,50,3,62,11,46,88,95,17,40,70,35,76,59,84,4,99,84},new int[]{61,2,63,5,81,77,7,32,74,17,53,17,86,5,86,15,80,84,94,64,86,94,64,7,90,64,15,94,56,51,64,84,77,70,49,2,46,96,64,25,18,54,39,73,77,23,46,14,23},new int[]{48,22,2,60,46,8,3,70,58,6,27,23,71,92,10,45,48,85,81,86,61,27,85,75,1,49,47,82,8,74,92,40,61,27,12,30,37,66,84,36,86,40,36,96,60,96,70,27,41},new int[]{13,6,54,10,54,19,24,61,87,77,14,45,37,15,74,4,47,61,78,91,68,99,67,70,70,26,72,19,75,93,56,66,76,80,49,45,62,85,50,51,48,40,48,13,69,62,82,13,13},new int[]{25,75,45,24,38,4,19,83,38,61,21,59,71,72,76,59,36,31,72,23,16,22,68,40,28,60,89,87,87,89,16,11,45,89,75,25,43,67,69,41,66,91,38,62,73,29,13,45,68},new int[]{30,1,39,11,69,4,8,3,52,59,24,47,88,62,30,96,38,80,62,86,81,12,72,65,10,64,95,58,60,95,51,60,89,35,54,85,67,38,58,85,12,40,5,47,35,95,26,60,33},new int[]{47,58,24,5,76,9,56,45,32,69,14,63,7,2,55,36,29,59,15,64,65,80,99,2,99,23,18,98,26,38,58,52,92,53,18,40,86,93,18,26,71,65,29,91,80,91,29,44,31},new int[]{63,5,55,56,10,58,53,43,89,30,98,71,20,94,28,27,65,65,54,66,69,28,82,30,2,13,71,16,31,55,65,62,76,66,36,70,42,66,82,73,63,21,27,89,44,99,70,75,96},new int[]{6,19,62,34,59,79,75,95,84,64,95,81,81,77,83,62,24,4,18,97,33,43,57,40,90,65,10,88,84,54,68,58,40,46,88,32,1,97,4,36,41,57,30,13,43,77,88,99,29},new int[]{23,37,24,76,53,11,28,95,2,89,27,47,2,3,12,67,25,66,7,38,45,63,15,93,2,12,44,28,68,27,52,23,85,4,59,92,35,17,27,7,91,20,84,22,26,34,63,87,54},new int[]{97,74,14,36,43,72,69,25,78,13,46,10,88,50,49,98,55,43,22,78,13,78,46,9,24,32,61,91,51,53,58,95,54,47,11,21,18,60,10,27,82,66,90,40,45,52,98,85,16},new int[]{34,59,78,37,11,87,79,40,58,33,82,33,96,86,94,40,71,85,59,22,65,73,20,63,76,91,24,29,68,27,45,97,69,33,43,86,92,31,19,32,15,39,37,19,14,38,5,53,20},new int[]{44,25,58,89,40,99,34,90,26,87,63,16,43,84,77,25,48,55,7,47,43,84,3,41,28,65,34,9,43,39,76,8,52,12,75,43,16,94,18,93,12,83,54,15,27,81,46,89,24},new int[]{67,92,60,34,46,5,80,64,53,65,94,65,36,66,56,52,82,54,32,55,69,88,43,41,11,8,33,95,32,48,71,9,89,7,2,33,29,76,33,38,99,48,99,92,68,22,70,19,14},new int[]{90,32,71,27,57,73,87,90,40,24,15,27,70,87,74,29,8,30,17,87,13,93,46,87,12,30,43,80,14,3,23,75,67,51,23,49,69,69,69,54,57,46,60,43,47,70,14,30,95},new int[]{69,58,48,20,45,70,13,66,65,42,62,76,9,8,17,28,22,2,60,6,73,54,24,32,15,11,75,62,8,99,51,36,83,15,55,18,17,78,80,82,97,70,60,46,78,16,1,26,43},new int[]{34,59,69,68,91,5,24,72,81,23,64,19,72,6,66,72,91,96,65,11,28,27,27,87,87,61,29,52,86,14,41,86,59,5,42,91,22,50,9,6,99,37,24,4,8,67,62,38,99},new int[]{62,48,96,3,14,75,47,80,50,61,51,77,82,37,31,49,87,48,94,4,92,94,99,26,65,29,18,4,9,14,35,60,54,33,52,49,44,31,53,95,28,3,14,97,53,19,80,73,5},new int[]{18,14,24,76,93,33,55,40,65,59,45,3,29,17,12,4,60,72,23,82,14,94,65,19,24,50,91,80,96,78,41,37,75,77,4,94,69,80,48,5,55,85,43,58,36,3,8,40,87},new int[]{92,18,42,47,28,4,55,10,46,52,75,20,48,62,7,14,78,95,49,58,14,2,43,29,57,98,83,90,56,62,92,91,2,69,79,44,1,5,43,54,34,88,67,60,42,37,56,51,3},new int[]{28,31,22,14,75,56,68,57,39,10,73,69,72,27,79,2,99,99,10,24,48,56,19,9,21,80,36,43,11,49,85,49,84,84,28,48,13,80,39,94,8,19,97,73,3,12,29,34,34},new int[]{99,50,58,74,49,22,2,84,94,89,94,38,68,86,42,41,43,69,49,17,17,96,78,18,93,48,18,32,87,16,6,70,97,72,55,20,40,56,51,54,3,57,69,71,74,18,64,31,39},new int[]{23,18,26,32,12,65,32,90,98,14,8,79,44,56,52,33,34,31,92,95,99,11,90,65,59,95,49,27,77,64,21,33,2,69,11,67,65,89,40,12,66,60,65,10,62,48,32,84,43},new int[]{87,26,33,4,89,44,32,68,19,61,35,74,56,55,82,66,79,76,10,64,95,33,87,89,88,67,11,14,85,99,56,78,72,51,43,44,76,11,77,14,83,70,44,58,2,46,75,61,31},new int[]{93,73,8,30,6,84,16,28,43,47,80,29,89,86,91,83,98,42,91,65,20,77,34,1,24,57,77,96,66,61,55,63,7,1,52,67,85,47,32,74,88,34,94,73,7,59,78,47,42},new int[]{90,35,30,1,10,96,62,91,53,13,6,33,44,6,62,49,40,35,55,30,96,98,51,57,83,45,52,51,64,70,92,99,91,2,7,95,50,77,82,23,2,56,39,97,86,55,72,69,92},new int[]{45,12,56,49,85,32,64,91,3,47,10,82,50,33,71,53,94,32,57,63,59,65,83,85,73,94,28,95,76,11,51,17,87,12,69,65,58,31,76,94,13,42,15,43,34,14,60,88,24},new int[]{75,34,12,19,35,60,73,5,33,74,27,12,68,58,69,94,31,99,86,32,35,78,56,6,43,71,30,56,88,14,46,41,12,6,52,15,84,52,6,13,60,49,61,45,42,72,51,82,99},new int[]{95,81,81,39,93,29,96,7,99,11,94,42,1,16,99,74,68,49,15,6,15,80,68,25,86,69,76,6,64,96,87,57,94,99,39,71,3,92,68,30,5,91,49,40,5,26,58,82,90},new int[]{4,57,97,16,67,90,23,89,24,84,90,66,76,51,21,44,41,52,54,71,14,64,80,49,88,2,94,76,10,71,78,1,59,39,18,56,45,43,95,13,30,93,86,78,21,14,31,98,76},new int[]{40,86,5,71,50,83,56,89,56,6,75,48,16,31,65,10,90,63,84,63,1,81,6,21,89,58,70,18,72,49,10,68,2,99,10,51,86,63,55,77,90,32,53,48,99,76,45,31,52},new int[]{99,19,61,12,65,15,53,96,50,46,9,32,91,55,84,30,59,58,92,99,37,68,94,78,59,47,51,4,89,10,84,84,43,83,95,2,54,81,22,60,11,30,98,59,57,37,88,43,9},new int[]{14,75,98,81,61,53,54,7,97,68,98,21,92,20,12,26,14,69,52,59,36,37,89,82,13,57,26,34,12,72,12,63,91,10,21,73,46,60,8,17,5,50,30,10,83,53,97,90,39},new int[]{64,61,79,7,82,31,35,88,41,39,61,54,15,67,50,86,79,58,54,9,51,83,47,8,43,6,53,61,51,45,90,42,38,35,70,7,1,18,26,87,51,76,34,82,76,66,10,66,7},new int[]{62,86,31,83,51,75,40,72,22,4,42,47,56,77,36,55,36,36,74,55,67,3,96,88,38,68,2,34,92,83,16,97,70,13,36,65,73,20,49,53,49,13,32,47,42,29,26,81,44},new int[]{44,18,97,11,67,31,23,89,39,31,82,62,55,55,15,83,66,6,13,58,88,97,62,21,37,75,27,18,78,11,52,47,33,9,87,49,38,67,12,14,3,5,60,63,13,22,2,31,45},new int[]{55,47,20,4,13,45,34,25,95,4,13,19,1,36,74,85,51,23,35,95,23,65,63,58,67,12,18,51,21,23,38,87,92,65,69,14,48,62,86,73,41,52,12,55,85,46,88,44,38},new int[]{83,29,86,98,92,66,4,69,74,50,78,75,3,44,78,34,12,54,17,90,23,97,21,96,6,3,73,5,58,93,45,64,2,97,33,93,14,62,68,19,53,66,78,5,52,94,84,60,54},new int[]{15,44,11,54,64,99,91,94,57,73,95,25,24,4,66,11,84,83,50,89,31,83,27,75,98,49,15,3,59,20,67,67,4,67,23,97,87,17,67,57,91,34,81,99,90,29,55,88,28},new int[]{18,89,80,81,71,51,19,14,63,18,10,40,7,64,41,55,51,75,30,89,7,18,18,89,46,98,25,1,71,6,43,89,88,30,90,30,37,57,99,3,37,91,45,69,46,32,19,51,83},new int[]{11,5,99,30,60,57,35,66,16,60,93,22,7,20,58,29,91,80,59,81,52,1,51,79,88,26,92,40,12,59,9,57,42,94,24,17,79,36,48,71,83,48,88,50,69,12,62,27,22},new int[]{50,91,58,61,4,65,8,12,10,67,97,24,59,37,57,29,58,43,66,25,7,97,93,73,98,24,86,31,8,30,64,93,66,4,91,78,70,67,33,5,63,41,16,39,7,42,21,22,75},new int[]{2,16,31,71,84,77,39,36,83,7,14,43,53,3,76,98,29,68,75,3,5,94,73,21,2,97,73,48,6,66,45,85,27,99,62,67,34,66,13,39,18,11,4,35,62,55,91,86,63},new int[]{1,57,15,25,30,61,83,28,24,17,60,56,58,7,68,10,76,6,35,18,28,55,82,52,19,18,63,40,49,95,82,76,78,85,61,79,31,48,49,40,60,67,65,86,71,44,45,58,33},new int[]{64,70,88,84,20,95,73,14,2,56,94,73,83,25,93,58,49,91,76,72,10,42,73,35,49,88,12,87,78,87,78,38,57,81,12,19,14,75,71,24,78,32,23,61,8,68,61,54,4},new int[]{22,20,70,20,61,33,74,38,14,2,88,96,31,86,10,34,61,59,92,47,92,70,52,1,39,47,62,17,92,95,7,5,56,73,86,36,25,73,10,90,38,25,42,88,3,75,44,71,61},new int[]{90,36,14,93,21,25,23,58,5,43,65,53,93,76,93,25,48,20,73,42,28,2,92,13,24,28,20,88,53,90,52,86,33,31,39,58,19,80,54,24,19,48,11,17,41,13,63,56,48},new int[]{87,89,92,89,55,51,31,4,3,3,8,39,23,32,25,74,83,66,79,54,45,97,33,22,89,1,7,91,97,2,55,18,32,69,12,71,94,85,56,47,16,27,99,80,32,15,50,79,25}}); param0.add(new int[][]{new int[]{-94,-78,-30,-16,-14,22,44,44,54,60,68,72,92,94,98},new int[]{-92,-68,-52,-40,-30,-28,-20,-16,14,38,42,54,60,72,86},new int[]{-78,-68,-58,-36,-10,-10,42,48,52,52,58,68,72,78,96},new int[]{-94,-86,-84,-60,-40,0,0,22,48,56,70,72,80,90,96},new int[]{-98,-92,-80,-68,-58,38,50,52,58,60,62,62,72,86,90},new int[]{-94,-92,-70,-64,-46,-38,-32,-14,-10,-6,18,30,32,74,98},new int[]{-72,-60,-52,-50,-26,-24,-6,4,10,40,46,86,88,98,98},new int[]{-94,-72,-40,-36,-36,-28,0,18,34,36,38,44,50,54,98},new int[]{-72,-60,-40,-38,-36,-26,-18,-8,-2,2,30,34,50,76,80},new int[]{-96,-74,-46,-38,-26,-16,-10,2,2,20,28,48,48,60,90},new int[]{-86,-60,-58,-58,-46,-40,-4,2,16,18,26,62,64,78,98},new int[]{-98,-50,-12,-10,-2,12,20,40,60,66,76,78,84,90,92},new int[]{-72,-68,-68,-52,-8,-6,10,20,42,52,54,56,72,86,90},new int[]{-80,-74,-32,10,18,54,62,74,76,78,86,86,88,94,96},new int[]{-98,-78,-76,-72,-56,-30,-26,0,36,42,44,76,84,88,94}}); param0.add(new int[][]{new int[]{0,0,0,1,0,1,1,1,1,1,0,0,1,0,1,0,0,1,1,1,1,0,0,0,1,1,0},new int[]{0,0,1,0,0,0,0,0,1,0,1,0,1,1,1,0,0,1,1,1,1,1,1,0,0,0,1},new int[]{1,0,0,1,1,0,0,1,0,1,0,0,1,1,1,1,0,1,0,1,1,1,0,0,0,1,0},new int[]{1,1,1,1,1,0,0,1,0,1,0,0,0,1,0,0,0,0,1,1,1,1,1,0,0,1,0},new int[]{1,1,1,1,0,0,0,1,1,1,1,0,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0},new int[]{1,0,1,1,0,0,1,1,0,1,0,0,0,1,0,0,1,0,0,1,1,1,0,1,1,0,0},new int[]{1,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,1},new int[]{1,0,0,0,0,1,0,1,0,0,0,0,1,0,1,1,0,1,1,1,0,0,0,1,0,0,0},new int[]{0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,1,1,1,1,1,0,0,1,1},new int[]{0,1,0,0,1,0,1,1,1,0,0,1,1,0,0,0,1,1,0,0,1,1,0,1,1,0,1},new int[]{1,1,1,0,1,0,1,1,1,1,0,0,0,0,1,0,1,0,0,0,1,0,0,1,0,1,1},new int[]{0,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,0,1,0,0,0,1,1,1,0,0,1},new int[]{1,1,0,1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,0,0,0,1,0,1,1,0,0},new int[]{1,1,1,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1,1,1,0,0,0,0,0,1,0},new int[]{1,1,1,0,1,1,1,0,0,0,1,0,1,1,0,1,1,0,0,1,0,1,0,0,0,1,1},new int[]{0,1,1,0,0,1,0,0,1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,0,1,1,0},new int[]{1,1,1,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1,1,1,0,1,0},new int[]{0,0,0,0,0,0,1,1,1,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,1},new int[]{1,0,0,0,0,1,0,0,1,0,1,0,0,1,0,1,0,0,0,0,1,1,0,0,0,0,1},new int[]{0,0,0,0,0,1,0,1,1,0,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,0,1},new int[]{1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,1,0,1,1,0,1,0,0,0,0,0},new int[]{1,1,0,0,1,0,1,1,1,0,0,0,1,0,0,0,0,1,1,0,1,1,1,0,1,0,0},new int[]{1,1,0,0,0,1,1,0,1,0,0,0,1,1,0,1,1,0,1,1,0,0,1,0,1,0,0},new int[]{0,1,0,1,0,0,0,1,0,1,0,1,1,1,1,0,1,0,0,1,0,1,0,1,0,0,1},new int[]{1,1,1,1,1,0,1,1,0,1,0,1,1,1,1,1,0,0,1,1,0,1,0,0,1,1,1},new int[]{1,1,0,1,1,0,1,1,1,1,1,1,1,1,0,0,0,0,1,0,1,1,0,1,1,0,1},new int[]{0,0,0,1,0,1,1,1,1,1,1,0,0,0,1,0,1,0,1,1,1,1,1,1,0,0,0}}); param0.add(new int[][]{new int[]{2,21,39,67,70,73,83,86,87,93},new int[]{31,42,53,56,64,65,85,89,94,98},new int[]{3,15,17,50,52,67,73,82,91,94},new int[]{12,15,16,21,23,30,33,38,50,89},new int[]{5,7,25,28,38,43,43,58,64,86},new int[]{24,26,29,33,46,47,52,71,86,96},new int[]{7,10,23,24,36,39,47,61,77,89},new int[]{1,10,26,27,61,62,64,80,85,94},new int[]{3,8,16,32,37,48,54,58,77,82},new int[]{43,52,70,76,81,84,84,85,95,99}}); param0.add(new int[][]{new int[]{62,-24,-62,-18,46,14,90,-42,-98,-52,36,96,26,-26,38,-88,88,-98,-86},new int[]{-24,58,-70,-56,68,-66,-24,30,-86,-74,98,-24,-48,-28,24,-64,22,46,40},new int[]{2,-30,-94,6,-24,-42,-70,-20,-80,14,74,72,-68,58,36,40,88,-80,54},new int[]{-24,-50,-96,-36,36,30,-58,64,98,-86,-74,-18,-64,74,-46,-24,68,34,24},new int[]{-34,96,14,-50,-68,-72,-38,-52,56,4,60,-90,-70,16,-4,0,-82,2,-16},new int[]{22,10,54,-86,14,12,64,-54,92,2,88,50,-24,-86,-32,46,-66,-26,-90},new int[]{-22,26,44,2,70,-94,-78,32,-30,-64,90,-16,68,-60,-10,-18,-64,20,-18},new int[]{72,-14,-98,-54,72,18,24,4,-16,-26,78,-80,26,-10,18,20,22,68,20},new int[]{-32,74,14,-18,88,42,6,-6,-16,-30,80,-16,24,-96,-96,-52,-38,-34,-46},new int[]{-12,-72,-48,52,-64,-30,26,64,0,34,52,-66,98,-96,-52,-96,38,-56,-32},new int[]{-2,18,-60,-52,-46,62,-10,82,-24,34,72,50,-98,-96,78,86,6,32,-60},new int[]{-44,-52,-66,-46,24,80,-68,92,-32,26,-44,30,72,-56,-56,28,-26,22,-92},new int[]{82,-58,-60,-30,-68,-18,-72,98,92,-28,-30,44,78,10,54,56,2,-92,24},new int[]{4,96,-84,68,14,-86,6,22,-6,-60,2,-38,-48,48,-74,-52,-44,-68,-96},new int[]{46,4,16,20,-12,86,-56,88,8,-68,56,14,2,-38,-20,-42,-64,86,30},new int[]{96,68,-74,14,66,-20,72,60,56,-78,-14,2,60,16,-2,-90,-46,24,68},new int[]{-80,40,72,-88,-2,12,-96,-34,-88,94,46,-62,84,-68,14,-62,-26,-94,-66},new int[]{24,-60,-30,-22,-42,-2,-52,76,-16,26,-82,64,88,6,-42,-46,36,50,98},new int[]{-30,-16,-80,-16,-42,-6,60,-78,-94,-42,-20,44,-78,70,48,-84,-52,-22,46}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,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},new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,1},new int[]{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},new int[]{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},new int[]{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,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,1,1,1,1,1,1,1,1,1,1,1}}); param0.add(new int[][]{new int[]{58,85,97,21,67,89,63,21,3,59,28,4,57,94,75,40,26,76,91,6,64,58,31,26,69,56},new int[]{61,73,86,49,29,98,33,19,25,73,53,43,38,38,35,8,76,31,86,93,82,13,22,28,38,88},new int[]{36,22,61,11,68,82,29,74,11,31,71,46,70,47,91,56,26,34,52,41,82,3,21,59,15,3},new int[]{67,75,36,39,7,71,38,63,36,73,77,63,61,19,58,96,24,71,76,5,92,80,56,51,57,11},new int[]{81,94,93,62,55,71,63,25,30,12,82,98,12,57,44,59,67,18,56,20,37,80,66,57,34,64},new int[]{69,90,68,50,46,79,27,12,24,37,33,24,2,33,50,3,21,20,30,30,27,8,82,99,71,83},new int[]{4,52,66,74,99,99,10,51,25,84,50,37,10,56,36,42,92,89,70,67,17,89,44,63,1,34},new int[]{78,19,58,40,15,68,31,14,96,72,74,34,10,64,69,91,12,65,82,30,20,76,73,22,49,65},new int[]{11,46,64,46,13,96,43,95,47,18,45,16,69,36,53,50,24,68,43,91,31,48,47,1,91,44},new int[]{86,37,91,17,78,5,39,37,62,68,26,91,19,64,42,55,65,56,85,33,90,70,97,51,61,42},new int[]{47,84,97,98,53,58,83,86,30,42,4,72,67,32,50,37,43,92,40,6,1,98,25,16,36,18},new int[]{5,15,23,78,81,92,74,55,30,59,43,27,48,24,33,90,79,61,16,76,13,75,13,91,86,97},new int[]{50,81,63,53,30,92,83,19,43,90,40,66,2,92,72,35,87,11,26,55,26,92,80,79,68,73},new int[]{2,55,80,76,99,98,8,31,23,87,99,75,72,45,79,70,84,36,9,78,44,45,38,96,66,39},new int[]{78,28,1,62,38,69,48,57,89,60,15,7,67,99,63,37,65,27,1,8,17,15,1,39,11,49},new int[]{20,70,15,29,42,31,49,87,50,11,66,55,21,35,77,7,65,3,92,86,52,36,16,55,25,59},new int[]{24,90,55,67,66,96,58,49,21,1,39,30,65,55,57,64,98,27,90,65,43,26,10,77,86,9},new int[]{40,44,98,40,1,40,6,30,39,41,10,55,44,38,44,86,95,80,86,41,40,94,35,46,87,36},new int[]{30,21,73,92,41,17,19,71,53,19,80,65,93,1,69,48,95,54,81,52,50,72,91,9,73,74},new int[]{42,87,8,31,39,47,35,29,70,42,94,53,27,53,67,51,28,86,27,77,8,84,48,34,71,2},new int[]{84,68,18,85,35,63,98,68,95,24,85,10,23,88,15,70,15,46,46,52,4,72,21,75,11,21},new int[]{21,1,28,27,46,61,52,56,43,9,88,19,41,40,12,90,49,56,92,65,3,46,16,46,45,64},new int[]{65,27,31,4,16,63,97,48,45,39,37,7,89,99,19,93,57,16,25,43,80,27,70,63,50,69},new int[]{97,69,6,27,72,96,13,62,99,28,63,5,85,45,67,97,60,65,21,24,85,46,21,6,31,19},new int[]{89,76,25,93,74,3,97,44,8,25,95,57,65,17,32,72,31,85,38,53,76,1,58,41,87,76},new int[]{42,30,40,72,77,45,71,43,39,3,8,52,99,92,80,1,83,60,29,93,9,96,50,73,32,92}}); List<Integer> param1 = new ArrayList<>(); param1.add(14); param1.add(28); param1.add(28); param1.add(48); param1.add(14); param1.add(19); param1.add(6); param1.add(11); param1.add(8); param1.add(25); List<Integer> param2 = new ArrayList<>(); param2.add(17); param2.add(27); param2.add(16); param2.add(37); param2.add(7); param2.add(20); param2.add(5); param2.add(18); param2.add(10); param2.add(14); 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()); } }
1,580
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS.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_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS{ static int f_gold ( String s ) { int result = 0 ; int n = s . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i ; j < n ; j ++ ) if ( s . charAt ( i ) == s . charAt ( j ) ) result ++ ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("LZIKA"); param0.add("0556979952"); param0.add("110010"); param0.add("kGaYfd"); param0.add("413567670657"); param0.add("01001"); param0.add("EQPuFa"); param0.add("48848378"); param0.add("110"); param0.add("PLehNeP"); 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()); } }
1,581
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_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 DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY{ static int f_gold ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int count = 0 , max_count = 0 , min_count = n ; for ( int i = 0 ; i < ( n - 1 ) ; i ++ ) { if ( arr [ i ] == arr [ i + 1 ] ) { count += 1 ; continue ; } else { max_count = Math . max ( max_count , count ) ; min_count = Math . min ( min_count , count ) ; count = 0 ; } } return ( max_count - min_count ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,15,19,22,28,29,39,46,46,49,51,55,62,69,72,72,72,74,79,92,92,93,95,96}); param0.add(new int[]{-26,-54,92,76,-92,-14,-24,-70,-78,-50,-48,-22,12,2,-34,-60,4,-32,-10,52,-92,-74,18,34,6,-66,42,-10,-6,56,92}); 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,1,1,1,1,1,1}); param0.add(new int[]{59,35,13,79,61,97,92,48,98,38,65,54,31,49,81,22,96,29,65,48,92,66,25,21,26,1,32,73,46,5,40,17,53,93,83,29}); param0.add(new int[]{-70,-34,-32,-30,-14,80,86,90}); param0.add(new int[]{0,1,0,1,1,0,0,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0}); param0.add(new int[]{9}); param0.add(new int[]{94,10,70,42}); 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}); param0.add(new int[]{64,76,49,55,92,15,4,8,95,60,90,3,7,79,84,17,96,10,80,26,22,15}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(30); param1.add(24); param1.add(29); param1.add(4); param1.add(23); param1.add(0); param1.add(2); param1.add(24); 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()); } }
1,582
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_WHETHER_NUMBER_DUCK_NUMBER_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_WHETHER_NUMBER_DUCK_NUMBER_NOT{ static int f_gold ( String num ) { int len = num . length ( ) ; int count_zero = 0 ; char ch ; for ( int i = 1 ; i < len ; i ++ ) { ch = num . charAt ( i ) ; if ( ch == '0' ) count_zero ++ ; } return count_zero ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("HLlQWSphZcIC"); param0.add("080287724"); param0.add("0000100000"); param0.add(" Q"); param0.add("4247040983"); param0.add("00001011101"); param0.add("LbNsnYTHmLbCf"); param0.add("24"); param0.add("110"); param0.add("ie"); 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()); } }
1,583
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SINGLE_NODE_ISOLATED_SUB_GRAPHS_DISCONNECTED_GRAPH.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_SINGLE_NODE_ISOLATED_SUB_GRAPHS_DISCONNECTED_GRAPH{ static int f_gold ( int [ ] graph , int N ) { int count = 0 ; for ( int i = 1 ; i < 7 ; i ++ ) { if ( graph [ i ] == 0 ) count ++ ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{18,26,39,43,46,57,63,76,84,88}); param0.add(new int[]{76,-92,-40,48,84,8,28,64,84,-58,40,48,-8,22,84,-14,-32,-66,84,-74,10,50,96,92,-60,70,0,2,16,-26}); 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}); param0.add(new int[]{15,76,11,70,34,54,4,33,20,93,51,9,58,50,23,97,42,28,98,3,21,39,20,11,38}); param0.add(new int[]{-96,-84,-74,-58,-52,-52,-28,-24,-22,-12,-12,-8,-6,-2,-2,8,10,20,24,32,36,36,46,54,66,88,94}); param0.add(new int[]{0,1,1,1,1,0,0,0,0,0,0,1,1,0,1,1,0,1,1,1,0,1,1,1,0,1,0,1,0,0,0,1,0,0,0,0,0,0,1,1,0,1,1,1,0,1}); param0.add(new int[]{1,1,4,9,13,18,18,21,22,32,33,39,41,44,51,55,56,59,60,61,63,68,69,71,72,73,74,74,75,81,83,87,88,92,94,97}); param0.add(new int[]{10,54,-64,30,-50,-4,14,-96,-22,80,-36,-36,-92,58,28,10,32,-82,-6,-40,0,-46,-68,-18,-16,-38,-22,-68,-82,76,70,-48,10,50,82,98,-22,-74,22,-60,-70,46,84,88,-34,-30,88,26}); 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,1}); param0.add(new int[]{25,39,1,6,86,45,19,76,65,29,9}); List<Integer> param1 = new ArrayList<>(); param1.add(8); param1.add(15); param1.add(31); param1.add(12); param1.add(20); param1.add(24); param1.add(22); param1.add(35); param1.add(41); 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()); } }
1,584
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/AREA_SQUARE_CIRCUMSCRIBED_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 AREA_SQUARE_CIRCUMSCRIBED_CIRCLE{ static int f_gold ( int r ) { return ( 2 * r * r ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(14); param0.add(78); param0.add(45); param0.add(66); param0.add(18); param0.add(32); param0.add(60); param0.add(16); param0.add(99); 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()); } }
1,585
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_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_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N{ static int f_gold ( int n ) { int result = 0 ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n - i ; j ++ ) for ( int k = 0 ; k <= ( n - i - j ) ; k ++ ) if ( i + j + k == n ) result ++ ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(62); param0.add(44); param0.add(37); param0.add(81); param0.add(14); param0.add(20); param0.add(76); param0.add(72); param0.add(96); param0.add(52); 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()); } }
1,586
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT.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_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT{ static int f_gold ( int x1 , int y1 , int x2 , int y2 , int r1 , int r2 ) { int distSq = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ) ; int radSumSq = ( r1 + r2 ) * ( r1 + r2 ) ; if ( distSq == radSumSq ) return 1 ; else if ( distSq > radSumSq ) return - 1 ; else return 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(11); param0.add(87); param0.add(51); param0.add(89); param0.add(64); param0.add(57); param0.add(65); param0.add(32); param0.add(73); param0.add(3); List<Integer> param1 = new ArrayList<>(); param1.add(36); param1.add(1); param1.add(1); param1.add(67); param1.add(10); param1.add(86); param1.add(90); param1.add(23); param1.add(61); param1.add(99); List<Integer> param2 = new ArrayList<>(); param2.add(62); param2.add(62); param2.add(47); param2.add(9); param2.add(79); param2.add(99); param2.add(42); param2.add(28); param2.add(63); param2.add(6); List<Integer> param3 = new ArrayList<>(); param3.add(64); param3.add(64); param3.add(90); param3.add(52); param3.add(45); param3.add(43); param3.add(82); param3.add(26); param3.add(77); param3.add(19); List<Integer> param4 = new ArrayList<>(); param4.add(50); param4.add(54); param4.add(14); param4.add(94); param4.add(67); param4.add(83); param4.add(77); param4.add(60); param4.add(92); param4.add(21); List<Integer> param5 = new ArrayList<>(); param5.add(4); param5.add(41); param5.add(71); param5.add(21); param5.add(78); param5.add(63); param5.add(32); param5.add(45); param5.add(76); param5.add(28); 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),param5.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i),param5.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
1,587
0
Create_ds/CodeGen/data/transcoder_evaluation_gfg
Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION.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_PLATFORMS_REQUIRED_RAILWAYBUS_STATION{ static int f_gold ( int arr [ ] , int dep [ ] , int n ) { Arrays . sort ( arr ) ; Arrays . sort ( dep ) ; int plat_needed = 1 , result = 1 ; int i = 1 , j = 0 ; while ( i < n && j < n ) { if ( arr [ i ] <= dep [ j ] ) { plat_needed ++ ; i ++ ; if ( plat_needed > result ) result = plat_needed ; } else { plat_needed -- ; j ++ ; } } return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8,24,28,64,75,86,93,95}); param0.add(new int[]{2,-30,-8,-78,58,-42,-94,84,-58,14,78,34,30,6,-18,-92,0,94,-54,58,0,-86,66,86,8,-26,50,16,-30,-68,98,-28,-4,-6}); param0.add(new int[]{0,0,0,0,0,0,1}); param0.add(new int[]{51,5,48,61,71,2,4,35,50,76,59,64,81,5,21,95}); param0.add(new int[]{-64,-52,44,52,90}); param0.add(new int[]{0,0,1,0,1,0,1,1,0,1,1,1,0,1,0,1,0,1,0,0,0,1,1,1,0,1,0,1,1,1}); param0.add(new int[]{2,15,25,55,72,96,98}); param0.add(new int[]{-60,30,-58,52,40,74,74,76,-72,-48,8,-56,-24,-40,-98,-76,-56,-20,30,-30,-34,4,-34}); 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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{37,84,20,34,56,1,87,72}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{19,30,41,51,62,68,85,96}); param1.add(new int[]{40,22,-24,80,-76,-4,-8,-34,96,-98,16,28,14,52,10,-10,-62,64,-48,10,-64,-90,-52,46,34,50,50,-84,68,-12,-44,28,-22,78}); param1.add(new int[]{0,0,0,0,0,1,1}); param1.add(new int[]{67,84,86,43,50,90,49,8,40,67,5,51,40,28,31,47}); param1.add(new int[]{-62,-16,22,26,58}); param1.add(new int[]{0,0,1,1,1,0,1,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,1,0,0,0,0,0,0}); param1.add(new int[]{3,6,11,19,26,37,39}); param1.add(new int[]{-96,-40,-76,52,-20,-28,-64,-72,36,56,52,34,14,8,-50,6,-82,-98,-8,18,-76,-66,-22}); 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,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[]{68,62,84,54,15,29,70,96}); List<Integer> param2 = new ArrayList<>(); param2.add(6); param2.add(18); param2.add(6); param2.add(8); param2.add(3); param2.add(17); param2.add(6); param2.add(20); param2.add(22); param2.add(6); 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()); } }
1,588
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/floats.java
/* * This file was automatically generated by EvoSuite * Wed Apr 21 13:16:53 GMT 2021 */ import org.junit.Test; import static org.junit.Assert.*; import org.evosuite.runtime.EvoRunner; import org.evosuite.runtime.EvoRunnerParameters; import org.junit.runner.RunWith; @RunWith(EvoRunner.class) @EvoRunnerParameters(mockJVMNonDeterminism = true, useVFS = true, useVNET = true, resetStaticState = true, separateClassLoader = true) public class CLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb_ESTest extends CLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb_ESTest_scaffolding { @Test(timeout = 4000) public void test0() throws Throwable { float float0 = CLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb.sqr(31337.701F); assertEquals(9.8205152E8F, float0, 0.01F); } @Test(timeout = 4000) public void test1() throws Throwable { float float0 = CLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb.sqr(0.0F); assertEquals(0.0F, float0, 0.01F); } @Test(timeout = 4000) public void test2() throws Throwable { CLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb cLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb0 = new CLASS_9167f62308cfc555ab31a6e4dcdcc95ca2bdcab48016d16bd5b42146ef1977eb(); } }
1,589
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/doubles.java
/* * This file was automatically generated by EvoSuite * Wed Apr 21 13:17:21 GMT 2021 */ import org.junit.Test; import static org.junit.Assert.*; import org.evosuite.runtime.EvoRunner; import org.evosuite.runtime.EvoRunnerParameters; import org.junit.runner.RunWith; @RunWith(EvoRunner.class) @EvoRunnerParameters(mockJVMNonDeterminism = true, useVFS = true, useVNET = true, resetStaticState = true, separateClassLoader = true) public class CLASS_4819651a89a417bce7b2158d1101004f26892e6022f6d1e6348175e23666ec38_ESTest extends CLASS_4819651a89a417bce7b2158d1101004f26892e6022f6d1e6348175e23666ec38_ESTest_scaffolding { @Test(timeout = 4000) public void test0() throws Throwable { Double double0 = new Double(3051.0); double double1 = CLASS_4819651a89a417bce7b2158d1101004f26892e6022f6d1e6348175e23666ec38.simplep(double0); assertEquals(3051.0, double1, 1.0E-4); }
1,590
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/java_list.java
/* * This file was automatically generated by EvoSuite * Wed Apr 21 13:41:06 GMT 2021 */ import org.junit.Test; import static org.junit.Assert.*; import java.util.ArrayList; import org.evosuite.runtime.EvoRunner; import org.evosuite.runtime.EvoRunnerParameters; import org.junit.runner.RunWith; @RunWith(EvoRunner.class) @EvoRunnerParameters(mockJVMNonDeterminism = true, useVFS = true, useVNET = true, resetStaticState = true, separateClassLoader = true) public class CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1_ESTest extends CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1_ESTest_scaffolding { @Test(timeout = 4000) public void test0() throws Throwable { ArrayList<Double> arrayList0 = new ArrayList<Double>(); Double double0 = new Double(0.0); arrayList0.add(double0); Double double1 = new Double(1.0); CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1.ExpandArrayByLastE_Double(arrayList0, double1); assertFalse(arrayList0.contains(double1)); } @Test(timeout = 4000) public void test1() throws Throwable { ArrayList<Double> arrayList0 = new ArrayList<Double>(); Double double0 = new Double(0.0); arrayList0.add(double0); CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1.ExpandArrayByLastE_Double(arrayList0, double0); assertTrue(arrayList0.contains(0.0)); } @Test(timeout = 4000) public void test2() throws Throwable { ArrayList<Double> arrayList0 = new ArrayList<Double>(); Double double0 = new Double(9000.554); arrayList0.add(double0); CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1.ExpandArrayByLastE_Double(arrayList0, double0); assertEquals(9001, arrayList0.size()); } @Test(timeout = 4000) public void test3() throws Throwable { ArrayList<Double> arrayList0 = new ArrayList<Double>(); Double double0 = new Double(0.0); CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1.ExpandArrayByLastE_Double(arrayList0, double0); assertFalse(arrayList0.contains(double0)); } @Test(timeout = 4000) public void test4() throws Throwable { CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1 cLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1_0 = new CLASS_db35bde703321c750c7134d5769b704c9ab7f9841c6654abb814683a361f9de1(); } }
1,591
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/strings.java
/* * This file was automatically generated by EvoSuite * Wed Apr 21 13:16:49 GMT 2021 */ import org.junit.Test; import static org.junit.Assert.*; import org.evosuite.runtime.EvoRunner; import org.evosuite.runtime.EvoRunnerParameters; import org.junit.runner.RunWith; @RunWith(EvoRunner.class) @EvoRunnerParameters(mockJVMNonDeterminism = true, useVFS = true, useVNET = true, resetStaticState = true, separateClassLoader = true) public class CLASS_27c05c7602b81c3bcf7ac99abf940ebc4c909da67935bb59bc30e51ac3933ace_ESTest extends CLASS_27c05c7602b81c3bcf7ac99abf940ebc4c909da67935bb59bc30e51ac3933ace_ESTest_scaffolding { @Test(timeout = 4000) public void test0() throws Throwable { CLASS_27c05c7602b81c3bcf7ac99abf940ebc4c909da67935bb59bc30e51ac3933ace cLASS_27c05c7602b81c3bcf7ac99abf940ebc4c909da67935bb59bc30e51ac3933ace0 = new CLASS_27c05c7602b81c3bcf7ac99abf940ebc4c909da67935bb59bc30e51ac3933ace(); } @Test(timeout = 4000) public void test1() throws Throwable { String string0 = CLASS_27c05c7602b81c3bcf7ac99abf940ebc4c909da67935bb59bc30e51ac3933ace.getProperty("", ""); assertNull(string0); } }
1,592
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/strings_null_casting.java
/* * This file was automatically generated by EvoSuite * Wed Apr 21 13:16:57 GMT 2021 */ public class CLASS_c2a773c670339b0d7be430a133f7f597ae56ad8ebb7f7209c0fe9edbd248fd04_ESTest extends CLASS_c2a773c670339b0d7be430a133f7f597ae56ad8ebb7f7209c0fe9edbd248fd04_ESTest_scaffolding { @Test(timeout = 4000) public void test2() throws Throwable { boolean boolean0 = CLASS_c2a773c670339b0d7be430a133f7f597ae56ad8ebb7f7209c0fe9edbd248fd04.isExtension("", (String) null); assertFalse(boolean0); }
1,593
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/integer_array_check.java
/* * This file was automatically generated by EvoSuite * Wed Apr 14 18:54:05 GMT 2021 */ import org.junit.Test; import static org.junit.Assert.*; import org.evosuite.runtime.EvoRunner; import org.evosuite.runtime.EvoRunnerParameters; import org.junit.runner.RunWith; @RunWith(EvoRunner.class) @EvoRunnerParameters(mockJVMNonDeterminism = true, useVFS = true, useVNET = true, resetStaticState = true, separateClassLoader = true) public class PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K_ESTest extends PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K_ESTest_scaffolding { @Test(timeout = 4000) public void test0() throws Throwable { Integer[] integerArray0 = new Integer[2]; int int0 = (-1); Integer integer0 = new Integer((-1)); assertEquals((-1), (int)integer0); assertTrue(integer0.equals((Object)int0)); assertNotNull(integer0); integerArray0[0] = integer0; Integer integer1 = new Integer(1); assertEquals(1, (int)integer1); assertFalse(integer1.equals((Object)int0)); assertFalse(integer1.equals((Object)integer0)); assertNotNull(integer1); integerArray0[1] = integer1; int[] intArray0 = new int[3]; intArray0[2] = int0; boolean boolean0 = PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.isPossible(integerArray0, intArray0, 1, 0); assertTrue(boolean0); assertArrayEquals(new int[] {(-1), 0, 0}, intArray0); assertEquals(2, integerArray0.length); assertEquals(3, intArray0.length); } @Test(timeout = 4000) public void test1() throws Throwable { Integer[] integerArray0 = new Integer[2]; int int0 = (-1); Integer integer0 = new Integer((-1)); assertEquals((-1), (int)integer0); assertTrue(integer0.equals((Object)int0)); assertNotNull(integer0); integerArray0[0] = integer0; int int1 = 1; integerArray0[1] = integer0; int[] intArray0 = new int[3]; intArray0[2] = int0; boolean boolean0 = PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.isPossible(integerArray0, intArray0, int1, (-50146)); assertTrue(boolean0); assertArrayEquals(new int[] {(-1), 0, 0}, intArray0); assertFalse(int1 == int0); assertEquals(2, integerArray0.length); assertEquals(3, intArray0.length); } @Test(timeout = 4000) public void test2() throws Throwable { Integer[] integerArray0 = new Integer[2]; Integer integer0 = new Integer((-1)); assertEquals((-1), (int)integer0); assertNotNull(integer0); integerArray0[0] = integer0; integerArray0[1] = integer0; int[] intArray0 = new int[3]; boolean boolean0 = PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.isPossible(integerArray0, intArray0, (-54229), 1); assertTrue(boolean0); assertArrayEquals(new int[] {0, 0, 0}, intArray0); assertEquals(2, integerArray0.length); assertEquals(3, intArray0.length); } @Test(timeout = 4000) public void test3() throws Throwable { Integer[] integerArray0 = new Integer[2]; Integer integer0 = new Integer((-1)); assertEquals((-1), (int)integer0); assertNotNull(integer0); integerArray0[0] = integer0; int int0 = 1; integerArray0[1] = integerArray0[0]; int[] intArray0 = new int[3]; boolean boolean0 = PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.isPossible(integerArray0, intArray0, 1, int0); assertFalse(boolean0); assertArrayEquals(new int[] {0, 0, 0}, intArray0); assertEquals(2, integerArray0.length); assertEquals(3, intArray0.length); } @Test(timeout = 4000) public void test4() throws Throwable { PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K pERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K0 = new PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K(); assertNotNull(pERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K0); } }
1,594
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/integer_array_casting.java
/* * This file was automatically generated by EvoSuite * Wed Apr 21 13:17:52 GMT 2021 */ public class CLASS_196a45f8932c033f06f6a086488b268404e77353d16c9bc6407a417f237da6db_ESTest extends CLASS_196a45f8932c033f06f6a086488b268404e77353d16c9bc6407a417f237da6db_ESTest_scaffolding { @Test(timeout = 4000) public void test3() throws Throwable { int int0 = CLASS_196a45f8932c033f06f6a086488b268404e77353d16c9bc6407a417f237da6db.missingNumber((int[]) null); assertEquals(0, int0); }
1,595
0
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources
Create_ds/CodeGen/codegen_sources/test_generation/evosuite_tests_translators/tests/resources/java_evosuite_tests/different_object_name.java
/* * This file was automatically generated by EvoSuite * Fri Jun 18 14:55:38 GMT 2021 */ import org.junit.Test; import static org.junit.Assert.*; import static org.evosuite.runtime.EvoAssertions.*; import org.evosuite.runtime.EvoRunner; import org.evosuite.runtime.EvoRunnerParameters; import org.junit.runner.RunWith; @RunWith(EvoRunner.class) @EvoRunnerParameters(mockJVMNonDeterminism = true, useVFS = true, useVNET = true, resetStaticState = true, separateClassLoader = true) public class CLASS_FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2_ESTest extends CLASS_FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2_ESTest_scaffolding { @Test(timeout = 4000) public void test0() throws Throwable { CLASS_FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2 cLASS_FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2_0 = new CLASS_FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2(); int[] intArray0 = new int[1]; int int0 = cLASS_FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2_0.getOddOccurrence(intArray0, (-39131)); assertEquals(0, int0); } }
1,596
0
Create_ds/couchbasekafka/src/main/java/com/paypal/utils/cb
Create_ds/couchbasekafka/src/main/java/com/paypal/utils/cb/kafka/CBMessageTransformerFactory.java
package com.paypal.utils.cb.kafka; /** * CBMessageTransformerFactory - Singleton class, reads message from properties file. constructs the Object and return * @author ssudhakaran * */ public enum CBMessageTransformerFactory { INSTANCE; private CBMessageConverter converterClassObj =null; /** * return the custom converter for the message. * @return */ public CBMessageConverter createCBMessageConverter(){ try { if(converterClassObj ==null){ converterClassObj=(CBMessageConverter) Class.forName(ConfigLoader.getProp(Constants.CBMESSAGECONVERTER)).newInstance(); } return converterClassObj; }catch (ClassNotFoundException e) { e.printStackTrace(); return null; } catch (InstantiationException e) { e.printStackTrace(); return null; } catch (IllegalAccessException e) { e.printStackTrace(); return null; } } }
1,597
0
Create_ds/couchbasekafka/src/main/java/com/paypal/utils/cb
Create_ds/couchbasekafka/src/main/java/com/paypal/utils/cb/kafka/CBMessageConsumer.java
package com.paypal.utils.cb.kafka; import java.io.IOException; import java.net.URI; import java.util.ArrayList; import java.util.List; import java.util.concurrent.Executors; import java.util.concurrent.ScheduledExecutorService; import java.util.concurrent.ScheduledFuture; import java.util.concurrent.TimeUnit; import javax.naming.ConfigurationException; import org.apache.commons.codec.binary.StringUtils; import org.slf4j.Logger; import org.slf4j.LoggerFactory; import com.couchbase.client.TapClient; import net.spy.memcached.tapmessage.ResponseMessage; import net.spy.memcached.tapmessage.TapStream; /** * CBMessage Consumer knows how to connect to CB and extract data. * It uses TAP client to incrementally fetch new messages from Couchbase. * @author ssudhakaran * */ public class CBMessageConsumer { /** * Logger */ private static final Logger LOGGER = LoggerFactory.getLogger(CBMessageConsumer.class); /** * Couchbase TAP client used to read messages from Couchbase. */ private static TapClient tapClient; /** * Date from which messages should be read from couchbase. */ private static final long STARTDATE=Long.valueOf(ConfigLoader.getProp(Constants.STARTDATE)); /** * Couchbase connect URI */ private transient final List<URI> CBURI; /** * Couchbase bucket info */ private final String bucket; /** * Named stream to fetch data from couchbase. */ private final String streamname; /** * Full dump from Coucbase? */ private boolean fullDump=false; /** * Inititalize with connection parameters * @param uri * @param bucket * @param password */ public CBMessageConsumer(){ this.CBURI = new ArrayList<URI>(); String servername=ConfigLoader.getProp(Constants.CBSERVER); this.CBURI.add(URI.create(servername)); this.bucket=ConfigLoader.getProp(Constants.BUCKET); this.streamname=ConfigLoader.getProp(Constants.STREAMNAME); this.fullDump=Boolean.parseBoolean(ConfigLoader.getProp(Constants.ISFULLDUMP)); //initTapClient(); } /** * Overloaded constructor to pass fulldump variable. * @param host * @param bucket * @param fulldump */ public CBMessageConsumer(String host,String bucket,boolean fulldump){ this.CBURI = new ArrayList<URI>(); String servername=host; this.CBURI.add(URI.create(servername)); this.bucket=bucket; this.streamname=ConfigLoader.getProp(Constants.STREAMNAME); this.fullDump=fulldump; //initTapClient(); } /** * Init TAP Client. */ private void initTapClient(){ if(LOGGER.isInfoEnabled()){ LOGGER.info("INIT "+CBURI.get(0).getHost() +", bucket :"+bucket+", streamname:"+streamname+",STARTDATE:"+STARTDATE); } //Create TAP Client. tapClient=new TapClient(CBURI, bucket, ""); try { if(LOGGER.isInfoEnabled()){ LOGGER.info("initTapClient : start date"+STARTDATE);} //If we need full dump, get everything. if(fullDump){ tapClient.tapDump(streamname); }else{ //Get message starting from date STARTDATE tapClient.tapBackfill(null,-1,0, TimeUnit.MINUTES); //tapClient.tapBackfill(null,STARTDATE,0, TimeUnit.MINUTES); } } catch (ConfigurationException e) { if(LOGGER.isErrorEnabled()){ LOGGER.error(e.getExplanation()+e.getMessage());} tapClient=null; } catch (IOException e) { if(LOGGER.isErrorEnabled()){ LOGGER.error(e.getMessage());} tapClient=null; } } /** * read messages from CB TAP * @return * @throws IOException */ public void run() { LOGGER.info("RUNNING Couchbase Consumer"); //If TAP Client is not running. if(tapClient==null){ try{ initTapClient(); }catch(com.couchbase.client.vbucket.ConfigurationException e){ tapClient=null; if(LOGGER.isErrorEnabled()){ LOGGER.error("Not able to connect to Couchbase. Will retry in "+ConfigLoader.getProp(Constants.INTERVAL_SEC,Constants.INTERVAL_SEC_DEF)+" seconds.");} return; } } //If a valid Kafka producer doesn't exist. Try after 2 minutes if(!CBKafkaProducer.isValidProducer()){ LOGGER.info("No Kafka Connection. Retry after "+ConfigLoader.getProp(Constants.INTERVAL_SEC,Constants.INTERVAL_SEC_DEF)+" seconds."); return; } int iReadCounter=0; try{ //Keep reading from Tap Client while(tapClient.hasMoreMessages()){ //Read message from TAP client final ResponseMessage resmessage=tapClient.getNextMessage(); if(resmessage!=null ) { if(resmessage.getValue()!=null){ iReadCounter++; //Publish message to Kafka. CBKafkaProducer.publishMessage(resmessage.getKey(),StringUtils.newStringUtf8(resmessage.getValue())); if(iReadCounter%3==0){ iReadCounter=0; if(LOGGER.isInfoEnabled()) LOGGER.info("TIME :"+new java.util.Date().getTime()); } } } } }catch(Exception e){ e.printStackTrace(); if(LOGGER.isErrorEnabled()) LOGGER.error("EXCEPTION. TIME :"+new java.util.Date().getTime()); } } public static void main(String[] args) throws IOException{ CBMessageConsumer cbConsumer=new CBMessageConsumer(); cbConsumer.run(); //ScheduledExecutorService fScheduler=Executors.newScheduledThreadPool(Constants.NUM_THREADS); //ScheduledFuture<?> cbConsumerFuture = fScheduler.scheduleWithFixedDelay(cbConsumer, Integer.valueOf(ConfigLoader.getProp(Constants.START_DELAY_SEC,"0")), Integer.valueOf(ConfigLoader.getProp(Constants.INTERVAL_SEC,Constants.INTERVAL_SEC_DEF)), TimeUnit.SECONDS); } }
1,598
0
Create_ds/couchbasekafka/src/main/java/com/paypal/utils/cb
Create_ds/couchbasekafka/src/main/java/com/paypal/utils/cb/kafka/ConfigLoader.java
package com.paypal.utils.cb.kafka; import java.io.File; import java.io.FileInputStream; import java.io.IOException; import java.io.InputStream; import java.util.HashMap; import java.util.Map; import java.util.Properties; public class ConfigLoader { private static Properties configprops=null; private static Properties kafkaconfigprops=null; private static Map<String,String> msgConverterMap=null; private static void init(){ try { configprops=new Properties(); kafkaconfigprops=new Properties(); File jarPath=new File(ConfigLoader.class.getProtectionDomain().getCodeSource().getLocation().getPath()); String propertiesPath=jarPath.getParentFile().getAbsolutePath(); configprops.load(new FileInputStream(new File(propertiesPath+"/"+Constants.RESOURCEFILE))); kafkaconfigprops.load(new FileInputStream(new File(propertiesPath+"/"+Constants.RESOURCEFILE_KAFKA))); if(Boolean.parseBoolean(ConfigLoader.getProp(Constants.ENABLETRANSFORMATION))){ msgConverterMap=new HashMap<String,String>(); String converterAndKeys=configprops.getProperty(Constants.CBMESSAGECONVERTER); if(converterAndKeys!=null){ String[] keys=converterAndKeys.split(","); for(String key:keys){ String[] msgkeys=key.split(":"); msgConverterMap.put(msgkeys[0], msgkeys[1]); } } } } catch (IOException e) { // TODO Auto-generated catch block e.printStackTrace(); } } public static String getProp(String key){ if(configprops==null) init(); return configprops.getProperty(key); } public static String getProp(String key,String defaultVal){ if(configprops==null) init(); String propertyVal= getProp( key); if(propertyVal==null) { propertyVal= defaultVal; } return propertyVal; } public static Properties getConfigProps(){ if(configprops==null) init(); return configprops; } public static Properties getKafkaConfigProps(){ if(kafkaconfigprops==null) init(); return kafkaconfigprops; } public static Map<String, String> getMsgConverterMap() { return msgConverterMap; } }
1,599