index int64 0 0 | repo_id stringlengths 26 205 | file_path stringlengths 51 246 | content stringlengths 8 433k | __index_level_0__ int64 0 10k |
|---|---|---|---|---|
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_FOR_FACTORIAL_OF_A_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FOR_FACTORIAL_OF_A_NUMBER{
static int f_gold ( int n ) {
if ( n == 0 ) return 1 ;
return n * f_gold ( n - 1 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(79);
param0.add(95);
param0.add(84);
param0.add(12);
param0.add(72);
param0.add(67);
param0.add(82);
param0.add(14);
param0.add(2);
param0.add(69);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,600 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBERS_THAT_DONT_CONTAIN_3.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NUMBERS_THAT_DONT_CONTAIN_3{
static int f_gold ( int n ) {
if ( n < 3 ) return n ;
if ( n >= 3 && n < 10 ) return n - 1 ;
int po = 1 ;
while ( n / po > 9 ) po = po * 10 ;
int msd = n / po ;
if ( msd != 3 ) return f_gold ( msd ) * f_gold ( po - 1 ) + f_gold ( msd ) + f_gold ( n % po ) ;
else return f_gold ( msd * po - 1 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(85);
param0.add(86);
param0.add(3);
param0.add(35);
param0.add(59);
param0.add(38);
param0.add(33);
param0.add(15);
param0.add(75);
param0.add(74);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,601 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_DISTINCT_SUBSET_SUBSEQUENCE_SUMS_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_DISTINCT_SUBSET_SUBSEQUENCE_SUMS_ARRAY{
static void f_gold ( int arr [ ] , int n ) {
int sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) sum += arr [ i ] ;
boolean [ ] [ ] dp = new boolean [ n + 1 ] [ sum + 1 ] ;
for ( int i = 0 ;
i <= n ;
i ++ ) dp [ i ] [ 0 ] = true ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
dp [ i ] [ arr [ i - 1 ] ] = true ;
for ( int j = 1 ;
j <= sum ;
j ++ ) {
if ( dp [ i - 1 ] [ j ] == true ) {
dp [ i ] [ j ] = true ;
dp [ i ] [ j + arr [ i - 1 ] ] = true ;
}
}
}
for ( int j = 0 ;
j <= sum ;
j ++ ) if ( dp [ n ] [ j ] == true ) System . out . print ( j + " " ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{39,74,36,22,28,82,86,13,47,49,86,85,42,47,56,43,43,19,6});
param0.add(new int[]{69,56,34,64,68,36,95,7,13,38,3,30,74,35,97,84,10,75,22,31,32,36,61,32,98,19});
param0.add(new int[]{79,87,58,4,3,47,95,27,89,52,75,6,84,42,68,48,64,21,65,26,53,45});
param0.add(new int[]{36,20,68,93,75,14,45,39,46,72,74,1,34});
param0.add(new int[]{96,31,82,84,17,89,69,47,79,13,83,45,10,77,9,72,83,39,84,44,36,62,77,61,28,22,46,24,98,37,15});
param0.add(new int[]{69,6,41,35,93,24,68,7,66,34,73,78,98,75,10,62,72,22,15,51,57,86,82,99,17,48,19,59,67,36,82,93,14,59,72,9,59,67,26,93});
param0.add(new int[]{4,59,33,66,41});
param0.add(new int[]{50,7,67,14,85,74,99,79,14,33,17,77,53,18,6,35,82,14,58,96,22});
param0.add(new int[]{14,36,36,46,69,11,55,41,49,49,31,19,8,26,63,30,27,83,80,35,53,47,38,58,51,31,95,77,47,41,49,14,20,76,64,34,24,90,78,25,26,64,3});
param0.add(new int[]{84,49,15,7,28,82,35,74,10,20,6,5,67,60,64,88,75,54,57,11,49,1,85,46,22,16,17,58,2,12,55,49,8,52,37,7,76,91,72,92,75,8,88,20,9});
List<Integer> param1 = new ArrayList<>();
param1.add(10);
param1.add(22);
param1.add(19);
param1.add(7);
param1.add(28);
param1.add(27);
param1.add(3);
param1.add(17);
param1.add(26);
param1.add(23);
List<int [ ]> filled_function_param0 = new ArrayList<>();
filled_function_param0.add(new int[]{39,74,36,22,28,82,86,13,47,49,86,85,42,47,56,43,43,19,6});
filled_function_param0.add(new int[]{69,56,34,64,68,36,95,7,13,38,3,30,74,35,97,84,10,75,22,31,32,36,61,32,98,19});
filled_function_param0.add(new int[]{79,87,58,4,3,47,95,27,89,52,75,6,84,42,68,48,64,21,65,26,53,45});
filled_function_param0.add(new int[]{36,20,68,93,75,14,45,39,46,72,74,1,34});
filled_function_param0.add(new int[]{96,31,82,84,17,89,69,47,79,13,83,45,10,77,9,72,83,39,84,44,36,62,77,61,28,22,46,24,98,37,15});
filled_function_param0.add(new int[]{69,6,41,35,93,24,68,7,66,34,73,78,98,75,10,62,72,22,15,51,57,86,82,99,17,48,19,59,67,36,82,93,14,59,72,9,59,67,26,93});
filled_function_param0.add(new int[]{4,59,33,66,41});
filled_function_param0.add(new int[]{50,7,67,14,85,74,99,79,14,33,17,77,53,18,6,35,82,14,58,96,22});
filled_function_param0.add(new int[]{14,36,36,46,69,11,55,41,49,49,31,19,8,26,63,30,27,83,80,35,53,47,38,58,51,31,95,77,47,41,49,14,20,76,64,34,24,90,78,25,26,64,3});
filled_function_param0.add(new int[]{84,49,15,7,28,82,35,74,10,20,6,5,67,60,64,88,75,54,57,11,49,1,85,46,22,16,17,58,2,12,55,49,8,52,37,7,76,91,72,92,75,8,88,20,9});
List<Integer> filled_function_param1 = new ArrayList<>();
filled_function_param1.add(10);
filled_function_param1.add(22);
filled_function_param1.add(19);
filled_function_param1.add(7);
filled_function_param1.add(28);
filled_function_param1.add(27);
filled_function_param1.add(3);
filled_function_param1.add(17);
filled_function_param1.add(26);
filled_function_param1.add(23);
for(int i = 0; i < param0.size(); ++i)
{
f_filled(filled_function_param0.get(i),filled_function_param1.get(i));
f_gold(param0.get(i),param1.get(i));
if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,602 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1{
static int f_gold ( int arr1 [ ] , int arr2 [ ] , int n ) {
int index = n ;
int left = 0 , right = n - 1 ;
while ( left <= right ) {
int mid = ( left + right ) / 2 ;
if ( arr2 [ mid ] == arr1 [ mid ] ) left = mid + 1 ;
else {
index = mid ;
right = mid - 1 ;
}
}
return index ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,18,19,25,26,27,31,39,44,46,59,60,66,72,78,83,84,92,94});
param0.add(new int[]{-14,-56,92,-90,96,-84,64,-38,-20,84,56,92,18,-78,98,-96,-60,88,-52,-28,30,-90,14,76,56,20,-18,-94,-82,-2,96,-60,-64,-90,42,6,20,-38,82,-86,-4,82,54,-88});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{13,64,73,50,73,19,92,10,64,79,58,41,97,53,53,10,96,45,47,38,99});
param0.add(new int[]{-96,-94,-90,-90,-78,-70,-64,-64,-58,-58,-52,-40,-36,-34,-34,-30,-26,-2,0,2,14,18,24,28,28,30,34,40,42,48,66,72,86,90,92,98});
param0.add(new int[]{1,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,1,1,0});
param0.add(new int[]{10,51,74,74,75,80,90});
param0.add(new int[]{-44,48,20,-38,-48,-26,56,-62,-94,-18,30,66,-16,80,96,-40,-80,32,88,-56,-76,16,72,-94,4,-34,-92,70,-90,-54,64,-90});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{19,53,13,91,52,62,39,84,68,45,32,40,13,68,79,76,11,42,76,30,81,3,30,15,85,76,1});
List<int [ ]> param1 = new ArrayList<>();
param1.add(new int[]{2,5,12,13,17,20,22,46,51,63,64,66,66,76,87,87,90,91,96});
param1.add(new int[]{54,44,-50,26,4,-26,-76,98,-14,36,82,0,-60,18,52,82,-12,-8,-26,-58,22,-70,24,48,56,-46,92,98,-50,-72,-66,8,40,12,-80,-86,90,-30,76,-92,80,-62,0,-48});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{24,42,54,13,88,63,50,73,64,66,86,84,53,4,44,58,44,42,36,94,34});
param1.add(new int[]{-94,-92,-90,-88,-86,-82,-82,-80,-76,-74,-64,-60,-58,-46,-44,-36,-30,-30,-30,-18,-16,-8,-6,12,14,20,26,38,40,42,42,68,78,82,88,98});
param1.add(new int[]{0,0,1,1,0,0,1,0,1,1,0,1,0,1,1,1,1,1,1,1,0});
param1.add(new int[]{12,20,36,38,61,64,93});
param1.add(new int[]{-76,92,-66,20,86,40,64,16,54,-6,54,-88,-24,38,86,2,30,70,98,-46,28,34,40,-88,-96,92,22,14,-36,-96,-48,-72});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{33,65,36,82,30,95,42,33,9,21,25,90,54,59,21,45,3,93,67,50,97,72,77,54,75,8,6});
List<Integer> param2 = new ArrayList<>();
param2.add(11);
param2.add(26);
param2.add(31);
param2.add(13);
param2.add(29);
param2.add(19);
param2.add(5);
param2.add(28);
param2.add(14);
param2.add(25);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,603 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1{
static boolean f_gold ( int arr [ ] , int n , int x ) {
HashSet < Integer > hset = new HashSet < > ( ) ;
if ( n < 2 ) return false ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] == 0 ) {
if ( x == 0 ) return true ;
else continue ;
}
if ( x % arr [ i ] == 0 ) {
if ( hset . contains ( x / arr [ i ] ) ) return true ;
hset . add ( arr [ i ] ) ;
}
}
return false ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,3,7,23,23,25,27,37,42,53,56,58,61,69,78,79,84,85,86,90,93,95});
param0.add(new int[]{-10,-18,88,-36,78,66,-70,-34,-88,-98,-70,-4,-94,-92,-76,-78,-30,-48,-72,86,-64,38,-80,20,70,-32,-90,74,-78,12,-54,88,38,-96,28});
param0.add(new int[]{0,0,0,0,0,0,0,0,1,1});
param0.add(new int[]{83,61,55,89,16,78,44,54,22,49,58,62,53,99,35,83,29,19,96,39,60,6,34,67,43,29,46,3,81,78,80,39,86,78,21});
param0.add(new int[]{-96,-88,-80,-62,-58,-56,-54,-52,-34,-20,-6,-2,6,20,52,54,70,72,80,82,94});
param0.add(new int[]{0,1,1,0,0,1,1,1});
param0.add(new int[]{8,11,11,20,22,23,26,27,31,38,40,40,45,46,46,48,50,61,73,76,78,78,79,80,81,84,90,91,93,95});
param0.add(new int[]{18});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{19,37,47,40,72,59,51,53,92,3,21,81,29,48,97,59,10,74,11,37,49,95,88,85,6,26,76,33});
List<Integer> param1 = new ArrayList<>();
param1.add(15);
param1.add(17);
param1.add(9);
param1.add(23);
param1.add(18);
param1.add(4);
param1.add(24);
param1.add(0);
param1.add(37);
param1.add(22);
List<Integer> param2 = new ArrayList<>();
param2.add(17);
param2.add(22);
param2.add(5);
param2.add(27);
param2.add(12);
param2.add(6);
param2.add(28);
param2.add(0);
param2.add(39);
param2.add(21);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,604 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MINIMUM_DIFFERENCE_PAIR_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MINIMUM_DIFFERENCE_PAIR_1{
static int f_gold ( int [ ] arr , int n ) {
Arrays . sort ( arr ) ;
int diff = Integer . MAX_VALUE ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) if ( arr [ i + 1 ] - arr [ i ] < diff ) diff = arr [ i + 1 ] - arr [ i ] ;
return diff ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,25,44,46,54,60,81});
param0.add(new int[]{82,68,-98,-66,-36,-42,98,-38,58,-6,-28,70,-24,18,16,10,92,44,28,-96,-72,24,28,-80,-4,38,88,76});
param0.add(new int[]{1,1,1});
param0.add(new int[]{87,25,80,45,44,20,48,47,51,54,68,47,89,95,15,29,5,45,2,64,53,96,94,22,23,43,61,75,74,50});
param0.add(new int[]{-74,-48,-42,-26,-16,-12,0,4,8,18,46,46,62,70,74,88,92,96,98});
param0.add(new int[]{0,1,1,1,0,1,1,0,0,1,1,1,0,0,1,1,0,1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0});
param0.add(new int[]{27,42,59,80});
param0.add(new int[]{-96,-94,10,-36,18,-40});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{96});
List<Integer> param1 = new ArrayList<>();
param1.add(3);
param1.add(22);
param1.add(2);
param1.add(15);
param1.add(18);
param1.add(36);
param1.add(2);
param1.add(4);
param1.add(12);
param1.add(0);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,605 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY{
static int f_gold ( int [ ] arr , int n ) {
if ( n < 3 ) return - 1 ;
int max_product = Integer . MIN_VALUE ;
for ( int i = 0 ;
i < n - 2 ;
i ++ ) for ( int j = i + 1 ;
j < n - 1 ;
j ++ ) for ( int k = j + 1 ;
k < n ;
k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ;
return max_product ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{41,66,77});
param0.add(new int[]{92,-34,-36,-50,20,-94,2,-86,22,-50,74,84,52,-84,98,-50,88,26,-36,-36,6,-50,-48,-84,38,-96,-62,34,52,92,40,-84,18,-90,54,-38,-74,-98,-8,-92,-60,86,-36,94,56});
param0.add(new int[]{0,0,1});
param0.add(new int[]{2,77,99,95,78,15,69,39,34,43,66,45,97,27,67,62,64,2,28,94,41,87,97,52,14,61,78,50});
param0.add(new int[]{-62,-28,40,76});
param0.add(new int[]{0,1,1,0,1,1,1,1,1});
param0.add(new int[]{2,6,10,11,12,12,17,18,18,19,20,22,24,25,30,35,36,37,40,41,42,47,60,60,64,69,69,70,73,79,80,83,97,97,97});
param0.add(new int[]{-72,98,68,18,92,-84,50,32,-90,-40,50,60,-50,-50,50,24,30,94,-98,-6,46,-46,-24,-62,-20,62,-76});
param0.add(new int[]{0,0,0,0,0,1,1,1});
param0.add(new int[]{85,36,7,69,9,45,18,47,1,78,72,53,37,20,95,71,58,41});
List<Integer> param1 = new ArrayList<>();
param1.add(2);
param1.add(40);
param1.add(1);
param1.add(26);
param1.add(3);
param1.add(5);
param1.add(25);
param1.add(14);
param1.add(7);
param1.add(14);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,606 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SET_BITS_IN_AN_INTEGER_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SET_BITS_IN_AN_INTEGER_1{
public static int f_gold ( int n ) {
if ( n == 0 ) return 0 ;
else return ( n & 1 ) + f_gold ( n >> 1 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(43);
param0.add(94);
param0.add(72);
param0.add(86);
param0.add(42);
param0.add(33);
param0.add(8);
param0.add(74);
param0.add(29);
param0.add(34);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,607 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N{
static int f_gold ( int n ) {
if ( n < 10 ) return ( n * ( n + 1 ) / 2 ) ;
int d = ( int ) ( Math . log10 ( n ) ) ;
int a [ ] = new int [ d + 1 ] ;
a [ 0 ] = 0 ;
a [ 1 ] = 45 ;
for ( int i = 2 ;
i <= d ;
i ++ ) a [ i ] = a [ i - 1 ] * 10 + 45 * ( int ) ( Math . ceil ( Math . pow ( 10 , i - 1 ) ) ) ;
int p = ( int ) ( Math . ceil ( Math . pow ( 10 , d ) ) ) ;
int msd = n / p ;
return ( msd * a [ d ] + ( msd * ( msd - 1 ) / 2 ) * p + msd * ( 1 + n % p ) + f_gold ( n % p ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(29);
param0.add(97);
param0.add(71);
param0.add(82);
param0.add(69);
param0.add(30);
param0.add(82);
param0.add(32);
param0.add(77);
param0.add(39);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,608 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X{
static int f_gold ( int x ) {
int i = 1 ;
int fact = 1 ;
for ( i = 1 ;
i < x ;
i ++ ) {
fact = fact * i ;
if ( fact % x == 0 ) break ;
}
return i ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(47);
param0.add(57);
param0.add(89);
param0.add(67);
param0.add(40);
param0.add(16);
param0.add(83);
param0.add(93);
param0.add(43);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,609 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE{
static int f_gold ( int arr [ ] , int n ) {
int sum [ ] = new int [ n ] ;
if ( n >= 1 ) sum [ 0 ] = arr [ 0 ] ;
if ( n >= 2 ) sum [ 1 ] = arr [ 0 ] + arr [ 1 ] ;
if ( n > 2 ) sum [ 2 ] = Math . max ( sum [ 1 ] , Math . max ( arr [ 1 ] + arr [ 2 ] , arr [ 0 ] + arr [ 2 ] ) ) ;
for ( int i = 3 ;
i < n ;
i ++ ) sum [ i ] = Math . max ( Math . max ( sum [ i - 1 ] , sum [ i - 2 ] + arr [ i ] ) , arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] ) ;
return sum [ n - 1 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,6,8,9,10,10,16,17,17,20,21,22,23,28,29,32,36,37,40,41,42,43,47,47,48,48,49,49,52,52,53,59,61,64,65,79,79,81,87,91,92,98});
param0.add(new int[]{98,76,-80,-30,82,52,-14,28,98,18,82,52,26,-62,-8});
param0.add(new int[]{0,0,0,0,0,1,1,1,1});
param0.add(new int[]{21,26,85,73,47,10,54,9,11,70,42,95,44,91});
param0.add(new int[]{-94,-92,-90,-84,-76,-68,-60,-50,-34,-34,-20,-16,-6,18,50,54,66,70,96});
param0.add(new int[]{1,0,1,1,1,0,1,0,0,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,1});
param0.add(new int[]{2,3,4,4,14,14,18,21,24,26,29,31,32,34,36,37,38,40,42,44,44,54,63,69,77,77,82,82,86,87,90,93,95});
param0.add(new int[]{-46,64,-44,88,-74,54,40,-2,-24,94,40,-44,56,-54,-60,-86,-58,48,-90,12,-76,-30,94,-34,14,12,80,-40,60});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1});
param0.add(new int[]{4,32,63,23,44,57,59,69,88,61,66,61,65,33,79,58,71,2,80,41,83,12,20,9,7,40,36,97,10,98,66,78,71,37,53});
List<Integer> param1 = new ArrayList<>();
param1.add(35);
param1.add(7);
param1.add(7);
param1.add(12);
param1.add(9);
param1.add(16);
param1.add(31);
param1.add(22);
param1.add(7);
param1.add(26);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,610 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/K_TH_PRIME_FACTOR_GIVEN_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class K_TH_PRIME_FACTOR_GIVEN_NUMBER{
static int f_gold ( int n , int k ) {
while ( n % 2 == 0 ) {
k -- ;
n = n / 2 ;
if ( k == 0 ) return 2 ;
}
for ( int i = 3 ;
i <= Math . sqrt ( n ) ;
i = i + 2 ) {
while ( n % i == 0 ) {
if ( k == 1 ) return i ;
k -- ;
n = n / i ;
}
}
if ( n > 2 && k == 1 ) return n ;
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(94);
param0.add(99);
param0.add(64);
param0.add(27);
param0.add(24);
param0.add(84);
param0.add(69);
param0.add(69);
param0.add(22);
param0.add(39);
List<Integer> param1 = new ArrayList<>();
param1.add(0);
param1.add(1);
param1.add(3);
param1.add(3);
param1.add(4);
param1.add(6);
param1.add(98);
param1.add(39);
param1.add(60);
param1.add(57);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
}
| 5,611 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1{
static int f_gold ( int arr [ ] , int N , int k ) {
int maxSum = 0 ;
Arrays . sort ( arr ) ;
for ( int i = N - 1 ;
i > 0 ;
-- i ) {
if ( arr [ i ] - arr [ i - 1 ] < k ) {
maxSum += arr [ i ] ;
maxSum += arr [ i - 1 ] ;
-- i ;
}
}
return maxSum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,10,11,11,12,14,15,17,27,27,28,36,36,44,47,47,54,55,62,64,68,69,70,70,75,76,78,85,85,91,95,97});
param0.add(new int[]{-36,78,10,30,-12,-70,-98,-14,-44,-66,-40,-8,78,2,-70,40,92,58,30,10,-84,-62,-86,-50,82,36,-92,-30,-2,-34,88,2,-4,-72});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{77,78,58});
param0.add(new int[]{-88,-88,-88,-82,-58,-54,-48,-46,-46,-44,-20,-2,10,28,28,28,42,42,44,50,50,54,56,58,62,68,70,72,74,76,78,88,90,92});
param0.add(new int[]{0,1,0,0,1,0,1,0,1,1,1,1,1,1,1,1,1,0,1,1,1,1,0,0,0,0,1,0,0,1,1,1,1,1,0,0,0,0,0,0,1,0,1});
param0.add(new int[]{5,7,10,11,15,17,20,20,29,29,32,37,38,39,40,41,45,51,60,64,64,68,68,70,71,71,71,75,76,82,84,87,88,88,95,98});
param0.add(new int[]{-46,-32,76,-28,44,-14,94,-4,60,-88,-52,32,-66,28,94,76,86,-4,74,52,64,-36,-98,-40,70,18,-22,-20,-16,-74,12,60,94,98,-28,-24,4,-34,-60,56});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{79,13,25,22,61,1,2,73,66,94,47,9,1,99,25,39,95,46,95,20,63,15,14,36,9,91,14});
List<Integer> param1 = new ArrayList<>();
param1.add(26);
param1.add(26);
param1.add(47);
param1.add(1);
param1.add(21);
param1.add(41);
param1.add(30);
param1.add(33);
param1.add(28);
param1.add(19);
List<Integer> param2 = new ArrayList<>();
param2.add(18);
param2.add(25);
param2.add(26);
param2.add(1);
param2.add(24);
param2.add(40);
param2.add(21);
param2.add(23);
param2.add(41);
param2.add(23);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,612 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING{
static int f_gold ( String str ) {
int N = str . length ( ) ;
int [ ] [ ] cps = new int [ N + 1 ] [ N + 1 ] ;
for ( int i = 0 ;
i < N ;
i ++ ) cps [ i ] [ i ] = 1 ;
for ( int L = 2 ;
L <= N ;
L ++ ) {
for ( int i = 0 ;
i < N ;
i ++ ) {
int k = L + i - 1 ;
if ( k < N ) {
if ( str . charAt ( i ) == str . charAt ( k ) ) cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] + 1 ;
else cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] - cps [ i + 1 ] [ k - 1 ] ;
}
}
}
return cps [ 0 ] [ N - 1 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("R");
param0.add("2956350");
param0.add("11100111110101");
param0.add("TZTDLIIfAD");
param0.add("98");
param0.add("1100100001");
param0.add("oKwGeatf");
param0.add("19");
param0.add("00010110100");
param0.add("Cyq");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,613 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2{
static int f_gold ( int n ) {
n -- ;
int sum = 0 ;
sum += ( n * ( n + 1 ) ) / 2 ;
sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6 ;
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(12);
param0.add(89);
param0.add(76);
param0.add(2);
param0.add(81);
param0.add(11);
param0.add(26);
param0.add(35);
param0.add(16);
param0.add(66);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,614 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT{
static boolean f_gold ( String str ) {
int n = str . length ( ) ;
int digitSum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) digitSum += ( str . charAt ( i ) - '0' ) ;
return ( digitSum % 3 == 0 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("Xy");
param0.add("4827182");
param0.add("110011");
param0.add("GdOXZk");
param0.add("8970294");
param0.add("000110");
param0.add("xMRGdAgsGlH");
param0.add("34643260819239");
param0.add("00");
param0.add("DcCK");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,615 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SORT_ARRAY_TWO_HALVES_SORTED.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class SORT_ARRAY_TWO_HALVES_SORTED{
static void f_gold ( int [ ] A , int n ) {
Arrays . sort ( A ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,3,11,13,18,24,26,30,31,34,42,43,43,44,44,47,49,52,53,55,56,57,58,58,60,64,66,67,69,70,70,71,74,76,77,82,85,89,90,96,98});
param0.add(new int[]{-78,81,87,14,25,24,-70,-92,-2,-43,11,-27,15,-80,-75,-81,-95,-25,28,-28,55,-60,-74,-73,90,-17,28,78,70,57,67,88,69,-67,-3,11,-84,-77,35,-74,-4,-88,-28,33});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{6,46,50,38,88,18,27,41,72,92,74,17,62,29,58,70,78,22,6,26,39,12,99,14,22,51,23,48,71,50,89,13,85,10,55,9,79,52,2,25,13,98,51,58,34,35,3,59,70});
param0.add(new int[]{-98,-88,-76,-71,-71,-63,-59,-58,-57,-42,-40,-37,-36,-34,-33,-33,-27,-26,-23,-9,-8,-6,-5,-1,0,3,16,21,29,30,33,39,39,43,47,50,52,60,63,66,73,74,76,77,92,92,96,97});
param0.add(new int[]{1,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,1,0});
param0.add(new int[]{46,86});
param0.add(new int[]{58,-31,37,-15,-89,-31,-1,-9,94,59,61,67,-6,74,65,15,88,-69,-89,-13,21,30,5});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{94,5,98,22,77,57,47,54,3,53,84,31});
List<Integer> param1 = new ArrayList<>();
param1.add(33);
param1.add(31);
param1.add(15);
param1.add(46);
param1.add(42);
param1.add(31);
param1.add(1);
param1.add(21);
param1.add(19);
param1.add(10);
List<int [ ]> filled_function_param0 = new ArrayList<>();
filled_function_param0.add(new int[]{2,3,11,13,18,24,26,30,31,34,42,43,43,44,44,47,49,52,53,55,56,57,58,58,60,64,66,67,69,70,70,71,74,76,77,82,85,89,90,96,98});
filled_function_param0.add(new int[]{-78,81,87,14,25,24,-70,-92,-2,-43,11,-27,15,-80,-75,-81,-95,-25,28,-28,55,-60,-74,-73,90,-17,28,78,70,57,67,88,69,-67,-3,11,-84,-77,35,-74,-4,-88,-28,33});
filled_function_param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
filled_function_param0.add(new int[]{6,46,50,38,88,18,27,41,72,92,74,17,62,29,58,70,78,22,6,26,39,12,99,14,22,51,23,48,71,50,89,13,85,10,55,9,79,52,2,25,13,98,51,58,34,35,3,59,70});
filled_function_param0.add(new int[]{-98,-88,-76,-71,-71,-63,-59,-58,-57,-42,-40,-37,-36,-34,-33,-33,-27,-26,-23,-9,-8,-6,-5,-1,0,3,16,21,29,30,33,39,39,43,47,50,52,60,63,66,73,74,76,77,92,92,96,97});
filled_function_param0.add(new int[]{1,0,0,1,1,1,0,1,0,0,0,1,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,0,0,0,1,1,1,0,1,0});
filled_function_param0.add(new int[]{46,86});
filled_function_param0.add(new int[]{58,-31,37,-15,-89,-31,-1,-9,94,59,61,67,-6,74,65,15,88,-69,-89,-13,21,30,5});
filled_function_param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1});
filled_function_param0.add(new int[]{94,5,98,22,77,57,47,54,3,53,84,31});
List<Integer> filled_function_param1 = new ArrayList<>();
filled_function_param1.add(33);
filled_function_param1.add(31);
filled_function_param1.add(15);
filled_function_param1.add(46);
filled_function_param1.add(42);
filled_function_param1.add(31);
filled_function_param1.add(1);
filled_function_param1.add(21);
filled_function_param1.add(19);
filled_function_param1.add(10);
for(int i = 0; i < param0.size(); ++i)
{
f_filled(filled_function_param0.get(i),filled_function_param1.get(i));
f_gold(param0.get(i),param1.get(i));
if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,616 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS{
static int f_gold ( int arr [ ] , int n , int x , int y ) {
int i , j ;
int min_dist = Integer . MAX_VALUE ;
for ( i = 0 ;
i < n ;
i ++ ) {
for ( j = i + 1 ;
j < n ;
j ++ ) {
if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > Math . abs ( i - j ) ) min_dist = Math . abs ( i - j ) ;
}
}
return min_dist ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,7,7,8,11,14,16,25,34,35,36,36,38,40,41,43,45,47,57,60,64,72,73,74,75,82,83,83,84,84,84,92});
param0.add(new int[]{96,70,88,-64,-42,58,92,66,-14,90,-66,12,88,-12,48,-4,90,24,98,14,32,38,98,78,2,26,12,-36,90,80,40,58,88,64,16});
param0.add(new int[]{0,0,1});
param0.add(new int[]{46,96,82,73,30,36,56,20,5,36,4,7,89,63,54,97,80,56,93,34,90,56,25,27,75,68,14,90});
param0.add(new int[]{-96,-88,-82,-66,-62,-52,-52,-46,-46,-40,-40,-28,-24,-12,0,4,10,24,42,46,48,48,50,60,62,64,64,70,92,98});
param0.add(new int[]{0,0,1,0,1,1,0,1,1,1,1});
param0.add(new int[]{1,2,2,6,10,14,15,18,19,22,23,29,30,37,40,40,41,41,42,42,44,46,46,54,56,72,73,81,83,83,86,88,93});
param0.add(new int[]{46,86,-52,18,-32,86,2,38,72,72,-60,70,-58,66,-66,-72,-74,58,52,58,16,64,62,-62,80,-70,-96,-44,-20,-74,-10,14,-32,48,30,76,-16,80,66,-46,-92,26,-86,28,-76,-24,-98,54,50});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{32,65,10,72,17,58,79,28,67,36,18,35});
List<Integer> param1 = new ArrayList<>();
param1.add(22);
param1.add(25);
param1.add(1);
param1.add(26);
param1.add(24);
param1.add(10);
param1.add(27);
param1.add(30);
param1.add(38);
param1.add(7);
List<Integer> param2 = new ArrayList<>();
param2.add(7);
param2.add(58);
param2.add(1);
param2.add(54);
param2.add(0);
param2.add(0);
param2.add(1);
param2.add(25);
param2.add(0);
param2.add(10);
List<Integer> param3 = new ArrayList<>();
param3.add(40);
param3.add(70);
param3.add(1);
param3.add(82);
param3.add(4);
param3.add(1);
param3.add(42);
param3.add(45);
param3.add(0);
param3.add(7);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,617 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO{
static boolean f_gold ( int n ) {
if ( n == 0 ) return false ;
while ( n != 1 ) {
if ( n % 2 != 0 ) return false ;
n = n / 2 ;
}
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(2);
param0.add(8);
param0.add(1024);
param0.add(24);
param0.add(7);
param0.add(46);
param0.add(61);
param0.add(73);
param0.add(66);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,618 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_XOR_VALUE_PAIR.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_XOR_VALUE_PAIR{
static int f_gold ( int arr [ ] , int n ) {
int min_xor = Integer . MAX_VALUE ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) min_xor = Math . min ( min_xor , arr [ i ] ^ arr [ j ] ) ;
return min_xor ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,5,7,10,10,11,14,19,21,24,27,27,27,28,28,28,33,34,41,42,43,48,52,53,53,59,62,64,66,71,77,78,78,79,80,82,90,97,99,99});
param0.add(new int[]{-68,-58,52,88,90,66,-66,-84,-70,-64,56,42,94,-10,0,80,8,28,-94,36,90,56,56,80,-94,50,90,-28,-22,-2,-96,74,-16,-14});
param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1});
param0.add(new int[]{57,63,11,73,60,73,25,65,39,48,31,17,23,94,10,97,42,45,83,75,97,96});
param0.add(new int[]{-92,-92,-90,-88,-84,-82,-66,-64,-64,-62,-44,-42,-40,-28,-22,-12,-4,-2,0,4,16,22,28,34,54,60,72,74,78,86,94});
param0.add(new int[]{1,1,1,0,0,0,1,0,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0});
param0.add(new int[]{2,2,6,13,16,16,17,19,19,20,22,25,27,29,34,34,34,36,38,39,42,49,49,53,59,59,71,77,79,82,83,83,84,84,86,86,87,88,93,96});
param0.add(new int[]{-14,20,36,12,-54,-50,92,-28,44,-46,6,96,82,70,-20,24,-96,-14,46,-28,-46,-28,22,-82,36,-94,-48,-92,96,74,14});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{50,48,94,64,60,48,79,75,77,62,33,42,22,78,32,99,27,23,76,51,34,54,70,12,19,17,13,82,96,70,4,12,5,11,23,23,18,93,38,69});
List<Integer> param1 = new ArrayList<>();
param1.add(34);
param1.add(17);
param1.add(9);
param1.add(21);
param1.add(18);
param1.add(36);
param1.add(36);
param1.add(20);
param1.add(39);
param1.add(30);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,619 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_DIVISORS_1_N_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_DIVISORS_1_N_1{
static int f_gold ( int n ) {
int sum = 0 ;
for ( int i = 1 ;
i <= n ;
++ i ) sum += ( n / i ) * i ;
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(73);
param0.add(41);
param0.add(36);
param0.add(28);
param0.add(49);
param0.add(24);
param0.add(85);
param0.add(59);
param0.add(82);
param0.add(40);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,620 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES{
static int f_gold ( int n ) {
return 1 + n * ( n + 1 ) / 2 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(46);
param0.add(68);
param0.add(4);
param0.add(12);
param0.add(56);
param0.add(14);
param0.add(81);
param0.add(29);
param0.add(26);
param0.add(40);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,621 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_TRIPLET_SUM_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_TRIPLET_SUM_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int sum = - 1000000 ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) for ( int k = j + 1 ;
k < n ;
k ++ ) if ( sum < arr [ i ] + arr [ j ] + arr [ k ] ) sum = arr [ i ] + arr [ j ] + arr [ k ] ;
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,10,14,19,24,29,42,43,44,47,47,55,57,59,60,61,76,76,77,81,84,92,92,93,95,97});
param0.add(new int[]{-98,72,52,-62,74,-26,-82,-74,90,58,94,-2,76,-28,12,64,-94,86,56,10,40,20,92,-4,-80,26,-40,36,66,-46,4,-42,-76,76,-90,-48,22,30,48,38,78});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{96,96,38,26,2,36,15,51,78,98,94,31,62,21,7,68,37,4});
param0.add(new int[]{-8,12,68,78,78});
param0.add(new int[]{0,0,0,0,1,0,0,0,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,0,0,0});
param0.add(new int[]{1,15,16,17,28,28,28,30,31,37,38,38,45,45,46,46,50,51,53,53,55,55,56,58,58,64,78,82,82,85,87,89,89,90,94,95});
param0.add(new int[]{-56,-72,-20,88,20,86,30,36,-44,-66,-26,-88,12,-76,78,62,62,68,-34,0,-22,64,72,56,-64,-16,-4,86,0,98,-70,98,-68,92,-84,-56,28,-74,6,-10,-82,36,-12,-26,66,-60,-68,70,2});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1});
param0.add(new int[]{85,31,15,68,92,89,32,56,27,70,82,58,63,83,89,95,78,9,27,34,24,42,66,6,1,71,55,23,75,26,19,58,25});
List<Integer> param1 = new ArrayList<>();
param1.add(15);
param1.add(28);
param1.add(22);
param1.add(10);
param1.add(4);
param1.add(35);
param1.add(29);
param1.add(36);
param1.add(11);
param1.add(16);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,622 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
Arrays . sort ( arr ) ;
int a = 0 , b = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( i % 2 != 0 ) a = a * 10 + arr [ i ] ;
else b = b * 10 + arr [ i ] ;
}
return a + b ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,4,5,10,14,16,18,42,43,43,45,46,51,52,53,58,61,66,79,81,82,84});
param0.add(new int[]{48,-22,60,32,48,-2,-76,-50,-26,56,-86,98,-30,-22,82,-20,58,40,76,-2,82,-90,8,-46,22,94});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{79,45});
param0.add(new int[]{-90,-68,-38,-34,-4,6,10,28,48,52,54,68,88,90});
param0.add(new int[]{1,0,0,1,0,1,0,1,0,1,0,0,1,1,1,1,0,0,1,1,0,1,1,0});
param0.add(new int[]{4,8,8,23,26,27,30,42,44,55,59,64,67,69,74,77,82,82,87,96,97});
param0.add(new int[]{0,-18,-98,-36,-62,0,-32,-98,46,72,-18,30,-86,-42,-82,2,-76,-64,-66,-48,-28,52,-46,-76,76,10,70,4,18,94,88,80,-60,-36,62,96,-4,88,50});
param0.add(new int[]{0,0,0,0,0,0,1,1,1,1});
param0.add(new int[]{8,71,75,58,97,24,56,98,71,69,32,64,54,96,69,22,7,47,45,68,17,36,90,9,71,86,16,61,53,63,9,74,38,87,14,86,42,42,14,43,58,82,72,73,32});
List<Integer> param1 = new ArrayList<>();
param1.add(19);
param1.add(25);
param1.add(23);
param1.add(1);
param1.add(11);
param1.add(22);
param1.add(17);
param1.add(32);
param1.add(6);
param1.add(25);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,623 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_PREFIX_ALSO_SUFFIX_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_PREFIX_ALSO_SUFFIX_1{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int lps [ ] = new int [ n ] ;
lps [ 0 ] = 0 ;
int len = 0 ;
int i = 1 ;
while ( i < n ) {
if ( s . charAt ( i ) == s . charAt ( len ) ) {
len ++ ;
lps [ i ] = len ;
i ++ ;
}
else {
if ( len != 0 ) {
len = lps [ len - 1 ] ;
}
else {
lps [ i ] = 0 ;
i ++ ;
}
}
}
int res = lps [ n - 1 ] ;
return ( res > n / 2 ) ? n / 2 : res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("aabcdaabc");
param0.add("1372494598");
param0.add("110000100001");
param0.add("abcab");
param0.add("488938");
param0.add("011010101011");
param0.add("aaaa");
param0.add("3356203205");
param0.add("1010");
param0.add("kkXiiTZkGeh");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,624 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SEARCHING_ARRAY_ADJACENT_DIFFER_K.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SEARCHING_ARRAY_ADJACENT_DIFFER_K{
static int f_gold ( int arr [ ] , int n , int x , int k ) {
int i = 0 ;
while ( i < n ) {
if ( arr [ i ] == x ) return i ;
i = i + Math . max ( 1 , Math . abs ( arr [ i ] - x ) / k ) ;
}
System . out . println ( "number is " + "not present!" ) ;
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,5,9,11,14,18,19,21,26,32,38,38,43,47,49,52,55,61,65,67,69,73,74,79,84,90,91,91,92,93,94,99});
param0.add(new int[]{12,-86,-66,-50,-48,78,-92,-56,-2,66,64});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{10,87,39,87,45,33,5,37,70,69,88,78,90,3});
param0.add(new int[]{-78,-70,-68,-60,-52,-34,-24,-4,12,18,58,58,64,76,84,94});
param0.add(new int[]{0,1,0,1,1,1,0,0,1,0,0,1,0,0,1,0,0,0,1,0,0,1,1,0,0,1,1,1,0,1,0,1,0,0,1,1,0,0,1,0,1,0,1,0});
param0.add(new int[]{5,5,7,11,11,15,22,23,28,38,41,53,54,57,59,68,71,89});
param0.add(new int[]{-4,0,60,-14,-48,54,-96,-68,-40,64,-50,-74,-20,-22,48,-48,42,62,66,84,54,-52,-52,6,46,-90,-18,90});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1});
param0.add(new int[]{30,91,34,44,3,76,43,75,49,33,74,72,68,79,26,62,23,5,32,75,82,25,7,19,32,87,87,94,34,62,3,32,59});
List<Integer> param1 = new ArrayList<>();
param1.add(22);
param1.add(5);
param1.add(35);
param1.add(9);
param1.add(14);
param1.add(26);
param1.add(16);
param1.add(18);
param1.add(9);
param1.add(32);
List<Integer> param2 = new ArrayList<>();
param2.add(19);
param2.add(10);
param2.add(37);
param2.add(8);
param2.add(9);
param2.add(36);
param2.add(17);
param2.add(14);
param2.add(8);
param2.add(30);
List<Integer> param3 = new ArrayList<>();
param3.add(26);
param3.add(5);
param3.add(43);
param3.add(10);
param3.add(13);
param3.add(32);
param3.add(16);
param3.add(23);
param3.add(9);
param3.add(24);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,625 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1{
static int f_gold ( int m , int n ) {
int count [ ] [ ] = new int [ m ] [ n ] ;
for ( int i = 0 ;
i < m ;
i ++ ) count [ i ] [ 0 ] = 1 ;
for ( int j = 0 ;
j < n ;
j ++ ) count [ 0 ] [ j ] = 1 ;
for ( int i = 1 ;
i < m ;
i ++ ) {
for ( int j = 1 ;
j < n ;
j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ] + count [ i ] [ j - 1 ] ;
}
return count [ m - 1 ] [ n - 1 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(79);
param0.add(95);
param0.add(15);
param0.add(71);
param0.add(16);
param0.add(91);
param0.add(10);
param0.add(98);
param0.add(30);
param0.add(58);
List<Integer> param1 = new ArrayList<>();
param1.add(16);
param1.add(62);
param1.add(9);
param1.add(18);
param1.add(85);
param1.add(52);
param1.add(91);
param1.add(81);
param1.add(42);
param1.add(69);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,626 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS{
static int f_gold ( int x , int y ) {
if ( y == 0 ) return 0 ;
if ( y > 0 ) return ( x + f_gold ( x , y - 1 ) ) ;
if ( y < 0 ) return - f_gold ( x , - y ) ;
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(18);
param0.add(23);
param0.add(24);
param0.add(75);
param0.add(25);
param0.add(57);
param0.add(31);
param0.add(8);
param0.add(12);
param0.add(74);
List<Integer> param1 = new ArrayList<>();
param1.add(94);
param1.add(36);
param1.add(22);
param1.add(92);
param1.add(43);
param1.add(32);
param1.add(57);
param1.add(17);
param1.add(76);
param1.add(70);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,627 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_NUMBER_PAIRS_ARRAY_XOR_0.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_NUMBER_PAIRS_ARRAY_XOR_0{
static int f_gold ( int a [ ] , int n ) {
Arrays . sort ( a ) ;
int count = 1 ;
int answer = 0 ;
for ( int i = 1 ;
i < n ;
i ++ ) {
if ( a [ i ] == a [ i - 1 ] ) {
count += 1 ;
}
else {
answer = answer + ( count * ( count - 1 ) ) / 2 ;
count = 1 ;
}
}
answer = answer + ( count * ( count - 1 ) ) / 2 ;
return answer ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,7,9,12,13,13,14,16,19,23,24,25,28,29,38,38,41,42,44,51,55,56,58,59,61,62,62,63,63,64,67,68,69,71,78,78,80,82,82,82,83,85,86,92,94,98});
param0.add(new int[]{42,-20,52,34,58,62,-60,70,36,-8,-26,68,34,-92,42,94,56,84,-70,70});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{31,87,75,69,11,65,25,27});
param0.add(new int[]{-92,-88,-86,-74,-72,-70,-70,-66,-62,-60,-52,-42,-42,8,14,30,36,84,88});
param0.add(new int[]{1,0,0,0});
param0.add(new int[]{2,8,9,12,21,23,30,31,33,34,34,41,43,45,52,53,53,55,56,61,73,73,73,74,76,79,81,81,81,90,91,92,92,97,99,99});
param0.add(new int[]{84,6,-36,62,-2,-32,-82,-78,20,8,-50,-70,20,-58,94,-28,-84,-22,-44,-84,2,-68,-34,58,-64,-86,-40,-80,74,-26,12,2,-20,20,76,-14,-40,56,24,-16,-66,14,-42,0,72,82,-70});
param0.add(new int[]{0,0,0,0,0,0,0,1,1});
param0.add(new int[]{67,93,54,91,74,88,48,68,17,6,15,25});
List<Integer> param1 = new ArrayList<>();
param1.add(24);
param1.add(17);
param1.add(37);
param1.add(5);
param1.add(13);
param1.add(3);
param1.add(30);
param1.add(31);
param1.add(8);
param1.add(9);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,628 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY{
static int f_gold ( int [ ] arr , int n ) {
int result = - 1 ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = 0 ;
j < n - 1 ;
j ++ ) for ( int k = j + 1 ;
k < n ;
k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max ( result , arr [ i ] ) ;
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,78,84});
param0.add(new int[]{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{39,49,94,80,48,34,63,82,47,51,60,68,79,23,97,22,54,53,40,2,25});
param0.add(new int[]{-90,-52,-10,12,72});
param0.add(new int[]{1,0,0});
param0.add(new int[]{2,9,11,14,16,17,17,18,19,21,24,25,28,29,30,33,33,39,41,41,43,46,50,51,60,62,67,80,84,86,91,92,97});
param0.add(new int[]{4});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{52,8,31,92,20,18,34,5,15,8,73,20,40,61,80,51,95,73,38,30,21,69,52,38,68,77});
List<Integer> param1 = new ArrayList<>();
param1.add(2);
param1.add(26);
param1.add(22);
param1.add(10);
param1.add(3);
param1.add(2);
param1.add(27);
param1.add(0);
param1.add(16);
param1.add(22);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,629 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1{
public static int f_gold ( int a , int b ) {
if ( a == 0 || b == 0 ) return 1 ;
return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(97);
param0.add(52);
param0.add(95);
param0.add(35);
param0.add(40);
param0.add(18);
param0.add(92);
param0.add(73);
param0.add(10);
param0.add(82);
List<Integer> param1 = new ArrayList<>();
param1.add(91);
param1.add(49);
param1.add(34);
param1.add(40);
param1.add(85);
param1.add(97);
param1.add(15);
param1.add(98);
param1.add(62);
param1.add(22);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,630 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS{
static long f_gold ( int n ) {
long dp [ ] [ ] = new long [ 2 ] [ n + 1 ] ;
dp [ 0 ] [ 1 ] = 1 ;
dp [ 1 ] [ 1 ] = 2 ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
dp [ 0 ] [ i ] = dp [ 0 ] [ i - 1 ] + dp [ 1 ] [ i - 1 ] ;
dp [ 1 ] [ i ] = dp [ 0 ] [ i - 1 ] * 2 + dp [ 1 ] [ i - 1 ] ;
}
return dp [ 0 ] [ n ] + dp [ 1 ] [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(68);
param0.add(91);
param0.add(99);
param0.add(79);
param0.add(61);
param0.add(48);
param0.add(89);
param0.add(20);
param0.add(83);
param0.add(1);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,631 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_FIND_CIRCUMFERENCE_CIRCLE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FIND_CIRCUMFERENCE_CIRCLE{
static double f_gold ( double r ) {
double PI = 3.1415 ;
double cir = 2 * PI * r ;
return cir ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(8650.932760642281);
param0.add(-9475.213251789266);
param0.add(3895.3903681587985);
param0.add(-2977.0280936855806);
param0.add(8513.1890392562);
param0.add(-239.5023899621529);
param0.add(3460.951135898811);
param0.add(-8717.439885353786);
param0.add(6512.42862487631);
param0.add(-2607.390557447935);
for(int i = 0; i < param0.size(); ++i)
{
if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,632 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NTH_NON_FIBONACCI_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NTH_NON_FIBONACCI_NUMBER{
static int f_gold ( int n ) {
int prevPrev = 1 , prev = 2 , curr = 3 ;
while ( n > 0 ) {
prevPrev = prev ;
prev = curr ;
curr = prevPrev + prev ;
n = n - ( curr - prev - 1 ) ;
}
n = n + ( curr - prev - 1 ) ;
return prev + n ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(76);
param0.add(91);
param0.add(62);
param0.add(65);
param0.add(83);
param0.add(57);
param0.add(76);
param0.add(6);
param0.add(2);
param0.add(86);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,633 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT{
static boolean f_gold ( int n ) {
boolean arr [ ] = new boolean [ 10 ] ;
for ( int i = 0 ;
i < 10 ;
i ++ ) arr [ i ] = false ;
while ( n > 0 ) {
int digit = n % 10 ;
if ( arr [ digit ] ) return false ;
arr [ digit ] = true ;
n = n / 10 ;
}
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(474);
param0.add(9445);
param0.add(90);
param0.add(30);
param0.add(37453);
param0.add(27);
param0.add(2400);
param0.add(98);
param0.add(46);
param0.add(722);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
}
| 5,634 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/AREA_OF_A_HEXAGON.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class AREA_OF_A_HEXAGON{
public static double f_gold ( double s ) {
return ( ( 3 * Math . sqrt ( 3 ) * ( s * s ) ) / 2 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(1772.6589509256596);
param0.add(-599.737107809315);
param0.add(1074.1765931782);
param0.add(-1182.4087746714795);
param0.add(8083.035797247716);
param0.add(-6126.414356565494);
param0.add(5370.057504189614);
param0.add(-6947.020794285176);
param0.add(2110.5107873533325);
param0.add(-6458.751326919488);
for(int i = 0; i < param0.size(); ++i)
{
if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i))) )/ (Math.abs(f_filled(param0.get(i))) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,635 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT{
static int f_gold ( int dp [ ] [ ] , int a [ ] , int low , int high , int turn ) {
if ( low == high ) {
return a [ low ] * turn ;
}
if ( dp [ low ] [ high ] != 0 ) {
return dp [ low ] [ high ] ;
}
dp [ low ] [ high ] = Math . max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , high - 1 , turn + 1 ) ) ;
return dp [ low ] [ high ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{23,37,54,57,59,75,97},new int[]{9,15,34,39,80,96,99},new int[]{15,25,26,31,43,47,93},new int[]{22,31,37,44,54,62,91},new int[]{7,19,32,56,57,70,81},new int[]{16,37,49,77,81,82,85},new int[]{44,48,64,74,79,89,99}});
param0.add(new int[][]{new int[]{-24,-34,-86,-16,-34,14,76,4,18,60,-4,-24,46,-26,-74,6,50,-34,8,-30,-62,56,-78,-50,76,-98,-64,-72,-76,46,-70,4,-92,-18,10,-76,78,-26},new int[]{-34,-30,-96,-4,76,48,-10,96,-88,96,90,40,-24,68,-42,-48,-30,-32,-44,-50,-98,34,-78,-52,-88,-38,54,-64,-94,-48,-80,-2,-90,-14,-8,90,-78,-36},new int[]{30,-80,-58,48,-80,-78,40,-48,-40,-84,2,44,72,6,78,-84,-30,-70,32,86,16,68,40,-36,80,-46,66,-92,8,72,-56,58,-72,44,40,6,66,-66},new int[]{16,-72,-66,-30,66,-94,36,-34,-78,14,-74,-54,48,6,-40,-40,-24,-6,18,-20,-88,-8,82,-56,-96,-32,30,-22,70,-4,98,-40,-72,66,-54,-60,52,66},new int[]{-28,-52,90,-52,12,98,42,-52,38,-60,-28,94,86,-22,-62,68,12,92,-82,18,-2,82,-28,72,-78,-70,40,-54,-24,-68,-74,-40,-32,14,88,94,-46,-14},new int[]{-38,-30,62,-52,54,56,12,32,-78,24,38,-82,6,-64,-96,-56,-30,62,-94,-26,-64,-38,96,72,54,-56,56,82,6,-30,94,80,-68,18,84,58,-48,-34},new int[]{82,-44,14,-26,-14,-92,62,-48,-52,26,-30,-76,-26,28,54,-16,-60,16,-76,-90,20,-8,56,-86,66,-84,92,-52,90,30,38,-2,90,-50,88,44,-66,-80},new int[]{-22,68,62,-84,-76,-12,82,70,-58,86,20,-66,96,-28,6,60,-90,52,-28,8,34,90,38,24,76,-22,6,16,-46,-4,84,-6,6,30,50,26,8,-8},new int[]{34,-62,-26,18,-14,42,-50,72,16,-62,-76,32,-20,82,8,74,60,-60,-16,-50,-38,-88,68,-26,66,-14,64,42,98,40,-56,28,-96,36,-82,-74,38,-26},new int[]{-66,-58,-84,16,-42,4,-38,-6,-32,-98,20,-96,60,-38,24,-8,-74,52,98,52,-10,-24,-22,78,-20,58,-24,-98,-76,0,-94,6,28,42,20,-36,68,-68},new int[]{-20,70,-80,68,-26,-26,-22,88,86,12,-98,-80,2,-22,-2,2,-52,-50,30,12,74,34,-14,-54,70,16,-76,-56,16,-50,-14,-4,30,48,-14,84,-34,30},new int[]{68,68,-86,66,-64,60,-28,52,14,-40,-98,22,-30,28,-48,-76,66,94,-28,32,88,86,-76,-4,68,-56,76,-4,36,16,-4,8,-44,-84,74,74,96,-22},new int[]{-14,-88,-52,-72,-60,-50,32,86,14,-26,36,-84,38,80,-86,-64,14,-96,86,-52,-48,-16,-78,-66,-10,-24,70,22,90,46,-74,36,-74,2,96,6,4,34},new int[]{-34,72,-40,34,-30,18,54,-50,0,94,-62,80,4,84,10,98,56,-36,-94,88,10,-30,90,-52,14,-46,30,82,-66,8,-98,86,-90,46,-44,-92,22,58},new int[]{70,-44,-28,-78,-62,-78,-96,-6,-92,-86,-82,72,-50,26,-4,82,-42,58,28,-88,98,-98,-14,72,-24,58,72,-72,6,-78,34,-34,58,-62,78,-98,0,50},new int[]{84,48,-82,-32,-22,16,-34,-28,-76,40,26,30,70,28,-64,-90,70,-90,82,60,10,-52,0,50,-38,-32,-18,2,48,20,-96,4,62,-28,28,-12,50,-90},new int[]{64,58,-34,10,-44,-72,62,70,60,84,-12,-46,-82,-12,80,46,44,-58,-18,10,44,50,-60,-20,82,-10,18,-4,48,22,-14,12,-76,-32,8,-60,-54,-6},new int[]{22,-58,58,-24,-58,-64,62,-38,-36,44,-82,46,-78,54,96,24,84,90,-2,-98,-74,8,44,-94,84,48,-2,66,-44,52,-42,-36,34,-98,-6,54,26,18},new int[]{-28,30,-66,-14,-20,-44,-62,-20,90,-92,-38,64,44,-60,90,-60,-82,36,-46,52,-60,26,12,80,-64,92,-22,-68,-10,54,-96,44,70,10,4,-4,-94,66},new int[]{-70,54,-32,92,-26,-66,28,-98,-14,-20,40,-36,-6,-60,-36,-32,26,90,34,-34,82,48,-82,-8,-86,-74,-58,-68,-68,-16,-26,-88,-6,-76,-12,-68,-98,-94},new int[]{14,-84,90,88,80,-28,-46,4,-4,36,-56,-44,68,24,24,70,36,-4,58,-78,14,-48,-46,58,-44,-66,72,-36,84,70,-26,72,76,30,-30,92,4,-40},new int[]{-24,-28,0,-44,-48,74,76,50,-88,36,-24,62,-34,82,-20,38,-76,16,-70,92,-82,56,72,78,40,52,-52,-38,36,-44,92,46,-60,-54,58,96,74,-18},new int[]{70,-30,-62,-74,-88,-92,72,-42,34,76,-4,-94,22,-82,56,2,44,-64,-88,-20,96,0,-12,-20,-40,-56,-8,18,-8,18,98,28,50,-14,72,50,4,38},new int[]{72,-66,16,-44,94,10,60,96,24,12,92,30,2,64,4,58,74,-24,-96,-52,72,10,-2,-18,-74,-2,70,-6,-60,72,-32,34,-78,-10,-2,-30,54,42},new int[]{80,92,18,54,-42,50,-62,76,94,38,84,78,44,98,78,-54,-36,-80,62,14,24,86,52,4,78,96,20,58,-64,-42,20,-98,-90,6,30,56,-66,-34},new int[]{-86,60,-62,-32,-12,92,-54,-2,8,58,68,42,-46,-8,82,-28,-96,62,46,-12,0,88,82,-26,-42,36,46,-46,54,-58,-58,-62,32,-48,-60,86,4,56},new int[]{88,-36,4,60,24,6,72,58,44,14,-40,-64,36,-92,36,-56,-78,86,80,80,-94,64,-4,-2,86,26,-98,-56,62,-56,-18,40,12,26,50,72,-16,-58},new int[]{-88,4,-66,64,42,94,54,-38,8,-18,-8,88,46,42,64,-88,94,58,-50,26,38,92,-66,82,8,38,-92,-32,50,-44,-88,-6,34,12,66,54,-52,-86},new int[]{20,-90,2,-94,-76,-28,-76,44,-12,-56,50,4,34,-88,46,2,60,52,22,98,-84,6,-26,-90,-4,48,-66,-42,58,-22,30,-22,-82,-50,42,84,94,4},new int[]{-56,4,-4,54,64,82,88,8,50,66,-2,80,-4,12,24,-56,-52,80,66,82,-66,-92,-42,-56,66,-92,-60,-92,-52,-54,32,22,-42,-46,-66,60,10,-62},new int[]{-44,0,6,-54,-98,72,-98,-28,-4,-86,-10,-76,-64,-66,58,60,24,90,-6,-54,-22,84,-34,64,36,18,14,-32,-88,-32,84,-8,60,98,28,-6,14,-88},new int[]{-94,-92,74,96,28,34,56,74,-62,-46,-8,10,-96,-72,50,-98,-28,72,2,46,68,14,-72,-78,-76,68,52,-30,-32,90,40,50,50,20,98,2,72,44},new int[]{-6,94,16,-70,-74,-46,22,24,44,-40,52,-50,94,-66,84,-66,14,-12,48,-6,64,-12,-44,-14,2,-48,-22,52,-28,-18,8,72,-28,68,44,-28,-20,62},new int[]{12,-94,-86,-52,-92,-76,-78,10,-8,30,34,26,-80,-8,68,92,66,16,-48,70,30,-56,-80,-78,58,94,-56,-12,56,-94,-60,-70,0,-94,6,36,48,-98},new int[]{74,72,20,-84,96,-84,40,-36,-88,-14,60,-70,36,-28,-18,-82,-36,92,-86,44,-16,-66,28,-88,-18,-52,66,-26,-90,-12,-16,80,-28,82,-92,82,-76,-80},new int[]{40,-38,-48,72,-30,70,-14,14,90,42,-6,52,-94,44,-32,-8,-74,80,-18,-10,74,-80,86,-82,-2,10,-12,58,-70,-18,86,40,62,76,88,68,68,4},new int[]{86,4,16,86,-66,72,-38,-40,-52,14,-60,-88,-44,-60,-64,84,-50,-78,-44,-18,78,74,-66,-64,18,26,74,98,-18,-96,-82,4,-74,-40,-50,-46,-4,94},new int[]{-70,-64,-10,-22,-88,-48,84,78,16,64,78,-48,66,-88,44,60,-10,-48,60,-40,86,-40,32,16,28,-30,32,-74,10,-34,38,-36,-30,2,14,-92,-48,88}});
param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}});
param0.add(new int[][]{new int[]{84,65,61,9,50,58,19,98,63,92,42,82,5,55,81,77,1,92,74,40,13,59,48,51,18,42,34,78,41,82,13,6,92},new int[]{31,76,5,83,74,92,29,9,40,28,36,36,4,73,32,6,79,8,45,89,60,34,82,27,68,24,68,47,27,42,3,61,19},new int[]{56,19,38,73,69,25,38,90,20,50,27,8,1,84,9,44,54,64,8,74,19,52,40,9,75,66,58,8,40,46,55,54,75},new int[]{12,13,58,11,23,52,60,91,95,86,63,25,62,93,35,36,60,87,94,46,3,85,35,77,28,22,33,7,92,76,33,53,30},new int[]{2,4,55,27,47,76,45,70,34,36,5,2,50,24,32,85,81,34,5,35,56,72,21,39,58,90,49,75,74,49,76,22,30},new int[]{35,66,31,4,44,70,53,57,36,36,54,26,96,4,22,34,1,87,57,51,16,36,47,91,39,5,25,45,61,5,37,51,88},new int[]{45,98,42,35,56,86,16,75,9,32,14,92,40,25,24,29,5,1,75,13,3,8,71,79,96,33,22,13,30,20,41,84,59},new int[]{74,33,15,13,27,6,87,95,74,82,7,52,29,66,44,89,74,21,57,22,32,13,14,42,12,99,55,9,16,94,37,72,29},new int[]{64,47,16,76,77,39,94,53,65,65,80,12,25,14,6,77,66,12,37,63,78,17,32,16,22,7,40,25,8,27,32,55,39},new int[]{27,52,60,70,10,52,14,60,35,31,27,50,74,87,32,28,55,98,68,9,72,48,53,39,29,64,84,64,47,7,69,22,72},new int[]{89,58,93,44,1,12,98,64,65,97,36,4,84,47,49,77,81,11,30,3,69,73,30,68,73,10,96,40,71,57,3,81,46},new int[]{39,71,95,88,22,67,25,57,53,22,98,68,19,28,10,26,79,13,50,2,10,54,44,88,69,97,75,31,18,77,17,22,53},new int[]{85,17,87,79,24,25,49,13,15,16,36,98,41,78,77,89,31,91,20,85,51,29,55,94,69,16,85,91,83,9,66,96,16},new int[]{67,72,45,87,18,95,50,29,69,80,43,78,53,37,71,67,41,16,66,77,69,74,50,11,37,80,5,60,5,56,85,9,92},new int[]{92,36,57,21,48,29,77,51,52,74,68,1,18,60,70,47,98,75,81,17,12,74,1,52,50,21,30,24,17,56,29,65,18},new int[]{63,47,21,28,54,39,53,42,30,59,74,9,14,66,94,45,27,44,43,98,60,57,1,65,35,19,35,58,27,38,82,96,96},new int[]{29,64,7,9,34,80,65,45,40,56,95,7,32,36,9,70,83,73,92,73,20,19,65,27,87,2,88,64,48,71,20,57,11},new int[]{85,39,35,38,44,69,64,28,47,77,38,4,84,50,54,72,62,33,31,60,68,37,80,62,74,96,81,17,64,11,91,85,64},new int[]{45,96,40,46,4,53,91,75,80,53,8,29,93,10,11,48,15,96,80,13,47,23,81,23,41,59,28,37,6,16,46,49,89},new int[]{1,59,53,1,36,70,18,90,6,18,15,1,74,7,57,87,54,92,8,41,47,60,60,18,77,5,79,47,83,23,9,42,55},new int[]{45,22,54,33,86,86,2,52,34,74,17,40,78,5,77,8,52,13,8,24,27,97,9,8,28,91,74,98,99,8,18,12,85},new int[]{43,68,81,7,74,86,13,75,46,95,62,39,98,22,51,53,46,62,25,90,54,5,26,45,31,84,95,63,11,27,2,43,7},new int[]{20,68,7,65,20,49,16,59,39,68,20,43,2,37,39,14,90,45,94,31,68,94,88,72,80,95,1,88,19,93,21,71,27},new int[]{41,67,5,99,99,88,90,4,31,54,22,28,1,27,2,46,94,37,21,43,21,4,44,74,72,49,39,58,91,76,39,70,43},new int[]{23,23,33,86,60,69,14,39,49,89,1,32,65,67,62,63,16,70,59,20,53,50,8,93,52,75,77,20,16,13,92,16,18},new int[]{97,3,56,96,41,64,6,95,92,95,30,15,1,13,55,68,88,8,99,55,81,9,87,46,93,83,54,51,32,52,62,54,41},new int[]{81,13,63,13,67,97,51,72,40,49,87,12,24,92,46,46,45,38,95,67,51,51,88,62,71,66,32,57,23,27,21,13,52},new int[]{6,91,35,9,74,55,71,71,28,63,89,65,95,45,26,47,64,27,88,10,42,45,14,27,32,93,95,64,14,88,53,30,41},new int[]{55,51,89,7,37,36,89,43,26,78,33,2,21,94,58,40,95,46,68,89,38,75,97,58,78,12,6,57,18,3,96,61,17},new int[]{56,24,53,35,66,26,30,60,27,57,82,78,84,84,94,31,48,59,33,27,54,33,20,67,46,19,71,91,70,29,26,17,66},new int[]{85,48,88,33,78,98,69,3,81,70,80,66,84,61,48,17,8,25,8,29,82,59,62,1,58,71,74,86,8,94,15,22,79},new int[]{43,32,57,81,97,19,68,26,21,12,12,44,10,81,42,92,44,58,10,11,2,5,33,1,86,46,85,40,13,16,44,70,42},new int[]{31,28,33,90,54,30,46,18,1,95,73,79,87,16,87,39,92,26,85,75,42,56,11,78,50,6,63,77,46,77,45,35,83}});
param0.add(new int[][]{new int[]{-82,-82,-76,-74,-72,-70,-70,-68,-66,-56,-56,-50,-48,-44,-42,-38,-36,-32,-26,-20,-20,-18,-8,6,8,12,12,14,18,20,24,24,30,32,36,38,40,44,50,56,60,62,66,70,76,78,90,98,98},new int[]{-92,-80,-76,-70,-58,-58,-50,-48,-38,-36,-34,-32,-30,-30,-24,-20,-20,-18,-10,-10,-8,-6,-6,-6,-4,2,10,14,24,26,30,34,36,44,52,54,64,76,78,82,86,86,86,86,86,88,88,92,94},new int[]{-98,-94,-86,-82,-80,-76,-74,-74,-72,-70,-70,-68,-66,-62,-50,-50,-48,-42,-34,-24,-22,-22,2,8,8,10,12,22,22,26,26,26,30,38,44,54,56,58,68,68,72,78,80,80,84,88,92,94,98},new int[]{-92,-88,-84,-84,-82,-78,-78,-66,-60,-48,-48,-46,-42,-40,-40,-38,-36,-34,-30,-30,-26,-26,-22,-22,-20,-14,-12,6,28,36,38,44,46,46,48,50,52,52,56,58,60,70,80,80,80,86,92,96,98},new int[]{-98,-94,-80,-76,-72,-70,-70,-70,-68,-64,-64,-62,-60,-56,-54,-52,-50,-48,-46,-42,-40,-30,-28,-28,-24,-22,-6,-4,0,2,10,12,18,18,32,36,58,60,68,70,72,74,80,84,86,88,88,94,98},new int[]{-96,-96,-86,-84,-84,-72,-72,-70,-70,-66,-64,-60,-58,-58,-46,-38,-38,-28,-22,-18,-14,16,18,20,20,24,24,26,32,32,34,40,42,42,44,44,46,56,58,60,62,64,66,68,68,68,74,78,86},new int[]{-98,-92,-70,-58,-54,-50,-50,-50,-46,-40,-40,-36,-34,-24,-22,-22,-18,-8,-6,-6,-2,2,2,10,16,16,20,22,24,26,28,28,30,32,38,40,42,48,56,56,58,60,66,66,72,84,90,94,96},new int[]{-98,-90,-82,-80,-78,-78,-70,-66,-60,-54,-48,-48,-38,-28,-18,-16,-14,-12,-12,-10,-8,-4,-4,-4,-2,0,2,6,6,12,16,18,20,24,36,46,52,54,60,62,66,66,70,70,82,82,86,86,88},new int[]{-98,-90,-88,-86,-78,-76,-76,-70,-66,-60,-56,-56,-56,-54,-52,-46,-40,-28,-26,-22,-20,-20,-18,-14,-12,-8,0,18,18,28,34,36,36,36,38,46,50,54,56,56,60,66,70,72,74,74,80,80,82},new int[]{-98,-92,-90,-86,-84,-82,-78,-70,-66,-60,-58,-44,-42,-34,-32,-30,-24,-20,-16,-8,-4,8,8,14,14,14,14,20,20,32,38,42,52,62,62,66,68,70,72,72,78,78,78,78,84,96,98,98,98},new int[]{-90,-88,-82,-82,-82,-80,-74,-68,-68,-64,-58,-56,-54,-50,-42,-36,-32,-28,-20,-20,-20,-18,-16,-14,-6,-6,-2,6,8,10,20,24,26,32,38,44,46,48,56,56,58,60,64,68,74,80,88,92,96},new int[]{-96,-94,-88,-72,-72,-72,-70,-70,-64,-52,-46,-46,-44,-38,-34,-34,-28,-26,-20,-16,-14,-10,-8,-2,-2,2,6,8,10,30,34,34,36,44,52,58,60,70,72,72,74,76,76,80,90,92,92,94,98},new int[]{-98,-98,-96,-96,-84,-82,-80,-76,-62,-52,-46,-44,-44,-40,-38,-38,-36,-30,-22,-8,-4,-2,0,2,4,8,12,20,22,26,26,30,34,46,46,52,54,56,58,60,62,66,72,74,78,80,90,92,96},new int[]{-94,-94,-92,-92,-80,-80,-74,-64,-56,-54,-52,-50,-50,-42,-42,-42,-40,-36,-36,-32,-24,-16,-14,-4,0,2,4,10,12,16,22,24,26,28,28,30,40,46,48,56,58,62,62,62,80,88,88,96,98},new int[]{-96,-94,-94,-92,-84,-82,-80,-74,-70,-58,-54,-52,-52,-48,-44,-34,-34,-30,-28,-24,-14,-12,-4,-2,2,2,4,10,12,14,24,28,38,40,46,58,62,68,72,72,74,76,82,84,84,84,84,90,98},new int[]{-98,-90,-84,-82,-76,-70,-66,-62,-60,-60,-58,-56,-54,-54,-50,-50,-46,-40,-40,-38,-32,-24,-22,-22,-20,-12,-12,-8,6,6,8,8,8,22,26,40,42,50,50,50,50,56,64,86,92,92,94,94,96},new int[]{-92,-78,-74,-68,-66,-62,-62,-62,-60,-60,-54,-40,-36,-34,-34,-32,-22,-22,-18,-14,-12,-10,-6,-4,-2,0,12,14,18,28,32,32,38,44,48,50,52,52,60,64,66,66,82,86,90,90,94,94,96},new int[]{-96,-94,-92,-90,-88,-86,-84,-76,-74,-72,-72,-68,-66,-66,-58,-52,-50,-46,-42,-34,-32,-32,-30,-14,-10,-6,-6,-2,-2,10,14,20,30,30,34,36,36,38,38,42,44,50,52,64,68,82,90,90,98},new int[]{-98,-88,-82,-80,-80,-78,-76,-72,-70,-66,-66,-58,-56,-52,-52,-50,-50,-44,-42,-42,-32,-32,-30,-26,-22,-20,-20,-2,0,10,12,18,20,24,24,26,36,38,42,56,66,74,76,78,78,84,86,96,98},new int[]{-94,-94,-94,-80,-76,-74,-68,-56,-52,-50,-44,-42,-38,-36,-34,-28,-26,-24,-16,-2,0,4,8,14,16,20,22,32,34,38,46,46,48,50,52,54,62,64,66,66,72,76,78,78,80,82,82,84,94},new int[]{-98,-98,-90,-86,-80,-78,-76,-74,-74,-72,-72,-60,-58,-54,-50,-46,-32,-24,-22,-18,-18,-14,-12,-12,-10,-8,8,14,24,30,36,46,48,50,58,58,62,66,66,74,74,74,78,78,80,84,86,90,92},new int[]{-98,-94,-82,-80,-72,-64,-60,-58,-48,-46,-46,-40,-32,-26,-24,-16,-14,-12,-10,-8,-6,-4,-4,2,4,4,12,12,14,26,34,36,40,46,48,54,66,66,66,66,66,72,78,80,80,80,94,96,98},new int[]{-96,-92,-86,-72,-70,-70,-68,-68,-66,-64,-62,-56,-50,-44,-32,-30,-28,-24,-12,-4,-4,-4,2,10,16,18,18,22,32,32,36,36,40,42,46,46,50,50,50,50,52,54,64,68,70,72,74,90,96},new int[]{-98,-98,-98,-90,-86,-82,-64,-60,-58,-54,-48,-36,-36,-32,-30,-28,-18,-16,-14,-6,-2,4,6,6,10,12,14,18,24,32,34,46,48,50,52,58,66,68,70,80,80,82,84,84,86,92,94,96,98},new int[]{-98,-96,-88,-86,-86,-86,-86,-86,-84,-78,-78,-74,-72,-72,-70,-70,-70,-66,-64,-56,-42,-40,-38,-36,-34,-32,-30,-28,-26,-20,-8,-6,0,2,2,14,24,30,34,36,44,50,52,60,66,68,74,78,86},new int[]{-96,-86,-72,-72,-70,-70,-68,-68,-64,-58,-58,-58,-54,-54,-52,-48,-46,-40,-38,-28,-14,-10,-6,-4,0,10,10,12,16,18,18,20,20,22,34,34,40,40,46,46,58,58,62,66,68,68,72,84,92},new int[]{-96,-90,-88,-88,-82,-82,-76,-74,-70,-68,-62,-56,-52,-48,-46,-38,-22,-22,-16,-12,-8,0,4,8,14,20,22,24,28,34,36,38,44,46,48,58,66,68,68,76,84,84,86,86,88,88,90,92,94},new int[]{-96,-96,-96,-94,-90,-88,-88,-84,-76,-72,-72,-58,-54,-52,-52,-50,-40,-38,-32,-12,-12,-6,-4,-2,0,2,2,10,12,22,28,28,30,34,42,42,54,56,58,64,70,70,74,74,84,86,88,88,90},new int[]{-94,-92,-84,-82,-82,-70,-66,-64,-60,-60,-58,-58,-54,-52,-52,-42,-36,-32,-30,-28,-26,-24,-22,-20,-16,-12,0,4,6,8,14,20,30,32,46,54,60,62,62,64,66,68,68,70,70,72,72,76,88},new int[]{-90,-90,-90,-88,-88,-86,-78,-68,-62,-62,-60,-54,-54,-48,-48,-36,-36,-32,-28,-28,-22,-20,-6,-2,4,6,8,10,14,24,28,28,28,34,34,36,44,52,54,54,66,70,70,72,78,80,84,88,88},new int[]{-98,-94,-94,-90,-84,-76,-72,-70,-68,-68,-60,-54,-54,-48,-46,-46,-44,-34,-28,-28,-26,-12,-8,-4,2,6,6,8,14,32,32,38,38,40,44,46,46,50,50,52,54,58,60,62,70,78,86,92,92},new int[]{-98,-94,-94,-92,-90,-86,-82,-76,-74,-74,-66,-66,-66,-60,-60,-60,-56,-54,-50,-38,-30,-28,-18,-16,-16,-2,0,6,14,16,16,18,28,30,30,32,34,40,46,52,52,54,60,70,82,84,88,90,94},new int[]{-96,-88,-84,-80,-78,-78,-78,-68,-62,-60,-52,-44,-36,-36,-36,-34,-32,-32,-30,-26,-22,-14,-10,-6,-4,-4,0,0,0,10,12,14,14,16,24,34,38,44,52,54,54,56,58,60,64,66,66,92,98},new int[]{-98,-88,-80,-80,-74,-72,-70,-68,-64,-62,-62,-62,-58,-56,-52,-50,-50,-46,-34,-30,-30,-26,-18,-12,4,10,14,22,24,30,32,38,42,42,46,56,56,58,68,72,80,82,86,90,90,92,96,98,98},new int[]{-96,-92,-92,-90,-90,-90,-88,-82,-82,-82,-80,-68,-64,-60,-50,-34,-30,-16,-10,-10,-8,-4,-4,-2,0,18,20,24,24,24,30,30,36,38,38,40,42,42,44,48,52,52,56,76,84,88,92,94,98},new int[]{-98,-90,-82,-80,-74,-74,-72,-72,-72,-72,-64,-60,-56,-56,-56,-52,-40,-38,-24,-20,-18,-18,-12,-10,-6,10,18,22,24,24,26,26,30,34,40,40,44,50,58,60,62,64,70,76,80,80,86,88,96},new int[]{-96,-94,-86,-82,-72,-68,-68,-64,-62,-56,-54,-50,-50,-48,-44,-26,-20,-16,-10,-8,-6,6,8,10,10,10,16,20,28,28,32,40,42,44,44,46,46,48,58,62,72,76,80,84,86,88,92,96,98},new int[]{-96,-94,-94,-94,-92,-92,-90,-84,-82,-78,-76,-74,-74,-62,-58,-58,-58,-42,-42,-22,-20,-14,-14,-12,-4,-2,4,4,4,8,16,20,24,26,32,40,42,46,52,54,56,56,60,60,62,62,82,90,96},new int[]{-98,-96,-96,-76,-70,-66,-54,-54,-52,-50,-46,-40,-36,-34,-32,-30,-28,-28,-26,-26,-22,-20,-18,-6,6,10,20,22,28,30,30,32,32,34,38,42,46,54,58,70,76,76,84,90,94,94,98,98,98},new int[]{-90,-86,-82,-72,-70,-70,-66,-62,-60,-58,-54,-54,-40,-36,-32,-30,-28,-26,-26,-24,-16,-14,-10,-8,-8,-8,-8,4,6,8,14,16,18,18,22,26,30,58,66,82,84,92,92,94,96,96,96,96,98},new int[]{-92,-86,-80,-74,-68,-66,-64,-64,-52,-44,-36,-34,-32,-30,-26,-22,-20,-18,-14,-12,-8,2,10,10,12,16,24,32,32,44,46,48,52,52,54,66,68,70,72,74,82,84,88,90,94,94,96,96,96},new int[]{-92,-90,-80,-78,-78,-78,-74,-66,-50,-50,-46,-46,-44,-44,-40,-38,-34,-32,-32,-30,-18,-18,-16,-14,-12,4,10,10,10,18,20,20,22,24,24,26,26,46,46,48,48,52,58,62,64,72,80,96,96},new int[]{-98,-96,-94,-92,-88,-86,-84,-82,-76,-76,-60,-58,-58,-58,-56,-50,-48,-38,-34,-30,-20,-16,-16,-10,-4,-2,10,12,18,26,32,34,48,48,52,64,64,68,70,74,76,78,80,90,92,92,92,94,96},new int[]{-96,-88,-88,-82,-76,-70,-62,-58,-56,-48,-48,-38,-36,-30,-18,-18,-16,-16,-14,-12,-6,4,8,10,10,12,14,24,28,28,34,38,44,50,58,60,62,66,66,72,74,76,76,78,78,84,86,88,96},new int[]{-98,-94,-94,-94,-90,-86,-78,-74,-68,-66,-62,-58,-56,-54,-52,-52,-48,-44,-44,-44,-30,-26,-26,-12,-4,2,4,4,6,6,12,12,14,16,16,22,22,30,30,34,36,42,50,50,64,70,80,88,98},new int[]{-98,-96,-96,-94,-88,-84,-58,-56,-52,-48,-44,-30,-26,-26,-20,-18,-16,-8,-8,-8,-6,-6,-4,-4,-2,0,6,12,12,14,24,34,42,46,48,56,60,62,62,72,72,80,84,88,88,90,90,94,96},new int[]{-98,-90,-82,-78,-70,-68,-64,-62,-56,-52,-50,-44,-44,-42,-36,-26,-24,-22,-12,-10,-6,-4,0,2,6,10,18,32,32,36,38,42,48,52,54,56,62,64,66,66,66,66,70,72,74,74,78,86,92},new int[]{-96,-90,-88,-78,-74,-72,-70,-68,-66,-60,-58,-56,-56,-50,-50,-44,-36,-26,-24,-18,-16,-16,-12,-6,2,6,8,10,10,18,18,22,24,26,42,46,64,64,66,72,74,74,76,88,94,94,96,98,98},new int[]{-94,-82,-78,-78,-76,-64,-64,-58,-58,-56,-56,-52,-44,-42,-38,-36,-22,-16,-14,-6,-2,4,4,8,8,12,14,14,14,16,16,22,30,34,38,42,44,58,62,66,66,68,76,78,80,80,84,90,98}});
param0.add(new int[][]{new int[]{0,0,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0,0,0,1,0,0,0,0},new int[]{0,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,1,0,0,0,1,1,1,0,0,1,0,0,0},new int[]{0,0,1,0,0,1,1,1,0,0,1,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,1,0,1,0,0,1,0,0,1,0,1,1,0},new int[]{0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,1,0,1,1,1,1,0,1,0,1,0,1,0,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,0},new int[]{0,1,0,1,1,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,0,1,1,0,1,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,1,0,1,0,0},new int[]{0,0,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,0,1,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,0,0,0},new int[]{1,1,0,1,0,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,1,0,1,1,0,0},new int[]{0,1,1,1,1,0,1,1,1,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,1,0,0,0,0,1,0,1,1,1},new int[]{1,1,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,1,1,0,0,0,1,1,1,0,0,1,1,0,0,0,1},new int[]{0,0,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,0,0,1},new int[]{0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,0,1,1,1,1,0,0,0},new int[]{1,1,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,1,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0},new int[]{1,0,1,0,0,1,0,0,0,1,1,1,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1,0,1,0},new int[]{0,0,1,0,0,1,1,0,0,1,1,0,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,1,0,0,0,1,1,1,1,0,0,1,1,0,1,0,1,0,1},new int[]{1,1,0,1,1,0,1,0,0,0,0,0,1,0,1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,1,0,0,1,1},new int[]{0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,1,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,1,1,1,0,1,1,1,1,1,1,0,0,1,1},new int[]{1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,1,1,0,1,1,1,0,1,1,0,1,0},new int[]{1,1,1,0,0,0,1,1,0,0,1,0,1,0,0,0,0,0,0,1,0,1,0,0,0,1,1,1,1,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,0,1},new int[]{0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,1,0,0},new int[]{1,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,1,0,1,1,1,1,1,1,1,0,1,0,1,0,1,1,1,0,0,1,1,1,1,1,0},new int[]{1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,0,1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0,0,0,1,0,0,1,0,1,0,0,0,1,0},new int[]{1,1,0,0,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,0},new int[]{1,0,1,1,0,1,1,0,0,1,1,0,1,1,0,1,0,1,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1},new int[]{1,0,1,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,0,1,0,0,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,1,0,0,1,1,1,0},new int[]{1,1,1,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,0,0,0,1,1,1,0,1,0,0,1,0,0,1,0,1,1,0,0,0,0,0,0,1,0,1,1,0},new int[]{0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,1,0,1,0,0,1,1,1,0,0,0,0,0,0,1,1,1,1,0,1,0},new int[]{0,1,0,1,1,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,1,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,0,0,1,1,0,1,1,0},new int[]{1,1,0,0,1,0,0,1,1,0,1,1,0,1,1,0,0,0,1,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,0,0,1,1,1,1,0,1,1,0},new int[]{1,1,1,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,1},new int[]{1,1,1,1,0,0,0,0,1,0,1,1,1,1,0,0,0,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,0},new int[]{1,1,1,1,1,0,0,1,1,0,1,1,0,1,1,1,0,0,1,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,0,0,0,0,1,1,0,1,1,1},new int[]{0,1,1,0,1,0,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,0,1,1,1,1,1,0,0,0,1,0,0,0,0,1,1,0,1,0,1,0,0,0,0,0},new int[]{0,1,0,0,0,1,0,0,1,0,1,1,0,0,0,0,0,1,1,0,0,0,0,0,1,1,1,0,0,0,0,0,0,1,1,0,0,1,1,1,0,0,1,0,0,1},new int[]{1,1,0,0,0,0,0,0,1,0,1,1,0,0,0,0,1,1,1,1,0,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,1,1,0,0,1,0,0,0,1,1},new int[]{0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,1,1,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,1,1,0,1,0,0,1,1,0,0,1,1,0},new int[]{0,0,0,0,0,1,0,1,1,1,1,0,1,1,0,0,0,0,0,0,1,1,0,1,1,1,0,0,1,1,0,0,1,1,1,0,1,1,0,0,1,1,0,0,1,0},new int[]{0,1,1,1,0,0,0,0,0,0,1,1,0,0,0,1,1,0,0,1,1,0,0,1,0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,1,1,0,1,1,1,1},new int[]{1,0,1,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,1,1,0,0,0,1,1,1,1,0,1,1,1,1,0,0,1,1,0,1,1,1,0,0,0,1,0,1},new int[]{1,1,1,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,1,0,0,1,0,0,1,1,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,1,1,0,1},new int[]{0,0,1,1,1,1,0,1,1,0,1,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1,1,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,0},new int[]{1,1,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,1,0,0,0,0,1,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0},new int[]{0,0,1,0,1,0,1,1,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,1,1,1,0,1,1,0,1,1},new int[]{0,0,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0,0,1,0,1,1,0,1},new int[]{0,1,1,1,0,0,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0,0,1},new int[]{0,0,0,0,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1},new int[]{0,0,1,1,1,1,0,1,0,1,1,0,1,1,0,0,0,1,1,1,0,1,0,0,1,1,1,1,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0,0,1}});
param0.add(new int[][]{new int[]{13,16,26,38,44,71,73},new int[]{16,28,39,47,48,59,61},new int[]{15,30,50,59,60,89,90},new int[]{24,61,63,71,72,76,83},new int[]{14,36,39,42,64,76,77},new int[]{4,6,11,24,34,36,58},new int[]{22,35,63,70,81,91,98}});
param0.add(new int[][]{new int[]{-48,-22,-52,-86,-22},new int[]{-54,-6,-16,-84,-34},new int[]{-46,-16,-80,-82,-38},new int[]{-44,98,-54,-32,-88},new int[]{42,52,38,-20,-36}});
param0.add(new int[][]{new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,1,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,1,1,1,1,1,1},new int[]{0,0,0,0,0,1,1,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,1,1,1,1,1},new int[]{0,0,0,0,0,0,0,0,1,1,1,1}});
param0.add(new int[][]{new int[]{62,15,2,68,63,42,57,46,37,30,1,51,47,75,50,24,48,56,93,9,50,79,58,74,81,64,63,60,49,24,46,55,89,10,49,46,17,86,24,51,69,21,16,97,66,14},new int[]{95,91,93,6,64,52,1,29,77,42,16,76,40,30,32,7,36,72,1,94,12,25,11,75,52,95,64,4,54,78,40,67,81,92,5,42,65,94,59,12,35,75,82,83,72,47},new int[]{69,96,79,34,12,8,27,58,49,56,43,17,26,87,1,19,99,48,80,25,56,40,42,63,92,27,76,55,15,2,30,81,79,4,15,52,21,94,80,27,93,33,44,20,45,34},new int[]{18,47,49,73,19,87,86,72,52,21,36,27,96,2,87,35,22,20,97,92,69,13,15,95,80,58,84,66,56,12,57,36,90,25,14,43,43,80,2,53,42,65,52,42,5,48},new int[]{85,40,51,5,9,71,80,70,2,18,87,36,78,90,57,60,27,92,15,64,47,22,99,53,87,28,97,94,28,83,64,10,10,34,30,90,17,87,31,7,29,68,29,69,47,35},new int[]{15,32,84,9,45,6,37,97,12,69,91,45,39,58,49,85,76,2,48,71,81,88,16,71,49,32,68,5,23,65,93,47,88,59,43,43,36,59,52,77,1,25,36,86,26,42},new int[]{39,15,66,15,13,29,80,10,75,3,21,65,41,19,76,82,64,55,63,46,24,94,40,75,24,20,2,86,90,24,53,70,65,90,45,70,96,98,68,60,12,31,27,57,63,17},new int[]{79,58,4,37,50,72,71,69,45,86,47,25,98,59,63,16,13,97,66,2,8,13,4,54,96,1,80,3,35,15,62,20,74,58,80,65,85,37,74,6,93,29,10,19,80,61},new int[]{53,59,23,20,92,20,65,17,71,81,41,50,37,86,75,62,21,49,59,34,56,94,41,71,70,94,44,6,25,19,37,3,13,39,86,98,19,30,52,26,35,25,65,74,9,69},new int[]{15,92,20,89,35,8,50,32,17,2,21,64,76,26,9,49,25,63,17,51,58,1,97,3,28,80,11,89,23,86,9,27,5,52,31,62,77,63,86,41,59,19,28,78,6,63},new int[]{76,97,67,74,17,13,95,60,16,63,87,95,84,66,82,69,80,44,54,32,29,37,47,62,78,79,45,10,63,11,20,53,95,72,40,75,89,81,1,37,56,15,85,93,84,9},new int[]{72,60,72,79,28,8,48,76,89,84,89,46,42,83,65,90,71,93,64,50,55,88,66,29,6,6,47,99,61,98,24,57,4,83,56,56,46,21,46,33,78,85,15,28,80,33},new int[]{49,8,68,50,35,16,35,44,22,80,94,48,98,13,43,79,28,68,15,99,5,27,62,63,85,66,55,31,44,48,73,58,71,50,94,22,19,79,76,13,97,27,91,19,47,12},new int[]{52,75,69,55,13,16,39,7,82,28,77,88,84,98,47,21,21,43,40,92,82,92,33,94,3,21,42,47,89,40,59,78,13,97,62,96,74,69,95,73,90,11,67,10,48,47},new int[]{37,21,84,6,27,11,42,18,62,58,81,7,9,71,77,38,69,12,16,61,2,44,81,71,2,99,22,38,30,51,39,11,62,73,95,74,13,87,33,17,23,8,90,45,36,73},new int[]{80,14,37,80,75,12,38,69,25,91,72,14,3,36,97,93,61,20,22,9,56,89,37,99,9,50,59,95,67,25,48,36,91,66,48,61,71,13,50,54,51,29,58,48,14,19},new int[]{64,64,97,27,3,7,54,36,57,24,82,5,83,49,78,87,87,93,70,62,68,26,40,84,82,76,98,27,41,71,23,56,3,46,85,39,62,92,73,74,16,79,40,24,91,63},new int[]{88,29,39,88,15,76,44,40,66,67,26,9,61,5,24,71,8,56,35,89,71,12,72,54,26,84,57,58,46,73,92,24,20,59,70,86,84,15,98,51,29,15,74,7,19,64},new int[]{14,46,80,84,53,57,50,32,23,48,35,83,89,10,67,51,96,63,84,18,6,41,48,79,66,17,17,45,51,7,65,79,29,34,92,17,45,36,2,36,66,30,65,4,55,61},new int[]{23,37,69,52,89,17,78,39,81,83,94,61,33,11,46,34,27,35,55,1,22,99,91,24,56,28,70,88,23,48,77,57,57,72,69,79,95,58,37,68,17,66,11,82,97,20},new int[]{24,46,12,76,76,15,6,97,22,95,83,52,69,59,17,24,54,85,60,41,2,84,71,76,71,27,36,54,79,32,66,65,27,15,39,30,38,58,6,66,73,31,73,74,64,51},new int[]{71,37,75,62,93,88,55,77,22,54,67,34,50,89,66,77,17,54,1,53,83,3,74,37,41,38,48,39,25,46,72,61,70,77,7,58,5,77,60,64,95,22,81,95,53,14},new int[]{52,25,79,20,16,26,40,49,23,82,56,61,40,89,99,58,90,17,22,20,1,14,5,99,34,63,71,7,51,56,8,3,8,39,45,90,97,24,45,77,51,57,41,59,47,15},new int[]{98,5,15,87,54,20,2,88,73,98,90,4,79,94,74,26,3,91,65,28,25,93,61,63,3,97,15,40,1,79,88,71,15,55,94,93,38,56,10,41,68,28,85,74,71,19},new int[]{10,27,56,25,36,22,54,74,28,72,53,19,66,49,49,56,94,55,24,82,54,66,1,7,37,45,49,85,34,51,91,74,64,28,87,81,39,42,93,60,43,10,85,12,7,62},new int[]{73,51,16,10,70,67,50,75,37,60,45,31,57,94,44,51,23,74,16,79,78,57,63,90,28,24,63,5,61,2,20,86,57,46,42,5,34,72,35,68,37,6,19,15,48,93},new int[]{70,43,61,32,77,46,11,98,66,70,44,73,51,53,55,69,54,3,65,25,75,37,47,44,78,78,3,98,73,71,34,54,80,69,20,35,1,27,42,18,93,96,60,9,80,57},new int[]{2,31,55,74,66,86,59,31,40,18,55,86,79,74,45,19,83,26,24,28,15,34,34,28,66,68,94,87,19,66,67,48,38,39,67,75,23,28,23,10,65,75,50,23,85,55},new int[]{91,22,56,89,33,23,8,81,56,97,2,88,94,38,61,8,56,85,68,31,99,30,75,61,23,68,10,95,53,57,55,42,48,97,23,40,61,99,30,54,18,66,83,58,6,35},new int[]{46,84,95,99,63,16,14,13,55,83,6,77,77,40,1,85,53,14,66,46,99,67,42,55,11,27,40,38,81,54,80,3,52,77,5,22,75,50,95,54,88,27,1,85,6,60},new int[]{38,32,53,70,13,71,48,20,37,38,25,23,58,93,34,66,47,71,50,64,11,60,45,49,57,25,42,75,78,97,58,31,83,60,53,72,45,71,22,43,79,1,81,8,62,39},new int[]{53,8,61,2,80,52,70,9,47,23,87,99,41,89,23,54,5,50,50,96,51,30,41,93,90,77,30,4,63,52,89,30,72,96,75,55,74,12,67,62,3,38,53,62,80,80},new int[]{88,65,51,42,27,28,91,20,8,18,46,12,36,12,41,29,31,18,27,84,84,83,96,70,2,3,40,53,1,39,16,29,8,23,38,71,89,87,92,83,83,57,3,64,62,51},new int[]{76,38,28,18,53,19,90,48,7,74,89,6,10,5,29,51,59,32,33,66,4,90,39,9,90,77,35,48,29,58,35,14,72,89,17,75,45,8,54,58,40,65,6,90,26,47},new int[]{93,31,76,38,69,20,19,44,28,53,95,64,50,11,27,64,77,18,24,1,46,8,77,72,48,14,87,28,54,9,63,68,67,59,37,20,17,74,6,30,49,65,50,80,75,77},new int[]{76,40,73,71,21,7,8,38,60,4,40,32,18,36,82,31,29,74,73,19,51,98,46,74,98,53,24,66,7,14,71,95,4,86,60,14,80,28,34,18,49,68,76,55,72,35},new int[]{66,6,48,50,62,34,10,41,14,93,60,58,8,51,31,89,42,67,29,75,90,98,58,4,87,82,29,27,38,13,70,4,40,30,81,29,57,61,90,10,82,36,9,32,45,87},new int[]{76,45,58,23,90,81,1,48,12,36,90,35,36,83,19,6,17,6,90,88,26,12,53,49,23,13,52,17,30,92,22,83,64,1,82,71,67,30,54,67,64,93,93,8,45,71},new int[]{65,37,45,41,91,59,22,56,29,22,12,44,56,7,73,87,77,98,9,38,37,62,86,66,53,64,73,86,8,20,8,3,46,51,11,53,50,57,26,93,80,41,34,70,82,82},new int[]{77,1,52,73,66,59,96,50,60,63,38,44,26,95,62,99,37,34,8,44,31,10,82,75,82,92,54,61,3,52,55,7,48,22,43,71,50,96,27,56,44,66,48,25,27,22},new int[]{5,86,67,70,46,7,43,52,7,19,85,27,99,55,1,48,16,41,2,47,59,51,21,19,80,80,8,41,51,75,74,49,54,48,73,15,69,24,96,19,97,23,28,90,60,50},new int[]{76,65,97,12,56,95,81,27,85,46,42,56,77,90,55,6,91,41,81,93,62,83,56,21,31,28,10,28,47,92,29,85,9,30,94,62,88,86,52,16,30,50,47,1,51,11},new int[]{83,14,96,9,59,84,27,94,5,20,93,58,99,71,9,5,78,38,97,97,42,88,50,51,28,64,62,32,22,50,18,57,12,61,86,72,35,53,64,42,90,32,46,84,82,65},new int[]{28,99,16,15,46,15,57,32,82,90,2,29,28,8,41,33,74,61,87,64,7,51,79,30,70,33,88,9,24,7,61,22,5,12,37,19,91,38,55,23,54,62,82,8,44,73},new int[]{30,77,76,3,41,88,95,36,78,76,33,86,54,38,92,36,65,99,67,8,72,33,71,88,8,63,43,89,57,6,20,74,52,50,61,66,52,3,3,60,28,6,90,51,60,15},new int[]{32,86,94,46,87,40,20,75,67,86,63,63,48,42,81,69,30,11,45,18,58,68,58,79,95,51,81,1,88,58,49,75,89,60,52,24,80,70,47,17,45,94,69,17,11,97}});
List<int [ ]> param1 = new ArrayList<>();
param1.add(new int[]{31,50,50,68,69,80,87});
param1.add(new int[]{-74,-50,-90,-52,96,78,-16,14,-14,66,-50,74,-34,-88,84,80,34,18,-38,62,56,-48,-22,94,94,94,92,-46,-32,10,-48,46,20,80,32,30,88,60});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{23,36,42,49,50,88,97,51,1,27,4,72,11,61,24,49,75,29,96,16,11,65,13,22,13,23,84,23,20,63,35,76,22});
param1.add(new int[]{-96,-90,-90,-86,-86,-86,-84,-76,-76,-74,-72,-70,-52,-50,-34,-32,-26,-20,-16,-14,-10,-8,-8,-6,4,12,14,16,18,24,26,32,34,38,42,42,48,48,48,48,64,66,70,76,76,82,86,86,96});
param1.add(new int[]{0,1,1,1,1,0,1,1,1,0,0,0,0,1,0,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,1,0,1,1,1,1,0,1,1,0,1,1,0,0,0});
param1.add(new int[]{3,9,32,55,78,85,90});
param1.add(new int[]{48,-68,0,-54,-80});
param1.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1});
param1.add(new int[]{19,39,31,50,61,70,43,64,45,82,49,80,21,37,96,30,42,82,96,30,22,26,42,88,57,12,59,58,83,64,66,2,37,60,5,76,20,81,10,57,70,74,65,72,15,84});
List<Integer> param2 = new ArrayList<>();
param2.add(6);
param2.add(25);
param2.add(28);
param2.add(25);
param2.add(37);
param2.add(43);
param2.add(5);
param2.add(4);
param2.add(7);
param2.add(34);
List<Integer> param3 = new ArrayList<>();
param3.add(5);
param3.add(20);
param3.add(28);
param3.add(30);
param3.add(38);
param3.add(32);
param3.add(3);
param3.add(4);
param3.add(10);
param3.add(25);
List<Integer> param4 = new ArrayList<>();
param4.add(4);
param4.add(25);
param4.add(32);
param4.add(19);
param4.add(26);
param4.add(35);
param4.add(3);
param4.add(3);
param4.add(9);
param4.add(32);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,636 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/STEINS_ALGORITHM_FOR_FINDING_GCD.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class STEINS_ALGORITHM_FOR_FINDING_GCD{
static int f_gold ( int a , int b ) {
if ( a == 0 ) return b ;
if ( b == 0 ) return a ;
int k ;
for ( k = 0 ;
( ( a | b ) & 1 ) == 0 ;
++ k ) {
a >>= 1 ;
b >>= 1 ;
}
while ( ( a & 1 ) == 0 ) a >>= 1 ;
do {
while ( ( b & 1 ) == 0 ) b >>= 1 ;
if ( a > b ) {
int temp = a ;
a = b ;
b = temp ;
}
b = ( b - a ) ;
}
while ( b != 0 ) ;
return a << k ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(37);
param0.add(58);
param0.add(89);
param0.add(75);
param0.add(59);
param0.add(84);
param0.add(47);
param0.add(37);
param0.add(83);
param0.add(28);
List<Integer> param1 = new ArrayList<>();
param1.add(93);
param1.add(13);
param1.add(27);
param1.add(14);
param1.add(47);
param1.add(39);
param1.add(76);
param1.add(75);
param1.add(62);
param1.add(58);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,637 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT{
static boolean f_gold ( int n ) {
return 1162261467 % n == 0 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(3);
param0.add(27);
param0.add(9);
param0.add(-9);
param0.add(11);
param0.add(57);
param0.add(21);
param0.add(60);
param0.add(44);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,638 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L{
static int f_gold ( int [ ] arr , int n ) {
if ( n < 4 ) {
System . out . println ( "The array should have" + " atleast 4 elements" ) ;
}
int table1 [ ] = new int [ n + 1 ] ;
int table2 [ ] = new int [ n ] ;
int table3 [ ] = new int [ n - 1 ] ;
int table4 [ ] = new int [ n - 2 ] ;
Arrays . fill ( table1 , Integer . MIN_VALUE ) ;
Arrays . fill ( table2 , Integer . MIN_VALUE ) ;
Arrays . fill ( table3 , Integer . MIN_VALUE ) ;
Arrays . fill ( table4 , Integer . MIN_VALUE ) ;
for ( int i = n - 1 ;
i >= 0 ;
i -- ) {
table1 [ i ] = Math . max ( table1 [ i + 1 ] , arr [ i ] ) ;
}
for ( int i = n - 2 ;
i >= 0 ;
i -- ) {
table2 [ i ] = Math . max ( table2 [ i + 1 ] , table1 [ i + 1 ] - arr [ i ] ) ;
}
for ( int i = n - 3 ;
i >= 0 ;
i -- ) table3 [ i ] = Math . max ( table3 [ i + 1 ] , table2 [ i + 1 ] + arr [ i ] ) ;
for ( int i = n - 4 ;
i >= 0 ;
i -- ) table4 [ i ] = Math . max ( table4 [ i + 1 ] , table3 [ i + 1 ] - arr [ i ] ) ;
return table4 [ 0 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{18,27,36,51,67,70,71,72,79,85,86,89,93,94,97});
param0.add(new int[]{4,70,88,90,-34,-4,-36,-38,16,-46,-60,-50,-72,-68,-42,-96,46,32,-80,46,-4,-86,-72,16,40,-74,78,-64,-38});
param0.add(new int[]{0,0,0,0,0,0,1,1,1});
param0.add(new int[]{67,75,6,31,18,44,55,99,83,8});
param0.add(new int[]{-94,-94,-84,-82,-74,-70,-70,-70,-56,-56,-52,-50,-48,-46,-44,-38,-36,-34,-34,-28,-26,-16,-16,0,0,2,2,4,6,10,24,30,32,32,34,36,48,62,64,78,78,84,90,92});
param0.add(new int[]{0,1,0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,1,1,0,1,1});
param0.add(new int[]{1,6,15,20,21,23,24,25,25,40,44,46,59,61,63,68,69,69,72,76,76,79,79,87,88,89,94,94,99});
param0.add(new int[]{8,70,-66,0,-82,-72,64,-88,40,10,24,-20,88});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{15,89,48,67,30,95,8,22,41,22,12,18,23,15,33,41,50,77,71,53,11,9,53,42,61,56,25,57,28,48,14,86,95,74,54,70,12,36,1,18,42,35,94,18,54,35,1,95,53});
List<Integer> param1 = new ArrayList<>();
param1.add(9);
param1.add(24);
param1.add(8);
param1.add(9);
param1.add(36);
param1.add(14);
param1.add(16);
param1.add(7);
param1.add(28);
param1.add(37);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,639 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS{
static int f_gold ( int arr [ ] , int n ) {
Arrays . sort ( arr ) ;
int count = 1 ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) {
if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++ ;
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,7,7,11,14,14,14,16,17,17,21,22,24,27,27,27,31,33,35,36,36,37,38,43,45,49,52,54,57,59,59,60,67,73,74,74,74,75,75,79,83,87,90,93,97});
param0.add(new int[]{-28,72,60,62,40,64,50,-36,-24,40,-6,78,-80,-82,2,-30,70,94,-2,-30,92,12,-46,32,-96,-2,36,-40,-42,66,98});
param0.add(new int[]{1,1});
param0.add(new int[]{96,89,24,28,70,78,78,35,98,65,18,81,35,91,33,88,69,52,66,17,73,79,30,33,78,60,42,8,36,6,47,87,8,98,9,77,78,24,86,91,13,79,50,85,3,7,61,94,86});
param0.add(new int[]{-92,-92,-90,-84,-78,-66,-60,-60,-46,-42,-38,-32,-24,-20,-18,-16,-14,-10,0,4,6,12,24,32,34,44,48,50,50,64,66,68,80,84,86,86,88,90,90,90,92,94,96,98,98});
param0.add(new int[]{0,1,1,0,1,0,0,1,0,0,1,0,0,1,1,1,0,1,0,1,1,1,0,1,0,1,0,0,0,1,0,1,1,0,0,1,1,1,1,1,0,1,0,0,0});
param0.add(new int[]{8,12,13,14,16,20,20,21,23,23,24,27,29,29,29,29,35,35,38,39,40,46,50,52,60,62,62,65,65,65,70,71,72,73,75,76,80,81,82,83,85,91,95,97,98,98});
param0.add(new int[]{-84,92,70,-46,26,-94,-82,-26,-90,-62,52,62,-58,44,-14,-6,58,2,10,76,-34,42,-26,80,26,32,-82,38,2,72,68,44,24,84,-32,54,-96,-8,36,80,-82,32,98,-68});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{64,10,6,3,67,95,72,96,72,30,99,21,46,23,48,38,48,50,53,91,59,58,27,95,63,20,27,22,58,3,11,75,77,64,46,1,67,79,6,46,57,79,49,83,21,36,44});
List<Integer> param1 = new ArrayList<>();
param1.add(42);
param1.add(24);
param1.add(1);
param1.add(26);
param1.add(42);
param1.add(27);
param1.add(29);
param1.add(25);
param1.add(21);
param1.add(46);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,640 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/EQUILIBRIUM_INDEX_OF_AN_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EQUILIBRIUM_INDEX_OF_AN_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int i , j ;
int leftsum , rightsum ;
for ( i = 0 ;
i < n ;
++ i ) {
leftsum = 0 ;
for ( j = 0 ;
j < i ;
j ++ ) leftsum += arr [ j ] ;
rightsum = 0 ;
for ( j = i + 1 ;
j < n ;
j ++ ) rightsum += arr [ j ] ;
if ( leftsum == rightsum ) return i ;
}
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,6,7,8,15,15,19,23,27,28,29,31,37,40,41,42,50,51,57,58,63,63,64,70,71,72,78,83,85,90,90});
param0.add(new int[]{-68,-92});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{80,74,45,81,62,88,90,54});
param0.add(new int[]{-92,-84,-84,-66,-64,-50,-50,-48,-46,-44,-36,-36,-30,-24,-22,-16,-6,-2,24,48,54,62,66,74,74,80,82,88,98,98});
param0.add(new int[]{0,0,1,1,0,0,1,0,1,0,1,1,0,1,0,0,1,1,0,0,1,1,1,1,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,1,0,0,1,1,1});
param0.add(new int[]{2,6,11,12,14,36,45,49,52,52,58,63,70,73,74,80,82,89,89});
param0.add(new int[]{16,-58,-14,-58,-36,-70,36,-8,-14,-78,-26,42,16,18,0,-44,32,50,-78,58,78,16,-34,-54,50,0,46,-12,52,-74,78,-82,-26,-72,-86,-14,86,40,-8});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{58,82,79,77,84,79,39,98,53,84,19,9,93,30,6,82,8,43,17,44,62,21,34,86,98,44,81,14,82,54,44,53,36,33,2,68,19,37});
List<Integer> param1 = new ArrayList<>();
param1.add(25);
param1.add(1);
param1.add(26);
param1.add(4);
param1.add(27);
param1.add(43);
param1.add(17);
param1.add(26);
param1.add(33);
param1.add(22);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,641 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_REPEATING_SUBSEQUENCE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_REPEATING_SUBSEQUENCE{
static int f_gold ( String str ) {
int n = str . length ( ) ;
int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
for ( int j = 1 ;
j <= n ;
j ++ ) {
if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ;
else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ;
}
}
return dp [ n ] [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("JxZFz");
param0.add("7648992235770");
param0.add("11100000");
param0.add("cRN SgYjPsctJ");
param0.add("434");
param0.add("1");
param0.add("JRfZIAsbrPBZ");
param0.add("03779368305592");
param0.add("1111000");
param0.add("BkULuIi");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,642 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM{
static int f_gold ( int a , int b ) {
int res = 0 ;
while ( b > 0 ) {
if ( ( b & 1 ) != 0 ) res = res + a ;
a = a << 1 ;
b = b >> 1 ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(4);
param0.add(36);
param0.add(65);
param0.add(55);
param0.add(35);
param0.add(69);
param0.add(84);
param0.add(5);
param0.add(15);
param0.add(67);
List<Integer> param1 = new ArrayList<>();
param1.add(33);
param1.add(67);
param1.add(52);
param1.add(37);
param1.add(76);
param1.add(98);
param1.add(62);
param1.add(80);
param1.add(36);
param1.add(84);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,643 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1{
static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > hmap = new HashMap < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( hmap . containsKey ( arr [ i ] ) ) {
int val = hmap . get ( arr [ i ] ) ;
hmap . put ( arr [ i ] , val + 1 ) ;
}
else hmap . put ( arr [ i ] , 1 ) ;
}
for ( Integer a : hmap . keySet ( ) ) {
if ( hmap . get ( a ) % 2 != 0 ) return a ;
}
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{49,90});
param0.add(new int[]{-96,94,92,-24,48,54,-30,-86,28,-18,12,-64,-36,68,68,-78,-6,30,-84,20,52,-36,40,-62,90,-48,86,98,12,44,98,-66,52,34,36,76,-50,-20,-20,-20});
param0.add(new int[]{0,1});
param0.add(new int[]{79,55,18,99,38,93,19,49,21,74,16,76,82,52,86,17,42,9,6,63,1,40,75,59,41,81});
param0.add(new int[]{-90,-84,-82,-68,-66,-66,-60,-60,-48,-44,-36,-34,-30,-16,-14,-12,-10,-6,2,10,10,14,22,26,30,34,46,50,52,62,64,64,66,72,74,78,78,82,84,88,92});
param0.add(new int[]{1,1,0,0,1,0,1,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,0,1,0,1});
param0.add(new int[]{2,4,5,7,7,18,18,23,23,25,25,31,41,43,45,46,52,52,55,64,69,69,80,81,84,90,91,93,94,94,94,94,96,98,99});
param0.add(new int[]{86,66,-8,2,-18,-22,38,4,-38,-54,78,64,78,20,-32,84,-70,66,-46,12,-12,8,44,14,20});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{11,4,98,38,20,41,1,8});
List<Integer> param1 = new ArrayList<>();
param1.add(1);
param1.add(39);
param1.add(1);
param1.add(23);
param1.add(23);
param1.add(18);
param1.add(20);
param1.add(20);
param1.add(21);
param1.add(7);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,644 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{
static int f_gold ( int n ) {
n -- ;
n |= n >> 1 ;
n |= n >> 2 ;
n |= n >> 4 ;
n |= n >> 8 ;
n |= n >> 16 ;
n ++ ;
return n ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(60);
param0.add(20);
param0.add(33);
param0.add(34);
param0.add(68);
param0.add(79);
param0.add(20);
param0.add(41);
param0.add(36);
param0.add(17);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,645 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D{
static int f_gold ( int [ ] S , int n ) {
boolean found = false ;
Arrays . sort ( S ) ;
for ( int i = n - 1 ;
i >= 0 ;
i -- ) {
for ( int j = 0 ;
j < n ;
j ++ ) {
if ( i == j ) continue ;
for ( int k = j + 1 ;
k < n ;
k ++ ) {
if ( i == k ) continue ;
for ( int l = k + 1 ;
l < n ;
l ++ ) {
if ( i == l ) continue ;
if ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) {
found = true ;
return S [ i ] ;
}
}
}
}
}
if ( found == false ) return Integer . MAX_VALUE ;
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,12,14,15,16,20,27,28,29,30,35,41,46,51,53,55,55,58,63,64,72,73,75,75,75,82,82,86,89,91,92,94,95,95,97,97,98});
param0.add(new int[]{-62,48,-22,-44,-58,-50,-82,34,26,-2,86,-44,92,-96,42,-20,10,74,-56,-12,-28,-40});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1});
param0.add(new int[]{84,58,10,67,77,66,10,47,65,55,54});
param0.add(new int[]{-46,-28,-20,-18,4,8,18,38,90,90});
param0.add(new int[]{0,1,1,1,0,1,1,0,0,1,1,0,0,0,0,1,1,1,1,0,0,1,0,0,0,0,1,0,1,0,0,1,1,0,1,1,0,0,1,0,0,1,0,1,0});
param0.add(new int[]{11,13,14,21,26,28,36,39,41,42,43,44,49,49,57,58,59,59,63,64,67,69,70,75,78,79,83,83,86,91,92,93,96,96,96,97});
param0.add(new int[]{74,52,-16,34,-88,62,54,46,-82,76,-48,54,50,-66,-18,78,-48,38,96,-32,-82,0,-76,46,-56,4,-30,-70,-62});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{55,74,18,4,68,66,33,61,66,92,21,9,49,14,99,87,74,6,11,25,5,58,56,20});
List<Integer> param1 = new ArrayList<>();
param1.add(24);
param1.add(19);
param1.add(8);
param1.add(5);
param1.add(6);
param1.add(35);
param1.add(30);
param1.add(16);
param1.add(17);
param1.add(23);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,646 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/N_TH_ROOT_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class 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 ;
}
//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());
}
} | 5,647 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S{
static String f_gold ( String s , char c1 , char c2 ) {
int l = s . length ( ) ;
char [ ] arr = s . toCharArray ( ) ;
for ( int i = 0 ;
i < l ;
i ++ ) {
if ( arr [ i ] == c1 ) arr [ i ] = c2 ;
else if ( arr [ i ] == c2 ) arr [ i ] = c1 ;
}
return String . valueOf ( arr ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("IZTSMw j");
param0.add("7288334");
param0.add("010110000");
param0.add("b gJX");
param0.add("734");
param0.add("1");
param0.add("xCaUKdhA");
param0.add("4370992644981");
param0.add("01010");
param0.add("ZNIFGshaWA");
List<Character> param1 = new ArrayList<>();
param1.add('W');
param1.add('6');
param1.add('1');
param1.add('t');
param1.add('4');
param1.add('1');
param1.add('X');
param1.add('5');
param1.add('0');
param1.add('Q');
List<Character> param2 = new ArrayList<>();
param2.add('k');
param2.add('9');
param2.add('1');
param2.add('P');
param2.add('4');
param2.add('1');
param2.add('S');
param2.add('6');
param2.add('1');
param2.add('x');
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)).equals(f_gold(param0.get(i),param1.get(i),param2.get(i))))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,648 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int i ;
for ( i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] == i ) return i ;
}
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,16,21,26,27,29,34,35,35,37,38,40,48,52,58,59,60,61,63,63,65,66,69,75,79,83,86,88,91,91,96});
param0.add(new int[]{22,-70,34,-44,84,54,14,-88});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{59,67,70,34,18,22,52,95,11,66,60,24,7,71,52,88,32,52,85,81,32,44,25,51,47,97,81,33,88,38,36,54,80,25,70,27,75,29,94});
param0.add(new int[]{-96,-96,-94,-88,-88,-82,-72,-72,-70,-70,-66,-64,-64,-62,-58,-54,-46,-44,-30,-26,-22,-8,-6,-2,0,26,30,30,34,42,42,48,64,76,90,96});
param0.add(new int[]{0,1,0,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,1,0,1,1});
param0.add(new int[]{2,2,4,7,10,15,16,16,23,24,27,39,42,58,60,64,72,74,78,78,78,80,80,84,85,86,88,88,90,92,93,94,95,96});
param0.add(new int[]{-68,-48,36,22,-80,-48,-74,-14,44,-46,-76,18,-16,-36,-68,0,-30,-56,42,92,82,64,-18,-6,-78,-86,26,86,36,-66,-50,18,-26,48,8});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{3,76,99,1,1,29,9,12,57,12,74,22,83,77,39,84,50,60,36,90,88,62,79,58,58,40,44,99,84,63,23,21,16,98,68,8,46});
List<Integer> param1 = new ArrayList<>();
param1.add(23);
param1.add(7);
param1.add(31);
param1.add(37);
param1.add(34);
param1.add(15);
param1.add(22);
param1.add(20);
param1.add(23);
param1.add(35);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,649 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1{
static int f_gold ( int n ) {
return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(55);
param0.add(36);
param0.add(69);
param0.add(92);
param0.add(73);
param0.add(16);
param0.add(88);
param0.add(19);
param0.add(66);
param0.add(68);
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());
}
} | 5,650 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1{
static Boolean f_gold ( int arr [ ] , int n ) {
HashSet < Integer > us = new HashSet < Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) us . add ( arr [ i ] ) ;
int count = 1 ;
int curr_ele = arr [ 0 ] - 1 ;
while ( us . contains ( curr_ele ) == true ) {
count ++ ;
curr_ele -- ;
}
curr_ele = arr [ 0 ] + 1 ;
while ( us . contains ( curr_ele ) == true ) {
count ++ ;
curr_ele ++ ;
}
return ( count == ( us . size ( ) ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{15,19,38,59,71});
param0.add(new int[]{-20,66,-22,-56,-6,94,70,-80,24,-26,-58,-76,-20,-8,-62,18,-56,-20,42,-40,-88,-74,64,-26,-92,66,-18,-64,66,12,24,-8,78,-82,14,-76});
param0.add(new int[]{0,0,1,1,1});
param0.add(new int[]{40,38,17,50,16,35,34,23,3,12,97,53,75,36,3,73,99,11,70,9,23,3,11,9,64,44,62,94,55,69,44,59,57,99,69,12,27,42,14,83,53,4,4});
param0.add(new int[]{-78,-36,-28,-16,-8,-4,4,4,10,14,30,30,32,32,38,46,54,72});
param0.add(new int[]{1,0,1,0,0,1,1,0,0,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1});
param0.add(new int[]{7,32,54,70,79,88});
param0.add(new int[]{-38,48,-96,-84,10,70,-28,-66,40,-26,-24,-8,28,-6,6,-14,-2,-58,-6,-14,-58,-74,20,32,98,-24,-10,42,-4,-96,-56,-40,74,-98,-86,-94,12,80,10,-54,-44});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1});
param0.add(new int[]{49,87,18,19,56,25,64,94,43,97,74,79,13,36,72,46,10,84,2,11,41,87,55,38,89,92,65,57,62,16});
List<Integer> param1 = new ArrayList<>();
param1.add(3);
param1.add(26);
param1.add(4);
param1.add(26);
param1.add(16);
param1.add(38);
param1.add(5);
param1.add(30);
param1.add(12);
param1.add(21);
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());
}
} | 5,651 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR{
static int f_gold ( int n ) {
return n * ( n - 1 ) * ( n - 2 ) / 6 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(58);
param0.add(67);
param0.add(60);
param0.add(4);
param0.add(97);
param0.add(9);
param0.add(16);
param0.add(83);
param0.add(87);
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());
}
} | 5,652 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS{
static int f_gold ( int n ) {
int C [ ] [ ] = new int [ n + 1 ] [ n + 1 ] ;
int i , j ;
for ( i = 0 ;
i <= n ;
i ++ ) {
for ( j = 0 ;
j <= Math . min ( i , n ) ;
j ++ ) {
if ( j == 0 || j == i ) C [ i ] [ j ] = 1 ;
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ] ;
}
}
int sum = 0 ;
for ( i = 0 ;
i <= n ;
i += 2 ) sum += C [ n ] [ i ] ;
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(18);
param0.add(54);
param0.add(67);
param0.add(17);
param0.add(47);
param0.add(99);
param0.add(26);
param0.add(93);
param0.add(57);
param0.add(98);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,653 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DECODE_MEDIAN_STRING_ORIGINAL_STRING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DECODE_MEDIAN_STRING_ORIGINAL_STRING{
static String f_gold ( String s ) {
int l = s . length ( ) ;
String s1 = "" ;
boolean isEven = ( l % 2 == 0 ) ? true : false ;
for ( int i = 0 ;
i < l ;
i += 2 ) {
if ( isEven ) {
s1 = s . charAt ( i ) + s1 ;
s1 += s . charAt ( i + 1 ) ;
}
else {
if ( l - i > 1 ) {
s1 += s . charAt ( i ) ;
s1 = s . charAt ( i + 1 ) + s1 ;
}
else {
s1 += s . charAt ( i ) ;
}
}
}
return s1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add(" EgvQCeqYpZtv");
param0.add("488540");
param0.add("0000101010111");
param0.add("syw");
param0.add("402355");
param0.add("0");
param0.add("wmHMlAtq");
param0.add("7962");
param0.add("111111");
param0.add("UbgRGDquop");
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());
}
} | 5,654 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING{
static String f_gold ( String str ) {
String mx = "" ;
for ( int i = 0 ;
i < str . length ( ) ;
++ i ) {
if ( mx . compareTo ( str . substring ( i ) ) <= 0 ) {
mx = str . substring ( i ) ;
}
}
return mx ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("HCoAefoaan");
param0.add("80336005");
param0.add("01111111110");
param0.add("qIH");
param0.add("4210598472796");
param0.add("10101");
param0.add("imqmKdatcgXjs");
param0.add("950509666021");
param0.add("10111101101");
param0.add("wasqgYFvz");
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());
}
} | 5,655 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_LARGEST_PRIME_FACTOR_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_LARGEST_PRIME_FACTOR_NUMBER{
static long f_gold ( long n ) {
long maxPrime = - 1 ;
while ( n % 2 == 0 ) {
maxPrime = 2 ;
n >>= 1 ;
}
for ( int i = 3 ;
i <= Math . sqrt ( n ) ;
i += 2 ) {
while ( n % i == 0 ) {
maxPrime = i ;
n = n / i ;
}
}
if ( n > 2 ) maxPrime = n ;
return maxPrime ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(98L);
param0.add(8L);
param0.add(78L);
param0.add(65L);
param0.add(55L);
param0.add(10L);
param0.add(10L);
param0.add(37L);
param0.add(39L);
param0.add(15L);
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());
}
} | 5,656 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1{
static int f_gold ( int n ) {
int nCr = 1 , res = 1 ;
for ( int r = 1 ;
r <= n ;
r ++ ) {
nCr = ( nCr * ( n + 1 - r ) ) / r ;
res += nCr * nCr ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(52);
param0.add(75);
param0.add(25);
param0.add(80);
param0.add(18);
param0.add(17);
param0.add(33);
param0.add(8);
param0.add(99);
param0.add(8);
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());
}
} | 5,657 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION{
static int f_gold ( int a , int b ) {
String s = String . valueOf ( b ) ;
int i ;
for ( i = 0 ;
i < s . length ( ) ;
i ++ ) {
if ( s . charAt ( i ) != '9' ) break ;
}
int result ;
if ( i == s . length ( ) ) result = a * s . length ( ) ;
else result = a * ( s . length ( ) - 1 ) ;
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(31);
param0.add(72);
param0.add(23);
param0.add(42);
param0.add(13);
param0.add(93);
param0.add(33);
param0.add(94);
param0.add(60);
param0.add(11);
List<Integer> param1 = new ArrayList<>();
param1.add(91);
param1.add(85);
param1.add(49);
param1.add(32);
param1.add(7);
param1.add(5);
param1.add(32);
param1.add(76);
param1.add(60);
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());
}
} | 5,658 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING_1{
public static int f_gold ( String s ) {
int p = - 1 , i , k ;
int MAX_CHAR = 256 ;
int hash [ ] = new int [ MAX_CHAR ] ;
int pos [ ] = new int [ MAX_CHAR ] ;
for ( i = 0 ;
i < s . length ( ) ;
i ++ ) {
k = ( int ) s . charAt ( i ) ;
if ( hash [ k ] == 0 ) {
hash [ k ] ++ ;
pos [ k ] = i ;
}
else if ( hash [ k ] == 1 ) hash [ k ] ++ ;
}
for ( i = 0 ;
i < MAX_CHAR ;
i ++ ) {
if ( hash [ i ] == 2 ) {
if ( p == - 1 ) p = pos [ i ] ;
else if ( p > pos [ i ] ) p = pos [ i ] ;
}
}
return p ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("iwLT");
param0.add("225168787");
param0.add("00100111");
param0.add("ktdzbGbqsvQ");
param0.add("5574573212164");
param0.add("01000110101101");
param0.add("ftiv");
param0.add("48956");
param0.add("10100111001101");
param0.add("YvhEOhhz");
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());
}
} | 5,659 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/WILDCARD_CHARACTER_MATCHING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WILDCARD_CHARACTER_MATCHING{
static boolean f_gold ( String first , String second ) {
if ( first . length ( ) == 0 && second . length ( ) == 0 ) return true ;
if ( first . length ( ) > 1 && first . charAt ( 0 ) == '*' && second . length ( ) == 0 ) return false ;
if ( ( first . length ( ) > 1 && first . charAt ( 0 ) == '?' ) || ( first . length ( ) != 0 && second . length ( ) != 0 && first . charAt ( 0 ) == second . charAt ( 0 ) ) ) return f_gold ( first . substring ( 1 ) , second . substring ( 1 ) ) ;
if ( first . length ( ) > 0 && first . charAt ( 0 ) == '*' ) return f_gold ( first . substring ( 1 ) , second ) || f_gold ( first , second . substring ( 1 ) ) ;
return false ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("g*ks");
param0.add("ge?ks*");
param0.add("g*k");
param0.add("*pqrs");
param0.add("abc*bcd");
param0.add("abc*c?d");
param0.add("*c*d");
param0.add("*?c*d");
param0.add("?*1");
param0.add("a*");
List<String> param1 = new ArrayList<>();
param1.add("geeks");
param1.add("geeksforgeeks");
param1.add("gee");
param1.add("pqrst");
param1.add("abcdhghgbcd");
param1.add("abcd");
param1.add("abcd");
param1.add("abcd");
param1.add("010111111001");
param1.add("CBzHMjUGCUJD");
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());
}
} | 5,660 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class 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 ;
}
//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());
}
}
| 5,661 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1{
static int f_gold ( int n ) {
int der [ ] = new int [ n + 1 ] ;
der [ 0 ] = 1 ;
der [ 1 ] = 0 ;
der [ 2 ] = 1 ;
for ( int i = 3 ;
i <= n ;
++ i ) der [ i ] = ( i - 1 ) * ( der [ i - 1 ] + der [ i - 2 ] ) ;
return der [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(22);
param0.add(91);
param0.add(33);
param0.add(93);
param0.add(90);
param0.add(59);
param0.add(88);
param0.add(41);
param0.add(70);
param0.add(63);
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());
}
} | 5,662 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int invcount = 0 ;
for ( int i = 0 ;
i < n - 2 ;
i ++ ) {
for ( int j = i + 1 ;
j < n - 1 ;
j ++ ) {
if ( arr [ i ] > arr [ j ] ) {
for ( int k = j + 1 ;
k < n ;
k ++ ) {
if ( arr [ j ] > arr [ k ] ) invcount ++ ;
}
}
}
}
return invcount ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{11,17,27,29,31,31,32,44,45,93});
param0.add(new int[]{-48,-10,-44,-94,50,-24,30,72,-6,56,94,-44,-96,-52,-2,68,-52,30,98,0,12,-98,-94,48,-96,-86});
param0.add(new int[]{0,0,0,1,1,1,1,1,1});
param0.add(new int[]{78,82,51,92,88,95});
param0.add(new int[]{-98,-96,-84,-72,-70,-62,-62,-58,-56,-54,-52,-52,-52,-50,-40,-40,-38,-36,-34,-26,-26,-22,-22,-20,-12,-8,-2,4,14,14,18,22,28,32,34,34,42,44,54,58,60,64,74,80,88,90,92,94,96});
param0.add(new int[]{1,0,0,0});
param0.add(new int[]{2,3,5,5,5,7,7,15,16,21,29,29,35,39,39,40,42,44,46,48,48,52,52,52,54,55,57,62,67,67,67,70,71,71,76,78,79,87,94,96});
param0.add(new int[]{-60,-42,20,52,-54,40,56});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{98,81,23,71,82,31,15,21,4,68,68,22,77,83,22,9,10,56});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(15);
param1.add(6);
param1.add(3);
param1.add(47);
param1.add(3);
param1.add(39);
param1.add(6);
param1.add(37);
param1.add(13);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,663 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10{
static int f_gold ( String N ) {
int len = N . length ( ) ;
int l = ( len ) / 2 ;
int count = 0 ;
for ( int i = 1 ;
i <= l ;
i ++ ) {
String s = N . substring ( 0 , i ) ;
int l1 = s . length ( ) ;
String t = N . substring ( i , l1 + i ) ;
if ( s . charAt ( 0 ) == '0' || t . charAt ( 0 ) == '0' ) continue ;
if ( s . compareTo ( t ) == 0 ) count ++ ;
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ZCoQhuM");
param0.add("2674377254");
param0.add("11");
param0.add("LbuGlvRyWAPBpo");
param0.add("26382426486138");
param0.add("111010111010");
param0.add("hUInqJXNdbfP");
param0.add("5191");
param0.add("1110101101");
param0.add("2202200");
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());
}
} | 5,664 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DOUBLE_FACTORIAL_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DOUBLE_FACTORIAL_1{
static int f_gold ( int n ) {
int res = 1 ;
for ( int i = n ;
i >= 0 ;
i = i - 2 ) {
if ( i == 0 || i == 1 ) return res ;
else res *= i ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(88);
param0.add(24);
param0.add(3);
param0.add(22);
param0.add(53);
param0.add(2);
param0.add(88);
param0.add(30);
param0.add(38);
param0.add(2);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,665 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME{
static int f_gold ( int n ) {
int table [ ] = new int [ n + 1 ] , i ;
Arrays . fill ( table , 0 ) ;
table [ 0 ] = 1 ;
for ( i = 3 ;
i <= n ;
i ++ ) table [ i ] += table [ i - 3 ] ;
for ( i = 5 ;
i <= n ;
i ++ ) table [ i ] += table [ i - 5 ] ;
for ( i = 10 ;
i <= n ;
i ++ ) table [ i ] += table [ i - 10 ] ;
return table [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(83);
param0.add(29);
param0.add(17);
param0.add(12);
param0.add(93);
param0.add(55);
param0.add(97);
param0.add(75);
param0.add(22);
param0.add(52);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,666 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ{
public static int f_gold ( int n , int k ) {
if ( n + 1 >= k ) return ( k - 1 ) ;
else return ( 2 * n + 1 - k ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(90);
param0.add(86);
param0.add(92);
param0.add(72);
param0.add(25);
param0.add(11);
param0.add(94);
param0.add(91);
param0.add(66);
param0.add(34);
List<Integer> param1 = new ArrayList<>();
param1.add(74);
param1.add(36);
param1.add(38);
param1.add(71);
param1.add(57);
param1.add(53);
param1.add(80);
param1.add(75);
param1.add(58);
param1.add(88);
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());
}
} | 5,667 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X{
static long f_gold ( long y , long x ) {
if ( ( Math . log ( y ) / Math . log ( 2 ) ) < x ) return y ;
if ( x > 63 ) return y ;
return ( y % ( 1 << ( int ) x ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(57L);
param0.add(80L);
param0.add(84L);
param0.add(35L);
param0.add(3L);
param0.add(42L);
param0.add(7L);
param0.add(99L);
param0.add(13L);
param0.add(44L);
List<Long> param1 = new ArrayList<>();
param1.add(76L);
param1.add(46L);
param1.add(96L);
param1.add(16L);
param1.add(84L);
param1.add(79L);
param1.add(2L);
param1.add(83L);
param1.add(61L);
param1.add(8L);
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());
}
} | 5,668 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS{
static int f_gold ( int n ) {
int table [ ] = new int [ n + 1 ] ;
Arrays . fill ( table , 0 ) ;
table [ 0 ] = 1 ;
for ( int i = 1 ;
i < n ;
i ++ ) for ( int j = i ;
j <= n ;
j ++ ) table [ j ] += table [ j - i ] ;
return table [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(66);
param0.add(90);
param0.add(8);
param0.add(77);
param0.add(44);
param0.add(20);
param0.add(34);
param0.add(22);
param0.add(50);
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());
}
} | 5,669 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME{
static int f_gold ( int arr [ ] , int n ) {
int count = 0 ;
int cummulative_sum = 0 ;
Arrays . sort ( arr ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] >= cummulative_sum ) {
count ++ ;
cummulative_sum += arr [ i ] ;
}
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,33,34,42,42,45,73});
param0.add(new int[]{32,-10,-64,-20,92,-66,6,44,-62,-98,4,-48,44,42,12,-90,52,86,-30,-80,64,94,14});
param0.add(new int[]{0,0,0,0,1});
param0.add(new int[]{11,85,89,71,82,44});
param0.add(new int[]{-96,-92,-78,-72,-68,-58,-52,-50,-50,-48,-42,-32,-20,-18,-4,0,0,2,18,18,20,24,32,34,36,38,38,60,66,68,70,72,72,74,76,96,98});
param0.add(new int[]{0,0,1,1,0,0,1,1,1,1,0,0,1,1,1,1,0,1,0,0,1});
param0.add(new int[]{8,9,10,11,12,15,17,19,20,21,24,30,33,35,36,39,41,41,42,54,62,63,68,70,71,72,77,85,86,86,94,95,97,97});
param0.add(new int[]{96,22,-60,4,-94,-16,46,10,76,-90,4,70,-72,60,28,-24,-66,92,-70,72,36});
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[]{90,63,16,40,28,97,20,63,42,31,57,84,10,12,59,69,47,7,53,67});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(16);
param1.add(2);
param1.add(3);
param1.add(21);
param1.add(16);
param1.add(31);
param1.add(20);
param1.add(13);
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());
}
} | 5,670 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME{
static boolean f_gold ( String s ) {
int l = s . length ( ) ;
for ( int i = 0 , j = l - 1 ;
i <= j ;
i ++ , j -- ) {
if ( s . charAt ( i ) != s . charAt ( j ) ) {
return false ;
}
}
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("aadaa");
param0.add("2674377254");
param0.add("11");
param0.add("0011000 ");
param0.add("26382426486138");
param0.add("111010111010");
param0.add("abccba");
param0.add("5191");
param0.add("1110101101");
param0.add("abcdecbe");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,671 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES{
static boolean f_gold ( String str1 , String str2 ) {
if ( str1 . length ( ) != str2 . length ( ) ) return false ;
String clock_rot = "" ;
String anticlock_rot = "" ;
int len = str2 . length ( ) ;
anticlock_rot = anticlock_rot + str2 . substring ( len - 2 , len ) + str2 . substring ( 0 , len - 2 ) ;
clock_rot = clock_rot + str2 . substring ( 2 ) + str2 . substring ( 0 , 2 ) ;
return ( str1 . equals ( clock_rot ) || str1 . equals ( anticlock_rot ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("amazon");
param0.add("onamaz");
param0.add("amazon");
param0.add("ab");
param0.add("737009");
param0.add("000110");
param0.add("l");
param0.add("4420318628");
param0.add("11011111000000");
param0.add(" pvFHANc");
List<String> param1 = new ArrayList<>();
param1.add("azonam");
param1.add("amazon");
param1.add("azoman");
param1.add("ab");
param1.add("239119");
param1.add("01111");
param1.add("YVo hqvnGxow");
param1.add("52856");
param1.add("10");
param1.add("xBIDFbiGb");
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());
}
} | 5,672 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int ans = - 1 ;
String num = "" ;
for ( int i = 1 ;
i < ( 1 << n ) ;
i ++ ) {
String str = "" ;
for ( int j = 0 ;
j < n ;
j ++ ) {
if ( ( ( i >> j ) & 1 ) == 1 ) {
str += s . charAt ( j ) ;
}
}
if ( str . charAt ( 0 ) != '0' ) {
int temp = 0 ;
for ( int j = 0 ;
j < str . length ( ) ;
j ++ ) temp = temp * 10 + ( int ) ( str . charAt ( j ) - '0' ) ;
int k = ( int ) Math . sqrt ( temp ) ;
if ( k * k == temp ) {
if ( ans < ( int ) str . length ( ) ) {
ans = ( int ) str . length ( ) ;
num = str ;
}
}
}
}
if ( ans == - 1 ) return ans ;
else {
System . out . print ( num + " " ) ;
return n - ans ;
}
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("h");
param0.add("1391212");
param0.add("010");
param0.add("ksRFLRVL");
param0.add("5809836998");
param0.add("1111000");
param0.add("hJoDzrrBaF");
param0.add("6076");
param0.add("001010010");
param0.add("lU DBBVF");
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());
}
} | 5,673 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_ROTATIONS_REQUIRED_GET_STRING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_ROTATIONS_REQUIRED_GET_STRING{
static int f_gold ( String str ) {
String tmp = str + str ;
int n = str . length ( ) ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
String substring = tmp . substring ( i , str . length ( ) ) ;
if ( str == substring ) return i ;
}
return n ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("vdevdNdQSopPtj");
param0.add("5");
param0.add("100010101011");
param0.add("tlDOvJHAyMllu");
param0.add("06");
param0.add("101");
param0.add("DYgtU");
param0.add("4");
param0.add("00");
param0.add("Dt");
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());
}
} | 5,674 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
int cum_sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) cum_sum += arr [ i ] ;
int curr_val = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) curr_val += i * arr [ i ] ;
int res = curr_val ;
for ( int i = 1 ;
i < n ;
i ++ ) {
int next_val = curr_val - ( cum_sum - arr [ i - 1 ] ) + arr [ i - 1 ] * ( n - 1 ) ;
curr_val = next_val ;
res = Math . max ( res , next_val ) ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,6,13,14,16,20,24,24,24,27,28,36,49,51,55,56,62,69,74,74,76,85,86,90,92,98});
param0.add(new int[]{-42,96,68,64,14,-74,76,42,34,-92,-20,28,-80,-34,-22,96,-46,96,10,-82,82,50,-24,48,56,72,-40,-86,84,66,-62,50,-76,34});
param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1});
param0.add(new int[]{37,88,70,86,24,62,34,44,37,42,46,34,23,32,55,2,5,70,30,46,40,65,91,4,7,74,46,12,30,22,1,91,89,88,97,6,6,11,33,14,68,24});
param0.add(new int[]{-92,-90,-70,-70,-10,2,10,12,14,40,44,46,64,68,68,96});
param0.add(new int[]{1,0,1,0,0,0,1,1,0,1,0,1,0,0,1,0,1,1,1,1});
param0.add(new int[]{9,15,15,17,19,20,21,23,25,25,25,32,32,33,45,51,54,59,68,71,71,71,72,75,78,80,82,82,88,89,92,93,94,97});
param0.add(new int[]{52,-78,-80,32,-56,-98,-36,86,34,-36,42,46,50,0,34,-46,-2,-18,-96,12,-42,62,32,78,66,-8,50,60,10,-18,66,80,-24,-98,8,48,34,44,-80,-34,72,0,-60,52,40,20});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{45,35,25,7,24,73,25,86,48,70,47,91,96,15,39,9});
List<Integer> param1 = new ArrayList<>();
param1.add(13);
param1.add(27);
param1.add(10);
param1.add(39);
param1.add(11);
param1.add(15);
param1.add(22);
param1.add(45);
param1.add(33);
param1.add(8);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,675 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SQUARE_ROOT_OF_A_PERFECT_SQUARE_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SQUARE_ROOT_OF_A_PERFECT_SQUARE_1{
static long f_gold ( int n ) {
int x = n ;
int y = 1 ;
while ( x > y ) {
x = ( x + y ) / 2 ;
y = n / x ;
}
return ( long ) x ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(58);
param0.add(55);
param0.add(51);
param0.add(42);
param0.add(2);
param0.add(30);
param0.add(77);
param0.add(82);
param0.add(31);
param0.add(9);
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());
}
} | 5,676 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS{
static int f_gold ( int arr [ ] , int N , int K ) {
Arrays . sort ( arr ) ;
int res = 2147483647 ;
for ( int i = 0 ;
i <= ( N - K ) ;
i ++ ) {
int curSeqDiff = arr [ i + K - 1 ] - arr [ i ] ;
res = Math . min ( res , curSeqDiff ) ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,1,4,18,21,35,37,39,76,81,86,92,96});
param0.add(new int[]{-8,-6,62,52,-86,2,-94,0,-48,-38,24,-48,34});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{23,36,43,50,74,81,94,13,30,57,30,71,10,99,66,94,83,39,37,3,89,34});
param0.add(new int[]{-96,-94,-92,-84,-80,-72,-24,-22,-18,-14,6,8,26,28,30,36,50,58,80,84,92,92});
param0.add(new int[]{0,0,0,0,0,0,1,1,0,1,1,1,1,0,1,0,0,1,1,0,0,1,1});
param0.add(new int[]{6,7,9,27,30,42,54,55,57,57,59,76,84,84,84});
param0.add(new int[]{88,44,-96,-72,-80,0,-64,-64,-68,4,38,4,-38,68,-54,92,-16,62,24,54,0,54,62,-70,80,-12,84,-16,-10,88,-30,-56,48,50,-24,94,40,28,-86,-12});
param0.add(new int[]{0,1});
param0.add(new int[]{89,18,7,54,67,93,10,61,59,59,69,63,98,8,78,55,6,1,56,97,75,88,10});
List<Integer> param1 = new ArrayList<>();
param1.add(7);
param1.add(9);
param1.add(16);
param1.add(17);
param1.add(21);
param1.add(21);
param1.add(13);
param1.add(31);
param1.add(1);
param1.add(22);
List<Integer> param2 = new ArrayList<>();
param2.add(6);
param2.add(12);
param2.add(26);
param2.add(20);
param2.add(12);
param2.add(22);
param2.add(14);
param2.add(26);
param2.add(1);
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());
}
} | 5,677 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SORT_ARRAY_APPLYING_GIVEN_EQUATION.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class SORT_ARRAY_APPLYING_GIVEN_EQUATION{
static void f_gold ( int arr [ ] , int n , int A , int B , int C ) {
for ( int i = 0 ;
i < n ;
i ++ ) arr [ i ] = A * arr [ i ] * arr [ i ] + B * arr [ i ] + C ;
int index = - 1 ;
int maximum = - 999999 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( maximum < arr [ i ] ) {
index = i ;
maximum = arr [ i ] ;
}
}
int i = 0 , j = n - 1 ;
int [ ] new_arr = new int [ n ] ;
int k = 0 ;
while ( i < index && j > index ) {
if ( arr [ i ] < arr [ j ] ) new_arr [ k ++ ] = arr [ i ++ ] ;
else new_arr [ k ++ ] = arr [ j -- ] ;
}
while ( i < index ) new_arr [ k ++ ] = arr [ i ++ ] ;
while ( j > index ) new_arr [ k ++ ] = arr [ j -- ] ;
new_arr [ n - 1 ] = maximum ;
for ( int p = 0 ;
p < n ;
p ++ ) arr [ p ] = new_arr [ p ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{9,30,49,65,78,85,85,92});
param0.add(new int[]{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16});
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});
param0.add(new int[]{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,63,62,19,17,69,39,82,71,81,39,36,40,45,4,25,69,30,76,68,88,29,73,68,51,24,14,69,18});
param0.add(new int[]{-91,-85,-77,-73,-70,-68,-24,-21,-12,-1,9,29,48,52,56,63,88});
param0.add(new int[]{0,0,0,1,1,0,1,1,1,1});
param0.add(new int[]{4,5,9,14,18,20,22,23,25,28,30,31,34,35,36,38,38,39,44,48,49,51,54,55,59,64,66,71,72,72,73,76,78,82,82,84,92,93,95});
param0.add(new int[]{40,6,33,8,78,-58,2,24,40,3,46,94,-26,8,22,-83,96,-29,-38,-59,19,62,98,-55,-42,79,26,62,-56,-85,-22});
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});
param0.add(new int[]{3,68,40,48,54,35,95,56,89,40,77,68,46,78,13,27,6,17,36,99,81,2,77,52,66,52,92,43,90,22,55,67,99,60,58});
List<Integer> param1 = new ArrayList<>();
param1.add(4);
param1.add(18);
param1.add(25);
param1.add(33);
param1.add(8);
param1.add(7);
param1.add(22);
param1.add(20);
param1.add(23);
param1.add(28);
List<Integer> param2 = new ArrayList<>();
param2.add(4);
param2.add(20);
param2.add(26);
param2.add(42);
param2.add(12);
param2.add(8);
param2.add(33);
param2.add(16);
param2.add(21);
param2.add(21);
List<Integer> param3 = new ArrayList<>();
param3.add(5);
param3.add(20);
param3.add(15);
param3.add(35);
param3.add(8);
param3.add(6);
param3.add(19);
param3.add(19);
param3.add(19);
param3.add(23);
List<Integer> param4 = new ArrayList<>();
param4.add(4);
param4.add(23);
param4.add(18);
param4.add(41);
param4.add(8);
param4.add(7);
param4.add(25);
param4.add(16);
param4.add(23);
param4.add(23);
List<int [ ]> filled_function_param0 = new ArrayList<>();
filled_function_param0.add(new int[]{9,30,49,65,78,85,85,92});
filled_function_param0.add(new int[]{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16});
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,1,1,1,1,1,1,1,1,1});
filled_function_param0.add(new int[]{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,63,62,19,17,69,39,82,71,81,39,36,40,45,4,25,69,30,76,68,88,29,73,68,51,24,14,69,18});
filled_function_param0.add(new int[]{-91,-85,-77,-73,-70,-68,-24,-21,-12,-1,9,29,48,52,56,63,88});
filled_function_param0.add(new int[]{0,0,0,1,1,0,1,1,1,1});
filled_function_param0.add(new int[]{4,5,9,14,18,20,22,23,25,28,30,31,34,35,36,38,38,39,44,48,49,51,54,55,59,64,66,71,72,72,73,76,78,82,82,84,92,93,95});
filled_function_param0.add(new int[]{40,6,33,8,78,-58,2,24,40,3,46,94,-26,8,22,-83,96,-29,-38,-59,19,62,98,-55,-42,79,26,62,-56,-85,-22});
filled_function_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});
filled_function_param0.add(new int[]{3,68,40,48,54,35,95,56,89,40,77,68,46,78,13,27,6,17,36,99,81,2,77,52,66,52,92,43,90,22,55,67,99,60,58});
List<Integer> filled_function_param1 = new ArrayList<>();
filled_function_param1.add(4);
filled_function_param1.add(18);
filled_function_param1.add(25);
filled_function_param1.add(33);
filled_function_param1.add(8);
filled_function_param1.add(7);
filled_function_param1.add(22);
filled_function_param1.add(20);
filled_function_param1.add(23);
filled_function_param1.add(28);
List<Integer> filled_function_param2 = new ArrayList<>();
filled_function_param2.add(4);
filled_function_param2.add(20);
filled_function_param2.add(26);
filled_function_param2.add(42);
filled_function_param2.add(12);
filled_function_param2.add(8);
filled_function_param2.add(33);
filled_function_param2.add(16);
filled_function_param2.add(21);
filled_function_param2.add(21);
List<Integer> filled_function_param3 = new ArrayList<>();
filled_function_param3.add(5);
filled_function_param3.add(20);
filled_function_param3.add(15);
filled_function_param3.add(35);
filled_function_param3.add(8);
filled_function_param3.add(6);
filled_function_param3.add(19);
filled_function_param3.add(19);
filled_function_param3.add(19);
filled_function_param3.add(23);
List<Integer> filled_function_param4 = new ArrayList<>();
filled_function_param4.add(4);
filled_function_param4.add(23);
filled_function_param4.add(18);
filled_function_param4.add(41);
filled_function_param4.add(8);
filled_function_param4.add(7);
filled_function_param4.add(25);
filled_function_param4.add(16);
filled_function_param4.add(23);
filled_function_param4.add(23);
for(int i = 0; i < param0.size(); ++i)
{
f_filled(filled_function_param0.get(i),filled_function_param1.get(i),filled_function_param2.get(i),filled_function_param3.get(i),filled_function_param4.get(i));
f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i));
if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i) && param2.get(i) == filled_function_param2.get(i) && param3.get(i) == filled_function_param3.get(i) && param4.get(i) == filled_function_param4.get(i))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,678 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class 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 ;
}
//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());
}
} | 5,679 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES{
static int f_gold ( int a [ ] , int n , int k ) {
if ( k >= n - 1 ) return n ;
int best = 0 , times = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( a [ i ] > best ) {
best = a [ i ] ;
if ( i == 1 ) times = 1 ;
}
else times += 1 ;
if ( times >= k ) return best ;
}
return best ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,5,5,9,10,10,11,14,23,27,31,32,33,33,33,37,39,41,41,42,42,43,47,60,61,68,73,73,73,78,80,80,82,83,86,87,89,92,94,98});
param0.add(new int[]{80,-58,64,48,-16,60,-50,-52,62,-86,-96,52,26,-30,14});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1});
param0.add(new int[]{90,23,43,42,7,71,79});
param0.add(new int[]{-96,-96,-90,-84,-68,-64,-56,-56,-50,-50,-48,-46,-28,-18,0,0,6,32,32,34,42,42,46,50,50,52,64,64,70,76,84,88});
param0.add(new int[]{1,1,1});
param0.add(new int[]{2,9,15,19,26,29,42,45,46,47,55,60,60,61,62,64,68,69,74,79,96});
param0.add(new int[]{-32,12,80,42,80,8,58,-76,-42,-98,22,-90,-16,-4,-62,-32,28,12,78,-52,-84,78,88,-76,-52,68,-34,-16,-4,2,-78,-94,-22,34,6,-62,72});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{52,19});
List<Integer> param1 = new ArrayList<>();
param1.add(33);
param1.add(14);
param1.add(7);
param1.add(4);
param1.add(28);
param1.add(1);
param1.add(14);
param1.add(26);
param1.add(26);
param1.add(1);
List<Integer> param2 = new ArrayList<>();
param2.add(37);
param2.add(13);
param2.add(6);
param2.add(4);
param2.add(21);
param2.add(2);
param2.add(17);
param2.add(31);
param2.add(14);
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());
}
} | 5,680 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_DIGITS_PRODUCT_TWO_NUMBERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_DIGITS_PRODUCT_TWO_NUMBERS{
static int f_gold ( int a , int b ) {
int count = 0 ;
int p = Math . abs ( a * b ) ;
if ( p == 0 ) return 1 ;
while ( p > 0 ) {
count ++ ;
p = p / 10 ;
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(86);
param0.add(81);
param0.add(48);
param0.add(64);
param0.add(56);
param0.add(5);
param0.add(25);
param0.add(94);
param0.add(5);
param0.add(46);
List<Integer> param1 = new ArrayList<>();
param1.add(39);
param1.add(87);
param1.add(84);
param1.add(80);
param1.add(20);
param1.add(70);
param1.add(13);
param1.add(83);
param1.add(55);
param1.add(46);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,681 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FLOOR_IN_A_SORTED_ARRAY_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FLOOR_IN_A_SORTED_ARRAY_1{
static int f_gold ( int arr [ ] , int low , int high , int x ) {
if ( low > high ) return - 1 ;
if ( x >= arr [ high ] ) return high ;
int mid = ( low + high ) / 2 ;
if ( arr [ mid ] == x ) return mid ;
if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1 ;
if ( x < arr [ mid ] ) return f_gold ( arr , low , mid - 1 , x ) ;
return f_gold ( arr , mid + 1 , high , x ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,11,20,42,42,55,58,98,99});
param0.add(new int[]{50,-90,-38,-46,-10,-22,-66,72,-52,38,90,34,-12,-44,-6,0,-20,-38,86,26,64,-24,40,90,-26,-2,-28,12,22,-14});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{69,28,68,98,24,67,86,2,18,22,44,77,52,62,24,46});
param0.add(new int[]{-96,-94,-88,-84,-68,-60,-52,-52,-42,-34,-32,-16,-12,-6,-6,-4,-2,0,16,18,38,58,70,72,76,78,90,92,98});
param0.add(new int[]{0,1,1,0,0,1,0,1,1,1,0,0,0,0,1,0,1,1,1,1,1,1,0,0,1,0,0});
param0.add(new int[]{1,6,7,9,10,11,19,19,22,22,26,34,36,37,37,38,39,40,49,54,60,62,65,67,71,76,78,79,82,82,89,95,97});
param0.add(new int[]{76,-32,-98,-18,-80,74,-22,-82,40,-64,58,-18,-64,34,-44,-82,-46,62,-80,-76,32,44,-32,98,-26,62,16,86,-52,-72,-90,-30,6});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{81,69,15,52,49,54,18,92,33,21,91,21,5,25,77,92,26,58,72,55,76,18,13,59,9,12,31,24,36,33,71,87,55,19,42,25});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(26);
param1.add(11);
param1.add(15);
param1.add(22);
param1.add(24);
param1.add(22);
param1.add(28);
param1.add(28);
param1.add(35);
List<Integer> param2 = new ArrayList<>();
param2.add(7);
param2.add(28);
param2.add(9);
param2.add(11);
param2.add(27);
param2.add(15);
param2.add(26);
param2.add(31);
param2.add(29);
param2.add(19);
List<Integer> param3 = new ArrayList<>();
param3.add(6);
param3.add(23);
param3.add(18);
param3.add(13);
param3.add(20);
param3.add(26);
param3.add(25);
param3.add(24);
param3.add(30);
param3.add(33);
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());
}
} | 5,682 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1{
static int f_gold ( int n ) {
int sum ;
for ( sum = 0 ;
n > 0 ;
sum += n % 10 , n /= 10 ) ;
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(50);
param0.add(92);
param0.add(49);
param0.add(94);
param0.add(7);
param0.add(30);
param0.add(88);
param0.add(98);
param0.add(94);
param0.add(23);
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());
}
} | 5,683 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/BREAK_NUMBER_THREE_PARTS_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BREAK_NUMBER_THREE_PARTS_1{
static long f_gold ( long n ) {
long count = 0 ;
count = ( n + 1 ) * ( n + 2 ) / 2 ;
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(71L);
param0.add(71L);
param0.add(36L);
param0.add(3L);
param0.add(97L);
param0.add(69L);
param0.add(15L);
param0.add(48L);
param0.add(77L);
param0.add(6L);
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());
}
} | 5,684 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3{
static int f_gold ( int n ) {
int odd_count = 0 ;
int even_count = 0 ;
if ( n < 0 ) n = - n ;
if ( n == 0 ) return 1 ;
if ( n == 1 ) return 0 ;
while ( n != 0 ) {
if ( ( n & 1 ) != 0 ) odd_count ++ ;
if ( ( n & 2 ) != 0 ) even_count ++ ;
n = n >> 2 ;
}
return f_gold ( Math . abs ( odd_count - even_count ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(94);
param0.add(94);
param0.add(79);
param0.add(39);
param0.add(16);
param0.add(90);
param0.add(64);
param0.add(76);
param0.add(83);
param0.add(47);
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());
}
} | 5,685 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/BINARY_REPRESENTATION_OF_NEXT_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BINARY_REPRESENTATION_OF_NEXT_NUMBER{
static String f_gold ( String num ) {
int l = num . length ( ) ;
int i ;
for ( i = l - 1 ;
i >= 0 ;
i -- ) {
if ( num . charAt ( i ) == '0' ) {
num = num . substring ( 0 , i ) + '1' + num . substring ( i + 1 ) ;
break ;
}
else {
num = num . substring ( 0 , i ) + '0' + num . substring ( i + 1 ) ;
}
}
if ( i < 0 ) {
num = "1" + num ;
}
return num ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("DXh");
param0.add("48703586411816");
param0.add("0001");
param0.add("yWg WvjNKS");
param0.add("8408568459");
param0.add("01");
param0.add("DFECZ CWtN");
param0.add("37742236");
param0.add("001101");
param0.add("LDxERLmYn");
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());
}
} | 5,686 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD{
public static boolean f_gold ( int n ) {
return ( n % 2 == 0 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(90);
param0.add(55);
param0.add(90);
param0.add(83);
param0.add(32);
param0.add(58);
param0.add(38);
param0.add(87);
param0.add(87);
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());
}
} | 5,687 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER{
static int f_gold ( int n ) {
return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(58);
param0.add(42);
param0.add(76);
param0.add(16);
param0.add(49);
param0.add(60);
param0.add(99);
param0.add(45);
param0.add(6);
param0.add(70);
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());
}
} | 5,688 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/UGLY_NUMBERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class UGLY_NUMBERS{
static int f_gold ( int n ) {
int ugly [ ] = new int [ n ] ;
int i2 = 0 , i3 = 0 , i5 = 0 ;
int next_multiple_of_2 = 2 ;
int next_multiple_of_3 = 3 ;
int next_multiple_of_5 = 5 ;
int next_ugly_no = 1 ;
ugly [ 0 ] = 1 ;
for ( int i = 1 ;
i < n ;
i ++ ) {
next_ugly_no = Math . min ( next_multiple_of_2 , Math . min ( next_multiple_of_3 , next_multiple_of_5 ) ) ;
ugly [ i ] = next_ugly_no ;
if ( next_ugly_no == next_multiple_of_2 ) {
i2 = i2 + 1 ;
next_multiple_of_2 = ugly [ i2 ] * 2 ;
}
if ( next_ugly_no == next_multiple_of_3 ) {
i3 = i3 + 1 ;
next_multiple_of_3 = ugly [ i3 ] * 3 ;
}
if ( next_ugly_no == next_multiple_of_5 ) {
i5 = i5 + 1 ;
next_multiple_of_5 = ugly [ i5 ] * 5 ;
}
}
return next_ugly_no ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(27);
param0.add(64);
param0.add(93);
param0.add(90);
param0.add(85);
param0.add(86);
param0.add(72);
param0.add(86);
param0.add(32);
param0.add(1);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,689 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/UNIQUE_CELLS_BINARY_MATRIX.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class UNIQUE_CELLS_BINARY_MATRIX{
static int f_gold ( int mat [ ] [ ] , int n , int m ) {
int [ ] rowsum = new int [ n ] ;
int [ ] colsum = new int [ m ] ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = 0 ;
j < m ;
j ++ ) if ( mat [ i ] [ j ] != 0 ) {
rowsum [ i ] ++ ;
colsum [ j ] ++ ;
}
int uniquecount = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = 0 ;
j < m ;
j ++ ) if ( mat [ i ] [ j ] != 0 && rowsum [ i ] == 1 && colsum [ j ] == 1 ) uniquecount ++ ;
return uniquecount ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{ new int[] {0, 1, 0, 0}, new int[] {0, 0, 1, 0}, new int[] {1, 0, 0, 1}});
param0.add(new int[][]{ new int[] {0, 1, 0, 0}, new int[] {0, 0, 1, 1}, new int[] {1, 0, 1, 1}});
param0.add(new int[][]{ new int[] {0, 1, 0, 0}, new int[] {0, 0, 1, 0}, new int[] {1, 1, 0, 1}});
param0.add(new int[][]{ new int[] {1, 1, 1, 1}, new int[] {0, 0, 1, 0}, new int[] {1, 0, 0, 1}});
param0.add(new int[][]{ new int[] {0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 33, 13, 43, 21, 83, 34, 30, 20, 82, 85, 36}, new int[]{7, 69, 9, 45, 18, 47, 1, 78, 72, 53, 37, 20, 95, 71, 58, 41, 38, 44, 15, 35, 81, 27, 21, 40, 44, 90, 44, 5, 97, 49}, new int[]{69, 92, 21, 8, 66, 37, 14, 34, 60, 61, 46, 21, 91, 18, 61, 69, 34, 82, 54, 99, 90, 29, 41, 92, 70, 90, 58, 82, 30, 33}, new int[]{63, 96, 90, 86, 34, 49, 12, 22, 85, 24, 56, 25, 66, 1, 74, 34, 5, 17, 1, 78, 21, 6, 75, 39, 59, 20, 84, 85, 64, 24}, new int[]{41, 90, 67, 38, 38, 28, 10, 24, 62, 52, 71, 87, 87, 24, 95, 50, 86, 91, 38, 69, 18, 72, 99, 49, 17, 76, 86, 53, 6, 94}, new int[]{66, 5, 2, 62, 99, 5, 31, 81, 63, 91, 95, 74, 76, 18, 77, 57, 72, 99, 62, 4, 62, 46, 71, 21, 60, 45, 79, 98, 22, 65}, new int[]{6, 65, 83, 27, 10, 55, 78, 34, 41, 32, 67, 51, 80, 39, 97, 5, 58, 99, 17, 23, 90, 46, 7, 62, 7, 15, 30, 20, 67, 86}, new int[]{54, 50, 71, 95, 49, 50, 3, 64, 46, 81, 22, 52, 37, 60, 67, 48, 30, 88, 97, 43, 10, 71, 80, 96, 2, 72, 79, 67, 84, 98}, new int[]{46, 41, 4, 87, 8, 10, 5, 74, 90, 80, 59, 58, 23, 61, 17, 28, 18, 52, 58, 41, 75, 98, 79, 1, 97, 73, 17, 79, 4, 46}, new int[]{70, 6, 83, 23, 94, 1, 73, 61, 22, 65, 57, 36, 25, 16, 26, 92, 5, 22, 14, 73, 78, 80, 94, 96, 70, 17, 1, 18, 75, 11}, new int[]{92, 12, 34, 80, 74, 8, 90, 42, 14, 51, 9, 83, 98, 38, 29, 29, 28, 88, 92, 76, 83, 6, 2, 53, 31, 37, 56, 93, 40, 12}, new int[]{55, 97, 57, 45, 25, 42, 18, 30, 18, 7, 79, 30, 5, 69, 33, 6, 48, 4, 13, 26, 49, 20, 32, 96, 65, 89, 89, 53, 65, 3}, new int[]{21, 43, 25, 85, 67, 93, 35, 86, 23, 13, 98, 23, 63, 99, 83, 15, 79, 26, 67, 81, 94, 61, 28, 34, 16, 43, 11, 24, 87, 25}, new int[]{77, 19, 34, 66, 72, 5, 75, 66, 54, 96, 24, 76, 80, 51, 24, 50, 54, 17, 96, 84, 35, 30, 47, 42, 22, 31, 51, 37, 88, 88}, new int[]{13, 89, 31, 14, 84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27, 23, 35, 13, 26, 78, 35, 41, 6, 72, 52, 53, 79}, new int[]{8, 47, 80, 93, 64, 34, 29, 35, 48, 74, 65, 69, 67, 14, 46, 27, 46, 29, 1, 82, 3, 26, 21, 24, 45, 84, 29, 18, 3, 51}, new int[]{97, 18, 37, 63, 85, 19, 23, 84, 55, 24, 83, 26, 97, 96, 54, 99, 89, 33, 88, 57, 9, 64, 75, 85, 59, 81, 16, 5, 44, 46}, new int[]{10, 77, 58, 70, 64, 80, 70, 93, 60, 25, 87, 11, 93, 85, 63, 26, 41, 53, 75, 24, 81, 73, 72, 94, 7, 87, 73, 83, 64, 72}, new int[]{46, 78, 51, 92, 99, 71, 6, 30, 16, 57, 65, 61, 17, 63, 7, 35, 69, 91, 30, 44, 99, 80, 6, 80, 56, 8, 84, 95, 20, 73}, new int[]{30, 62, 77, 26, 66, 61, 61, 45, 46, 24, 77, 16, 82, 16, 66, 1, 74, 25, 14, 81, 82, 7, 21, 93, 91, 49, 4, 12, 22, 34}, new int[]{26, 28, 19, 31, 14, 87, 81, 23, 81, 8, 38, 10, 30, 7, 2, 22, 5, 67, 73, 69, 56, 20, 93, 70, 68, 57, 21, 17, 79, 27}, new int[]{39, 83, 67, 92, 86, 70, 95, 69, 13, 98, 50, 10, 56, 44, 28, 85, 37, 36, 56, 92, 77, 57, 36, 1, 43, 9, 84, 81, 67, 32}, new int[]{99, 70, 58, 52, 70, 89, 28, 65, 40, 80, 20, 88, 79, 10, 76, 62, 37, 99, 60, 91, 77, 94, 67, 52, 35, 62, 12, 29, 30, 22}, new int[]{81, 53, 91, 22, 60, 49, 49, 7, 46, 11, 16, 54, 57, 36, 51, 22, 37, 3, 35, 38, 55, 41, 38, 88, 34, 99, 11, 79, 14, 81}, new int[]{21, 28, 86, 60, 34, 65, 87, 96, 4, 56, 70, 80, 10, 35, 88, 10, 76, 63, 97, 91, 25, 74, 89, 32, 56, 26, 68, 73, 27, 73}, new int[]{90, 11, 53, 32, 59, 30, 9, 11, 87, 17, 96, 11, 57, 86, 50, 96, 73, 81, 53, 89, 80, 97, 66, 43, 39, 42, 76, 34, 25, 78}, new int[]{9, 94, 12, 10, 88, 34, 76, 26, 96, 35, 77, 83, 56, 77, 56, 86, 48, 23, 65, 8, 98, 13, 49, 10, 3, 28, 27, 85, 11, 88}, new int[]{12, 7, 42, 96, 10, 61, 64, 28, 26, 93, 91, 52, 74, 4, 22, 10, 4, 7, 63, 87, 67, 88, 30, 76, 21, 48, 17, 67, 79, 96}, new int[]{9, 40, 86, 96, 59, 69, 41, 68, 48, 61, 5, 7, 75, 6, 29, 51, 81, 28, 57, 63, 38, 83, 49, 12, 45, 83, 97, 45, 5, 65}, new int[]{35, 35, 31, 36, 40, 99, 40, 61, 12, 82, 92, 13, 30, 40, 17, 73, 22, 56, 62, 57, 15, 93, 54, 16, 84, 89, 24, 80, 80, 25}});
param0.add(new int[][]{ new int[] {0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 45, 59, 40, 83, 46, 59, 89, 37, 82, 68, 65, 97, 28, 41, 83, 97, 15, 87, 93, 39, 78, 94, 66, 77, 28, 31, 12, 13, 3}, new int[]{63, 29, 64, 94, 76, 85, 66, 50, 80, 96, 92, 73, 17, 56, 83, 7, 36, 40, 1, 42, 36, 39, 1, 88, 63, 74, 75, 86, 56, 31, 1, 41, 11, 6, 51, 64, 81, 78, 96, 20, 4, 39, 47, 22, 93, 42, 77, 79}, new int[]{35, 25, 3, 51, 12, 14, 40, 32, 50, 68, 29, 31, 96, 24, 11, 30, 19, 36, 6, 2, 19, 46, 40, 18, 36, 46, 56, 52, 54, 56, 20, 1, 23, 38, 20, 4, 69, 6, 63, 90, 1, 63, 79, 80, 87, 86, 54, 69}, new int[]{43, 5, 70, 66, 10, 36, 35, 45, 23, 62, 47, 16, 37, 42, 35, 40, 16, 69, 11, 51, 93, 75, 80, 89, 50, 67, 67, 65, 12, 7, 43, 46, 96, 22, 76, 6, 38, 39, 60, 85, 62, 92, 96, 27, 49, 15, 33, 96}, new int[]{46, 98, 71, 13, 53, 39, 50, 70, 60, 9, 4, 94, 92, 21, 12, 77, 50, 13, 52, 91, 92, 82, 80, 21, 55, 10, 78, 92, 29, 11, 30, 40, 91, 49, 3, 1, 32, 39, 85, 2, 74, 31, 18, 7, 5, 29, 68, 46}, new int[]{56, 3, 13, 67, 72, 50, 4, 42, 99, 76, 24, 19, 99, 82, 40, 34, 89, 7, 75, 38, 19, 99, 45, 20, 91, 95, 89, 2, 93, 37, 31, 42, 6, 85, 97, 9, 74, 86, 95, 53, 11, 83, 76, 16, 13, 38, 13, 15}, new int[]{18, 16, 41, 50, 69, 91, 66, 41, 27, 59, 65, 14, 35, 23, 22, 27, 50, 25, 98, 54, 49, 91, 99, 85, 3, 25, 68, 57, 15, 67, 11, 92, 3, 18, 53, 9, 79, 72, 40, 56, 14, 61, 13, 47, 74, 94, 5, 86}, new int[]{99, 5, 12, 35, 85, 26, 1, 10, 38, 24, 95, 47, 87, 85, 2, 95, 2, 30, 25, 83, 62, 1, 92, 63, 84, 59, 54, 69, 55, 94, 87, 42, 91, 53, 65, 9, 71, 51, 90, 16, 53, 70, 62, 37, 61, 57, 45, 76}, new int[]{88, 17, 2, 95, 37, 54, 42, 29, 65, 78, 40, 11, 58, 96, 20, 66, 31, 5, 96, 50, 9, 41, 10, 53, 49, 26, 67, 36, 23, 94, 39, 59, 23, 23, 43, 25, 84, 60, 33, 33, 65, 47, 33, 38, 24, 73, 95, 49}, new int[]{92, 87, 30, 82, 58, 90, 97, 59, 16, 93, 16, 33, 39, 46, 38, 23, 26, 49, 81, 24, 83, 42, 27, 2, 8, 79, 41, 13, 91, 22, 47, 47, 65, 69, 29, 79, 30, 46, 6, 6, 87, 52, 5, 86, 41, 20, 20, 39}, new int[]{30, 48, 81, 60, 23, 60, 50, 13, 74, 38, 39, 68, 19, 52, 41, 92, 27, 23, 19, 80, 35, 5, 88, 5, 93, 6, 41, 41, 54, 44, 48, 37, 93, 56, 33, 91, 35, 6, 46, 74, 36, 44, 7, 7, 29, 80, 65, 60}, new int[]{35, 57, 29, 38, 77, 12, 87, 80, 58, 78, 80, 6, 36, 52, 88, 27, 25, 40, 36, 60, 29, 95, 3, 13, 68, 11, 48, 79, 60, 2, 79, 70, 13, 35, 51, 56, 40, 77, 59, 12, 16, 53, 41, 20, 40, 61, 77, 34}, new int[]{19, 45, 91, 29, 19, 56, 27, 2, 40, 65, 78, 8, 27, 97, 95, 30, 25, 49, 56, 65, 31, 99, 60, 85, 34, 17, 73, 29, 72, 83, 6, 88, 6, 3, 95, 31, 76, 52, 8, 90, 26, 15, 77, 56, 86, 62, 13, 46}, new int[]{54, 9, 88, 3, 23, 12, 41, 44, 58, 11, 19, 59, 73, 37, 10, 73, 33, 77, 20, 44, 75, 93, 13, 63, 14, 73, 54, 42, 38, 83, 72, 82, 98, 36, 9, 80, 5, 15, 24, 64, 48, 43, 39, 25, 80, 86, 80, 97}, new int[]{5, 60, 7, 18, 6, 12, 33, 98, 21, 58, 82, 78, 42, 94, 46, 3, 57, 53, 62, 13, 51, 19, 59, 62, 37, 77, 15, 90, 70, 91, 12, 89, 50, 47, 16, 16, 67, 34, 88, 46, 87, 64, 94, 49, 21, 53, 62, 81}, new int[]{54, 82, 3, 53, 12, 80, 38, 78, 91, 18, 84, 35, 81, 84, 70, 90, 71, 76, 17, 21, 70, 47, 37, 89, 54, 15, 11, 9, 68, 3, 13, 96, 6, 1, 5, 66, 86, 96, 41, 50, 7, 21, 81, 53, 20, 65, 32, 96}, new int[]{84, 74, 6, 41, 33, 74, 25, 24, 95, 93, 12, 37, 50, 9, 93, 67, 4, 54, 85, 6, 66, 37, 84, 45, 97, 14, 84, 43, 66, 7, 55, 37, 76, 16, 17, 95, 71, 90, 1, 2, 95, 84, 33, 13, 65, 51, 33, 3}, new int[]{60, 83, 44, 96, 5, 47, 43, 47, 6, 60, 36, 37, 77, 76, 6, 30, 92, 10, 28, 6, 73, 24, 52, 82, 68, 45, 87, 27, 68, 13, 75, 75, 19, 33, 78, 13, 7, 33, 32, 45, 56, 72, 46, 98, 19, 34, 63, 70}, new int[]{54, 55, 50, 65, 45, 30, 79, 73, 61, 93, 59, 2, 30, 46, 68, 19, 84, 5, 73, 84, 57, 63, 52, 59, 60, 80, 84, 20, 90, 33, 12, 21, 56, 23, 20, 87, 49, 47, 70, 45, 76, 35, 72, 27, 80, 47, 32, 29}, new int[]{71, 80, 53, 93, 56, 89, 43, 4, 64, 91, 87, 23, 60, 30, 43, 88, 48, 80, 7, 87, 31, 19, 52, 68, 6, 83, 60, 91, 93, 12, 38, 13, 28, 5, 46, 46, 81, 27, 26, 62, 68, 72, 90, 97, 12, 77, 85, 52}, new int[]{37, 25, 39, 67, 19, 71, 81, 77, 24, 51, 45, 8, 72, 45, 2, 30, 67, 45, 26, 17, 38, 67, 57, 33, 94, 79, 72, 94, 64, 23, 12, 8, 73, 72, 38, 33, 48, 97, 45, 75, 23, 43, 25, 15, 10, 20, 16, 99}, new int[]{98, 85, 57, 46, 1, 25, 56, 46, 59, 62, 78, 61, 83, 8, 41, 15, 44, 82, 1, 97, 65, 34, 4, 81, 2, 39, 54, 10, 42, 45, 26, 27, 39, 25, 29, 82, 22, 90, 60, 90, 52, 85, 21, 8, 66, 98, 76, 18}, new int[]{81, 15, 3, 85, 83, 59, 55, 32, 11, 82, 53, 29, 67, 4, 92, 9, 57, 38, 7, 65, 35, 47, 34, 63, 9, 90, 72, 19, 26, 46, 56, 10, 43, 30, 40, 55, 58, 31, 72, 47, 77, 37, 94, 57, 79, 57, 99, 3}, new int[]{29, 88, 45, 87, 73, 2, 15, 96, 18, 29, 40, 3, 97, 58, 71, 94, 91, 38, 29, 31, 65, 43, 27, 27, 93, 69, 3, 29, 13, 97, 60, 84, 67, 70, 81, 47, 68, 97, 33, 6, 64, 78, 71, 70, 51, 67, 22, 72}, new int[]{24, 77, 77, 65, 53, 41, 32, 69, 71, 45, 32, 28, 97, 14, 13, 93, 50, 40, 1, 47, 91, 30, 34, 46, 1, 34, 59, 7, 65, 42, 82, 99, 19, 13, 23, 66, 3, 86, 36, 49, 72, 87, 72, 57, 89, 99, 64, 11}, new int[]{41, 6, 45, 81, 57, 82, 33, 61, 18, 7, 29, 69, 16, 95, 69, 74, 29, 29, 16, 4, 65, 72, 92, 1, 92, 3, 64, 66, 89, 57, 75, 18, 39, 84, 81, 7, 55, 17, 68, 36, 94, 1, 35, 76, 17, 80, 28, 32}, new int[]{55, 35, 19, 93, 93, 80, 4, 21, 44, 62, 1, 83, 51, 90, 76, 17, 37, 92, 36, 29, 69, 3, 15, 67, 77, 69, 21, 23, 47, 86, 34, 41, 90, 47, 31, 35, 7, 45, 57, 96, 22, 70, 21, 49, 47, 27, 10, 86}, new int[]{44, 51, 18, 68, 99, 38, 36, 60, 68, 74, 96, 74, 45, 74, 75, 9, 13, 57, 82, 57, 37, 47, 11, 28, 6, 33, 14, 47, 29, 15, 56, 69, 86, 31, 19, 18, 58, 70, 73, 30, 95, 35, 17, 16, 97, 68, 95, 33}, new int[]{36, 11, 60, 4, 63, 5, 64, 85, 77, 4, 35, 26, 26, 19, 37, 11, 66, 31, 18, 75, 44, 16, 58, 2, 59, 96, 48, 86, 36, 8, 36, 25, 40, 95, 4, 43, 74, 27, 38, 81, 38, 64, 89, 17, 13, 85, 79, 24}, new int[]{7, 64, 63, 22, 53, 74, 97, 12, 72, 22, 39, 47, 64, 44, 16, 59, 34, 46, 80, 78, 70, 55, 74, 24, 27, 73, 16, 2, 31, 63, 47, 19, 56, 11, 86, 93, 95, 8, 74, 6, 31, 99, 50, 29, 21, 41, 69, 69}, new int[]{88, 79, 56, 28, 34, 56, 77, 55, 44, 32, 86, 29, 3, 69, 11, 48, 53, 56, 53, 26, 9, 75, 65, 56, 28, 23, 31, 66, 61, 82, 16, 59, 81, 48, 17, 35, 95, 99, 59, 88, 41, 37, 30, 82, 91, 16, 84, 47}, new int[]{28, 21, 41, 45, 97, 73, 64, 88, 13, 94, 43, 97, 58, 88, 20, 63, 1, 23, 33, 57, 81, 54, 66, 95, 31, 54, 16, 37, 7, 1, 94, 18, 42, 39, 26, 75, 65, 57, 69, 86, 77, 17, 7, 71, 12, 38, 87, 48}, new int[]{55, 54, 72, 15, 30, 55, 73, 21, 60, 78, 8, 47, 36, 73, 26, 84, 70, 34, 60, 23, 97, 85, 41, 90, 69, 55, 73, 45, 61, 33, 89, 52, 81, 19, 75, 8, 70, 6, 72, 57, 88, 60, 19, 52, 41, 91, 84, 88}, new int[]{38, 69, 16, 39, 97, 74, 51, 5, 83, 62, 41, 85, 67, 59, 92, 19, 80, 62, 53, 66, 8, 46, 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}, new int[]{26, 9, 36, 15, 24, 40, 2, 4, 95, 20, 39, 45, 26, 60, 69, 68, 86, 70, 31, 69, 7, 69, 4, 91, 73, 37, 2, 49, 83, 17, 17, 40, 51, 88, 77, 28, 46, 78, 87, 87, 74, 49, 17, 27, 62, 11, 83, 44}, new int[]{91, 36, 16, 60, 87, 97, 52, 22, 78, 77, 86, 71, 38, 65, 51, 97, 86, 23, 15, 79, 31, 28, 67, 42, 25, 33, 97, 23, 92, 53, 16, 37, 5, 11, 12, 21, 18, 14, 33, 21, 26, 89, 25, 35, 63, 20, 63, 66}, new int[]{12, 32, 97, 48, 95, 97, 59, 20, 37, 40, 61, 56, 14, 36, 76, 90, 34, 6, 46, 77, 22, 99, 83, 23, 64, 96, 44, 11, 68, 61, 76, 56, 51, 63, 30, 10, 88, 23, 1, 48, 4, 28, 44, 67, 2, 58, 6, 42}, new int[]{17, 37, 44, 23, 40, 85, 44, 31, 76, 93, 13, 90, 97, 98, 20, 47, 10, 65, 52, 63, 29, 54, 86, 50, 65, 44, 8, 9, 23, 84, 34, 16, 86, 62, 87, 65, 78, 52, 23, 38, 40, 8, 32, 40, 66, 48, 13, 27}, new int[]{46, 71, 3, 85, 61, 72, 65, 17, 26, 29, 72, 38, 51, 43, 72, 8, 25, 55, 45, 91, 86, 67, 57, 49, 54, 47, 64, 24, 62, 33, 99, 40, 29, 8, 75, 16, 33, 64, 11, 29, 49, 88, 66, 5, 88, 53, 44, 7}, new int[]{95, 94, 70, 69, 79, 27, 99, 54, 73, 23, 58, 17, 87, 46, 47, 93, 59, 45, 62, 54, 75, 13, 12, 2, 42, 54, 11, 78, 22, 85, 49, 37, 36, 89, 49, 58, 3, 66, 91, 33, 18, 48, 75, 71, 37, 50, 36, 27}, new int[]{22, 31, 40, 54, 64, 70, 53, 54, 54, 97, 71, 6, 64, 54, 65, 46, 42, 93, 75, 92, 56, 40, 15, 30, 23, 12, 92, 95, 30, 16, 30, 68, 33, 57, 97, 28, 85, 79, 26, 14, 57, 15, 66, 16, 37, 11, 11, 33}, new int[]{2, 33, 63, 3, 84, 33, 26, 34, 78, 52, 93, 66, 72, 27, 72, 71, 75, 94, 49, 47, 21, 21, 71, 84, 61, 14, 20, 5, 31, 62, 12, 56, 56, 12, 66, 26, 68, 30, 98, 20, 66, 35, 79, 51, 14, 55, 36, 53}, new int[]{54, 63, 94, 58, 27, 2, 85, 78, 91, 85, 23, 35, 62, 72, 59, 76, 64, 92, 41, 33, 97, 9, 79, 74, 49, 2, 3, 23, 74, 19, 18, 35, 54, 60, 9, 95, 94, 52, 50, 12, 17, 91, 85, 49, 48, 27, 14, 55}, new int[]{13, 3, 64, 88, 96, 72, 99, 23, 80, 73, 39, 58, 18, 54, 31, 64, 42, 37, 98, 70, 78, 88, 97, 42, 83, 29, 70, 3, 18, 85, 29, 52, 42, 52, 36, 95, 8, 96, 80, 86, 2, 51, 15, 17, 13, 54, 99, 25}, new int[]{74, 75, 33, 78, 98, 22, 44, 4, 26, 1, 10, 2, 29, 25, 87, 94, 60, 89, 13, 40, 34, 35, 79, 39, 42, 84, 86, 25, 14, 83, 86, 87, 1, 39, 30, 5, 94, 71, 62, 77, 31, 7, 29, 51, 89, 77, 79, 51}, new int[]{94, 71, 69, 14, 94, 23, 80, 88, 43, 56, 21, 30, 76, 40, 94, 22, 2, 23, 87, 86, 62, 30, 27, 98, 75, 93, 37, 70, 16, 20, 74, 46, 74, 25, 59, 86, 32, 17, 90, 80, 10, 17, 2, 66, 29, 4, 30, 61}, new int[]{58, 76, 34, 78, 24, 88, 82, 25, 89, 25, 92, 30, 55, 89, 24, 39, 77, 2, 34, 16, 48, 24, 50, 2, 93, 39, 81, 59, 23, 12, 77, 69, 15, 60, 64, 2, 70, 64, 36, 87, 13, 2, 5, 40, 80, 64, 39, 35}, new int[]{57, 41, 45, 34, 19, 90, 42, 17, 35, 76, 35, 6, 52, 74, 43, 23, 83, 43, 53, 72, 73, 67, 97, 66, 34, 35, 82, 27, 27, 64, 39, 60, 81, 73, 96, 23, 78, 11, 4, 51, 38, 51, 48, 80, 36, 25, 5, 74}});
param0.add(new int[][]{ new int[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0}, new int[]{69, 62, 79, 46, 48, 38, 61, 81, 17, 48, 33, 18, 36, 54, 3, 89, 99, 20}, new int[]{31, 21, 34, 57, 37, 1, 57, 55, 31, 23, 75, 48, 20, 7, 99, 2, 97, 40}, new int[]{24, 74, 9, 43, 97, 51, 85, 78, 50, 87, 76, 22, 92, 91, 10, 82, 88, 67}, new int[]{4, 30, 85, 22, 92, 73, 41, 16, 56, 69, 14, 52, 14, 47, 16, 43, 68, 37}, new int[]{14, 41, 87, 73, 24, 75, 92, 19, 83, 12, 47, 98, 12, 3, 30, 58, 46, 51}, new int[]{99, 15, 43, 22, 9, 92, 93, 39, 81, 68, 57, 68, 7, 2, 54, 37, 74, 82}, new int[]{28, 59, 46, 63, 35, 99, 94, 85, 58, 89, 13, 71, 6, 84, 45, 5, 38, 44}, new int[]{25, 82, 88, 15, 72, 77, 39, 48, 52, 60, 89, 23, 69, 52, 86, 22, 25, 55}, new int[]{64, 65, 4, 52, 32, 53, 26, 79, 35, 91, 14, 34, 60, 25, 54, 27, 21, 48}, new int[]{35, 52, 70, 99, 26, 15, 5, 90, 33, 25, 81, 52, 44, 20, 56, 66, 8, 83}, new int[]{64, 29, 48, 19, 9, 72, 15, 98, 68, 63, 91, 38, 47, 13, 96, 99, 46, 36}, new int[]{10, 55, 23, 23, 68, 44, 5, 4, 30, 52, 97, 13, 18, 32, 33, 58, 62, 71}, new int[]{14, 14, 10, 59, 39, 46, 18, 19, 37, 3, 55, 7, 71, 52, 54, 38, 63, 64}, new int[]{6, 74, 52, 44, 36, 37, 64, 48, 27, 65, 1, 48, 85, 37, 92, 49, 55, 39}, new int[]{36, 66, 66, 68, 2, 65, 18, 41, 98, 91, 39, 26, 75, 3, 49, 28, 16, 99}, new int[]{22, 80, 97, 77, 49, 28, 16, 64, 60, 66, 26, 42, 92, 3, 21, 32, 70, 69}, new int[]{24, 65, 23, 80, 8, 45, 89, 11, 57, 12, 72, 10, 63, 35, 38, 21, 51, 18}});
param0.add(new int[][]{ new int[] {0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 2, 93, 66, 82, 36, 56}, new int[]{21, 97, 63, 2, 74, 15, 62, 12, 3, 4, 9, 46, 42, 74, 31, 37, 11, 61, 27, 46, 70, 94, 43, 99, 45}, new int[]{18, 50, 6, 13, 12, 7, 14, 73, 99, 47, 7, 39, 56, 85, 19, 27, 61, 66, 52, 56, 14, 33, 12, 85, 94}, new int[]{86, 66, 93, 24, 96, 45, 76, 55, 71, 53, 66, 19, 51, 82, 98, 66, 45, 40, 83, 6, 51, 41, 47, 17, 23}, new int[]{40, 73, 37, 85, 58, 21, 27, 11, 39, 94, 63, 28, 84, 47, 47, 4, 61, 18, 50, 93, 36, 91, 1, 35, 5}, new int[]{6, 60, 5, 32, 39, 95, 40, 42, 74, 95, 8, 91, 29, 60, 78, 23, 4, 34, 38, 61, 27, 83, 31, 3, 93}, new int[]{77, 27, 43, 60, 96, 46, 37, 67, 6, 59, 3, 77, 11, 27, 2, 64, 44, 76, 55, 40, 76, 23, 64, 95, 57}, new int[]{10, 35, 6, 89, 95, 54, 94, 79, 67, 82, 56, 81, 60, 14, 46, 16, 27, 37, 97, 61, 20, 25, 50, 58, 78}, new int[]{37, 5, 54, 37, 74, 10, 9, 78, 33, 93, 24, 70, 57, 26, 39, 44, 64, 48, 67, 48, 40, 46, 96, 90, 3}, new int[]{76, 14, 83, 4, 12, 99, 23, 3, 3, 42, 80, 77, 19, 28, 38, 9, 56, 17, 7, 72, 76, 54, 28, 66, 28}, new int[]{25, 91, 99, 79, 49, 48, 99, 47, 62, 33, 42, 87, 27, 8, 62, 38, 4, 54, 48, 69, 16, 61, 18, 45, 18}, new int[]{8, 29, 21, 54, 91, 47, 66, 68, 48, 76, 80, 89, 23, 17, 61, 52, 42, 51, 1, 21, 57, 36, 2, 23, 60}, new int[]{59, 66, 43, 59, 74, 73, 93, 90, 36, 60, 93, 4, 21, 97, 95, 92, 97, 4, 4, 33, 14, 9, 88, 64, 62}, new int[]{89, 7, 92, 5, 13, 2, 84, 12, 91, 7, 34, 21, 60, 82, 10, 38, 58, 56, 44, 85, 80, 64, 20, 50, 54}, new int[]{46, 40, 24, 85, 58, 31, 50, 10, 84, 14, 19, 30, 57, 16, 22, 54, 84, 70, 43, 97, 19, 5, 71, 98, 20}, new int[]{15, 38, 1, 5, 98, 54, 85, 61, 78, 17, 76, 27, 70, 25, 91, 45, 2, 22, 96, 54, 17, 61, 66, 26, 56}, new int[]{33, 1, 40, 43, 44, 62, 36, 56, 39, 89, 13, 39, 12, 21, 87, 18, 13, 19, 35, 46, 57, 34, 62, 56, 1}, new int[]{57, 86, 28, 4, 71, 75, 76, 40, 53, 39, 35, 98, 82, 10, 51, 64, 79, 59, 26, 3, 77, 98, 17, 65, 78}, new int[]{1, 88, 57, 11, 67, 77, 55, 86, 41, 59, 30, 25, 71, 64, 89, 25, 66, 34, 55, 58, 86, 54, 1, 18, 16}, new int[]{56, 74, 31, 48, 77, 34, 34, 60, 76, 37, 40, 17, 41, 56, 54, 79, 13, 46, 72, 17, 11, 40, 46, 65, 32}, new int[]{52, 10, 59, 15, 3, 9, 8, 74, 8, 16, 11, 23, 56, 56, 22, 18, 39, 3, 8, 5, 91, 5, 19, 81, 61}, new int[]{46, 18, 61, 60, 2, 50, 63, 71, 49, 80, 71, 18, 90, 93, 16, 46, 94, 25, 8, 64, 14, 22, 78, 91, 35}, new int[]{51, 76, 43, 85, 75, 3, 73, 55, 19, 42, 61, 23, 80, 4, 96, 65, 4, 59, 90, 91, 80, 30, 33, 80, 33}, new int[]{20, 95, 48, 27, 32, 86, 27, 25, 66, 87, 12, 46, 48, 85, 75, 85, 37, 4, 90, 84, 61, 71, 47, 91, 47}, new int[]{17, 32, 10, 50, 75, 59, 18, 66, 35, 6, 3, 71, 35, 77, 66, 66, 51, 72, 73, 34, 39, 95, 93, 49, 47}});
param0.add(new int[][]{ new int[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 83, 85, 49, 74}, new int[]{4, 62, 18, 60, 64, 20, 52, 36, 62, 48, 96, 57, 57, 91, 41, 88, 93, 53, 88, 62, 29, 39, 82}, new int[]{10, 61, 56, 9, 50, 75, 12, 2, 90, 73, 17, 35, 46, 67, 70, 87, 35, 79, 72, 96, 34, 11, 3}, new int[]{93, 10, 82, 82, 12, 91, 51, 83, 97, 89, 59, 2, 2, 5, 22, 33, 69, 28, 58, 14, 50, 74, 41}, new int[]{15, 74, 68, 43, 55, 49, 18, 81, 95, 97, 25, 12, 55, 47, 85, 81, 84, 93, 67, 71, 64, 60, 97}, new int[]{90, 84, 43, 37, 32, 99, 85, 52, 53, 56, 72, 2, 48, 16, 91, 36, 10, 92, 81, 89, 79, 18, 92}, new int[]{2, 40, 42, 95, 95, 25, 1, 82, 16, 42, 37, 37, 71, 6, 78, 22, 95, 74, 46, 40, 54, 46, 36}, new int[]{41, 98, 67, 23, 43, 61, 17, 93, 65, 3, 78, 75, 30, 21, 16, 62, 60, 9, 66, 26, 67, 15, 12}, new int[]{19, 14, 15, 87, 11, 63, 43, 67, 43, 1, 4, 85, 25, 84, 74, 82, 97, 53, 35, 25, 3, 51, 50}, new int[]{13, 35, 89, 55, 18, 51, 30, 40, 30, 58, 88, 90, 65, 97, 72, 12, 8, 75, 78, 18, 65, 85, 10}, new int[]{37, 29, 46, 88, 44, 36, 18, 79, 32, 20, 34, 73, 41, 98, 35, 57, 27, 18, 21, 18, 27, 95, 28}, new int[]{97, 15, 45, 47, 36, 19, 99, 96, 45, 57, 76, 29, 98, 16, 22, 72, 55, 12, 98, 16, 55, 47, 73}, new int[]{27, 99, 11, 83, 95, 15, 53, 91, 33, 71, 87, 22, 65, 58, 27, 75, 12, 60, 85, 72, 77, 33, 66}, new int[]{9, 77, 26, 45, 55, 52, 9, 79, 7, 57, 57, 37, 73, 78, 30, 51, 47, 84, 54, 23, 79, 58, 56}, new int[]{31, 68, 89, 62, 83, 60, 37, 34, 1, 41, 95, 44, 35, 27, 21, 72, 82, 23, 41, 93, 80, 50, 74}, new int[]{81, 22, 40, 2, 42, 30, 44, 83, 10, 84, 63, 24, 6, 45, 18, 16, 40, 16, 79, 70, 97, 13, 68}, new int[]{96, 50, 29, 58, 7, 97, 5, 40, 4, 7, 80, 37, 75, 59, 50, 69, 29, 55, 89, 67, 96, 30, 20}, new int[]{94, 67, 61, 44, 56, 79, 60, 41, 78, 40, 50, 10, 17, 15, 93, 53, 98, 99, 73, 51, 81, 66, 26}, new int[]{38, 92, 30, 55, 9, 92, 16, 24, 86, 20, 62, 52, 78, 52, 43, 96, 10, 66, 71, 65, 15, 75, 84}, new int[]{50, 41, 60, 33, 52, 38, 84, 64, 10, 96, 50, 63, 59, 12, 58, 89, 9, 49, 61, 81, 78, 88, 51}, new int[]{45, 67, 80, 18, 61, 50, 14, 10, 74, 6, 3, 86, 2, 76, 1, 52, 13, 32, 25, 38, 5, 18, 10}, new int[]{53, 83, 34, 30, 32, 11, 86, 30, 1, 6, 78, 56, 67, 58, 79, 95, 19, 61, 62, 86, 71, 91, 35}, new int[]{43, 5, 46, 35, 87, 36, 4, 61, 2, 35, 46, 4, 60, 48, 4, 70, 51, 17, 4, 86, 57, 85, 76}});
List<Integer> param1 = new ArrayList<>();
param1.add(3);
param1.add(2);
param1.add(3);
param1.add(3);
param1.add(3);
param1.add(1);
param1.add(1);
param1.add(10);
param1.add(15);
param1.add(17);
List<Integer> param2 = new ArrayList<>();
param2.add(4);
param2.add(2);
param2.add(4);
param2.add(4);
param2.add(3);
param2.add(28);
param2.add(32);
param2.add(12);
param2.add(17);
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());
}
} | 5,690 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1{
static int f_gold ( char digits [ ] , int n ) {
int count [ ] = new int [ n + 1 ] ;
count [ 0 ] = 1 ;
count [ 1 ] = 1 ;
if ( digits [ 0 ] == '0' ) return 0 ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
count [ i ] = 0 ;
if ( digits [ i - 1 ] > '0' ) count [ i ] = count [ i - 1 ] ;
if ( digits [ i - 2 ] == '1' || ( digits [ i - 2 ] == '2' && digits [ i - 1 ] < '7' ) ) count [ i ] += count [ i - 2 ] ;
}
return count [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<char [ ]> param0 = new ArrayList<>();
param0.add(new char[]{'B','C','E','E','F','F','G','J','K','K','L','L','M','O','O','P','Q','R','V','X','Z','a','a','a','c','c','c','d','e','g','g','k','k','k','l','m','m','n','p','t','y','z'});
param0.add(new char[]{'0','9','5','0','2','6','5','4','4','5','2','6','8','2','0','3','1','9','0','1','5'});
param0.add(new char[]{'0','0','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 char[]{'x','a','R','O','S','r','g','e','Y','Z','t'});
param0.add(new char[]{'0','1','1','1','2','2','2','2','2','2','2','3','3','4','4','5','5','5','5','5','6','6','7','7','7','7','8','8'});
param0.add(new char[]{'1','1','1','1','1','1'});
param0.add(new char[]{' ',' ',' ','B','B','C','D','F','H','I','J','K','L','O','P','V','W','W','Z','Z','a','c','h','i','q','s','x'});
param0.add(new char[]{'0','9','1','5','2','4','9','3'});
param0.add(new char[]{'0','0','0','1','1','1'});
param0.add(new char[]{'w','t','U','R','a','c','G'});
List<Integer> param1 = new ArrayList<>();
param1.add(31);
param1.add(13);
param1.add(19);
param1.add(5);
param1.add(21);
param1.add(4);
param1.add(26);
param1.add(5);
param1.add(4);
param1.add(5);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,691 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PERFECT_REVERSIBLE_STRING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PERFECT_REVERSIBLE_STRING{
static boolean f_gold ( String str ) {
int i = 0 , j = str . length ( ) - 1 ;
while ( i < j ) {
if ( str . charAt ( i ) != str . charAt ( j ) ) return false ;
i ++ ;
j -- ;
}
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ab");
param0.add("303");
param0.add("11110000");
param0.add("aba");
param0.add("404");
param0.add("10101");
param0.add("abab");
param0.add("6366");
param0.add("001");
param0.add("");
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());
}
} | 5,692 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2{
static boolean f_gold ( int n ) {
return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ( n & 0xAAAAAAAA ) == 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(97);
param0.add(86);
param0.add(14);
param0.add(99);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,693 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE{
static int f_gold ( int arr [ ] , int n ) {
int brr [ ] = new int [ 2 * n + 1 ] ;
for ( int i = 0 ;
i < n ;
i ++ ) brr [ i ] = arr [ i ] ;
for ( int i = 0 ;
i < n ;
i ++ ) brr [ n + i ] = arr [ i ] ;
int maxHam = 0 ;
for ( int i = 1 ;
i < n ;
i ++ ) {
int currHam = 0 ;
for ( int j = i , k = 0 ;
j < ( i + n ) ;
j ++ , k ++ ) if ( brr [ j ] != arr [ k ] ) currHam ++ ;
if ( currHam == n ) return n ;
maxHam = Math . max ( maxHam , currHam ) ;
}
return maxHam ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,4,18,22,28,34,35,39,44,45,67,73,75,79,81,83,89,93,96});
param0.add(new int[]{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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{24});
param0.add(new int[]{-68,14,36,62});
param0.add(new int[]{1,0,1,1,1,1,1,0,0,0,1,0,0,0,1,1,0,1,0,1,1,0,1,0,0});
param0.add(new int[]{7,10,19,22,24,28,29,39,46,55,62,66,68,73,74,76,83,84,85,99});
param0.add(new int[]{-38,56,86,12,24,-90,-20,-46,38,92,-44,-74,54,50,46,50,-94,64,32,-84,70});
param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1});
param0.add(new int[]{61,89,8});
List<Integer> param1 = new ArrayList<>();
param1.add(12);
param1.add(1);
param1.add(21);
param1.add(0);
param1.add(2);
param1.add(12);
param1.add(15);
param1.add(14);
param1.add(8);
param1.add(2);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,694 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/STOOGE_SORT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class STOOGE_SORT{
static void f_gold ( int arr [ ] , int l , int h ) {
if ( l >= h ) return ;
if ( arr [ l ] > arr [ h ] ) {
int t = arr [ l ] ;
arr [ l ] = arr [ h ] ;
arr [ h ] = t ;
}
if ( h - l + 1 > 2 ) {
int t = ( h - l + 1 ) / 3 ;
f_gold ( arr , l , h - t ) ;
f_gold ( arr , l + t , h ) ;
f_gold ( arr , l , h - t ) ;
}
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,25,42,52,53,54,58,66,67,70});
param0.add(new int[]{-13,-98,50,-63,48,3,-76,12,-35,93,29,17,16,5,-97,-54,-45,-25});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{7,49,26,33,48,79,2,71,32,4,20,36});
param0.add(new int[]{88});
param0.add(new int[]{1,1,1,1,0,0,0,1,1,0,0,0,1,0,1,1,0,0,1,0,0,1,1,1,1,1,0,1,1,1,0,1,1,1,0});
param0.add(new int[]{2,2,4,5,7,12,12,14,14,16,17,29,29,31,32,39,41,47,48,49,51,54,58,58,59,60,73,78,80,81,82,83,84,85,90,95,97,99,99});
param0.add(new int[]{-31,-55,6,37,77,61,0,46,-91,-38,85,-71,25,14,53,43,34});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{77,68,78,97,92,52,37,8,44,98,5,69,31,45,9,32,33,67,30,76,29,3,90,57,30,9,26,2,62,3,46,68,25,51,13,44,35,55});
List<Integer> param1 = new ArrayList<>();
param1.add(6);
param1.add(16);
param1.add(28);
param1.add(9);
param1.add(0);
param1.add(20);
param1.add(28);
param1.add(15);
param1.add(12);
param1.add(27);
List<Integer> param2 = new ArrayList<>();
param2.add(6);
param2.add(14);
param2.add(24);
param2.add(10);
param2.add(0);
param2.add(28);
param2.add(29);
param2.add(11);
param2.add(17);
param2.add(20);
List<int [ ]> filled_function_param0 = new ArrayList<>();
filled_function_param0.add(new int[]{6,25,42,52,53,54,58,66,67,70});
filled_function_param0.add(new int[]{-13,-98,50,-63,48,3,-76,12,-35,93,29,17,16,5,-97,-54,-45,-25});
filled_function_param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{7,49,26,33,48,79,2,71,32,4,20,36});
filled_function_param0.add(new int[]{88});
filled_function_param0.add(new int[]{1,1,1,1,0,0,0,1,1,0,0,0,1,0,1,1,0,0,1,0,0,1,1,1,1,1,0,1,1,1,0,1,1,1,0});
filled_function_param0.add(new int[]{2,2,4,5,7,12,12,14,14,16,17,29,29,31,32,39,41,47,48,49,51,54,58,58,59,60,73,78,80,81,82,83,84,85,90,95,97,99,99});
filled_function_param0.add(new int[]{-31,-55,6,37,77,61,0,46,-91,-38,85,-71,25,14,53,43,34});
filled_function_param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
filled_function_param0.add(new int[]{77,68,78,97,92,52,37,8,44,98,5,69,31,45,9,32,33,67,30,76,29,3,90,57,30,9,26,2,62,3,46,68,25,51,13,44,35,55});
List<Integer> filled_function_param1 = new ArrayList<>();
filled_function_param1.add(6);
filled_function_param1.add(16);
filled_function_param1.add(28);
filled_function_param1.add(9);
filled_function_param1.add(0);
filled_function_param1.add(20);
filled_function_param1.add(28);
filled_function_param1.add(15);
filled_function_param1.add(12);
filled_function_param1.add(27);
List<Integer> filled_function_param2 = new ArrayList<>();
filled_function_param2.add(6);
filled_function_param2.add(14);
filled_function_param2.add(24);
filled_function_param2.add(10);
filled_function_param2.add(0);
filled_function_param2.add(28);
filled_function_param2.add(29);
filled_function_param2.add(11);
filled_function_param2.add(17);
filled_function_param2.add(20);
for(int i = 0; i < param0.size(); ++i)
{
f_filled(filled_function_param0.get(i),filled_function_param1.get(i),filled_function_param2.get(i));
f_gold(param0.get(i),param1.get(i),param2.get(i));
if(Arrays.equals(param0.get(i), filled_function_param0.get(i)) && param1.get(i) == filled_function_param1.get(i) && param2.get(i) == filled_function_param2.get(i))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,695 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_DIGITS_FACTORIAL_SET_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_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 ;
}
//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());
}
} | 5,696 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE{
static int f_gold ( int a ) {
return 4 * a ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(98);
param0.add(9);
param0.add(18);
param0.add(38);
param0.add(84);
param0.add(8);
param0.add(39);
param0.add(6);
param0.add(60);
param0.add(47);
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());
}
} | 5,697 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SPACE_OPTIMIZED_SOLUTION_LCS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SPACE_OPTIMIZED_SOLUTION_LCS{
public static int f_gold ( String X , String Y ) {
int m = X . length ( ) , n = Y . length ( ) ;
int L [ ] [ ] = new int [ 2 ] [ n + 1 ] ;
int bi = 0 ;
for ( int i = 0 ;
i <= m ;
i ++ ) {
bi = i & 1 ;
for ( int j = 0 ;
j <= n ;
j ++ ) {
if ( i == 0 || j == 0 ) L [ bi ] [ j ] = 0 ;
else if ( X . charAt ( i - 1 ) == Y . charAt ( j - 1 ) ) L [ bi ] [ j ] = L [ 1 - bi ] [ j - 1 ] + 1 ;
else L [ bi ] [ j ] = Math . max ( L [ 1 - bi ] [ j ] , L [ bi ] [ j - 1 ] ) ;
}
}
return L [ bi ] [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("YNpjSv");
param0.add("736519");
param0.add("11010000100010");
param0.add("v ");
param0.add("8311172");
param0.add("100011101011");
param0.add("u");
param0.add("3943042");
param0.add("101");
param0.add("MpbfF OsizevaM");
List<String> param1 = new ArrayList<>();
param1.add("qtUkJn");
param1.add("07592");
param1.add("0");
param1.add("qGBQT");
param1.add("157219329531");
param1.add("1000001111");
param1.add("YzkubTqLhP");
param1.add("3859");
param1.add("00010000101010");
param1.add("WgsFGaQwtp");
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());
}
} | 5,698 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_PAIRWISE_PRODUCTS_2.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_PAIRWISE_PRODUCTS_2{
static int f_gold ( int n ) {
return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(18);
param0.add(97);
param0.add(9);
param0.add(42);
param0.add(67);
param0.add(71);
param0.add(66);
param0.add(69);
param0.add(18);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 5,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.