type
stringclasses
4 values
content_without_mask
stringlengths
610
1.37M
content_masked
stringlengths
609
1.37M
label
stringclasses
362 values
options
sequencelengths
5
5
correct
stringclasses
5 values
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class C_PROGRAM_FACTORIAL_NUMBER_1{ static int f_gold ( int n ) { int res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; } t java.lang.*; import javafx.util.Pair; public class C_PROGRAM_FACTORIAL_NUMBER_1{ static int f_gold ( int n ) { int res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(15); param0.add(7); param0.add(16); param0.add(67); param0.add(71); param0.add(16); param0.add(77); param0.add(27); param0.add(37); param0.add(73); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class C_PROGRAM_FACTORIAL_NUMBER_1{ static int f_gold ( int n ) { [MASK] res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; }t java.lang.*; import javafx.util.Pair; public class C_PROGRAM_FACTORIAL_NUMBER_1{ static int f_gold ( int n ) { int res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(15); param0.add(7); param0.add(16); param0.add(67); param0.add(71); param0.add(16); param0.add(77); param0.add(27); param0.add(37); param0.add(73); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
int
[ "a) int", "b) >", "c) CHECK_VALID_SEQUENCE_DIVISIBLE_M_1{", "d) (", "e) ;" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_COST_CUT_BOARD_SQUARES{ static int f_gold ( Integer X [ ] , Integer Y [ ] , int m , int n ) { int res = 0 ; Arrays . sort ( X , Collections . reverseOrder ( ) ) ; Arrays . sort ( Y , Collections . reverseOrder ( ) ) ; int hzntl = 1 , vert = 1 ; int i = 0 , j = 0 ; while ( i < m && j < n ) { if ( X [ i ] > Y [ j ] ) { res += X [ i ] * vert ; hzntl ++ ; i ++ ; } else { res += Y [ j ] * hzntl ; vert ++ ; j ++ ; } } int total = 0 ; while ( i < m ) total += X [ i ++ ] ; res += total * vert ; total = 0 ; while ( j < n ) total += Y [ j ++ ] ; res += total * hzntl ; return res ; } j ++ ; } } int total = 0 ; while ( i < m ) total += X [ i ++ ] ; res += total * vert ; total = 0 ; while ( j < n ) total += Y [ j ++ ] ; res += total * hzntl ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer [ ]> param0 = new ArrayList<>(); param0.add(new Integer[]{1,9,9,16,18,20,22,22,23,25,25,26,28,32,33,33,33,34,37,40,44,46,46,52,53,56,58,58,59,60,61,67,67,69,70,70,73,75,77,83,87,87,87,90,90,93,97,98}); param0.add(new Integer[]{-52,66,66,-4,-74,78,52,-72}); param0.add(new Integer[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new Integer[]{58,78,48,44,63,37,89,76,66,83,52,97,19,28,67,38,54,77,2,96,28,87}); param0.add(new Integer[]{-84,-78,-76,-72,-68,-62,-62,-60,-58,-44,-34,-10,-8,-4,-2,-2,14,16,20,26,26,32,70,78,86,90,96}); param0.add(new Integer[]{0,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,1,1,1,0,0,0,1,1,0}); param0.add(new Integer[]{30,75}); param0.add(new Integer[]{70,78,-60,-10,-8,46,38,60,-54,-68,16,10,36,-10,38,-96,-52,-82,-56,22,-56,0,96,-60,24,70,40,62,-20,-36,74,32,44,14,-18,50,58}); param0.add(new Integer[]{0,0,0,1}); param0.add(new Integer[]{81,40,29,74,13,67,10,25,24,81,90}); List<Integer [ ]> param1 = new ArrayList<>(); param1.add(new Integer[]{2,3,9,10,13,16,17,19,20,23,25,27,29,30,30,35,37,39,39,45,47,50,55,55,55,56,59,60,62,63,67,70,70,71,72,73,73,74,77,86,87,88,91,92,95,96,97,99}); param1.add(new Integer[]{-40,30,-34,-76,84,88,-78,72}); param1.add(new Integer[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param1.add(new Integer[]{37,36,26,5,83,75,33,33,72,63,91,94,75,92,9,19,79,29,40,47,63,36}); param1.add(new Integer[]{-98,-98,-86,-82,-76,-62,-60,-48,-32,-32,-24,-18,-10,-4,0,16,16,26,36,42,48,50,64,66,78,92,98}); param1.add(new Integer[]{1,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,1,1,1,0,0,1,0}); param1.add(new Integer[]{10,39}); param1.add(new Integer[]{64,-42,-50,-76,46,32,-66,86,-6,46,94,70,-62,90,78,4,6,-20,92,-18,-34,-96,92,-24,-90,-94,62,40,-14,-28,80,-86,-86,-56,40,-92,-22}); param1.add(new Integer[]{0,1,1,1}); param1.add(new Integer[]{51,45,23,7,53,14,49,58,25,75,74}); List<Integer> param2 = new ArrayList<>(); param2.add(25); param2.add(6); param2.add(15); param2.add(13); param2.add(15); param2.add(25); param2.add(1); param2.add(19); param2.add(2); param2.add(8); List<Integer> param3 = new ArrayList<>(); param3.add(27); param3.add(7); param3.add(19); param3.add(14); param3.add(24); param3.add(26); param3.add(1); param3.add(19); param3.add(2); param3.add(10); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_COST_CUT_BOARD_SQUARES{ static int f_gold ( Integer X [ ] , Integer Y [ ] , int m , int n ) { int res = 0 ; Arrays . sort ( X , Collections . reverseOrder ( ) ) ; Arrays . sort ( Y , Collections . reverseOrder ( ) ) ; int hzntl = 1 , vert = 1 ; int i = 0 , j = 0 ; while ( i < m && j < n ) { if ( X [ i ] > Y [ j ] ) { res += X [ i ] * vert ; hzntl ++ ; i ++ ; } else { res += Y [ j ] * hzntl ; vert ++ ; j ++ ; } } int total = 0 ; while [MASK] i < m ) total += X [ i ++ ] ; res += total * vert ; total = 0 ; while ( j < n ) total += Y [ j ++ ] ; res += total * hzntl ; return res ; } j ++ ; } } int total = 0 ; while ( i < m ) total += X [ i ++ ] ; res += total * vert ; total = 0 ; while ( j < n ) total += Y [ j ++ ] ; res += total * hzntl ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer [ ]> param0 = new ArrayList<>(); param0.add(new Integer[]{1,9,9,16,18,20,22,22,23,25,25,26,28,32,33,33,33,34,37,40,44,46,46,52,53,56,58,58,59,60,61,67,67,69,70,70,73,75,77,83,87,87,87,90,90,93,97,98}); param0.add(new Integer[]{-52,66,66,-4,-74,78,52,-72}); param0.add(new Integer[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new Integer[]{58,78,48,44,63,37,89,76,66,83,52,97,19,28,67,38,54,77,2,96,28,87}); param0.add(new Integer[]{-84,-78,-76,-72,-68,-62,-62,-60,-58,-44,-34,-10,-8,-4,-2,-2,14,16,20,26,26,32,70,78,86,90,96}); param0.add(new Integer[]{0,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,1,1,1,0,0,0,1,1,0}); param0.add(new Integer[]{30,75}); param0.add(new Integer[]{70,78,-60,-10,-8,46,38,60,-54,-68,16,10,36,-10,38,-96,-52,-82,-56,22,-56,0,96,-60,24,70,40,62,-20,-36,74,32,44,14,-18,50,58}); param0.add(new Integer[]{0,0,0,1}); param0.add(new Integer[]{81,40,29,74,13,67,10,25,24,81,90}); List<Integer [ ]> param1 = new ArrayList<>(); param1.add(new Integer[]{2,3,9,10,13,16,17,19,20,23,25,27,29,30,30,35,37,39,39,45,47,50,55,55,55,56,59,60,62,63,67,70,70,71,72,73,73,74,77,86,87,88,91,92,95,96,97,99}); param1.add(new Integer[]{-40,30,-34,-76,84,88,-78,72}); param1.add(new Integer[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param1.add(new Integer[]{37,36,26,5,83,75,33,33,72,63,91,94,75,92,9,19,79,29,40,47,63,36}); param1.add(new Integer[]{-98,-98,-86,-82,-76,-62,-60,-48,-32,-32,-24,-18,-10,-4,0,16,16,26,36,42,48,50,64,66,78,92,98}); param1.add(new Integer[]{1,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,1,1,1,0,0,1,0}); param1.add(new Integer[]{10,39}); param1.add(new Integer[]{64,-42,-50,-76,46,32,-66,86,-6,46,94,70,-62,90,78,4,6,-20,92,-18,-34,-96,92,-24,-90,-94,62,40,-14,-28,80,-86,-86,-56,40,-92,-22}); param1.add(new Integer[]{0,1,1,1}); param1.add(new Integer[]{51,45,23,7,53,14,49,58,25,75,74}); List<Integer> param2 = new ArrayList<>(); param2.add(25); param2.add(6); param2.add(15); param2.add(13); param2.add(15); param2.add(25); param2.add(1); param2.add(19); param2.add(2); param2.add(8); List<Integer> param3 = new ArrayList<>(); param3.add(27); param3.add(7); param3.add(19); param3.add(14); param3.add(24); param3.add(26); param3.add(1); param3.add(19); param3.add(2); param3.add(10); 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()); } }
(
[ "a) (", "b) ,", "c) if", "d) return", "e) s1" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CEILING_IN_A_SORTED_ARRAY_1{ static int f_gold ( int arr [ ] , int low , int high , int x ) { int mid ; if ( x <= arr [ low ] ) return low ; if ( x > arr [ high ] ) return - 1 ; mid = ( low + high ) / 2 ; if ( arr [ mid ] == x ) return mid ; else if ( arr [ mid ] < x ) { if ( mid + 1 <= high && x <= arr [ mid + 1 ] ) return mid + 1 ; else return f_gold ( arr , mid + 1 , high , x ) ; } else { if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid ; else return f_gold ( arr , low , mid - 1 , x ) ; } } id + 1 ; else return f_gold ( arr , mid + 1 , high , x ) ; } else { if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid ; else return f_gold ( arr , low , mid - 1 , x ) ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,6,13,16,23,24,24,27,30,32,34,34,55,56,56,63,66,81,83,96}); param0.add(new int[]{-28,-96,48,22,-12,72,48,-70,-96,-84,-62,22,18,-92,-74,14,28,52,64,72,16,-76,46}); param0.add(new int[]{0,1}); param0.add(new int[]{51,98,25,10,43,91,33,25,85,51,94,6,35,48,11,97,67,21,50,9,11,51,86,61,22,88,89,11}); param0.add(new int[]{-94,-92,-88,-74,-52,-50,-48,-44,-40,-36,-32,-26,20,22,30,32,46,56,56,60,62,64,80,84,86,94,96,96}); param0.add(new int[]{1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0}); param0.add(new int[]{4,5,5,13,26,40,46,51,58,60,64,66,68,69,71,74,78,81,83,88,88,90,98,99}); param0.add(new int[]{92,6,-54,84,-10,32,50,40,-38,64,-64,-10,70,-68,-6,-16,68,34,-66,-82,84,98,50,82,78,4,34,-34,78,64,32,58,-94,40,50,0,-92,-36,10,-54,58,-78,-88,32,6}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{80,67,30,35,9}); List<Integer> param1 = new ArrayList<>(); param1.add(13); param1.add(11); param1.add(1); param1.add(20); param1.add(20); param1.add(15); param1.add(12); param1.add(23); param1.add(24); param1.add(2); List<Integer> param2 = new ArrayList<>(); param2.add(11); param2.add(18); param2.add(1); param2.add(20); param2.add(15); param2.add(17); param2.add(17); param2.add(28); param2.add(17); param2.add(3); List<Integer> param3 = new ArrayList<>(); param3.add(18); param3.add(21); param3.add(1); param3.add(15); param3.add(15); param3.add(22); param3.add(14); param3.add(28); param3.add(22); param3.add(2); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CEILING_IN_A_SORTED_ARRAY_1{ static int f_gold ( int arr [ ] , int low , int high , int x ) { int mid ; if ( x <= arr [ low ] ) return low ; if ( x > arr [ high ] ) return - 1 ; mid = ( low + high ) / 2 ; if ( arr [ mid ] == x ) return mid ; else if ( arr [ mid ] < x ) { if ( mid + 1 <= high && x <= arr [ mid + 1 ] ) [MASK] mid + 1 ; else return f_gold ( arr , mid + 1 , high , x ) ; } else { if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid ; else return f_gold ( arr , low , mid - 1 , x ) ; } }id + 1 ; else return f_gold ( arr , mid + 1 , high , x ) ; } else { if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid ; else return f_gold ( arr , low , mid - 1 , x ) ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,6,13,16,23,24,24,27,30,32,34,34,55,56,56,63,66,81,83,96}); param0.add(new int[]{-28,-96,48,22,-12,72,48,-70,-96,-84,-62,22,18,-92,-74,14,28,52,64,72,16,-76,46}); param0.add(new int[]{0,1}); param0.add(new int[]{51,98,25,10,43,91,33,25,85,51,94,6,35,48,11,97,67,21,50,9,11,51,86,61,22,88,89,11}); param0.add(new int[]{-94,-92,-88,-74,-52,-50,-48,-44,-40,-36,-32,-26,20,22,30,32,46,56,56,60,62,64,80,84,86,94,96,96}); param0.add(new int[]{1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0}); param0.add(new int[]{4,5,5,13,26,40,46,51,58,60,64,66,68,69,71,74,78,81,83,88,88,90,98,99}); param0.add(new int[]{92,6,-54,84,-10,32,50,40,-38,64,-64,-10,70,-68,-6,-16,68,34,-66,-82,84,98,50,82,78,4,34,-34,78,64,32,58,-94,40,50,0,-92,-36,10,-54,58,-78,-88,32,6}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{80,67,30,35,9}); List<Integer> param1 = new ArrayList<>(); param1.add(13); param1.add(11); param1.add(1); param1.add(20); param1.add(20); param1.add(15); param1.add(12); param1.add(23); param1.add(24); param1.add(2); List<Integer> param2 = new ArrayList<>(); param2.add(11); param2.add(18); param2.add(1); param2.add(20); param2.add(15); param2.add(17); param2.add(17); param2.add(28); param2.add(17); param2.add(3); List<Integer> param3 = new ArrayList<>(); param3.add(18); param3.add(21); param3.add(1); param3.add(15); param3.add(15); param3.add(22); param3.add(14); param3.add(28); param3.add(22); param3.add(2); 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()); } }
return
[ "a) {", "b) 0", "c) x,", "d) return", "e) *(int*)b" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_SUBARRAY_WITH_GIVEN_SUM_1{ static int f_gold ( int arr [ ] , int n , int sum ) { int curr_sum = arr [ 0 ] , start = 0 , i ; for ( i = 1 ; i <= n ; i ++ ) { while ( curr_sum > sum && start < i - 1 ) { curr_sum = curr_sum - arr [ start ] ; start ++ ; } if ( curr_sum == sum ) { int p = i - 1 ; System . out . println ( "Sum found between indexes " + start + " and " + p ) ; return 1 ; } if ( i < n ) curr_sum = curr_sum + arr [ i ] ; } System . out . println ( "No subarray found" ) ; return 0 ; } um found between indexes " + start + " and " + p ) ; return 1 ; } if ( i < n ) curr_sum = curr_sum + arr [ i ] ; } System . out . println ( "No subarray found" ) ; return 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,7,8,8,23,24,28,32,48,53,56,62,69,77,81,82,84,87,88,90}); param0.add(new int[]{-62,-62,-80,-30,-80,44,-12,-76,16,-52,-86,72,32,-60,-70,-62,-78,-96,-18,40,-4,-18,-58,30,-70,6,0,-62,-66,20,92,-64,20,-48,48,-32,64,22,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}); param0.add(new int[]{50,25,6,87,55,86,61,97,24,30,51,43,26,1,80,47,19,36,64,62,92,5,48,27,82,76,70,59,1,43,1,36,28,9,52,22,43}); param0.add(new int[]{-86,-76,-64,-22,-16,-8,4,6,8,32,38,60,68,74}); param0.add(new int[]{0,0,0,0,1,1,0,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0}); param0.add(new int[]{7,7,12,25,25,32,33,34,37,39,39,41,46,48,56,56,57,58,61,62,62,63,65,66,69,72,74,78,78,79,80,85,89,94,95,99}); param0.add(new int[]{98,-60}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{80,89,83,42,75,30,64,25,95,17,90,6,11,1,77,16,75,86,96,67,27,80,27}); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(39); param1.add(40); param1.add(29); param1.add(7); param1.add(31); param1.add(22); param1.add(1); param1.add(8); param1.add(16); List<Integer> param2 = new ArrayList<>(); param2.add(31); param2.add(44); param2.add(7); param2.add(105); param2.add(2); param2.add(10); param2.add(39); param2.add(98); param2.add(0); param2.add(108); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_SUBARRAY_WITH_GIVEN_SUM_1{ static int f_gold ( int arr [ ] , int n , int sum ) { int curr_sum = arr [ 0 ] , start = 0 , i ; for ( i = 1 ; i <= n ; i ++ ) { while ( curr_sum > sum && start < i - 1 ) { curr_sum = curr_sum - arr [ start ] ; start ++ ; } if ( curr_sum == sum ) { int p = i - 1 ; System . out . println ( "Sum found between indexes " + start + " and " + p ) ; return 1 ; } if ( i < n ) curr_sum = curr_sum + arr [ i ] ; } System . out . println ( "No subarray found" [MASK] ; return 0 ; }um found between indexes " + start + " and " + p ) ; return 1 ; } if ( i < n ) curr_sum = curr_sum + arr [ i ] ; } System . out . println ( "No subarray found" ) ; return 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,7,8,8,23,24,28,32,48,53,56,62,69,77,81,82,84,87,88,90}); param0.add(new int[]{-62,-62,-80,-30,-80,44,-12,-76,16,-52,-86,72,32,-60,-70,-62,-78,-96,-18,40,-4,-18,-58,30,-70,6,0,-62,-66,20,92,-64,20,-48,48,-32,64,22,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}); param0.add(new int[]{50,25,6,87,55,86,61,97,24,30,51,43,26,1,80,47,19,36,64,62,92,5,48,27,82,76,70,59,1,43,1,36,28,9,52,22,43}); param0.add(new int[]{-86,-76,-64,-22,-16,-8,4,6,8,32,38,60,68,74}); param0.add(new int[]{0,0,0,0,1,1,0,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0}); param0.add(new int[]{7,7,12,25,25,32,33,34,37,39,39,41,46,48,56,56,57,58,61,62,62,63,65,66,69,72,74,78,78,79,80,85,89,94,95,99}); param0.add(new int[]{98,-60}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{80,89,83,42,75,30,64,25,95,17,90,6,11,1,77,16,75,86,96,67,27,80,27}); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(39); param1.add(40); param1.add(29); param1.add(7); param1.add(31); param1.add(22); param1.add(1); param1.add(8); param1.add(16); List<Integer> param2 = new ArrayList<>(); param2.add(31); param2.add(44); param2.add(7); param2.add(105); param2.add(2); param2.add(10); param2.add(39); param2.add(98); param2.add(0); param2.add(108); 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()); } }
)
[ "a) {", "b) )", "c) std;", "d) in", "e) sum" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_DIGITS_FACTORIAL_SET_1{ static int f_gold ( int n ) { if ( n < 0 ) return 0 ; if ( n <= 1 ) return 1 ; double digits = 0 ; for ( int i = 2 ; i <= n ; i ++ ) digits += Math . log10 ( i ) ; return ( int ) ( Math . floor ( digits ) ) + 1 ; } if ( n < 0 ) return 0 ; if ( n <= 1 ) return 1 ; double digits = 0 ; for ( int i = 2 ; i <= n ; i ++ ) digits += Math . log10 ( i ) ; return ( int ) ( Math . floor ( digits ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(66); param0.add(7); param0.add(55); param0.add(37); param0.add(76); param0.add(16); param0.add(17); param0.add(95); param0.add(71); param0.add(90); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_DIGITS_FACTORIAL_SET_1{ static int f_gold ( int n ) { if ( n < 0 ) return 0 ; if ( n <= 1 ) return 1 ; double digits = 0 ; for ( int i = 2 ; i [MASK] n ; i ++ ) digits += Math . log10 ( i ) ; return ( int ) ( Math . floor ( digits ) ) + 1 ; }if ( n < 0 ) return 0 ; if ( n <= 1 ) return 1 ; double digits = 0 ; for ( int i = 2 ; i <= n ; i ++ ) digits += Math . log10 ( i ) ; return ( int ) ( Math . floor ( digits ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(66); param0.add(7); param0.add(55); param0.add(37); param0.add(76); param0.add(16); param0.add(17); param0.add(95); param0.add(71); param0.add(90); 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()); } }
<=
[ "a) <=", "b) s", "c) base1", "d) best", "e) )" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING{ static int f_gold ( int arr [ ] , int low , int high ) { int max = arr [ low ] ; int i ; for ( i = low ; i <= high ; i ++ ) { if ( arr [ i ] > max ) max = arr [ i ] ; } return max ; } c int f_gold ( int arr [ ] , int low , int high ) { int max = arr [ low ] ; int i ; for ( i = low ; i <= high ; i ++ ) { if ( arr [ i ] > max ) max = arr [ i ] ; } return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{11,15,16,19,24,25,26,28,34,34,43,61,63,66,67,72,77,79,81,83,87,94,99}); param0.add(new int[]{8,92}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{84,39,92,89,38,75,18,39,83,67,41,46,49,27}); param0.add(new int[]{-98,-94,-88,-84,-74,-72,-58,-52,-48,-48,-46,-42,-42,-32,-30,-30,-18,-10,-8,-8,-6,-4,4,6,28,30,34,38,44,48,56,58,60,64,86}); param0.add(new int[]{0,1,0}); param0.add(new int[]{5,9,10,16,18,19,23,24,26,33,37,44,46,54,55,57,58,59,63,64,70,75,77,81,83,84,85,85,88,89,96,97,99}); param0.add(new int[]{86,20,-50,74,-78,86}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{16,57,65,61,17,63,7,35,69,91,30,44,99,80,6,80,56,8,84,95,20,73,30,62,77,26,66,61,61,45}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(1); param1.add(23); param1.add(8); param1.add(31); param1.add(2); param1.add(20); param1.add(3); param1.add(19); param1.add(28); List<Integer> param2 = new ArrayList<>(); param2.add(21); param2.add(1); param2.add(15); param2.add(13); param2.add(34); param2.add(2); param2.add(31); param2.add(5); param2.add(18); param2.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING{ static int f_gold ( int arr [ ] , int low , int high ) { int max = arr [ low ] ; int i ; for ( i = low ; i <= high ; i ++ ) { [MASK] ( arr [ i ] > max ) max = arr [ i ] ; } return max ; }c int f_gold ( int arr [ ] , int low , int high ) { int max = arr [ low ] ; int i ; for ( i = low ; i <= high ; i ++ ) { if ( arr [ i ] > max ) max = arr [ i ] ; } return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{11,15,16,19,24,25,26,28,34,34,43,61,63,66,67,72,77,79,81,83,87,94,99}); param0.add(new int[]{8,92}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{84,39,92,89,38,75,18,39,83,67,41,46,49,27}); param0.add(new int[]{-98,-94,-88,-84,-74,-72,-58,-52,-48,-48,-46,-42,-42,-32,-30,-30,-18,-10,-8,-8,-6,-4,4,6,28,30,34,38,44,48,56,58,60,64,86}); param0.add(new int[]{0,1,0}); param0.add(new int[]{5,9,10,16,18,19,23,24,26,33,37,44,46,54,55,57,58,59,63,64,70,75,77,81,83,84,85,85,88,89,96,97,99}); param0.add(new int[]{86,20,-50,74,-78,86}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{16,57,65,61,17,63,7,35,69,91,30,44,99,80,6,80,56,8,84,95,20,73,30,62,77,26,66,61,61,45}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(1); param1.add(23); param1.add(8); param1.add(31); param1.add(2); param1.add(20); param1.add(3); param1.add(19); param1.add(28); List<Integer> param2 = new ArrayList<>(); param2.add(21); param2.add(1); param2.add(15); param2.add(13); param2.add(34); param2.add(2); param2.add(31); param2.add(5); param2.add(18); param2.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
if
[ "a) 0", "b) )", "c) (", "d) if", "e) *" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION{ static String f_gold ( String str ) { int n = str . length ( ) ; String arr [ ] = new String [ n ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; } = new String [ n ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("onWEchl"); param0.add("2"); param0.add("100"); param0.add("GHbCZA"); param0.add("50568798206105"); param0.add("001011110001"); param0.add("lljpYhznnyu"); param0.add("54499921759984"); param0.add("11101"); param0.add("qvypgCYEjsyjwZ"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)).equals(f_gold(param0.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION{ static String f_gold ( String str ) { int n = str . length ( ) ; String arr [ ] = new String [ [MASK] ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; } = new String [ n ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("onWEchl"); param0.add("2"); param0.add("100"); param0.add("GHbCZA"); param0.add("50568798206105"); param0.add("001011110001"); param0.add("lljpYhznnyu"); param0.add("54499921759984"); param0.add("11101"); param0.add("qvypgCYEjsyjwZ"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)).equals(f_gold(param0.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
n
[ "a) unlock_code", "b) 4", "c) n", "d) import", "e) arr" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED{ static boolean f_gold ( int arr [ ] , int n ) { int temp [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { temp [ i ] = arr [ i ] ; } Arrays . sort ( temp ) ; int front ; for ( front = 0 ; front < n ; front ++ ) { if ( temp [ front ] != arr [ front ] ) { break ; } } int back ; for ( back = n - 1 ; back >= 0 ; back -- ) { if ( temp [ back ] != arr [ back ] ) { break ; } } if ( front >= back ) { return true ; } do { front ++ ; if ( arr [ front - 1 ] < arr [ front ] ) { return false ; } } while ( front != back ) ; return true ; } } if ( front >= back ) { return true ; } do { front ++ ; if ( arr [ front - 1 ] < arr [ front ] ) { return false ; } } while ( front != back ) ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,9,9,16,17,22,32,40,45,53,57,58,66,69,76,80,91,93,94}); param0.add(new int[]{52,-76,-18,86,56}); param0.add(new int[]{0,0,1}); param0.add(new int[]{66,44,98,44}); param0.add(new int[]{-96,-62,-56,-46,-44,-38,-38,-26,-22,-22,-16,-12,-6,12,22,34,36,44,44,68,70,74,94}); param0.add(new int[]{1,1,0,0,1,1,1,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0,1,1}); param0.add(new int[]{5,9,11,12,13,16,19,23,23,23,25,27,27,28,31,36,40,44,48,59,60,63,66,66,67,67,69,69,70,71,73,76,76,79,86,86,92,92,93,93}); param0.add(new int[]{6,82,-88,-46,-60,70,-54,-96,-94,46,-52,48,-26,-50,-92,-92,6,-6,42,0,-66,-96,66,6,-68,-30,-54,76,60,30,72,-66,-12,-74}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{62,54,36,35,36,91,45,87,74,49,15,15,73,77,63,70,74,65,11,18}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(3); param1.add(1); param1.add(2); param1.add(14); param1.add(27); param1.add(34); param1.add(28); param1.add(13); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED{ static boolean f_gold ( int arr [ ] , int n ) { int temp [ ] [MASK] new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { temp [ i ] = arr [ i ] ; } Arrays . sort ( temp ) ; int front ; for ( front = 0 ; front < n ; front ++ ) { if ( temp [ front ] != arr [ front ] ) { break ; } } int back ; for ( back = n - 1 ; back >= 0 ; back -- ) { if ( temp [ back ] != arr [ back ] ) { break ; } } if ( front >= back ) { return true ; } do { front ++ ; if ( arr [ front - 1 ] < arr [ front ] ) { return false ; } } while ( front != back ) ; return true ; } } if ( front >= back ) { return true ; } do { front ++ ; if ( arr [ front - 1 ] < arr [ front ] ) { return false ; } } while ( front != back ) ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,9,9,16,17,22,32,40,45,53,57,58,66,69,76,80,91,93,94}); param0.add(new int[]{52,-76,-18,86,56}); param0.add(new int[]{0,0,1}); param0.add(new int[]{66,44,98,44}); param0.add(new int[]{-96,-62,-56,-46,-44,-38,-38,-26,-22,-22,-16,-12,-6,12,22,34,36,44,44,68,70,74,94}); param0.add(new int[]{1,1,0,0,1,1,1,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0,1,1}); param0.add(new int[]{5,9,11,12,13,16,19,23,23,23,25,27,27,28,31,36,40,44,48,59,60,63,66,66,67,67,69,69,70,71,73,76,76,79,86,86,92,92,93,93}); param0.add(new int[]{6,82,-88,-46,-60,70,-54,-96,-94,46,-52,48,-26,-50,-92,-92,6,-6,42,0,-66,-96,66,6,-68,-30,-54,76,60,30,72,-66,-12,-74}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{62,54,36,35,36,91,45,87,74,49,15,15,73,77,63,70,74,65,11,18}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(3); param1.add(1); param1.add(2); param1.add(14); param1.add(27); param1.add(34); param1.add(28); param1.add(13); 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()); } }
=
[ "a) -", "b) int", "c) int", "d) #include", "e) =" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class TAIL_RECURSION_FIBONACCI{ static int f_gold ( int n , int a , int b ) { if ( n == 0 ) return a ; if ( n == 1 ) return b ; return f_gold ( n - 1 , b , a + b ) ; } vafx.util.Pair; public class TAIL_RECURSION_FIBONACCI{ static int f_gold ( int n , int a , int b ) { if ( n == 0 ) return a ; if ( n == 1 ) return b ; return f_gold ( n - 1 , b , a + b ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(4); param0.add(60); param0.add(92); param0.add(73); param0.add(58); param0.add(82); param0.add(53); param0.add(57); param0.add(47); param0.add(83); List<Integer> param1 = new ArrayList<>(); param1.add(43); param1.add(48); param1.add(21); param1.add(79); param1.add(38); param1.add(26); param1.add(10); param1.add(37); param1.add(91); param1.add(3); List<Integer> param2 = new ArrayList<>(); param2.add(24); param2.add(98); param2.add(69); param2.add(38); param2.add(30); param2.add(12); param2.add(17); param2.add(26); param2.add(99); param2.add(64); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class TAIL_RECURSION_FIBONACCI{ static int f_gold ( int n , int a , int b ) [MASK] if ( n == 0 ) return a ; if ( n == 1 ) return b ; return f_gold ( n - 1 , b , a + b ) ; }vafx.util.Pair; public class TAIL_RECURSION_FIBONACCI{ static int f_gold ( int n , int a , int b ) { if ( n == 0 ) return a ; if ( n == 1 ) return b ; return f_gold ( n - 1 , b , a + b ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(4); param0.add(60); param0.add(92); param0.add(73); param0.add(58); param0.add(82); param0.add(53); param0.add(57); param0.add(47); param0.add(83); List<Integer> param1 = new ArrayList<>(); param1.add(43); param1.add(48); param1.add(21); param1.add(79); param1.add(38); param1.add(26); param1.add(10); param1.add(37); param1.add(91); param1.add(3); List<Integer> param2 = new ArrayList<>(); param2.add(24); param2.add(98); param2.add(69); param2.add(38); param2.add(30); param2.add(12); param2.add(17); param2.add(26); param2.add(99); param2.add(64); 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()); } }
{
[ "a) x:", "b) !=", "c) public", "d) =", "e) {" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class TRIANGULAR_MATCHSTICK_NUMBER{ public static int f_gold ( int x ) { return ( 3 * x * ( x + 1 ) ) / 2 ; } l. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class TRIANGULAR_MATCHSTICK_NUMBER{ public static int f_gold ( int x ) { return ( 3 * x * ( x + 1 ) ) / 2 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(6); param0.add(25); param0.add(15); param0.add(30); param0.add(17); param0.add(80); param0.add(27); param0.add(13); param0.add(12); param0.add(67); 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()); } }
import [MASK] *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class TRIANGULAR_MATCHSTICK_NUMBER{ public static int f_gold ( int x ) { return ( 3 * x * ( x + 1 ) ) / 2 ; }l. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class TRIANGULAR_MATCHSTICK_NUMBER{ public static int f_gold ( int x ) { return ( 3 * x * ( x + 1 ) ) / 2 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(6); param0.add(25); param0.add(15); param0.add(30); param0.add(17); param0.add(80); param0.add(27); param0.add(13); param0.add(12); param0.add(67); 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()); } }
java.util.
[ "a) (", "b) r", "c) 2", "d) java.util.", "e) (x" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1{ public static int f_gold ( int arr [ ] , int n ) { int mls [ ] = new int [ n ] , max = 0 ; for ( int i = 0 ; i < n ; i ++ ) mls [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( Math . abs ( arr [ i ] - arr [ j ] ) <= 1 && mls [ i ] < mls [ j ] + 1 ) mls [ i ] = mls [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( max < mls [ i ] ) max = mls [ i ] ; return max ; } ath . abs ( arr [ i ] - arr [ j ] ) <= 1 && mls [ i ] < mls [ j ] + 1 ) mls [ i ] = mls [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( max < mls [ i ] ) max = mls [ i ] ; return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,5,9,31,31,37,41,55,56,61,79,81,89,93}); param0.add(new int[]{-76,96,-68,-16,22,-24,-24,6,98,-82,54,-80,46,0,0,-50}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{97,93,43,51,15,33,13,96,39,89,78,25,45,6,64,54}); param0.add(new int[]{-98,-78,-72,-70,-68,-58,-56,-54,-46,-44,-38,-34,-30,-24,-18,-16,-14,-12,2,6,8,8,10,10,16,24,26,28,40,42,44,56,58,62,66,66,78,86}); param0.add(new int[]{1,1,0,1,0,0}); param0.add(new int[]{7,8,10,11,12,15,16,16,19,21,23,23,23,25,26,35,38,43,46,47,51,52,53,57,60,61,66,67,69,74,75,81,83,84,88,92,94,98,98,99}); param0.add(new int[]{14,-40}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{59,70,53}); List<Integer> param1 = new ArrayList<>(); param1.add(12); param1.add(15); param1.add(29); param1.add(13); param1.add(19); param1.add(3); param1.add(34); param1.add(1); param1.add(38); param1.add(1); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1{ public static int f_gold ( int arr [ ] , int n ) { int mls [ ] = new int [ n ] , max = 0 ; for ( int i = 0 ; i < n ; i ++ ) mls [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) for ( int j = 0 ; [MASK] < i ; j ++ ) if ( Math . abs ( arr [ i ] - arr [ j ] ) <= 1 && mls [ i ] < mls [ j ] + 1 ) mls [ i ] = mls [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( max < mls [ i ] ) max = mls [ i ] ; return max ; }ath . abs ( arr [ i ] - arr [ j ] ) <= 1 && mls [ i ] < mls [ j ] + 1 ) mls [ i ] = mls [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( max < mls [ i ] ) max = mls [ i ] ; return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,5,9,31,31,37,41,55,56,61,79,81,89,93}); param0.add(new int[]{-76,96,-68,-16,22,-24,-24,6,98,-82,54,-80,46,0,0,-50}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{97,93,43,51,15,33,13,96,39,89,78,25,45,6,64,54}); param0.add(new int[]{-98,-78,-72,-70,-68,-58,-56,-54,-46,-44,-38,-34,-30,-24,-18,-16,-14,-12,2,6,8,8,10,10,16,24,26,28,40,42,44,56,58,62,66,66,78,86}); param0.add(new int[]{1,1,0,1,0,0}); param0.add(new int[]{7,8,10,11,12,15,16,16,19,21,23,23,23,25,26,35,38,43,46,47,51,52,53,57,60,61,66,67,69,74,75,81,83,84,88,92,94,98,98,99}); param0.add(new int[]{14,-40}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{59,70,53}); List<Integer> param1 = new ArrayList<>(); param1.add(12); param1.add(15); param1.add(29); param1.add(13); param1.add(19); param1.add(3); param1.add(34); param1.add(1); param1.add(38); param1.add(1); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
j
[ "a) +", "b) namespace", "c) class", "d) j", "e) max(int" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_INSERTIONS_SORT_ARRAY{ static int f_gold ( int arr [ ] , int N ) { int [ ] lis = new int [ N ] ; for ( int i = 0 ; i < N ; i ++ ) lis [ i ] = 1 ; for ( int i = 1 ; i < N ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1 ; int max = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( max < lis [ i ] ) max = lis [ i ] ; return ( N - max ) ; } i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1 ; int max = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( max < lis [ i ] ) max = lis [ i ] ; return ( N - max ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,7,20,22,23,31,33,36,47,61,63,63,71,74,82,91,95,99}); param0.add(new int[]{-84,12,-42,-78,22,72,56,70,28,-72}); 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[]{29,41,4,62,77,74,30,2,14,90,93,10,78,36,66,22,48,89,36,73,70,23,90}); param0.add(new int[]{-80,-72,-68,-66,-58,-50,-48,-32,-28,-24,-22,-18,0,2,6,10,12,14,14,18,24,24,24,28,28,28,34,38,42,42,46,46,46,58,80,82,82,84,84,86,88,90,92,96}); param0.add(new int[]{1,1,0,1,0,1,0,0,1,0}); param0.add(new int[]{26,36,58,64,69,72,79,82,82,87,89,90,95}); param0.add(new int[]{-52,-40,98,40,42,-50,60,-64,-92,36,-88,72,-72,38,-80,-52,68,70,16,22,-30,-74,56,-80,62,-54,-32,-22,-86,-70,88,-76,-46,28,40,-2,-84,68,-98,-16,90,36,-38,-86,20,-40,82,98,54}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{36,62,58,24,99,12,46,3,4,40,54,97,48,94,98,7,17,5,3,36,3}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(7); param1.add(16); param1.add(13); param1.add(36); param1.add(8); param1.add(8); param1.add(41); param1.add(10); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_INSERTIONS_SORT_ARRAY{ static int f_gold ( int arr [ ] , int N ) { int [ ] lis = new int [ N ] ; for ( int i = 0 ; [MASK] < N ; i ++ ) lis [ i ] = 1 ; for ( int i = 1 ; i < N ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1 ; int max = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( max < lis [ i ] ) max = lis [ i ] ; return ( N - max ) ; }i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1 ; int max = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( max < lis [ i ] ) max = lis [ i ] ; return ( N - max ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,7,20,22,23,31,33,36,47,61,63,63,71,74,82,91,95,99}); param0.add(new int[]{-84,12,-42,-78,22,72,56,70,28,-72}); 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[]{29,41,4,62,77,74,30,2,14,90,93,10,78,36,66,22,48,89,36,73,70,23,90}); param0.add(new int[]{-80,-72,-68,-66,-58,-50,-48,-32,-28,-24,-22,-18,0,2,6,10,12,14,14,18,24,24,24,28,28,28,34,38,42,42,46,46,46,58,80,82,82,84,84,86,88,90,92,96}); param0.add(new int[]{1,1,0,1,0,1,0,0,1,0}); param0.add(new int[]{26,36,58,64,69,72,79,82,82,87,89,90,95}); param0.add(new int[]{-52,-40,98,40,42,-50,60,-64,-92,36,-88,72,-72,38,-80,-52,68,70,16,22,-30,-74,56,-80,62,-54,-32,-22,-86,-70,88,-76,-46,28,40,-2,-84,68,-98,-16,90,36,-38,-86,20,-40,82,98,54}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{36,62,58,24,99,12,46,3,4,40,54,97,48,94,98,7,17,5,3,36,3}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(7); param1.add(16); param1.add(13); param1.add(36); param1.add(8); param1.add(8); param1.add(41); param1.add(10); 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()); } }
i
[ "a) n", "b) i", "c) int", "d) f_gold", "e) int" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY{ static int f_gold ( int arr [ ] , int n , int k ) { int dist_count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int j ; for ( j = 0 ; j < n ; j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break ; if ( j == n ) dist_count ++ ; if ( dist_count == k ) return arr [ i ] ; } return - 1 ; } nt j ; for ( j = 0 ; j < n ; j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break ; if ( j == n ) dist_count ++ ; if ( dist_count == k ) return arr [ i ] ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,8,18,20,33,53,56,60,71,76,80,81,87,88,89,92,95}); param0.add(new int[]{-78,6,32,52,-12,-32,22,-40,-82,24,30,10,-40}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{3,28,55,21,42,60,96,83,98,75,29,73,51,21,27,65,19,47,12,81,19,94,50,43,21,32,52,44,52,91,49,59,52,10,75,86,46,43,3,49,70,60,77,99,27,63}); param0.add(new int[]{-96,-90,-76,-44,-16,-8,0,0,2,2,8,14,16,18,18,20,20,28,34,44,68,74,84,90}); param0.add(new int[]{0,1,1,0,0,0,0,0,1,0,0,1,0}); param0.add(new int[]{3,4,5,8,9,15,26,26,26,35,39,40,42,43,45,45,48,52,54,56,57,67,74,77,79,80,81,86,87,92,95,97}); param0.add(new int[]{-76,-24,-12,66,-40,26,72,46,-56,58,-68,2,-82}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{29,83,32,75,5,22,68,64,36,18,7,63,16,42,77,61,1,26,12,41,67,85,85,35,94,18,14,65,8,55,44,34,48,23,8,27,86,2,51,91}); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(8); param1.add(7); param1.add(40); param1.add(23); param1.add(10); param1.add(26); param1.add(6); param1.add(27); param1.add(28); List<Integer> param2 = new ArrayList<>(); param2.add(16); param2.add(6); param2.add(5); param2.add(39); param2.add(12); param2.add(8); param2.add(24); param2.add(10); param2.add(17); param2.add(24); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY{ static int f_gold ( int arr [ ] , int n , int k ) { int dist_count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int j ; for ( j = 0 ; j < n ; j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break ; if ( j == n ) dist_count ++ ; if ( dist_count == k ) return arr [ i ] [MASK] } return - 1 ; }nt j ; for ( j = 0 ; j < n ; j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break ; if ( j == n ) dist_count ++ ; if ( dist_count == k ) return arr [ i ] ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,8,18,20,33,53,56,60,71,76,80,81,87,88,89,92,95}); param0.add(new int[]{-78,6,32,52,-12,-32,22,-40,-82,24,30,10,-40}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{3,28,55,21,42,60,96,83,98,75,29,73,51,21,27,65,19,47,12,81,19,94,50,43,21,32,52,44,52,91,49,59,52,10,75,86,46,43,3,49,70,60,77,99,27,63}); param0.add(new int[]{-96,-90,-76,-44,-16,-8,0,0,2,2,8,14,16,18,18,20,20,28,34,44,68,74,84,90}); param0.add(new int[]{0,1,1,0,0,0,0,0,1,0,0,1,0}); param0.add(new int[]{3,4,5,8,9,15,26,26,26,35,39,40,42,43,45,45,48,52,54,56,57,67,74,77,79,80,81,86,87,92,95,97}); param0.add(new int[]{-76,-24,-12,66,-40,26,72,46,-56,58,-68,2,-82}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{29,83,32,75,5,22,68,64,36,18,7,63,16,42,77,61,1,26,12,41,67,85,85,35,94,18,14,65,8,55,44,34,48,23,8,27,86,2,51,91}); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(8); param1.add(7); param1.add(40); param1.add(23); param1.add(10); param1.add(26); param1.add(6); param1.add(27); param1.add(28); List<Integer> param2 = new ArrayList<>(); param2.add(16); param2.add(6); param2.add(5); param2.add(39); param2.add(12); param2.add(8); param2.add(24); param2.add(10); param2.add(17); param2.add(24); 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()); } }
;
[ "a) )", "b) i", "c) #include", "d) {qsort", "e) ;" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PRINT_WORDS_STRING_REVERSE_ORDER{ static String f_gold ( String str ) { int i = str . length ( ) - 1 ; int start , end = i + 1 ; String result = "" ; while ( i >= 0 ) { if ( str . charAt ( i ) == ' ' ) { start = i + 1 ; while ( start != end ) result += str . charAt ( start ++ ) ; result += ' ' ; end = i ; } i -- ; } start = 0 ; while ( start != end ) result += str . charAt ( start ++ ) ; return result ; } ) result += str . charAt ( start ++ ) ; result += ' ' ; end = i ; } i -- ; } start = 0 ; while ( start != end ) result += str . charAt ( start ++ ) ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("m Dm YZ"); param0.add("65 48 57 71"); param0.add("01 010"); param0.add("mT vhByi"); param0.add("19 44 9 1"); param0.add("0"); param0.add("z vUi "); param0.add("7 591 36643 9 055"); param0.add("01"); param0.add("ti YGaijPY"); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PRINT_WORDS_STRING_REVERSE_ORDER{ static String f_gold ( String str ) { int i = str . length ( ) - 1 ; int start , end = i + 1 ; String result = "" ; while ( i >= 0 ) { if ( str . charAt ( i ) == ' ' ) { start = i + 1 ; while ( start != end ) result += str . charAt ( start ++ ) ; result += ' ' ; end = i ; } i -- ; } start = 0 ; while ( start != end ) result += str . charAt ( start ++ ) ; [MASK] result ; } ) result += str . charAt ( start ++ ) ; result += ' ' ; end = i ; } i -- ; } start = 0 ; while ( start != end ) result += str . charAt ( start ++ ) ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("m Dm YZ"); param0.add("65 48 57 71"); param0.add("01 010"); param0.add("mT vhByi"); param0.add("19 44 9 1"); param0.add("0"); param0.add("z vUi "); param0.add("7 591 36643 9 055"); param0.add("01"); param0.add("ti YGaijPY"); 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()); } }
return
[ "a) sign", "b) int", "c) :", "d) return", "e) y)?" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { if ( n < 3 ) return - 1 ; int max_product = Integer . MIN_VALUE ; for ( int i = 0 ; i < n - 2 ; i ++ ) for ( int j = i + 1 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ; return max_product ; } i ++ ) for ( int j = i + 1 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ; return max_product ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{41,66,77}); param0.add(new int[]{92,-34,-36,-50,20,-94,2,-86,22,-50,74,84,52,-84,98,-50,88,26,-36,-36,6,-50,-48,-84,38,-96,-62,34,52,92,40,-84,18,-90,54,-38,-74,-98,-8,-92,-60,86,-36,94,56}); param0.add(new int[]{0,0,1}); param0.add(new int[]{2,77,99,95,78,15,69,39,34,43,66,45,97,27,67,62,64,2,28,94,41,87,97,52,14,61,78,50}); param0.add(new int[]{-62,-28,40,76}); param0.add(new int[]{0,1,1,0,1,1,1,1,1}); param0.add(new int[]{2,6,10,11,12,12,17,18,18,19,20,22,24,25,30,35,36,37,40,41,42,47,60,60,64,69,69,70,73,79,80,83,97,97,97}); param0.add(new int[]{-72,98,68,18,92,-84,50,32,-90,-40,50,60,-50,-50,50,24,30,94,-98,-6,46,-46,-24,-62,-20,62,-76}); param0.add(new int[]{0,0,0,0,0,1,1,1}); param0.add(new int[]{85,36,7,69,9,45,18,47,1,78,72,53,37,20,95,71,58,41}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(40); param1.add(1); param1.add(26); param1.add(3); param1.add(5); param1.add(25); param1.add(14); param1.add(7); param1.add(14); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { if ( n < 3 ) return - 1 ; int max_product = Integer . MIN_VALUE ; for ( int i = 0 ; i < n - 2 ; i ++ ) for ( int j = i + 1 ; j < n - 1 ; j ++ ) for ( int [MASK] = j + 1 ; k < n ; k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ; return max_product ; }i ++ ) for ( int j = i + 1 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ; return max_product ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{41,66,77}); param0.add(new int[]{92,-34,-36,-50,20,-94,2,-86,22,-50,74,84,52,-84,98,-50,88,26,-36,-36,6,-50,-48,-84,38,-96,-62,34,52,92,40,-84,18,-90,54,-38,-74,-98,-8,-92,-60,86,-36,94,56}); param0.add(new int[]{0,0,1}); param0.add(new int[]{2,77,99,95,78,15,69,39,34,43,66,45,97,27,67,62,64,2,28,94,41,87,97,52,14,61,78,50}); param0.add(new int[]{-62,-28,40,76}); param0.add(new int[]{0,1,1,0,1,1,1,1,1}); param0.add(new int[]{2,6,10,11,12,12,17,18,18,19,20,22,24,25,30,35,36,37,40,41,42,47,60,60,64,69,69,70,73,79,80,83,97,97,97}); param0.add(new int[]{-72,98,68,18,92,-84,50,32,-90,-40,50,60,-50,-50,50,24,30,94,-98,-6,46,-46,-24,-62,-20,62,-76}); param0.add(new int[]{0,0,0,0,0,1,1,1}); param0.add(new int[]{85,36,7,69,9,45,18,47,1,78,72,53,37,20,95,71,58,41}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(40); param1.add(1); param1.add(26); param1.add(3); param1.add(5); param1.add(25); param1.add(14); param1.add(7); param1.add(14); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
k
[ "a) +", "b) val", "c) k", "d) ])", "e) dp" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int n , int x ) { int res = 0 ; for ( int i = 0 ; i < n ; i ++ ) if ( x == arr [ i ] ) res ++ ; return res ; } CURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int n , int x ) { int res = 0 ; for ( int i = 0 ; i < n ; i ++ ) if ( x == arr [ i ] ) res ++ ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{16,18,24,27,34,36,41,43,43,52,59,76,86,87,90,91,94,96,98,98}); param0.add(new int[]{64,66,-36}); param0.add(new int[]{0,0,0}); param0.add(new int[]{9,85,34,43,70,96,44,7,27,33,34,5,91,84,76,45,20,37,15,37,20,24,13,49,74,13,50,81,81,66,23,36,91,80,61,15,96,70,90,25,16,62,75,63,6,65,38,12}); param0.add(new int[]{-98,-98,-98,-34,-32,-26,-12,0,18,52,68,72}); param0.add(new int[]{1,1,0,0,1,1,0,0,1,0,0,1,0,0,1,1}); param0.add(new int[]{1,3,6,6,10,12,15,16,21,22,23,29,33,37,40,40,43,52,55,59,64,65,71,72,80,83,86,86,88,88}); param0.add(new int[]{-14,-30,-38,-38,-8,40,-34,2,-84,68,-42,38,-14,0,-64,12,-2,-38,-8,-44,-88,-34,-80,-36,82,70,96,-32,16,-52,-12,-46,-28,-86,30,-14,50,-44,22,30,-4,78,52}); param0.add(new int[]{1,1,1,1}); param0.add(new int[]{11,50,1,93,12,7,55,35,36,62,61,71,16}); List<Integer> param1 = new ArrayList<>(); param1.add(14); param1.add(1); param1.add(2); param1.add(43); param1.add(11); param1.add(11); param1.add(29); param1.add(39); param1.add(2); param1.add(11); List<Integer> param2 = new ArrayList<>(); param2.add(43); param2.add(64); param2.add(0); param2.add(5); param2.add(-98); param2.add(1); param2.add(40); param2.add(26); param2.add(3); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int n , int x ) { int [MASK] = 0 ; for ( int i = 0 ; i < n ; i ++ ) if ( x == arr [ i ] ) res ++ ; return res ; }CURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int n , int x ) { int res = 0 ; for ( int i = 0 ; i < n ; i ++ ) if ( x == arr [ i ] ) res ++ ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{16,18,24,27,34,36,41,43,43,52,59,76,86,87,90,91,94,96,98,98}); param0.add(new int[]{64,66,-36}); param0.add(new int[]{0,0,0}); param0.add(new int[]{9,85,34,43,70,96,44,7,27,33,34,5,91,84,76,45,20,37,15,37,20,24,13,49,74,13,50,81,81,66,23,36,91,80,61,15,96,70,90,25,16,62,75,63,6,65,38,12}); param0.add(new int[]{-98,-98,-98,-34,-32,-26,-12,0,18,52,68,72}); param0.add(new int[]{1,1,0,0,1,1,0,0,1,0,0,1,0,0,1,1}); param0.add(new int[]{1,3,6,6,10,12,15,16,21,22,23,29,33,37,40,40,43,52,55,59,64,65,71,72,80,83,86,86,88,88}); param0.add(new int[]{-14,-30,-38,-38,-8,40,-34,2,-84,68,-42,38,-14,0,-64,12,-2,-38,-8,-44,-88,-34,-80,-36,82,70,96,-32,16,-52,-12,-46,-28,-86,30,-14,50,-44,22,30,-4,78,52}); param0.add(new int[]{1,1,1,1}); param0.add(new int[]{11,50,1,93,12,7,55,35,36,62,61,71,16}); List<Integer> param1 = new ArrayList<>(); param1.add(14); param1.add(1); param1.add(2); param1.add(43); param1.add(11); param1.add(11); param1.add(29); param1.add(39); param1.add(2); param1.add(11); List<Integer> param2 = new ArrayList<>(); param2.add(43); param2.add(64); param2.add(0); param2.add(5); param2.add(-98); param2.add(1); param2.add(40); param2.add(26); param2.add(3); 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()); } }
res
[ "a) if", "b) res", "c) <limits.h>", "d) (", "e) len" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1{ static int f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) { int count = 0 ; HashSet < Integer > us = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < m ; i ++ ) us . add ( arr1 [ i ] ) ; for ( int j = 0 ; j < n ; j ++ ) if ( us . contains ( x - arr2 [ j ] ) ) count ++ ; return count ; } hSet < Integer > ( ) ; for ( int i = 0 ; i < m ; i ++ ) us . add ( arr1 [ i ] ) ; for ( int j = 0 ; j < n ; j ++ ) if ( us . contains ( x - arr2 [ j ] ) ) count ++ ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,2,5,5,9,11,12,14,16,18,35,36,39,44,50,52,52,59,69,81,82,84,85,87,87,87,88,88,89,90,90,92,97}); param0.add(new int[]{52,28,-38,78,-86,78,-48,-70,-80,28,-8,60,-28,90,6,76,32,-54,30,30,-32,-24,-36,62,36,-66,56,92,-20,90,32}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{91,95,13,13,76,18,36,86,26,13,17,68,58,42,38,9,42,90,14,74,38,64,15}); param0.add(new int[]{-96,-94,-94,-92,-74,-70,-66,-54,-48,-20,-18,-10,-6,-2,2,18,36,48,52,58,68,74,88,90,94}); param0.add(new int[]{1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,1,1,1,0,1,1,0}); param0.add(new int[]{7,18,19,20,24,25,25,27,30,35,39,42,58,59,63,64,64,66,66,68,69,77,86,93}); param0.add(new int[]{86,44,10,80,12,52,-92,2,42,-32,-14,2,-42,40,96,22,58,-90,-20,22,96,10,-92,-28,-28,80,36,72,-2,32,-46,62,-58,20,22,32,-98,-2,-42,-90,10,70,54,-32}); param0.add(new int[]{0,0,1,1,1,1}); param0.add(new int[]{43,2,4,99,45,80,27,8,64,77,57,55,71,67,51,42,58,70,5,62,55,20,61,47,66,80,70,24,56,22,58,63,61,41,20,97,47}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{5,5,8,20,20,24,25,29,34,37,43,45,48,49,59,60,68,70,70,72,72,75,76,77,79,81,84,85,86,88,95,96,96}); param1.add(new int[]{-88,-32,30,32,-46,62,-92,-90,-18,-18,10,16,60,-40,32,-88,60,-82,76,50,86,-82,-48,-68,-42,34,4,0,98,92,-78}); param1.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param1.add(new int[]{16,96,8,35,12,27,81,21,32,82,95,81,53,76,72,16,9,16,61,1,36,71,28}); param1.add(new int[]{-92,-72,-72,-64,-58,-52,-30,-28,-24,-24,-16,-10,-2,4,12,22,30,38,44,62,64,68,86,88,90}); param1.add(new int[]{1,0,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,0,0,1,0,0,0,0,0,1,1,1,0,0}); param1.add(new int[]{2,2,18,20,22,22,31,35,36,40,41,41,41,42,42,43,45,61,79,83,87,91,95,96}); param1.add(new int[]{-4,-76,-98,14,30,-10,-10,62,88,-94,-74,-82,84,44,58,8,-42,-66,-18,68,-78,42,-32,38,-98,38,-78,42,86,-38,-6,-72,-44,8,-6,-48,-62,82,94,-92,-56,28,-54,34}); param1.add(new int[]{0,0,1,1,1,1}); param1.add(new int[]{11,66,41,17,93,25,24,17,12,33,62,86,48,68,36,36,39,82,7,66,5,48,27,9,56,6,61,91,98,74,61,63,98,96,57,63,85}); List<Integer> param2 = new ArrayList<>(); param2.add(17); param2.add(30); param2.add(13); param2.add(11); param2.add(19); param2.add(18); param2.add(22); param2.add(26); param2.add(5); param2.add(24); List<Integer> param3 = new ArrayList<>(); param3.add(29); param3.add(27); param3.add(11); param3.add(12); param3.add(14); param3.add(19); param3.add(18); param3.add(36); param3.add(3); param3.add(29); List<Integer> param4 = new ArrayList<>(); param4.add(32); param4.add(17); param4.add(8); param4.add(15); param4.add(21); param4.add(29); param4.add(18); param4.add(31); param4.add(5); param4.add(21); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1{ static int f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) { int count = 0 ; HashSet < Integer > us = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < m ; i ++ ) us . add ( arr1 [ i ] ) ; for ( int j = 0 ; j < n ; j ++ ) if ( us . contains ( x - arr2 [ j ] ) [MASK] count ++ ; return count ; }hSet < Integer > ( ) ; for ( int i = 0 ; i < m ; i ++ ) us . add ( arr1 [ i ] ) ; for ( int j = 0 ; j < n ; j ++ ) if ( us . contains ( x - arr2 [ j ] ) ) count ++ ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,2,5,5,9,11,12,14,16,18,35,36,39,44,50,52,52,59,69,81,82,84,85,87,87,87,88,88,89,90,90,92,97}); param0.add(new int[]{52,28,-38,78,-86,78,-48,-70,-80,28,-8,60,-28,90,6,76,32,-54,30,30,-32,-24,-36,62,36,-66,56,92,-20,90,32}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{91,95,13,13,76,18,36,86,26,13,17,68,58,42,38,9,42,90,14,74,38,64,15}); param0.add(new int[]{-96,-94,-94,-92,-74,-70,-66,-54,-48,-20,-18,-10,-6,-2,2,18,36,48,52,58,68,74,88,90,94}); param0.add(new int[]{1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,1,1,1,0,1,1,0}); param0.add(new int[]{7,18,19,20,24,25,25,27,30,35,39,42,58,59,63,64,64,66,66,68,69,77,86,93}); param0.add(new int[]{86,44,10,80,12,52,-92,2,42,-32,-14,2,-42,40,96,22,58,-90,-20,22,96,10,-92,-28,-28,80,36,72,-2,32,-46,62,-58,20,22,32,-98,-2,-42,-90,10,70,54,-32}); param0.add(new int[]{0,0,1,1,1,1}); param0.add(new int[]{43,2,4,99,45,80,27,8,64,77,57,55,71,67,51,42,58,70,5,62,55,20,61,47,66,80,70,24,56,22,58,63,61,41,20,97,47}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{5,5,8,20,20,24,25,29,34,37,43,45,48,49,59,60,68,70,70,72,72,75,76,77,79,81,84,85,86,88,95,96,96}); param1.add(new int[]{-88,-32,30,32,-46,62,-92,-90,-18,-18,10,16,60,-40,32,-88,60,-82,76,50,86,-82,-48,-68,-42,34,4,0,98,92,-78}); param1.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param1.add(new int[]{16,96,8,35,12,27,81,21,32,82,95,81,53,76,72,16,9,16,61,1,36,71,28}); param1.add(new int[]{-92,-72,-72,-64,-58,-52,-30,-28,-24,-24,-16,-10,-2,4,12,22,30,38,44,62,64,68,86,88,90}); param1.add(new int[]{1,0,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,0,0,1,0,0,0,0,0,1,1,1,0,0}); param1.add(new int[]{2,2,18,20,22,22,31,35,36,40,41,41,41,42,42,43,45,61,79,83,87,91,95,96}); param1.add(new int[]{-4,-76,-98,14,30,-10,-10,62,88,-94,-74,-82,84,44,58,8,-42,-66,-18,68,-78,42,-32,38,-98,38,-78,42,86,-38,-6,-72,-44,8,-6,-48,-62,82,94,-92,-56,28,-54,34}); param1.add(new int[]{0,0,1,1,1,1}); param1.add(new int[]{11,66,41,17,93,25,24,17,12,33,62,86,48,68,36,36,39,82,7,66,5,48,27,9,56,6,61,91,98,74,61,63,98,96,57,63,85}); List<Integer> param2 = new ArrayList<>(); param2.add(17); param2.add(30); param2.add(13); param2.add(11); param2.add(19); param2.add(18); param2.add(22); param2.add(26); param2.add(5); param2.add(24); List<Integer> param3 = new ArrayList<>(); param3.add(29); param3.add(27); param3.add(11); param3.add(12); param3.add(14); param3.add(19); param3.add(18); param3.add(36); param3.add(3); param3.add(29); List<Integer> param4 = new ArrayList<>(); param4.add(32); param4.add(17); param4.add(8); param4.add(15); param4.add(21); param4.add(29); param4.add(18); param4.add(31); param4.add(5); param4.add(21); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
)
[ "a) #include", "b) -", "c) def", "d) arr", "e) )" ]
e
java
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 ; } rue ) 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()); } }
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 [MASK] { k = ! k ; change = 1 << i ; } else { change -- ; } } i ++ ; } return ans ; }rue ) 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()); } }
)
[ "a) HashMap", "b) for", "c) arr2", "d) f_gold", "e) )" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; } EST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(37); param0.add(39); param0.add(73); param0.add(8); param0.add(28); param0.add(66); param0.add(20); param0.add(36); param0.add(6); param0.add(51); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD{ static boolean f_gold ( int n ) { if ( n [MASK] 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; }EST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(37); param0.add(39); param0.add(73); param0.add(8); param0.add(28); param0.add(66); param0.add(20); param0.add(36); param0.add(6); param0.add(51); 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()); } }
<=
[ "a) <=", "b) (", "c) ;", "d) (", "e) range" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD{ static int f_gold ( int a [ ] , int b [ ] , int n ) { int i ; int s = 0 ; for ( i = 0 ; i < n ; i ++ ) s += ( a [ i ] + b [ i ] ) ; if ( n == 1 ) return a [ 0 ] + b [ 0 ] ; if ( s % n != 0 ) return - 1 ; int x = s / n ; for ( i = 0 ; i < n ; i ++ ) { if ( a [ i ] > x ) return - 1 ; if ( i > 0 ) { a [ i ] += b [ i - 1 ] ; b [ i - 1 ] = 0 ; } if ( a [ i ] == x ) continue ; int y = a [ i ] + b [ i ] ; if ( i + 1 < n ) y += b [ i + 1 ] ; if ( y == x ) { a [ i ] = y ; b [ i ] = 0 ; continue ; } if ( a [ i ] + b [ i ] == x ) { a [ i ] += b [ i ] ; b [ i ] = 0 ; continue ; } if ( i + 1 < n && a [ i ] + b [ i + 1 ] == x ) { a [ i ] += b [ i + 1 ] ; b [ i + 1 ] = 0 ; continue ; } return - 1 ; } for ( i = 0 ; i < n ; i ++ ) if ( b [ i ] != 0 ) return - 1 ; return x ; } + 1 ] == x ) { a [ i ] += b [ i + 1 ] ; b [ i + 1 ] = 0 ; continue ; } return - 1 ; } for ( i = 0 ; i < n ; i ++ ) if ( b [ i ] != 0 ) return - 1 ; return x ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,9,16,18,20,23,24,25,25,26,29,30,35,40,41,43,44,46,53,53,56,56,58,60,62,70,80,80,80,82,86,90,92,92,95}); param0.add(new int[]{-24,70,-74,-90,72,50,-94,86,-58,-68,42,0,98,-70,-14,-32,6,74,64,-78,86,-42,-56,2,-34,-46,70,-62,50,-58,-58,42,86,96,-8,8,-22,-14,-14,98,2,98,-28}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{98,18,50,36,88,75,2,40,74,19,63,82,77,5,59,97,70,50,71,90,90,61,63,99}); param0.add(new int[]{-80,-64,-64,-64,-64,-62,-54,-48,-44,-44,-38,-30,-30,-26,-14,-12,-10,-6,-6,6,22,22,22,26,28,50,52,70,86,86,88,90}); param0.add(new int[]{0,1,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0,1,1,1,0,0,1,1,0,0,1}); param0.add(new int[]{59,61,64}); param0.add(new int[]{98,92,28,42,-74,-36,40,-8,32,-22,-70,-22,-56,74,6,6,-62,46,34,2}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{72,97,79,21,83,2,31,59,6,11,79,97}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{3,15,16,16,18,26,30,32,32,35,37,41,42,43,48,49,49,54,55,57,65,66,67,67,68,83,85,89,89,90,91,93,96,97,99}); param1.add(new int[]{-26,36,48,48,-38,-86,90,-62,30,-4,82,16,32,-6,58,82,-66,-40,52,-78,94,-70,-80,-68,-58,-26,50,-78,-90,-48,-28,48,56,50,72,-22,-2,8,-94,92,-44,-66,-30}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param1.add(new int[]{93,25,16,42,55,61,69,68,95,28,40,90,1,86,76,40,13,47,71,4,64,54,84,45}); param1.add(new int[]{-96,-94,-80,-74,-64,-56,-52,-32,-30,-24,-12,-12,-8,-2,4,8,16,20,24,24,24,48,50,54,60,64,74,80,88,90,92,92}); param1.add(new int[]{1,1,1,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1}); param1.add(new int[]{22,59,85}); param1.add(new int[]{-62,-84,72,60,10,-18,-44,-22,14,0,76,72,96,-28,-24,52,-74,-30,16,66}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{27,71,87,36,73,37,80,34,57,17,88,52}); List<Integer> param2 = new ArrayList<>(); param2.add(29); param2.add(34); param2.add(13); param2.add(16); param2.add(22); param2.add(20); param2.add(1); param2.add(18); param2.add(34); param2.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD{ static int f_gold ( int a [ ] , int b [ ] , int n ) { int i ; int s = 0 ; for ( i = 0 ; i [MASK] n ; i ++ ) s += ( a [ i ] + b [ i ] ) ; if ( n == 1 ) return a [ 0 ] + b [ 0 ] ; if ( s % n != 0 ) return - 1 ; int x = s / n ; for ( i = 0 ; i < n ; i ++ ) { if ( a [ i ] > x ) return - 1 ; if ( i > 0 ) { a [ i ] += b [ i - 1 ] ; b [ i - 1 ] = 0 ; } if ( a [ i ] == x ) continue ; int y = a [ i ] + b [ i ] ; if ( i + 1 < n ) y += b [ i + 1 ] ; if ( y == x ) { a [ i ] = y ; b [ i ] = 0 ; continue ; } if ( a [ i ] + b [ i ] == x ) { a [ i ] += b [ i ] ; b [ i ] = 0 ; continue ; } if ( i + 1 < n && a [ i ] + b [ i + 1 ] == x ) { a [ i ] += b [ i + 1 ] ; b [ i + 1 ] = 0 ; continue ; } return - 1 ; } for ( i = 0 ; i < n ; i ++ ) if ( b [ i ] != 0 ) return - 1 ; return x ; }+ 1 ] == x ) { a [ i ] += b [ i + 1 ] ; b [ i + 1 ] = 0 ; continue ; } return - 1 ; } for ( i = 0 ; i < n ; i ++ ) if ( b [ i ] != 0 ) return - 1 ; return x ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,9,16,18,20,23,24,25,25,26,29,30,35,40,41,43,44,46,53,53,56,56,58,60,62,70,80,80,80,82,86,90,92,92,95}); param0.add(new int[]{-24,70,-74,-90,72,50,-94,86,-58,-68,42,0,98,-70,-14,-32,6,74,64,-78,86,-42,-56,2,-34,-46,70,-62,50,-58,-58,42,86,96,-8,8,-22,-14,-14,98,2,98,-28}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{98,18,50,36,88,75,2,40,74,19,63,82,77,5,59,97,70,50,71,90,90,61,63,99}); param0.add(new int[]{-80,-64,-64,-64,-64,-62,-54,-48,-44,-44,-38,-30,-30,-26,-14,-12,-10,-6,-6,6,22,22,22,26,28,50,52,70,86,86,88,90}); param0.add(new int[]{0,1,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,0,1,0,0,0,0,1,1,1,0,0,1,1,0,0,1}); param0.add(new int[]{59,61,64}); param0.add(new int[]{98,92,28,42,-74,-36,40,-8,32,-22,-70,-22,-56,74,6,6,-62,46,34,2}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{72,97,79,21,83,2,31,59,6,11,79,97}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{3,15,16,16,18,26,30,32,32,35,37,41,42,43,48,49,49,54,55,57,65,66,67,67,68,83,85,89,89,90,91,93,96,97,99}); param1.add(new int[]{-26,36,48,48,-38,-86,90,-62,30,-4,82,16,32,-6,58,82,-66,-40,52,-78,94,-70,-80,-68,-58,-26,50,-78,-90,-48,-28,48,56,50,72,-22,-2,8,-94,92,-44,-66,-30}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1}); param1.add(new int[]{93,25,16,42,55,61,69,68,95,28,40,90,1,86,76,40,13,47,71,4,64,54,84,45}); param1.add(new int[]{-96,-94,-80,-74,-64,-56,-52,-32,-30,-24,-12,-12,-8,-2,4,8,16,20,24,24,24,48,50,54,60,64,74,80,88,90,92,92}); param1.add(new int[]{1,1,1,0,1,1,0,0,0,1,0,0,1,0,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,1,1}); param1.add(new int[]{22,59,85}); param1.add(new int[]{-62,-84,72,60,10,-18,-44,-22,14,0,76,72,96,-28,-24,52,-74,-30,16,66}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{27,71,87,36,73,37,80,34,57,17,88,52}); List<Integer> param2 = new ArrayList<>(); param2.add(29); param2.add(34); param2.add(13); param2.add(16); param2.add(22); param2.add(20); param2.add(1); param2.add(18); param2.add(34); param2.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
<
[ "a) <", "b) .", "c) ||", "d) )", "e) :" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING{ static int f_gold ( String s ) { int n = s . length ( ) ; int [ ] auxArr = new int [ n ] ; if ( s . charAt ( 0 ) == '1' ) auxArr [ 0 ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { if ( s . charAt ( i ) == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1 ; else auxArr [ i ] = auxArr [ i - 1 ] ; } int count = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ; return count ; } i - 1 ] + 1 ; else auxArr [ i ] = auxArr [ i - 1 ] ; } int count = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("OGiOkJF"); param0.add("517376"); param0.add("11"); param0.add("Ze"); param0.add("8763644247018"); param0.add("00111010001"); param0.add("HGwkBKUOVu"); param0.add("652"); param0.add("101000011110"); param0.add("kvdpG "); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING{ static int f_gold ( String s ) { int n = s . length ( ) ; int [ ] auxArr = new int [ n ] ; if ( s . charAt ( 0 ) == '1' ) auxArr [ 0 ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { if ( s . charAt ( i ) == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1 ; else auxArr [ i ] = auxArr [ i - 1 ] ; [MASK] int count = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ; return count ; }i - 1 ] + 1 ; else auxArr [ i ] = auxArr [ i - 1 ] ; } int count = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ; return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("OGiOkJF"); param0.add("517376"); param0.add("11"); param0.add("Ze"); param0.add("8763644247018"); param0.add("00111010001"); param0.add("HGwkBKUOVu"); param0.add("652"); param0.add("101000011110"); param0.add("kvdpG "); 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()); } }
}
[ "a) #include", "b) }", "c) 0", "d) public", "e) import" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS{ static String f_gold ( String num1 , String num2 ) { int len1 = num1 . length ( ) ; int len2 = num2 . length ( ) ; if ( len1 == 0 || len2 == 0 ) return "0" ; int result [ ] = new int [ len1 + len2 ] ; int i_n1 = 0 ; int i_n2 = 0 ; for ( int i = len1 - 1 ; i >= 0 ; i -- ) { int carry = 0 ; int n1 = num1 . charAt ( i ) - '0' ; i_n2 = 0 ; for ( int j = len2 - 1 ; j >= 0 ; j -- ) { int n2 = num2 . charAt ( j ) - '0' ; int sum = n1 * n2 + result [ i_n1 + i_n2 ] + carry ; carry = sum / 10 ; result [ i_n1 + i_n2 ] = sum % 10 ; i_n2 ++ ; } if ( carry > 0 ) result [ i_n1 + i_n2 ] += carry ; i_n1 ++ ; } int i = result . length - 1 ; while ( i >= 0 && result [ i ] == 0 ) i -- ; if ( i == - 1 ) return "0" ; String s = "" ; while ( i >= 0 ) s += ( result [ i -- ] ) ; return s ; } + ; } int i = result . length - 1 ; while ( i >= 0 && result [ i ] == 0 ) i -- ; if ( i == - 1 ) return "0" ; String s = "" ; while ( i >= 0 ) s += ( result [ i -- ] ) ; return s ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("OaITtzE"); param0.add("88111031"); param0.add("1100111"); param0.add("eiWPbMrFx"); param0.add("43701248"); param0.add("100001111110"); param0.add("jVgOapMp"); param0.add("68337672"); param0.add("00110101"); param0.add("JqSh"); List<String> param1 = new ArrayList<>(); param1.add("RnYlJUqzk"); param1.add("558471"); param1.add("11111110111101"); param1.add("tBAJaI"); param1.add("4027"); param1.add("11"); param1.add("Xm"); param1.add("56939"); param1.add("1"); param1.add("iAfjQRwuVyost"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)).equals(f_gold(param0.get(i),param1.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS{ static String f_gold ( String num1 , String num2 ) { int len1 = num1 . length ( ) ; int len2 = num2 . length ( ) ; if ( len1 == 0 || len2 == 0 ) return "0" ; [MASK] result [ ] = new int [ len1 + len2 ] ; int i_n1 = 0 ; int i_n2 = 0 ; for ( int i = len1 - 1 ; i >= 0 ; i -- ) { int carry = 0 ; int n1 = num1 . charAt ( i ) - '0' ; i_n2 = 0 ; for ( int j = len2 - 1 ; j >= 0 ; j -- ) { int n2 = num2 . charAt ( j ) - '0' ; int sum = n1 * n2 + result [ i_n1 + i_n2 ] + carry ; carry = sum / 10 ; result [ i_n1 + i_n2 ] = sum % 10 ; i_n2 ++ ; } if ( carry > 0 ) result [ i_n1 + i_n2 ] += carry ; i_n1 ++ ; } int i = result . length - 1 ; while ( i >= 0 && result [ i ] == 0 ) i -- ; if ( i == - 1 ) return "0" ; String s = "" ; while ( i >= 0 ) s += ( result [ i -- ] ) ; return s ; }+ ; } int i = result . length - 1 ; while ( i >= 0 && result [ i ] == 0 ) i -- ; if ( i == - 1 ) return "0" ; String s = "" ; while ( i >= 0 ) s += ( result [ i -- ] ) ; return s ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("OaITtzE"); param0.add("88111031"); param0.add("1100111"); param0.add("eiWPbMrFx"); param0.add("43701248"); param0.add("100001111110"); param0.add("jVgOapMp"); param0.add("68337672"); param0.add("00110101"); param0.add("JqSh"); List<String> param1 = new ArrayList<>(); param1.add("RnYlJUqzk"); param1.add("558471"); param1.add("11111110111101"); param1.add("tBAJaI"); param1.add("4027"); param1.add("11"); param1.add("Xm"); param1.add("56939"); param1.add("1"); param1.add("iAfjQRwuVyost"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)).equals(f_gold(param0.get(i),param1.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
int
[ "a) [", "b) int", "c) mod", "d) str", "e) (" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES{ static boolean f_gold ( int [ ] arr , int N ) { if ( N < 3 ) return false ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < N - 2 ; i ++ ) if ( arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] ) return true ; return false ; } arr , int N ) { if ( N < 3 ) return false ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < N - 2 ; i ++ ) if ( arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] ) return true ; return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,6,8,10,14,15,16,19,21,26,26,26,28,29,30,33,33,35,36,36,41,44,45,45,45,49,51,54,57,59,61,64,68,70,70,72,73,74,76,78,87,89,89,91,92,93,94,95,97}); param0.add(new int[]{50,-58,-44,90,18,-26,-74,-46,96,32,72,46,-90,86,-10,82,-72,86,-64,-96,-12,-14,-36,16,38,56,54,10,74,-86,-64,-56,30,-50,46,4,88,-94,-4,-78,22,-78}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{80,24,41,90,24,95}); param0.add(new int[]{-90,-88,-84,-82,-82,-80,-70,-66,-62,-60,-60,-48,-46,-44,-42,-20,-16,-4,18,26,28,32,36,46,60,62,68,72,78,98}); param0.add(new int[]{0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0,0,0,1,0,1,1,1,0,0}); param0.add(new int[]{3,9,14,16,16,26,30,31,32,37,42,42,43,49,51,56,64,69,76,77,77,79,85,88,89,91,94,95}); param0.add(new int[]{-60,-90,-30,-42,80,-66,94,60,-68,-74,-50,42,-38,-34,-84,-58,30,98,-52,6,-60,-60}); 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}); param0.add(new int[]{24,80,16,31,5,31,66,1,13,77,88,40,34,15,90,46,8,26,39,52,22,33,3,30,49,51,69,50,39,59}); List<Integer> param1 = new ArrayList<>(); param1.add(25); param1.add(23); param1.add(10); param1.add(4); param1.add(21); param1.add(25); param1.add(19); param1.add(11); param1.add(18); param1.add(23); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES{ static boolean f_gold ( int [ ] arr , int N ) { if ( N < 3 ) [MASK] false ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < N - 2 ; i ++ ) if ( arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] ) return true ; return false ; }arr , int N ) { if ( N < 3 ) return false ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < N - 2 ; i ++ ) if ( arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] ) return true ; return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,6,8,10,14,15,16,19,21,26,26,26,28,29,30,33,33,35,36,36,41,44,45,45,45,49,51,54,57,59,61,64,68,70,70,72,73,74,76,78,87,89,89,91,92,93,94,95,97}); param0.add(new int[]{50,-58,-44,90,18,-26,-74,-46,96,32,72,46,-90,86,-10,82,-72,86,-64,-96,-12,-14,-36,16,38,56,54,10,74,-86,-64,-56,30,-50,46,4,88,-94,-4,-78,22,-78}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{80,24,41,90,24,95}); param0.add(new int[]{-90,-88,-84,-82,-82,-80,-70,-66,-62,-60,-60,-48,-46,-44,-42,-20,-16,-4,18,26,28,32,36,46,60,62,68,72,78,98}); param0.add(new int[]{0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,0,0,1,1,0,0,1,0,0,0,1,0,1,1,1,0,0}); param0.add(new int[]{3,9,14,16,16,26,30,31,32,37,42,42,43,49,51,56,64,69,76,77,77,79,85,88,89,91,94,95}); param0.add(new int[]{-60,-90,-30,-42,80,-66,94,60,-68,-74,-50,42,-38,-34,-84,-58,30,98,-52,6,-60,-60}); 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}); param0.add(new int[]{24,80,16,31,5,31,66,1,13,77,88,40,34,15,90,46,8,26,39,52,22,33,3,30,49,51,69,50,39,59}); List<Integer> param1 = new ArrayList<>(); param1.add(25); param1.add(23); param1.add(10); param1.add(4); param1.add(21); param1.add(25); param1.add(19); param1.add(11); param1.add(18); param1.add(23); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
return
[ "a) ]", "b) i", "c) n", "d) return", "e) *;" ]
d
java
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 ) ; } t 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()); } }
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 ( [MASK] [ r ] == x ) return r ; return f_gold ( arr , l + 1 , r - 1 , x ) ; }t 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()); } }
arr
[ "a) arr", "b) n", "c) )", "d) k", "e) (" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int min = arr [ 0 ] , min_index = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( min > arr [ i ] ) { min = arr [ i ] ; min_index = i ; } } return min_index ; } n ) { int min = arr [ 0 ] , min_index = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( min > arr [ i ] ) { min = arr [ i ] ; min_index = i ; } } return min_index ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,4,9,10,13,14,15,28,28,41,46,47,48,52,55,62,67,69,73,74,79,79,80,87,90,96,99}); param0.add(new int[]{44,62,-40,62,98,30,16,76,-4,-2,78,-96,78,-72,94,-66,-38,-80,40,78,-26,28,-40,-32,-64,76,26,-2,12,82,16,-46,10,70,-62,-54,-6,58,32,98}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{90,26,71,74,69,47,76,96,42,31,22,17,84,20,8,98,49,87,38,53,28,77,29}); param0.add(new int[]{-64,-56,-10,-10,-6,-2,0,22,78,86,98}); param0.add(new int[]{0,1,1,1,1,0,1}); param0.add(new int[]{2,3,3,5,8,10,11,16,17,26,35,36,38,42,59,73,73,75,75,81,82,82,86,87,88,88,90,95,96,98,98,99}); param0.add(new int[]{-96,70,-32,-46,-26,42,-56,36,-72,96,-54,-12,78,30,58,92,56,22,70,10,42,70,0,-76,58,-70,-66,-32,-30,-22,56,10,18,-90,-40,-92,-70,-30,48,10,32,20,-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,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[]{35,52,21,28,96,44,80,56,10,23,48,52,15,55,43,50,6,33,62,55,39,12,31,74,53,34,41,10,52,75,57,78,3}); List<Integer> param1 = new ArrayList<>(); param1.add(27); param1.add(38); param1.add(11); param1.add(18); param1.add(9); param1.add(5); param1.add(29); param1.add(42); param1.add(28); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int min = arr [ 0 ] , min_index = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( min > arr [ i ] ) { min = arr [ i ] ; min_index = i ; } [MASK] return min_index ; }n ) { int min = arr [ 0 ] , min_index = - 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( min > arr [ i ] ) { min = arr [ i ] ; min_index = i ; } } return min_index ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,4,9,10,13,14,15,28,28,41,46,47,48,52,55,62,67,69,73,74,79,79,80,87,90,96,99}); param0.add(new int[]{44,62,-40,62,98,30,16,76,-4,-2,78,-96,78,-72,94,-66,-38,-80,40,78,-26,28,-40,-32,-64,76,26,-2,12,82,16,-46,10,70,-62,-54,-6,58,32,98}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{90,26,71,74,69,47,76,96,42,31,22,17,84,20,8,98,49,87,38,53,28,77,29}); param0.add(new int[]{-64,-56,-10,-10,-6,-2,0,22,78,86,98}); param0.add(new int[]{0,1,1,1,1,0,1}); param0.add(new int[]{2,3,3,5,8,10,11,16,17,26,35,36,38,42,59,73,73,75,75,81,82,82,86,87,88,88,90,95,96,98,98,99}); param0.add(new int[]{-96,70,-32,-46,-26,42,-56,36,-72,96,-54,-12,78,30,58,92,56,22,70,10,42,70,0,-76,58,-70,-66,-32,-30,-22,56,10,18,-90,-40,-92,-70,-30,48,10,32,20,-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,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[]{35,52,21,28,96,44,80,56,10,23,48,52,15,55,43,50,6,33,62,55,39,12,31,74,53,34,41,10,52,75,57,78,3}); List<Integer> param1 = new ArrayList<>(); param1.add(27); param1.add(38); param1.add(11); param1.add(18); param1.add(9); param1.add(5); param1.add(29); param1.add(42); param1.add(28); 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()); } }
}
[ "a) <cstdlib>", "b) count", "c) }", "d) str", "e) <vector>" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CEILING_IN_A_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int low , int high , int x ) { int i ; if ( x <= arr [ low ] ) return low ; for ( i = low ; i < high ; i ++ ) { if ( arr [ i ] == x ) return i ; if ( arr [ i ] < x && arr [ i + 1 ] >= x ) return i + 1 ; } return - 1 ; } ( x <= arr [ low ] ) return low ; for ( i = low ; i < high ; i ++ ) { if ( arr [ i ] == x ) return i ; if ( arr [ i ] < x && arr [ i + 1 ] >= x ) return i + 1 ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,4,6,8,9,9,10,11,16,19,20,21,21,21,24,24,25,28,30,30,30,32,34,35,39,41,42,49,52,57,59,61,62,66,68,71,73,76,79,83,84,85,86,87,87}); param0.add(new int[]{92,50,-84,60,32,-54,84,-82,-42,-72,-64,-28,-48,66,92,-42,42,-66,52,-30,48,42,36,-4,64,62,-16,0,20,26,78,78,12,-6,-30,-14,76,72,70,-34,98,32}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{26,68,73,76,14,19,56,80,17,7,15,64,99,98,21,21,72,12,14,10,44,82,25,42,46,86,79,43,91}); param0.add(new int[]{-90,-86,-84,-50,-30,-24,-12,-2,8,22,30,44,58,58,60,60,62,90}); param0.add(new int[]{0,0,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,0,1,1}); param0.add(new int[]{2,2,29,31,34,39,48,50,56,61,66,66,69,73,88}); param0.add(new int[]{-98,48,-58,8,70,62,92,84,-58,-46,-26,-92,18,-88,40,-12,60,14,54,-64,88,52,-44,88,-46,-8,36,-22,28,-20,-50,58,-82,-44,-44,54,-86,40,10,0,-24,-84,-10,62,58,0,-88}); param0.add(new int[]{0,0,0,0,1,1}); param0.add(new int[]{56,30,33,5,67,35,22,54,36,55,94,89,40,65,29,76,17,14,14,49,40,44,35,69,63,2,81,78,19,67,12,14,68,30,82,85,12,2,94,33,85,75,97,31,69,31,85,26}); List<Integer> param1 = new ArrayList<>(); param1.add(23); param1.add(36); param1.add(11); param1.add(23); param1.add(9); param1.add(12); param1.add(9); param1.add(40); param1.add(5); param1.add(46); List<Integer> param2 = new ArrayList<>(); param2.add(37); param2.add(35); param2.add(9); param2.add(27); param2.add(16); param2.add(15); param2.add(12); param2.add(29); param2.add(5); param2.add(47); List<Integer> param3 = new ArrayList<>(); param3.add(44); param3.add(34); param3.add(13); param3.add(26); param3.add(10); param3.add(18); param3.add(10); param3.add(24); param3.add(5); param3.add(47); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CEILING_IN_A_SORTED_ARRAY{ static int f_gold ( int arr [ ] , int low , int high , int x ) { int i ; if ( x <= arr [ low ] ) return low ; for ( i = low [MASK] i < high ; i ++ ) { if ( arr [ i ] == x ) return i ; if ( arr [ i ] < x && arr [ i + 1 ] >= x ) return i + 1 ; } return - 1 ; } ( x <= arr [ low ] ) return low ; for ( i = low ; i < high ; i ++ ) { if ( arr [ i ] == x ) return i ; if ( arr [ i ] < x && arr [ i + 1 ] >= x ) return i + 1 ; } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,4,6,8,9,9,10,11,16,19,20,21,21,21,24,24,25,28,30,30,30,32,34,35,39,41,42,49,52,57,59,61,62,66,68,71,73,76,79,83,84,85,86,87,87}); param0.add(new int[]{92,50,-84,60,32,-54,84,-82,-42,-72,-64,-28,-48,66,92,-42,42,-66,52,-30,48,42,36,-4,64,62,-16,0,20,26,78,78,12,-6,-30,-14,76,72,70,-34,98,32}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{26,68,73,76,14,19,56,80,17,7,15,64,99,98,21,21,72,12,14,10,44,82,25,42,46,86,79,43,91}); param0.add(new int[]{-90,-86,-84,-50,-30,-24,-12,-2,8,22,30,44,58,58,60,60,62,90}); param0.add(new int[]{0,0,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,0,1,1}); param0.add(new int[]{2,2,29,31,34,39,48,50,56,61,66,66,69,73,88}); param0.add(new int[]{-98,48,-58,8,70,62,92,84,-58,-46,-26,-92,18,-88,40,-12,60,14,54,-64,88,52,-44,88,-46,-8,36,-22,28,-20,-50,58,-82,-44,-44,54,-86,40,10,0,-24,-84,-10,62,58,0,-88}); param0.add(new int[]{0,0,0,0,1,1}); param0.add(new int[]{56,30,33,5,67,35,22,54,36,55,94,89,40,65,29,76,17,14,14,49,40,44,35,69,63,2,81,78,19,67,12,14,68,30,82,85,12,2,94,33,85,75,97,31,69,31,85,26}); List<Integer> param1 = new ArrayList<>(); param1.add(23); param1.add(36); param1.add(11); param1.add(23); param1.add(9); param1.add(12); param1.add(9); param1.add(40); param1.add(5); param1.add(46); List<Integer> param2 = new ArrayList<>(); param2.add(37); param2.add(35); param2.add(9); param2.add(27); param2.add(16); param2.add(15); param2.add(12); param2.add(29); param2.add(5); param2.add(47); List<Integer> param3 = new ArrayList<>(); param3.add(44); param3.add(34); param3.add(13); param3.add(26); param3.add(10); param3.add(18); param3.add(10); param3.add(24); param3.add(5); param3.add(47); 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()); } }
;
[ "a) std;", "b) +=", "c) ;", "d) 1", "e) std;" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{ static int f_gold ( int n ) { n -- ; n |= n >> 1 ; n |= n >> 2 ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; } ss SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{ static int f_gold ( int n ) { n -- ; n |= n >> 1 ; n |= n >> 2 ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(60); param0.add(20); param0.add(33); param0.add(34); param0.add(68); param0.add(79); param0.add(20); param0.add(41); param0.add(36); param0.add(17); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{ static int f_gold ( int n ) { n -- ; n |= n >> 1 ; n |= n >> [MASK] ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; }ss SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{ static int f_gold ( int n ) { n -- ; n |= n >> 1 ; n |= n >> 2 ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(60); param0.add(20); param0.add(33); param0.add(34); param0.add(68); param0.add(79); param0.add(20); param0.add(41); param0.add(36); param0.add(17); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
2
[ "a) 1]", "b) ;", "c) i", "d) k", "e) 2" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class GCD_ELEMENTS_GIVEN_RANGE{ static int f_gold ( int n , int m ) { return ( n == m ) ? n : 1 ; } t java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class GCD_ELEMENTS_GIVEN_RANGE{ static int f_gold ( int n , int m ) { return ( n == m ) ? n : 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(57); param0.add(22); param0.add(17); param0.add(74); param0.add(93); param0.add(56); param0.add(5); param0.add(5); param0.add(9); param0.add(98); List<Integer> param1 = new ArrayList<>(); param1.add(57); param1.add(22); param1.add(17); param1.add(74); param1.add(22); param1.add(54); param1.add(33); param1.add(68); param1.add(75); param1.add(21); 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()); } }
import java.util. *; import java.util.stream.*; [MASK] java.lang.*; import javafx.util.Pair; public class GCD_ELEMENTS_GIVEN_RANGE{ static int f_gold ( int n , int m ) { return ( n == m ) ? n : 1 ; }t java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class GCD_ELEMENTS_GIVEN_RANGE{ static int f_gold ( int n , int m ) { return ( n == m ) ? n : 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(57); param0.add(22); param0.add(17); param0.add(74); param0.add(93); param0.add(56); param0.add(5); param0.add(5); param0.add(9); param0.add(98); List<Integer> param1 = new ArrayList<>(); param1.add(57); param1.add(22); param1.add(17); param1.add(74); param1.add(22); param1.add(54); param1.add(33); param1.add(68); param1.add(75); param1.add(21); 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()); } }
import
[ "a) i", "b) <cstdlib>", "c) arr", "d) import", "e) 1" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1{ static int f_gold ( int [ ] arr , int n ) { Map < Integer , Integer > myMap = new HashMap < > ( ) ; int sum = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 0 ) arr [ i ] = - 1 ; sum += arr [ i ] ; if ( sum == 0 ) count ++ ; if ( myMap . containsKey ( sum ) ) count += myMap . get ( sum ) ; if ( ! myMap . containsKey ( sum ) ) myMap . put ( sum , 1 ) ; else myMap . put ( sum , myMap . get ( sum ) + 1 ) ; } return count ; } tainsKey ( sum ) ) count += myMap . get ( sum ) ; if ( ! myMap . containsKey ( sum ) ) myMap . put ( sum , 1 ) ; else myMap . put ( sum , myMap . get ( sum ) + 1 ) ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,6,6,9,9,9,16,18,19,20,21,22,23,26,26,28,39,40,41,43,43,44,44,45,51,51,55,59,60,62,67,67,68,69,70,71,71,72,82,84,88,88,89,89,91,92,92}); param0.add(new int[]{-44,74,-52,-96,46,92,54,56,-38,88,40,34,-72,8,58,-14,36,94,34,-90,-42,80,-12,-42,-6,78,-98,34,-88,0,-76,90,40,64,26,18,-84,72,80}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{60,48,42,95,30,22,80,15,62,38,63,42,39,28,69,71,30,48,67,9,33,74,95,95,72,35,9}); param0.add(new int[]{-96,-94,-94,-86,-66,-66,-62,-58,-36,-36,-22,-18,-10,2,4,6,10,16,20,24,26,28,28,28,40,42,44,58,76,78,78,80,90,92}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,0,1,1,1,1,0,1,0,0,1,1,1,0,1,1,0,1,0,1,1,1,0,1,1}); param0.add(new int[]{4,5,5,6,7,11,16,16,17,18,19,20,21,22,23,25,26,27,29,31,34,36,37,40,41,45,45,55,65,69,70,71,71,71,73,73,76,79,80,85,85,88,90,97,98,98,99,99}); param0.add(new int[]{34,-20,38,-94,2,32,-26,90,94,-36,-94,6,-24,12,4,60,68,64,-60,-72,-54,-10,-64,-48,-88,60,48,64,0,-26,26,74,32,-92,4,84,6,-16,30,-56,-28,-86,-68}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{4,99,97,63,65,57,69,39,29,91,68,25,84,82,84,89,59,18,77,29,57,40,78,35,23,91,26,71,19,99,12,91,49,71,49,77,67}); List<Integer> param1 = new ArrayList<>(); param1.add(44); param1.add(37); param1.add(32); param1.add(18); param1.add(24); param1.add(28); param1.add(31); param1.add(37); param1.add(19); param1.add(31); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1{ static int f_gold ( int [ ] arr , int n ) { Map < Integer , Integer > myMap = new HashMap < > ( ) ; int sum = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 0 ) arr [ i ] = - 1 ; sum += arr [ i ] ; if ( sum == 0 ) count ++ ; if ( myMap [MASK] containsKey ( sum ) ) count += myMap . get ( sum ) ; if ( ! myMap . containsKey ( sum ) ) myMap . put ( sum , 1 ) ; else myMap . put ( sum , myMap . get ( sum ) + 1 ) ; } return count ; }tainsKey ( sum ) ) count += myMap . get ( sum ) ; if ( ! myMap . containsKey ( sum ) ) myMap . put ( sum , 1 ) ; else myMap . put ( sum , myMap . get ( sum ) + 1 ) ; } return count ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,6,6,9,9,9,16,18,19,20,21,22,23,26,26,28,39,40,41,43,43,44,44,45,51,51,55,59,60,62,67,67,68,69,70,71,71,72,82,84,88,88,89,89,91,92,92}); param0.add(new int[]{-44,74,-52,-96,46,92,54,56,-38,88,40,34,-72,8,58,-14,36,94,34,-90,-42,80,-12,-42,-6,78,-98,34,-88,0,-76,90,40,64,26,18,-84,72,80}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{60,48,42,95,30,22,80,15,62,38,63,42,39,28,69,71,30,48,67,9,33,74,95,95,72,35,9}); param0.add(new int[]{-96,-94,-94,-86,-66,-66,-62,-58,-36,-36,-22,-18,-10,2,4,6,10,16,20,24,26,28,28,28,40,42,44,58,76,78,78,80,90,92}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,0,1,1,1,1,0,1,0,0,1,1,1,0,1,1,0,1,0,1,1,1,0,1,1}); param0.add(new int[]{4,5,5,6,7,11,16,16,17,18,19,20,21,22,23,25,26,27,29,31,34,36,37,40,41,45,45,55,65,69,70,71,71,71,73,73,76,79,80,85,85,88,90,97,98,98,99,99}); param0.add(new int[]{34,-20,38,-94,2,32,-26,90,94,-36,-94,6,-24,12,4,60,68,64,-60,-72,-54,-10,-64,-48,-88,60,48,64,0,-26,26,74,32,-92,4,84,6,-16,30,-56,-28,-86,-68}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{4,99,97,63,65,57,69,39,29,91,68,25,84,82,84,89,59,18,77,29,57,40,78,35,23,91,26,71,19,99,12,91,49,71,49,77,67}); List<Integer> param1 = new ArrayList<>(); param1.add(44); param1.add(37); param1.add(32); param1.add(18); param1.add(24); param1.add(28); param1.add(31); param1.add(37); param1.add(19); param1.add(31); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
.
[ "a) .", "b) [", "c) n", "d) int", "e) =" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT{ static int f_gold ( int dp [ ] [ ] , int a [ ] , int low , int high , int turn ) { if ( low == high ) { return a [ low ] * turn ; } if ( dp [ low ] [ high ] != 0 ) { return dp [ low ] [ high ] ; } dp [ low ] [ high ] = Math . max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , high - 1 , turn + 1 ) ) ; return dp [ low ] [ high ] ; } ] [ high ] = Math . max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , high - 1 , turn + 1 ) ) ; return dp [ low ] [ high ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{23,37,54,57,59,75,97},new int[]{9,15,34,39,80,96,99},new int[]{15,25,26,31,43,47,93},new int[]{22,31,37,44,54,62,91},new int[]{7,19,32,56,57,70,81},new int[]{16,37,49,77,81,82,85},new int[]{44,48,64,74,79,89,99}}); param0.add(new int[][]{new int[]{-24,-34,-86,-16,-34,14,76,4,18,60,-4,-24,46,-26,-74,6,50,-34,8,-30,-62,56,-78,-50,76,-98,-64,-72,-76,46,-70,4,-92,-18,10,-76,78,-26},new int[]{-34,-30,-96,-4,76,48,-10,96,-88,96,90,40,-24,68,-42,-48,-30,-32,-44,-50,-98,34,-78,-52,-88,-38,54,-64,-94,-48,-80,-2,-90,-14,-8,90,-78,-36},new int[]{30,-80,-58,48,-80,-78,40,-48,-40,-84,2,44,72,6,78,-84,-30,-70,32,86,16,68,40,-36,80,-46,66,-92,8,72,-56,58,-72,44,40,6,66,-66},new int[]{16,-72,-66,-30,66,-94,36,-34,-78,14,-74,-54,48,6,-40,-40,-24,-6,18,-20,-88,-8,82,-56,-96,-32,30,-22,70,-4,98,-40,-72,66,-54,-60,52,66},new int[]{-28,-52,90,-52,12,98,42,-52,38,-60,-28,94,86,-22,-62,68,12,92,-82,18,-2,82,-28,72,-78,-70,40,-54,-24,-68,-74,-40,-32,14,88,94,-46,-14},new int[]{-38,-30,62,-52,54,56,12,32,-78,24,38,-82,6,-64,-96,-56,-30,62,-94,-26,-64,-38,96,72,54,-56,56,82,6,-30,94,80,-68,18,84,58,-48,-34},new int[]{82,-44,14,-26,-14,-92,62,-48,-52,26,-30,-76,-26,28,54,-16,-60,16,-76,-90,20,-8,56,-86,66,-84,92,-52,90,30,38,-2,90,-50,88,44,-66,-80},new int[]{-22,68,62,-84,-76,-12,82,70,-58,86,20,-66,96,-28,6,60,-90,52,-28,8,34,90,38,24,76,-22,6,16,-46,-4,84,-6,6,30,50,26,8,-8},new int[]{34,-62,-26,18,-14,42,-50,72,16,-62,-76,32,-20,82,8,74,60,-60,-16,-50,-38,-88,68,-26,66,-14,64,42,98,40,-56,28,-96,36,-82,-74,38,-26},new int[]{-66,-58,-84,16,-42,4,-38,-6,-32,-98,20,-96,60,-38,24,-8,-74,52,98,52,-10,-24,-22,78,-20,58,-24,-98,-76,0,-94,6,28,42,20,-36,68,-68},new int[]{-20,70,-80,68,-26,-26,-22,88,86,12,-98,-80,2,-22,-2,2,-52,-50,30,12,74,34,-14,-54,70,16,-76,-56,16,-50,-14,-4,30,48,-14,84,-34,30},new int[]{68,68,-86,66,-64,60,-28,52,14,-40,-98,22,-30,28,-48,-76,66,94,-28,32,88,86,-76,-4,68,-56,76,-4,36,16,-4,8,-44,-84,74,74,96,-22},new int[]{-14,-88,-52,-72,-60,-50,32,86,14,-26,36,-84,38,80,-86,-64,14,-96,86,-52,-48,-16,-78,-66,-10,-24,70,22,90,46,-74,36,-74,2,96,6,4,34},new int[]{-34,72,-40,34,-30,18,54,-50,0,94,-62,80,4,84,10,98,56,-36,-94,88,10,-30,90,-52,14,-46,30,82,-66,8,-98,86,-90,46,-44,-92,22,58},new int[]{70,-44,-28,-78,-62,-78,-96,-6,-92,-86,-82,72,-50,26,-4,82,-42,58,28,-88,98,-98,-14,72,-24,58,72,-72,6,-78,34,-34,58,-62,78,-98,0,50},new int[]{84,48,-82,-32,-22,16,-34,-28,-76,40,26,30,70,28,-64,-90,70,-90,82,60,10,-52,0,50,-38,-32,-18,2,48,20,-96,4,62,-28,28,-12,50,-90},new int[]{64,58,-34,10,-44,-72,62,70,60,84,-12,-46,-82,-12,80,46,44,-58,-18,10,44,50,-60,-20,82,-10,18,-4,48,22,-14,12,-76,-32,8,-60,-54,-6},new int[]{22,-58,58,-24,-58,-64,62,-38,-36,44,-82,46,-78,54,96,24,84,90,-2,-98,-74,8,44,-94,84,48,-2,66,-44,52,-42,-36,34,-98,-6,54,26,18},new int[]{-28,30,-66,-14,-20,-44,-62,-20,90,-92,-38,64,44,-60,90,-60,-82,36,-46,52,-60,26,12,80,-64,92,-22,-68,-10,54,-96,44,70,10,4,-4,-94,66},new int[]{-70,54,-32,92,-26,-66,28,-98,-14,-20,40,-36,-6,-60,-36,-32,26,90,34,-34,82,48,-82,-8,-86,-74,-58,-68,-68,-16,-26,-88,-6,-76,-12,-68,-98,-94},new int[]{14,-84,90,88,80,-28,-46,4,-4,36,-56,-44,68,24,24,70,36,-4,58,-78,14,-48,-46,58,-44,-66,72,-36,84,70,-26,72,76,30,-30,92,4,-40},new int[]{-24,-28,0,-44,-48,74,76,50,-88,36,-24,62,-34,82,-20,38,-76,16,-70,92,-82,56,72,78,40,52,-52,-38,36,-44,92,46,-60,-54,58,96,74,-18},new int[]{70,-30,-62,-74,-88,-92,72,-42,34,76,-4,-94,22,-82,56,2,44,-64,-88,-20,96,0,-12,-20,-40,-56,-8,18,-8,18,98,28,50,-14,72,50,4,38},new int[]{72,-66,16,-44,94,10,60,96,24,12,92,30,2,64,4,58,74,-24,-96,-52,72,10,-2,-18,-74,-2,70,-6,-60,72,-32,34,-78,-10,-2,-30,54,42},new int[]{80,92,18,54,-42,50,-62,76,94,38,84,78,44,98,78,-54,-36,-80,62,14,24,86,52,4,78,96,20,58,-64,-42,20,-98,-90,6,30,56,-66,-34},new int[]{-86,60,-62,-32,-12,92,-54,-2,8,58,68,42,-46,-8,82,-28,-96,62,46,-12,0,88,82,-26,-42,36,46,-46,54,-58,-58,-62,32,-48,-60,86,4,56},new int[]{88,-36,4,60,24,6,72,58,44,14,-40,-64,36,-92,36,-56,-78,86,80,80,-94,64,-4,-2,86,26,-98,-56,62,-56,-18,40,12,26,50,72,-16,-58},new int[]{-88,4,-66,64,42,94,54,-38,8,-18,-8,88,46,42,64,-88,94,58,-50,26,38,92,-66,82,8,38,-92,-32,50,-44,-88,-6,34,12,66,54,-52,-86},new int[]{20,-90,2,-94,-76,-28,-76,44,-12,-56,50,4,34,-88,46,2,60,52,22,98,-84,6,-26,-90,-4,48,-66,-42,58,-22,30,-22,-82,-50,42,84,94,4},new int[]{-56,4,-4,54,64,82,88,8,50,66,-2,80,-4,12,24,-56,-52,80,66,82,-66,-92,-42,-56,66,-92,-60,-92,-52,-54,32,22,-42,-46,-66,60,10,-62},new int[]{-44,0,6,-54,-98,72,-98,-28,-4,-86,-10,-76,-64,-66,58,60,24,90,-6,-54,-22,84,-34,64,36,18,14,-32,-88,-32,84,-8,60,98,28,-6,14,-88},new int[]{-94,-92,74,96,28,34,56,74,-62,-46,-8,10,-96,-72,50,-98,-28,72,2,46,68,14,-72,-78,-76,68,52,-30,-32,90,40,50,50,20,98,2,72,44},new int[]{-6,94,16,-70,-74,-46,22,24,44,-40,52,-50,94,-66,84,-66,14,-12,48,-6,64,-12,-44,-14,2,-48,-22,52,-28,-18,8,72,-28,68,44,-28,-20,62},new int[]{12,-94,-86,-52,-92,-76,-78,10,-8,30,34,26,-80,-8,68,92,66,16,-48,70,30,-56,-80,-78,58,94,-56,-12,56,-94,-60,-70,0,-94,6,36,48,-98},new int[]{74,72,20,-84,96,-84,40,-36,-88,-14,60,-70,36,-28,-18,-82,-36,92,-86,44,-16,-66,28,-88,-18,-52,66,-26,-90,-12,-16,80,-28,82,-92,82,-76,-80},new int[]{40,-38,-48,72,-30,70,-14,14,90,42,-6,52,-94,44,-32,-8,-74,80,-18,-10,74,-80,86,-82,-2,10,-12,58,-70,-18,86,40,62,76,88,68,68,4},new int[]{86,4,16,86,-66,72,-38,-40,-52,14,-60,-88,-44,-60,-64,84,-50,-78,-44,-18,78,74,-66,-64,18,26,74,98,-18,-96,-82,4,-74,-40,-50,-46,-4,94},new int[]{-70,-64,-10,-22,-88,-48,84,78,16,64,78,-48,66,-88,44,60,-10,-48,60,-40,86,-40,32,16,28,-30,32,-74,10,-34,38,-36,-30,2,14,-92,-48,88}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}}); param0.add(new int[][]{new int[]{84,65,61,9,50,58,19,98,63,92,42,82,5,55,81,77,1,92,74,40,13,59,48,51,18,42,34,78,41,82,13,6,92},new int[]{31,76,5,83,74,92,29,9,40,28,36,36,4,73,32,6,79,8,45,89,60,34,82,27,68,24,68,47,27,42,3,61,19},new int[]{56,19,38,73,69,25,38,90,20,50,27,8,1,84,9,44,54,64,8,74,19,52,40,9,75,66,58,8,40,46,55,54,75},new int[]{12,13,58,11,23,52,60,91,95,86,63,25,62,93,35,36,60,87,94,46,3,85,35,77,28,22,33,7,92,76,33,53,30},new int[]{2,4,55,27,47,76,45,70,34,36,5,2,50,24,32,85,81,34,5,35,56,72,21,39,58,90,49,75,74,49,76,22,30},new int[]{35,66,31,4,44,70,53,57,36,36,54,26,96,4,22,34,1,87,57,51,16,36,47,91,39,5,25,45,61,5,37,51,88},new int[]{45,98,42,35,56,86,16,75,9,32,14,92,40,25,24,29,5,1,75,13,3,8,71,79,96,33,22,13,30,20,41,84,59},new int[]{74,33,15,13,27,6,87,95,74,82,7,52,29,66,44,89,74,21,57,22,32,13,14,42,12,99,55,9,16,94,37,72,29},new int[]{64,47,16,76,77,39,94,53,65,65,80,12,25,14,6,77,66,12,37,63,78,17,32,16,22,7,40,25,8,27,32,55,39},new int[]{27,52,60,70,10,52,14,60,35,31,27,50,74,87,32,28,55,98,68,9,72,48,53,39,29,64,84,64,47,7,69,22,72},new int[]{89,58,93,44,1,12,98,64,65,97,36,4,84,47,49,77,81,11,30,3,69,73,30,68,73,10,96,40,71,57,3,81,46},new int[]{39,71,95,88,22,67,25,57,53,22,98,68,19,28,10,26,79,13,50,2,10,54,44,88,69,97,75,31,18,77,17,22,53},new int[]{85,17,87,79,24,25,49,13,15,16,36,98,41,78,77,89,31,91,20,85,51,29,55,94,69,16,85,91,83,9,66,96,16},new int[]{67,72,45,87,18,95,50,29,69,80,43,78,53,37,71,67,41,16,66,77,69,74,50,11,37,80,5,60,5,56,85,9,92},new int[]{92,36,57,21,48,29,77,51,52,74,68,1,18,60,70,47,98,75,81,17,12,74,1,52,50,21,30,24,17,56,29,65,18},new int[]{63,47,21,28,54,39,53,42,30,59,74,9,14,66,94,45,27,44,43,98,60,57,1,65,35,19,35,58,27,38,82,96,96},new int[]{29,64,7,9,34,80,65,45,40,56,95,7,32,36,9,70,83,73,92,73,20,19,65,27,87,2,88,64,48,71,20,57,11},new int[]{85,39,35,38,44,69,64,28,47,77,38,4,84,50,54,72,62,33,31,60,68,37,80,62,74,96,81,17,64,11,91,85,64},new int[]{45,96,40,46,4,53,91,75,80,53,8,29,93,10,11,48,15,96,80,13,47,23,81,23,41,59,28,37,6,16,46,49,89},new int[]{1,59,53,1,36,70,18,90,6,18,15,1,74,7,57,87,54,92,8,41,47,60,60,18,77,5,79,47,83,23,9,42,55},new int[]{45,22,54,33,86,86,2,52,34,74,17,40,78,5,77,8,52,13,8,24,27,97,9,8,28,91,74,98,99,8,18,12,85},new int[]{43,68,81,7,74,86,13,75,46,95,62,39,98,22,51,53,46,62,25,90,54,5,26,45,31,84,95,63,11,27,2,43,7},new int[]{20,68,7,65,20,49,16,59,39,68,20,43,2,37,39,14,90,45,94,31,68,94,88,72,80,95,1,88,19,93,21,71,27},new int[]{41,67,5,99,99,88,90,4,31,54,22,28,1,27,2,46,94,37,21,43,21,4,44,74,72,49,39,58,91,76,39,70,43},new int[]{23,23,33,86,60,69,14,39,49,89,1,32,65,67,62,63,16,70,59,20,53,50,8,93,52,75,77,20,16,13,92,16,18},new int[]{97,3,56,96,41,64,6,95,92,95,30,15,1,13,55,68,88,8,99,55,81,9,87,46,93,83,54,51,32,52,62,54,41},new int[]{81,13,63,13,67,97,51,72,40,49,87,12,24,92,46,46,45,38,95,67,51,51,88,62,71,66,32,57,23,27,21,13,52},new int[]{6,91,35,9,74,55,71,71,28,63,89,65,95,45,26,47,64,27,88,10,42,45,14,27,32,93,95,64,14,88,53,30,41},new int[]{55,51,89,7,37,36,89,43,26,78,33,2,21,94,58,40,95,46,68,89,38,75,97,58,78,12,6,57,18,3,96,61,17},new int[]{56,24,53,35,66,26,30,60,27,57,82,78,84,84,94,31,48,59,33,27,54,33,20,67,46,19,71,91,70,29,26,17,66},new int[]{85,48,88,33,78,98,69,3,81,70,80,66,84,61,48,17,8,25,8,29,82,59,62,1,58,71,74,86,8,94,15,22,79},new int[]{43,32,57,81,97,19,68,26,21,12,12,44,10,81,42,92,44,58,10,11,2,5,33,1,86,46,85,40,13,16,44,70,42},new int[]{31,28,33,90,54,30,46,18,1,95,73,79,87,16,87,39,92,26,85,75,42,56,11,78,50,6,63,77,46,77,45,35,83}}); param0.add(new int[][]{new int[]{-82,-82,-76,-74,-72,-70,-70,-68,-66,-56,-56,-50,-48,-44,-42,-38,-36,-32,-26,-20,-20,-18,-8,6,8,12,12,14,18,20,24,24,30,32,36,38,40,44,50,56,60,62,66,70,76,78,90,98,98},new int[]{-92,-80,-76,-70,-58,-58,-50,-48,-38,-36,-34,-32,-30,-30,-24,-20,-20,-18,-10,-10,-8,-6,-6,-6,-4,2,10,14,24,26,30,34,36,44,52,54,64,76,78,82,86,86,86,86,86,88,88,92,94},new int[]{-98,-94,-86,-82,-80,-76,-74,-74,-72,-70,-70,-68,-66,-62,-50,-50,-48,-42,-34,-24,-22,-22,2,8,8,10,12,22,22,26,26,26,30,38,44,54,56,58,68,68,72,78,80,80,84,88,92,94,98},new int[]{-92,-88,-84,-84,-82,-78,-78,-66,-60,-48,-48,-46,-42,-40,-40,-38,-36,-34,-30,-30,-26,-26,-22,-22,-20,-14,-12,6,28,36,38,44,46,46,48,50,52,52,56,58,60,70,80,80,80,86,92,96,98},new int[]{-98,-94,-80,-76,-72,-70,-70,-70,-68,-64,-64,-62,-60,-56,-54,-52,-50,-48,-46,-42,-40,-30,-28,-28,-24,-22,-6,-4,0,2,10,12,18,18,32,36,58,60,68,70,72,74,80,84,86,88,88,94,98},new int[]{-96,-96,-86,-84,-84,-72,-72,-70,-70,-66,-64,-60,-58,-58,-46,-38,-38,-28,-22,-18,-14,16,18,20,20,24,24,26,32,32,34,40,42,42,44,44,46,56,58,60,62,64,66,68,68,68,74,78,86},new int[]{-98,-92,-70,-58,-54,-50,-50,-50,-46,-40,-40,-36,-34,-24,-22,-22,-18,-8,-6,-6,-2,2,2,10,16,16,20,22,24,26,28,28,30,32,38,40,42,48,56,56,58,60,66,66,72,84,90,94,96},new int[]{-98,-90,-82,-80,-78,-78,-70,-66,-60,-54,-48,-48,-38,-28,-18,-16,-14,-12,-12,-10,-8,-4,-4,-4,-2,0,2,6,6,12,16,18,20,24,36,46,52,54,60,62,66,66,70,70,82,82,86,86,88},new int[]{-98,-90,-88,-86,-78,-76,-76,-70,-66,-60,-56,-56,-56,-54,-52,-46,-40,-28,-26,-22,-20,-20,-18,-14,-12,-8,0,18,18,28,34,36,36,36,38,46,50,54,56,56,60,66,70,72,74,74,80,80,82},new int[]{-98,-92,-90,-86,-84,-82,-78,-70,-66,-60,-58,-44,-42,-34,-32,-30,-24,-20,-16,-8,-4,8,8,14,14,14,14,20,20,32,38,42,52,62,62,66,68,70,72,72,78,78,78,78,84,96,98,98,98},new int[]{-90,-88,-82,-82,-82,-80,-74,-68,-68,-64,-58,-56,-54,-50,-42,-36,-32,-28,-20,-20,-20,-18,-16,-14,-6,-6,-2,6,8,10,20,24,26,32,38,44,46,48,56,56,58,60,64,68,74,80,88,92,96},new int[]{-96,-94,-88,-72,-72,-72,-70,-70,-64,-52,-46,-46,-44,-38,-34,-34,-28,-26,-20,-16,-14,-10,-8,-2,-2,2,6,8,10,30,34,34,36,44,52,58,60,70,72,72,74,76,76,80,90,92,92,94,98},new int[]{-98,-98,-96,-96,-84,-82,-80,-76,-62,-52,-46,-44,-44,-40,-38,-38,-36,-30,-22,-8,-4,-2,0,2,4,8,12,20,22,26,26,30,34,46,46,52,54,56,58,60,62,66,72,74,78,80,90,92,96},new int[]{-94,-94,-92,-92,-80,-80,-74,-64,-56,-54,-52,-50,-50,-42,-42,-42,-40,-36,-36,-32,-24,-16,-14,-4,0,2,4,10,12,16,22,24,26,28,28,30,40,46,48,56,58,62,62,62,80,88,88,96,98},new int[]{-96,-94,-94,-92,-84,-82,-80,-74,-70,-58,-54,-52,-52,-48,-44,-34,-34,-30,-28,-24,-14,-12,-4,-2,2,2,4,10,12,14,24,28,38,40,46,58,62,68,72,72,74,76,82,84,84,84,84,90,98},new int[]{-98,-90,-84,-82,-76,-70,-66,-62,-60,-60,-58,-56,-54,-54,-50,-50,-46,-40,-40,-38,-32,-24,-22,-22,-20,-12,-12,-8,6,6,8,8,8,22,26,40,42,50,50,50,50,56,64,86,92,92,94,94,96},new int[]{-92,-78,-74,-68,-66,-62,-62,-62,-60,-60,-54,-40,-36,-34,-34,-32,-22,-22,-18,-14,-12,-10,-6,-4,-2,0,12,14,18,28,32,32,38,44,48,50,52,52,60,64,66,66,82,86,90,90,94,94,96},new int[]{-96,-94,-92,-90,-88,-86,-84,-76,-74,-72,-72,-68,-66,-66,-58,-52,-50,-46,-42,-34,-32,-32,-30,-14,-10,-6,-6,-2,-2,10,14,20,30,30,34,36,36,38,38,42,44,50,52,64,68,82,90,90,98},new int[]{-98,-88,-82,-80,-80,-78,-76,-72,-70,-66,-66,-58,-56,-52,-52,-50,-50,-44,-42,-42,-32,-32,-30,-26,-22,-20,-20,-2,0,10,12,18,20,24,24,26,36,38,42,56,66,74,76,78,78,84,86,96,98},new int[]{-94,-94,-94,-80,-76,-74,-68,-56,-52,-50,-44,-42,-38,-36,-34,-28,-26,-24,-16,-2,0,4,8,14,16,20,22,32,34,38,46,46,48,50,52,54,62,64,66,66,72,76,78,78,80,82,82,84,94},new int[]{-98,-98,-90,-86,-80,-78,-76,-74,-74,-72,-72,-60,-58,-54,-50,-46,-32,-24,-22,-18,-18,-14,-12,-12,-10,-8,8,14,24,30,36,46,48,50,58,58,62,66,66,74,74,74,78,78,80,84,86,90,92},new int[]{-98,-94,-82,-80,-72,-64,-60,-58,-48,-46,-46,-40,-32,-26,-24,-16,-14,-12,-10,-8,-6,-4,-4,2,4,4,12,12,14,26,34,36,40,46,48,54,66,66,66,66,66,72,78,80,80,80,94,96,98},new int[]{-96,-92,-86,-72,-70,-70,-68,-68,-66,-64,-62,-56,-50,-44,-32,-30,-28,-24,-12,-4,-4,-4,2,10,16,18,18,22,32,32,36,36,40,42,46,46,50,50,50,50,52,54,64,68,70,72,74,90,96},new int[]{-98,-98,-98,-90,-86,-82,-64,-60,-58,-54,-48,-36,-36,-32,-30,-28,-18,-16,-14,-6,-2,4,6,6,10,12,14,18,24,32,34,46,48,50,52,58,66,68,70,80,80,82,84,84,86,92,94,96,98},new int[]{-98,-96,-88,-86,-86,-86,-86,-86,-84,-78,-78,-74,-72,-72,-70,-70,-70,-66,-64,-56,-42,-40,-38,-36,-34,-32,-30,-28,-26,-20,-8,-6,0,2,2,14,24,30,34,36,44,50,52,60,66,68,74,78,86},new int[]{-96,-86,-72,-72,-70,-70,-68,-68,-64,-58,-58,-58,-54,-54,-52,-48,-46,-40,-38,-28,-14,-10,-6,-4,0,10,10,12,16,18,18,20,20,22,34,34,40,40,46,46,58,58,62,66,68,68,72,84,92},new int[]{-96,-90,-88,-88,-82,-82,-76,-74,-70,-68,-62,-56,-52,-48,-46,-38,-22,-22,-16,-12,-8,0,4,8,14,20,22,24,28,34,36,38,44,46,48,58,66,68,68,76,84,84,86,86,88,88,90,92,94},new int[]{-96,-96,-96,-94,-90,-88,-88,-84,-76,-72,-72,-58,-54,-52,-52,-50,-40,-38,-32,-12,-12,-6,-4,-2,0,2,2,10,12,22,28,28,30,34,42,42,54,56,58,64,70,70,74,74,84,86,88,88,90},new int[]{-94,-92,-84,-82,-82,-70,-66,-64,-60,-60,-58,-58,-54,-52,-52,-42,-36,-32,-30,-28,-26,-24,-22,-20,-16,-12,0,4,6,8,14,20,30,32,46,54,60,62,62,64,66,68,68,70,70,72,72,76,88},new int[]{-90,-90,-90,-88,-88,-86,-78,-68,-62,-62,-60,-54,-54,-48,-48,-36,-36,-32,-28,-28,-22,-20,-6,-2,4,6,8,10,14,24,28,28,28,34,34,36,44,52,54,54,66,70,70,72,78,80,84,88,88},new int[]{-98,-94,-94,-90,-84,-76,-72,-70,-68,-68,-60,-54,-54,-48,-46,-46,-44,-34,-28,-28,-26,-12,-8,-4,2,6,6,8,14,32,32,38,38,40,44,46,46,50,50,52,54,58,60,62,70,78,86,92,92},new int[]{-98,-94,-94,-92,-90,-86,-82,-76,-74,-74,-66,-66,-66,-60,-60,-60,-56,-54,-50,-38,-30,-28,-18,-16,-16,-2,0,6,14,16,16,18,28,30,30,32,34,40,46,52,52,54,60,70,82,84,88,90,94},new int[]{-96,-88,-84,-80,-78,-78,-78,-68,-62,-60,-52,-44,-36,-36,-36,-34,-32,-32,-30,-26,-22,-14,-10,-6,-4,-4,0,0,0,10,12,14,14,16,24,34,38,44,52,54,54,56,58,60,64,66,66,92,98},new int[]{-98,-88,-80,-80,-74,-72,-70,-68,-64,-62,-62,-62,-58,-56,-52,-50,-50,-46,-34,-30,-30,-26,-18,-12,4,10,14,22,24,30,32,38,42,42,46,56,56,58,68,72,80,82,86,90,90,92,96,98,98},new int[]{-96,-92,-92,-90,-90,-90,-88,-82,-82,-82,-80,-68,-64,-60,-50,-34,-30,-16,-10,-10,-8,-4,-4,-2,0,18,20,24,24,24,30,30,36,38,38,40,42,42,44,48,52,52,56,76,84,88,92,94,98},new int[]{-98,-90,-82,-80,-74,-74,-72,-72,-72,-72,-64,-60,-56,-56,-56,-52,-40,-38,-24,-20,-18,-18,-12,-10,-6,10,18,22,24,24,26,26,30,34,40,40,44,50,58,60,62,64,70,76,80,80,86,88,96},new int[]{-96,-94,-86,-82,-72,-68,-68,-64,-62,-56,-54,-50,-50,-48,-44,-26,-20,-16,-10,-8,-6,6,8,10,10,10,16,20,28,28,32,40,42,44,44,46,46,48,58,62,72,76,80,84,86,88,92,96,98},new int[]{-96,-94,-94,-94,-92,-92,-90,-84,-82,-78,-76,-74,-74,-62,-58,-58,-58,-42,-42,-22,-20,-14,-14,-12,-4,-2,4,4,4,8,16,20,24,26,32,40,42,46,52,54,56,56,60,60,62,62,82,90,96},new int[]{-98,-96,-96,-76,-70,-66,-54,-54,-52,-50,-46,-40,-36,-34,-32,-30,-28,-28,-26,-26,-22,-20,-18,-6,6,10,20,22,28,30,30,32,32,34,38,42,46,54,58,70,76,76,84,90,94,94,98,98,98},new int[]{-90,-86,-82,-72,-70,-70,-66,-62,-60,-58,-54,-54,-40,-36,-32,-30,-28,-26,-26,-24,-16,-14,-10,-8,-8,-8,-8,4,6,8,14,16,18,18,22,26,30,58,66,82,84,92,92,94,96,96,96,96,98},new int[]{-92,-86,-80,-74,-68,-66,-64,-64,-52,-44,-36,-34,-32,-30,-26,-22,-20,-18,-14,-12,-8,2,10,10,12,16,24,32,32,44,46,48,52,52,54,66,68,70,72,74,82,84,88,90,94,94,96,96,96},new int[]{-92,-90,-80,-78,-78,-78,-74,-66,-50,-50,-46,-46,-44,-44,-40,-38,-34,-32,-32,-30,-18,-18,-16,-14,-12,4,10,10,10,18,20,20,22,24,24,26,26,46,46,48,48,52,58,62,64,72,80,96,96},new int[]{-98,-96,-94,-92,-88,-86,-84,-82,-76,-76,-60,-58,-58,-58,-56,-50,-48,-38,-34,-30,-20,-16,-16,-10,-4,-2,10,12,18,26,32,34,48,48,52,64,64,68,70,74,76,78,80,90,92,92,92,94,96},new int[]{-96,-88,-88,-82,-76,-70,-62,-58,-56,-48,-48,-38,-36,-30,-18,-18,-16,-16,-14,-12,-6,4,8,10,10,12,14,24,28,28,34,38,44,50,58,60,62,66,66,72,74,76,76,78,78,84,86,88,96},new int[]{-98,-94,-94,-94,-90,-86,-78,-74,-68,-66,-62,-58,-56,-54,-52,-52,-48,-44,-44,-44,-30,-26,-26,-12,-4,2,4,4,6,6,12,12,14,16,16,22,22,30,30,34,36,42,50,50,64,70,80,88,98},new int[]{-98,-96,-96,-94,-88,-84,-58,-56,-52,-48,-44,-30,-26,-26,-20,-18,-16,-8,-8,-8,-6,-6,-4,-4,-2,0,6,12,12,14,24,34,42,46,48,56,60,62,62,72,72,80,84,88,88,90,90,94,96},new int[]{-98,-90,-82,-78,-70,-68,-64,-62,-56,-52,-50,-44,-44,-42,-36,-26,-24,-22,-12,-10,-6,-4,0,2,6,10,18,32,32,36,38,42,48,52,54,56,62,64,66,66,66,66,70,72,74,74,78,86,92},new int[]{-96,-90,-88,-78,-74,-72,-70,-68,-66,-60,-58,-56,-56,-50,-50,-44,-36,-26,-24,-18,-16,-16,-12,-6,2,6,8,10,10,18,18,22,24,26,42,46,64,64,66,72,74,74,76,88,94,94,96,98,98},new int[]{-94,-82,-78,-78,-76,-64,-64,-58,-58,-56,-56,-52,-44,-42,-38,-36,-22,-16,-14,-6,-2,4,4,8,8,12,14,14,14,16,16,22,30,34,38,42,44,58,62,66,66,68,76,78,80,80,84,90,98}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0,0,0,1,0,0,0,0},new int[]{0,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,0,0,0},new int[]{0,0,1,0,0,1,1,1,0,0,1,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,1,0,1,0,0,1,0,0,1,0,1,1,0},new int[]{0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,1,0,1,1,1,1,0,1,0,1,0,1,0,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,0},new int[]{0,1,0,1,1,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,0,1,1,0,1,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,1,0,1,0,0},new int[]{0,0,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,0,1,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,0,0,0},new int[]{1,1,0,1,0,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,1,0,1,1,0,0},new int[]{0,1,1,1,1,0,1,1,1,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,1},new int[]{1,1,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0,0,1,1,1,0,0,1,1,0,0,0,1},new int[]{0,0,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,0,1},new int[]{0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,0,1,1,1,1,0,0,0},new int[]{1,1,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,1,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0},new int[]{1,0,1,0,0,1,0,0,0,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1,0,1,0},new int[]{0,0,1,0,0,1,1,0,0,1,1,0,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,1,0,0,1,1,0,1,0,1,0,1},new int[]{1,1,0,1,1,0,1,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,1,0,0,1,1},new int[]{0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,1,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,0,0,1,1},new int[]{1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,0,1,0},new int[]{1,1,1,0,0,0,1,1,0,0,1,0,1,0,0,0,0,0,0,1,0,1,0,0,0,1,1,1,1,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,0,1},new int[]{0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,1,0,0},new int[]{1,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,1,0,1,1,1,1,1,1,1,0,1,0,1,0,1,1,1,0,0,1,1,1,1,1,0},new int[]{1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1,0},new int[]{1,1,0,0,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,0},new int[]{1,0,1,1,0,1,1,0,0,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1},new int[]{1,0,1,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,1,0,0,1,1,1,0},new int[]{1,1,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,0,0,0,1,1,1,0,1,0,0,1,0,0,1,0,1,1,0,0,0,0,0,0,1,0,1,1,0},new int[]{0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,0,1,0,0,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,0},new int[]{0,1,0,1,1,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0},new int[]{1,1,0,0,1,0,0,1,1,0,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,0,0,1,1,1,1,0,1,1,0},new int[]{1,1,1,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,1},new int[]{1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,0},new int[]{1,1,1,1,1,0,0,1,1,0,1,1,0,1,1,1,0,0,1,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,0,0,0,0,1,1,0,1,1,1},new int[]{0,1,1,0,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,1,0,1,0,0,0,0,0},new int[]{0,1,0,0,0,1,0,0,1,0,1,1,0,0,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,0,0,1,0,0,1},new int[]{1,1,0,0,0,0,0,0,1,0,1,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,1,1,0,0,1,0,0,0,1,1},new int[]{0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,1,1,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,1,0,1,0,0,1,1,0,0,1,1,0},new int[]{0,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,0,0,0,0,1,1,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,0,0,1,1,0,0,1,0},new int[]{0,1,1,1,0,0,0,0,0,0,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,1,0,1,1,1,1},new int[]{1,0,1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,1,0,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,0,1,1,1,0,0,0,1,0,1},new int[]{1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,1,1,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,1},new int[]{0,0,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1,1,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,0},new int[]{1,1,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,1,0,0,0,0,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0},new int[]{0,0,1,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,1,1,1,0,1,1,0,1,1},new int[]{0,0,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0,0,1,0,1,1,0,1},new int[]{0,1,1,1,0,0,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0,0,1},new int[]{0,0,0,0,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1},new int[]{0,0,1,1,1,1,0,1,0,1,1,0,1,1,0,0,0,1,1,1,0,1,0,0,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0,1}}); param0.add(new int[][]{new int[]{13,16,26,38,44,71,73},new int[]{16,28,39,47,48,59,61},new int[]{15,30,50,59,60,89,90},new int[]{24,61,63,71,72,76,83},new int[]{14,36,39,42,64,76,77},new int[]{4,6,11,24,34,36,58},new int[]{22,35,63,70,81,91,98}}); param0.add(new int[][]{new int[]{-48,-22,-52,-86,-22},new int[]{-54,-6,-16,-84,-34},new int[]{-46,-16,-80,-82,-38},new int[]{-44,98,-54,-32,-88},new int[]{42,52,38,-20,-36}}); param0.add(new int[][]{new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1}}); param0.add(new int[][]{new int[]{62,15,2,68,63,42,57,46,37,30,1,51,47,75,50,24,48,56,93,9,50,79,58,74,81,64,63,60,49,24,46,55,89,10,49,46,17,86,24,51,69,21,16,97,66,14},new int[]{95,91,93,6,64,52,1,29,77,42,16,76,40,30,32,7,36,72,1,94,12,25,11,75,52,95,64,4,54,78,40,67,81,92,5,42,65,94,59,12,35,75,82,83,72,47},new int[]{69,96,79,34,12,8,27,58,49,56,43,17,26,87,1,19,99,48,80,25,56,40,42,63,92,27,76,55,15,2,30,81,79,4,15,52,21,94,80,27,93,33,44,20,45,34},new int[]{18,47,49,73,19,87,86,72,52,21,36,27,96,2,87,35,22,20,97,92,69,13,15,95,80,58,84,66,56,12,57,36,90,25,14,43,43,80,2,53,42,65,52,42,5,48},new int[]{85,40,51,5,9,71,80,70,2,18,87,36,78,90,57,60,27,92,15,64,47,22,99,53,87,28,97,94,28,83,64,10,10,34,30,90,17,87,31,7,29,68,29,69,47,35},new int[]{15,32,84,9,45,6,37,97,12,69,91,45,39,58,49,85,76,2,48,71,81,88,16,71,49,32,68,5,23,65,93,47,88,59,43,43,36,59,52,77,1,25,36,86,26,42},new int[]{39,15,66,15,13,29,80,10,75,3,21,65,41,19,76,82,64,55,63,46,24,94,40,75,24,20,2,86,90,24,53,70,65,90,45,70,96,98,68,60,12,31,27,57,63,17},new int[]{79,58,4,37,50,72,71,69,45,86,47,25,98,59,63,16,13,97,66,2,8,13,4,54,96,1,80,3,35,15,62,20,74,58,80,65,85,37,74,6,93,29,10,19,80,61},new int[]{53,59,23,20,92,20,65,17,71,81,41,50,37,86,75,62,21,49,59,34,56,94,41,71,70,94,44,6,25,19,37,3,13,39,86,98,19,30,52,26,35,25,65,74,9,69},new int[]{15,92,20,89,35,8,50,32,17,2,21,64,76,26,9,49,25,63,17,51,58,1,97,3,28,80,11,89,23,86,9,27,5,52,31,62,77,63,86,41,59,19,28,78,6,63},new int[]{76,97,67,74,17,13,95,60,16,63,87,95,84,66,82,69,80,44,54,32,29,37,47,62,78,79,45,10,63,11,20,53,95,72,40,75,89,81,1,37,56,15,85,93,84,9},new int[]{72,60,72,79,28,8,48,76,89,84,89,46,42,83,65,90,71,93,64,50,55,88,66,29,6,6,47,99,61,98,24,57,4,83,56,56,46,21,46,33,78,85,15,28,80,33},new int[]{49,8,68,50,35,16,35,44,22,80,94,48,98,13,43,79,28,68,15,99,5,27,62,63,85,66,55,31,44,48,73,58,71,50,94,22,19,79,76,13,97,27,91,19,47,12},new int[]{52,75,69,55,13,16,39,7,82,28,77,88,84,98,47,21,21,43,40,92,82,92,33,94,3,21,42,47,89,40,59,78,13,97,62,96,74,69,95,73,90,11,67,10,48,47},new int[]{37,21,84,6,27,11,42,18,62,58,81,7,9,71,77,38,69,12,16,61,2,44,81,71,2,99,22,38,30,51,39,11,62,73,95,74,13,87,33,17,23,8,90,45,36,73},new int[]{80,14,37,80,75,12,38,69,25,91,72,14,3,36,97,93,61,20,22,9,56,89,37,99,9,50,59,95,67,25,48,36,91,66,48,61,71,13,50,54,51,29,58,48,14,19},new int[]{64,64,97,27,3,7,54,36,57,24,82,5,83,49,78,87,87,93,70,62,68,26,40,84,82,76,98,27,41,71,23,56,3,46,85,39,62,92,73,74,16,79,40,24,91,63},new int[]{88,29,39,88,15,76,44,40,66,67,26,9,61,5,24,71,8,56,35,89,71,12,72,54,26,84,57,58,46,73,92,24,20,59,70,86,84,15,98,51,29,15,74,7,19,64},new int[]{14,46,80,84,53,57,50,32,23,48,35,83,89,10,67,51,96,63,84,18,6,41,48,79,66,17,17,45,51,7,65,79,29,34,92,17,45,36,2,36,66,30,65,4,55,61},new int[]{23,37,69,52,89,17,78,39,81,83,94,61,33,11,46,34,27,35,55,1,22,99,91,24,56,28,70,88,23,48,77,57,57,72,69,79,95,58,37,68,17,66,11,82,97,20},new int[]{24,46,12,76,76,15,6,97,22,95,83,52,69,59,17,24,54,85,60,41,2,84,71,76,71,27,36,54,79,32,66,65,27,15,39,30,38,58,6,66,73,31,73,74,64,51},new int[]{71,37,75,62,93,88,55,77,22,54,67,34,50,89,66,77,17,54,1,53,83,3,74,37,41,38,48,39,25,46,72,61,70,77,7,58,5,77,60,64,95,22,81,95,53,14},new int[]{52,25,79,20,16,26,40,49,23,82,56,61,40,89,99,58,90,17,22,20,1,14,5,99,34,63,71,7,51,56,8,3,8,39,45,90,97,24,45,77,51,57,41,59,47,15},new int[]{98,5,15,87,54,20,2,88,73,98,90,4,79,94,74,26,3,91,65,28,25,93,61,63,3,97,15,40,1,79,88,71,15,55,94,93,38,56,10,41,68,28,85,74,71,19},new int[]{10,27,56,25,36,22,54,74,28,72,53,19,66,49,49,56,94,55,24,82,54,66,1,7,37,45,49,85,34,51,91,74,64,28,87,81,39,42,93,60,43,10,85,12,7,62},new int[]{73,51,16,10,70,67,50,75,37,60,45,31,57,94,44,51,23,74,16,79,78,57,63,90,28,24,63,5,61,2,20,86,57,46,42,5,34,72,35,68,37,6,19,15,48,93},new int[]{70,43,61,32,77,46,11,98,66,70,44,73,51,53,55,69,54,3,65,25,75,37,47,44,78,78,3,98,73,71,34,54,80,69,20,35,1,27,42,18,93,96,60,9,80,57},new int[]{2,31,55,74,66,86,59,31,40,18,55,86,79,74,45,19,83,26,24,28,15,34,34,28,66,68,94,87,19,66,67,48,38,39,67,75,23,28,23,10,65,75,50,23,85,55},new int[]{91,22,56,89,33,23,8,81,56,97,2,88,94,38,61,8,56,85,68,31,99,30,75,61,23,68,10,95,53,57,55,42,48,97,23,40,61,99,30,54,18,66,83,58,6,35},new int[]{46,84,95,99,63,16,14,13,55,83,6,77,77,40,1,85,53,14,66,46,99,67,42,55,11,27,40,38,81,54,80,3,52,77,5,22,75,50,95,54,88,27,1,85,6,60},new int[]{38,32,53,70,13,71,48,20,37,38,25,23,58,93,34,66,47,71,50,64,11,60,45,49,57,25,42,75,78,97,58,31,83,60,53,72,45,71,22,43,79,1,81,8,62,39},new int[]{53,8,61,2,80,52,70,9,47,23,87,99,41,89,23,54,5,50,50,96,51,30,41,93,90,77,30,4,63,52,89,30,72,96,75,55,74,12,67,62,3,38,53,62,80,80},new int[]{88,65,51,42,27,28,91,20,8,18,46,12,36,12,41,29,31,18,27,84,84,83,96,70,2,3,40,53,1,39,16,29,8,23,38,71,89,87,92,83,83,57,3,64,62,51},new int[]{76,38,28,18,53,19,90,48,7,74,89,6,10,5,29,51,59,32,33,66,4,90,39,9,90,77,35,48,29,58,35,14,72,89,17,75,45,8,54,58,40,65,6,90,26,47},new int[]{93,31,76,38,69,20,19,44,28,53,95,64,50,11,27,64,77,18,24,1,46,8,77,72,48,14,87,28,54,9,63,68,67,59,37,20,17,74,6,30,49,65,50,80,75,77},new int[]{76,40,73,71,21,7,8,38,60,4,40,32,18,36,82,31,29,74,73,19,51,98,46,74,98,53,24,66,7,14,71,95,4,86,60,14,80,28,34,18,49,68,76,55,72,35},new int[]{66,6,48,50,62,34,10,41,14,93,60,58,8,51,31,89,42,67,29,75,90,98,58,4,87,82,29,27,38,13,70,4,40,30,81,29,57,61,90,10,82,36,9,32,45,87},new int[]{76,45,58,23,90,81,1,48,12,36,90,35,36,83,19,6,17,6,90,88,26,12,53,49,23,13,52,17,30,92,22,83,64,1,82,71,67,30,54,67,64,93,93,8,45,71},new int[]{65,37,45,41,91,59,22,56,29,22,12,44,56,7,73,87,77,98,9,38,37,62,86,66,53,64,73,86,8,20,8,3,46,51,11,53,50,57,26,93,80,41,34,70,82,82},new int[]{77,1,52,73,66,59,96,50,60,63,38,44,26,95,62,99,37,34,8,44,31,10,82,75,82,92,54,61,3,52,55,7,48,22,43,71,50,96,27,56,44,66,48,25,27,22},new int[]{5,86,67,70,46,7,43,52,7,19,85,27,99,55,1,48,16,41,2,47,59,51,21,19,80,80,8,41,51,75,74,49,54,48,73,15,69,24,96,19,97,23,28,90,60,50},new int[]{76,65,97,12,56,95,81,27,85,46,42,56,77,90,55,6,91,41,81,93,62,83,56,21,31,28,10,28,47,92,29,85,9,30,94,62,88,86,52,16,30,50,47,1,51,11},new int[]{83,14,96,9,59,84,27,94,5,20,93,58,99,71,9,5,78,38,97,97,42,88,50,51,28,64,62,32,22,50,18,57,12,61,86,72,35,53,64,42,90,32,46,84,82,65},new int[]{28,99,16,15,46,15,57,32,82,90,2,29,28,8,41,33,74,61,87,64,7,51,79,30,70,33,88,9,24,7,61,22,5,12,37,19,91,38,55,23,54,62,82,8,44,73},new int[]{30,77,76,3,41,88,95,36,78,76,33,86,54,38,92,36,65,99,67,8,72,33,71,88,8,63,43,89,57,6,20,74,52,50,61,66,52,3,3,60,28,6,90,51,60,15},new int[]{32,86,94,46,87,40,20,75,67,86,63,63,48,42,81,69,30,11,45,18,58,68,58,79,95,51,81,1,88,58,49,75,89,60,52,24,80,70,47,17,45,94,69,17,11,97}}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{31,50,50,68,69,80,87}); param1.add(new int[]{-74,-50,-90,-52,96,78,-16,14,-14,66,-50,74,-34,-88,84,80,34,18,-38,62,56,-48,-22,94,94,94,92,-46,-32,10,-48,46,20,80,32,30,88,60}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{23,36,42,49,50,88,97,51,1,27,4,72,11,61,24,49,75,29,96,16,11,65,13,22,13,23,84,23,20,63,35,76,22}); param1.add(new int[]{-96,-90,-90,-86,-86,-86,-84,-76,-76,-74,-72,-70,-52,-50,-34,-32,-26,-20,-16,-14,-10,-8,-8,-6,4,12,14,16,18,24,26,32,34,38,42,42,48,48,48,48,64,66,70,76,76,82,86,86,96}); param1.add(new int[]{0,1,1,1,1,0,1,1,1,0,0,0,0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,1,1,0,1,1,0,0,0}); param1.add(new int[]{3,9,32,55,78,85,90}); param1.add(new int[]{48,-68,0,-54,-80}); param1.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1}); param1.add(new int[]{19,39,31,50,61,70,43,64,45,82,49,80,21,37,96,30,42,82,96,30,22,26,42,88,57,12,59,58,83,64,66,2,37,60,5,76,20,81,10,57,70,74,65,72,15,84}); List<Integer> param2 = new ArrayList<>(); param2.add(6); param2.add(25); param2.add(28); param2.add(25); param2.add(37); param2.add(43); param2.add(5); param2.add(4); param2.add(7); param2.add(34); List<Integer> param3 = new ArrayList<>(); param3.add(5); param3.add(20); param3.add(28); param3.add(30); param3.add(38); param3.add(32); param3.add(3); param3.add(4); param3.add(10); param3.add(25); List<Integer> param4 = new ArrayList<>(); param4.add(4); param4.add(25); param4.add(32); param4.add(19); param4.add(26); param4.add(35); param4.add(3); param4.add(3); param4.add(9); param4.add(32); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT{ static int f_gold ( int dp [ ] [ ] , int a [ ] , int low , int high , int turn ) { if ( low == high ) { return a [ low ] * turn ; } if ( dp [ low ] [ high ] != 0 ) { return dp [ low ] [ high ] ; } dp [ [MASK] ] [ high ] = Math . max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , high - 1 , turn + 1 ) ) ; return dp [ low ] [ high ] ; } ] [ high ] = Math . max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , high - 1 , turn + 1 ) ) ; return dp [ low ] [ high ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{23,37,54,57,59,75,97},new int[]{9,15,34,39,80,96,99},new int[]{15,25,26,31,43,47,93},new int[]{22,31,37,44,54,62,91},new int[]{7,19,32,56,57,70,81},new int[]{16,37,49,77,81,82,85},new int[]{44,48,64,74,79,89,99}}); param0.add(new int[][]{new int[]{-24,-34,-86,-16,-34,14,76,4,18,60,-4,-24,46,-26,-74,6,50,-34,8,-30,-62,56,-78,-50,76,-98,-64,-72,-76,46,-70,4,-92,-18,10,-76,78,-26},new int[]{-34,-30,-96,-4,76,48,-10,96,-88,96,90,40,-24,68,-42,-48,-30,-32,-44,-50,-98,34,-78,-52,-88,-38,54,-64,-94,-48,-80,-2,-90,-14,-8,90,-78,-36},new int[]{30,-80,-58,48,-80,-78,40,-48,-40,-84,2,44,72,6,78,-84,-30,-70,32,86,16,68,40,-36,80,-46,66,-92,8,72,-56,58,-72,44,40,6,66,-66},new int[]{16,-72,-66,-30,66,-94,36,-34,-78,14,-74,-54,48,6,-40,-40,-24,-6,18,-20,-88,-8,82,-56,-96,-32,30,-22,70,-4,98,-40,-72,66,-54,-60,52,66},new int[]{-28,-52,90,-52,12,98,42,-52,38,-60,-28,94,86,-22,-62,68,12,92,-82,18,-2,82,-28,72,-78,-70,40,-54,-24,-68,-74,-40,-32,14,88,94,-46,-14},new int[]{-38,-30,62,-52,54,56,12,32,-78,24,38,-82,6,-64,-96,-56,-30,62,-94,-26,-64,-38,96,72,54,-56,56,82,6,-30,94,80,-68,18,84,58,-48,-34},new int[]{82,-44,14,-26,-14,-92,62,-48,-52,26,-30,-76,-26,28,54,-16,-60,16,-76,-90,20,-8,56,-86,66,-84,92,-52,90,30,38,-2,90,-50,88,44,-66,-80},new int[]{-22,68,62,-84,-76,-12,82,70,-58,86,20,-66,96,-28,6,60,-90,52,-28,8,34,90,38,24,76,-22,6,16,-46,-4,84,-6,6,30,50,26,8,-8},new int[]{34,-62,-26,18,-14,42,-50,72,16,-62,-76,32,-20,82,8,74,60,-60,-16,-50,-38,-88,68,-26,66,-14,64,42,98,40,-56,28,-96,36,-82,-74,38,-26},new int[]{-66,-58,-84,16,-42,4,-38,-6,-32,-98,20,-96,60,-38,24,-8,-74,52,98,52,-10,-24,-22,78,-20,58,-24,-98,-76,0,-94,6,28,42,20,-36,68,-68},new int[]{-20,70,-80,68,-26,-26,-22,88,86,12,-98,-80,2,-22,-2,2,-52,-50,30,12,74,34,-14,-54,70,16,-76,-56,16,-50,-14,-4,30,48,-14,84,-34,30},new int[]{68,68,-86,66,-64,60,-28,52,14,-40,-98,22,-30,28,-48,-76,66,94,-28,32,88,86,-76,-4,68,-56,76,-4,36,16,-4,8,-44,-84,74,74,96,-22},new int[]{-14,-88,-52,-72,-60,-50,32,86,14,-26,36,-84,38,80,-86,-64,14,-96,86,-52,-48,-16,-78,-66,-10,-24,70,22,90,46,-74,36,-74,2,96,6,4,34},new int[]{-34,72,-40,34,-30,18,54,-50,0,94,-62,80,4,84,10,98,56,-36,-94,88,10,-30,90,-52,14,-46,30,82,-66,8,-98,86,-90,46,-44,-92,22,58},new int[]{70,-44,-28,-78,-62,-78,-96,-6,-92,-86,-82,72,-50,26,-4,82,-42,58,28,-88,98,-98,-14,72,-24,58,72,-72,6,-78,34,-34,58,-62,78,-98,0,50},new int[]{84,48,-82,-32,-22,16,-34,-28,-76,40,26,30,70,28,-64,-90,70,-90,82,60,10,-52,0,50,-38,-32,-18,2,48,20,-96,4,62,-28,28,-12,50,-90},new int[]{64,58,-34,10,-44,-72,62,70,60,84,-12,-46,-82,-12,80,46,44,-58,-18,10,44,50,-60,-20,82,-10,18,-4,48,22,-14,12,-76,-32,8,-60,-54,-6},new int[]{22,-58,58,-24,-58,-64,62,-38,-36,44,-82,46,-78,54,96,24,84,90,-2,-98,-74,8,44,-94,84,48,-2,66,-44,52,-42,-36,34,-98,-6,54,26,18},new int[]{-28,30,-66,-14,-20,-44,-62,-20,90,-92,-38,64,44,-60,90,-60,-82,36,-46,52,-60,26,12,80,-64,92,-22,-68,-10,54,-96,44,70,10,4,-4,-94,66},new int[]{-70,54,-32,92,-26,-66,28,-98,-14,-20,40,-36,-6,-60,-36,-32,26,90,34,-34,82,48,-82,-8,-86,-74,-58,-68,-68,-16,-26,-88,-6,-76,-12,-68,-98,-94},new int[]{14,-84,90,88,80,-28,-46,4,-4,36,-56,-44,68,24,24,70,36,-4,58,-78,14,-48,-46,58,-44,-66,72,-36,84,70,-26,72,76,30,-30,92,4,-40},new int[]{-24,-28,0,-44,-48,74,76,50,-88,36,-24,62,-34,82,-20,38,-76,16,-70,92,-82,56,72,78,40,52,-52,-38,36,-44,92,46,-60,-54,58,96,74,-18},new int[]{70,-30,-62,-74,-88,-92,72,-42,34,76,-4,-94,22,-82,56,2,44,-64,-88,-20,96,0,-12,-20,-40,-56,-8,18,-8,18,98,28,50,-14,72,50,4,38},new int[]{72,-66,16,-44,94,10,60,96,24,12,92,30,2,64,4,58,74,-24,-96,-52,72,10,-2,-18,-74,-2,70,-6,-60,72,-32,34,-78,-10,-2,-30,54,42},new int[]{80,92,18,54,-42,50,-62,76,94,38,84,78,44,98,78,-54,-36,-80,62,14,24,86,52,4,78,96,20,58,-64,-42,20,-98,-90,6,30,56,-66,-34},new int[]{-86,60,-62,-32,-12,92,-54,-2,8,58,68,42,-46,-8,82,-28,-96,62,46,-12,0,88,82,-26,-42,36,46,-46,54,-58,-58,-62,32,-48,-60,86,4,56},new int[]{88,-36,4,60,24,6,72,58,44,14,-40,-64,36,-92,36,-56,-78,86,80,80,-94,64,-4,-2,86,26,-98,-56,62,-56,-18,40,12,26,50,72,-16,-58},new int[]{-88,4,-66,64,42,94,54,-38,8,-18,-8,88,46,42,64,-88,94,58,-50,26,38,92,-66,82,8,38,-92,-32,50,-44,-88,-6,34,12,66,54,-52,-86},new int[]{20,-90,2,-94,-76,-28,-76,44,-12,-56,50,4,34,-88,46,2,60,52,22,98,-84,6,-26,-90,-4,48,-66,-42,58,-22,30,-22,-82,-50,42,84,94,4},new int[]{-56,4,-4,54,64,82,88,8,50,66,-2,80,-4,12,24,-56,-52,80,66,82,-66,-92,-42,-56,66,-92,-60,-92,-52,-54,32,22,-42,-46,-66,60,10,-62},new int[]{-44,0,6,-54,-98,72,-98,-28,-4,-86,-10,-76,-64,-66,58,60,24,90,-6,-54,-22,84,-34,64,36,18,14,-32,-88,-32,84,-8,60,98,28,-6,14,-88},new int[]{-94,-92,74,96,28,34,56,74,-62,-46,-8,10,-96,-72,50,-98,-28,72,2,46,68,14,-72,-78,-76,68,52,-30,-32,90,40,50,50,20,98,2,72,44},new int[]{-6,94,16,-70,-74,-46,22,24,44,-40,52,-50,94,-66,84,-66,14,-12,48,-6,64,-12,-44,-14,2,-48,-22,52,-28,-18,8,72,-28,68,44,-28,-20,62},new int[]{12,-94,-86,-52,-92,-76,-78,10,-8,30,34,26,-80,-8,68,92,66,16,-48,70,30,-56,-80,-78,58,94,-56,-12,56,-94,-60,-70,0,-94,6,36,48,-98},new int[]{74,72,20,-84,96,-84,40,-36,-88,-14,60,-70,36,-28,-18,-82,-36,92,-86,44,-16,-66,28,-88,-18,-52,66,-26,-90,-12,-16,80,-28,82,-92,82,-76,-80},new int[]{40,-38,-48,72,-30,70,-14,14,90,42,-6,52,-94,44,-32,-8,-74,80,-18,-10,74,-80,86,-82,-2,10,-12,58,-70,-18,86,40,62,76,88,68,68,4},new int[]{86,4,16,86,-66,72,-38,-40,-52,14,-60,-88,-44,-60,-64,84,-50,-78,-44,-18,78,74,-66,-64,18,26,74,98,-18,-96,-82,4,-74,-40,-50,-46,-4,94},new int[]{-70,-64,-10,-22,-88,-48,84,78,16,64,78,-48,66,-88,44,60,-10,-48,60,-40,86,-40,32,16,28,-30,32,-74,10,-34,38,-36,-30,2,14,-92,-48,88}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}}); param0.add(new int[][]{new int[]{84,65,61,9,50,58,19,98,63,92,42,82,5,55,81,77,1,92,74,40,13,59,48,51,18,42,34,78,41,82,13,6,92},new int[]{31,76,5,83,74,92,29,9,40,28,36,36,4,73,32,6,79,8,45,89,60,34,82,27,68,24,68,47,27,42,3,61,19},new int[]{56,19,38,73,69,25,38,90,20,50,27,8,1,84,9,44,54,64,8,74,19,52,40,9,75,66,58,8,40,46,55,54,75},new int[]{12,13,58,11,23,52,60,91,95,86,63,25,62,93,35,36,60,87,94,46,3,85,35,77,28,22,33,7,92,76,33,53,30},new int[]{2,4,55,27,47,76,45,70,34,36,5,2,50,24,32,85,81,34,5,35,56,72,21,39,58,90,49,75,74,49,76,22,30},new int[]{35,66,31,4,44,70,53,57,36,36,54,26,96,4,22,34,1,87,57,51,16,36,47,91,39,5,25,45,61,5,37,51,88},new int[]{45,98,42,35,56,86,16,75,9,32,14,92,40,25,24,29,5,1,75,13,3,8,71,79,96,33,22,13,30,20,41,84,59},new int[]{74,33,15,13,27,6,87,95,74,82,7,52,29,66,44,89,74,21,57,22,32,13,14,42,12,99,55,9,16,94,37,72,29},new int[]{64,47,16,76,77,39,94,53,65,65,80,12,25,14,6,77,66,12,37,63,78,17,32,16,22,7,40,25,8,27,32,55,39},new int[]{27,52,60,70,10,52,14,60,35,31,27,50,74,87,32,28,55,98,68,9,72,48,53,39,29,64,84,64,47,7,69,22,72},new int[]{89,58,93,44,1,12,98,64,65,97,36,4,84,47,49,77,81,11,30,3,69,73,30,68,73,10,96,40,71,57,3,81,46},new int[]{39,71,95,88,22,67,25,57,53,22,98,68,19,28,10,26,79,13,50,2,10,54,44,88,69,97,75,31,18,77,17,22,53},new int[]{85,17,87,79,24,25,49,13,15,16,36,98,41,78,77,89,31,91,20,85,51,29,55,94,69,16,85,91,83,9,66,96,16},new int[]{67,72,45,87,18,95,50,29,69,80,43,78,53,37,71,67,41,16,66,77,69,74,50,11,37,80,5,60,5,56,85,9,92},new int[]{92,36,57,21,48,29,77,51,52,74,68,1,18,60,70,47,98,75,81,17,12,74,1,52,50,21,30,24,17,56,29,65,18},new int[]{63,47,21,28,54,39,53,42,30,59,74,9,14,66,94,45,27,44,43,98,60,57,1,65,35,19,35,58,27,38,82,96,96},new int[]{29,64,7,9,34,80,65,45,40,56,95,7,32,36,9,70,83,73,92,73,20,19,65,27,87,2,88,64,48,71,20,57,11},new int[]{85,39,35,38,44,69,64,28,47,77,38,4,84,50,54,72,62,33,31,60,68,37,80,62,74,96,81,17,64,11,91,85,64},new int[]{45,96,40,46,4,53,91,75,80,53,8,29,93,10,11,48,15,96,80,13,47,23,81,23,41,59,28,37,6,16,46,49,89},new int[]{1,59,53,1,36,70,18,90,6,18,15,1,74,7,57,87,54,92,8,41,47,60,60,18,77,5,79,47,83,23,9,42,55},new int[]{45,22,54,33,86,86,2,52,34,74,17,40,78,5,77,8,52,13,8,24,27,97,9,8,28,91,74,98,99,8,18,12,85},new int[]{43,68,81,7,74,86,13,75,46,95,62,39,98,22,51,53,46,62,25,90,54,5,26,45,31,84,95,63,11,27,2,43,7},new int[]{20,68,7,65,20,49,16,59,39,68,20,43,2,37,39,14,90,45,94,31,68,94,88,72,80,95,1,88,19,93,21,71,27},new int[]{41,67,5,99,99,88,90,4,31,54,22,28,1,27,2,46,94,37,21,43,21,4,44,74,72,49,39,58,91,76,39,70,43},new int[]{23,23,33,86,60,69,14,39,49,89,1,32,65,67,62,63,16,70,59,20,53,50,8,93,52,75,77,20,16,13,92,16,18},new int[]{97,3,56,96,41,64,6,95,92,95,30,15,1,13,55,68,88,8,99,55,81,9,87,46,93,83,54,51,32,52,62,54,41},new int[]{81,13,63,13,67,97,51,72,40,49,87,12,24,92,46,46,45,38,95,67,51,51,88,62,71,66,32,57,23,27,21,13,52},new int[]{6,91,35,9,74,55,71,71,28,63,89,65,95,45,26,47,64,27,88,10,42,45,14,27,32,93,95,64,14,88,53,30,41},new int[]{55,51,89,7,37,36,89,43,26,78,33,2,21,94,58,40,95,46,68,89,38,75,97,58,78,12,6,57,18,3,96,61,17},new int[]{56,24,53,35,66,26,30,60,27,57,82,78,84,84,94,31,48,59,33,27,54,33,20,67,46,19,71,91,70,29,26,17,66},new int[]{85,48,88,33,78,98,69,3,81,70,80,66,84,61,48,17,8,25,8,29,82,59,62,1,58,71,74,86,8,94,15,22,79},new int[]{43,32,57,81,97,19,68,26,21,12,12,44,10,81,42,92,44,58,10,11,2,5,33,1,86,46,85,40,13,16,44,70,42},new int[]{31,28,33,90,54,30,46,18,1,95,73,79,87,16,87,39,92,26,85,75,42,56,11,78,50,6,63,77,46,77,45,35,83}}); param0.add(new int[][]{new int[]{-82,-82,-76,-74,-72,-70,-70,-68,-66,-56,-56,-50,-48,-44,-42,-38,-36,-32,-26,-20,-20,-18,-8,6,8,12,12,14,18,20,24,24,30,32,36,38,40,44,50,56,60,62,66,70,76,78,90,98,98},new int[]{-92,-80,-76,-70,-58,-58,-50,-48,-38,-36,-34,-32,-30,-30,-24,-20,-20,-18,-10,-10,-8,-6,-6,-6,-4,2,10,14,24,26,30,34,36,44,52,54,64,76,78,82,86,86,86,86,86,88,88,92,94},new int[]{-98,-94,-86,-82,-80,-76,-74,-74,-72,-70,-70,-68,-66,-62,-50,-50,-48,-42,-34,-24,-22,-22,2,8,8,10,12,22,22,26,26,26,30,38,44,54,56,58,68,68,72,78,80,80,84,88,92,94,98},new int[]{-92,-88,-84,-84,-82,-78,-78,-66,-60,-48,-48,-46,-42,-40,-40,-38,-36,-34,-30,-30,-26,-26,-22,-22,-20,-14,-12,6,28,36,38,44,46,46,48,50,52,52,56,58,60,70,80,80,80,86,92,96,98},new int[]{-98,-94,-80,-76,-72,-70,-70,-70,-68,-64,-64,-62,-60,-56,-54,-52,-50,-48,-46,-42,-40,-30,-28,-28,-24,-22,-6,-4,0,2,10,12,18,18,32,36,58,60,68,70,72,74,80,84,86,88,88,94,98},new int[]{-96,-96,-86,-84,-84,-72,-72,-70,-70,-66,-64,-60,-58,-58,-46,-38,-38,-28,-22,-18,-14,16,18,20,20,24,24,26,32,32,34,40,42,42,44,44,46,56,58,60,62,64,66,68,68,68,74,78,86},new int[]{-98,-92,-70,-58,-54,-50,-50,-50,-46,-40,-40,-36,-34,-24,-22,-22,-18,-8,-6,-6,-2,2,2,10,16,16,20,22,24,26,28,28,30,32,38,40,42,48,56,56,58,60,66,66,72,84,90,94,96},new int[]{-98,-90,-82,-80,-78,-78,-70,-66,-60,-54,-48,-48,-38,-28,-18,-16,-14,-12,-12,-10,-8,-4,-4,-4,-2,0,2,6,6,12,16,18,20,24,36,46,52,54,60,62,66,66,70,70,82,82,86,86,88},new int[]{-98,-90,-88,-86,-78,-76,-76,-70,-66,-60,-56,-56,-56,-54,-52,-46,-40,-28,-26,-22,-20,-20,-18,-14,-12,-8,0,18,18,28,34,36,36,36,38,46,50,54,56,56,60,66,70,72,74,74,80,80,82},new int[]{-98,-92,-90,-86,-84,-82,-78,-70,-66,-60,-58,-44,-42,-34,-32,-30,-24,-20,-16,-8,-4,8,8,14,14,14,14,20,20,32,38,42,52,62,62,66,68,70,72,72,78,78,78,78,84,96,98,98,98},new int[]{-90,-88,-82,-82,-82,-80,-74,-68,-68,-64,-58,-56,-54,-50,-42,-36,-32,-28,-20,-20,-20,-18,-16,-14,-6,-6,-2,6,8,10,20,24,26,32,38,44,46,48,56,56,58,60,64,68,74,80,88,92,96},new int[]{-96,-94,-88,-72,-72,-72,-70,-70,-64,-52,-46,-46,-44,-38,-34,-34,-28,-26,-20,-16,-14,-10,-8,-2,-2,2,6,8,10,30,34,34,36,44,52,58,60,70,72,72,74,76,76,80,90,92,92,94,98},new int[]{-98,-98,-96,-96,-84,-82,-80,-76,-62,-52,-46,-44,-44,-40,-38,-38,-36,-30,-22,-8,-4,-2,0,2,4,8,12,20,22,26,26,30,34,46,46,52,54,56,58,60,62,66,72,74,78,80,90,92,96},new int[]{-94,-94,-92,-92,-80,-80,-74,-64,-56,-54,-52,-50,-50,-42,-42,-42,-40,-36,-36,-32,-24,-16,-14,-4,0,2,4,10,12,16,22,24,26,28,28,30,40,46,48,56,58,62,62,62,80,88,88,96,98},new int[]{-96,-94,-94,-92,-84,-82,-80,-74,-70,-58,-54,-52,-52,-48,-44,-34,-34,-30,-28,-24,-14,-12,-4,-2,2,2,4,10,12,14,24,28,38,40,46,58,62,68,72,72,74,76,82,84,84,84,84,90,98},new int[]{-98,-90,-84,-82,-76,-70,-66,-62,-60,-60,-58,-56,-54,-54,-50,-50,-46,-40,-40,-38,-32,-24,-22,-22,-20,-12,-12,-8,6,6,8,8,8,22,26,40,42,50,50,50,50,56,64,86,92,92,94,94,96},new int[]{-92,-78,-74,-68,-66,-62,-62,-62,-60,-60,-54,-40,-36,-34,-34,-32,-22,-22,-18,-14,-12,-10,-6,-4,-2,0,12,14,18,28,32,32,38,44,48,50,52,52,60,64,66,66,82,86,90,90,94,94,96},new int[]{-96,-94,-92,-90,-88,-86,-84,-76,-74,-72,-72,-68,-66,-66,-58,-52,-50,-46,-42,-34,-32,-32,-30,-14,-10,-6,-6,-2,-2,10,14,20,30,30,34,36,36,38,38,42,44,50,52,64,68,82,90,90,98},new int[]{-98,-88,-82,-80,-80,-78,-76,-72,-70,-66,-66,-58,-56,-52,-52,-50,-50,-44,-42,-42,-32,-32,-30,-26,-22,-20,-20,-2,0,10,12,18,20,24,24,26,36,38,42,56,66,74,76,78,78,84,86,96,98},new int[]{-94,-94,-94,-80,-76,-74,-68,-56,-52,-50,-44,-42,-38,-36,-34,-28,-26,-24,-16,-2,0,4,8,14,16,20,22,32,34,38,46,46,48,50,52,54,62,64,66,66,72,76,78,78,80,82,82,84,94},new int[]{-98,-98,-90,-86,-80,-78,-76,-74,-74,-72,-72,-60,-58,-54,-50,-46,-32,-24,-22,-18,-18,-14,-12,-12,-10,-8,8,14,24,30,36,46,48,50,58,58,62,66,66,74,74,74,78,78,80,84,86,90,92},new int[]{-98,-94,-82,-80,-72,-64,-60,-58,-48,-46,-46,-40,-32,-26,-24,-16,-14,-12,-10,-8,-6,-4,-4,2,4,4,12,12,14,26,34,36,40,46,48,54,66,66,66,66,66,72,78,80,80,80,94,96,98},new int[]{-96,-92,-86,-72,-70,-70,-68,-68,-66,-64,-62,-56,-50,-44,-32,-30,-28,-24,-12,-4,-4,-4,2,10,16,18,18,22,32,32,36,36,40,42,46,46,50,50,50,50,52,54,64,68,70,72,74,90,96},new int[]{-98,-98,-98,-90,-86,-82,-64,-60,-58,-54,-48,-36,-36,-32,-30,-28,-18,-16,-14,-6,-2,4,6,6,10,12,14,18,24,32,34,46,48,50,52,58,66,68,70,80,80,82,84,84,86,92,94,96,98},new int[]{-98,-96,-88,-86,-86,-86,-86,-86,-84,-78,-78,-74,-72,-72,-70,-70,-70,-66,-64,-56,-42,-40,-38,-36,-34,-32,-30,-28,-26,-20,-8,-6,0,2,2,14,24,30,34,36,44,50,52,60,66,68,74,78,86},new int[]{-96,-86,-72,-72,-70,-70,-68,-68,-64,-58,-58,-58,-54,-54,-52,-48,-46,-40,-38,-28,-14,-10,-6,-4,0,10,10,12,16,18,18,20,20,22,34,34,40,40,46,46,58,58,62,66,68,68,72,84,92},new int[]{-96,-90,-88,-88,-82,-82,-76,-74,-70,-68,-62,-56,-52,-48,-46,-38,-22,-22,-16,-12,-8,0,4,8,14,20,22,24,28,34,36,38,44,46,48,58,66,68,68,76,84,84,86,86,88,88,90,92,94},new int[]{-96,-96,-96,-94,-90,-88,-88,-84,-76,-72,-72,-58,-54,-52,-52,-50,-40,-38,-32,-12,-12,-6,-4,-2,0,2,2,10,12,22,28,28,30,34,42,42,54,56,58,64,70,70,74,74,84,86,88,88,90},new int[]{-94,-92,-84,-82,-82,-70,-66,-64,-60,-60,-58,-58,-54,-52,-52,-42,-36,-32,-30,-28,-26,-24,-22,-20,-16,-12,0,4,6,8,14,20,30,32,46,54,60,62,62,64,66,68,68,70,70,72,72,76,88},new int[]{-90,-90,-90,-88,-88,-86,-78,-68,-62,-62,-60,-54,-54,-48,-48,-36,-36,-32,-28,-28,-22,-20,-6,-2,4,6,8,10,14,24,28,28,28,34,34,36,44,52,54,54,66,70,70,72,78,80,84,88,88},new int[]{-98,-94,-94,-90,-84,-76,-72,-70,-68,-68,-60,-54,-54,-48,-46,-46,-44,-34,-28,-28,-26,-12,-8,-4,2,6,6,8,14,32,32,38,38,40,44,46,46,50,50,52,54,58,60,62,70,78,86,92,92},new int[]{-98,-94,-94,-92,-90,-86,-82,-76,-74,-74,-66,-66,-66,-60,-60,-60,-56,-54,-50,-38,-30,-28,-18,-16,-16,-2,0,6,14,16,16,18,28,30,30,32,34,40,46,52,52,54,60,70,82,84,88,90,94},new int[]{-96,-88,-84,-80,-78,-78,-78,-68,-62,-60,-52,-44,-36,-36,-36,-34,-32,-32,-30,-26,-22,-14,-10,-6,-4,-4,0,0,0,10,12,14,14,16,24,34,38,44,52,54,54,56,58,60,64,66,66,92,98},new int[]{-98,-88,-80,-80,-74,-72,-70,-68,-64,-62,-62,-62,-58,-56,-52,-50,-50,-46,-34,-30,-30,-26,-18,-12,4,10,14,22,24,30,32,38,42,42,46,56,56,58,68,72,80,82,86,90,90,92,96,98,98},new int[]{-96,-92,-92,-90,-90,-90,-88,-82,-82,-82,-80,-68,-64,-60,-50,-34,-30,-16,-10,-10,-8,-4,-4,-2,0,18,20,24,24,24,30,30,36,38,38,40,42,42,44,48,52,52,56,76,84,88,92,94,98},new int[]{-98,-90,-82,-80,-74,-74,-72,-72,-72,-72,-64,-60,-56,-56,-56,-52,-40,-38,-24,-20,-18,-18,-12,-10,-6,10,18,22,24,24,26,26,30,34,40,40,44,50,58,60,62,64,70,76,80,80,86,88,96},new int[]{-96,-94,-86,-82,-72,-68,-68,-64,-62,-56,-54,-50,-50,-48,-44,-26,-20,-16,-10,-8,-6,6,8,10,10,10,16,20,28,28,32,40,42,44,44,46,46,48,58,62,72,76,80,84,86,88,92,96,98},new int[]{-96,-94,-94,-94,-92,-92,-90,-84,-82,-78,-76,-74,-74,-62,-58,-58,-58,-42,-42,-22,-20,-14,-14,-12,-4,-2,4,4,4,8,16,20,24,26,32,40,42,46,52,54,56,56,60,60,62,62,82,90,96},new int[]{-98,-96,-96,-76,-70,-66,-54,-54,-52,-50,-46,-40,-36,-34,-32,-30,-28,-28,-26,-26,-22,-20,-18,-6,6,10,20,22,28,30,30,32,32,34,38,42,46,54,58,70,76,76,84,90,94,94,98,98,98},new int[]{-90,-86,-82,-72,-70,-70,-66,-62,-60,-58,-54,-54,-40,-36,-32,-30,-28,-26,-26,-24,-16,-14,-10,-8,-8,-8,-8,4,6,8,14,16,18,18,22,26,30,58,66,82,84,92,92,94,96,96,96,96,98},new int[]{-92,-86,-80,-74,-68,-66,-64,-64,-52,-44,-36,-34,-32,-30,-26,-22,-20,-18,-14,-12,-8,2,10,10,12,16,24,32,32,44,46,48,52,52,54,66,68,70,72,74,82,84,88,90,94,94,96,96,96},new int[]{-92,-90,-80,-78,-78,-78,-74,-66,-50,-50,-46,-46,-44,-44,-40,-38,-34,-32,-32,-30,-18,-18,-16,-14,-12,4,10,10,10,18,20,20,22,24,24,26,26,46,46,48,48,52,58,62,64,72,80,96,96},new int[]{-98,-96,-94,-92,-88,-86,-84,-82,-76,-76,-60,-58,-58,-58,-56,-50,-48,-38,-34,-30,-20,-16,-16,-10,-4,-2,10,12,18,26,32,34,48,48,52,64,64,68,70,74,76,78,80,90,92,92,92,94,96},new int[]{-96,-88,-88,-82,-76,-70,-62,-58,-56,-48,-48,-38,-36,-30,-18,-18,-16,-16,-14,-12,-6,4,8,10,10,12,14,24,28,28,34,38,44,50,58,60,62,66,66,72,74,76,76,78,78,84,86,88,96},new int[]{-98,-94,-94,-94,-90,-86,-78,-74,-68,-66,-62,-58,-56,-54,-52,-52,-48,-44,-44,-44,-30,-26,-26,-12,-4,2,4,4,6,6,12,12,14,16,16,22,22,30,30,34,36,42,50,50,64,70,80,88,98},new int[]{-98,-96,-96,-94,-88,-84,-58,-56,-52,-48,-44,-30,-26,-26,-20,-18,-16,-8,-8,-8,-6,-6,-4,-4,-2,0,6,12,12,14,24,34,42,46,48,56,60,62,62,72,72,80,84,88,88,90,90,94,96},new int[]{-98,-90,-82,-78,-70,-68,-64,-62,-56,-52,-50,-44,-44,-42,-36,-26,-24,-22,-12,-10,-6,-4,0,2,6,10,18,32,32,36,38,42,48,52,54,56,62,64,66,66,66,66,70,72,74,74,78,86,92},new int[]{-96,-90,-88,-78,-74,-72,-70,-68,-66,-60,-58,-56,-56,-50,-50,-44,-36,-26,-24,-18,-16,-16,-12,-6,2,6,8,10,10,18,18,22,24,26,42,46,64,64,66,72,74,74,76,88,94,94,96,98,98},new int[]{-94,-82,-78,-78,-76,-64,-64,-58,-58,-56,-56,-52,-44,-42,-38,-36,-22,-16,-14,-6,-2,4,4,8,8,12,14,14,14,16,16,22,30,34,38,42,44,58,62,66,66,68,76,78,80,80,84,90,98}}); param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0,0,0,1,0,0,0,0},new int[]{0,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,0,0,0},new int[]{0,0,1,0,0,1,1,1,0,0,1,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,1,0,1,0,0,1,0,0,1,0,1,1,0},new int[]{0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,1,0,1,1,1,1,0,1,0,1,0,1,0,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,0},new int[]{0,1,0,1,1,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,0,1,1,0,1,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,1,0,1,0,0},new int[]{0,0,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,0,1,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,0,0,0},new int[]{1,1,0,1,0,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,1,0,1,1,0,0},new int[]{0,1,1,1,1,0,1,1,1,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,1},new int[]{1,1,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0,0,1,1,1,0,0,1,1,0,0,0,1},new int[]{0,0,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,0,1},new int[]{0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,0,1,1,1,1,0,0,0},new int[]{1,1,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,1,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0},new int[]{1,0,1,0,0,1,0,0,0,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1,0,1,0},new int[]{0,0,1,0,0,1,1,0,0,1,1,0,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,1,0,0,1,1,0,1,0,1,0,1},new int[]{1,1,0,1,1,0,1,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,1,0,0,1,1},new int[]{0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,1,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,0,0,1,1},new int[]{1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,0,1,0},new int[]{1,1,1,0,0,0,1,1,0,0,1,0,1,0,0,0,0,0,0,1,0,1,0,0,0,1,1,1,1,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,0,1},new int[]{0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,1,0,0},new int[]{1,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,1,0,1,1,1,1,1,1,1,0,1,0,1,0,1,1,1,0,0,1,1,1,1,1,0},new int[]{1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1,0},new int[]{1,1,0,0,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,0},new int[]{1,0,1,1,0,1,1,0,0,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1},new int[]{1,0,1,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,1,0,0,1,1,1,0},new int[]{1,1,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,0,0,0,1,1,1,0,1,0,0,1,0,0,1,0,1,1,0,0,0,0,0,0,1,0,1,1,0},new int[]{0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,0,1,0,0,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,0},new int[]{0,1,0,1,1,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0},new int[]{1,1,0,0,1,0,0,1,1,0,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,0,0,1,1,1,1,0,1,1,0},new int[]{1,1,1,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,1},new int[]{1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,0},new int[]{1,1,1,1,1,0,0,1,1,0,1,1,0,1,1,1,0,0,1,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,0,0,0,0,1,1,0,1,1,1},new int[]{0,1,1,0,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,1,0,1,0,0,0,0,0},new int[]{0,1,0,0,0,1,0,0,1,0,1,1,0,0,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,0,0,1,0,0,1},new int[]{1,1,0,0,0,0,0,0,1,0,1,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,1,1,0,0,1,0,0,0,1,1},new int[]{0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,1,1,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,1,0,1,0,0,1,1,0,0,1,1,0},new int[]{0,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,0,0,0,0,1,1,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,0,0,1,1,0,0,1,0},new int[]{0,1,1,1,0,0,0,0,0,0,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,1,0,1,1,1,1},new int[]{1,0,1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,1,0,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,0,1,1,1,0,0,0,1,0,1},new int[]{1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,1,1,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,1},new int[]{0,0,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1,1,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,0},new int[]{1,1,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,1,0,0,0,0,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0},new int[]{0,0,1,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,1,1,1,0,1,1,0,1,1},new int[]{0,0,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0,0,1,0,1,1,0,1},new int[]{0,1,1,1,0,0,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0,0,1},new int[]{0,0,0,0,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1},new int[]{0,0,1,1,1,1,0,1,0,1,1,0,1,1,0,0,0,1,1,1,0,1,0,0,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0,1}}); param0.add(new int[][]{new int[]{13,16,26,38,44,71,73},new int[]{16,28,39,47,48,59,61},new int[]{15,30,50,59,60,89,90},new int[]{24,61,63,71,72,76,83},new int[]{14,36,39,42,64,76,77},new int[]{4,6,11,24,34,36,58},new int[]{22,35,63,70,81,91,98}}); param0.add(new int[][]{new int[]{-48,-22,-52,-86,-22},new int[]{-54,-6,-16,-84,-34},new int[]{-46,-16,-80,-82,-38},new int[]{-44,98,-54,-32,-88},new int[]{42,52,38,-20,-36}}); param0.add(new int[][]{new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1}}); param0.add(new int[][]{new int[]{62,15,2,68,63,42,57,46,37,30,1,51,47,75,50,24,48,56,93,9,50,79,58,74,81,64,63,60,49,24,46,55,89,10,49,46,17,86,24,51,69,21,16,97,66,14},new int[]{95,91,93,6,64,52,1,29,77,42,16,76,40,30,32,7,36,72,1,94,12,25,11,75,52,95,64,4,54,78,40,67,81,92,5,42,65,94,59,12,35,75,82,83,72,47},new int[]{69,96,79,34,12,8,27,58,49,56,43,17,26,87,1,19,99,48,80,25,56,40,42,63,92,27,76,55,15,2,30,81,79,4,15,52,21,94,80,27,93,33,44,20,45,34},new int[]{18,47,49,73,19,87,86,72,52,21,36,27,96,2,87,35,22,20,97,92,69,13,15,95,80,58,84,66,56,12,57,36,90,25,14,43,43,80,2,53,42,65,52,42,5,48},new int[]{85,40,51,5,9,71,80,70,2,18,87,36,78,90,57,60,27,92,15,64,47,22,99,53,87,28,97,94,28,83,64,10,10,34,30,90,17,87,31,7,29,68,29,69,47,35},new int[]{15,32,84,9,45,6,37,97,12,69,91,45,39,58,49,85,76,2,48,71,81,88,16,71,49,32,68,5,23,65,93,47,88,59,43,43,36,59,52,77,1,25,36,86,26,42},new int[]{39,15,66,15,13,29,80,10,75,3,21,65,41,19,76,82,64,55,63,46,24,94,40,75,24,20,2,86,90,24,53,70,65,90,45,70,96,98,68,60,12,31,27,57,63,17},new int[]{79,58,4,37,50,72,71,69,45,86,47,25,98,59,63,16,13,97,66,2,8,13,4,54,96,1,80,3,35,15,62,20,74,58,80,65,85,37,74,6,93,29,10,19,80,61},new int[]{53,59,23,20,92,20,65,17,71,81,41,50,37,86,75,62,21,49,59,34,56,94,41,71,70,94,44,6,25,19,37,3,13,39,86,98,19,30,52,26,35,25,65,74,9,69},new int[]{15,92,20,89,35,8,50,32,17,2,21,64,76,26,9,49,25,63,17,51,58,1,97,3,28,80,11,89,23,86,9,27,5,52,31,62,77,63,86,41,59,19,28,78,6,63},new int[]{76,97,67,74,17,13,95,60,16,63,87,95,84,66,82,69,80,44,54,32,29,37,47,62,78,79,45,10,63,11,20,53,95,72,40,75,89,81,1,37,56,15,85,93,84,9},new int[]{72,60,72,79,28,8,48,76,89,84,89,46,42,83,65,90,71,93,64,50,55,88,66,29,6,6,47,99,61,98,24,57,4,83,56,56,46,21,46,33,78,85,15,28,80,33},new int[]{49,8,68,50,35,16,35,44,22,80,94,48,98,13,43,79,28,68,15,99,5,27,62,63,85,66,55,31,44,48,73,58,71,50,94,22,19,79,76,13,97,27,91,19,47,12},new int[]{52,75,69,55,13,16,39,7,82,28,77,88,84,98,47,21,21,43,40,92,82,92,33,94,3,21,42,47,89,40,59,78,13,97,62,96,74,69,95,73,90,11,67,10,48,47},new int[]{37,21,84,6,27,11,42,18,62,58,81,7,9,71,77,38,69,12,16,61,2,44,81,71,2,99,22,38,30,51,39,11,62,73,95,74,13,87,33,17,23,8,90,45,36,73},new int[]{80,14,37,80,75,12,38,69,25,91,72,14,3,36,97,93,61,20,22,9,56,89,37,99,9,50,59,95,67,25,48,36,91,66,48,61,71,13,50,54,51,29,58,48,14,19},new int[]{64,64,97,27,3,7,54,36,57,24,82,5,83,49,78,87,87,93,70,62,68,26,40,84,82,76,98,27,41,71,23,56,3,46,85,39,62,92,73,74,16,79,40,24,91,63},new int[]{88,29,39,88,15,76,44,40,66,67,26,9,61,5,24,71,8,56,35,89,71,12,72,54,26,84,57,58,46,73,92,24,20,59,70,86,84,15,98,51,29,15,74,7,19,64},new int[]{14,46,80,84,53,57,50,32,23,48,35,83,89,10,67,51,96,63,84,18,6,41,48,79,66,17,17,45,51,7,65,79,29,34,92,17,45,36,2,36,66,30,65,4,55,61},new int[]{23,37,69,52,89,17,78,39,81,83,94,61,33,11,46,34,27,35,55,1,22,99,91,24,56,28,70,88,23,48,77,57,57,72,69,79,95,58,37,68,17,66,11,82,97,20},new int[]{24,46,12,76,76,15,6,97,22,95,83,52,69,59,17,24,54,85,60,41,2,84,71,76,71,27,36,54,79,32,66,65,27,15,39,30,38,58,6,66,73,31,73,74,64,51},new int[]{71,37,75,62,93,88,55,77,22,54,67,34,50,89,66,77,17,54,1,53,83,3,74,37,41,38,48,39,25,46,72,61,70,77,7,58,5,77,60,64,95,22,81,95,53,14},new int[]{52,25,79,20,16,26,40,49,23,82,56,61,40,89,99,58,90,17,22,20,1,14,5,99,34,63,71,7,51,56,8,3,8,39,45,90,97,24,45,77,51,57,41,59,47,15},new int[]{98,5,15,87,54,20,2,88,73,98,90,4,79,94,74,26,3,91,65,28,25,93,61,63,3,97,15,40,1,79,88,71,15,55,94,93,38,56,10,41,68,28,85,74,71,19},new int[]{10,27,56,25,36,22,54,74,28,72,53,19,66,49,49,56,94,55,24,82,54,66,1,7,37,45,49,85,34,51,91,74,64,28,87,81,39,42,93,60,43,10,85,12,7,62},new int[]{73,51,16,10,70,67,50,75,37,60,45,31,57,94,44,51,23,74,16,79,78,57,63,90,28,24,63,5,61,2,20,86,57,46,42,5,34,72,35,68,37,6,19,15,48,93},new int[]{70,43,61,32,77,46,11,98,66,70,44,73,51,53,55,69,54,3,65,25,75,37,47,44,78,78,3,98,73,71,34,54,80,69,20,35,1,27,42,18,93,96,60,9,80,57},new int[]{2,31,55,74,66,86,59,31,40,18,55,86,79,74,45,19,83,26,24,28,15,34,34,28,66,68,94,87,19,66,67,48,38,39,67,75,23,28,23,10,65,75,50,23,85,55},new int[]{91,22,56,89,33,23,8,81,56,97,2,88,94,38,61,8,56,85,68,31,99,30,75,61,23,68,10,95,53,57,55,42,48,97,23,40,61,99,30,54,18,66,83,58,6,35},new int[]{46,84,95,99,63,16,14,13,55,83,6,77,77,40,1,85,53,14,66,46,99,67,42,55,11,27,40,38,81,54,80,3,52,77,5,22,75,50,95,54,88,27,1,85,6,60},new int[]{38,32,53,70,13,71,48,20,37,38,25,23,58,93,34,66,47,71,50,64,11,60,45,49,57,25,42,75,78,97,58,31,83,60,53,72,45,71,22,43,79,1,81,8,62,39},new int[]{53,8,61,2,80,52,70,9,47,23,87,99,41,89,23,54,5,50,50,96,51,30,41,93,90,77,30,4,63,52,89,30,72,96,75,55,74,12,67,62,3,38,53,62,80,80},new int[]{88,65,51,42,27,28,91,20,8,18,46,12,36,12,41,29,31,18,27,84,84,83,96,70,2,3,40,53,1,39,16,29,8,23,38,71,89,87,92,83,83,57,3,64,62,51},new int[]{76,38,28,18,53,19,90,48,7,74,89,6,10,5,29,51,59,32,33,66,4,90,39,9,90,77,35,48,29,58,35,14,72,89,17,75,45,8,54,58,40,65,6,90,26,47},new int[]{93,31,76,38,69,20,19,44,28,53,95,64,50,11,27,64,77,18,24,1,46,8,77,72,48,14,87,28,54,9,63,68,67,59,37,20,17,74,6,30,49,65,50,80,75,77},new int[]{76,40,73,71,21,7,8,38,60,4,40,32,18,36,82,31,29,74,73,19,51,98,46,74,98,53,24,66,7,14,71,95,4,86,60,14,80,28,34,18,49,68,76,55,72,35},new int[]{66,6,48,50,62,34,10,41,14,93,60,58,8,51,31,89,42,67,29,75,90,98,58,4,87,82,29,27,38,13,70,4,40,30,81,29,57,61,90,10,82,36,9,32,45,87},new int[]{76,45,58,23,90,81,1,48,12,36,90,35,36,83,19,6,17,6,90,88,26,12,53,49,23,13,52,17,30,92,22,83,64,1,82,71,67,30,54,67,64,93,93,8,45,71},new int[]{65,37,45,41,91,59,22,56,29,22,12,44,56,7,73,87,77,98,9,38,37,62,86,66,53,64,73,86,8,20,8,3,46,51,11,53,50,57,26,93,80,41,34,70,82,82},new int[]{77,1,52,73,66,59,96,50,60,63,38,44,26,95,62,99,37,34,8,44,31,10,82,75,82,92,54,61,3,52,55,7,48,22,43,71,50,96,27,56,44,66,48,25,27,22},new int[]{5,86,67,70,46,7,43,52,7,19,85,27,99,55,1,48,16,41,2,47,59,51,21,19,80,80,8,41,51,75,74,49,54,48,73,15,69,24,96,19,97,23,28,90,60,50},new int[]{76,65,97,12,56,95,81,27,85,46,42,56,77,90,55,6,91,41,81,93,62,83,56,21,31,28,10,28,47,92,29,85,9,30,94,62,88,86,52,16,30,50,47,1,51,11},new int[]{83,14,96,9,59,84,27,94,5,20,93,58,99,71,9,5,78,38,97,97,42,88,50,51,28,64,62,32,22,50,18,57,12,61,86,72,35,53,64,42,90,32,46,84,82,65},new int[]{28,99,16,15,46,15,57,32,82,90,2,29,28,8,41,33,74,61,87,64,7,51,79,30,70,33,88,9,24,7,61,22,5,12,37,19,91,38,55,23,54,62,82,8,44,73},new int[]{30,77,76,3,41,88,95,36,78,76,33,86,54,38,92,36,65,99,67,8,72,33,71,88,8,63,43,89,57,6,20,74,52,50,61,66,52,3,3,60,28,6,90,51,60,15},new int[]{32,86,94,46,87,40,20,75,67,86,63,63,48,42,81,69,30,11,45,18,58,68,58,79,95,51,81,1,88,58,49,75,89,60,52,24,80,70,47,17,45,94,69,17,11,97}}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{31,50,50,68,69,80,87}); param1.add(new int[]{-74,-50,-90,-52,96,78,-16,14,-14,66,-50,74,-34,-88,84,80,34,18,-38,62,56,-48,-22,94,94,94,92,-46,-32,10,-48,46,20,80,32,30,88,60}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{23,36,42,49,50,88,97,51,1,27,4,72,11,61,24,49,75,29,96,16,11,65,13,22,13,23,84,23,20,63,35,76,22}); param1.add(new int[]{-96,-90,-90,-86,-86,-86,-84,-76,-76,-74,-72,-70,-52,-50,-34,-32,-26,-20,-16,-14,-10,-8,-8,-6,4,12,14,16,18,24,26,32,34,38,42,42,48,48,48,48,64,66,70,76,76,82,86,86,96}); param1.add(new int[]{0,1,1,1,1,0,1,1,1,0,0,0,0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,1,1,0,1,1,0,0,0}); param1.add(new int[]{3,9,32,55,78,85,90}); param1.add(new int[]{48,-68,0,-54,-80}); param1.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1}); param1.add(new int[]{19,39,31,50,61,70,43,64,45,82,49,80,21,37,96,30,42,82,96,30,22,26,42,88,57,12,59,58,83,64,66,2,37,60,5,76,20,81,10,57,70,74,65,72,15,84}); List<Integer> param2 = new ArrayList<>(); param2.add(6); param2.add(25); param2.add(28); param2.add(25); param2.add(37); param2.add(43); param2.add(5); param2.add(4); param2.add(7); param2.add(34); List<Integer> param3 = new ArrayList<>(); param3.add(5); param3.add(20); param3.add(28); param3.add(30); param3.add(38); param3.add(32); param3.add(3); param3.add(4); param3.add(10); param3.add(25); List<Integer> param4 = new ArrayList<>(); param4.add(4); param4.add(25); param4.add(32); param4.add(19); param4.add(26); param4.add(35); param4.add(3); param4.add(3); param4.add(9); param4.add(32); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
low
[ "a) f_gold", "b) (", "c) low", "d) <iomanip>", "e) ==" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_OPERATIONS_MAKE_STRINGAB_FREE{ static int f_gold ( char [ ] s ) { int b_count = 0 ; int res = 0 ; for ( int i = 0 ; i < s . length ; i ++ ) { if ( s [ s . length - i - 1 ] == 'a' ) { res = ( res + b_count ) ; b_count = ( b_count * 2 ) ; } else { b_count += 1 ; } } return res ; } length ; i ++ ) { if ( s [ s . length - i - 1 ] == 'a' ) { res = ( res + b_count ) ; b_count = ( b_count * 2 ) ; } else { b_count += 1 ; } } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<char [ ]> param0 = new ArrayList<>(); param0.add(new char[]{'L','k','y'}); param0.add(new char[]{'1','0','9','5','7','4','6','0','4','8','0','1','4','1','8','9','1','5','4','4','8','0','5','8','9','8','1','9','7','0','4','2','5','2','4','6','6','5','3','1','1','0','6'}); param0.add(new char[]{'0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'}); param0.add(new char[]{'A','L','a','l','G',' ','p','b'}); param0.add(new char[]{'0','1','1','1','2','2','4','5','5','5','6','6','6','7','9'}); param0.add(new char[]{'0'}); param0.add(new char[]{' ','A','B','B','B','B','D','G','G','H','H','H','I','I','J','J','J','L','M','N','O','Q','U','U','X','Y','Y','Z','Z','c','c','e','f','h','k','o','p','q','q','s','v','z'}); param0.add(new char[]{'2','5','7','5','2','3','9'}); param0.add(new char[]{'0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'}); param0.add(new char[]{'a','z','M',' ','l','X','x','B','i','j'}); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_OPERATIONS_MAKE_STRINGAB_FREE{ static int f_gold ( char [ ] s ) { int b_count = 0 ; int res = 0 ; for ( int i = 0 ; i < s . [MASK] ; i ++ ) { if ( s [ s . length - i - 1 ] == 'a' ) { res = ( res + b_count ) ; b_count = ( b_count * 2 ) ; } else { b_count += 1 ; } } return res ; } length ; i ++ ) { if ( s [ s . length - i - 1 ] == 'a' ) { res = ( res + b_count ) ; b_count = ( b_count * 2 ) ; } else { b_count += 1 ; } } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<char [ ]> param0 = new ArrayList<>(); param0.add(new char[]{'L','k','y'}); param0.add(new char[]{'1','0','9','5','7','4','6','0','4','8','0','1','4','1','8','9','1','5','4','4','8','0','5','8','9','8','1','9','7','0','4','2','5','2','4','6','6','5','3','1','1','0','6'}); param0.add(new char[]{'0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'}); param0.add(new char[]{'A','L','a','l','G',' ','p','b'}); param0.add(new char[]{'0','1','1','1','2','2','4','5','5','5','6','6','6','7','9'}); param0.add(new char[]{'0'}); param0.add(new char[]{' ','A','B','B','B','B','D','G','G','H','H','H','I','I','J','J','J','L','M','N','O','Q','U','U','X','Y','Y','Z','Z','c','c','e','f','h','k','o','p','q','q','s','v','z'}); param0.add(new char[]{'2','5','7','5','2','3','9'}); param0.add(new char[]{'0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'}); param0.add(new char[]{'a','z','M',' ','l','X','x','B','i','j'}); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
length
[ "a) [", "b) if", "c) N", "d) #include", "e) length" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_POINTS_INTERSECTION_N_CIRCLES{ static int f_gold ( int n ) { return n * ( n - 1 ) ; } t java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_POINTS_INTERSECTION_N_CIRCLES{ static int f_gold ( int n ) { return n * ( n - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(30); param0.add(25); param0.add(69); param0.add(39); param0.add(14); param0.add(60); param0.add(89); param0.add(27); param0.add(29); param0.add(29); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; [MASK] javafx.util.Pair; public class MAXIMUM_POINTS_INTERSECTION_N_CIRCLES{ static int f_gold ( int n ) { return n * ( n - 1 ) ; }t java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_POINTS_INTERSECTION_N_CIRCLES{ static int f_gold ( int n ) { return n * ( n - 1 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(30); param0.add(25); param0.add(69); param0.add(39); param0.add(14); param0.add(60); param0.add(89); param0.add(27); param0.add(29); param0.add(29); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import
[ "a) void", "b) n)", "c) import", "d) W", "e) -" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SQUARE_ROOT_OF_AN_INTEGER_1{ public static int f_gold ( int x ) { if ( x == 0 || x == 1 ) return x ; int start = 1 , end = x , ans = 0 ; while ( start <= end ) { int mid = ( start + end ) / 2 ; if ( mid * mid == x ) return mid ; if ( mid * mid < x ) { start = mid + 1 ; ans = mid ; } else end = mid - 1 ; } return ans ; } int mid = ( start + end ) / 2 ; if ( mid * mid == x ) return mid ; if ( mid * mid < x ) { start = mid + 1 ; ans = mid ; } else end = mid - 1 ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(40); param0.add(10); param0.add(46); param0.add(54); param0.add(1); param0.add(67); param0.add(64); param0.add(10); param0.add(75); param0.add(11); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SQUARE_ROOT_OF_AN_INTEGER_1{ public static int f_gold ( int x ) { if ( x == 0 || x == 1 ) return x ; int start = 1 , end = x [MASK] ans = 0 ; while ( start <= end ) { int mid = ( start + end ) / 2 ; if ( mid * mid == x ) return mid ; if ( mid * mid < x ) { start = mid + 1 ; ans = mid ; } else end = mid - 1 ; } return ans ; } int mid = ( start + end ) / 2 ; if ( mid * mid == x ) return mid ; if ( mid * mid < x ) { start = mid + 1 ; ans = mid ; } else end = mid - 1 ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(40); param0.add(10); param0.add(46); param0.add(54); param0.add(1); param0.add(67); param0.add(64); param0.add(10); param0.add(75); param0.add(11); 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()); } }
,
[ "a) n", "b) ,", "c) 2", "d) class", "e) (const" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING{ static int f_gold ( String str ) { int n = str . length ( ) ; int res = - 1 ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( str . charAt ( i ) == str . charAt ( j ) ) res = Math . max ( res , Math . abs ( j - i - 1 ) ) ; return res ; } ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( str . charAt ( i ) == str . charAt ( j ) ) res = Math . max ( res , Math . abs ( j - i - 1 ) ) ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("cI"); param0.add("76478"); param0.add("1"); param0.add("tr"); param0.add("10"); param0.add("01"); param0.add("Rmhzp"); param0.add("5784080133917"); param0.add("1100"); param0.add("OK"); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING{ static int f_gold ( String str ) { int n = str . length ( ) ; int res = - 1 ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( str . charAt ( i ) == str . charAt ( j ) ) res = Math . max ( res , Math . abs ( j - i - [MASK] ) ) ; return res ; }( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( str . charAt ( i ) == str . charAt ( j ) ) res = Math . max ( res , Math . abs ( j - i - 1 ) ) ; return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("cI"); param0.add("76478"); param0.add("1"); param0.add("tr"); param0.add("10"); param0.add("01"); param0.add("Rmhzp"); param0.add("5784080133917"); param0.add("1100"); param0.add("OK"); 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
[ "a) javafx.util.Pair;", "b) ]", "c) 1", "d) =", "e) str" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS{ static boolean f_gold ( int x , int y ) { return ( ( x ^ y ) < 0 ) ; } t java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS{ static boolean f_gold ( int x , int y ) { return ( ( x ^ y ) < 0 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(59); param0.add(-20); param0.add(-100); param0.add(54); param0.add(-16); param0.add(-23); param0.add(93); param0.add(24); param0.add(-8); param0.add(29); List<Integer> param1 = new ArrayList<>(); param1.add(-99); param1.add(-21); param1.add(79); param1.add(-49); param1.add(16); param1.add(-68); param1.add(37); param1.add(-61); param1.add(69); param1.add(10); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public [MASK] DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS{ static boolean f_gold ( int x , int y ) { return ( ( x ^ y ) < 0 ) ; }t java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS{ static boolean f_gold ( int x , int y ) { return ( ( x ^ y ) < 0 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(59); param0.add(-20); param0.add(-100); param0.add(54); param0.add(-16); param0.add(-23); param0.add(93); param0.add(24); param0.add(-8); param0.add(29); List<Integer> param1 = new ArrayList<>(); param1.add(-99); param1.add(-21); param1.add(79); param1.add(-49); param1.add(16); param1.add(-68); param1.add(37); param1.add(-61); param1.add(69); param1.add(10); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
class
[ "a) class", "b) (", "c) (int", "d) [", "e) int" ]
a
java
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 ; } = 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; [MASK] 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 ; }= 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()); } }
public
[ "a) 0xAAAAAAAA", "b) m", "c) public", "d) times", "e) %" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_CALCULATE_VOLUME_OCTAHEDRON{ static double f_gold ( double side ) { return ( ( side * side * side ) * ( Math . sqrt ( 2 ) / 3 ) ) ; } t java.lang.*; import javafx.util.Pair; public class PROGRAM_CALCULATE_VOLUME_OCTAHEDRON{ static double f_gold ( double side ) { return ( ( side * side * side ) * ( Math . sqrt ( 2 ) / 3 ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(3355.322051344013); param0.add(-891.0551553192736); param0.add(8242.699647177868); param0.add(-9259.146104439229); param0.add(7712.806145993083); param0.add(-4998.858862079315); param0.add(9771.127582524628); param0.add(-5415.8106399098115); param0.add(670.0774772280249); param0.add(-7068.634369272122); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_CALCULATE_VOLUME_OCTAHEDRON{ static double f_gold ( double side ) { return ( ( side * side * side ) * ( Math [MASK] sqrt ( 2 ) / 3 ) ) ; }t java.lang.*; import javafx.util.Pair; public class PROGRAM_CALCULATE_VOLUME_OCTAHEDRON{ static double f_gold ( double side ) { return ( ( side * side * side ) * ( Math . sqrt ( 2 ) / 3 ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(3355.322051344013); param0.add(-891.0551553192736); param0.add(8242.699647177868); param0.add(-9259.146104439229); param0.add(7712.806145993083); param0.add(-4998.858862079315); param0.add(9771.127582524628); param0.add(-5415.8106399098115); param0.add(670.0774772280249); param0.add(-7068.634369272122); 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()); } }
.
[ "a) -", "b) 0", "c) int", "d) .", "e) sort" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FRIENDS_PAIRING_PROBLEM_2{ static int f_gold ( int n ) { int a = 1 , b = 2 , c = 0 ; if ( n <= 2 ) { return n ; } for ( int i = 3 ; i <= n ; i ++ ) { c = b + ( i - 1 ) * a ; a = b ; b = c ; } return c ; } gold ( int n ) { int a = 1 , b = 2 , c = 0 ; if ( n <= 2 ) { return n ; } for ( int i = 3 ; i <= n ; i ++ ) { c = b + ( i - 1 ) * a ; a = b ; b = c ; } return c ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(24); param0.add(1); param0.add(91); param0.add(90); param0.add(89); param0.add(29); param0.add(3); param0.add(60); param0.add(75); param0.add(14); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FRIENDS_PAIRING_PROBLEM_2{ static int f_gold ( int n ) { int a = 1 , b = 2 , c = 0 ; if ( n <= 2 ) { return n ; } for ( int i = 3 ; i <= n ; i ++ ) { c = b + ( i - 1 ) * a ; a = b ; b = c ; } return [MASK] ; }gold ( int n ) { int a = 1 , b = 2 , c = 0 ; if ( n <= 2 ) { return n ; } for ( int i = 3 ; i <= n ; i ++ ) { c = b + ( i - 1 ) * a ; a = b ; b = c ; } return c ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(24); param0.add(1); param0.add(91); param0.add(90); param0.add(89); param0.add(29); param0.add(3); param0.add(60); param0.add(75); param0.add(14); 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()); } }
c
[ "a) <=", "b) c", "c) 0", "d) while", "e) prev_zero" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1{ static boolean f_gold ( int arr [ ] , int n ) { if ( n == 0 || n == 1 ) return true ; for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false ; return true ; } _1{ static boolean f_gold ( int arr [ ] , int n ) { if ( n == 0 || n == 1 ) return true ; for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{6,8,8,16,19,19,21,23,26,33,34,36,38,39,41,41,45,47,52,52,55,57,60,60,60,61,69,69,70,70,72,73,73,75,78,81,84,84,85,88,88,89,90,91,97}); param0.add(new int[]{2,-90,66,24,-18,70,34,18,84,-62}); param0.add(new int[]{1,1}); param0.add(new int[]{12,88,65,82,23,39,60,27,57,44,70,28,23,34,25,11,48,65,10,73,26,10,18,60,73,45,26,9,36,15,24,40,2,4,95,20,39,45}); param0.add(new int[]{-38,38,40,72}); param0.add(new int[]{1,0,0,0,1}); param0.add(new int[]{11,15,16,17,17,17,22,23,23,25,27,28,28,31,33,36,38,40,42,44,46,49,51,51,52,60,62,65,67,71,74,77,77,78,78,79,83,83,86,86,87,87,87,88,91,92,97,97,97}); param0.add(new int[]{-26,-90,-78,-76,-58,-64,-72,-34,-58,-48,78,-50,-30,26,-60,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}); param0.add(new int[]{56,51,63,30,10,88,23,1,48,4,28,44}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(9); param1.add(1); param1.add(23); param1.add(2); param1.add(3); param1.add(44); param1.add(9); param1.add(23); param1.add(10); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1{ static boolean [MASK] ( int arr [ ] , int n ) { if ( n == 0 || n == 1 ) return true ; for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false ; return true ; }_1{ static boolean f_gold ( int arr [ ] , int n ) { if ( n == 0 || n == 1 ) return true ; for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{6,8,8,16,19,19,21,23,26,33,34,36,38,39,41,41,45,47,52,52,55,57,60,60,60,61,69,69,70,70,72,73,73,75,78,81,84,84,85,88,88,89,90,91,97}); param0.add(new int[]{2,-90,66,24,-18,70,34,18,84,-62}); param0.add(new int[]{1,1}); param0.add(new int[]{12,88,65,82,23,39,60,27,57,44,70,28,23,34,25,11,48,65,10,73,26,10,18,60,73,45,26,9,36,15,24,40,2,4,95,20,39,45}); param0.add(new int[]{-38,38,40,72}); param0.add(new int[]{1,0,0,0,1}); param0.add(new int[]{11,15,16,17,17,17,22,23,23,25,27,28,28,31,33,36,38,40,42,44,46,49,51,51,52,60,62,65,67,71,74,77,77,78,78,79,83,83,86,86,87,87,87,88,91,92,97,97,97}); param0.add(new int[]{-26,-90,-78,-76,-58,-64,-72,-34,-58,-48,78,-50,-30,26,-60,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}); param0.add(new int[]{56,51,63,30,10,88,23,1,48,4,28,44}); List<Integer> param1 = new ArrayList<>(); param1.add(22); param1.add(9); param1.add(1); param1.add(23); param1.add(2); param1.add(3); param1.add(44); param1.add(9); param1.add(23); param1.add(10); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
f_gold
[ "a) =", "b) i", "c) /", "d) count", "e) f_gold" ]
e
java
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 ; } 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()); } }
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 ) == [MASK] ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) product *= ( tree . charAt ( i ) - '0' ) ; } } return product ; } 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()); } }
'('
[ "a) ,", "b) );", "c) cmpfunc", "d) {", "e) '('" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int res = Integer . MIN_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { int curr_sum = 0 ; for ( int j = 0 ; j < n ; j ++ ) { int index = ( i + j ) % n ; curr_sum += j * arr [ index ] ; } res = Math . max ( res , curr_sum ) ; } return res ; } um = 0 ; for ( int j = 0 ; j < n ; j ++ ) { int index = ( i + j ) % n ; curr_sum += j * arr [ index ] ; } res = Math . max ( res , curr_sum ) ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{11,12,16,26,29,40,54,59,65,70,71,73,78,81,87,87,88,90,95,97}); param0.add(new int[]{-46,-32,54,96,-72,-58,-36,-44,26,-2,-68,42,90,26,-92,-96,88,-42,-18,46,-70,24,0,24,34,34,-52,50,94,-60,64,58}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{48,2,79,98,28,17,41,47,61,76,82,5,74,4,80,51,22,45,91,75,91,93,42,45,69,98,76,74,83,17,30,88,53,25,35,19,26}); param0.add(new int[]{-88,-84,-82,-74,-44,-34,-32,-20,-20,-14,6,6,10,12,16,24,32,34,38,46,54,54,56,60,82,88,90,94,98}); param0.add(new int[]{0,1,1,1,1,0,1,1,1,1,1,1,1}); param0.add(new int[]{10,14,14,14,19,20,22,26,35,36,40,53,54,55,55,57,57,67,72,72,77,78,83,84,95,96}); param0.add(new int[]{-80,18,-76,48,-52,-38,52,-82,40,-44,-90,86,-86,-36,-32,-2,56,-12,-88,14,-16,8,52,24,46,56,84,-36,84,-60,72,-46,32,-16,-20,68,-86,-62,58,8,78,-52,22,-28,-22,-42,12,-48}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{20,94,36,2,50,62,84,50,66,75,1,18,41,48,72,61,86,22,54,6,71,46,92,68,59,51,89,31,58,78,82,84}); List<Integer> param1 = new ArrayList<>(); param1.add(11); param1.add(22); param1.add(33); param1.add(20); param1.add(24); param1.add(7); param1.add(16); param1.add(30); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY{ static int f_gold ( int arr [ ] , int n ) { int res = Integer . MIN_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { int curr_sum = 0 ; for ( int j = 0 ; j < n ; j ++ [MASK] { int index = ( i + j ) % n ; curr_sum += j * arr [ index ] ; } res = Math . max ( res , curr_sum ) ; } return res ; }um = 0 ; for ( int j = 0 ; j < n ; j ++ ) { int index = ( i + j ) % n ; curr_sum += j * arr [ index ] ; } res = Math . max ( res , curr_sum ) ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{11,12,16,26,29,40,54,59,65,70,71,73,78,81,87,87,88,90,95,97}); param0.add(new int[]{-46,-32,54,96,-72,-58,-36,-44,26,-2,-68,42,90,26,-92,-96,88,-42,-18,46,-70,24,0,24,34,34,-52,50,94,-60,64,58}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{48,2,79,98,28,17,41,47,61,76,82,5,74,4,80,51,22,45,91,75,91,93,42,45,69,98,76,74,83,17,30,88,53,25,35,19,26}); param0.add(new int[]{-88,-84,-82,-74,-44,-34,-32,-20,-20,-14,6,6,10,12,16,24,32,34,38,46,54,54,56,60,82,88,90,94,98}); param0.add(new int[]{0,1,1,1,1,0,1,1,1,1,1,1,1}); param0.add(new int[]{10,14,14,14,19,20,22,26,35,36,40,53,54,55,55,57,57,67,72,72,77,78,83,84,95,96}); param0.add(new int[]{-80,18,-76,48,-52,-38,52,-82,40,-44,-90,86,-86,-36,-32,-2,56,-12,-88,14,-16,8,52,24,46,56,84,-36,84,-60,72,-46,32,-16,-20,68,-86,-62,58,8,78,-52,22,-28,-22,-42,12,-48}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{20,94,36,2,50,62,84,50,66,75,1,18,41,48,72,61,86,22,54,6,71,46,92,68,59,51,89,31,58,78,82,84}); List<Integer> param1 = new ArrayList<>(); param1.add(11); param1.add(22); param1.add(33); param1.add(20); param1.add(24); param1.add(7); param1.add(16); param1.add(30); 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()); } }
)
[ "a) 4", "b) char", "c) in", "d) )", "e) ]" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_MINIMUM_DIFFERENCE_PAIR{ static int f_gold ( int [ ] arr , int n ) { int diff = Integer . MAX_VALUE ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( ( arr [ i ] - arr [ j ] ) ) < diff ) diff = Math . abs ( ( arr [ i ] - arr [ j ] ) ) ; return diff ; } t i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( ( arr [ i ] - arr [ j ] ) ) < diff ) diff = Math . abs ( ( arr [ i ] - arr [ j ] ) ) ; return diff ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,1,2,3,5,8,10,11,15,15,16,20,26,28,30,30,33,33,39,50,50,50,54,62,66,68,69,69,74,74,75,75,76,78,82,83,85,86,86,89,89,91,91,92,92,92,93,94,98}); param0.add(new int[]{6,6,-20,88,-78,-18,74,72,80,76,-62,38}); param0.add(new int[]{0,1,1,1,1}); param0.add(new int[]{75,85,49,66,44,89,80,39,64,70,25,21,81,33,90,68,51}); param0.add(new int[]{-96,-10,0,4,54,64}); param0.add(new int[]{1,0,1,0,0,1,0,0,0,0,1,0,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0}); param0.add(new int[]{3,3,5,5,7,7,9,11,11,18,18,18,20,29,29,31,31,32,37,43,44,46,48,50,52,52,53,63,63,65,69,72,76,76,81,84,85,86,87,87,90,94,97,97}); param0.add(new int[]{40,-46,72,-28,8,90,86,-90,8,-66,-98,6,42,86,88,42,-50,74,-34,-16,-94,-56,-18,-18,84,-44,34,80,96,42,-50,-92,70,80,62,-38,-4,68,54,-14,30,-18,-58}); 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}); param0.add(new int[]{15,41,32,19,68,36,61,59,5,91,53,95,10,64,15,32,14,64,48,70,85,19,83,2,33,58,93,88,21,88,45,45,18,8}); List<Integer> param1 = new ArrayList<>(); param1.add(32); param1.add(11); param1.add(3); param1.add(16); param1.add(3); param1.add(41); param1.add(27); param1.add(33); param1.add(26); param1.add(24); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_MINIMUM_DIFFERENCE_PAIR{ static int f_gold ( int [ ] arr , int n ) [MASK] int diff = Integer . MAX_VALUE ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( ( arr [ i ] - arr [ j ] ) ) < diff ) diff = Math . abs ( ( arr [ i ] - arr [ j ] ) ) ; return diff ; }t i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( ( arr [ i ] - arr [ j ] ) ) < diff ) diff = Math . abs ( ( arr [ i ] - arr [ j ] ) ) ; return diff ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,1,2,3,5,8,10,11,15,15,16,20,26,28,30,30,33,33,39,50,50,50,54,62,66,68,69,69,74,74,75,75,76,78,82,83,85,86,86,89,89,91,91,92,92,92,93,94,98}); param0.add(new int[]{6,6,-20,88,-78,-18,74,72,80,76,-62,38}); param0.add(new int[]{0,1,1,1,1}); param0.add(new int[]{75,85,49,66,44,89,80,39,64,70,25,21,81,33,90,68,51}); param0.add(new int[]{-96,-10,0,4,54,64}); param0.add(new int[]{1,0,1,0,0,1,0,0,0,0,1,0,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0}); param0.add(new int[]{3,3,5,5,7,7,9,11,11,18,18,18,20,29,29,31,31,32,37,43,44,46,48,50,52,52,53,63,63,65,69,72,76,76,81,84,85,86,87,87,90,94,97,97}); param0.add(new int[]{40,-46,72,-28,8,90,86,-90,8,-66,-98,6,42,86,88,42,-50,74,-34,-16,-94,-56,-18,-18,84,-44,34,80,96,42,-50,-92,70,80,62,-38,-4,68,54,-14,30,-18,-58}); 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}); param0.add(new int[]{15,41,32,19,68,36,61,59,5,91,53,95,10,64,15,32,14,64,48,70,85,19,83,2,33,58,93,88,21,88,45,45,18,8}); List<Integer> param1 = new ArrayList<>(); param1.add(32); param1.add(11); param1.add(3); param1.add(16); param1.add(3); param1.add(41); param1.add(27); param1.add(33); param1.add(26); param1.add(24); 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()); } }
{
[ "a) int", "b) (", "c) b", "d) i", "e) {" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { int result = - 1 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max ( result , arr [ i ] ) ; return result ; } i ++ ) for ( int j = 0 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max ( result , arr [ i ] ) ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,78,84}); param0.add(new int[]{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{39,49,94,80,48,34,63,82,47,51,60,68,79,23,97,22,54,53,40,2,25}); param0.add(new int[]{-90,-52,-10,12,72}); param0.add(new int[]{1,0,0}); param0.add(new int[]{2,9,11,14,16,17,17,18,19,21,24,25,28,29,30,33,33,39,41,41,43,46,50,51,60,62,67,80,84,86,91,92,97}); param0.add(new int[]{4}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{52,8,31,92,20,18,34,5,15,8,73,20,40,61,80,51,95,73,38,30,21,69,52,38,68,77}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(26); param1.add(22); param1.add(10); param1.add(3); param1.add(2); param1.add(27); param1.add(0); param1.add(16); param1.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY{ static int f_gold ( int [ ] arr , int n ) { int result = - 1 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max [MASK] result , arr [ i ] ) ; return result ; } i ++ ) for ( int j = 0 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max ( result , arr [ i ] ) ; return result ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,78,84}); param0.add(new int[]{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{39,49,94,80,48,34,63,82,47,51,60,68,79,23,97,22,54,53,40,2,25}); param0.add(new int[]{-90,-52,-10,12,72}); param0.add(new int[]{1,0,0}); param0.add(new int[]{2,9,11,14,16,17,17,18,19,21,24,25,28,29,30,33,33,39,41,41,43,46,50,51,60,62,67,80,84,86,91,92,97}); param0.add(new int[]{4}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{52,8,31,92,20,18,34,5,15,8,73,20,40,61,80,51,95,73,38,30,21,69,52,38,68,77}); List<Integer> param1 = new ArrayList<>(); param1.add(2); param1.add(26); param1.add(22); param1.add(10); param1.add(3); param1.add(2); param1.add(27); param1.add(0); param1.add(16); param1.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
(
[ "a) #include", "b) <", "c) )", "d) }", "e) (" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class LONGEST_REPEATED_SUBSEQUENCE_1{ static String f_gold ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n ; j ++ ) dp [ i ] [ j ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= n ; j ++ ) if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; String res = "" ; int i = n , j = n ; while ( i > 0 && j > 0 ) { if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j - 1 ] + 1 ) { res = res + str . charAt ( i - 1 ) ; i -- ; j -- ; } else if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j ] ) i -- ; else j -- ; } String reverse = "" ; for ( int k = res . length ( ) - 1 ; k >= 0 ; k -- ) { reverse = reverse + res . charAt ( k ) ; } return reverse ; } - 1 ] [ j ] ) i -- ; else j -- ; } String reverse = "" ; for ( int k = res . length ( ) - 1 ; k >= 0 ; k -- ) { reverse = reverse + res . charAt ( k ) ; } return reverse ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("qnQxjoRx"); param0.add("27473733400077"); param0.add("000010111111"); param0.add("TNVwgrWSLu"); param0.add("9537"); param0.add("1100"); param0.add("lYcoiQfzN"); param0.add("52"); param0.add("00100001100"); param0.add("Rkxe"); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class LONGEST_REPEATED_SUBSEQUENCE_1{ static String f_gold ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n ; j ++ ) dp [ i ] [ j ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= n ; j ++ ) if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [MASK] j - 1 ] , dp [ i - 1 ] [ j ] ) ; String res = "" ; int i = n , j = n ; while ( i > 0 && j > 0 ) { if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j - 1 ] + 1 ) { res = res + str . charAt ( i - 1 ) ; i -- ; j -- ; } else if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j ] ) i -- ; else j -- ; } String reverse = "" ; for ( int k = res . length ( ) - 1 ; k >= 0 ; k -- ) { reverse = reverse + res . charAt ( k ) ; } return reverse ; } - 1 ] [ j ] ) i -- ; else j -- ; } String reverse = "" ; for ( int k = res . length ( ) - 1 ; k >= 0 ; k -- ) { reverse = reverse + res . charAt ( k ) ; } return reverse ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("qnQxjoRx"); param0.add("27473733400077"); param0.add("000010111111"); param0.add("TNVwgrWSLu"); param0.add("9537"); param0.add("1100"); param0.add("lYcoiQfzN"); param0.add("52"); param0.add("00100001100"); param0.add("Rkxe"); 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()); } }
[
[ "a) f", "b) #include", "c) (sizeof", "d) [", "e) +=" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1{ public static int f_gold ( int mat [ ] [ ] , int n ) { int i_des , j_des , q ; int tot_energy = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { q = mat [ i ] [ j ] / n ; i_des = q ; j_des = mat [ i ] [ j ] - ( n * q ) ; tot_energy += Math . abs ( i_des - i ) + Math . abs ( j_des - j ) ; } } return tot_energy ; } q = mat [ i ] [ j ] / n ; i_des = q ; j_des = mat [ i ] [ j ] - ( n * q ) ; tot_energy += Math . abs ( i_des - i ) + Math . abs ( j_des - j ) ; } } return tot_energy ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{4,7,10,11,14,22,27,43,45,47,48,48,49,49,51,54,56,57,59,62,63,64,66,79,82,83,87,96,97,97,98},new int[]{1,1,10,13,14,18,31,33,35,37,37,42,43,44,46,54,60,61,63,63,67,67,74,76,81,83,88,91,91,96,97},new int[]{2,3,4,10,11,13,17,27,30,35,35,38,39,44,47,52,52,60,61,65,68,69,71,75,76,76,85,93,94,94,98},new int[]{3,5,5,19,22,23,24,24,27,31,31,32,32,44,46,50,52,54,55,57,58,59,61,61,68,72,76,78,79,85,98},new int[]{7,10,14,15,21,28,30,31,40,46,51,51,52,54,57,58,58,64,67,68,68,71,72,76,79,80,85,88,88,91,93},new int[]{2,5,18,21,21,25,28,31,33,34,37,38,42,45,47,56,64,70,71,75,76,78,78,81,84,88,90,91,98,98,99},new int[]{10,11,14,17,18,22,27,35,36,37,46,53,55,59,59,64,66,66,66,69,69,73,73,74,74,85,86,87,89,93,99},new int[]{11,13,13,14,17,18,19,19,21,25,25,29,36,36,42,43,45,49,57,61,64,65,71,75,84,84,89,94,94,95,98},new int[]{1,1,2,2,10,10,21,22,23,24,24,29,34,40,46,48,49,49,50,60,73,73,75,80,81,85,86,93,96,97,99},new int[]{1,2,10,15,16,18,19,21,23,25,29,29,31,31,32,38,42,43,48,51,54,56,63,74,74,74,88,88,94,94,94},new int[]{19,24,25,27,29,33,34,35,36,37,37,44,45,50,51,51,52,54,59,59,66,69,70,75,77,80,81,84,97,99,99},new int[]{1,2,5,5,7,12,17,19,20,38,44,45,47,48,51,55,59,61,61,64,65,67,74,76,76,77,79,83,86,92,92},new int[]{3,5,5,12,18,23,25,38,38,48,49,57,61,63,67,70,71,75,75,77,78,79,80,80,84,87,92,92,95,96,98},new int[]{1,3,3,5,7,8,9,13,17,21,23,36,38,39,39,41,45,57,71,72,72,73,76,79,80,82,83,87,89,97,99},new int[]{9,10,13,14,14,16,17,23,26,27,28,31,32,38,38,43,45,50,51,52,52,64,66,68,71,78,85,85,85,91,91},new int[]{1,2,2,3,10,12,13,15,15,21,25,26,28,34,45,45,46,46,49,49,52,55,57,61,62,63,70,72,73,84,86},new int[]{5,5,8,13,16,18,21,25,29,33,35,36,39,45,46,47,49,58,66,68,70,71,77,80,83,83,86,87,94,97,98},new int[]{5,9,17,20,24,27,27,27,28,30,32,32,35,39,40,43,45,52,55,56,63,71,76,78,81,86,90,95,97,98,98},new int[]{1,6,6,7,15,22,29,33,38,38,42,42,44,45,53,59,61,62,62,72,75,76,77,77,80,81,89,96,96,97,99},new int[]{3,4,4,10,11,12,16,17,32,33,33,36,40,40,42,42,44,45,47,52,53,56,59,62,64,67,80,80,89,90,94},new int[]{2,3,8,9,15,19,20,21,22,23,23,24,24,28,28,32,36,40,43,46,54,55,65,71,76,83,86,93,93,96,97},new int[]{2,3,3,4,8,11,13,14,18,19,20,22,35,39,45,60,61,64,66,69,70,70,72,72,74,75,79,83,87,90,97},new int[]{19,21,22,23,24,28,30,30,32,41,42,54,56,60,62,65,71,72,72,73,75,75,78,84,85,85,85,85,87,89,92},new int[]{6,7,10,11,11,16,17,20,20,23,31,33,34,36,38,42,44,48,56,57,58,63,64,69,69,70,72,81,85,89,91},new int[]{9,11,13,18,21,22,24,26,26,30,35,42,51,53,55,55,58,58,59,59,61,63,67,75,79,88,88,92,96,98,99},new int[]{9,12,14,17,21,21,32,35,38,39,41,43,45,45,45,55,57,57,63,67,71,72,74,75,76,77,78,83,83,85,97},new int[]{3,4,13,17,20,22,28,32,36,38,39,39,52,56,60,60,61,61,62,64,65,69,71,73,82,88,91,96,96,97,99},new int[]{2,2,13,14,15,19,25,32,33,34,37,38,41,45,45,53,57,59,59,60,68,71,78,80,81,84,93,93,95,99,99},new int[]{5,16,17,18,18,24,27,27,32,35,41,41,49,51,56,60,60,62,67,67,71,78,78,79,82,89,92,92,95,97,98},new int[]{6,7,9,10,10,12,16,19,19,26,28,31,32,33,41,43,46,47,48,49,51,52,58,66,75,75,76,78,81,88,91},new int[]{8,13,18,19,22,26,26,26,27,30,30,32,33,35,35,38,45,53,57,60,63,63,65,71,77,79,81,91,96,98,99}}); param0.add(new int[][]{new int[]{-40}}); 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,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,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,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},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},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},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},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,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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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[][]{new int[]{3,86,3,43,83,22,69,67,38,82,99,59,27,2,8,84,60,93,75,37,65,79,43,69,7,42,44,77,24,58},new int[]{88,63,93,78,89,63,23,39,60,17,94,68,16,76,31,4,66,91,57,98,95,83,22,79,50,34,84,59,59,39},new int[]{37,36,42,78,47,20,40,18,7,56,4,26,25,64,34,28,88,46,21,45,70,75,24,29,79,7,81,32,65,87},new int[]{90,25,86,26,59,67,24,74,37,68,78,5,7,15,63,20,59,90,58,50,82,19,37,64,81,74,62,3,28,87},new int[]{81,75,25,44,42,86,92,29,11,50,77,77,99,69,3,49,89,35,59,95,85,51,36,72,29,74,55,72,58,16},new int[]{82,37,70,98,69,84,29,36,49,94,64,72,17,95,83,51,16,65,89,21,14,4,75,99,39,60,18,65,69,6},new int[]{88,1,88,12,21,19,37,85,43,80,65,79,97,12,45,12,38,62,53,21,86,67,99,12,38,83,30,32,27,29},new int[]{42,25,24,59,60,38,34,96,84,77,14,97,14,1,89,95,62,57,96,59,65,52,72,70,69,36,79,34,68,33},new int[]{69,92,20,1,71,47,28,33,29,80,55,67,17,82,82,68,18,24,51,49,71,62,69,36,97,39,22,97,3,63},new int[]{63,34,94,31,49,43,90,61,1,55,45,29,28,13,44,26,45,14,92,96,9,39,83,53,34,59,73,52,9,28},new int[]{30,46,18,73,90,38,8,49,75,15,39,10,96,85,32,53,4,93,86,7,95,87,95,59,65,22,77,79,66,30},new int[]{92,28,99,32,90,28,2,97,76,97,38,39,77,84,88,19,34,23,81,81,73,13,91,68,6,21,44,30,16,2},new int[]{76,7,20,53,71,29,57,33,32,53,44,25,76,28,91,15,28,14,63,78,75,49,81,93,82,45,59,81,85,97},new int[]{98,10,23,21,48,22,4,43,13,24,69,62,61,11,61,95,89,31,10,77,93,41,45,32,8,42,50,15,57,10},new int[]{85,90,37,19,60,33,71,96,9,10,52,20,73,67,83,18,62,19,17,43,32,15,92,47,59,83,15,45,95,90},new int[]{38,86,16,5,83,44,46,23,96,75,76,15,8,58,29,81,52,30,87,45,62,82,74,69,57,99,60,13,57,92},new int[]{75,52,45,6,41,30,93,17,76,53,20,13,65,38,14,51,83,93,55,83,19,81,70,57,37,95,48,52,25,86},new int[]{75,79,14,80,61,82,79,70,35,31,66,47,8,2,30,96,22,94,68,59,20,29,98,14,95,33,63,72,3,1},new int[]{43,21,47,66,48,27,51,75,20,87,71,98,93,4,59,22,76,65,7,38,21,26,36,86,28,78,62,98,40,5},new int[]{46,57,64,58,2,92,98,82,40,87,80,96,62,53,92,27,74,38,40,72,8,81,64,25,75,54,70,91,95,42},new int[]{97,97,58,63,90,72,76,74,96,96,16,43,65,97,48,95,36,16,57,38,21,11,99,39,67,61,76,89,25,83},new int[]{1,5,93,79,76,93,81,74,11,6,74,49,86,23,82,24,33,65,2,49,74,6,14,11,82,32,34,41,78,5},new int[]{82,67,38,85,78,83,2,93,39,17,51,17,97,99,35,98,82,84,29,68,91,86,49,16,2,50,10,34,18,45},new int[]{71,44,54,31,93,84,28,82,87,53,89,45,97,23,74,76,35,4,71,92,35,68,53,2,8,38,95,68,18,6},new int[]{37,28,49,99,51,64,10,80,69,45,85,58,41,56,39,67,3,77,35,75,46,44,38,70,75,19,21,91,43,78},new int[]{68,31,36,20,86,37,17,3,10,68,61,59,95,80,73,52,96,23,54,33,45,74,55,83,60,55,88,59,77,9},new int[]{55,81,74,8,73,6,86,64,38,76,80,62,64,11,62,72,95,22,27,57,83,85,60,36,76,28,78,24,25,80},new int[]{85,85,15,8,23,92,30,74,79,90,62,20,96,61,46,80,40,7,51,27,28,43,83,39,94,10,49,98,27,84},new int[]{91,70,64,86,70,85,54,69,14,67,43,22,9,91,10,84,93,3,5,87,59,54,59,82,8,73,22,33,53,64},new int[]{82,37,42,38,4,98,16,82,47,87,9,34,36,92,10,72,87,72,22,40,12,96,12,30,41,18,33,37,27,45}}); param0.add(new int[][]{new int[]{-96,-90,-78,-74,-70,-60,-52,-50,-48,-46,-32,-20,-20,-10,-6,-4,4,4,6,8,8,24,32,48,48,58,86,92,98},new int[]{-68,-60,-58,-54,-40,-38,-22,-16,-16,-16,-12,0,4,4,30,30,42,46,48,48,50,52,52,52,66,68,76,78,96},new int[]{-92,-90,-86,-70,-60,-58,-48,-46,-46,-36,-34,-14,-14,-10,-2,12,44,46,52,54,66,70,70,74,76,80,86,90,98},new int[]{-98,-88,-78,-78,-74,-72,-68,-66,-66,-58,-36,-32,-26,-22,-6,-6,8,8,18,20,22,28,34,60,70,70,70,80,90},new int[]{-98,-96,-96,-88,-86,-86,-72,-66,-64,-62,-54,-52,-52,-46,-42,-22,-20,-14,-10,-4,8,14,22,64,74,78,88,96,96},new int[]{-98,-82,-78,-58,-54,-54,-52,-52,-46,-46,-40,-40,-28,-26,-4,0,8,8,12,14,50,52,62,66,68,70,78,94,96},new int[]{-94,-90,-80,-78,-74,-72,-70,-54,-52,-46,-40,-38,-28,-22,-22,-20,16,16,18,18,20,24,44,46,50,58,64,70,76},new int[]{-96,-94,-92,-86,-80,-80,-76,-76,-72,-68,-52,-32,-26,-18,-14,-10,-2,0,4,10,12,18,22,30,44,70,76,78,82},new int[]{-90,-88,-68,-66,-46,-40,-40,-30,-30,-26,-22,-18,-6,-4,-4,6,8,10,10,16,20,20,26,28,36,58,82,90,98},new int[]{-90,-86,-84,-84,-82,-66,-60,-40,-32,-22,-14,4,6,20,22,22,32,34,34,52,58,60,66,70,76,80,88,92,96},new int[]{-96,-90,-80,-80,-66,-66,-46,-36,-36,-28,-20,-10,-4,0,14,20,24,26,32,38,38,44,60,70,70,76,78,86,94},new int[]{-94,-82,-80,-72,-70,-60,-46,-46,-38,-36,-26,-24,-18,-12,-4,18,26,34,38,44,46,50,52,64,68,72,80,80,96},new int[]{-98,-94,-92,-84,-76,-66,-62,-44,-36,-34,-32,-22,2,4,8,18,18,18,18,32,36,42,52,58,70,80,86,94,98},new int[]{-98,-96,-92,-82,-74,-72,-72,-28,-2,0,4,20,32,32,34,34,36,38,50,52,58,60,62,62,80,84,88,88,90},new int[]{-74,-74,-70,-66,-54,-50,-42,-40,-36,-16,-14,-14,-12,-10,-8,-4,10,18,28,58,60,68,68,74,76,84,86,96,98},new int[]{-98,-96,-90,-56,-54,-46,-42,-36,-34,-26,-26,-6,0,2,12,14,24,24,40,50,60,64,64,70,76,78,80,88,90},new int[]{-92,-92,-84,-80,-80,-64,-56,-50,-44,-42,-32,-18,-16,-14,14,24,26,26,30,36,44,46,46,50,56,64,86,86,86},new int[]{-96,-94,-94,-88,-86,-74,-62,-62,-44,-40,-30,-28,-24,-20,14,20,22,40,52,52,56,58,60,60,62,62,84,96,98},new int[]{-98,-92,-92,-54,-54,-50,-48,-48,-40,-40,-30,-26,-24,-12,-6,0,18,24,24,26,26,36,44,48,66,74,86,88,94},new int[]{-98,-98,-94,-90,-88,-80,-76,-68,-60,-58,-56,-42,-38,-28,-26,-4,0,20,22,28,36,50,56,56,60,60,68,86,86},new int[]{-94,-84,-62,-42,-36,-36,-28,-26,-24,-20,-14,-10,0,16,20,22,30,34,40,52,56,56,62,66,76,82,84,92,98},new int[]{-98,-92,-86,-86,-78,-76,-58,-58,-54,-50,-40,-26,-10,-6,0,18,20,24,24,24,38,42,46,54,64,76,80,90,96},new int[]{-86,-84,-78,-76,-66,-62,-60,-56,-46,-32,-22,-18,-18,-10,-2,4,10,14,28,36,42,42,56,60,62,68,74,82,88},new int[]{-98,-98,-76,-72,-64,-64,-62,-60,-48,-44,-42,-36,-36,-30,-24,-12,-8,2,12,16,36,42,44,60,66,68,84,86,88},new int[]{-96,-96,-94,-94,-92,-90,-62,-50,-48,-48,-48,-44,-24,-22,-8,-8,-6,-6,0,16,48,54,54,58,64,74,74,78,88},new int[]{-98,-96,-84,-74,-54,-52,-40,-34,-24,-16,-14,-10,-6,-6,-4,12,16,18,46,46,48,48,56,62,64,78,82,86,90},new int[]{-86,-86,-72,-66,-62,-48,-44,-38,-26,-22,-20,-12,-4,8,10,14,18,30,30,32,42,62,66,70,70,78,84,94,98},new int[]{-98,-88,-82,-80,-68,-68,-68,-66,-64,-52,-50,-46,-44,-42,-36,-34,-2,-2,4,10,26,42,44,62,66,68,76,82,98},new int[]{-98,-92,-88,-88,-86,-62,-50,-46,-32,-28,-20,-4,-2,0,12,20,34,38,42,60,64,64,64,66,66,72,74,88,98}}); param0.add(new int[][]{new int[]{1,1,1,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,1,1,1,0,0,0,0,0,0,1,0,1,1,1,0,0,0,1,0,1,1,1,0,0},new int[]{1,1,0,1,0,1,0,1,0,1,1,0,1,1,0,1,1,1,1,0,1,0,1,1,1,1,1,1,1,1,0,0,1,1,0,1,1,1,1,0,1,1,1},new int[]{1,1,0,0,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,0,0,0,0,1,1,1,1,0,1,0,1,0,1,0,1,0,0,1,1,1,1},new int[]{1,1,1,0,0,0,1,0,1,0,1,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0},new int[]{0,0,1,1,0,1,0,0,0,0,1,1,0,1,0,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0,0,0,1,0,1,0,1,1,0,0,0,1,0},new int[]{0,1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,0,0,1,1,0,0,1,0,1,1,0,1},new int[]{1,1,0,1,1,0,0,1,0,0,0,0,0,0,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,0,1,0,1,0,0,1,1,0,1,1,0,1,0},new int[]{1,1,0,1,0,1,0,0,0,1,0,0,0,1,1,0,0,0,1,1,0,1,1,0,1,1,1,1,0,0,1,0,0,0,1,1,1,1,1,0,0,0,0},new int[]{1,0,1,0,0,0,1,1,0,0,1,1,1,1,0,0,1,0,0,1,1,0,0,0,1,1,0,1,0,1,0,1,0,0,1,1,0,1,0,1,0,0,1},new int[]{0,0,0,0,1,0,1,0,0,0,0,1,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,0},new int[]{0,0,1,0,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,0,1,0,1,0,1,1,1,1,1,0},new int[]{1,0,0,1,0,0,1,0,0,1,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0},new int[]{0,0,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,1,1,1,0,1},new int[]{0,1,0,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,1,0,0,1,0,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,0,0,1},new int[]{0,1,1,1,1,0,0,1,1,0,0,1,1,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,0,1,0,0,1,1,1,0,0,1,0,1,0,1,0},new int[]{0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1,0,0,0,1,0,1,1,1,1,0,1,0,0,1,0,1,0,1,1,0,1,0,0,1,1,1,1},new int[]{1,1,0,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,1,0,1,0,1,0,1,1,1},new int[]{1,1,0,0,1,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,0,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,1,1,0,0,0,1},new int[]{0,0,1,1,1,1,1,1,0,0,1,1,1,1,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,0,1,1,0,1,0,0,0,1,0,0,1,0,1},new int[]{0,1,0,1,0,1,1,1,1,1,0,0,1,1,1,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0},new int[]{0,1,0,1,1,1,1,1,0,1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,1,1,0,0,0,1,0,0,1,0,1,1,0,0,0,1,1,1,1},new int[]{1,0,1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,1,1,1,0,1,0,0,0,0,0,1,0,0,0,1,1,1,0,1,0,1,1,1,0,0,0},new int[]{1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,1,0,0,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0},new int[]{0,1,0,1,0,0,0,0,1,1,0,0,1,0,0,1,0,1,0,0,0,1,1,0,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,1,1},new int[]{1,1,0,0,1,1,0,0,0,1,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,0,0,0,0,1,0,1,1,1,0,1,1,0,0,0,0},new int[]{1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,0,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,1,0,1,1,1,1,0,1,1},new int[]{1,1,0,1,1,1,1,0,1,1,0,1,0,1,1,0,1,0,0,0,0,1,1,0,0,1,0,1,1,0,1,1,0,0,1,0,1,1,1,0,1,0,0},new int[]{1,0,1,0,1,0,0,0,0,0,1,1,1,0,1,1,0,1,1,0,0,1,0,0,0,1,0,1,1,0,1,0,0,0,1,0,0,1,0,0,0,1,1},new int[]{0,1,1,1,0,1,0,0,0,1,1,0,0,0,0,0,0,1,0,1,0,0,1,0,1,1,1,1,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0},new int[]{1,1,1,0,0,0,0,1,1,0,1,1,0,1,0,1,1,0,1,1,0,1,0,0,1,1,0,1,1,0,1,1,1,1,1,1,1,0,1,1,0,1,0},new int[]{1,0,0,1,1,1,1,0,1,0,1,1,0,0,1,0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,1,1,1,0,0,1,1,1,1,1,0,0,1},new int[]{1,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,0,1,1,1,0,0,0,0,1,1,0,1,1,0,1,0,0,0},new int[]{1,1,1,0,1,1,0,0,1,0,1,0,1,0,0,0,1,1,0,0,0,1,1,1,1,0,0,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1},new int[]{1,0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1,0,0,1,1,0,0,1,0,1},new int[]{0,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,1,1,0,1},new int[]{1,0,0,1,1,1,0,0,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0,0,1,0,0,0,0,1,1,1,0,0,1,1,0,0,0,0,1,0,0},new int[]{0,0,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0},new int[]{1,0,1,0,0,1,1,0,0,0,0,0,1,0,0,1,0,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,0,0,1,1,1,0,1,0,1},new int[]{1,0,0,0,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,1,0,1,0,0,1,0,1,1,0},new int[]{1,1,1,1,0,0,0,1,0,0,0,1,0,1,1,1,0,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,0,1,0,0},new int[]{1,1,1,0,0,1,0,1,1,0,1,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1},new int[]{1,1,0,1,1,1,0,0,0,1,0,1,1,0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,1,1},new int[]{1,1,0,1,1,1,0,0,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,1,0,1,1,1,0,0,1,0,0,0,0}}); param0.add(new int[][]{new int[]{12,22,56,63,69},new int[]{8,8,12,57,95},new int[]{40,55,59,65,72},new int[]{2,22,40,72,83},new int[]{2,4,12,31,38}}); param0.add(new int[][]{new int[]{-92,-36,84,62,-94,-74,20,20,92},new int[]{52,-40,-98,-32,58,80,-60,46,80},new int[]{8,8,0,-48,-86,48,-38,-96,92},new int[]{18,-68,-74,92,-70,-36,-32,-16,-16},new int[]{-70,-26,32,-58,82,22,-12,96,-44},new int[]{-68,-54,-94,-84,-68,-70,-30,-76,-52},new int[]{-68,64,68,80,30,12,-82,20,-58},new int[]{-38,-88,24,28,-98,56,-62,-46,98},new int[]{28,-82,-32,74,-94,38,-12,-46,-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,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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},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},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},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},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},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}}); param0.add(new int[][]{new int[]{78,96,83,94,61,52,86,42,64,39,8,48,87,31,77,72,9,9,3,83,2,79,20,84,50,85,32,15,14,70,7,19,43,6,71,16},new int[]{35,5,20,49,27,85,22,1,99,13,57,86,70,34,34,11,50,22,60,58,31,45,64,3,74,95,85,46,32,94,13,90,94,56,25,94},new int[]{52,7,25,18,38,42,26,83,41,20,38,29,71,38,99,53,76,61,98,56,74,46,62,1,1,98,7,36,87,66,77,52,81,27,44,54},new int[]{12,17,86,71,29,39,95,71,53,32,65,93,66,62,97,63,99,48,33,7,28,20,68,98,45,92,9,94,29,43,24,99,9,99,39,88},new int[]{25,71,58,33,26,76,27,56,55,60,28,36,10,18,71,98,61,83,18,62,43,57,23,61,43,34,66,76,25,82,73,79,76,13,6,31},new int[]{79,36,81,72,22,53,90,82,99,10,42,11,36,80,30,95,90,71,57,62,38,97,73,47,66,15,59,62,26,7,25,93,35,24,4,19},new int[]{49,55,96,83,54,53,41,35,52,83,46,58,50,48,53,41,69,36,93,27,7,42,95,90,7,29,93,23,43,18,78,13,70,18,19,91},new int[]{74,42,96,90,95,25,48,8,19,48,59,79,64,90,67,76,33,60,25,32,92,12,38,12,52,73,84,62,72,82,76,30,95,15,22,30},new int[]{61,90,92,47,62,34,56,90,12,81,48,3,37,43,78,41,42,78,22,35,36,98,77,70,22,32,88,22,66,64,81,88,63,67,48,51},new int[]{39,21,32,61,54,32,98,87,66,71,31,81,68,3,60,67,1,71,24,64,52,99,25,85,60,3,17,93,61,74,44,27,74,42,70,22},new int[]{98,61,8,13,47,31,11,99,47,3,21,28,67,3,35,67,71,32,85,62,6,94,99,41,34,7,81,22,74,15,78,48,86,38,54,21},new int[]{57,49,87,34,93,5,91,89,46,63,13,89,59,56,67,24,12,57,96,66,44,32,90,23,14,10,28,12,66,74,17,4,82,92,27,62},new int[]{3,62,20,85,22,98,38,68,57,37,98,22,82,34,65,99,61,66,8,36,92,50,12,73,64,4,61,31,25,2,59,68,47,28,86,93},new int[]{28,6,38,36,93,72,39,55,30,76,96,54,5,73,15,14,12,74,65,44,94,91,6,33,42,87,35,81,57,10,11,33,86,73,89,94},new int[]{8,10,9,84,30,9,35,86,49,37,43,23,43,13,36,82,61,34,12,73,4,70,32,17,34,35,64,80,19,50,58,77,44,66,1,46},new int[]{99,72,9,61,48,92,58,68,33,52,8,47,14,9,13,2,11,49,3,64,60,95,64,59,36,52,10,50,86,9,31,80,31,91,9,25},new int[]{74,65,81,28,88,58,49,92,17,14,31,27,61,52,15,40,33,38,28,92,71,56,34,49,2,55,33,3,3,61,66,95,79,62,79,91},new int[]{47,87,29,43,72,14,76,93,41,18,65,2,17,20,48,59,97,43,94,59,61,79,71,54,93,8,86,4,73,10,66,98,29,48,11,72},new int[]{32,79,33,43,27,60,73,55,27,84,4,97,39,5,25,23,98,1,7,4,48,47,34,79,17,89,87,8,37,22,80,21,81,74,73,31},new int[]{97,59,19,17,65,65,21,37,30,76,41,86,84,30,33,32,38,7,30,56,19,80,86,62,47,19,45,80,16,82,44,27,7,38,6,30},new int[]{64,83,75,9,41,8,61,89,61,49,40,67,75,27,80,9,30,12,99,20,93,42,99,88,76,1,56,10,34,41,50,97,66,62,52,49},new int[]{64,54,22,65,92,84,27,42,10,69,67,18,75,24,38,71,52,79,18,38,70,94,91,77,38,74,91,3,1,85,82,1,52,40,44,60},new int[]{83,17,61,43,30,62,60,35,39,95,91,71,2,50,7,32,51,44,24,18,66,87,62,3,92,87,77,1,25,46,77,15,59,46,88,86},new int[]{83,66,34,2,59,29,65,98,55,93,66,26,75,36,64,60,45,19,75,40,16,34,52,25,8,52,29,39,92,17,70,29,42,33,23,80},new int[]{22,11,32,56,48,20,32,33,49,59,13,53,79,4,33,11,6,71,86,14,98,61,20,80,2,53,68,9,50,26,73,20,87,60,96,99},new int[]{96,64,95,64,34,73,24,52,46,28,94,82,26,1,74,47,14,48,5,33,65,84,72,21,10,60,69,65,57,16,73,2,28,42,14,44},new int[]{57,72,10,97,89,71,74,20,5,82,52,86,39,67,93,19,81,53,21,72,64,6,61,47,89,54,72,47,18,97,53,48,75,65,99,33},new int[]{61,22,43,17,71,62,73,94,48,51,85,46,41,66,31,43,7,29,3,61,28,62,56,34,61,59,49,38,14,33,64,94,14,27,42,28},new int[]{93,66,93,79,99,47,2,8,26,82,73,3,5,43,80,74,29,94,11,16,31,89,16,74,95,87,43,15,77,80,57,27,92,74,6,69},new int[]{64,88,68,15,45,85,22,39,62,24,92,7,61,69,51,32,81,81,62,68,39,26,38,97,62,70,84,80,42,3,60,89,2,61,39,90},new int[]{29,39,6,62,21,87,37,64,88,68,5,75,96,72,37,39,23,97,58,57,81,74,72,91,58,52,68,47,64,46,60,60,65,31,65,46},new int[]{81,39,17,69,41,21,62,88,29,31,3,73,28,99,30,39,48,28,52,62,57,5,9,5,24,77,22,2,44,74,59,68,37,65,94,34},new int[]{47,49,70,54,77,78,41,1,63,45,9,34,18,74,57,70,75,86,67,5,35,92,10,40,59,83,29,16,37,16,80,4,95,26,23,17},new int[]{80,56,23,61,92,5,29,39,82,8,30,80,66,62,31,20,63,75,65,80,63,89,14,22,45,81,9,97,99,5,41,96,24,90,98,67},new int[]{50,69,72,14,34,42,75,83,23,33,14,49,59,98,29,44,87,18,79,26,32,33,63,53,37,1,71,66,12,30,46,69,6,45,45,18},new int[]{21,55,93,44,14,50,63,41,47,23,15,25,63,19,31,63,76,32,79,18,47,93,98,43,79,60,43,8,15,94,56,34,41,74,75,15}}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(0); param1.add(25); param1.add(29); param1.add(16); param1.add(35); param1.add(4); param1.add(4); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1{ public static int f_gold ( int mat [ ] [ ] , int n ) { int i_des , j_des , q ; int tot_energy = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { q = mat [ i ] [ j ] / n ; i_des = q ; j_des = mat [MASK] i ] [ j ] - ( n * q ) ; tot_energy += Math . abs ( i_des - i ) + Math . abs ( j_des - j ) ; } } return tot_energy ; } q = mat [ i ] [ j ] / n ; i_des = q ; j_des = mat [ i ] [ j ] - ( n * q ) ; tot_energy += Math . abs ( i_des - i ) + Math . abs ( j_des - j ) ; } } return tot_energy ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ] [ ]> param0 = new ArrayList<>(); param0.add(new int[][]{new int[]{4,7,10,11,14,22,27,43,45,47,48,48,49,49,51,54,56,57,59,62,63,64,66,79,82,83,87,96,97,97,98},new int[]{1,1,10,13,14,18,31,33,35,37,37,42,43,44,46,54,60,61,63,63,67,67,74,76,81,83,88,91,91,96,97},new int[]{2,3,4,10,11,13,17,27,30,35,35,38,39,44,47,52,52,60,61,65,68,69,71,75,76,76,85,93,94,94,98},new int[]{3,5,5,19,22,23,24,24,27,31,31,32,32,44,46,50,52,54,55,57,58,59,61,61,68,72,76,78,79,85,98},new int[]{7,10,14,15,21,28,30,31,40,46,51,51,52,54,57,58,58,64,67,68,68,71,72,76,79,80,85,88,88,91,93},new int[]{2,5,18,21,21,25,28,31,33,34,37,38,42,45,47,56,64,70,71,75,76,78,78,81,84,88,90,91,98,98,99},new int[]{10,11,14,17,18,22,27,35,36,37,46,53,55,59,59,64,66,66,66,69,69,73,73,74,74,85,86,87,89,93,99},new int[]{11,13,13,14,17,18,19,19,21,25,25,29,36,36,42,43,45,49,57,61,64,65,71,75,84,84,89,94,94,95,98},new int[]{1,1,2,2,10,10,21,22,23,24,24,29,34,40,46,48,49,49,50,60,73,73,75,80,81,85,86,93,96,97,99},new int[]{1,2,10,15,16,18,19,21,23,25,29,29,31,31,32,38,42,43,48,51,54,56,63,74,74,74,88,88,94,94,94},new int[]{19,24,25,27,29,33,34,35,36,37,37,44,45,50,51,51,52,54,59,59,66,69,70,75,77,80,81,84,97,99,99},new int[]{1,2,5,5,7,12,17,19,20,38,44,45,47,48,51,55,59,61,61,64,65,67,74,76,76,77,79,83,86,92,92},new int[]{3,5,5,12,18,23,25,38,38,48,49,57,61,63,67,70,71,75,75,77,78,79,80,80,84,87,92,92,95,96,98},new int[]{1,3,3,5,7,8,9,13,17,21,23,36,38,39,39,41,45,57,71,72,72,73,76,79,80,82,83,87,89,97,99},new int[]{9,10,13,14,14,16,17,23,26,27,28,31,32,38,38,43,45,50,51,52,52,64,66,68,71,78,85,85,85,91,91},new int[]{1,2,2,3,10,12,13,15,15,21,25,26,28,34,45,45,46,46,49,49,52,55,57,61,62,63,70,72,73,84,86},new int[]{5,5,8,13,16,18,21,25,29,33,35,36,39,45,46,47,49,58,66,68,70,71,77,80,83,83,86,87,94,97,98},new int[]{5,9,17,20,24,27,27,27,28,30,32,32,35,39,40,43,45,52,55,56,63,71,76,78,81,86,90,95,97,98,98},new int[]{1,6,6,7,15,22,29,33,38,38,42,42,44,45,53,59,61,62,62,72,75,76,77,77,80,81,89,96,96,97,99},new int[]{3,4,4,10,11,12,16,17,32,33,33,36,40,40,42,42,44,45,47,52,53,56,59,62,64,67,80,80,89,90,94},new int[]{2,3,8,9,15,19,20,21,22,23,23,24,24,28,28,32,36,40,43,46,54,55,65,71,76,83,86,93,93,96,97},new int[]{2,3,3,4,8,11,13,14,18,19,20,22,35,39,45,60,61,64,66,69,70,70,72,72,74,75,79,83,87,90,97},new int[]{19,21,22,23,24,28,30,30,32,41,42,54,56,60,62,65,71,72,72,73,75,75,78,84,85,85,85,85,87,89,92},new int[]{6,7,10,11,11,16,17,20,20,23,31,33,34,36,38,42,44,48,56,57,58,63,64,69,69,70,72,81,85,89,91},new int[]{9,11,13,18,21,22,24,26,26,30,35,42,51,53,55,55,58,58,59,59,61,63,67,75,79,88,88,92,96,98,99},new int[]{9,12,14,17,21,21,32,35,38,39,41,43,45,45,45,55,57,57,63,67,71,72,74,75,76,77,78,83,83,85,97},new int[]{3,4,13,17,20,22,28,32,36,38,39,39,52,56,60,60,61,61,62,64,65,69,71,73,82,88,91,96,96,97,99},new int[]{2,2,13,14,15,19,25,32,33,34,37,38,41,45,45,53,57,59,59,60,68,71,78,80,81,84,93,93,95,99,99},new int[]{5,16,17,18,18,24,27,27,32,35,41,41,49,51,56,60,60,62,67,67,71,78,78,79,82,89,92,92,95,97,98},new int[]{6,7,9,10,10,12,16,19,19,26,28,31,32,33,41,43,46,47,48,49,51,52,58,66,75,75,76,78,81,88,91},new int[]{8,13,18,19,22,26,26,26,27,30,30,32,33,35,35,38,45,53,57,60,63,63,65,71,77,79,81,91,96,98,99}}); param0.add(new int[][]{new int[]{-40}}); 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,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,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,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},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},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},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},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,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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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[][]{new int[]{3,86,3,43,83,22,69,67,38,82,99,59,27,2,8,84,60,93,75,37,65,79,43,69,7,42,44,77,24,58},new int[]{88,63,93,78,89,63,23,39,60,17,94,68,16,76,31,4,66,91,57,98,95,83,22,79,50,34,84,59,59,39},new int[]{37,36,42,78,47,20,40,18,7,56,4,26,25,64,34,28,88,46,21,45,70,75,24,29,79,7,81,32,65,87},new int[]{90,25,86,26,59,67,24,74,37,68,78,5,7,15,63,20,59,90,58,50,82,19,37,64,81,74,62,3,28,87},new int[]{81,75,25,44,42,86,92,29,11,50,77,77,99,69,3,49,89,35,59,95,85,51,36,72,29,74,55,72,58,16},new int[]{82,37,70,98,69,84,29,36,49,94,64,72,17,95,83,51,16,65,89,21,14,4,75,99,39,60,18,65,69,6},new int[]{88,1,88,12,21,19,37,85,43,80,65,79,97,12,45,12,38,62,53,21,86,67,99,12,38,83,30,32,27,29},new int[]{42,25,24,59,60,38,34,96,84,77,14,97,14,1,89,95,62,57,96,59,65,52,72,70,69,36,79,34,68,33},new int[]{69,92,20,1,71,47,28,33,29,80,55,67,17,82,82,68,18,24,51,49,71,62,69,36,97,39,22,97,3,63},new int[]{63,34,94,31,49,43,90,61,1,55,45,29,28,13,44,26,45,14,92,96,9,39,83,53,34,59,73,52,9,28},new int[]{30,46,18,73,90,38,8,49,75,15,39,10,96,85,32,53,4,93,86,7,95,87,95,59,65,22,77,79,66,30},new int[]{92,28,99,32,90,28,2,97,76,97,38,39,77,84,88,19,34,23,81,81,73,13,91,68,6,21,44,30,16,2},new int[]{76,7,20,53,71,29,57,33,32,53,44,25,76,28,91,15,28,14,63,78,75,49,81,93,82,45,59,81,85,97},new int[]{98,10,23,21,48,22,4,43,13,24,69,62,61,11,61,95,89,31,10,77,93,41,45,32,8,42,50,15,57,10},new int[]{85,90,37,19,60,33,71,96,9,10,52,20,73,67,83,18,62,19,17,43,32,15,92,47,59,83,15,45,95,90},new int[]{38,86,16,5,83,44,46,23,96,75,76,15,8,58,29,81,52,30,87,45,62,82,74,69,57,99,60,13,57,92},new int[]{75,52,45,6,41,30,93,17,76,53,20,13,65,38,14,51,83,93,55,83,19,81,70,57,37,95,48,52,25,86},new int[]{75,79,14,80,61,82,79,70,35,31,66,47,8,2,30,96,22,94,68,59,20,29,98,14,95,33,63,72,3,1},new int[]{43,21,47,66,48,27,51,75,20,87,71,98,93,4,59,22,76,65,7,38,21,26,36,86,28,78,62,98,40,5},new int[]{46,57,64,58,2,92,98,82,40,87,80,96,62,53,92,27,74,38,40,72,8,81,64,25,75,54,70,91,95,42},new int[]{97,97,58,63,90,72,76,74,96,96,16,43,65,97,48,95,36,16,57,38,21,11,99,39,67,61,76,89,25,83},new int[]{1,5,93,79,76,93,81,74,11,6,74,49,86,23,82,24,33,65,2,49,74,6,14,11,82,32,34,41,78,5},new int[]{82,67,38,85,78,83,2,93,39,17,51,17,97,99,35,98,82,84,29,68,91,86,49,16,2,50,10,34,18,45},new int[]{71,44,54,31,93,84,28,82,87,53,89,45,97,23,74,76,35,4,71,92,35,68,53,2,8,38,95,68,18,6},new int[]{37,28,49,99,51,64,10,80,69,45,85,58,41,56,39,67,3,77,35,75,46,44,38,70,75,19,21,91,43,78},new int[]{68,31,36,20,86,37,17,3,10,68,61,59,95,80,73,52,96,23,54,33,45,74,55,83,60,55,88,59,77,9},new int[]{55,81,74,8,73,6,86,64,38,76,80,62,64,11,62,72,95,22,27,57,83,85,60,36,76,28,78,24,25,80},new int[]{85,85,15,8,23,92,30,74,79,90,62,20,96,61,46,80,40,7,51,27,28,43,83,39,94,10,49,98,27,84},new int[]{91,70,64,86,70,85,54,69,14,67,43,22,9,91,10,84,93,3,5,87,59,54,59,82,8,73,22,33,53,64},new int[]{82,37,42,38,4,98,16,82,47,87,9,34,36,92,10,72,87,72,22,40,12,96,12,30,41,18,33,37,27,45}}); param0.add(new int[][]{new int[]{-96,-90,-78,-74,-70,-60,-52,-50,-48,-46,-32,-20,-20,-10,-6,-4,4,4,6,8,8,24,32,48,48,58,86,92,98},new int[]{-68,-60,-58,-54,-40,-38,-22,-16,-16,-16,-12,0,4,4,30,30,42,46,48,48,50,52,52,52,66,68,76,78,96},new int[]{-92,-90,-86,-70,-60,-58,-48,-46,-46,-36,-34,-14,-14,-10,-2,12,44,46,52,54,66,70,70,74,76,80,86,90,98},new int[]{-98,-88,-78,-78,-74,-72,-68,-66,-66,-58,-36,-32,-26,-22,-6,-6,8,8,18,20,22,28,34,60,70,70,70,80,90},new int[]{-98,-96,-96,-88,-86,-86,-72,-66,-64,-62,-54,-52,-52,-46,-42,-22,-20,-14,-10,-4,8,14,22,64,74,78,88,96,96},new int[]{-98,-82,-78,-58,-54,-54,-52,-52,-46,-46,-40,-40,-28,-26,-4,0,8,8,12,14,50,52,62,66,68,70,78,94,96},new int[]{-94,-90,-80,-78,-74,-72,-70,-54,-52,-46,-40,-38,-28,-22,-22,-20,16,16,18,18,20,24,44,46,50,58,64,70,76},new int[]{-96,-94,-92,-86,-80,-80,-76,-76,-72,-68,-52,-32,-26,-18,-14,-10,-2,0,4,10,12,18,22,30,44,70,76,78,82},new int[]{-90,-88,-68,-66,-46,-40,-40,-30,-30,-26,-22,-18,-6,-4,-4,6,8,10,10,16,20,20,26,28,36,58,82,90,98},new int[]{-90,-86,-84,-84,-82,-66,-60,-40,-32,-22,-14,4,6,20,22,22,32,34,34,52,58,60,66,70,76,80,88,92,96},new int[]{-96,-90,-80,-80,-66,-66,-46,-36,-36,-28,-20,-10,-4,0,14,20,24,26,32,38,38,44,60,70,70,76,78,86,94},new int[]{-94,-82,-80,-72,-70,-60,-46,-46,-38,-36,-26,-24,-18,-12,-4,18,26,34,38,44,46,50,52,64,68,72,80,80,96},new int[]{-98,-94,-92,-84,-76,-66,-62,-44,-36,-34,-32,-22,2,4,8,18,18,18,18,32,36,42,52,58,70,80,86,94,98},new int[]{-98,-96,-92,-82,-74,-72,-72,-28,-2,0,4,20,32,32,34,34,36,38,50,52,58,60,62,62,80,84,88,88,90},new int[]{-74,-74,-70,-66,-54,-50,-42,-40,-36,-16,-14,-14,-12,-10,-8,-4,10,18,28,58,60,68,68,74,76,84,86,96,98},new int[]{-98,-96,-90,-56,-54,-46,-42,-36,-34,-26,-26,-6,0,2,12,14,24,24,40,50,60,64,64,70,76,78,80,88,90},new int[]{-92,-92,-84,-80,-80,-64,-56,-50,-44,-42,-32,-18,-16,-14,14,24,26,26,30,36,44,46,46,50,56,64,86,86,86},new int[]{-96,-94,-94,-88,-86,-74,-62,-62,-44,-40,-30,-28,-24,-20,14,20,22,40,52,52,56,58,60,60,62,62,84,96,98},new int[]{-98,-92,-92,-54,-54,-50,-48,-48,-40,-40,-30,-26,-24,-12,-6,0,18,24,24,26,26,36,44,48,66,74,86,88,94},new int[]{-98,-98,-94,-90,-88,-80,-76,-68,-60,-58,-56,-42,-38,-28,-26,-4,0,20,22,28,36,50,56,56,60,60,68,86,86},new int[]{-94,-84,-62,-42,-36,-36,-28,-26,-24,-20,-14,-10,0,16,20,22,30,34,40,52,56,56,62,66,76,82,84,92,98},new int[]{-98,-92,-86,-86,-78,-76,-58,-58,-54,-50,-40,-26,-10,-6,0,18,20,24,24,24,38,42,46,54,64,76,80,90,96},new int[]{-86,-84,-78,-76,-66,-62,-60,-56,-46,-32,-22,-18,-18,-10,-2,4,10,14,28,36,42,42,56,60,62,68,74,82,88},new int[]{-98,-98,-76,-72,-64,-64,-62,-60,-48,-44,-42,-36,-36,-30,-24,-12,-8,2,12,16,36,42,44,60,66,68,84,86,88},new int[]{-96,-96,-94,-94,-92,-90,-62,-50,-48,-48,-48,-44,-24,-22,-8,-8,-6,-6,0,16,48,54,54,58,64,74,74,78,88},new int[]{-98,-96,-84,-74,-54,-52,-40,-34,-24,-16,-14,-10,-6,-6,-4,12,16,18,46,46,48,48,56,62,64,78,82,86,90},new int[]{-86,-86,-72,-66,-62,-48,-44,-38,-26,-22,-20,-12,-4,8,10,14,18,30,30,32,42,62,66,70,70,78,84,94,98},new int[]{-98,-88,-82,-80,-68,-68,-68,-66,-64,-52,-50,-46,-44,-42,-36,-34,-2,-2,4,10,26,42,44,62,66,68,76,82,98},new int[]{-98,-92,-88,-88,-86,-62,-50,-46,-32,-28,-20,-4,-2,0,12,20,34,38,42,60,64,64,64,66,66,72,74,88,98}}); param0.add(new int[][]{new int[]{1,1,1,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,1,1,1,0,0,0,0,0,0,1,0,1,1,1,0,0,0,1,0,1,1,1,0,0},new int[]{1,1,0,1,0,1,0,1,0,1,1,0,1,1,0,1,1,1,1,0,1,0,1,1,1,1,1,1,1,1,0,0,1,1,0,1,1,1,1,0,1,1,1},new int[]{1,1,0,0,0,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,0,0,0,0,0,1,1,1,1,0,1,0,1,0,1,0,1,0,0,1,1,1,1},new int[]{1,1,1,0,0,0,1,0,1,0,1,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0},new int[]{0,0,1,1,0,1,0,0,0,0,1,1,0,1,0,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0,0,0,1,0,1,0,1,1,0,0,0,1,0},new int[]{0,1,0,1,0,1,1,0,0,1,0,1,1,1,0,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,0,0,1,1,0,0,1,0,1,1,0,1},new int[]{1,1,0,1,1,0,0,1,0,0,0,0,0,0,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,0,1,0,1,0,0,1,1,0,1,1,0,1,0},new int[]{1,1,0,1,0,1,0,0,0,1,0,0,0,1,1,0,0,0,1,1,0,1,1,0,1,1,1,1,0,0,1,0,0,0,1,1,1,1,1,0,0,0,0},new int[]{1,0,1,0,0,0,1,1,0,0,1,1,1,1,0,0,1,0,0,1,1,0,0,0,1,1,0,1,0,1,0,1,0,0,1,1,0,1,0,1,0,0,1},new int[]{0,0,0,0,1,0,1,0,0,0,0,1,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,0},new int[]{0,0,1,0,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,1,0,0,1,0,1,0,1,1,1,1,1,0},new int[]{1,0,0,1,0,0,1,0,0,1,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0},new int[]{0,0,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,1,1,1,0,1},new int[]{0,1,0,0,1,0,0,1,1,1,0,1,0,0,1,1,1,0,1,1,0,0,1,0,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,0,0,1},new int[]{0,1,1,1,1,0,0,1,1,0,0,1,1,1,0,0,1,0,0,0,1,0,1,0,1,0,0,0,0,1,0,0,1,1,1,0,0,1,0,1,0,1,0},new int[]{0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1,0,0,0,1,0,1,1,1,1,0,1,0,0,1,0,1,0,1,1,0,1,0,0,1,1,1,1},new int[]{1,1,0,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,1,0,1,0,1,0,1,1,1},new int[]{1,1,0,0,1,1,1,0,1,1,0,1,1,1,1,1,1,1,1,1,0,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,1,1,0,0,0,1},new int[]{0,0,1,1,1,1,1,1,0,0,1,1,1,1,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,0,1,1,0,1,0,0,0,1,0,0,1,0,1},new int[]{0,1,0,1,0,1,1,1,1,1,0,0,1,1,1,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0},new int[]{0,1,0,1,1,1,1,1,0,1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,1,1,0,0,0,1,0,0,1,0,1,1,0,0,0,1,1,1,1},new int[]{1,0,1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,1,1,1,0,1,0,0,0,0,0,1,0,0,0,1,1,1,0,1,0,1,1,1,0,0,0},new int[]{1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,1,0,0,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0},new int[]{0,1,0,1,0,0,0,0,1,1,0,0,1,0,0,1,0,1,0,0,0,1,1,0,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,1,1},new int[]{1,1,0,0,1,1,0,0,0,1,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,0,0,0,0,1,0,1,1,1,0,1,1,0,0,0,0},new int[]{1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,0,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,1,0,1,1,1,1,0,1,1},new int[]{1,1,0,1,1,1,1,0,1,1,0,1,0,1,1,0,1,0,0,0,0,1,1,0,0,1,0,1,1,0,1,1,0,0,1,0,1,1,1,0,1,0,0},new int[]{1,0,1,0,1,0,0,0,0,0,1,1,1,0,1,1,0,1,1,0,0,1,0,0,0,1,0,1,1,0,1,0,0,0,1,0,0,1,0,0,0,1,1},new int[]{0,1,1,1,0,1,0,0,0,1,1,0,0,0,0,0,0,1,0,1,0,0,1,0,1,1,1,1,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0},new int[]{1,1,1,0,0,0,0,1,1,0,1,1,0,1,0,1,1,0,1,1,0,1,0,0,1,1,0,1,1,0,1,1,1,1,1,1,1,0,1,1,0,1,0},new int[]{1,0,0,1,1,1,1,0,1,0,1,1,0,0,1,0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,1,1,1,0,0,1,1,1,1,1,0,0,1},new int[]{1,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,0,1,1,1,0,0,0,0,1,1,0,1,1,0,1,0,0,0},new int[]{1,1,1,0,1,1,0,0,1,0,1,0,1,0,0,0,1,1,0,0,0,1,1,1,1,0,0,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1},new int[]{1,0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1,0,0,1,1,0,0,1,0,1},new int[]{0,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,1,1,0,1},new int[]{1,0,0,1,1,1,0,0,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0,0,1,0,0,0,0,1,1,1,0,0,1,1,0,0,0,0,1,0,0},new int[]{0,0,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0},new int[]{1,0,1,0,0,1,1,0,0,0,0,0,1,0,0,1,0,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,0,0,1,1,1,0,1,0,1},new int[]{1,0,0,0,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,1,0,1,0,0,1,0,1,1,0},new int[]{1,1,1,1,0,0,0,1,0,0,0,1,0,1,1,1,0,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,0,1,0,0},new int[]{1,1,1,0,0,1,0,1,1,0,1,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1},new int[]{1,1,0,1,1,1,0,0,0,1,0,1,1,0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,1,1},new int[]{1,1,0,1,1,1,0,0,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,1,0,1,1,1,0,0,1,0,0,0,0}}); param0.add(new int[][]{new int[]{12,22,56,63,69},new int[]{8,8,12,57,95},new int[]{40,55,59,65,72},new int[]{2,22,40,72,83},new int[]{2,4,12,31,38}}); param0.add(new int[][]{new int[]{-92,-36,84,62,-94,-74,20,20,92},new int[]{52,-40,-98,-32,58,80,-60,46,80},new int[]{8,8,0,-48,-86,48,-38,-96,92},new int[]{18,-68,-74,92,-70,-36,-32,-16,-16},new int[]{-70,-26,32,-58,82,22,-12,96,-44},new int[]{-68,-54,-94,-84,-68,-70,-30,-76,-52},new int[]{-68,64,68,80,30,12,-82,20,-58},new int[]{-38,-88,24,28,-98,56,-62,-46,98},new int[]{28,-82,-32,74,-94,38,-12,-46,-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,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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},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},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},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},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},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},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},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}}); param0.add(new int[][]{new int[]{78,96,83,94,61,52,86,42,64,39,8,48,87,31,77,72,9,9,3,83,2,79,20,84,50,85,32,15,14,70,7,19,43,6,71,16},new int[]{35,5,20,49,27,85,22,1,99,13,57,86,70,34,34,11,50,22,60,58,31,45,64,3,74,95,85,46,32,94,13,90,94,56,25,94},new int[]{52,7,25,18,38,42,26,83,41,20,38,29,71,38,99,53,76,61,98,56,74,46,62,1,1,98,7,36,87,66,77,52,81,27,44,54},new int[]{12,17,86,71,29,39,95,71,53,32,65,93,66,62,97,63,99,48,33,7,28,20,68,98,45,92,9,94,29,43,24,99,9,99,39,88},new int[]{25,71,58,33,26,76,27,56,55,60,28,36,10,18,71,98,61,83,18,62,43,57,23,61,43,34,66,76,25,82,73,79,76,13,6,31},new int[]{79,36,81,72,22,53,90,82,99,10,42,11,36,80,30,95,90,71,57,62,38,97,73,47,66,15,59,62,26,7,25,93,35,24,4,19},new int[]{49,55,96,83,54,53,41,35,52,83,46,58,50,48,53,41,69,36,93,27,7,42,95,90,7,29,93,23,43,18,78,13,70,18,19,91},new int[]{74,42,96,90,95,25,48,8,19,48,59,79,64,90,67,76,33,60,25,32,92,12,38,12,52,73,84,62,72,82,76,30,95,15,22,30},new int[]{61,90,92,47,62,34,56,90,12,81,48,3,37,43,78,41,42,78,22,35,36,98,77,70,22,32,88,22,66,64,81,88,63,67,48,51},new int[]{39,21,32,61,54,32,98,87,66,71,31,81,68,3,60,67,1,71,24,64,52,99,25,85,60,3,17,93,61,74,44,27,74,42,70,22},new int[]{98,61,8,13,47,31,11,99,47,3,21,28,67,3,35,67,71,32,85,62,6,94,99,41,34,7,81,22,74,15,78,48,86,38,54,21},new int[]{57,49,87,34,93,5,91,89,46,63,13,89,59,56,67,24,12,57,96,66,44,32,90,23,14,10,28,12,66,74,17,4,82,92,27,62},new int[]{3,62,20,85,22,98,38,68,57,37,98,22,82,34,65,99,61,66,8,36,92,50,12,73,64,4,61,31,25,2,59,68,47,28,86,93},new int[]{28,6,38,36,93,72,39,55,30,76,96,54,5,73,15,14,12,74,65,44,94,91,6,33,42,87,35,81,57,10,11,33,86,73,89,94},new int[]{8,10,9,84,30,9,35,86,49,37,43,23,43,13,36,82,61,34,12,73,4,70,32,17,34,35,64,80,19,50,58,77,44,66,1,46},new int[]{99,72,9,61,48,92,58,68,33,52,8,47,14,9,13,2,11,49,3,64,60,95,64,59,36,52,10,50,86,9,31,80,31,91,9,25},new int[]{74,65,81,28,88,58,49,92,17,14,31,27,61,52,15,40,33,38,28,92,71,56,34,49,2,55,33,3,3,61,66,95,79,62,79,91},new int[]{47,87,29,43,72,14,76,93,41,18,65,2,17,20,48,59,97,43,94,59,61,79,71,54,93,8,86,4,73,10,66,98,29,48,11,72},new int[]{32,79,33,43,27,60,73,55,27,84,4,97,39,5,25,23,98,1,7,4,48,47,34,79,17,89,87,8,37,22,80,21,81,74,73,31},new int[]{97,59,19,17,65,65,21,37,30,76,41,86,84,30,33,32,38,7,30,56,19,80,86,62,47,19,45,80,16,82,44,27,7,38,6,30},new int[]{64,83,75,9,41,8,61,89,61,49,40,67,75,27,80,9,30,12,99,20,93,42,99,88,76,1,56,10,34,41,50,97,66,62,52,49},new int[]{64,54,22,65,92,84,27,42,10,69,67,18,75,24,38,71,52,79,18,38,70,94,91,77,38,74,91,3,1,85,82,1,52,40,44,60},new int[]{83,17,61,43,30,62,60,35,39,95,91,71,2,50,7,32,51,44,24,18,66,87,62,3,92,87,77,1,25,46,77,15,59,46,88,86},new int[]{83,66,34,2,59,29,65,98,55,93,66,26,75,36,64,60,45,19,75,40,16,34,52,25,8,52,29,39,92,17,70,29,42,33,23,80},new int[]{22,11,32,56,48,20,32,33,49,59,13,53,79,4,33,11,6,71,86,14,98,61,20,80,2,53,68,9,50,26,73,20,87,60,96,99},new int[]{96,64,95,64,34,73,24,52,46,28,94,82,26,1,74,47,14,48,5,33,65,84,72,21,10,60,69,65,57,16,73,2,28,42,14,44},new int[]{57,72,10,97,89,71,74,20,5,82,52,86,39,67,93,19,81,53,21,72,64,6,61,47,89,54,72,47,18,97,53,48,75,65,99,33},new int[]{61,22,43,17,71,62,73,94,48,51,85,46,41,66,31,43,7,29,3,61,28,62,56,34,61,59,49,38,14,33,64,94,14,27,42,28},new int[]{93,66,93,79,99,47,2,8,26,82,73,3,5,43,80,74,29,94,11,16,31,89,16,74,95,87,43,15,77,80,57,27,92,74,6,69},new int[]{64,88,68,15,45,85,22,39,62,24,92,7,61,69,51,32,81,81,62,68,39,26,38,97,62,70,84,80,42,3,60,89,2,61,39,90},new int[]{29,39,6,62,21,87,37,64,88,68,5,75,96,72,37,39,23,97,58,57,81,74,72,91,58,52,68,47,64,46,60,60,65,31,65,46},new int[]{81,39,17,69,41,21,62,88,29,31,3,73,28,99,30,39,48,28,52,62,57,5,9,5,24,77,22,2,44,74,59,68,37,65,94,34},new int[]{47,49,70,54,77,78,41,1,63,45,9,34,18,74,57,70,75,86,67,5,35,92,10,40,59,83,29,16,37,16,80,4,95,26,23,17},new int[]{80,56,23,61,92,5,29,39,82,8,30,80,66,62,31,20,63,75,65,80,63,89,14,22,45,81,9,97,99,5,41,96,24,90,98,67},new int[]{50,69,72,14,34,42,75,83,23,33,14,49,59,98,29,44,87,18,79,26,32,33,63,53,37,1,71,66,12,30,46,69,6,45,45,18},new int[]{21,55,93,44,14,50,63,41,47,23,15,25,63,19,31,63,76,32,79,18,47,93,98,43,79,60,43,8,15,94,56,34,41,74,75,15}}); List<Integer> param1 = new ArrayList<>(); param1.add(15); param1.add(0); param1.add(25); param1.add(29); param1.add(16); param1.add(35); param1.add(4); param1.add(4); 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()); } }
[
[ "a) ]", "b) [", "c) {", "d) a", "e) :" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_DIVISIBILITY_LARGE_NUMBER_999{ static boolean f_gold ( String num ) { int n = num . length ( ) ; if ( n == 0 && num . charAt ( 0 ) == '0' ) return true ; if ( n % 3 == 1 ) num = "00" + num ; if ( n % 3 == 2 ) num = "0" + num ; int gSum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int group = 0 ; group += ( num . charAt ( i ++ ) - '0' ) * 100 ; group += ( num . charAt ( i ++ ) - '0' ) * 10 ; group += num . charAt ( i ) - '0' ; gSum += group ; } if ( gSum > 1000 ) { num = Integer . toString ( gSum ) ; n = num . length ( ) ; gSum = f_gold ( num ) ? 1 : 0 ; } return ( gSum == 999 ) ; } ( i ) - '0' ; gSum += group ; } if ( gSum > 1000 ) { num = Integer . toString ( gSum ) ; n = num . length ( ) ; gSum = f_gold ( num ) ? 1 : 0 ; } return ( gSum == 999 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("235764"); param0.add("321308924"); param0.add("101111"); param0.add("1998"); param0.add("339589"); param0.add("0000101"); param0.add("264735"); param0.add("19570453184"); param0.add("000"); param0.add("SsHh"); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_DIVISIBILITY_LARGE_NUMBER_999{ static boolean f_gold ( String num ) { int n = num . length ( ) ; if ( n == 0 && num . charAt ( 0 ) == '0' ) return true ; if ( n % 3 == 1 ) num = "00" + num ; if ( n % 3 == 2 ) num = "0" + num ; int gSum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int group = 0 ; group += ( num . charAt ( i ++ ) - '0' ) * 100 ; group += ( num . charAt ( i ++ ) - '0' ) * 10 ; group += num . charAt ( i ) - '0' ; gSum += group ; } if ( gSum > 1000 ) { num = Integer . toString ( gSum ) ; n = num . length ( ) ; gSum = f_gold ( num ) ? 1 : 0 ; } return ( [MASK] == 999 ) ; }( i ) - '0' ; gSum += group ; } if ( gSum > 1000 ) { num = Integer . toString ( gSum ) ; n = num . length ( ) ; gSum = f_gold ( num ) ? 1 : 0 ; } return ( gSum == 999 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("235764"); param0.add("321308924"); param0.add("101111"); param0.add("1998"); param0.add("339589"); param0.add("0000101"); param0.add("264735"); param0.add("19570453184"); param0.add("000"); param0.add("SsHh"); 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()); } }
gSum
[ "a) n", "b) gSum", "c) ]", "d) if", "e) (sizeof" ]
b
java
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 ; } 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()); } }
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 ] [MASK] 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 ; } 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()); } }
;
[ "a) public", "b) ;", "c) +=", "d) x", "e) <=" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_SUM_ODD_FACTORS_NUMBER{ static int f_gold ( int n ) { int res = 1 ; while ( n % 2 == 0 ) n = n / 2 ; for ( int i = 3 ; i <= Math . sqrt ( n ) ; i ++ ) { int count = 0 , curr_sum = 1 ; int curr_term = 1 ; while ( n % i == 0 ) { count ++ ; n = n / i ; curr_term *= i ; curr_sum += curr_term ; } res *= curr_sum ; } if ( n >= 2 ) res *= ( 1 + n ) ; return res ; } while ( n % i == 0 ) { count ++ ; 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(20); param0.add(6); param0.add(39); param0.add(80); param0.add(88); param0.add(7); param0.add(16); param0.add(27); param0.add(83); param0.add(6); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_SUM_ODD_FACTORS_NUMBER{ static int f_gold ( int n ) { int res = 1 ; while ( n % 2 [MASK] 0 ) n = n / 2 ; for ( int i = 3 ; i <= Math . sqrt ( n ) ; i ++ ) { int count = 0 , curr_sum = 1 ; int curr_term = 1 ; while ( n % i == 0 ) { count ++ ; n = n / i ; curr_term *= i ; curr_sum += curr_term ; } res *= curr_sum ; } if ( n >= 2 ) res *= ( 1 + n ) ; return res ; } while ( n % i == 0 ) { count ++ ; 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(20); param0.add(6); param0.add(39); param0.add(80); param0.add(88); param0.add(7); param0.add(16); param0.add(27); param0.add(83); param0.add(6); 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()); } }
==
[ "a) :", "b) ==", "c) f_gold", "d) {", "e) import" ]
b
java
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 ; } EMENTS_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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE{ static [MASK] 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 ; }EMENTS_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()); } }
int
[ "a) int", "b) unsigned", "c) 1;", "d) =", "e) i" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K{ static int f_gold ( int arr [ ] , int n , int sum ) { HashMap < Integer , Integer > prevSum = new HashMap < > ( ) ; int res = 0 ; int currsum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { currsum += arr [ i ] ; if ( currsum == sum ) res ++ ; if ( prevSum . containsKey ( currsum - sum ) ) res += prevSum . get ( currsum - sum ) ; Integer count = prevSum . get ( currsum ) ; if ( count == null ) prevSum . put ( currsum , 1 ) ; else prevSum . put ( currsum , count + 1 ) ; } return res ; } t ( currsum - sum ) ; Integer count = prevSum . get ( currsum ) ; if ( count == null ) prevSum . put ( currsum , 1 ) ; else prevSum . put ( currsum , count + 1 ) ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{9,18,27,52,70,91}); param0.add(new int[]{60,-88,-48,90,-28,20,18,34,-58,76,-78,-18,68,-48,8,34,60,-34,-10,32,78,-84,-22,54,-18,-82,-70,-58,-20,-76,88,-30,-6,68}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{67,39,22,32,59,44,86,26,46,60,99,12,32,46,16,22,45,85,21,92,77,50,65,23,93,26,23,20,32,83,60,22,11,45,99,31,72}); param0.add(new int[]{-86,-84,-82,-82,-28,-12,4,24,62,72}); param0.add(new int[]{1,0,0,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1}); param0.add(new int[]{8,20,25,27,28,28,30,31,32,36,39,41,51,53,53,54,56,58,59,77,78,85,88,92,99}); param0.add(new int[]{60,40,-96,-76,-34,-18,38,-62,50,56,64,-94,-50,50,-80,42,-66,-42,68,70,78,-18,-24,-48,-92,64,14,24,-94,-98,18,44,-58}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1,1,1}); param0.add(new int[]{73,52,37,80,4,26,3,76,32,79,31,32,8,87,42,50,51}); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(32); param1.add(11); param1.add(25); param1.add(7); param1.add(16); param1.add(13); param1.add(22); param1.add(11); param1.add(8); List<Integer> param2 = new ArrayList<>(); param2.add(4); param2.add(30); param2.add(11); param2.add(25); param2.add(5); param2.add(13); param2.add(18); param2.add(17); param2.add(8); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K{ static int f_gold ( int arr [ ] , int n , int sum ) { HashMap < Integer , Integer > prevSum = new [MASK] < > ( ) ; int res = 0 ; int currsum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { currsum += arr [ i ] ; if ( currsum == sum ) res ++ ; if ( prevSum . containsKey ( currsum - sum ) ) res += prevSum . get ( currsum - sum ) ; Integer count = prevSum . get ( currsum ) ; if ( count == null ) prevSum . put ( currsum , 1 ) ; else prevSum . put ( currsum , count + 1 ) ; } return res ; }t ( currsum - sum ) ; Integer count = prevSum . get ( currsum ) ; if ( count == null ) prevSum . put ( currsum , 1 ) ; else prevSum . put ( currsum , count + 1 ) ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{9,18,27,52,70,91}); param0.add(new int[]{60,-88,-48,90,-28,20,18,34,-58,76,-78,-18,68,-48,8,34,60,-34,-10,32,78,-84,-22,54,-18,-82,-70,-58,-20,-76,88,-30,-6,68}); param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{67,39,22,32,59,44,86,26,46,60,99,12,32,46,16,22,45,85,21,92,77,50,65,23,93,26,23,20,32,83,60,22,11,45,99,31,72}); param0.add(new int[]{-86,-84,-82,-82,-28,-12,4,24,62,72}); param0.add(new int[]{1,0,0,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1}); param0.add(new int[]{8,20,25,27,28,28,30,31,32,36,39,41,51,53,53,54,56,58,59,77,78,85,88,92,99}); param0.add(new int[]{60,40,-96,-76,-34,-18,38,-62,50,56,64,-94,-50,50,-80,42,-66,-42,68,70,78,-18,-24,-48,-92,64,14,24,-94,-98,18,44,-58}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1,1,1}); param0.add(new int[]{73,52,37,80,4,26,3,76,32,79,31,32,8,87,42,50,51}); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(32); param1.add(11); param1.add(25); param1.add(7); param1.add(16); param1.add(13); param1.add(22); param1.add(11); param1.add(8); List<Integer> param2 = new ArrayList<>(); param2.add(4); param2.add(30); param2.add(11); param2.add(25); param2.add(5); param2.add(13); param2.add(18); param2.add(17); param2.add(8); 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()); } }
HashMap
[ "a) <limits.h>", "b) )", "c) HashMap", "d) #include", "e) [" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1{ static int f_gold ( int n ) { int count = 0 ; int x = n & ( n - 1 ) ; if ( n > 0 && x == 0 ) { while ( n > 1 ) { n >>= 1 ; count += 1 ; } return ( count % 2 == 0 ) ? 1 : 0 ; } return 0 ; } ) { int count = 0 ; int x = n & ( n - 1 ) ; if ( n > 0 && x == 0 ) { while ( n > 1 ) { n >>= 1 ; count += 1 ; } return ( count % 2 == 0 ) ? 1 : 0 ; } return 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(1); param0.add(4); param0.add(64); param0.add(-64); param0.add(128); param0.add(1024); param0.add(45); param0.add(33); param0.add(66); param0.add(74); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1{ static int f_gold ( int n ) { int count = 0 ; int x = n & ( n [MASK] 1 ) ; if ( n > 0 && x == 0 ) { while ( n > 1 ) { n >>= 1 ; count += 1 ; } return ( count % 2 == 0 ) ? 1 : 0 ; } return 0 ; }) { int count = 0 ; int x = n & ( n - 1 ) ; if ( n > 0 && x == 0 ) { while ( n > 1 ) { n >>= 1 ; count += 1 ; } return ( count % 2 == 0 ) ? 1 : 0 ; } return 0 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(1); param0.add(4); param0.add(64); param0.add(-64); param0.add(128); param0.add(1024); param0.add(45); param0.add(33); param0.add(66); param0.add(74); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
-
[ "a) );}", "b) char", "c) (x", "d) -", "e) ." ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SWAP_TWO_NIBBLES_BYTE{ static int f_gold ( int x ) { return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) ; } *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SWAP_TWO_NIBBLES_BYTE{ static int f_gold ( int x ) { return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(57); param0.add(99); param0.add(66); param0.add(97); param0.add(95); param0.add(42); param0.add(95); param0.add(89); param0.add(3); param0.add(84); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SWAP_TWO_NIBBLES_BYTE{ [MASK] int f_gold ( int x ) { return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) ; } *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SWAP_TWO_NIBBLES_BYTE{ static int f_gold ( int x ) { return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(57); param0.add(99); param0.add(66); param0.add(97); param0.add(95); param0.add(42); param0.add(95); param0.add(89); param0.add(3); param0.add(84); 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()); } }
static
[ "a) static", "b) :", "c) ;", "d) cmpfunc", "e) int" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES{ static int f_gold ( int arr [ ] , int n ) { int LIS [ ] = new int [ n ] ; int len = 0 ; for ( int i = 0 ; i < n ; i ++ ) LIS [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { for ( int j = 0 ; j < i ; j ++ ) { if ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) LIS [ i ] = Math . max ( LIS [ i ] , LIS [ j ] + 1 ) ; } len = Math . max ( len , LIS [ i ] ) ; } return n - len ; } ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) LIS [ i ] = Math . max ( LIS [ i ] , LIS [ j ] + 1 ) ; } len = Math . max ( len , LIS [ i ] ) ; } return n - len ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,4,12,14,15,18,20,24,25,25,27,33,34,42,46,48,49,50,50,52,55,56,57,58,64,65,66,69,72,75,78,80,84,90,92,95,99}); param0.add(new int[]{-56,6,-74,-30,34,40,-76,-10,-12,-86,-76,36,-72,82,38,68,28,84,98,-84,6,16,-46,8,2,-18,-50,4,-96,88,-84,-38,-82,-54}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{68,79,87,44,3,99,80,6,46,67,72,40,11,18,73,48,18,72,10,38,3,39,26,76,47,15,85,69}); param0.add(new int[]{-96,-94,-94,-74,-68,-60,-58,-56,-56,-52,-52,-50,-44,-40,-26,-24,-10,-8,-6,-2,2,2,12,14,20,24,26,30,38,40,52,52,62,62,68,70,74,76,80,82,90,92}); param0.add(new int[]{1,1,1,0,1}); param0.add(new int[]{1,5,11,20,24,28,29,31,54,58,63,65,66,71,77,80,83,92,93,93}); param0.add(new int[]{-50,-46,-44,-90,2,-38,88,-26,60}); param0.add(new int[]{1,1}); param0.add(new int[]{2,1,19,26,65,47,3,65,9,12,84,59,74,59,30,83,73,67,13,5,64,83,81,92,80,14,58,84,92}); List<Integer> param1 = new ArrayList<>(); param1.add(21); param1.add(22); param1.add(6); param1.add(15); param1.add(31); param1.add(3); param1.add(12); param1.add(7); param1.add(1); param1.add(16); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES{ static int f_gold ( int arr [ ] , int n ) { int LIS [ ] = new int [ n ] ; int len = 0 ; for ( int [MASK] = 0 ; i < n ; i ++ ) LIS [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { for ( int j = 0 ; j < i ; j ++ ) { if ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) LIS [ i ] = Math . max ( LIS [ i ] , LIS [ j ] + 1 ) ; } len = Math . max ( len , LIS [ i ] ) ; } return n - len ; }( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) LIS [ i ] = Math . max ( LIS [ i ] , LIS [ j ] + 1 ) ; } len = Math . max ( len , LIS [ i ] ) ; } return n - len ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,4,12,14,15,18,20,24,25,25,27,33,34,42,46,48,49,50,50,52,55,56,57,58,64,65,66,69,72,75,78,80,84,90,92,95,99}); param0.add(new int[]{-56,6,-74,-30,34,40,-76,-10,-12,-86,-76,36,-72,82,38,68,28,84,98,-84,6,16,-46,8,2,-18,-50,4,-96,88,-84,-38,-82,-54}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{68,79,87,44,3,99,80,6,46,67,72,40,11,18,73,48,18,72,10,38,3,39,26,76,47,15,85,69}); param0.add(new int[]{-96,-94,-94,-74,-68,-60,-58,-56,-56,-52,-52,-50,-44,-40,-26,-24,-10,-8,-6,-2,2,2,12,14,20,24,26,30,38,40,52,52,62,62,68,70,74,76,80,82,90,92}); param0.add(new int[]{1,1,1,0,1}); param0.add(new int[]{1,5,11,20,24,28,29,31,54,58,63,65,66,71,77,80,83,92,93,93}); param0.add(new int[]{-50,-46,-44,-90,2,-38,88,-26,60}); param0.add(new int[]{1,1}); param0.add(new int[]{2,1,19,26,65,47,3,65,9,12,84,59,74,59,30,83,73,67,13,5,64,83,81,92,80,14,58,84,92}); List<Integer> param1 = new ArrayList<>(); param1.add(21); param1.add(22); param1.add(6); param1.add(15); param1.add(31); param1.add(3); param1.add(12); param1.add(7); param1.add(1); param1.add(16); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
i
[ "a) <cstdlib>", "b) )", "c) false;", "d) i", "e) ;" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_REPETITIVE_ELEMENT_1_N_1_2{ static int f_gold ( int arr [ ] , int n ) { int res = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ] ; res = res ^ arr [ n - 1 ] ; return res ; } T_1_N_1_2{ static int f_gold ( int arr [ ] , int n ) { int res = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ] ; res = 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[]{2,2,4,5,5,7,7,7,8,11,14,15,18,19,20,25,25,29,29,31,32,32,33,38,42,48,52,55,60,61,63,71,74,78,82,82,84,84,87,87,88,90,93,94,94}); param0.add(new int[]{46,2,62,60,92,4,26,66,66,90,26,-14,76,-20,-68}); param0.add(new int[]{0,0,0,1,1,1,1,1}); param0.add(new int[]{87,67,11,47,64,81,94,75,58,77,18,2,85,26,6,44,55,19,46,49,5,69,44,12,42,66,46,9,26,49,68,95,6,9,11,72,5,67}); param0.add(new int[]{-98,-94,-92,-82,-78,-64,-62,-58,-52,-44,-40,-38,-8,6,10,20,22,28,30,30,36,54,54,58,64,68,76,78,84,88,90,94,96}); param0.add(new int[]{1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,0,0,0,0,1,1}); param0.add(new int[]{1,14,15,15,21,34,38,39,41,50,60,74,96,97}); param0.add(new int[]{96,-12,-16,-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}); param0.add(new int[]{66,21,21,59,78,8,46,41,16,32,97,93,32,86,91,61,67,61,97,49,66,35,24,35,65,45,83}); List<Integer> param1 = new ArrayList<>(); param1.add(31); param1.add(8); param1.add(4); param1.add(34); param1.add(29); param1.add(17); param1.add(7); param1.add(3); param1.add(21); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_REPETITIVE_ELEMENT_1_N_1_2{ static int f_gold ( int arr [ [MASK] , int n ) { int res = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ] ; res = res ^ arr [ n - 1 ] ; return res ; }T_1_N_1_2{ static int f_gold ( int arr [ ] , int n ) { int res = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ] ; res = 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[]{2,2,4,5,5,7,7,7,8,11,14,15,18,19,20,25,25,29,29,31,32,32,33,38,42,48,52,55,60,61,63,71,74,78,82,82,84,84,87,87,88,90,93,94,94}); param0.add(new int[]{46,2,62,60,92,4,26,66,66,90,26,-14,76,-20,-68}); param0.add(new int[]{0,0,0,1,1,1,1,1}); param0.add(new int[]{87,67,11,47,64,81,94,75,58,77,18,2,85,26,6,44,55,19,46,49,5,69,44,12,42,66,46,9,26,49,68,95,6,9,11,72,5,67}); param0.add(new int[]{-98,-94,-92,-82,-78,-64,-62,-58,-52,-44,-40,-38,-8,6,10,20,22,28,30,30,36,54,54,58,64,68,76,78,84,88,90,94,96}); param0.add(new int[]{1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,0,0,0,0,1,1}); param0.add(new int[]{1,14,15,15,21,34,38,39,41,50,60,74,96,97}); param0.add(new int[]{96,-12,-16,-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}); param0.add(new int[]{66,21,21,59,78,8,46,41,16,32,97,93,32,86,91,61,67,61,97,49,66,35,24,35,65,45,83}); List<Integer> param1 = new ArrayList<>(); param1.add(31); param1.add(8); param1.add(4); param1.add(34); param1.add(29); param1.add(17); param1.add(7); param1.add(3); param1.add(21); 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()); } }
]
[ "a) [", "b) )", "c) #include", "d) ]", "e) [" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CALCULATING_FACTORIALS_USING_STIRLING_APPROXIMATION{ public static int f_gold ( double n ) { if ( n == 1 ) return 1 ; double z ; double e = 2.71 ; z = Math . sqrt ( 2 * 3.14 * n ) * Math . pow ( ( n / e ) , n ) ; return ( int ) ( z ) ; } { public static int f_gold ( double n ) { if ( n == 1 ) return 1 ; double z ; double e = 2.71 ; z = Math . sqrt ( 2 * 3.14 * n ) * Math . pow ( ( n / e ) , n ) ; return ( int ) ( z ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(1.0); param0.add(5.0); param0.add(10.0); param0.add(20.0); param0.add(40.0); param0.add(2.0); param0.add(3.0); param0.add(-1.0); param0.add(4663.43115050185); param0.add(-3722.039522409859); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; [MASK] class CALCULATING_FACTORIALS_USING_STIRLING_APPROXIMATION{ public static int f_gold ( double n ) { if ( n == 1 ) return 1 ; double z ; double e = 2.71 ; z = Math . sqrt ( 2 * 3.14 * n ) * Math . pow ( ( n / e ) , n ) ; return ( int ) ( z ) ; }{ public static int f_gold ( double n ) { if ( n == 1 ) return 1 ; double z ; double e = 2.71 ; z = Math . sqrt ( 2 * 3.14 * n ) * Math . pow ( ( n / e ) , n ) ; return ( int ) ( z ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(1.0); param0.add(5.0); param0.add(10.0); param0.add(20.0); param0.add(40.0); param0.add(2.0); param0.add(3.0); param0.add(-1.0); param0.add(4663.43115050185); param0.add(-3722.039522409859); 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()); } }
public
[ "a) public", "b) arr", "c) int", "d) void", "e) ==" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MODULUS_TWO_FLOAT_DOUBLE_NUMBERS{ static double f_gold ( double a , double b ) { if ( a < 0 ) a = - a ; if ( b < 0 ) b = - b ; double mod = a ; while ( mod >= b ) mod = mod - b ; if ( a < 0 ) return - mod ; return mod ; } tic double f_gold ( double a , double b ) { if ( a < 0 ) a = - a ; if ( b < 0 ) b = - b ; double mod = a ; while ( mod >= b ) mod = mod - b ; if ( a < 0 ) return - mod ; return mod ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(3243.229719038493); param0.add(-4362.665881044217); param0.add(7255.066257575837); param0.add(-6929.554320261099); param0.add(3569.942027998315); param0.add(-6513.849053096595); param0.add(7333.183189243961); param0.add(-2856.1752826258803); param0.add(9787.228111241662); param0.add(-1722.873699288031); List<Double> param1 = new ArrayList<>(); param1.add(5659.926861939672); param1.add(-9196.507113304497); param1.add(2623.200060506935); param1.add(-3009.0234530313287); param1.add(6920.809419868375); param1.add(-70.95992406437102); param1.add(580.3500610971768); param1.add(-9625.97442825802); param1.add(2419.6844962423256); param1.add(-8370.700544254058); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MODULUS_TWO_FLOAT_DOUBLE_NUMBERS{ static double f_gold ( double a , double b ) [MASK] if ( a < 0 ) a = - a ; if ( b < 0 ) b = - b ; double mod = a ; while ( mod >= b ) mod = mod - b ; if ( a < 0 ) return - mod ; return mod ; }tic double f_gold ( double a , double b ) { if ( a < 0 ) a = - a ; if ( b < 0 ) b = - b ; double mod = a ; while ( mod >= b ) mod = mod - b ; if ( a < 0 ) return - mod ; return mod ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(3243.229719038493); param0.add(-4362.665881044217); param0.add(7255.066257575837); param0.add(-6929.554320261099); param0.add(3569.942027998315); param0.add(-6513.849053096595); param0.add(7333.183189243961); param0.add(-2856.1752826258803); param0.add(9787.228111241662); param0.add(-1722.873699288031); List<Double> param1 = new ArrayList<>(); param1.add(5659.926861939672); param1.add(-9196.507113304497); param1.add(2623.200060506935); param1.add(-3009.0234530313287); param1.add(6920.809419868375); param1.add(-70.95992406437102); param1.add(580.3500610971768); param1.add(-9625.97442825802); param1.add(2419.6844962423256); param1.add(-8370.700544254058); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
{
[ "a) {", "b) for", "c) :", "d) ;", "e) int" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SUM_SEQUENCE_2_22_222{ static double f_gold ( int n ) { return 0.0246 * ( Math . pow ( 10 , n ) - 1 - ( 9 * n ) ) ; } ava.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SUM_SEQUENCE_2_22_222{ static double f_gold ( int n ) { return 0.0246 * ( Math . pow ( 10 , n ) - 1 - ( 9 * n ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(88); param0.add(79); param0.add(7); param0.add(36); param0.add(23); param0.add(10); param0.add(27); param0.add(30); param0.add(71); param0.add(6); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SUM_SEQUENCE_2_22_222{ static double f_gold ( int n ) { return 0.0246 * ( Math . pow ( 10 , n ) - 1 - ( 9 * n ) [MASK] ; }ava.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SUM_SEQUENCE_2_22_222{ static double f_gold ( int n ) { return 0.0246 * ( Math . pow ( 10 , n ) - 1 - ( 9 * n ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(88); param0.add(79); param0.add(7); param0.add(36); param0.add(23); param0.add(10); param0.add(27); param0.add(30); param0.add(71); param0.add(6); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
)
[ "a) )", "b) j", "c) 2", "d) (arr)", "e) 2" ]
a
java
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 ; } 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()); } }
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 ] = [MASK] [ j ] + arr [ i ] ; for ( i = 0 ; i < n ; i ++ ) if ( max < msis [ i ] ) max = msis [ i ] ; return max ; } 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()); } }
msis
[ "a) msis", "b) i", "c) ],", "d) (x", "e) checkNumber;" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1{ public static int f_gold ( int n ) { int count = 0 ; for ( int curr = 19 ; ; curr += 9 ) { int sum = 0 ; for ( int x = curr ; x > 0 ; x = x / 10 ) sum = sum + x % 10 ; if ( sum == 10 ) count ++ ; if ( count == n ) return curr ; } } rr = 19 ; ; curr += 9 ) { int sum = 0 ; for ( int x = curr ; x > 0 ; x = x / 10 ) sum = sum + x % 10 ; if ( sum == 10 ) count ++ ; if ( count == n ) return curr ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(93); param0.add(10); param0.add(55); param0.add(94); param0.add(2); param0.add(5); param0.add(37); param0.add(4); param0.add(11); param0.add(46); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1{ public static int f_gold ( int n ) { int count = 0 ; for ( int curr = 19 ; ; curr += 9 ) { int sum = 0 ; for ( int x = curr ; x > 0 ; x = x / [MASK] ) sum = sum + x % 10 ; if ( sum == 10 ) count ++ ; if ( count == n ) return curr ; } }rr = 19 ; ; curr += 9 ) { int sum = 0 ; for ( int x = curr ; x > 0 ; x = x / 10 ) sum = sum + x % 10 ; if ( sum == 10 ) count ++ ; if ( count == n ) return curr ; } } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(93); param0.add(10); param0.add(55); param0.add(94); param0.add(2); param0.add(5); param0.add(37); param0.add(4); param0.add(11); param0.add(46); 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()); } }
10
[ "a) 10", "b) i", "c) k", "d) variable", "e) return" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE{ static int f_gold ( int arr [ ] , int n ) { if ( n <= 0 ) return 0 ; int incl = arr [ 0 ] ; int excl = 0 ; for ( int i = 1 ; i < n ; i ++ ) { int incl_new = arr [ i ] + Math . min ( excl , incl ) ; int excl_new = incl ; incl = incl_new ; excl = excl_new ; } return Math . min ( incl , excl ) ; } ; i < n ; i ++ ) { int incl_new = arr [ i ] + Math . min ( excl , incl ) ; int excl_new = incl ; incl = incl_new ; excl = excl_new ; } return Math . min ( incl , excl ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,17,25,27,29,30,34,49,72,75,90,93,93,94}); param0.add(new int[]{-70,-32,62,0,-10,92,-94,-86,52,6,-26,-92,-10,70,-82,28,86,58,86,-58,84,-80,-18,-92,-34,6,34,36,70,-50,-6,-54,84,22,30,-96,-84,72,2,26,-20,4,48,-98,62,-28,-68}); 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[]{34,40,92,35,29,26,12,66,7,28,86,4,35,79,1,48,41,47,15,75,45,6,3,94,39,50,20,8,58,51,83,44,53,76,19,84,68,54,36,53}); param0.add(new int[]{-98,-98,-92,-92,-88,-82,-74,-70,-68,-68,-64,-60,-52,-52,-42,-42,-38,-36,-36,-34,-26,-24,-22,-12,-2,-2,4,6,44,44,48,54,62,62,64,74,78,82,86,86,90,90,94}); param0.add(new int[]{1,1,0,0,1,0,0,1,1,1}); param0.add(new int[]{9,15,19,29,30,39,40,61}); param0.add(new int[]{92,0,46,70,-60,-50,58,-56,8,-90,84,16,40,-62,50,78,26,-42,-40,98,-52,62,16,-62,-76,-70,-60,32,4,-68,52,-64,70,12,-10}); param0.add(new int[]{0,0,0,1,1,1,1}); param0.add(new int[]{32,96,63,93,53,1,22,19,50,74,6,94,81,85,4,86,88,75,94}); List<Integer> param1 = new ArrayList<>(); param1.add(8); param1.add(36); param1.add(21); param1.add(29); param1.add(36); param1.add(5); param1.add(4); param1.add(21); param1.add(5); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE{ static int f_gold ( int arr [ ] , int n ) { if ( n <= 0 ) return 0 ; int incl = arr [ 0 ] ; int excl = 0 ; for ( int i = 1 ; i < n ; i ++ ) { int incl_new = arr [ i ] + Math . min ( excl , incl ) ; int excl_new = incl ; incl = incl_new ; excl = excl_new ; } return Math . [MASK] ( incl , excl ) ; }; i < n ; i ++ ) { int incl_new = arr [ i ] + Math . min ( excl , incl ) ; int excl_new = incl ; incl = incl_new ; excl = excl_new ; } return Math . min ( incl , excl ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{5,17,25,27,29,30,34,49,72,75,90,93,93,94}); param0.add(new int[]{-70,-32,62,0,-10,92,-94,-86,52,6,-26,-92,-10,70,-82,28,86,58,86,-58,84,-80,-18,-92,-34,6,34,36,70,-50,-6,-54,84,22,30,-96,-84,72,2,26,-20,4,48,-98,62,-28,-68}); 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[]{34,40,92,35,29,26,12,66,7,28,86,4,35,79,1,48,41,47,15,75,45,6,3,94,39,50,20,8,58,51,83,44,53,76,19,84,68,54,36,53}); param0.add(new int[]{-98,-98,-92,-92,-88,-82,-74,-70,-68,-68,-64,-60,-52,-52,-42,-42,-38,-36,-36,-34,-26,-24,-22,-12,-2,-2,4,6,44,44,48,54,62,62,64,74,78,82,86,86,90,90,94}); param0.add(new int[]{1,1,0,0,1,0,0,1,1,1}); param0.add(new int[]{9,15,19,29,30,39,40,61}); param0.add(new int[]{92,0,46,70,-60,-50,58,-56,8,-90,84,16,40,-62,50,78,26,-42,-40,98,-52,62,16,-62,-76,-70,-60,32,4,-68,52,-64,70,12,-10}); param0.add(new int[]{0,0,0,1,1,1,1}); param0.add(new int[]{32,96,63,93,53,1,22,19,50,74,6,94,81,85,4,86,88,75,94}); List<Integer> param1 = new ArrayList<>(); param1.add(8); param1.add(36); param1.add(21); param1.add(29); param1.add(36); param1.add(5); param1.add(4); param1.add(21); param1.add(5); 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()); } }
min
[ "a) n", "b) min", "c) import", "d) area;", "e) <cstdlib>" ]
b
java
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 ; } 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()); } }
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 + [MASK] ] ; minXor = Math . min ( minXor , val ) ; } return minXor ; }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
[ "a) .", "b) ])", "c) 1", "d) <math.h>", "e) mat" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SUM_TWO_LARGE_NUMBERS_1{ static String f_gold ( String str1 , String str2 ) { if ( str1 . length ( ) > str2 . length ( ) ) { String t = str1 ; str1 = str2 ; str2 = t ; } String str = "" ; int n1 = str1 . length ( ) , n2 = str2 . length ( ) ; int diff = n2 - n1 ; int carry = 0 ; for ( int i = n1 - 1 ; i >= 0 ; i -- ) { int sum = ( ( int ) ( str1 . charAt ( i ) - '0' ) + ( int ) ( str2 . charAt ( i + diff ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } for ( int i = n2 - n1 - 1 ; i >= 0 ; i -- ) { int sum = ( ( int ) ( str2 . charAt ( i ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } if ( carry > 0 ) str += ( char ) ( carry + '0' ) ; return new StringBuilder ( str ) . reverse ( ) . toString ( ) ; } rry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } if ( carry > 0 ) str += ( char ) ( carry + '0' ) ; return new StringBuilder ( str ) . reverse ( ) . toString ( ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("G"); param0.add("48578"); param0.add("010"); param0.add("KkGp"); param0.add("48928969618416"); param0.add("0101011010"); param0.add("X"); param0.add("10073867"); param0.add("01110000000"); param0.add("k "); List<String> param1 = new ArrayList<>(); param1.add("FcAiuKhw"); param1.add("5117561223135"); param1.add("00000"); param1.add("nSE"); param1.add("88497275"); param1.add("11"); param1.add("MomtbuxLRR"); param1.add("28"); param1.add("0110"); param1.add("aSSlhOYp"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)).equals(f_gold(param0.get(i),param1.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SUM_TWO_LARGE_NUMBERS_1{ static String f_gold ( String str1 , String str2 ) { if ( str1 . length ( ) > str2 . length ( ) ) { String t = str1 ; str1 = str2 ; str2 = t ; } String str = "" ; int n1 = str1 . length ( ) , n2 = str2 . length ( ) ; int diff = n2 - n1 ; int carry = 0 ; for ( int i = n1 - 1 ; i >= 0 ; i -- ) { int sum = ( ( int ) ( str1 . charAt ( i ) - '0' ) + ( int ) ( str2 . charAt ( i + diff ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } for ( int i = n2 - n1 - 1 ; i >= 0 ; i -- ) { int sum = ( ( int ) ( str2 . charAt ( i ) - [MASK] ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } if ( carry > 0 ) str += ( char ) ( carry + '0' ) ; return new StringBuilder ( str ) . reverse ( ) . toString ( ) ; }rry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } if ( carry > 0 ) str += ( char ) ( carry + '0' ) ; return new StringBuilder ( str ) . reverse ( ) . toString ( ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("G"); param0.add("48578"); param0.add("010"); param0.add("KkGp"); param0.add("48928969618416"); param0.add("0101011010"); param0.add("X"); param0.add("10073867"); param0.add("01110000000"); param0.add("k "); List<String> param1 = new ArrayList<>(); param1.add("FcAiuKhw"); param1.add("5117561223135"); param1.add("00000"); param1.add("nSE"); param1.add("88497275"); param1.add("11"); param1.add("MomtbuxLRR"); param1.add("28"); param1.add("0110"); param1.add("aSSlhOYp"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)).equals(f_gold(param0.get(i),param1.get(i)))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
'0'
[ "a) '0'", "b) :", "c) str1", "d) -", "e) int" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON{ static double f_gold ( double side ) { return ( 2 * ( Math . sqrt ( 3 ) ) * ( side * side ) ) ; } mport java.lang.*; import javafx.util.Pair; public class PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON{ static double f_gold ( double side ) { return ( 2 * ( Math . sqrt ( 3 ) ) * ( side * side ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(1449.255716877097); param0.add(-8772.104874265995); param0.add(2948.419328234334); param0.add(-1184.220109553511); param0.add(7422.825800698956); param0.add(-5808.280006171851); param0.add(829.8963781665169); param0.add(-7368.438572511732); param0.add(5572.033890611617); param0.add(-3998.9441642787706); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON{ static double f_gold ( double side ) { return ( 2 * ( Math . sqrt ( 3 ) ) * ( side * side [MASK] ) ; }mport java.lang.*; import javafx.util.Pair; public class PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON{ static double f_gold ( double side ) { return ( 2 * ( Math . sqrt ( 3 ) ) * ( side * side ) ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Double> param0 = new ArrayList<>(); param0.add(1449.255716877097); param0.add(-8772.104874265995); param0.add(2948.419328234334); param0.add(-1184.220109553511); param0.add(7422.825800698956); param0.add(-5808.280006171851); param0.add(829.8963781665169); param0.add(-7368.438572511732); param0.add(5572.033890611617); param0.add(-3998.9441642787706); 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()); } }
)
[ "a) f_gold", "b) )", "c) 1", "d) return", "e) (" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS{ static int f_gold ( String str [ ] , int n ) { HashMap < String , Integer > m = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( m . containsKey ( str [ i ] ) ) { int get = m . get ( str [ i ] ) ; m . put ( str [ i ] , get + 1 ) ; } else { m . put ( str [ i ] , 1 ) ; } } int res = 0 ; for ( Map . Entry < String , Integer > it : m . entrySet ( ) ) { if ( it . getValue ( ) == 2 ) res ++ ; } return res ; } lse { m . put ( str [ i ] , 1 ) ; } } int res = 0 ; for ( Map . Entry < String , Integer > it : m . entrySet ( ) ) { if ( it . getValue ( ) == 2 ) res ++ ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String [ ]> param0 = new ArrayList<>(); param0.add(new String[]{"hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"}); param0.add(new String[]{"16","946613197072","532052","42780833","511552","1241934","4","3444540","47487223670074","23753","14158","4","95420017116714","16","0845","689000748","976403809728","8922","487784120896","329","611","59101","611","2131059721","53952148295020","445948587","3905249775372","4683180907","7169093","01413852276627","63","5864","40862536595","2280304422294","930028582","05","33447"}); param0.add(new String[]{"001000100000","1010","01011","11","011","1010"}); param0.add(new String[]{"Om", "Om", "Shankar", "Tripathi", "Tom", "Jerry", "Jerry"}); param0.add(new String[]{"2","644","2","42484637089","81578664","0778"}); param0.add(new String[]{"001000101","011010","1","101010011","011010","01","10111000101","0","1","00101101","0","0"}); param0.add(new String[]{"kl","p sH","PwCPMPu","tQoIgPpk","wtsNP WjS","kl ","TXsFWgU","kl","AD","NjjTyFGwNWZcB","jpFQslbGbDI","cEpGAgvpk","EMaDkMOm","YZuNZgfwDIjG","k","hJx jHmGpQYwQP","CIETe","RH","Pj","h","DInR","AEsqOvliQtz","NwzHTALTt LS","LwLR","WvDCzlQF","soJb","WktoldCbWyTO","pIdRJxY","BmpWxjOwTXkjjL","zmtCiQ","g","yBmDW","QhaBZrQnOJaAJ","u","MGTwCKve","UxYQrONag","xsGSz","dqNPTT","U W","ygJKvCEKDClby","M","yXJQHxjyDQDLkT","oJmaREOEk YA","zUwiwhSMdiC","jYgZEktcdgLD","fwyTAAW","GENttdzeGY "}); param0.add(new String[]{"938","074209","0949093096","218622476","71692175","0714","81217924991","74016430795374","52213147","338","939","798161500954","90528060774015","68715","75810","43450","8017","0193164","5945740","212","4589289","2912211026","0","49","8230114","0733435391403","5429","10070"}); param0.add(new String[]{"00","0","00","0101111010100","110"}); param0.add(new String[]{"g","h","ok","h","ok","sqozuC","ut","ZwRcG","ok","MR","jHrWyy","qaJlrokgRHuZH","LjPNzDUKszYmCq","g","ZGjLfMnyAGL","kEZoSxOMEWSFpw","IFtqNaDVnG","iJoJXl","vjrQMyWor","FTEHZqbHGlmHph","QeSdzm","nPostKHkigyJt","mOSekk"}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(32); param1.add(6); param1.add(7); param1.add(6); param1.add(12); param1.add(43); param1.add(20); param1.add(4); param1.add(15); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS{ static int f_gold ( String str [ ] , int n ) { HashMap < String , Integer > m = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( m . containsKey ( str [ i ] ) ) { int get = m . get ( str [ i ] ) ; m . put ( str [ i ] , get + 1 ) ; } else { m . put ( str [ i ] , 1 ) ; } } int res [MASK] 0 ; for ( Map . Entry < String , Integer > it : m . entrySet ( ) ) { if ( it . getValue ( ) == 2 ) res ++ ; } return res ; }lse { m . put ( str [ i ] , 1 ) ; } } int res = 0 ; for ( Map . Entry < String , Integer > it : m . entrySet ( ) ) { if ( it . getValue ( ) == 2 ) res ++ ; } return res ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String [ ]> param0 = new ArrayList<>(); param0.add(new String[]{"hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"}); param0.add(new String[]{"16","946613197072","532052","42780833","511552","1241934","4","3444540","47487223670074","23753","14158","4","95420017116714","16","0845","689000748","976403809728","8922","487784120896","329","611","59101","611","2131059721","53952148295020","445948587","3905249775372","4683180907","7169093","01413852276627","63","5864","40862536595","2280304422294","930028582","05","33447"}); param0.add(new String[]{"001000100000","1010","01011","11","011","1010"}); param0.add(new String[]{"Om", "Om", "Shankar", "Tripathi", "Tom", "Jerry", "Jerry"}); param0.add(new String[]{"2","644","2","42484637089","81578664","0778"}); param0.add(new String[]{"001000101","011010","1","101010011","011010","01","10111000101","0","1","00101101","0","0"}); param0.add(new String[]{"kl","p sH","PwCPMPu","tQoIgPpk","wtsNP WjS","kl ","TXsFWgU","kl","AD","NjjTyFGwNWZcB","jpFQslbGbDI","cEpGAgvpk","EMaDkMOm","YZuNZgfwDIjG","k","hJx jHmGpQYwQP","CIETe","RH","Pj","h","DInR","AEsqOvliQtz","NwzHTALTt LS","LwLR","WvDCzlQF","soJb","WktoldCbWyTO","pIdRJxY","BmpWxjOwTXkjjL","zmtCiQ","g","yBmDW","QhaBZrQnOJaAJ","u","MGTwCKve","UxYQrONag","xsGSz","dqNPTT","U W","ygJKvCEKDClby","M","yXJQHxjyDQDLkT","oJmaREOEk YA","zUwiwhSMdiC","jYgZEktcdgLD","fwyTAAW","GENttdzeGY "}); param0.add(new String[]{"938","074209","0949093096","218622476","71692175","0714","81217924991","74016430795374","52213147","338","939","798161500954","90528060774015","68715","75810","43450","8017","0193164","5945740","212","4589289","2912211026","0","49","8230114","0733435391403","5429","10070"}); param0.add(new String[]{"00","0","00","0101111010100","110"}); param0.add(new String[]{"g","h","ok","h","ok","sqozuC","ut","ZwRcG","ok","MR","jHrWyy","qaJlrokgRHuZH","LjPNzDUKszYmCq","g","ZGjLfMnyAGL","kEZoSxOMEWSFpw","IFtqNaDVnG","iJoJXl","vjrQMyWor","FTEHZqbHGlmHph","QeSdzm","nPostKHkigyJt","mOSekk"}); List<Integer> param1 = new ArrayList<>(); param1.add(10); param1.add(32); param1.add(6); param1.add(7); param1.add(6); param1.add(12); param1.add(43); param1.add(20); param1.add(4); param1.add(15); 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()); } }
=
[ "a) '", "b) =", "c) <=", "d) }", "e) }" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY{ static double f_gold ( int [ ] A , int K ) { int n = A . length ; double [ ] pre_sum = new double [ n + 1 ] ; pre_sum [ 0 ] = 0 ; for ( int i = 0 ; i < n ; i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ] ; double [ ] dp = new double [ n ] ; double sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i ) ; for ( int k = 0 ; k < K - 1 ; k ++ ) for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ; return dp [ 0 ] ; } for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ; return dp [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,11,14,27,32,37,39,49,52,53,57,62,67,67,68,69,76,77,78,81,85,85,87,91,91,91,99,99,99}); param0.add(new int[]{80,12,32,44,24,82,-40,42,26,36,58,52,-34,44,12,-18,-72,52,2,-8,22,-18,98,-60,62,92,-46,20,20,-46,52,94,0,-28,-22,80,26,-92,-50,48,-80}); 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}); param0.add(new int[]{32,16,67,53,99,56,80,92,84,21,36,46,94,31,63,67,59,88,41,17,74,47,95,12,27,99,32,4,82,31,65,40,93,72,23,33,93,9,62,47}); param0.add(new int[]{-92,-86,-80,-78,-72,-70,-70,-68,-66,-62,-60,-54,-54,-52,-52,-40,-36,-32,-28,-26,-22,-22,-20,-16,-16,-8,0,6,8,10,14,18,20,42,46,52,60,66,68,70,74,86,88,88,92,94,98}); param0.add(new int[]{1,0,0,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0}); param0.add(new int[]{1,1,3,3,6,7,10,11,12,13,16,16,22,23,24,27,28,30,30,30,31,33,35,35,39,40,41,52,52,58,59,60,61,61,66,66,71,73,74,75,75,76,80,83,85,95,96,97,97}); param0.add(new int[]{28,-52,48,96,54,94,60,18}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{26,80,12,87,90,98,46,91,38,46,20,64,53,4,60,87,44,88,22,30}); List<Integer> param1 = new ArrayList<>(); param1.add(24); param1.add(26); param1.add(15); param1.add(36); param1.add(36); param1.add(16); param1.add(34); param1.add(7); param1.add(31); param1.add(19); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY{ static double f_gold ( int [ ] A , int K ) { int n = A . length ; double [ ] pre_sum = new double [ n + 1 ] ; pre_sum [ 0 ] = 0 ; for ( int i = 0 ; i < n ; i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ] ; double [ ] dp = new double [ n ] ; double sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i ) ; for ( int k = 0 ; k < K - 1 ; k ++ ) for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 [MASK] j < n ; j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ; return dp [ 0 ] ; } for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ; return dp [ 0 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,11,14,27,32,37,39,49,52,53,57,62,67,67,68,69,76,77,78,81,85,85,87,91,91,91,99,99,99}); param0.add(new int[]{80,12,32,44,24,82,-40,42,26,36,58,52,-34,44,12,-18,-72,52,2,-8,22,-18,98,-60,62,92,-46,20,20,-46,52,94,0,-28,-22,80,26,-92,-50,48,-80}); 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}); param0.add(new int[]{32,16,67,53,99,56,80,92,84,21,36,46,94,31,63,67,59,88,41,17,74,47,95,12,27,99,32,4,82,31,65,40,93,72,23,33,93,9,62,47}); param0.add(new int[]{-92,-86,-80,-78,-72,-70,-70,-68,-66,-62,-60,-54,-54,-52,-52,-40,-36,-32,-28,-26,-22,-22,-20,-16,-16,-8,0,6,8,10,14,18,20,42,46,52,60,66,68,70,74,86,88,88,92,94,98}); param0.add(new int[]{1,0,0,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0}); param0.add(new int[]{1,1,3,3,6,7,10,11,12,13,16,16,22,23,24,27,28,30,30,30,31,33,35,35,39,40,41,52,52,58,59,60,61,61,66,66,71,73,74,75,75,76,80,83,85,95,96,97,97}); param0.add(new int[]{28,-52,48,96,54,94,60,18}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{26,80,12,87,90,98,46,91,38,46,20,64,53,4,60,87,44,88,22,30}); List<Integer> param1 = new ArrayList<>(); param1.add(24); param1.add(26); param1.add(15); param1.add(36); param1.add(36); param1.add(16); param1.add(34); param1.add(7); param1.add(31); param1.add(19); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
;
[ "a) (arr)", "b) ;", "c) false", "d) if", "e) i" ]
b
java
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 ; } an 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()); } }
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 ; [MASK] <= num ; n ++ ) { sum = sum + n ; if ( sum == num ) return true ; } return false ; }an 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()); } }
sum
[ "a) s", "b) (", "c) if", "d) sum", "e) ]," ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS{ static int f_gold ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == x ) { return i ; } } return - 1 ; } ET_2_ASYMPTOTIC_ANALYSIS{ static int f_gold ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == x ) { return i ; } } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,5,5,11,13,14,15,19,22,22,23,26,29,29,36,44,48,49,65,65,67,68,70,76,79,79,81,85,88,91,91,92,92,97}); param0.add(new int[]{-24,-78,-32,-48,0,4,-42}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{38,14,75,16,91,11,98,43,67,9,21,10,82,72,32,81,48,60,2,91,10,90,12,83}); param0.add(new int[]{-92,-92,-82,-80,-76,-66,-64,-64,-56,-48,-38,-38,-34,-32,-32,-10,-8,-6,-2,0,8,10,18,20,22,22,30,34,38,38,38,44,50,52,56,64,64,66,70,76,88}); param0.add(new int[]{0,1,1,0,0,1,1,0,0,0,1,1,1,1}); param0.add(new int[]{1,4,4,4,4,8,12,13,14,14,22,25,25,27,29,33,36,38,40,40,40,41,47,47,47,48,48,50,51,52,52,52,55,56,59,59,62,64,66,77,82,84,90,91,91,93}); param0.add(new int[]{-90,-60,-58,-72,92,54,-32,-70,-94,18,64,-90,-90,-56,82,-14,-74,-96,-90,-8,-48,76,-28,10,-52,-8,-46,-32,82,46,58,92,4,48,-96,-66,60,60,62,-68}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{42,17,77,96,72,36,74,97,7,94,80,7,27,58,49,81,51,9}); List<Integer> param1 = new ArrayList<>(); param1.add(17); param1.add(4); param1.add(6); param1.add(17); param1.add(25); param1.add(11); param1.add(38); param1.add(22); param1.add(8); param1.add(16); List<Integer> param2 = new ArrayList<>(); param2.add(5); param2.add(0); param2.add(0); param2.add(75); param2.add(25); param2.add(-1); param2.add(4); param2.add(22); param2.add(8); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS{ static int f_gold ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n [MASK] i ++ ) { if ( arr [ i ] == x ) { return i ; } } return - 1 ; }ET_2_ASYMPTOTIC_ANALYSIS{ static int f_gold ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == x ) { return i ; } } return - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{4,5,5,11,13,14,15,19,22,22,23,26,29,29,36,44,48,49,65,65,67,68,70,76,79,79,81,85,88,91,91,92,92,97}); param0.add(new int[]{-24,-78,-32,-48,0,4,-42}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{38,14,75,16,91,11,98,43,67,9,21,10,82,72,32,81,48,60,2,91,10,90,12,83}); param0.add(new int[]{-92,-92,-82,-80,-76,-66,-64,-64,-56,-48,-38,-38,-34,-32,-32,-10,-8,-6,-2,0,8,10,18,20,22,22,30,34,38,38,38,44,50,52,56,64,64,66,70,76,88}); param0.add(new int[]{0,1,1,0,0,1,1,0,0,0,1,1,1,1}); param0.add(new int[]{1,4,4,4,4,8,12,13,14,14,22,25,25,27,29,33,36,38,40,40,40,41,47,47,47,48,48,50,51,52,52,52,55,56,59,59,62,64,66,77,82,84,90,91,91,93}); param0.add(new int[]{-90,-60,-58,-72,92,54,-32,-70,-94,18,64,-90,-90,-56,82,-14,-74,-96,-90,-8,-48,76,-28,10,-52,-8,-46,-32,82,46,58,92,4,48,-96,-66,60,60,62,-68}); param0.add(new int[]{0,0,0,0,0,0,1,1,1,1}); param0.add(new int[]{42,17,77,96,72,36,74,97,7,94,80,7,27,58,49,81,51,9}); List<Integer> param1 = new ArrayList<>(); param1.add(17); param1.add(4); param1.add(6); param1.add(17); param1.add(25); param1.add(11); param1.add(38); param1.add(22); param1.add(8); param1.add(16); List<Integer> param2 = new ArrayList<>(); param2.add(5); param2.add(0); param2.add(0); param2.add(75); param2.add(25); param2.add(-1); param2.add(4); param2.add(22); param2.add(8); 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()); } }
;
[ "a) ;", "b) arr", "c) <cstdlib>", "d) (", "e) int" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER{ static boolean f_gold ( char [ ] str1 , char [ ] str2 ) { int n1 = str1 . length ; int n2 = str2 . length ; if ( n1 != n2 ) return false ; Arrays . sort ( str1 ) ; Arrays . sort ( str2 ) ; for ( int i = 0 ; i < n1 ; i ++ ) if ( str1 [ i ] != str2 [ i ] ) return false ; return true ; } th ; if ( n1 != n2 ) return false ; Arrays . sort ( str1 ) ; Arrays . sort ( str2 ) ; for ( int i = 0 ; i < n1 ; i ++ ) if ( str1 [ i ] != str2 [ i ] ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("LISTEN"); param0.add("TRIANGLE"); param0.add("test"); param0.add("night"); param0.add("Inch"); param0.add("Dusty"); param0.add("GJLMOOSTTXaabceefgllpwz"); param0.add("41658699122772743330"); param0.add("0000000000000000000000001111111111111111111"); param0.add("ERioPYDqgTSz bVCW"); List<String> param1 = new ArrayList<>(); param1.add("SILENT"); param1.add("INTEGRAL"); param1.add("ttew"); param1.add("thing"); param1.add("Study"); param1.add("1"); param1.add("EJRXYajoy"); param1.add("9931020"); param1.add("0000000000000000000001111111111111111111111"); param1.add("GLajZE"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i).toCharArray(),param1.get(i).toCharArray()) == f_gold(param0.get(i).toCharArray(),param1.get(i).toCharArray())) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER{ static boolean f_gold ( char [ ] [MASK] , char [ ] str2 ) { int n1 = str1 . length ; int n2 = str2 . length ; if ( n1 != n2 ) return false ; Arrays . sort ( str1 ) ; Arrays . sort ( str2 ) ; for ( int i = 0 ; i < n1 ; i ++ ) if ( str1 [ i ] != str2 [ i ] ) return false ; return true ; }th ; if ( n1 != n2 ) return false ; Arrays . sort ( str1 ) ; Arrays . sort ( str2 ) ; for ( int i = 0 ; i < n1 ; i ++ ) if ( str1 [ i ] != str2 [ i ] ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("LISTEN"); param0.add("TRIANGLE"); param0.add("test"); param0.add("night"); param0.add("Inch"); param0.add("Dusty"); param0.add("GJLMOOSTTXaabceefgllpwz"); param0.add("41658699122772743330"); param0.add("0000000000000000000000001111111111111111111"); param0.add("ERioPYDqgTSz bVCW"); List<String> param1 = new ArrayList<>(); param1.add("SILENT"); param1.add("INTEGRAL"); param1.add("ttew"); param1.add("thing"); param1.add("Study"); param1.add("1"); param1.add("EJRXYajoy"); param1.add("9931020"); param1.add("0000000000000000000001111111111111111111111"); param1.add("GLajZE"); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i).toCharArray(),param1.get(i).toCharArray()) == f_gold(param0.get(i).toCharArray(),param1.get(i).toCharArray())) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
str1
[ "a) i", "b) between", "c) 2", "d) str1", "e) ==" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_SWAPS_REQUIRED_BRING_ELEMENTS_LESS_EQUAL_K_TOGETHER{ static int f_gold ( int arr [ ] , int n , int k ) { int count = 0 ; for ( int i = 0 ; i < n ; ++ i ) if ( arr [ i ] <= k ) ++ count ; int bad = 0 ; for ( int i = 0 ; i < count ; ++ i ) if ( arr [ i ] > k ) ++ bad ; int ans = bad ; for ( int i = 0 , j = count ; j < n ; ++ i , ++ j ) { if ( arr [ i ] > k ) -- bad ; if ( arr [ j ] > k ) ++ bad ; ans = Math . min ( ans , bad ) ; } return ans ; } ns = bad ; for ( int i = 0 , j = count ; j < n ; ++ i , ++ j ) { if ( arr [ i ] > k ) -- bad ; if ( arr [ j ] > k ) ++ bad ; ans = Math . min ( ans , bad ) ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,12,15,30,33,34,53,66,73,74,76,77,85,90}); param0.add(new int[]{-62,-20,-26,-24,92,66,-74,-4,18,-82,-36,92,-4,92,-80,56,-24,4,-48,-10,-14,-46,-16,-58,-58,-6,-68,-22,-82,-16,76,-30,-86,-38,-66,28,58,30,-44,-56}); param0.add(new int[]{0,0,0,0,0,1,1}); param0.add(new int[]{8,48,64,77,61,60,96,95,41,68,9,67,10,66,16,59,83,21,47,16,13,85,52,11,48,31,99,57,57,44,66,93,80,69,23,2,55,90}); param0.add(new int[]{-80,-58,-40,-34,14,36,48,56,58,60,84,90,92,92}); param0.add(new int[]{1,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,0,0,1}); param0.add(new int[]{4,4,8,9,13,17,18,19,21,22,22,23,27,28,30,44,46,48,53,53,55,60,61,62,68,70,70,71,73,80,82,82,85,88,90,93,99}); param0.add(new int[]{-28,50,82,-32,32,-78,12,50,38,34,-10,6,86,-56,-2}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{37,88,83,91,11,39,98,70,93,74,24,90,66,3,6,28}); List<Integer> param1 = new ArrayList<>(); param1.add(9); param1.add(24); param1.add(5); param1.add(36); param1.add(7); param1.add(26); param1.add(28); param1.add(13); param1.add(9); param1.add(12); List<Integer> param2 = new ArrayList<>(); param2.add(8); param2.add(28); param2.add(6); param2.add(24); param2.add(8); param2.add(23); param2.add(36); param2.add(9); param2.add(8); param2.add(12); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_SWAPS_REQUIRED_BRING_ELEMENTS_LESS_EQUAL_K_TOGETHER{ static int f_gold ( int arr [ ] , int n , int k ) { int count = 0 ; for ( int i = 0 ; i < n ; ++ i ) if ( arr [ i ] <= k ) ++ count ; int bad = 0 ; for ( int i = 0 ; i < count ; ++ i ) if ( arr [ i ] > k ) ++ bad ; int ans = bad ; for ( int i = 0 , j = count ; j < n ; ++ i [MASK] ++ j ) { if ( arr [ i ] > k ) -- bad ; if ( arr [ j ] > k ) ++ bad ; ans = Math . min ( ans , bad ) ; } return ans ; }ns = bad ; for ( int i = 0 , j = count ; j < n ; ++ i , ++ j ) { if ( arr [ i ] > k ) -- bad ; if ( arr [ j ] > k ) ++ bad ; ans = Math . min ( ans , bad ) ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{7,12,15,30,33,34,53,66,73,74,76,77,85,90}); param0.add(new int[]{-62,-20,-26,-24,92,66,-74,-4,18,-82,-36,92,-4,92,-80,56,-24,4,-48,-10,-14,-46,-16,-58,-58,-6,-68,-22,-82,-16,76,-30,-86,-38,-66,28,58,30,-44,-56}); param0.add(new int[]{0,0,0,0,0,1,1}); param0.add(new int[]{8,48,64,77,61,60,96,95,41,68,9,67,10,66,16,59,83,21,47,16,13,85,52,11,48,31,99,57,57,44,66,93,80,69,23,2,55,90}); param0.add(new int[]{-80,-58,-40,-34,14,36,48,56,58,60,84,90,92,92}); param0.add(new int[]{1,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,0,0,1}); param0.add(new int[]{4,4,8,9,13,17,18,19,21,22,22,23,27,28,30,44,46,48,53,53,55,60,61,62,68,70,70,71,73,80,82,82,85,88,90,93,99}); param0.add(new int[]{-28,50,82,-32,32,-78,12,50,38,34,-10,6,86,-56,-2}); param0.add(new int[]{0,0,0,0,1,1,1,1,1,1}); param0.add(new int[]{37,88,83,91,11,39,98,70,93,74,24,90,66,3,6,28}); List<Integer> param1 = new ArrayList<>(); param1.add(9); param1.add(24); param1.add(5); param1.add(36); param1.add(7); param1.add(26); param1.add(28); param1.add(13); param1.add(9); param1.add(12); List<Integer> param2 = new ArrayList<>(); param2.add(8); param2.add(28); param2.add(6); param2.add(24); param2.add(8); param2.add(23); param2.add(36); param2.add(9); param2.add(8); param2.add(12); 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()); } }
,
[ "a) ,", "b) long", "c) <=", "d) )", "e) )" ]
a
java
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 ; } } nt 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()); } }
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 [MASK] ] , 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 ; } }nt 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()); } }
[
[ "a) [", "b) +", "c) ,", "d) y;", "e) ]" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_CALCULATE_VOLUME_ELLIPSOID{ public static float f_gold ( float r1 , float r2 , float r3 ) { float pi = ( float ) 3.14 ; return ( float ) 1.33 * pi * r1 * r2 * r3 ; } Pair; public class PROGRAM_CALCULATE_VOLUME_ELLIPSOID{ public static float f_gold ( float r1 , float r2 , float r3 ) { float pi = ( float ) 3.14 ; return ( float ) 1.33 * pi * r1 * r2 * r3 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Float> param0 = new ArrayList<>(); param0.add(3287.4842316041018F); param0.add(-3707.427510963942F); param0.add(8980.643174783816F); param0.add(-2698.0187368852694F); param0.add(8627.156664162168F); param0.add(-7316.329924623669F); param0.add(7857.3846206400485F); param0.add(-6502.657905007728F); param0.add(4468.400513325576F); param0.add(-7231.864791620428F); List<Float> param1 = new ArrayList<>(); param1.add(4503.332888443404F); param1.add(-6671.335781753231F); param1.add(3584.781688607942F); param1.add(-1004.7289573934537F); param1.add(9572.27618966978F); param1.add(-6591.043206581106F); param1.add(3671.761679299217F); param1.add(-1412.2240121470609F); param1.add(2272.1999139470304F); param1.add(-8036.087711033032F); List<Float> param2 = new ArrayList<>(); param2.add(8590.24729914204F); param2.add(-2780.4954870801926F); param2.add(2818.469507143102F); param2.add(-9602.530725071243F); param2.add(4783.930377855004F); param2.add(-9760.465488363216F); param2.add(2534.5825334137794F); param2.add(-6135.238350044512F); param2.add(4753.075799180736F); param2.add(-6456.263512521035F); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i),param2.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i),param2.get(i))) + 0.0000001)) < 0.001F) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PROGRAM_CALCULATE_VOLUME_ELLIPSOID{ public static float f_gold ( float r1 , float r2 , float r3 ) { float pi = [MASK] float ) 3.14 ; return ( float ) 1.33 * pi * r1 * r2 * r3 ; }Pair; public class PROGRAM_CALCULATE_VOLUME_ELLIPSOID{ public static float f_gold ( float r1 , float r2 , float r3 ) { float pi = ( float ) 3.14 ; return ( float ) 1.33 * pi * r1 * r2 * r3 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Float> param0 = new ArrayList<>(); param0.add(3287.4842316041018F); param0.add(-3707.427510963942F); param0.add(8980.643174783816F); param0.add(-2698.0187368852694F); param0.add(8627.156664162168F); param0.add(-7316.329924623669F); param0.add(7857.3846206400485F); param0.add(-6502.657905007728F); param0.add(4468.400513325576F); param0.add(-7231.864791620428F); List<Float> param1 = new ArrayList<>(); param1.add(4503.332888443404F); param1.add(-6671.335781753231F); param1.add(3584.781688607942F); param1.add(-1004.7289573934537F); param1.add(9572.27618966978F); param1.add(-6591.043206581106F); param1.add(3671.761679299217F); param1.add(-1412.2240121470609F); param1.add(2272.1999139470304F); param1.add(-8036.087711033032F); List<Float> param2 = new ArrayList<>(); param2.add(8590.24729914204F); param2.add(-2780.4954870801926F); param2.add(2818.469507143102F); param2.add(-9602.530725071243F); param2.add(4783.930377855004F); param2.add(-9760.465488363216F); param2.add(2534.5825334137794F); param2.add(-6135.238350044512F); param2.add(4753.075799180736F); param2.add(-6456.263512521035F); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i),param2.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i),param2.get(i))) + 0.0000001)) < 0.001F) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
(
[ "a) (", "b) return", "c) )", "d) =", "e) arr" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_PRODUCT_SUBSET_ARRAY{ static int f_gold ( int a [ ] , int n ) { if ( n == 1 ) return a [ 0 ] ; int negmax = Integer . MIN_VALUE ; int posmin = Integer . MAX_VALUE ; int count_neg = 0 , count_zero = 0 ; int product = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] == 0 ) { count_zero ++ ; continue ; } if ( a [ i ] < 0 ) { count_neg ++ ; negmax = Math . max ( negmax , a [ i ] ) ; } if ( a [ i ] > 0 && a [ i ] < posmin ) posmin = a [ i ] ; product *= a [ i ] ; } if ( count_zero == n || ( count_neg == 0 && count_zero > 0 ) ) return 0 ; if ( count_neg == 0 ) return posmin ; if ( count_neg % 2 == 0 && count_neg != 0 ) { product = product / negmax ; } return product ; } ( count_neg == 0 && count_zero > 0 ) ) return 0 ; if ( count_neg == 0 ) return posmin ; if ( count_neg % 2 == 0 && count_neg != 0 ) { product = product / negmax ; } return product ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,6,7,8,8,9,12,12,12,13,15,15,15,16,18,18,18,19,20,21,22,22,23,28,29,30,30,33,33,35,35,36,40,43,58,63,73,78,82,83,84,87,89,89,92,94}); param0.add(new int[]{18,-6,-8,98,66,-86,24,6,58,74,82}); 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,1,1}); param0.add(new int[]{97,79,93,41,76,34,94,57,63,98,52,62,96,7,63,44,55,43,36,66,35,14,24,40,26,16,67,19,31,86,64,93,85,86,66,24,73,86,45,99,25,98,38,57}); param0.add(new int[]{-58,-48,-46,-36,0,18}); param0.add(new int[]{1,1,1,0,0,0,1,0,1,0,0,1,1,0,1,0,0,0,0,0,1,0,0,1,1,0,1,1,0,0,1,0,1,0,0,1,0}); param0.add(new int[]{1,3,5,15,18,19,21,23,29,29,33,33,34,37,39,43,43,68,73,74,75,84,87,88,89,90,93}); param0.add(new int[]{74,70,-36,16,10,60,-82,96,-30,58,56,-54,-14,94,10,-82,-80,-40,-72,-68,8,38,-50,-76,34,2,-66,-30,26}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{74,74,8,74,85,41,31,3,84,46,73,39,64,72,28,83,98,27,64,7,95,37,10,38,77,32,69,72,62,96,5,81,34,96,80,25,38}); List<Integer> param1 = new ArrayList<>(); param1.add(23); param1.add(10); param1.add(25); param1.add(30); param1.add(3); param1.add(36); param1.add(18); param1.add(15); param1.add(20); param1.add(33); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_PRODUCT_SUBSET_ARRAY{ static int f_gold ( int a [ ] , int n ) { if ( n == 1 ) return a [ 0 ] ; int negmax = Integer . MIN_VALUE ; int posmin = Integer . MAX_VALUE ; int count_neg = 0 , count_zero = 0 ; int product = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] == 0 ) { count_zero ++ ; continue ; } if ( a [ i ] < 0 ) { count_neg ++ ; negmax = Math . [MASK] ( negmax , a [ i ] ) ; } if ( a [ i ] > 0 && a [ i ] < posmin ) posmin = a [ i ] ; product *= a [ i ] ; } if ( count_zero == n || ( count_neg == 0 && count_zero > 0 ) ) return 0 ; if ( count_neg == 0 ) return posmin ; if ( count_neg % 2 == 0 && count_neg != 0 ) { product = product / negmax ; } return product ; } ( count_neg == 0 && count_zero > 0 ) ) return 0 ; if ( count_neg == 0 ) return posmin ; if ( count_neg % 2 == 0 && count_neg != 0 ) { product = product / negmax ; } return product ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,6,7,8,8,9,12,12,12,13,15,15,15,16,18,18,18,19,20,21,22,22,23,28,29,30,30,33,33,35,35,36,40,43,58,63,73,78,82,83,84,87,89,89,92,94}); param0.add(new int[]{18,-6,-8,98,66,-86,24,6,58,74,82}); 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,1,1}); param0.add(new int[]{97,79,93,41,76,34,94,57,63,98,52,62,96,7,63,44,55,43,36,66,35,14,24,40,26,16,67,19,31,86,64,93,85,86,66,24,73,86,45,99,25,98,38,57}); param0.add(new int[]{-58,-48,-46,-36,0,18}); param0.add(new int[]{1,1,1,0,0,0,1,0,1,0,0,1,1,0,1,0,0,0,0,0,1,0,0,1,1,0,1,1,0,0,1,0,1,0,0,1,0}); param0.add(new int[]{1,3,5,15,18,19,21,23,29,29,33,33,34,37,39,43,43,68,73,74,75,84,87,88,89,90,93}); param0.add(new int[]{74,70,-36,16,10,60,-82,96,-30,58,56,-54,-14,94,10,-82,-80,-40,-72,-68,8,38,-50,-76,34,2,-66,-30,26}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{74,74,8,74,85,41,31,3,84,46,73,39,64,72,28,83,98,27,64,7,95,37,10,38,77,32,69,72,62,96,5,81,34,96,80,25,38}); List<Integer> param1 = new ArrayList<>(); param1.add(23); param1.add(10); param1.add(25); param1.add(30); param1.add(3); param1.add(36); param1.add(18); param1.add(15); param1.add(20); param1.add(33); 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()); } }
max
[ "a) *", "b) max", "c) close", "d) );}", "e) return" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD{ static boolean f_gold ( int n , int k ) { boolean oneSeen = false ; while ( n > 0 ) { int digit = n % k ; if ( digit > 1 ) return false ; if ( digit == 1 ) { if ( oneSeen ) return false ; oneSeen = true ; } n /= k ; } return true ; } ( n > 0 ) { int digit = n % k ; if ( digit > 1 ) return false ; if ( digit == 1 ) { if ( oneSeen ) return false ; oneSeen = true ; } n /= k ; } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(64); param0.add(16); param0.add(27); param0.add(81); param0.add(1); param0.add(69); param0.add(8); param0.add(31); param0.add(43); param0.add(54); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(2); param1.add(3); param1.add(72); param1.add(9); param1.add(17); param1.add(20); param1.add(79); param1.add(81); param1.add(89); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD{ static boolean f_gold ( int n , int k ) { boolean oneSeen = false ; while ( n > 0 ) { int digit = [MASK] % k ; if ( digit > 1 ) return false ; if ( digit == 1 ) { if ( oneSeen ) return false ; oneSeen = true ; } n /= k ; } return true ; } ( n > 0 ) { int digit = n % k ; if ( digit > 1 ) return false ; if ( digit == 1 ) { if ( oneSeen ) return false ; oneSeen = true ; } n /= k ; } return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(64); param0.add(16); param0.add(27); param0.add(81); param0.add(1); param0.add(69); param0.add(8); param0.add(31); param0.add(43); param0.add(54); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(2); param1.add(3); param1.add(72); param1.add(9); param1.add(17); param1.add(20); param1.add(79); param1.add(81); param1.add(89); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
n
[ "a) count;", "b) n", "c) String", "d) for", "e) (" ]
b
java
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 ; } , 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()); } }
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 . [MASK] ( 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 ; }, 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()); } }
put
[ "a) f_gold", "b) f_gold", "c) using", "d) (", "e) put" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE{ public static int f_gold ( int a [ ] , int n , int k ) { HashMap < Integer , Integer > m = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) if ( m . containsKey ( a [ i ] ) ) m . put ( a [ i ] , m . get ( a [ i ] ) + 1 ) ; else m . put ( a [ i ] , 1 ) ; int res = Integer . MAX_VALUE ; Set < Integer > s = m . keySet ( ) ; for ( int temp : s ) if ( m . get ( temp ) == k ) res = Math . min ( res , temp ) ; return ( res != Integer . MAX_VALUE ) ? res : - 1 ; } r . MAX_VALUE ; Set < Integer > s = m . keySet ( ) ; for ( int temp : s ) if ( m . get ( temp ) == k ) res = Math . min ( res , temp ) ; return ( res != Integer . MAX_VALUE ) ? res : - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,5,5,8,11,13,14,15,15,16,18,23,24,26,28,31,33,39,39,39,40,41,44,51,53,55,55,59,59,61,64,65,74,74,76,76,76,77,87,88,88,94,95,96}); param0.add(new int[]{-98,-64,-44,20,-46,96,-48,-54,-26,30,-42,94,58,-58,-54,50,6,-34,-44,-50,-66,-14,-96,74,4,-86,56,-46,-94,-24,-80,58,34,24}); 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}); param0.add(new int[]{55,78,71,60,41,82,45,66,46,5,92,49,57,16,49,40,77,40,44,47,52,58,33,3,27,37,38,56,3,32,7,17,43,35,79,66,50,63,97,12,16}); param0.add(new int[]{-90,-86,-74,-68,-64,-56,-30,-24,-14,-2,0,2,8,16,18,20,24,30,32,36,42,54,62,62,62,62,76,78,90,92,94}); param0.add(new int[]{0,1,0,1,1,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,1,1}); param0.add(new int[]{4,5,5,5,10,13,17,17,20,20,22,25,28,36,40,42,49,51,57,59,65,66,66,68,72,74,78,81,87,88,94,95}); param0.add(new int[]{-12,-20,-78,-10,6,26,-94,-48,22,-2,12,-68,-90,-22,-94,-94,-10,-66,62,-20,74,-90,54,-52,90,50,60,10,56,-32,52,-12,-84,66,-82,34,24,-8,-60,-20,-94,80}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{2,57,53,3,63,29,12,99,21,26,3,35,96,84,48,61}); List<Integer> param1 = new ArrayList<>(); param1.add(27); param1.add(26); param1.add(26); param1.add(32); param1.add(22); param1.add(18); param1.add(28); param1.add(28); param1.add(29); param1.add(10); List<Integer> param2 = new ArrayList<>(); param2.add(2); param2.add(2); param2.add(1); param2.add(3); param2.add(2); param2.add(8); param2.add(7); param2.add(3); param2.add(2); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE{ public static int f_gold ( int a [ ] , int n , int k ) { HashMap < Integer , Integer > m = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) if ( m . containsKey ( a [ i ] ) ) m . put ( a [ i ] , m . get ( a [ i ] ) + 1 ) ; else m . put ( a [ i ] , 1 ) ; int res = Integer . MAX_VALUE ; Set < Integer > s = m . keySet ( ) ; for ( int temp : s ) if ( m . get ( temp ) == k ) res = Math . min ( [MASK] , temp ) ; return ( res != Integer . MAX_VALUE ) ? res : - 1 ; }r . MAX_VALUE ; Set < Integer > s = m . keySet ( ) ; for ( int temp : s ) if ( m . get ( temp ) == k ) res = Math . min ( res , temp ) ; return ( res != Integer . MAX_VALUE ) ? res : - 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{1,5,5,8,11,13,14,15,15,16,18,23,24,26,28,31,33,39,39,39,40,41,44,51,53,55,55,59,59,61,64,65,74,74,76,76,76,77,87,88,88,94,95,96}); param0.add(new int[]{-98,-64,-44,20,-46,96,-48,-54,-26,30,-42,94,58,-58,-54,50,6,-34,-44,-50,-66,-14,-96,74,4,-86,56,-46,-94,-24,-80,58,34,24}); 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}); param0.add(new int[]{55,78,71,60,41,82,45,66,46,5,92,49,57,16,49,40,77,40,44,47,52,58,33,3,27,37,38,56,3,32,7,17,43,35,79,66,50,63,97,12,16}); param0.add(new int[]{-90,-86,-74,-68,-64,-56,-30,-24,-14,-2,0,2,8,16,18,20,24,30,32,36,42,54,62,62,62,62,76,78,90,92,94}); param0.add(new int[]{0,1,0,1,1,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,1,1}); param0.add(new int[]{4,5,5,5,10,13,17,17,20,20,22,25,28,36,40,42,49,51,57,59,65,66,66,68,72,74,78,81,87,88,94,95}); param0.add(new int[]{-12,-20,-78,-10,6,26,-94,-48,22,-2,12,-68,-90,-22,-94,-94,-10,-66,62,-20,74,-90,54,-52,90,50,60,10,56,-32,52,-12,-84,66,-82,34,24,-8,-60,-20,-94,80}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{2,57,53,3,63,29,12,99,21,26,3,35,96,84,48,61}); List<Integer> param1 = new ArrayList<>(); param1.add(27); param1.add(26); param1.add(26); param1.add(32); param1.add(22); param1.add(18); param1.add(28); param1.add(28); param1.add(29); param1.add(10); List<Integer> param2 = new ArrayList<>(); param2.add(2); param2.add(2); param2.add(1); param2.add(3); param2.add(2); param2.add(8); param2.add(7); param2.add(3); param2.add(2); 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()); } }
res
[ "a) <=", "b) count_zero", "c) -", "d) res", "e) (" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class POSITION_OF_RIGHTMOST_SET_BIT{ public static int f_gold ( int n ) { return ( int ) ( ( Math . log10 ( n & - n ) ) / Math . log10 ( 2 ) ) + 1 ; } ava.lang.*; import javafx.util.Pair; public class POSITION_OF_RIGHTMOST_SET_BIT{ public static int f_gold ( int n ) { return ( int ) ( ( Math . log10 ( n & - n ) ) / Math . log10 ( 2 ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(45); param0.add(26); param0.add(74); param0.add(80); param0.add(46); param0.add(67); param0.add(16); param0.add(87); param0.add(27); param0.add(17); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; [MASK] java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class POSITION_OF_RIGHTMOST_SET_BIT{ public static int f_gold ( int n ) { return ( int ) ( ( Math . log10 ( n & - n ) ) / Math . log10 ( 2 ) ) + 1 ; }ava.lang.*; import javafx.util.Pair; public class POSITION_OF_RIGHTMOST_SET_BIT{ public static int f_gold ( int n ) { return ( int ) ( ( Math . log10 ( n & - n ) ) / Math . log10 ( 2 ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(45); param0.add(26); param0.add(74); param0.add(80); param0.add(46); param0.add(67); param0.add(16); param0.add(87); param0.add(27); param0.add(17); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i)) == f_gold(param0.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import
[ "a) import", "b) int", "c) A", "d) mat", "e) *;" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1{ static int f_gold ( int arr [ ] , int n , int x ) { int curr_sum = 0 , min_len = n + 1 ; int start = 0 , end = 0 ; while ( end < n ) { while ( curr_sum <= x && end < n ) { if ( curr_sum <= 0 && x > 0 ) { start = end ; curr_sum = 0 ; } curr_sum += arr [ end ++ ] ; } while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; } m += arr [ end ++ ] ; } while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,5,10,14,15,16,20,23,28,31,35,36,36,43,48,49,55,57,57,58,61,64,64,68,70,70,73,74,76,76,77,81,81,82,87,89,92,99}); param0.add(new int[]{66,-20,12,-48,22,28,40,-30,-6,-96,10,-88,40}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{28,19,38,31,17,27,60,35,19,47,34,51,3,95,33,29,84,46,74,87}); param0.add(new int[]{-48,-2}); param0.add(new int[]{1,1,0,1,1,1,1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,1}); param0.add(new int[]{1,4,4,6,8,10,12,12,13,15,18,20,21,23,25,28,28,33,33,35,35,36,37,38,42,44,63,63,65,65,65,66,70,74,77,78,80,80,84,87,87,89,92,93,94,97,98,99}); param0.add(new int[]{-82,-12,-40,58,22,-76,-94,-28,42,36,64}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{76,65,96,76,1,91,22,29,95,21,73,68,30,52,73,86,52,66,67,37,76,53,68,6,95,81,98,42,63,38,92,78,59,86,10,38,18,15,52,62,16,66}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(11); param1.add(42); param1.add(15); param1.add(1); param1.add(12); param1.add(42); param1.add(10); param1.add(10); param1.add(23); List<Integer> param2 = new ArrayList<>(); param2.add(28); param2.add(12); param2.add(23); param2.add(15); param2.add(1); param2.add(15); param2.add(27); param2.add(6); param2.add(14); param2.add(35); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1{ static int f_gold ( int arr [ ] , int n , int x ) { int curr_sum = 0 , min_len = n + 1 ; int start = 0 , end = 0 ; while ( end < n ) { while ( curr_sum <= x && end < n ) { if ( curr_sum <= 0 && x > 0 ) { start = end ; curr_sum = 0 ; } curr_sum += arr [ [MASK] ++ ] ; } while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; }m += arr [ end ++ ] ; } while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,5,10,14,15,16,20,23,28,31,35,36,36,43,48,49,55,57,57,58,61,64,64,68,70,70,73,74,76,76,77,81,81,82,87,89,92,99}); param0.add(new int[]{66,-20,12,-48,22,28,40,-30,-6,-96,10,-88,40}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{28,19,38,31,17,27,60,35,19,47,34,51,3,95,33,29,84,46,74,87}); param0.add(new int[]{-48,-2}); param0.add(new int[]{1,1,0,1,1,1,1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,1}); param0.add(new int[]{1,4,4,6,8,10,12,12,13,15,18,20,21,23,25,28,28,33,33,35,35,36,37,38,42,44,63,63,65,65,65,66,70,74,77,78,80,80,84,87,87,89,92,93,94,97,98,99}); param0.add(new int[]{-82,-12,-40,58,22,-76,-94,-28,42,36,64}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{76,65,96,76,1,91,22,29,95,21,73,68,30,52,73,86,52,66,67,37,76,53,68,6,95,81,98,42,63,38,92,78,59,86,10,38,18,15,52,62,16,66}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(11); param1.add(42); param1.add(15); param1.add(1); param1.add(12); param1.add(42); param1.add(10); param1.add(10); param1.add(23); List<Integer> param2 = new ArrayList<>(); param2.add(28); param2.add(12); param2.add(23); param2.add(15); param2.add(1); param2.add(15); param2.add(27); param2.add(6); param2.add(14); param2.add(35); 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()); } }
end
[ "a) <iomanip>", "b) end", "c) long", "d) 1,", "e) <bits/stdc++.h>" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1{ static boolean f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n ) { int i = 0 , j = 0 ; if ( m < n ) return false ; Arrays . sort ( arr1 ) ; Arrays . sort ( arr2 ) ; while ( i < n && j < m ) { if ( arr1 [ j ] < arr2 [ i ] ) j ++ ; else if ( arr1 [ j ] == arr2 [ i ] ) { j ++ ; i ++ ; } else if ( arr1 [ j ] > arr2 [ i ] ) return false ; } if ( i < n ) return false ; else return true ; } ) j ++ ; else if ( arr1 [ j ] == arr2 [ i ] ) { j ++ ; i ++ ; } else if ( arr1 [ j ] > arr2 [ i ] ) return false ; } if ( i < n ) 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[]{7,10,10,10,13,17,23,24,25,28,30,33,37,49,49,50,57,60,60,63,63,64,65,65,72,81,84,85,85,94,96}); param0.add(new int[]{12,30,-94,-92,-62,-18,-56,44,-50,-92,6,2,56,-90,0,0,18,86,-58,58,-54,62,-94,94,0,8,82,-68,-88,-18,8,-80,-42,18,62,-8,56,-76,-42,56,44,-2,-20,62,-14,74,-86,-76}); 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}); param0.add(new int[]{94,26,32,20,46,55,9,51,57,80,45,38,68,12,90,10,80,65,12,52,51,86,64,57,93,19,30,92,85,82,24,26,36,56}); param0.add(new int[]{-98,-90,-86,-86,-84,-84,-82,-80,-78,-72,-70,-68,-66,-64,-52,-52,-50,-38,-28,-26,-24,-14,-8,16,26,26,28,34,36,40,42,44,44,46,50,60,68,78,80,86,90,92,98}); param0.add(new int[]{1,0,1,0,1,0,0,0,1,0,0,0,0,1,1,0,1,1}); param0.add(new int[]{6,8,11,13,14,26,26,41,48,70,82,83,84,88,96}); param0.add(new int[]{-88,80,62,76,48,92,18,-94,-62,98,-46,-50,70,32,68,-54,26,16,94,0,-84,2,-16,88,26,-38,18,64,90,80,76,2,14,-90,50,4,76,30}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{54,44,97,92,13,54,27,8,43,70,77,84,55,64,5,59,27,19,65,68,66,26,33,38,7}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{10,13,17,63}); param1.add(new int[]{12, -18, 44}); param1.add(new int[]{0,0,0}); param1.add(new int[]{80,58,32,2}); param1.add(new int[]{-99,-90,-90,-86}); param1.add(new int[]{0,0,1,1}); param1.add(new int[]{1,9,12,16}); param1.add(new int[]{-76,-54,4,78}); param1.add(new int[]{0,1,0,1}); param1.add(new int[]{93,5,9,13}); List<Integer> param2 = new ArrayList<>(); param2.add(29); param2.add(46); param2.add(34); param2.add(17); param2.add(23); param2.add(10); param2.add(10); param2.add(27); param2.add(10); param2.add(19); List<Integer> param3 = new ArrayList<>(); param3.add(4); param3.add(3); param3.add(3); param3.add(4); param3.add(4); param3.add(4); param3.add(4); param3.add(4); param3.add(4); param3.add(4); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1{ static boolean f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n ) { int i = 0 , j = 0 ; if ( m < n ) return false ; Arrays . sort ( arr1 ) ; Arrays . sort ( arr2 ) ; while ( i < n && j < m ) { if ( arr1 [ j ] < arr2 [ i ] ) j ++ ; else if ( arr1 [ j ] == arr2 [ i ] ) { j ++ ; i ++ ; } else if ( arr1 [ j ] > arr2 [ i ] ) return false ; } [MASK] ( i < n ) return false ; else return true ; } ) j ++ ; else if ( arr1 [ j ] == arr2 [ i ] ) { j ++ ; i ++ ; } else if ( arr1 [ j ] > arr2 [ i ] ) return false ; } if ( i < n ) 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[]{7,10,10,10,13,17,23,24,25,28,30,33,37,49,49,50,57,60,60,63,63,64,65,65,72,81,84,85,85,94,96}); param0.add(new int[]{12,30,-94,-92,-62,-18,-56,44,-50,-92,6,2,56,-90,0,0,18,86,-58,58,-54,62,-94,94,0,8,82,-68,-88,-18,8,-80,-42,18,62,-8,56,-76,-42,56,44,-2,-20,62,-14,74,-86,-76}); 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}); param0.add(new int[]{94,26,32,20,46,55,9,51,57,80,45,38,68,12,90,10,80,65,12,52,51,86,64,57,93,19,30,92,85,82,24,26,36,56}); param0.add(new int[]{-98,-90,-86,-86,-84,-84,-82,-80,-78,-72,-70,-68,-66,-64,-52,-52,-50,-38,-28,-26,-24,-14,-8,16,26,26,28,34,36,40,42,44,44,46,50,60,68,78,80,86,90,92,98}); param0.add(new int[]{1,0,1,0,1,0,0,0,1,0,0,0,0,1,1,0,1,1}); param0.add(new int[]{6,8,11,13,14,26,26,41,48,70,82,83,84,88,96}); param0.add(new int[]{-88,80,62,76,48,92,18,-94,-62,98,-46,-50,70,32,68,-54,26,16,94,0,-84,2,-16,88,26,-38,18,64,90,80,76,2,14,-90,50,4,76,30}); param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1,1}); param0.add(new int[]{54,44,97,92,13,54,27,8,43,70,77,84,55,64,5,59,27,19,65,68,66,26,33,38,7}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{10,13,17,63}); param1.add(new int[]{12, -18, 44}); param1.add(new int[]{0,0,0}); param1.add(new int[]{80,58,32,2}); param1.add(new int[]{-99,-90,-90,-86}); param1.add(new int[]{0,0,1,1}); param1.add(new int[]{1,9,12,16}); param1.add(new int[]{-76,-54,4,78}); param1.add(new int[]{0,1,0,1}); param1.add(new int[]{93,5,9,13}); List<Integer> param2 = new ArrayList<>(); param2.add(29); param2.add(46); param2.add(34); param2.add(17); param2.add(23); param2.add(10); param2.add(10); param2.add(27); param2.add(10); param2.add(19); List<Integer> param3 = new ArrayList<>(); param3.add(4); param3.add(3); param3.add(3); param3.add(4); param3.add(4); param3.add(4); param3.add(4); param3.add(4); param3.add(4); param3.add(4); 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()); } }
if
[ "a) <=", "b) max_count", "c) if", "d) ];", "e) n" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1{ static int f_gold ( int m , int n ) { int count [ ] [ ] = new int [ m ] [ n ] ; for ( int i = 0 ; i < m ; i ++ ) count [ i ] [ 0 ] = 1 ; for ( int j = 0 ; j < n ; j ++ ) count [ 0 ] [ j ] = 1 ; for ( int i = 1 ; i < m ; i ++ ) { for ( int j = 1 ; j < n ; j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ] + count [ i ] [ j - 1 ] ; } return count [ m - 1 ] [ n - 1 ] ; } for ( int i = 1 ; i < m ; i ++ ) { for ( int j = 1 ; j < n ; j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ] + count [ i ] [ j - 1 ] ; } return count [ m - 1 ] [ n - 1 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(79); param0.add(95); param0.add(15); param0.add(71); param0.add(16); param0.add(91); param0.add(10); param0.add(98); param0.add(30); param0.add(58); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(62); param1.add(9); param1.add(18); param1.add(85); param1.add(52); param1.add(91); param1.add(81); param1.add(42); param1.add(69); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1{ static int f_gold ( int m [MASK] int n ) { int count [ ] [ ] = new int [ m ] [ n ] ; for ( int i = 0 ; i < m ; i ++ ) count [ i ] [ 0 ] = 1 ; for ( int j = 0 ; j < n ; j ++ ) count [ 0 ] [ j ] = 1 ; for ( int i = 1 ; i < m ; i ++ ) { for ( int j = 1 ; j < n ; j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ] + count [ i ] [ j - 1 ] ; } return count [ m - 1 ] [ n - 1 ] ; } for ( int i = 1 ; i < m ; i ++ ) { for ( int j = 1 ; j < n ; j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ] + count [ i ] [ j - 1 ] ; } return count [ m - 1 ] [ n - 1 ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(79); param0.add(95); param0.add(15); param0.add(71); param0.add(16); param0.add(91); param0.add(10); param0.add(98); param0.add(30); param0.add(58); List<Integer> param1 = new ArrayList<>(); param1.add(16); param1.add(62); param1.add(9); param1.add(18); param1.add(85); param1.add(52); param1.add(91); param1.add(81); param1.add(42); param1.add(69); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
,
[ "a) +", "b) ,", "c) java.lang.*;", "d) max(r_xor,", "e) n" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY{ public static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > hash = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) if ( hash . containsKey ( arr [ i ] ) ) hash . put ( arr [ i ] , hash . get ( arr [ i ] ) + 1 ) ; else hash . put ( arr [ i ] , 1 ) ; int max_count = 0 ; Set < Integer > s = hash . keySet ( ) ; for ( int i : s ) if ( max_count < hash . get ( i ) ) max_count = hash . get ( i ) ; return ( n - max_count ) ; } [ i ] , 1 ) ; int max_count = 0 ; Set < Integer > s = hash . keySet ( ) ; for ( int i : s ) if ( max_count < hash . get ( i ) ) max_count = hash . get ( i ) ; return ( n - max_count ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,6,8,17,25,29,33,33,33,38,42,43,49,55,60,62,63,68,69,70,75,77,79,79,85,87,87,90,90,90,90,94,98}); param0.add(new int[]{-66,-44,72,-82,46,66,-78,-62,32,86,62,56,22,-58,46,-6,94}); param0.add(new int[]{0,1,1}); param0.add(new int[]{68,78,2,48,1,10,18,67,97,31,72,12,25,39,51,12,29,46,93,66,28,29,5,86,97,59,7,94,64,13,42,48,25,33,10,1,5,32,14,27}); param0.add(new int[]{-98,-96,-78,-72,-64,-62,-56,-40,-36,-14,-8,4,18,22,28,32,52,56,58,60,78,88,94}); param0.add(new int[]{0,0,1,1,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0}); param0.add(new int[]{3,3,7,9,14,15,15,25,25,26,28,31,37,37,47,51,53,58,58,60,63,65,68,70,70,71,77,79,81,88,89,97}); param0.add(new int[]{40,-64,-62,74,-10,48,-56,70,-60,54,-6,74,-8,-54,-20,-50,40,-22,-54,-76,-92,-76,36,16,-42,58,-74,-90,-54,-32,-38,-50,74,26,52,38,24,-32,78,68,82,36,64,56,86,-28,-44,48,88}); param0.add(new int[]{0,0,1,1,1,1,1}); param0.add(new int[]{87,77,76,1,59,15,98,45,62,10,87,59,13,50,58,10}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(11); param1.add(1); param1.add(36); param1.add(18); param1.add(21); param1.add(23); param1.add(36); param1.add(4); param1.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY{ public static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > hash = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) if ( hash . containsKey ( arr [ i ] ) ) hash . put ( arr [ i ] , [MASK] . get ( arr [ i ] ) + 1 ) ; else hash . put ( arr [ i ] , 1 ) ; int max_count = 0 ; Set < Integer > s = hash . keySet ( ) ; for ( int i : s ) if ( max_count < hash . get ( i ) ) max_count = hash . get ( i ) ; return ( n - max_count ) ; } [ i ] , 1 ) ; int max_count = 0 ; Set < Integer > s = hash . keySet ( ) ; for ( int i : s ) if ( max_count < hash . get ( i ) ) max_count = hash . get ( i ) ; return ( n - max_count ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,6,8,17,25,29,33,33,33,38,42,43,49,55,60,62,63,68,69,70,75,77,79,79,85,87,87,90,90,90,90,94,98}); param0.add(new int[]{-66,-44,72,-82,46,66,-78,-62,32,86,62,56,22,-58,46,-6,94}); param0.add(new int[]{0,1,1}); param0.add(new int[]{68,78,2,48,1,10,18,67,97,31,72,12,25,39,51,12,29,46,93,66,28,29,5,86,97,59,7,94,64,13,42,48,25,33,10,1,5,32,14,27}); param0.add(new int[]{-98,-96,-78,-72,-64,-62,-56,-40,-36,-14,-8,4,18,22,28,32,52,56,58,60,78,88,94}); param0.add(new int[]{0,0,1,1,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0}); param0.add(new int[]{3,3,7,9,14,15,15,25,25,26,28,31,37,37,47,51,53,58,58,60,63,65,68,70,70,71,77,79,81,88,89,97}); param0.add(new int[]{40,-64,-62,74,-10,48,-56,70,-60,54,-6,74,-8,-54,-20,-50,40,-22,-54,-76,-92,-76,36,16,-42,58,-74,-90,-54,-32,-38,-50,74,26,52,38,24,-32,78,68,82,36,64,56,86,-28,-44,48,88}); param0.add(new int[]{0,0,1,1,1,1,1}); param0.add(new int[]{87,77,76,1,59,15,98,45,62,10,87,59,13,50,58,10}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(11); param1.add(1); param1.add(36); param1.add(18); param1.add(21); param1.add(23); param1.add(36); param1.add(4); param1.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
hash
[ "a) hash", "b) -", "c) y)?", "d) int", "e) int" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES{ static int f_gold ( int n , int m ) { int count [ ] = new int [ n + 1 ] ; count [ 0 ] = 0 ; int i ; for ( i = 1 ; i <= n ; i ++ ) { if ( i > m ) count [ i ] = count [ i - 1 ] + count [ i - m ] ; else if ( i < m ) count [ i ] = 1 ; else count [ i ] = 2 ; } return count [ n ] ; } r ( i = 1 ; i <= n ; i ++ ) { if ( i > m ) count [ i ] = count [ i - 1 ] + count [ i - m ] ; else if ( i < m ) count [ i ] = 1 ; else count [ i ] = 2 ; } return count [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(93); param0.add(17); param0.add(38); param0.add(33); param0.add(78); param0.add(40); param0.add(95); param0.add(12); param0.add(69); param0.add(78); List<Integer> param1 = new ArrayList<>(); param1.add(54); param1.add(4); param1.add(39); param1.add(64); param1.add(35); param1.add(61); param1.add(6); param1.add(8); param1.add(60); param1.add(21); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES{ static int f_gold ( int n , int m ) { int count [ ] = new int [ n + 1 ] ; count [ 0 ] = 0 ; int i ; for ( i = 1 ; i <= n ; i ++ ) [MASK] if ( i > m ) count [ i ] = count [ i - 1 ] + count [ i - m ] ; else if ( i < m ) count [ i ] = 1 ; else count [ i ] = 2 ; } return count [ n ] ; }r ( i = 1 ; i <= n ; i ++ ) { if ( i > m ) count [ i ] = count [ i - 1 ] + count [ i - m ] ; else if ( i < m ) count [ i ] = 1 ; else count [ i ] = 2 ; } return count [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(93); param0.add(17); param0.add(38); param0.add(33); param0.add(78); param0.add(40); param0.add(95); param0.add(12); param0.add(69); param0.add(78); List<Integer> param1 = new ArrayList<>(); param1.add(54); param1.add(4); param1.add(39); param1.add(64); param1.add(35); param1.add(61); param1.add(6); param1.add(8); param1.add(60); param1.add(21); 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()); } }
{
[ "a) {", "b) *(int*)a", "c) INT_MAX;", "d) (", "e) )" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_SUM_PRODUCT_TWO_ARRAYS{ static int f_gold ( int a [ ] , int b [ ] , int n , int k ) { int diff = 0 , res = 0 ; int temp = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int pro = a [ i ] * b [ i ] ; res = res + pro ; if ( pro < 0 && b [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ] ; else if ( pro < 0 && a [ i ] < 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ] ; else if ( pro > 0 && a [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ] ; else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ] ; int d = Math . abs ( pro - temp ) ; if ( d > diff ) diff = d ; } return res - diff ; } 2 * k ) * b [ i ] ; else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ] ; int d = Math . abs ( pro - temp ) ; if ( d > diff ) diff = d ; } return res - diff ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8,9,9,16,19,21,24,26,26,27,31,33,36,44,46,47,69,71,72,74,74,74,74,76,76,77,89,91,91}); param0.add(new int[]{-64,-58,26,-42,-18,-52,26,-70,0,-68,38,-98,-14,-92,-74,-90,86,-76,-8,-80,-80,54,-26,-56,48,86,-60}); param0.add(new int[]{0,0,0,0,1,1,1,1}); param0.add(new int[]{62,73,67,96,95,31,58,13,63,13,29,97,7,36,13,54,67,8,9,36,6,29,92,7,82,5,27,65,80,20,22,1,11,67,23,31,86,27,53,87,39,99,69}); param0.add(new int[]{-86,-82,-42,-30,-12,-4,14,16,20,20,22,26,30,40,46,48,48,50,60,60,66,70,74,76,90,96,96,98}); param0.add(new int[]{1,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,1,1,1,0,0,0,1,0,1,1,1,1,1,0,0,1}); param0.add(new int[]{4,7,14,14,30,38,44,49,51,53,54,56,58,62,67,76,86,86,88,91,95}); param0.add(new int[]{2,90,-92,58,56,94,12,-2,86,-70,46,-80,42,-6,72,-52,4,96,-42,50,-28,42,8,26,46,70,-2,-24,-36,50,26,70,74,-52,34,-88,-66,74,52,62,-24,-80,40,42,90}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{61,96,7,59,86,74,7,95,13,52,18,77,25,97,74,18}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{1,8,10,10,12,16,17,19,20,20,23,33,37,38,58,66,69,70,70,76,79,80,83,84,84,86,87,87,93}); param1.add(new int[]{90,-2,-8,12,-58,46,-54,-40,-10,-76,-62,66,42,-66,4,-6,50,8,-18,92,-42,30,-34,74,-86,-56,52}); param1.add(new int[]{0,0,0,0,0,1,1,1}); param1.add(new int[]{88,64,94,64,4,23,6,85,92,68,78,53,96,88,69,28,12,34,92,67,39,68,72,64,10,14,26,61,96,1,79,87,45,9,16,70,63,84,79,63,11,85,46}); param1.add(new int[]{-98,-78,-68,-68,-64,-40,-38,-38,-26,-12,-6,0,2,8,18,34,52,58,64,64,70,72,76,82,84,90,96,96}); param1.add(new int[]{1,0,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,0,1,1,0,0,0}); param1.add(new int[]{2,2,7,19,20,21,22,26,42,45,46,46,59,63,63,72,73,74,77,83,89}); param1.add(new int[]{98,62,-52,-92,-14,-92,62,86,20,36,-80,-12,-38,70,-28,-28,42,-10,94,-16,-72,-96,76,-14,-18,-12,38,14,46,16,-90,10,-34,-6,-34,-62,96,14,0,-10,32,-6,96,-72,-2}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{56,38,75,57,82,30,38,79,39,73,74,73,36,10,80,50}); List<Integer> param2 = new ArrayList<>(); param2.add(20); param2.add(20); param2.add(7); param2.add(23); param2.add(14); param2.add(20); param2.add(11); param2.add(25); param2.add(46); param2.add(13); List<Integer> param3 = new ArrayList<>(); param3.add(28); param3.add(16); param3.add(5); param3.add(23); param3.add(14); param3.add(16); param3.add(17); param3.add(25); param3.add(33); param3.add(12); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_SUM_PRODUCT_TWO_ARRAYS{ static int f_gold ( int a [ ] , int b [ ] , int n , int k ) { int diff = 0 , res = 0 ; int temp = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int pro = a [ i ] * b [ i ] ; res = res + pro ; if ( pro < 0 && b [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ] ; else if ( [MASK] < 0 && a [ i ] < 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ] ; else if ( pro > 0 && a [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ] ; else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ] ; int d = Math . abs ( pro - temp ) ; if ( d > diff ) diff = d ; } return res - diff ; }2 * k ) * b [ i ] ; else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ] ; int d = Math . abs ( pro - temp ) ; if ( d > diff ) diff = d ; } return res - diff ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{8,9,9,16,19,21,24,26,26,27,31,33,36,44,46,47,69,71,72,74,74,74,74,76,76,77,89,91,91}); param0.add(new int[]{-64,-58,26,-42,-18,-52,26,-70,0,-68,38,-98,-14,-92,-74,-90,86,-76,-8,-80,-80,54,-26,-56,48,86,-60}); param0.add(new int[]{0,0,0,0,1,1,1,1}); param0.add(new int[]{62,73,67,96,95,31,58,13,63,13,29,97,7,36,13,54,67,8,9,36,6,29,92,7,82,5,27,65,80,20,22,1,11,67,23,31,86,27,53,87,39,99,69}); param0.add(new int[]{-86,-82,-42,-30,-12,-4,14,16,20,20,22,26,30,40,46,48,48,50,60,60,66,70,74,76,90,96,96,98}); param0.add(new int[]{1,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,1,1,1,0,0,0,1,0,1,1,1,1,1,0,0,1}); param0.add(new int[]{4,7,14,14,30,38,44,49,51,53,54,56,58,62,67,76,86,86,88,91,95}); param0.add(new int[]{2,90,-92,58,56,94,12,-2,86,-70,46,-80,42,-6,72,-52,4,96,-42,50,-28,42,8,26,46,70,-2,-24,-36,50,26,70,74,-52,34,-88,-66,74,52,62,-24,-80,40,42,90}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{61,96,7,59,86,74,7,95,13,52,18,77,25,97,74,18}); List<int [ ]> param1 = new ArrayList<>(); param1.add(new int[]{1,8,10,10,12,16,17,19,20,20,23,33,37,38,58,66,69,70,70,76,79,80,83,84,84,86,87,87,93}); param1.add(new int[]{90,-2,-8,12,-58,46,-54,-40,-10,-76,-62,66,42,-66,4,-6,50,8,-18,92,-42,30,-34,74,-86,-56,52}); param1.add(new int[]{0,0,0,0,0,1,1,1}); param1.add(new int[]{88,64,94,64,4,23,6,85,92,68,78,53,96,88,69,28,12,34,92,67,39,68,72,64,10,14,26,61,96,1,79,87,45,9,16,70,63,84,79,63,11,85,46}); param1.add(new int[]{-98,-78,-68,-68,-64,-40,-38,-38,-26,-12,-6,0,2,8,18,34,52,58,64,64,70,72,76,82,84,90,96,96}); param1.add(new int[]{1,0,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,0,1,1,0,0,0}); param1.add(new int[]{2,2,7,19,20,21,22,26,42,45,46,46,59,63,63,72,73,74,77,83,89}); param1.add(new int[]{98,62,-52,-92,-14,-92,62,86,20,36,-80,-12,-38,70,-28,-28,42,-10,94,-16,-72,-96,76,-14,-18,-12,38,14,46,16,-90,10,-34,-6,-34,-62,96,14,0,-10,32,-6,96,-72,-2}); param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param1.add(new int[]{56,38,75,57,82,30,38,79,39,73,74,73,36,10,80,50}); List<Integer> param2 = new ArrayList<>(); param2.add(20); param2.add(20); param2.add(7); param2.add(23); param2.add(14); param2.add(20); param2.add(11); param2.add(25); param2.add(46); param2.add(13); List<Integer> param3 = new ArrayList<>(); param3.add(28); param3.add(16); param3.add(5); param3.add(23); param3.add(14); param3.add(16); param3.add(17); param3.add(25); param3.add(33); param3.add(12); 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()); } }
pro
[ "a) pro", "b) )", "c) A", "d) int", "e) =" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PRIME_NUMBERS{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; } fx.util.Pair; public class PRIME_NUMBERS{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(2); param0.add(74); param0.add(46); param0.add(38); param0.add(51); param0.add(48); param0.add(6); param0.add(14); param0.add(31); param0.add(10); 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()); } }
import java.util. [MASK] import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PRIME_NUMBERS{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; }fx.util.Pair; public class PRIME_NUMBERS{ static boolean f_gold ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(2); param0.add(74); param0.add(46); param0.add(38); param0.add(51); param0.add(48); param0.add(6); param0.add(14); param0.add(31); param0.add(10); 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()); } }
*;
[ "a) }", "b) 0xAAAAAAAA", "c) *;", "d) n", "e) using" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING{ static int f_gold ( int n ) { int res [ ] = new int [ n + 1 ] ; res [ 0 ] = 0 ; res [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) res [ i ] = Math . max ( i , ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) ) ; return res [ n ] ; } res [ 0 ] = 0 ; res [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) res [ i ] = Math . max ( i , ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) ) ; return res [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(3); param0.add(19); param0.add(39); param0.add(89); param0.add(96); param0.add(68); param0.add(48); param0.add(5); param0.add(3); param0.add(4); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; [MASK] javafx.util.Pair; public class MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING{ static int f_gold ( int n ) { int res [ ] = new int [ n + 1 ] ; res [ 0 ] = 0 ; res [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) res [ i ] = Math . max ( i , ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) ) ; return res [ n ] ; } res [ 0 ] = 0 ; res [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) res [ i ] = Math . max ( i , ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) ) ; return res [ n ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(3); param0.add(19); param0.add(39); param0.add(89); param0.add(96); param0.add(68); param0.add(48); param0.add(5); param0.add(3); param0.add(4); 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()); } }
import
[ "a) checkNumber;", "b) import", "c) :", "d) while", "e) f_gold" ]
b
java
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 ; } ndindex = 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()); } }
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 ++ ) [MASK] 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 ; }ndindex = 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()); } }
{
[ "a) ]", "b) return", "c) {", "d) (", "e) 1" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS{ static boolean f_gold ( int arr [ ] , int n , int x ) { for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] * arr [ j ] == x ) return true ; return false ; } lean f_gold ( int arr [ ] , int n , int x ) { for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] * arr [ j ] == x ) return true ; return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{10, 20, 9, 40}); param0.add(new int[]{1,-10, 20, 9, -40}); param0.add(new int[]{0,0,0,0,0,1,1,1,1}); param0.add(new int[]{4,10, 20, 9, -40}); param0.add(new int[]{-90,-86,-76,-72,-70,-62,-56,-50,-18,-12,-10,4,16,26,42,48,52,54,54,70,84,86,88,98}); param0.add(new int[]{1}); param0.add(new int[]{4,7,14,14,16,18,19,20,22,24,29,38,38,38,40,40,46,46,47,51,51,52,55,56,56,62,62,62,78,79,81,84,86,88,89,89,89}); param0.add(new int[]{72,80,-82,24,-98,90,-32,-56,-22,8,-12,8,-78,60,-62,50,12,-60,10,-54,74,98,26,56,24}); 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}); param0.add(new int[]{93,40,48,99,95,59,43,58,79,70,28}); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(5); param1.add(7); param1.add(5); param1.add(23); param1.add(0); param1.add(23); param1.add(21); param1.add(22); param1.add(9); List<Integer> param2 = new ArrayList<>(); param2.add(400); param2.add(400); param2.add(8); param2.add(-400); param2.add(23); param2.add(0); param2.add(32); param2.add(19); param2.add(18); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS{ static boolean f_gold ( int arr [ ] , int n , int x ) { for ( int i = 0 ; i [MASK] n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] * arr [ j ] == x ) return true ; return false ; }lean f_gold ( int arr [ ] , int n , int x ) { for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] * arr [ j ] == x ) return true ; return false ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{10, 20, 9, 40}); param0.add(new int[]{1,-10, 20, 9, -40}); param0.add(new int[]{0,0,0,0,0,1,1,1,1}); param0.add(new int[]{4,10, 20, 9, -40}); param0.add(new int[]{-90,-86,-76,-72,-70,-62,-56,-50,-18,-12,-10,4,16,26,42,48,52,54,54,70,84,86,88,98}); param0.add(new int[]{1}); param0.add(new int[]{4,7,14,14,16,18,19,20,22,24,29,38,38,38,40,40,46,46,47,51,51,52,55,56,56,62,62,62,78,79,81,84,86,88,89,89,89}); param0.add(new int[]{72,80,-82,24,-98,90,-32,-56,-22,8,-12,8,-78,60,-62,50,12,-60,10,-54,74,98,26,56,24}); 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}); param0.add(new int[]{93,40,48,99,95,59,43,58,79,70,28}); List<Integer> param1 = new ArrayList<>(); param1.add(4); param1.add(5); param1.add(7); param1.add(5); param1.add(23); param1.add(0); param1.add(23); param1.add(21); param1.add(22); param1.add(9); List<Integer> param2 = new ArrayList<>(); param2.add(400); param2.add(400); param2.add(8); param2.add(-400); param2.add(23); param2.add(0); param2.add(32); param2.add(19); param2.add(18); 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()); } }
<
[ "a) <", "b) b;", "c) ],", "d) }", "e) n" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class CHECK_LARGE_NUMBER_DIVISIBLE_4_NOT{ static boolean f_gold ( String str ) { int n = str . length ( ) ; if ( n == 0 ) return false ; if ( n == 1 ) return ( ( str . charAt ( 0 ) - '0' ) % 4 == 0 ) ; int last = str . charAt ( n - 1 ) - '0' ; int second_last = str . charAt ( n - 2 ) - '0' ; return ( ( second_last * 10 + last ) % 4 == 0 ) ; } urn ( ( str . charAt ( 0 ) - '0' ) % 4 == 0 ) ; int last = str . charAt ( n - 1 ) - '0' ; int second_last = str . charAt ( n - 2 ) - '0' ; return ( ( second_last * 10 + last ) % 4 == 0 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("PjAFZXQgN"); param0.add("12325195609714"); param0.add("00101111101"); param0.add("xOtbXZiA"); param0.add("980"); param0.add("000000100"); param0.add("zFacc W"); param0.add("8"); param0.add("110011"); param0.add("afiutekeSfYrX"); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; [MASK] class CHECK_LARGE_NUMBER_DIVISIBLE_4_NOT{ static boolean f_gold ( String str ) { int n = str . length ( ) ; if ( n == 0 ) return false ; if ( n == 1 ) return ( ( str . charAt ( 0 ) - '0' ) % 4 == 0 ) ; int last = str . charAt ( n - 1 ) - '0' ; int second_last = str . charAt ( n - 2 ) - '0' ; return ( ( second_last * 10 + last ) % 4 == 0 ) ; }urn ( ( str . charAt ( 0 ) - '0' ) % 4 == 0 ) ; int last = str . charAt ( n - 1 ) - '0' ; int second_last = str . charAt ( n - 2 ) - '0' ; return ( ( second_last * 10 + last ) % 4 == 0 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<String> param0 = new ArrayList<>(); param0.add("PjAFZXQgN"); param0.add("12325195609714"); param0.add("00101111101"); param0.add("xOtbXZiA"); param0.add("980"); param0.add("000000100"); param0.add("zFacc W"); param0.add("8"); param0.add("110011"); param0.add("afiutekeSfYrX"); 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()); } }
public
[ "a) k", "b) return", "c) m", "d) public", "e) (arr)" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_PAIR_MAXIMUM_GCD_ARRAY{ public static int f_gold ( int arr [ ] , int n ) { int high = 0 ; for ( int i = 0 ; i < n ; i ++ ) high = Math . max ( high , arr [ i ] ) ; int divisors [ ] = new int [ high + 1 ] ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 1 ; j <= Math . sqrt ( arr [ i ] ) ; j ++ ) { if ( arr [ i ] % j == 0 ) { divisors [ j ] ++ ; if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++ ; } } } for ( int i = high ; i >= 1 ; i -- ) if ( divisors [ i ] > 1 ) return i ; return 1 ; } visors [ j ] ++ ; if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++ ; } } } for ( int i = high ; i >= 1 ; i -- ) if ( divisors [ i ] > 1 ) return i ; return 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,3,8,10,12,13,14,16,16,19,20,21,25,29,33,35,35,35,35,36,38,41,42,45,45,45,46,48,51,52,53,55,56,57,58,62,69,73,73,76,76,80,89,91,92,93,93,96}); param0.add(new int[]{12,52,-66,50,50,-78,-14,26,56,74,8,-58,58,-66,-58,-12,80}); 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,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{23,98,12,45,83,85,30,92,26,12,38,20,86,52,71,20,56,78,10,34,86,55,99,84,26,2,1,89,60,26,16,37,98,11,73,42,36,60,28}); param0.add(new int[]{-98,-84,-80,-72,-66,-64,-52,-36,-28,-18,-12,-12,-4,8,12,40,42,56,68,70,90,94}); param0.add(new int[]{1,0,0,1,1,1,0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,1,0,0,1,0,1}); param0.add(new int[]{3,5,6,7,8,9,11,13,18,20,24,25,26,27,36,41,41,45,48,48,49,65,69,70,85,90,99,99}); param0.add(new int[]{80,-26,-38,-40,22,-28,0,-36,70,-32,38,58,76,-42,38,92,68,-70,36,-62,24,-84,42,4,0,8,-36,98,-84,82,-70,-12,6,-82,-20,-68,48,-12,42,18,58,-14,94,84}); 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[]{36,60,45,76,43,71,10,18,52,52,53,73,48,95,13,50,97,30,73,13,18,34,51}); List<Integer> param1 = new ArrayList<>(); param1.add(45); param1.add(11); param1.add(26); param1.add(28); param1.add(17); param1.add(14); param1.add(20); param1.add(39); param1.add(26); param1.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_PAIR_MAXIMUM_GCD_ARRAY{ public static int f_gold ( int arr [ ] , int n ) { int high = 0 ; for ( int i = 0 ; i < n ; i ++ ) high = Math . max ( high , arr [ i ] ) ; int divisors [ ] = new int [ high + 1 ] ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 1 ; j <= Math . sqrt ( arr [ i ] ) ; j ++ ) { if ( arr [ i ] % j == 0 ) { divisors [ j ] ++ ; if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++ ; } } } for ( int i = high ; i >= 1 ; i [MASK] ) if ( divisors [ i ] > 1 ) return i ; return 1 ; }visors [ j ] ++ ; if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++ ; } } } for ( int i = high ; i >= 1 ; i -- ) if ( divisors [ i ] > 1 ) return i ; return 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{3,3,8,10,12,13,14,16,16,19,20,21,25,29,33,35,35,35,35,36,38,41,42,45,45,45,46,48,51,52,53,55,56,57,58,62,69,73,73,76,76,80,89,91,92,93,93,96}); param0.add(new int[]{12,52,-66,50,50,-78,-14,26,56,74,8,-58,58,-66,-58,-12,80}); 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,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{23,98,12,45,83,85,30,92,26,12,38,20,86,52,71,20,56,78,10,34,86,55,99,84,26,2,1,89,60,26,16,37,98,11,73,42,36,60,28}); param0.add(new int[]{-98,-84,-80,-72,-66,-64,-52,-36,-28,-18,-12,-12,-4,8,12,40,42,56,68,70,90,94}); param0.add(new int[]{1,0,0,1,1,1,0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,1,0,0,1,0,1}); param0.add(new int[]{3,5,6,7,8,9,11,13,18,20,24,25,26,27,36,41,41,45,48,48,49,65,69,70,85,90,99,99}); param0.add(new int[]{80,-26,-38,-40,22,-28,0,-36,70,-32,38,58,76,-42,38,92,68,-70,36,-62,24,-84,42,4,0,8,-36,98,-84,82,-70,-12,6,-82,-20,-68,48,-12,42,18,58,-14,94,84}); 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[]{36,60,45,76,43,71,10,18,52,52,53,73,48,95,13,50,97,30,73,13,18,34,51}); List<Integer> param1 = new ArrayList<>(); param1.add(45); param1.add(11); param1.add(26); param1.add(28); param1.add(17); param1.add(14); param1.add(20); param1.add(39); param1.add(26); param1.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
--
[ "a) --", "b) (", "c) (", "d) );}", "e) k" ]
a
java
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 ; } 2 ) * ( 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class [MASK] 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 ; }2 ) * ( 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()); } }
CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT{
[ "a) using", "b) stack.append", "c) j", "d) s", "e) CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT{" ]
e
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class DYNAMIC_PROGRAMMING_SET_3_LONGEST_INCREASING_SUBSEQUENCE_1{ static int f_gold ( int arr [ ] , int n ) { int f_gold [ ] = new int [ n ] ; int i , j , max = 0 ; for ( i = 0 ; i < n ; i ++ ) f_gold [ i ] = 1 ; for ( i = 1 ; i < n ; i ++ ) for ( j = 0 ; j < i ; j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1 ; for ( i = 0 ; i < n ; i ++ ) if ( max < f_gold [ i ] ) max = f_gold [ i ] ; return max ; } if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1 ; for ( i = 0 ; i < n ; i ++ ) if ( max < f_gold [ i ] ) max = f_gold [ i ] ; return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,5,6,8,12,12,17,17,18,22,22,26,26,31,31,31,31,32,35,35,38,41,42,49,49,60,60,61,63,64,68,69,70,71,72,76,77,80,83,83,89,90,90,90,96}); param0.add(new int[]{-24,-16,-64,28,-30,-26,-14}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{11,42,44,52,15,35,48}); param0.add(new int[]{-54}); param0.add(new int[]{1,0,1,1,1,0,1,1,1,1,1,1,0,1,0,0,0,1,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0}); param0.add(new int[]{2,5,6,10,13,15,18,18,19,27,30,32,34,40,47,50,53,54,55,56,56,56,59,60,63,64,71,80,83,84,86,95}); param0.add(new int[]{-80,60,-6,0,-50,82,-84,36,-96,-32,-14,16,60,-14,0,-22,28,12,8,-86,38,56,-32,-6,-80,-42,56,10,72,12,96,84}); 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,1,1,1,1,1,1}); param0.add(new int[]{10,38,45,57,44,13,8,62,74,54,37,75,35,60,36,33,14,71,4,21,6,8,30,5,2,5,4,20,33,69,83,87,83,52,77,79,49,25,11,35,98,31,52,82,13,25,17,35,53}); List<Integer> param1 = new ArrayList<>(); param1.add(40); param1.add(4); param1.add(11); param1.add(6); param1.add(0); param1.add(22); param1.add(24); param1.add(16); param1.add(37); param1.add(28); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class DYNAMIC_PROGRAMMING_SET_3_LONGEST_INCREASING_SUBSEQUENCE_1{ static int f_gold ( int arr [ ] , int n ) { int f_gold [ ] = new int [ n ] ; int i , j , max = 0 ; for ( i = 0 ; i < n ; i ++ ) f_gold [ i ] = 1 ; for ( i = 1 ; i < n ; i ++ ) for ( j = 0 ; j < i ; j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1 ; for ( i = 0 ; i < n ; i ++ ) if ( max < f_gold [ i ] ) max = f_gold [ i ] ; return [MASK] ; }if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1 ; for ( i = 0 ; i < n ; i ++ ) if ( max < f_gold [ i ] ) max = f_gold [ i ] ; return max ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,3,5,6,8,12,12,17,17,18,22,22,26,26,31,31,31,31,32,35,35,38,41,42,49,49,60,60,61,63,64,68,69,70,71,72,76,77,80,83,83,89,90,90,90,96}); param0.add(new int[]{-24,-16,-64,28,-30,-26,-14}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{11,42,44,52,15,35,48}); param0.add(new int[]{-54}); param0.add(new int[]{1,0,1,1,1,0,1,1,1,1,1,1,0,1,0,0,0,1,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0}); param0.add(new int[]{2,5,6,10,13,15,18,18,19,27,30,32,34,40,47,50,53,54,55,56,56,56,59,60,63,64,71,80,83,84,86,95}); param0.add(new int[]{-80,60,-6,0,-50,82,-84,36,-96,-32,-14,16,60,-14,0,-22,28,12,8,-86,38,56,-32,-6,-80,-42,56,10,72,12,96,84}); 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,1,1,1,1,1,1}); param0.add(new int[]{10,38,45,57,44,13,8,62,74,54,37,75,35,60,36,33,14,71,4,21,6,8,30,5,2,5,4,20,33,69,83,87,83,52,77,79,49,25,11,35,98,31,52,82,13,25,17,35,53}); List<Integer> param1 = new ArrayList<>(); param1.add(40); param1.add(4); param1.add(11); param1.add(6); param1.add(0); param1.add(22); param1.add(24); param1.add(16); param1.add(37); param1.add(28); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
max
[ "a) max", "b) (x", "c) ],", "d) N", "e) (" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN{ static int f_gold ( int coin [ ] , int n , int k ) { Arrays . sort ( coin ) ; int coins_needed = ( int ) Math . ceil ( 1.0 * n / ( k + 1 ) ) ; int ans = 0 ; for ( int i = 0 ; i <= coins_needed - 1 ; i ++ ) ans += coin [ i ] ; return ans ; } ays . sort ( coin ) ; int coins_needed = ( int ) Math . ceil ( 1.0 * n / ( k + 1 ) ) ; int ans = 0 ; for ( int i = 0 ; i <= coins_needed - 1 ; i ++ ) ans += coin [ i ] ; return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,5,9,10,10,11,14,15,19,21,22,29,36,36,38,39,39,39,41,41,42,45,45,48,55,56,57,64,66,66,66,66,69,74,76,80,81,82,82,85,87,95,95}); param0.add(new int[]{-6,-52,20,-98,-10,48,36,66,-88,94,68,16}); 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}); param0.add(new int[]{91,62,29,49,6,11,10,43,78,35,32,5,1,48,15,24,4,71}); param0.add(new int[]{-98,-92,-88,-84,-82,-78,-74,-74,-68,-62,-62,-56,-56,-50,-46,-44,-26,-18,-14,-8,-8,-6,8,16,20,20,22,26,36,42,44,44,52,60,66,68,68,70,76,84}); param0.add(new int[]{1,0,0,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,1,0,1,0,1,1,1,0,1,1,1,1,0,0,0,1,1,0,1,1,0,0,1,0}); param0.add(new int[]{5,12,38,39,52,54,62,81,87,93}); param0.add(new int[]{86,-18,-32,70,40,-76,-8,8,-84,-10,92,94,-18,-12,-26,-40,-74,60,16,-70,44,-32,40,-24,0,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,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{86,62,98,97,61,31,23,56,63,72,44,74,58,97}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(6); param1.add(16); param1.add(13); param1.add(25); param1.add(32); param1.add(6); param1.add(25); param1.add(37); param1.add(12); List<Integer> param2 = new ArrayList<>(); param2.add(27); param2.add(10); param2.add(16); param2.add(17); param2.add(34); param2.add(32); param2.add(8); param2.add(20); param2.add(29); param2.add(13); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN{ static int f_gold ( int coin [ ] , int n , int k ) { Arrays . sort ( coin ) ; int coins_needed = ( int ) Math . ceil ( 1.0 * n / ( k + 1 ) ) ; int ans = 0 ; for ( int i = 0 ; i <= coins_needed - 1 ; i ++ [MASK] ans += coin [ i ] ; return ans ; }ays . sort ( coin ) ; int coins_needed = ( int ) Math . ceil ( 1.0 * n / ( k + 1 ) ) ; int ans = 0 ; for ( int i = 0 ; i <= coins_needed - 1 ; i ++ ) ans += coin [ i ] ; return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,5,9,10,10,11,14,15,19,21,22,29,36,36,38,39,39,39,41,41,42,45,45,48,55,56,57,64,66,66,66,66,69,74,76,80,81,82,82,85,87,95,95}); param0.add(new int[]{-6,-52,20,-98,-10,48,36,66,-88,94,68,16}); 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}); param0.add(new int[]{91,62,29,49,6,11,10,43,78,35,32,5,1,48,15,24,4,71}); param0.add(new int[]{-98,-92,-88,-84,-82,-78,-74,-74,-68,-62,-62,-56,-56,-50,-46,-44,-26,-18,-14,-8,-8,-6,8,16,20,20,22,26,36,42,44,44,52,60,66,68,68,70,76,84}); param0.add(new int[]{1,0,0,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,1,0,1,0,1,1,1,0,1,1,1,1,0,0,0,1,1,0,1,1,0,0,1,0}); param0.add(new int[]{5,12,38,39,52,54,62,81,87,93}); param0.add(new int[]{86,-18,-32,70,40,-76,-8,8,-84,-10,92,94,-18,-12,-26,-40,-74,60,16,-70,44,-32,40,-24,0,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,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{86,62,98,97,61,31,23,56,63,72,44,74,58,97}); List<Integer> param1 = new ArrayList<>(); param1.add(33); param1.add(6); param1.add(16); param1.add(13); param1.add(25); param1.add(32); param1.add(6); param1.add(25); param1.add(37); param1.add(12); List<Integer> param2 = new ArrayList<>(); param2.add(27); param2.add(10); param2.add(16); param2.add(17); param2.add(34); param2.add(32); param2.add(8); param2.add(20); param2.add(29); param2.add(13); 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()); } }
)
[ "a) )", "b) int", "c) Str", "d) (int", "e) min_len" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY{ static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > vis = new HashMap < Integer , Integer > ( ) { @ Override public Integer get ( Object key ) { if ( ! containsKey ( key ) ) return 0 ; return super . get ( key ) ; } }; for ( int i = 0 ; i < n ; ++ i ) vis . put ( arr [ i ] , 1 ) ; int k = vis . size ( ) ; vis . clear ( ) ; int ans = 0 , right = 0 , window = 0 ; for ( int left = 0 ; left < n ; ++ left ) { while ( right < n && window < k ) { vis . put ( arr [ right ] , vis . get ( arr [ right ] ) + 1 ) ; if ( vis . get ( arr [ right ] ) == 1 ) ++ window ; ++ right ; } if ( window == k ) ans += ( n - right + 1 ) ; vis . put ( arr [ left ] , vis . get ( arr [ left ] ) - 1 ) ; if ( vis . get ( arr [ left ] ) == 0 ) -- window ; } return ans ; } } if ( window == k ) ans += ( n - right + 1 ) ; vis . put ( arr [ left ] , vis . get ( arr [ left ] ) - 1 ) ; if ( vis . get ( arr [ left ] ) == 0 ) -- window ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{13,39,49,52,53,69,72,79,83,96}); param0.add(new int[]{-98,-98,22,-10,-28,0,56,72,36,88,96,22,90,74,-60,-64,0,2,-42,0,94,-82,-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,1,1,1,1,1,1,1}); param0.add(new int[]{35,23,41,58,66,92,3,33,78,70,80,86,21,21,74,19}); param0.add(new int[]{-98,-80,-52,-10,4,76}); param0.add(new int[]{1,0,0,0,1,0,0,0,1,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,1,0,1,1,1,1}); param0.add(new int[]{2,7,10,17,26,36,37,85,87,88}); param0.add(new int[]{64,-2,-94,-84,-48,86}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{91,49,94,81,64,5,13,70,82,9,80,82}); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(20); param1.add(26); param1.add(12); param1.add(3); param1.add(36); param1.add(8); param1.add(5); param1.add(20); param1.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY{ static int f_gold ( int arr [ ] , int n ) { HashMap < Integer , Integer > vis = new HashMap < Integer , Integer > ( ) { @ Override public Integer get ( Object key ) { if ( ! containsKey ( key ) ) return 0 ; return super . get ( key ) ; } }; for ( int i = 0 ; i < n ; ++ i ) vis . put ( arr [ i ] , 1 ) ; int k = vis . size ( ) ; vis . clear ( ) ; int ans = 0 , right = 0 , window = 0 ; for ( int left = 0 ; left < n ; ++ left ) { while ( right < n && window < k ) { vis . put ( arr [ right ] , vis . get ( arr [ right ] ) + 1 ) ; if ( vis . get ( arr [ right ] ) == 1 ) ++ window ; ++ right ; [MASK] if ( window == k ) ans += ( n - right + 1 ) ; vis . put ( arr [ left ] , vis . get ( arr [ left ] ) - 1 ) ; if ( vis . get ( arr [ left ] ) == 0 ) -- window ; } return ans ; } } if ( window == k ) ans += ( n - right + 1 ) ; vis . put ( arr [ left ] , vis . get ( arr [ left ] ) - 1 ) ; if ( vis . get ( arr [ left ] ) == 0 ) -- window ; } return ans ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{13,39,49,52,53,69,72,79,83,96}); param0.add(new int[]{-98,-98,22,-10,-28,0,56,72,36,88,96,22,90,74,-60,-64,0,2,-42,0,94,-82,-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,1,1,1,1,1,1,1}); param0.add(new int[]{35,23,41,58,66,92,3,33,78,70,80,86,21,21,74,19}); param0.add(new int[]{-98,-80,-52,-10,4,76}); param0.add(new int[]{1,0,0,0,1,0,0,0,1,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,1,0,1,1,1,1}); param0.add(new int[]{2,7,10,17,26,36,37,85,87,88}); param0.add(new int[]{64,-2,-94,-84,-48,86}); param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{91,49,94,81,64,5,13,70,82,9,80,82}); List<Integer> param1 = new ArrayList<>(); param1.add(5); param1.add(20); param1.add(26); param1.add(12); param1.add(3); param1.add(36); param1.add(8); param1.add(5); param1.add(20); param1.add(9); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
}
[ "a) =", "b) i", "c) 10", "d) }", "e) )" ]
d
java
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 ; } t 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()); } }
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 [MASK] dec_value += last_digit * base ; base = base * 8 ; } return dec_value ; }t 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()); } }
;
[ "a) ans;", "b) int", "c) [", "d) ;", "e) \"\"" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH{ static int f_gold ( int [ ] arr , int n , int k ) { if ( k > n ) return - 1 ; int [ ] csum = new int [ n ] ; csum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) csum [ i ] = csum [ i - 1 ] + arr [ i ] ; int max_sum = csum [ k - 1 ] , max_end = k - 1 ; for ( int i = k ; i < n ; i ++ ) { int curr_sum = csum [ i ] - csum [ i - k ] ; if ( curr_sum > max_sum ) { max_sum = curr_sum ; max_end = i ; } } return max_end - k + 1 ; } i = k ; i < n ; i ++ ) { int curr_sum = csum [ i ] - csum [ i - k ] ; if ( curr_sum > max_sum ) { max_sum = curr_sum ; max_end = i ; } } return max_end - k + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,6,19,21,23,32,34,47,51,56,57,57,65,68,68,69,70,71,73,74,74,77,77,79,82,82,86,87,87,88,89,90,91,92}); param0.add(new int[]{24,62,-32,-28,42,-46,-96,-70,-68,60,44,34,-30,96,-26,92,62,42,-46,-38,44,54,-94,52,66,68,-96,-58,84,-2,66,30,42}); 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}); param0.add(new int[]{94,6,48,34,31}); param0.add(new int[]{-98,-88,-82,-80,-76,-70,-70,-60,-60,-52,-50,-46,-44,-44,-44,-20,-18,-12,-12,-12,-10,-8,-6,-4,4,4,18,28,32,34,42,42,44,46,48,54,60,70,70,72,78,78,78,78,84,86,90,96,98}); param0.add(new int[]{0,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0}); param0.add(new int[]{1,5,13,17,26,26,32,35,38,38,39,45,52,58,60,61,62,63,82,83,85,89,89,91}); param0.add(new int[]{-68,-52,4,-90,90,88,38,-18,86,4,14,-32,-14,-44,-88,-50,-12,-26,-68,-20,-30,22,0,14,-40,58,-6,28,-44,8,28,96,-46,-12}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{17,33,36,34,32,10,37,48,47,32,21,18,75,8,18,52,21,73,25,25,80,32,10,24,1,89,7,42,86,85,73,12,20,20,1,74,77,4,24,74,8}); List<Integer> param1 = new ArrayList<>(); param1.add(29); param1.add(23); param1.add(32); param1.add(4); param1.add(45); param1.add(15); param1.add(13); param1.add(32); param1.add(13); param1.add(20); List<Integer> param2 = new ArrayList<>(); param2.add(20); param2.add(31); param2.add(31); param2.add(3); param2.add(30); param2.add(8); param2.add(22); param2.add(22); param2.add(11); param2.add(28); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH{ static int f_gold ( int [ ] arr , int n , int k ) { if ( k > n ) return - 1 ; int [ ] csum = new int [ n ] ; csum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) csum [ i ] = csum [ i - 1 ] + arr [ i ] ; int max_sum = csum [ k - 1 ] , max_end = k - 1 ; for ( int i = k ; i < n ; i ++ ) { int curr_sum = csum [ i ] - csum [ i - k ] ; if ( curr_sum > max_sum ) { max_sum = curr_sum ; max_end [MASK] i ; } } return max_end - k + 1 ; } i = k ; i < n ; i ++ ) { int curr_sum = csum [ i ] - csum [ i - k ] ; if ( curr_sum > max_sum ) { max_sum = curr_sum ; max_end = i ; } } return max_end - k + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<int [ ]> param0 = new ArrayList<>(); param0.add(new int[]{2,4,6,19,21,23,32,34,47,51,56,57,57,65,68,68,69,70,71,73,74,74,77,77,79,82,82,86,87,87,88,89,90,91,92}); param0.add(new int[]{24,62,-32,-28,42,-46,-96,-70,-68,60,44,34,-30,96,-26,92,62,42,-46,-38,44,54,-94,52,66,68,-96,-58,84,-2,66,30,42}); 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}); param0.add(new int[]{94,6,48,34,31}); param0.add(new int[]{-98,-88,-82,-80,-76,-70,-70,-60,-60,-52,-50,-46,-44,-44,-44,-20,-18,-12,-12,-12,-10,-8,-6,-4,4,4,18,28,32,34,42,42,44,46,48,54,60,70,70,72,78,78,78,78,84,86,90,96,98}); param0.add(new int[]{0,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0}); param0.add(new int[]{1,5,13,17,26,26,32,35,38,38,39,45,52,58,60,61,62,63,82,83,85,89,89,91}); param0.add(new int[]{-68,-52,4,-90,90,88,38,-18,86,4,14,-32,-14,-44,-88,-50,-12,-26,-68,-20,-30,22,0,14,-40,58,-6,28,-44,8,28,96,-46,-12}); param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1}); param0.add(new int[]{17,33,36,34,32,10,37,48,47,32,21,18,75,8,18,52,21,73,25,25,80,32,10,24,1,89,7,42,86,85,73,12,20,20,1,74,77,4,24,74,8}); List<Integer> param1 = new ArrayList<>(); param1.add(29); param1.add(23); param1.add(32); param1.add(4); param1.add(45); param1.add(15); param1.add(13); param1.add(32); param1.add(13); param1.add(20); List<Integer> param2 = new ArrayList<>(); param2.add(20); param2.add(31); param2.add(31); param2.add(3); param2.add(30); param2.add(8); param2.add(22); param2.add(22); param2.add(11); param2.add(28); 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()); } }
=
[ "a) =", "b) ],", "c) ]", "d) {return", "e) a," ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class N_TH_ROOT_NUMBER{ static double f_gold ( int A , int N ) { double xPre = Math . random ( ) % 10 ; double eps = 0.001 ; double delX = 2147483647 ; double xK = 0.0 ; while ( delX > eps ) { xK = ( ( N - 1.0 ) * xPre + ( double ) A / Math . pow ( xPre , N - 1 ) ) / ( double ) N ; delX = Math . abs ( xK - xPre ) ; xPre = xK ; } return xK ; } 0 ; while ( delX > eps ) { xK = ( ( N - 1.0 ) * xPre + ( double ) A / Math . pow ( xPre , N - 1 ) ) / ( double ) N ; delX = Math . abs ( xK - xPre ) ; xPre = xK ; } return xK ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(94); param0.add(74); param0.add(29); param0.add(29); param0.add(18); param0.add(96); param0.add(3); param0.add(35); param0.add(51); param0.add(19); List<Integer> param1 = new ArrayList<>(); param1.add(85); param1.add(1); param1.add(4); param1.add(11); param1.add(6); param1.add(92); param1.add(61); param1.add(85); param1.add(88); param1.add(54); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class N_TH_ROOT_NUMBER{ static double f_gold ( int A , int N ) { double xPre = Math . random ( ) % 10 ; double eps = 0.001 ; double delX = 2147483647 ; double xK = 0.0 ; while ( delX > eps ) { xK = ( ( N - 1.0 ) * xPre + ( double ) [MASK] / Math . pow ( xPre , N - 1 ) ) / ( double ) N ; delX = Math . abs ( xK - xPre ) ; xPre = xK ; } return xK ; }0 ; while ( delX > eps ) { xK = ( ( N - 1.0 ) * xPre + ( double ) A / Math . pow ( xPre , N - 1 ) ) / ( double ) N ; delX = Math . abs ( xK - xPre ) ; xPre = xK ; } return xK ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(94); param0.add(74); param0.add(29); param0.add(29); param0.add(18); param0.add(96); param0.add(3); param0.add(35); param0.add(51); param0.add(19); List<Integer> param1 = new ArrayList<>(); param1.add(85); param1.add(1); param1.add(4); param1.add(11); param1.add(6); param1.add(92); param1.add(61); param1.add(85); param1.add(88); param1.add(54); for(int i = 0; i < param0.size(); ++i) { if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
A
[ "a) }", "b) x:", "c) .", "d) A", "e) {qsort" ]
d
java
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 ) ; } inue ; } 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()); } }
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 ) [MASK] }inue ; } 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()); } }
;
[ "a) )", "b) ;", "c) c", "d) i", "e) int" ]
b
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1{ static int f_gold ( int a , int b ) { return ( a / 2 ) + ( b / 2 ) + ( ( a % 2 + b % 2 ) / 2 ) ; } a.lang.*; import javafx.util.Pair; public class COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1{ static int f_gold ( int a , int b ) { return ( a / 2 ) + ( b / 2 ) + ( ( a % 2 + b % 2 ) / 2 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(9); param0.add(68); param0.add(51); param0.add(31); param0.add(14); param0.add(73); param0.add(51); param0.add(75); param0.add(98); param0.add(83); List<Integer> param1 = new ArrayList<>(); param1.add(81); param1.add(79); param1.add(2); param1.add(49); param1.add(10); param1.add(9); param1.add(13); param1.add(67); param1.add(51); param1.add(74); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1{ static int f_gold ( int a , int b ) { return ( a / 2 ) + ( b / 2 ) + ( ( a % 2 + b % 2 ) / 2 ) ; [MASK]a.lang.*; import javafx.util.Pair; public class COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1{ static int f_gold ( int a , int b ) { return ( a / 2 ) + ( b / 2 ) + ( ( a % 2 + b % 2 ) / 2 ) ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(9); param0.add(68); param0.add(51); param0.add(31); param0.add(14); param0.add(73); param0.add(51); param0.add(75); param0.add(98); param0.add(83); List<Integer> param1 = new ArrayList<>(); param1.add(81); param1.add(79); param1.add(2); param1.add(49); param1.add(10); param1.add(9); param1.add(13); param1.add(67); param1.add(51); param1.add(74); 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()); } }
}
[ "a) }", "b) <", "c) (", "d) <math.h>", "e) void" ]
a
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class EULERIAN_NUMBER_1{ public static int f_gold ( int n , int m ) { int [ ] [ ] dp = new int [ n + 1 ] [ m + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= m ; j ++ ) { if ( i > j ) { if ( j == 0 ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] ) ; } } } return dp [ n ] [ m ] ; } if ( j == 0 ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] ) ; } } } return dp [ n ] [ m ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(27); param0.add(77); param0.add(35); param0.add(26); param0.add(6); param0.add(66); param0.add(44); param0.add(26); param0.add(74); param0.add(65); List<Integer> param1 = new ArrayList<>(); param1.add(7); param1.add(34); param1.add(22); param1.add(20); param1.add(10); param1.add(47); param1.add(29); param1.add(33); param1.add(86); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public [MASK] EULERIAN_NUMBER_1{ public static int f_gold ( int n , int m ) { int [ ] [ ] dp = new int [ n + 1 ] [ m + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= m ; j ++ ) { if ( i > j ) { if ( j == 0 ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] ) ; } } } return dp [ n ] [ m ] ; } if ( j == 0 ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] ) ; } } } return dp [ n ] [ m ] ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(27); param0.add(77); param0.add(35); param0.add(26); param0.add(6); param0.add(66); param0.add(44); param0.add(26); param0.add(74); param0.add(65); List<Integer> param1 = new ArrayList<>(); param1.add(7); param1.add(34); param1.add(22); param1.add(20); param1.add(10); param1.add(47); param1.add(29); param1.add(33); param1.add(86); 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()); } }
class
[ "a) ==", "b) ==", "c) ,", "d) class", "e) (x" ]
d
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class ADD_1_TO_A_GIVEN_NUMBER{ static int f_gold ( int x ) { int m = 1 ; while ( ( int ) ( x & m ) >= 1 ) { x = x ^ m ; m <<= 1 ; } x = x ^ m ; return x ; } afx.util.Pair; public class ADD_1_TO_A_GIVEN_NUMBER{ static int f_gold ( int x ) { int m = 1 ; while ( ( int ) ( x & m ) >= 1 ) { x = x ^ m ; m <<= 1 ; } x = x ^ m ; return x ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(96); param0.add(66); param0.add(67); param0.add(13); param0.add(75); param0.add(78); param0.add(1); param0.add(83); param0.add(27); 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()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class ADD_1_TO_A_GIVEN_NUMBER{ static int f_gold ( int x ) { int m = 1 ; while ( ( [MASK] ) ( x & m ) >= 1 ) { x = x ^ m ; m <<= 1 ; } x = x ^ m ; return x ; }afx.util.Pair; public class ADD_1_TO_A_GIVEN_NUMBER{ static int f_gold ( int x ) { int m = 1 ; while ( ( int ) ( x & m ) >= 1 ) { x = x ^ m ; m <<= 1 ; } x = x ^ m ; return x ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(96); param0.add(66); param0.add(67); param0.add(13); param0.add(75); param0.add(78); param0.add(1); param0.add(83); param0.add(27); 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()); } }
int
[ "a) (", "b) )", "c) int", "d) javafx.util.Pair;", "e) y2" ]
c
java
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1{ public static int f_gold ( int a , int b ) { if ( a == 0 || b == 0 ) return 1 ; return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ; } 1{ public static int f_gold ( int a , int b ) { if ( a == 0 || b == 0 ) return 1 ; return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(97); param0.add(52); param0.add(95); param0.add(35); param0.add(40); param0.add(18); param0.add(92); param0.add(73); param0.add(10); param0.add(82); List<Integer> param1 = new ArrayList<>(); param1.add(91); param1.add(49); param1.add(34); param1.add(40); param1.add(85); param1.add(97); param1.add(15); param1.add(98); param1.add(62); param1.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
import java.util. *; import java.util.stream.*; import java.lang.*; import javafx.util.Pair; public class NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1{ public static int f_gold ( int a , int b ) { [MASK] ( a == 0 || b == 0 ) return 1 ; return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ; }1{ public static int f_gold ( int a , int b ) { if ( a == 0 || b == 0 ) return 1 ; return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ; } //TOFILL public static void main(String args[]) { int n_success = 0; List<Integer> param0 = new ArrayList<>(); param0.add(97); param0.add(52); param0.add(95); param0.add(35); param0.add(40); param0.add(18); param0.add(92); param0.add(73); param0.add(10); param0.add(82); List<Integer> param1 = new ArrayList<>(); param1.add(91); param1.add(49); param1.add(34); param1.add(40); param1.add(85); param1.add(97); param1.add(15); param1.add(98); param1.add(62); param1.add(22); for(int i = 0; i < param0.size(); ++i) { if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i))) { n_success+=1; } } System.out.println("#Results:" + n_success + ", " + param0.size()); } }
if
[ "a) )", "b) if", "c) string", "d) String", "e) x:" ]
b