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/COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
int invcount = 0 ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) {
int small = 0 ;
for ( int j = i + 1 ;
j < n ;
j ++ ) if ( arr [ i ] > arr [ j ] ) small ++ ;
int great = 0 ;
for ( int j = i - 1 ;
j >= 0 ;
j -- ) if ( arr [ i ] < arr [ j ] ) great ++ ;
invcount += great * small ;
}
return invcount ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,75,89});
param0.add(new int[]{84,-66,-52,34,-28,-6,20,22,-78,-26,14,24,-92,-18,32,-94,-64,-38,56,4,-10,58,-66,-58,-10,-8,-62,-60,-26});
param0.add(new int[]{0,0,0,1,1,1,1,1});
param0.add(new int[]{18,7,43,57,94,37,38,41,59,64,97,29,51,37,64,91,42,83,13,22,68});
param0.add(new int[]{-94,-86,-84,-84,-82,-66,-62,-58,-52,-48,-44,-40,-38,-32,-22,-22,-22,-14,-8,-6,-6,0,2,20,20,26,32,32,52,56,66,74,76,80,80,86,88,94});
param0.add(new int[]{0,1,1,0,0,0,0,0,1,0,0});
param0.add(new int[]{4,8,15,19,24,31,33,36,38,45,45,52,54,65,73,75,83,84,90,92,93});
param0.add(new int[]{80,-30,-44,76,-96,2,22,-30,36,-6,88,-60,-90,-52,78,90,-52});
param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{74,71,28,45,14,31,17,10,82,27,45,73,93,87,57,58});
List<Integer> param1 = new ArrayList<>();
param1.add(1);
param1.add(26);
param1.add(7);
param1.add(17);
param1.add(34);
param1.add(9);
param1.add(19);
param1.add(10);
param1.add(7);
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());
}
} | 6,000 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int max_count = 0 ;
int max_index = 0 ;
int prev_zero = - 1 ;
int prev_prev_zero = - 1 ;
for ( int curr = 0 ;
curr < n ;
++ curr ) {
if ( arr [ curr ] == 0 ) {
if ( curr - prev_prev_zero > max_count ) {
max_count = curr - prev_prev_zero ;
max_index = prev_zero ;
}
prev_prev_zero = prev_zero ;
prev_zero = curr ;
}
}
if ( n - prev_prev_zero > max_count ) max_index = prev_zero ;
return max_index ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,8,9,13,13,19,19,21,21,24,28,28,29,29,29,32,34,38,39,43,45,46,57,59,62,63,67,67,68,69,70,70,71,72,74,74,76,78,79,81,90,90,95,96,98});
param0.add(new int[]{28,92,-16,0,6,12,-88,42,-48,72,2,-38,80,82,96,32,-42,-38,62,-76,20,-10,2,-48,4,88,-24,-72,32,-42,-48,-62,38});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{70,83,9,51,11,81,27,26,37,46});
param0.add(new int[]{50,88});
param0.add(new int[]{0,1,0,1,1,1,0,0,0,1,1,0,1});
param0.add(new int[]{96});
param0.add(new int[]{18,78,14,60,-12,-86,32,74,74,96,58,28,-42,28,-18,-58,-82,-58,22,6,2,-6,-4,-98});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{58,22,15,85,8,74,93,76,44,51,43,93,20,51,52,35,17,13,96,82,23,51,44,18,45,79,66,48,16,31,62,99,46,66,53,89,87,2,87,20,30});
List<Integer> param1 = new ArrayList<>();
param1.add(36);
param1.add(20);
param1.add(39);
param1.add(7);
param1.add(1);
param1.add(6);
param1.add(0);
param1.add(21);
param1.add(19);
param1.add(24);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,001 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_INCREASING_ODD_EVEN_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_INCREASING_ODD_EVEN_SUBSEQUENCE{
public static int f_gold ( int arr [ ] , int n ) {
int [ ] lioes = new int [ n ] ;
int maxLen = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) lioes [ i ] = 1 ;
for ( int i = 1 ;
i < n ;
i ++ ) for ( int j = 0 ;
j < i ;
j ++ ) if ( arr [ i ] > arr [ j ] && ( arr [ i ] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 ) lioes [ i ] = lioes [ j ] + 1 ;
for ( int i = 0 ;
i < n ;
i ++ ) if ( maxLen < lioes [ i ] ) maxLen = lioes [ i ] ;
return maxLen ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,8,9,16,16,27,32,33,35,35,39,39,41,42,44,47,48,50,56,59,66,69,70,73,74,76,78,87,87,89,94,96,96,98,98});
param0.add(new int[]{40,76,-54,-92,-28,-96,8,60,28,-38,-62,-40,-16,16,52,28,70,-56,-50,46,68,-16,-56,46,42,70,52,-34,86,-32,-50,64,36,54,20,82,84});
param0.add(new int[]{0,0,0,0,1,1,1});
param0.add(new int[]{15,19,87,44,15,48,21,85,90,30,88,95,48,92,29,52,46,46,7,23,96,97,43});
param0.add(new int[]{-98,-96,-94,-94,-94,-80,-80,-78,-64,-62,-62,-46,-42,-38,-36,-36,-34,-32,-20,-18,-16,-12,-8,-4,-4,-2,-2,2,6,12,34,40,42,44,46,46,50,54,58,58,70,72,72,76,78,86});
param0.add(new int[]{0,0,1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1});
param0.add(new int[]{6,7,19,36,44,63,68,72,83});
param0.add(new int[]{-64,12,56,50,94,6,0,70,-70,46,-84,-64,4,76,28,94,-8,24,76,64,-62,-34});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{71,57,20,8,90,69,15,62,45,14,65,20,48,9});
List<Integer> param1 = new ArrayList<>();
param1.add(32);
param1.add(25);
param1.add(4);
param1.add(19);
param1.add(33);
param1.add(13);
param1.add(8);
param1.add(15);
param1.add(21);
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());
}
} | 6,002 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS{
static int f_gold ( int weight [ ] , int n , int c ) {
int res = 0 , bin_rem = c ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( weight [ i ] > bin_rem ) {
res ++ ;
bin_rem = c - weight [ i ] ;
}
else bin_rem -= weight [ i ] ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,12,14,16,19,24,29,31,33,34,41,43,47,53,53,59,64,70,70,71,72,73,74,80,81,89,90});
param0.add(new int[]{-88,-26,70,-92,96,84,-24,-18,84,62,-72,42,72,2,30,86});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{51,7,6,24,19,83,9,36,40,93,24,48,63,69,53,54,42,45,90,14,29,6,7,37,53,18,87,38,59,1,68,44,47,35,87,91,60,90,52,8,80,41,3,96});
param0.add(new int[]{-98,-90,-78,-48,-36,-20,2,8,16,40,54,54,60,92});
param0.add(new int[]{1,1,1,1,0,0,1,1,0,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,0,1,1,1,1,1,0,1,1,0,0,1,0,0,0,0});
param0.add(new int[]{8,14,16,35,40,45,54,57,58,59,87,88,93,95,97});
param0.add(new int[]{-46,-6,60,-88,10,94,-12,-64,-68,-76,-60,-10,28,18,86,88,80,-56,94,-6,-42,72,-10,54,-82,-52,-70,-28,-74,82,-12,42,44,56,52,-28,22,62,-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,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{48,57,21,82,99});
List<Integer> param1 = new ArrayList<>();
param1.add(21);
param1.add(11);
param1.add(27);
param1.add(26);
param1.add(11);
param1.add(32);
param1.add(11);
param1.add(19);
param1.add(26);
param1.add(4);
List<Integer> param2 = new ArrayList<>();
param2.add(16);
param2.add(14);
param2.add(23);
param2.add(41);
param2.add(7);
param2.add(28);
param2.add(12);
param2.add(38);
param2.add(23);
param2.add(2);
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());
}
} | 6,003 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PROGRAM_BINARY_DECIMAL_CONVERSION.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_BINARY_DECIMAL_CONVERSION{
static int f_gold ( int n ) {
int num = n ;
int dec_value = 0 ;
int base = 1 ;
int temp = num ;
while ( temp > 0 ) {
int last_digit = temp % 10 ;
temp = temp / 10 ;
dec_value += last_digit * base ;
base = base * 2 ;
}
return dec_value ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(70);
param0.add(95);
param0.add(41);
param0.add(97);
param0.add(8);
param0.add(16);
param0.add(41);
param0.add(57);
param0.add(81);
param0.add(78);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,004 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_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 COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER{
static int f_gold ( int n ) {
int result = 0 ;
for ( int i = 1 ;
i <= 9 ;
i ++ ) {
Stack < Integer > s = new Stack < > ( ) ;
if ( i <= n ) {
s . push ( i ) ;
result ++ ;
}
while ( ! s . empty ( ) ) {
int tp = s . peek ( ) ;
s . pop ( ) ;
for ( int j = tp % 10 ;
j <= 9 ;
j ++ ) {
int x = tp * 10 + j ;
if ( x <= n ) {
s . push ( x ) ;
result ++ ;
}
}
}
}
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(69);
param0.add(72);
param0.add(88);
param0.add(7);
param0.add(66);
param0.add(34);
param0.add(23);
param0.add(37);
param0.add(33);
param0.add(21);
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());
}
} | 6,005 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_UNLOCK_CIRCULAR_LOCK{
static int f_gold ( int input , int unlock_code ) {
int rotation = 0 ;
int input_digit , code_digit ;
while ( input > 0 || unlock_code > 0 ) {
input_digit = input % 10 ;
code_digit = unlock_code % 10 ;
rotation += Math . min ( Math . abs ( input_digit - code_digit ) , 10 - Math . abs ( input_digit - code_digit ) ) ;
input /= 10 ;
unlock_code /= 10 ;
}
return rotation ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(71);
param0.add(90);
param0.add(28);
param0.add(41);
param0.add(32);
param0.add(39);
param0.add(33);
param0.add(89);
param0.add(50);
param0.add(92);
List<Integer> param1 = new ArrayList<>();
param1.add(46);
param1.add(65);
param1.add(84);
param1.add(23);
param1.add(58);
param1.add(82);
param1.add(58);
param1.add(32);
param1.add(51);
param1.add(77);
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());
}
} | 6,006 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_MISSING_NUMBER_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_MISSING_NUMBER_1{
static int f_gold ( int a [ ] , int n ) {
int total = 1 ;
for ( int i = 2 ;
i <= ( n + 1 ) ;
i ++ ) {
total += i ;
total -= a [ i - 2 ] ;
}
return total ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{13,27,46,59,62,82,92});
param0.add(new int[]{22,86,-64,-20,-56,-16,86,42,72,-90,10,42,56,8,50,24,-34,0,-78,64,18,20,-84,-22,90,-20,86,26,-54,0,90,-48,4,88,18,-64,-22,-74,48,-36,-86,-24,88,-64,68,62,92});
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});
param0.add(new int[]{55,89,56,85,26,4,91,91,3,77,63,59,76,90,1,94,44,70,8,54,3,91,29,95,28,75,20});
param0.add(new int[]{-94,-84,-80,-78,-66,-62,-54,-52,-26,-8,-8,-6,4,4,8,14,26,58,60,62,62,76,78,86,92});
param0.add(new int[]{1,0,0,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,0,0,0});
param0.add(new int[]{1,2,7,7,9,14,23,29,31,31,35,35,38,41,44,49,49,50,51,54,55,56,57,63,67,69,73,79,79,80,86,88,93});
param0.add(new int[]{78,-48,16,22,-16,34,56,-20,-62,-82,-74,-40,20,-24,-46,64,66,-76,58,-84,96,76,86,-32,46});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{73,76,25,59,40,85,90,38,13,97,93,99,45,7});
List<Integer> param1 = new ArrayList<>();
param1.add(6);
param1.add(38);
param1.add(15);
param1.add(22);
param1.add(18);
param1.add(25);
param1.add(24);
param1.add(12);
param1.add(29);
param1.add(12);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,007 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LOWER_INSERTION_POINT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LOWER_INSERTION_POINT{
static int f_gold ( int arr [ ] , int n , int X ) {
if ( X < arr [ 0 ] ) return 0 ;
else if ( X > arr [ n - 1 ] ) return n ;
int lowerPnt = 0 ;
int i = 1 ;
while ( i < n && arr [ i ] < X ) {
lowerPnt = i ;
i = i * 2 ;
}
while ( lowerPnt < n && arr [ lowerPnt ] < X ) lowerPnt ++ ;
return lowerPnt ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,5,5,16,16,20,26,32,35,39,39,41,44,48,48,51,59,59,62,66,66,70,74,75,78,80,86,86,96});
param0.add(new int[]{-76,80,-6,-2,50,72,84,-56,70,8,48,6,-24,-50,-72});
param0.add(new int[]{0,0,0,0,0,1,1,1,1});
param0.add(new int[]{74,65,84,71});
param0.add(new int[]{-96,-92,-90,-86,-84,-76,-76,-62,-58,-54,-50,-50,-44,-42,-38,-34,-14,-8,6,12,24,38,40,50,62,84,86,92});
param0.add(new int[]{1,1,0,0,0,1,1,1,0,0,1,1,0,1,0,1,0,0,0,1,1,1,1});
param0.add(new int[]{6,10,14,14,16,19,23,23,25,26,29,34,42,42,43,45,47,49,50,51,51,56,59,65,69,72,75,78,79,80,82,82,82,84,85,91,98});
param0.add(new int[]{-90,-2,22,-2,58,-2,96,38,36,-66,-98,22,-80,-32,22,0,-34,-16,82,76,12,84,66,8,32,18,-98,-10});
param0.add(new int[]{0,0,0,1,1,1,1});
param0.add(new int[]{85,59,22,52,93,14,42,71,69,15,52,78,35,61,92,90,70,48,47,72,74,46,22,74,83,32,14,24,18,27,18,68,29,31});
List<Integer> param1 = new ArrayList<>();
param1.add(17);
param1.add(14);
param1.add(8);
param1.add(2);
param1.add(19);
param1.add(12);
param1.add(31);
param1.add(22);
param1.add(3);
param1.add(19);
List<Integer> param2 = new ArrayList<>();
param2.add(29);
param2.add(9);
param2.add(4);
param2.add(3);
param2.add(19);
param2.add(17);
param2.add(24);
param2.add(16);
param2.add(5);
param2.add(33);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,008 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_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_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1{
static int f_gold ( int M [ ] [ ] , int n , int m ) {
int count = 0 ;
int i = 0 ;
int j = m - 1 ;
while ( j >= 0 && i < n ) {
if ( M [ i ] [ j ] < 0 ) {
count += j + 1 ;
i += 1 ;
}
else j -= 1 ;
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{76,39,83,83,24,11,7,97,81,52,7,81,68,25,14,54,69,12,53,38,94,77,75,28,38,92,47,46,86},new int[]{63,95,96,14,82,98,75,5,72,27,71,62,15,55,63,37,10,2,68,98,15,21,25,83,84,46,93,23,87},new int[]{47,23,49,53,26,14,50,50,5,3,2,28,69,14,47,82,78,48,89,84,32,28,71,20,99,66,4,54,23},new int[]{43,37,14,20,36,19,4,97,53,42,12,69,48,60,31,29,97,86,21,69,78,61,23,20,99,51,51,38,72},new int[]{92,40,87,23,98,25,84,79,98,94,8,33,86,21,30,52,51,53,38,72,38,79,54,5,35,45,81,61,92},new int[]{49,92,94,43,1,28,43,39,50,96,28,32,35,47,6,20,90,38,92,11,98,36,51,72,7,63,92,20,10},new int[]{31,26,58,16,98,43,79,88,47,23,1,63,48,54,51,1,21,74,94,8,74,80,86,96,55,36,73,62,68},new int[]{32,70,24,22,91,36,67,12,17,23,45,57,51,47,3,52,44,39,56,87,35,48,26,36,91,8,67,86,25},new int[]{27,80,9,11,42,7,77,83,95,92,36,23,28,3,32,75,37,88,78,53,38,12,29,25,63,3,83,85,40},new int[]{15,14,11,3,1,50,70,72,85,66,75,41,2,74,5,97,53,77,69,22,69,99,93,24,22,98,83,3,59},new int[]{94,54,92,22,14,71,92,18,52,75,66,32,23,84,86,46,16,15,60,27,66,14,77,1,16,93,68,9,75},new int[]{72,91,27,73,33,29,78,40,83,75,56,74,48,40,92,94,72,62,57,59,70,2,18,71,28,53,15,87,22},new int[]{83,76,75,55,3,52,29,64,9,85,89,13,62,82,63,57,25,59,6,18,6,67,22,2,24,42,52,5,18},new int[]{72,95,58,66,69,95,23,13,77,86,34,74,75,97,90,10,47,54,23,37,46,85,81,39,82,11,98,6,11},new int[]{95,58,35,92,80,58,58,82,23,29,43,20,27,55,41,52,35,29,40,13,34,52,11,21,39,56,9,67,39},new int[]{5,8,27,88,80,32,94,82,25,43,35,62,26,93,70,18,22,54,71,38,85,61,95,67,58,53,11,34,65},new int[]{72,84,81,42,42,98,74,18,93,39,48,88,29,82,95,13,9,63,17,54,47,10,8,47,34,87,65,32,15},new int[]{12,36,98,64,88,77,1,70,87,33,46,30,37,89,99,60,28,57,74,11,80,57,66,51,25,7,93,90,37},new int[]{80,99,88,26,88,80,98,61,42,1,91,2,7,68,1,4,48,2,61,7,69,70,15,76,72,22,83,16,42},new int[]{47,6,71,29,60,14,18,74,48,85,14,55,34,63,45,24,7,55,69,45,72,76,54,46,89,97,27,35,21},new int[]{81,95,80,69,92,74,94,2,70,70,27,61,46,1,77,6,95,72,18,25,47,48,49,43,89,10,54,74,54},new int[]{94,67,23,93,87,73,68,38,43,64,35,72,72,34,30,81,12,32,8,20,62,36,63,88,98,13,7,57,66},new int[]{40,20,92,48,43,19,36,78,87,17,45,35,7,36,27,38,83,33,64,41,50,37,62,39,74,74,73,14,94},new int[]{97,4,66,99,57,66,42,6,32,64,44,1,34,41,86,3,78,43,7,19,68,3,31,83,50,47,86,16,87},new int[]{61,18,41,10,33,56,90,62,32,52,66,56,16,12,15,5,79,47,33,44,92,2,23,63,57,5,85,23,87},new int[]{41,81,24,64,1,60,10,50,76,4,24,45,63,64,25,14,4,4,35,20,61,11,8,45,30,33,32,56,11},new int[]{82,93,72,31,22,62,63,61,93,62,7,17,43,39,9,68,76,15,92,60,4,16,49,68,38,61,18,45,1},new int[]{3,44,78,74,33,97,37,73,10,21,68,84,77,42,44,42,18,95,32,16,56,83,19,15,61,72,55,80,99},new int[]{9,4,61,31,73,79,37,60,13,36,92,62,20,6,79,82,59,67,12,43,70,65,33,16,70,36,51,38,61}});
param0.add(new int[][]{new int[]{17,56},new int[]{68,34}});
param0.add(new int[][]{new int[]{63,21,24,76,7,94,21,23,39,45,23,2,16,42,23,6,15,37,47,64,18,55,99,5,74,66,9,82,40,13,2,14,34,11,47,56},new int[]{20,30,34,53,49,37,11,29,58,85,94,81,88,50,61,5,72,5,58,86,98,77,72,35,2,53,11,29,84,27,25,40,90,52,69,90},new int[]{10,24,96,55,26,55,47,7,75,42,43,29,46,78,74,32,16,82,42,42,59,78,68,82,32,31,8,27,18,7,22,70,27,9,86,83},new int[]{91,89,31,11,33,34,47,34,18,39,82,4,92,89,8,89,83,24,56,46,92,50,76,20,58,69,17,98,97,37,38,76,1,87,2,97},new int[]{64,35,17,29,96,12,57,8,12,47,65,48,97,10,26,4,70,28,10,79,81,82,60,70,44,59,83,75,29,19,27,74,4,6,67,67},new int[]{54,41,10,15,57,80,50,86,25,2,45,7,37,77,55,72,37,94,93,69,6,79,95,73,68,77,47,80,77,55,38,80,7,90,60,92},new int[]{56,85,53,32,16,26,43,24,24,7,47,52,99,90,76,35,63,2,48,36,63,23,14,69,65,22,90,87,5,22,35,86,19,72,97,6},new int[]{30,68,46,51,93,74,58,6,79,93,31,6,81,16,29,31,1,26,82,1,51,71,89,85,39,93,6,4,22,96,94,61,58,4,40,89},new int[]{57,39,35,96,86,55,55,45,51,20,67,50,39,73,73,64,92,49,89,73,45,87,46,73,45,27,23,91,49,99,21,2,16,76,14,8},new int[]{26,56,59,26,75,99,7,86,47,8,90,8,36,52,76,62,21,39,12,8,9,63,29,41,7,77,28,93,51,11,87,60,65,4,28,65},new int[]{82,47,44,19,27,71,36,9,13,48,5,87,29,74,88,64,77,94,82,54,14,42,93,63,9,76,70,63,19,81,19,78,94,41,52,18},new int[]{25,55,1,99,50,76,42,89,35,3,55,35,26,99,47,50,74,90,61,61,12,49,87,98,81,44,46,77,13,77,75,73,19,36,14,53},new int[]{77,73,1,49,66,56,54,46,6,62,67,94,83,41,65,66,22,67,66,30,57,71,19,65,33,29,72,72,90,19,82,50,89,75,81,9},new int[]{50,61,36,63,82,74,2,12,79,88,25,21,75,81,25,74,68,81,24,98,49,99,35,2,69,34,57,35,85,35,98,1,83,52,32,98},new int[]{58,19,70,53,75,93,19,63,29,73,69,63,30,84,56,7,48,45,41,53,20,44,97,53,85,6,35,93,74,81,58,98,93,31,7,30},new int[]{35,59,63,40,37,2,79,35,70,50,29,78,5,15,34,50,76,60,39,23,67,80,62,26,51,64,83,59,78,56,52,45,5,85,56,62},new int[]{18,97,81,30,57,26,64,52,52,21,18,67,49,69,40,5,25,96,19,67,15,31,52,35,43,97,74,60,85,54,58,91,13,3,2,69},new int[]{79,23,13,11,51,54,53,5,37,75,81,14,13,38,93,40,42,23,81,49,83,86,99,96,96,23,68,60,91,48,7,24,58,3,54,80},new int[]{80,93,37,66,75,96,96,8,17,64,40,74,41,44,41,93,38,38,77,31,49,76,23,90,1,80,70,30,13,81,44,31,71,75,33,83},new int[]{9,7,91,42,85,39,95,24,78,52,37,76,64,75,65,23,91,47,98,55,66,72,14,52,12,99,80,54,8,87,56,60,39,80,2,79},new int[]{64,11,70,65,36,63,89,63,15,62,56,23,43,31,3,79,36,75,69,92,64,67,48,44,72,64,84,74,48,99,53,84,83,38,43,51},new int[]{50,14,8,82,83,80,14,3,37,24,75,34,29,36,87,16,76,79,64,35,50,39,88,13,72,91,60,28,71,95,68,50,76,55,68,3},new int[]{54,55,22,6,97,76,3,9,29,33,54,68,89,35,36,72,34,43,29,34,56,23,65,2,86,80,78,69,12,66,52,47,34,61,54,82},new int[]{70,76,28,63,71,56,43,38,9,46,20,12,81,36,1,48,77,22,57,51,74,63,18,75,50,59,8,63,35,27,79,66,69,81,11,33},new int[]{38,24,37,49,70,31,11,2,30,34,86,1,3,48,71,41,23,11,4,65,16,42,48,38,9,12,50,9,17,60,58,82,90,88,82,72},new int[]{61,89,15,40,61,85,26,9,67,62,73,28,7,76,13,89,28,43,41,36,95,17,25,26,59,66,83,35,8,46,86,20,49,29,73,74},new int[]{11,42,44,98,98,9,24,16,58,43,28,68,57,44,94,50,37,31,44,18,50,27,50,10,25,54,43,31,38,84,20,21,91,30,63,89},new int[]{71,27,83,1,75,71,77,29,69,12,45,59,82,5,30,40,74,16,69,51,99,97,93,30,61,3,23,1,84,31,69,27,27,79,66,46},new int[]{46,15,23,88,71,27,77,24,69,23,36,95,67,69,15,38,27,8,69,18,82,61,28,14,43,73,46,99,41,4,66,32,88,27,21,67},new int[]{59,42,75,62,2,89,77,88,8,39,42,63,89,52,41,69,38,54,64,11,8,82,10,16,72,88,16,25,75,81,8,18,50,63,78,32},new int[]{94,64,54,48,64,92,80,19,47,75,25,48,79,9,84,59,4,9,98,23,99,90,4,42,55,41,5,99,9,19,19,70,8,41,21,32},new int[]{36,34,6,11,51,7,72,53,85,49,55,96,96,42,22,69,44,32,30,1,31,90,51,7,54,43,80,66,43,53,68,5,1,97,88,14},new int[]{87,13,21,98,41,36,79,99,44,55,94,65,2,35,28,88,14,42,28,15,27,62,72,98,79,59,58,34,64,53,18,36,59,23,76,66},new int[]{77,16,17,9,27,67,43,78,57,38,50,27,4,30,8,68,18,36,4,57,90,29,37,56,3,95,8,75,75,49,63,10,34,20,67,11},new int[]{76,91,51,58,73,99,42,93,3,65,79,51,51,67,90,62,45,50,67,61,17,90,85,22,85,3,3,17,65,80,89,68,59,78,16,82},new int[]{8,66,57,91,66,68,17,15,33,36,37,62,36,39,99,57,15,97,46,15,47,20,87,63,88,86,66,1,46,4,78,80,34,91,17,93}});
param0.add(new int[][]{new int[]{96,91,61,55},new int[]{60,18,48,25},new int[]{94,72,84,54},new int[]{10,62,23,79}});
param0.add(new int[][]{new int[]{68,61,12,7,49,65,57,32,57,95,64,17,77,59},new int[]{38,7,47,21,69,36,79,82,23,27,76,37,43,52},new int[]{37,95,8,88,57,73,4,52,75,99,7,55,78,23},new int[]{45,1,5,89,89,71,96,27,86,75,49,30,91,78},new int[]{90,64,33,88,19,95,21,5,74,90,65,86,8,53},new int[]{96,14,83,29,23,39,48,68,97,68,97,60,19,66},new int[]{92,85,40,36,18,94,53,75,6,72,63,98,1,87},new int[]{31,50,24,38,46,2,24,76,34,76,45,59,90,90},new int[]{65,98,95,65,4,82,85,58,1,68,69,73,3,10},new int[]{39,44,93,64,97,19,21,52,70,73,19,85,83,96},new int[]{49,48,54,77,37,82,64,93,13,76,14,4,14,57},new int[]{67,85,12,23,33,66,19,41,19,2,30,95,84,7},new int[]{35,38,97,53,61,25,80,94,77,49,86,6,12,71},new int[]{39,32,7,19,13,24,26,48,79,47,13,2,48,7}});
param0.add(new int[][]{new int[]{52,24,47,92,56,78,13,64,21,58},new int[]{97,6,75,14,88,68,7,23,39,50},new int[]{17,67,52,78,74,63,61,47,65,66},new int[]{45,47,94,50,82,16,11,94,83,61},new int[]{91,81,3,52,62,85,27,82,83,58},new int[]{90,5,40,91,76,16,88,65,94,47},new int[]{63,83,38,72,5,18,89,42,39,14},new int[]{23,18,89,8,80,67,23,35,69,14},new int[]{83,83,45,73,40,8,26,90,27,38},new int[]{36,11,82,87,50,1,24,90,52,78}});
param0.add(new int[][]{new int[]{75,18,92,72,81,98,29,53,45,28,6,37,39,3,30,17,77,29,56,43,6,97,35,89,22,24},new int[]{53,29,83,34,63,60,11,35,84,27,50,21,52,63,46,47,43,6,43,37,56,89,44,49,78,82},new int[]{39,2,47,28,17,17,92,70,8,27,34,58,41,7,54,95,65,86,74,37,59,41,38,36,10,17},new int[]{53,9,95,28,34,19,32,19,70,79,45,66,16,66,21,19,57,75,68,47,68,38,16,42,10,80},new int[]{2,3,13,81,70,71,94,52,44,16,80,55,96,16,88,7,67,84,9,49,73,93,59,14,59,27},new int[]{11,21,30,54,74,52,72,38,99,55,14,77,9,6,61,52,64,18,43,94,82,54,68,73,63,84},new int[]{97,16,69,54,41,92,65,23,93,53,95,60,47,17,42,3,22,57,56,96,61,87,77,63,21,28},new int[]{76,21,99,51,78,19,19,13,89,44,89,25,76,73,71,23,48,99,7,36,26,48,38,80,58,81},new int[]{16,46,97,92,29,56,53,79,77,95,13,99,55,33,65,16,73,78,38,10,2,86,31,35,24,55},new int[]{14,4,76,13,89,59,80,74,13,94,38,79,59,93,42,5,12,69,25,49,86,78,3,50,54,24},new int[]{63,2,29,74,80,37,35,2,28,54,39,61,7,88,66,91,4,29,37,33,25,17,66,45,51,47},new int[]{54,95,80,2,12,35,23,77,37,57,61,66,12,68,23,10,78,48,67,86,9,82,98,39,78,26},new int[]{75,36,19,34,54,70,36,97,26,87,62,3,42,18,71,53,60,39,32,72,8,28,79,9,84,26},new int[]{6,65,24,64,86,49,78,92,53,43,12,21,74,31,1,8,16,1,84,26,36,58,26,46,62,96},new int[]{12,67,58,42,70,74,31,70,79,96,72,22,92,4,70,16,18,86,95,73,36,21,20,47,74,64},new int[]{26,18,42,4,41,72,81,27,96,79,45,26,39,22,36,87,15,54,64,3,74,22,40,43,98,1},new int[]{12,52,15,36,80,80,75,48,5,76,62,12,18,1,3,21,7,37,35,9,72,23,63,69,63,71},new int[]{76,16,82,3,77,42,65,35,17,15,20,60,98,3,29,46,75,36,15,54,40,86,81,21,12,28},new int[]{32,59,65,75,40,20,82,40,73,44,78,26,9,25,92,93,32,84,8,76,34,7,49,5,42,10},new int[]{23,67,12,62,81,87,63,39,2,41,27,49,19,43,16,44,24,95,69,49,34,23,73,52,18,40},new int[]{90,90,98,56,40,54,31,92,32,50,25,89,8,38,88,90,81,52,56,87,38,87,78,69,99,91},new int[]{54,5,15,40,9,85,32,81,37,2,13,78,55,79,73,64,16,14,55,39,32,21,79,82,17,79},new int[]{92,99,79,3,52,68,58,99,51,8,28,42,77,42,19,98,38,63,31,69,53,93,81,36,99,89},new int[]{73,90,89,34,63,28,69,64,87,82,63,50,50,54,47,73,94,5,93,30,34,7,84,56,97,87},new int[]{74,49,31,66,24,68,50,25,36,23,38,21,39,44,40,60,43,98,47,88,96,1,56,14,73,51},new int[]{76,57,45,67,84,5,52,43,40,81,99,42,83,39,3,79,43,64,52,27,21,67,16,11,81,33}});
param0.add(new int[][]{new int[]{45,38,43,11,2,77,3,59,58,22,6,65,13,43,52,15},new int[]{69,16,25,44,58,94,54,33,96,27,86,41,25,86,66,95},new int[]{59,30,24,88,58,3,79,72,44,79,74,38,88,50,67,63},new int[]{77,66,59,16,29,18,24,81,6,78,40,14,23,20,86,90},new int[]{54,62,50,48,35,34,91,85,64,72,50,41,27,83,70,30},new int[]{78,37,23,81,90,53,11,37,80,30,45,86,9,7,6,14},new int[]{75,66,60,75,3,95,96,17,49,70,85,94,90,17,48,13},new int[]{8,50,36,13,18,84,71,19,77,3,97,76,35,1,9,5},new int[]{7,7,26,74,17,90,16,84,96,49,25,45,33,65,73,19},new int[]{85,24,39,8,23,16,31,84,43,16,92,73,2,72,69,58},new int[]{7,72,1,48,82,42,84,66,11,35,70,72,80,47,71,46},new int[]{92,19,1,42,4,55,31,93,38,92,22,87,40,35,10,58},new int[]{28,30,44,35,39,15,99,79,2,52,67,96,41,34,68,88},new int[]{41,84,68,59,71,64,79,76,52,26,16,25,89,11,39,97},new int[]{76,74,93,51,9,19,66,31,38,44,41,77,61,85,72,60},new int[]{18,97,93,70,18,8,55,92,63,45,19,53,78,37,76,32}});
param0.add(new int[][]{new int[]{88,45,19,4,98,22,59,11,85,88,3,46,20,27,14,92,24,45,89,7,84,55,54,65,95,92,10,97,41},new int[]{50,92,97,19,60,78,38,90,54,69,35,95,78,27,7,19,31,16,26,23,39,21,39,4,69,3,95,4,48},new int[]{50,96,8,79,99,92,99,70,68,51,29,3,56,9,98,2,24,79,37,27,86,34,31,74,23,48,78,9,70},new int[]{62,93,53,48,89,17,47,17,46,31,63,63,2,25,59,59,30,55,95,32,73,54,31,7,59,42,7,45,13},new int[]{64,8,35,71,49,38,83,47,7,70,53,16,96,33,97,62,87,5,16,96,26,66,73,24,97,46,77,71,43},new int[]{80,43,36,54,65,85,9,88,43,53,6,27,75,32,51,36,88,79,2,45,46,59,73,78,12,66,84,64,54},new int[]{61,5,44,80,52,38,85,41,91,64,3,59,12,10,83,6,91,4,17,63,78,86,61,80,60,81,16,91,56},new int[]{58,25,51,21,69,32,68,5,93,92,79,17,83,60,21,11,6,60,42,13,75,59,60,70,8,92,58,12,63},new int[]{56,42,60,3,1,3,21,66,11,14,77,77,76,43,64,14,71,54,9,52,92,84,21,92,35,97,18,99,4},new int[]{17,46,28,48,45,50,85,2,73,1,26,8,95,42,53,40,45,94,30,37,61,16,44,25,36,9,56,36,90},new int[]{90,32,51,10,22,17,53,22,37,32,43,40,26,42,29,45,70,53,56,28,58,6,83,70,40,90,75,81,28},new int[]{20,70,17,6,63,59,87,3,22,17,88,45,12,86,98,42,51,52,35,3,47,93,5,46,59,37,93,36,75},new int[]{76,66,33,20,53,44,81,5,12,13,78,27,82,94,6,2,97,60,13,27,51,59,34,22,60,35,16,55,66},new int[]{79,89,28,6,35,23,55,27,71,89,97,7,20,41,48,97,23,83,17,9,59,34,49,66,63,47,28,59,24},new int[]{98,48,63,80,29,81,60,76,22,46,71,98,18,44,14,90,12,54,29,27,23,2,88,65,75,76,69,22,34},new int[]{98,19,77,51,45,43,39,81,9,82,38,43,39,62,83,94,66,4,69,14,84,13,96,71,18,7,91,2,25},new int[]{49,42,78,9,52,81,43,29,96,56,71,95,52,63,70,23,58,8,50,91,74,19,54,89,28,86,8,71,26},new int[]{9,42,86,62,16,55,89,70,37,4,73,48,25,75,24,55,32,84,3,27,46,63,79,61,2,88,26,64,46},new int[]{14,23,36,97,88,37,26,53,96,91,10,62,34,5,45,5,25,12,17,42,47,64,63,28,70,26,67,98,12},new int[]{16,54,94,32,17,6,35,73,50,74,39,45,31,30,7,13,44,56,30,33,40,82,85,52,46,29,81,31,99},new int[]{69,62,61,40,63,96,52,95,16,74,74,3,49,76,88,90,76,26,33,40,75,83,11,38,7,66,57,45,33},new int[]{62,48,8,10,28,79,60,78,26,82,13,16,52,99,15,67,53,15,81,12,77,83,84,61,44,40,94,66,24},new int[]{51,76,56,42,98,20,96,37,32,41,28,55,65,43,98,24,28,26,64,69,48,24,3,74,68,48,8,24,7},new int[]{48,84,58,83,45,84,81,27,9,37,36,80,93,90,2,43,28,54,34,5,64,33,56,20,99,99,49,29,69},new int[]{19,80,60,22,1,42,35,37,14,46,87,12,70,25,54,80,13,6,98,15,24,77,80,20,54,4,22,74,5},new int[]{80,3,20,93,99,9,88,6,72,99,6,93,69,27,90,62,41,38,4,21,21,33,57,91,96,10,40,8,23},new int[]{56,44,68,36,33,58,79,25,13,72,51,37,92,30,62,23,13,57,87,49,3,49,95,68,36,6,78,21,58},new int[]{60,9,7,99,19,48,62,8,43,71,83,35,51,79,4,59,79,39,5,91,35,77,51,30,84,92,72,16,27},new int[]{22,58,62,3,99,42,88,86,42,55,9,55,61,36,11,47,19,21,82,82,35,66,70,28,59,27,75,36,5}});
param0.add(new int[][]{new int[]{9,7,25,16,34,78,18,20,43,67,73,98,45,20,73,51,62,62,20,32,55,72,60,15,48,49,38,83,25,87,12,93,97,52,41,90},new int[]{38,97,57,14,10,64,43,72,64,96,44,32,55,79,34,45,74,76,96,77,63,97,2,63,38,96,98,22,76,9,43,4,23,56,43,99},new int[]{3,97,67,53,94,92,93,81,15,34,6,20,66,44,12,13,43,15,48,16,70,83,54,58,47,3,71,44,71,10,63,49,83,4,81,63},new int[]{98,64,37,36,59,47,49,30,46,75,67,61,91,63,46,20,2,85,61,40,74,60,34,40,56,21,11,26,66,5,21,21,64,37,29,84},new int[]{37,20,33,63,35,85,36,86,14,55,97,56,17,52,5,73,33,92,24,97,39,94,11,44,24,45,85,39,99,65,19,76,68,82,51,18},new int[]{67,46,51,73,35,35,13,67,60,46,88,85,97,91,11,54,15,66,39,26,12,85,95,79,63,94,36,20,87,54,51,26,10,35,6,7},new int[]{45,34,15,72,77,92,77,99,7,44,49,49,93,4,20,27,46,7,44,29,4,4,12,89,60,54,63,70,32,78,44,24,68,96,58,47},new int[]{60,71,69,9,88,29,85,97,98,87,55,81,24,93,93,95,83,88,65,64,55,68,65,19,53,16,55,62,95,2,79,49,99,89,29,48},new int[]{60,6,9,20,64,81,54,76,46,22,62,52,82,31,52,76,45,66,22,56,88,32,66,80,35,54,7,15,71,89,77,77,38,89,48,22},new int[]{30,66,22,51,19,60,8,27,62,66,35,94,87,14,92,45,7,78,26,82,23,80,11,95,23,99,81,11,20,64,10,13,51,64,94,22},new int[]{76,49,78,72,98,66,77,69,15,17,31,64,89,99,98,14,28,5,72,47,46,11,99,60,62,17,67,36,33,81,14,74,90,36,88,14},new int[]{90,77,53,61,18,38,48,55,35,41,70,12,70,48,93,43,68,50,11,55,78,95,21,25,40,16,86,91,26,70,69,89,53,61,7,22},new int[]{91,94,52,73,87,70,24,63,86,9,37,46,17,28,27,20,47,93,56,81,7,84,81,68,1,14,49,27,89,42,16,27,67,83,96,73},new int[]{84,24,54,47,63,22,42,38,4,66,52,18,29,94,15,88,69,22,91,83,51,55,6,4,37,38,72,5,55,12,75,34,68,8,68,30},new int[]{47,74,37,48,80,45,51,19,54,94,80,28,95,20,62,37,43,4,1,80,46,99,3,93,62,32,25,16,33,83,38,13,1,88,48,1},new int[]{89,58,76,95,72,66,44,24,16,51,72,66,36,15,88,33,69,84,76,16,93,99,80,56,11,13,7,63,12,38,56,6,92,11,42,48},new int[]{6,8,64,4,14,59,32,2,52,18,28,32,54,56,54,64,59,19,51,27,22,63,15,95,34,73,25,35,68,97,32,52,49,99,93,60},new int[]{93,53,88,70,7,70,92,72,16,59,72,86,45,9,43,52,74,58,93,76,34,94,47,83,37,15,2,36,14,59,52,9,45,94,60,75},new int[]{26,28,26,4,14,74,59,73,21,49,64,64,53,20,2,99,26,39,24,58,33,10,17,21,5,76,95,61,23,77,22,34,75,51,44,91},new int[]{19,37,44,78,43,76,54,24,80,72,53,94,66,82,32,80,89,20,64,40,22,93,94,95,20,8,62,36,70,1,75,57,77,23,20,69},new int[]{70,58,27,59,1,90,89,23,36,85,92,45,2,93,65,10,10,83,13,85,91,33,4,80,63,76,17,80,10,6,6,7,61,63,48,43},new int[]{14,15,86,46,44,37,56,36,34,12,32,30,32,35,28,68,51,72,62,15,53,58,90,22,87,34,36,24,99,95,66,14,38,72,43,39},new int[]{44,35,36,39,97,34,36,19,18,46,71,90,12,87,18,95,7,53,89,20,7,50,24,37,10,25,45,1,95,87,88,22,4,92,56,34},new int[]{38,84,92,22,76,71,16,58,49,39,92,60,31,32,94,48,38,42,88,15,1,94,13,32,17,75,19,73,42,97,31,68,34,16,10,28},new int[]{57,76,12,77,28,88,31,36,11,40,78,4,16,57,41,61,88,70,52,57,59,57,79,78,83,97,53,87,80,74,45,2,80,65,78,80},new int[]{47,70,68,66,93,33,73,43,6,64,36,19,81,73,1,55,39,48,13,30,80,41,8,40,14,48,7,49,19,31,95,64,57,88,97,47},new int[]{71,54,34,95,21,31,85,67,94,53,28,79,51,18,19,89,21,1,41,65,63,85,71,18,90,13,55,30,12,55,31,6,6,91,43,19},new int[]{31,93,54,82,24,21,43,77,96,18,60,68,37,7,58,10,53,80,83,36,86,76,41,12,4,51,45,7,32,2,33,48,67,65,12,10},new int[]{61,57,43,48,47,9,29,42,21,67,86,56,3,61,83,5,84,77,41,12,56,79,92,33,10,35,11,60,29,73,58,78,24,11,26,76},new int[]{18,74,87,74,1,61,24,37,27,86,48,91,62,91,29,8,72,26,48,9,49,54,93,17,33,1,57,1,61,21,30,41,33,37,17,51},new int[]{64,66,69,5,27,17,30,72,51,88,42,66,61,58,77,87,43,64,84,64,27,19,58,11,17,14,67,21,29,45,42,63,48,54,26,78},new int[]{79,62,86,3,12,45,84,16,55,93,24,93,59,12,92,2,61,9,92,97,31,15,48,33,51,49,55,48,1,9,66,83,24,54,23,56},new int[]{63,57,5,89,37,4,46,26,70,75,85,39,56,6,39,43,55,93,87,15,98,77,61,25,15,52,58,86,66,57,22,66,54,46,9,36},new int[]{83,65,45,2,10,81,87,31,76,58,50,57,18,89,93,30,78,35,88,75,77,26,98,75,53,68,43,49,99,98,88,13,12,97,93,9},new int[]{59,15,73,29,52,78,11,30,13,1,57,69,53,53,34,33,90,85,60,76,97,42,73,98,95,64,28,78,39,91,94,27,49,48,22,58},new int[]{24,52,10,2,94,13,6,27,89,82,28,99,30,20,34,12,58,96,50,51,34,85,89,72,28,77,50,23,26,27,96,55,72,66,38,77}});
List<Integer> param1 = new ArrayList<>();
param1.add(27);
param1.add(1);
param1.add(35);
param1.add(3);
param1.add(13);
param1.add(8);
param1.add(18);
param1.add(11);
param1.add(16);
param1.add(27);
List<Integer> param2 = new ArrayList<>();
param2.add(27);
param2.add(1);
param2.add(28);
param2.add(2);
param2.add(13);
param2.add(8);
param2.add(15);
param2.add(11);
param2.add(15);
param2.add(25);
for(int i =0; i < param0.size(); ++i ){
for(int j =0; j < param0.get(i).length; ++j ){
Arrays.sort(param0.get(i)[j]);
for(int k =0; k < param0.get(i)[j].length; ++k){
param0.get(i)[j][k]-=50;
}
}
}
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());
}
} | 6,009 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S{
static int f_gold ( int arr [ ] , int n ) {
Map < Integer , Integer > um = new HashMap < > ( ) ;
int curr_sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
curr_sum += ( arr [ i ] == 0 ) ? - 1 : arr [ i ] ;
um . put ( curr_sum , um . get ( curr_sum ) == null ? 1 : um . get ( curr_sum ) + 1 ) ;
}
int count = 0 ;
for ( Map . Entry < Integer , Integer > itr : um . entrySet ( ) ) {
if ( itr . getValue ( ) > 1 ) count += ( ( itr . getValue ( ) * ( itr . getValue ( ) - 1 ) ) / 2 ) ;
}
if ( um . containsKey ( 0 ) ) count += um . get ( 0 ) ;
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,12,18,19,19,20,20,21,25,29,38,54,54,71,72,72,74,75,77,78,80,80,81,84,97,97});
param0.add(new int[]{10,70,24,-38,32,-68,88,-28,-24,-70,-64,50,-30,64,54,-6,18,-30,-30,-62,-10,94,-54,-22,-88,96,22,26,-92,-40,-76,46,36,30,24,-52,0});
param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1});
param0.add(new int[]{66,50,17,15,86,84,87,24,81,23,71,31,13,72,58,19,29,28,40,14,48,48,81,4,52,88,54,56,10,12,58,55,7,66,15,73,22,2,20,27,57,56,56,31,9,55});
param0.add(new int[]{-98,-62,-60,16,78,82});
param0.add(new int[]{1,0,1});
param0.add(new int[]{2,31,34,64});
param0.add(new int[]{-70,90,-10,-64,-76,-74,-12,-44,-48,-54,76,-78,8,0,0,78,-28,6,98,-84,60,60,2,48,-96,-28,-78,-76,-56,-26,-60,50,44,34,-90,80,-30,-98,62,36,-46,-72});
param0.add(new int[]{1,1,1});
param0.add(new int[]{37,70,80,61,86,10,17,98,54,89,87,84,11,55,3,52,4,90,98,31,20,62,71,58,58,6,92,5,99,99,72,40,82,54,23,19,85,91,62,98,62,72,93,74});
List<Integer> param1 = new ArrayList<>();
param1.add(24);
param1.add(24);
param1.add(11);
param1.add(40);
param1.add(5);
param1.add(2);
param1.add(2);
param1.add(25);
param1.add(1);
param1.add(27);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,010 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_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 FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME{
static int f_gold ( int n ) {
if ( n <= 1 ) return n ;
int a = 0 , b = 1 , c = 1 ;
int res = 1 ;
while ( c < n ) {
c = a + b ;
res ++ ;
a = b ;
b = c ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(5);
param0.add(19);
param0.add(7);
param0.add(94);
param0.add(58);
param0.add(65);
param0.add(69);
param0.add(96);
param0.add(80);
param0.add(14);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,011 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// 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 POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS{
static void f_gold ( int a [ ] , int size ) {
int positive = 0 , negative = 1 , temp ;
while ( true ) {
while ( positive < size && a [ positive ] >= 0 ) positive += 2 ;
while ( negative < size && a [ negative ] <= 0 ) negative += 2 ;
if ( positive < size && negative < size ) {
temp = a [ positive ] ;
a [ positive ] = a [ negative ] ;
a [ negative ] = temp ;
}
else break ;
}
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93});
param0.add(new int[]{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{28,85,78,33,10,83,30,22,3,82,75,48,2,76,54,6,40,93,94});
param0.add(new int[]{-98,-94,-7,-3,1,11,11,83,88});
param0.add(new int[]{0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0});
param0.add(new int[]{8,35,37,38,39,46,49,54});
param0.add(new int[]{-60,-66,-4,-21,27,-83,61,75,10,-48,18,-91,-67,88,13,49,86,-15,97,-90,-94,15,21,41,-35,-80,-43,-54});
param0.add(new int[]{0,0,0,0,0,0,0,0,1,1});
param0.add(new int[]{62,36,39,53,90,78,56,1,56,4,30});
List<Integer> param1 = new ArrayList<>();
param1.add(15);
param1.add(15);
param1.add(40);
param1.add(10);
param1.add(7);
param1.add(35);
param1.add(6);
param1.add(21);
param1.add(5);
param1.add(8);
List<int [ ]> filled_function_param0 = new ArrayList<>();
filled_function_param0.add(new int[]{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93});
filled_function_param0.add(new int[]{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97});
filled_function_param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
filled_function_param0.add(new int[]{28,85,78,33,10,83,30,22,3,82,75,48,2,76,54,6,40,93,94});
filled_function_param0.add(new int[]{-98,-94,-7,-3,1,11,11,83,88});
filled_function_param0.add(new int[]{0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0});
filled_function_param0.add(new int[]{8,35,37,38,39,46,49,54});
filled_function_param0.add(new int[]{-60,-66,-4,-21,27,-83,61,75,10,-48,18,-91,-67,88,13,49,86,-15,97,-90,-94,15,21,41,-35,-80,-43,-54});
filled_function_param0.add(new int[]{0,0,0,0,0,0,0,0,1,1});
filled_function_param0.add(new int[]{62,36,39,53,90,78,56,1,56,4,30});
List<Integer> filled_function_param1 = new ArrayList<>();
filled_function_param1.add(15);
filled_function_param1.add(15);
filled_function_param1.add(40);
filled_function_param1.add(10);
filled_function_param1.add(7);
filled_function_param1.add(35);
filled_function_param1.add(6);
filled_function_param1.add(21);
filled_function_param1.add(5);
filled_function_param1.add(8);
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());
}
} | 6,012 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_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 NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int [ ] auxArr = new int [ n ] ;
if ( s . charAt ( 0 ) == '1' ) auxArr [ 0 ] = 1 ;
for ( int i = 1 ;
i < n ;
i ++ ) {
if ( s . charAt ( i ) == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1 ;
else auxArr [ i ] = auxArr [ i - 1 ] ;
}
int count = 0 ;
for ( int i = n - 1 ;
i >= 0 ;
i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ;
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("OGiOkJF");
param0.add("517376");
param0.add("11");
param0.add("Ze");
param0.add("8763644247018");
param0.add("00111010001");
param0.add("HGwkBKUOVu");
param0.add("652");
param0.add("101000011110");
param0.add("kvdpG ");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,013 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/EVEN_FIBONACCI_NUMBERS_SUM.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EVEN_FIBONACCI_NUMBERS_SUM{
static int f_gold ( int limit ) {
if ( limit < 2 ) return 0 ;
long ef1 = 0 , ef2 = 2 ;
long sum = ef1 + ef2 ;
while ( ef2 <= limit ) {
long ef3 = 4 * ef2 + ef1 ;
if ( ef3 > limit ) break ;
ef1 = ef2 ;
ef2 = ef3 ;
sum += ef2 ;
}
return ( int ) sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(89);
param0.add(12);
param0.add(94);
param0.add(96);
param0.add(25);
param0.add(49);
param0.add(8);
param0.add(33);
param0.add(59);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,014 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED{
static boolean f_gold ( int arr [ ] , int n ) {
int max = Integer . MIN_VALUE ;
int min = Integer . MAX_VALUE ;
for ( int i = 0 ;
i < n ;
i ++ ) {
max = Math . max ( max , arr [ i ] ) ;
min = Math . min ( min , arr [ i ] ) ;
}
int m = max - min + 1 ;
if ( m > n ) return false ;
boolean visited [ ] = new boolean [ n ] ;
for ( int i = 0 ;
i < n ;
i ++ ) visited [ arr [ i ] - min ] = true ;
for ( int i = 0 ;
i < m ;
i ++ ) if ( visited [ i ] == false ) return false ;
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,19,25,65,72,75,83,90,92});
param0.add(new int[]{46,2,28,-44,74,-36,-8,30,-96,60,52,-58,16,-38,78,38,-28,16,26,-42,48,40,6,72});
param0.add(new int[]{0,1,1,1});
param0.add(new int[]{50,21,9,29,86,2,82,49,34,18,77,83,44,67,85,58,15,85,22,3,39,67,42,37,6,35,18,57,41,32,39,30,41,68,84,36,64,36});
param0.add(new int[]{-92,-82,-80,-78,-66,-66,-62,-58,-54,-52,-48,-30,-26,-22,-20,-20,-18,-14,-2,12,20,24,26,26,28,28,32,36,42,48,50,52,56,64,70,72,72,80,82,84,86,92});
param0.add(new int[]{1,0,0,1,0,0,1,0,0,1,1,0,1,0,0,0,0,1,0,1,0,0,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,0,0,1,0,1,0,0,0,0});
param0.add(new int[]{18,19,21,23,30,33,38,40,45,56,63,68,93,96});
param0.add(new int[]{20,-90,-42,48,18,-46,82,-12,-88,82,62,24,20,64,-68,-34,-38,8,-54,-20,-92,34,-90,78,18,8,-6,10,98,-24,72,-92,76,-22,12,-44,2,68,-72,42,34,20,-48});
param0.add(new int[]{0,0,0,0,0,1,1,1,1});
param0.add(new int[]{81,25,50,48,35,38,49,21,47,94,94,55,23,45,92,23,93,33,64,9,90,64,81,17,2,73,8,7,35,36,72});
List<Integer> param1 = new ArrayList<>();
param1.add(8);
param1.add(14);
param1.add(2);
param1.add(23);
param1.add(26);
param1.add(43);
param1.add(8);
param1.add(34);
param1.add(8);
param1.add(27);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,015 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING{
static int f_gold ( int arr [ ] , int n , int x ) {
for ( int 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[]{3,15,15,15,16,17,23,23,33,33,40,43,55,56,63,66,69,76,79,88,99});
param0.add(new int[]{78,-64,-20,12,96,54,16,50,-20,96,-22,-84,54,-66,-16,-78,-78,90,-46,-70,-72,12,96,-86,42,-80,8,-2,70,4,70});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{73,60,4,59,75,39,39,30,66,11,90,80,46,59,52,14,63,70,75,73,65,88,45,64,66,91,67,25,60,74,33,23,94,76,60,78,72});
param0.add(new int[]{-92,-88,-68,-64,-62,-56,-50,-48,-48,-38,-18,-16,-14,-8,-8,2,4,10,10,10,36,38,46,50,52,62,72,74,80,84,86,90,92,94,96});
param0.add(new int[]{1,0,0,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,1,0,1,0,1,0,1,1,0,0,0,0,1,0,0,1,1,0,1,0,0});
param0.add(new int[]{7,8,8,10,13,18,18,19,20,25,32,33,34,38,44,44,46,46,46,47,48,50,53,56,56,57,57,57,57,59,60,61,63,63,64,70,71,74,74,81,82,83,84,90,92,93});
param0.add(new int[]{-82,74,-94,68,-10,-8,-46,-4,50,-60,-70,-74,-18,50,62,-76,-50,-58,-36,-16,-36,78,12,56,-14,-48,40,22,0,16,72,-78,46,8,-50,-78,28,20,-56});
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[]{88,89,66,28,75,81,29,26,21,39,58,94,48,85});
List<Integer> param1 = new ArrayList<>();
param1.add(20);
param1.add(17);
param1.add(12);
param1.add(20);
param1.add(33);
param1.add(33);
param1.add(41);
param1.add(26);
param1.add(16);
param1.add(9);
List<Integer> param2 = new ArrayList<>();
param2.add(15);
param2.add(29);
param2.add(17);
param2.add(28);
param2.add(20);
param2.add(26);
param2.add(44);
param2.add(31);
param2.add(18);
param2.add(10);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,016 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2{
static int f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) {
int count = 0 ;
int l = 0 , r = n - 1 ;
while ( l < m && r >= 0 ) {
if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) {
l ++ ;
r -- ;
count ++ ;
}
else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++ ;
else r -- ;
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,5,7,10,14,14,17,21,32,34,37,40,40,40,46,46,50,50,51,55,57,62,65,67,67,69,70,70,72,73,76,77,77,78,84,85,85,86,87,88,88,89,89,90,93,99});
param0.add(new int[]{-84,52,-34,96,16,92,-64,-74});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{60,92,42,83,55,76,29,62});
param0.add(new int[]{-94,-94,-58,-40,-40,-26,-24,-22,-22,-22,-2,0,4,8,12,16,16,18,22,32,42,44,50,58,64,78,80,90});
param0.add(new int[]{0,0,1,1,1,0,0,1,1,1});
param0.add(new int[]{1,5,7,7,7,14,15,16,17,18,18,19,20,25,27,31,36,42,47,51,56,56,56,58,58,59,63,63,63,65,66,67,76,83,93,94,97});
param0.add(new int[]{78,-74,52,56,-8,92,14,56,-72,-92,32,-94,-26,-8,-66,72,-24,36,-84,-4,-68,14,78,40,-82,-10,16,56,6,-16,30,24,-32});
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});
param0.add(new int[]{17,50,65,4,19,10,45,70,76,81,28,97,55,70,38,2,40,67,36,33,6,85,25});
List<int [ ]> param1 = new ArrayList<>();
param1.add(new int[]{2,5,8,8,10,12,13,15,17,18,20,20,21,27,28,31,34,37,40,46,48,52,53,54,54,58,59,60,66,68,68,69,70,71,72,73,77,77,80,84,84,92,92,95,97,97});
param1.add(new int[]{-22,26,-12,-54,66,86,38,76});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{71,2,74,42,80,71,26,76});
param1.add(new int[]{-86,-84,-78,-76,-72,-70,-62,-58,-54,-54,-50,-46,-44,-40,-30,-28,-16,-10,10,36,36,48,70,84,84,90,94,98});
param1.add(new int[]{1,1,1,0,1,1,0,0,0,0});
param1.add(new int[]{2,3,7,8,9,10,17,18,21,28,29,29,33,35,46,47,47,49,49,49,53,56,58,59,59,60,65,67,70,78,81,85,85,87,90,92,96});
param1.add(new int[]{-74,22,-14,-2,36,86,-70,-20,-76,-84,-40,-36,42,22,-60,-94,-18,8,-14,-42,-68,62,-60,2,40,-66,68,96,70,98,-38,-74,-92});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{78,92,65,23,7,94,18,4,2,53,31,58,98,18,46,16,17,92,80,92,43,70,50});
List<Integer> param2 = new ArrayList<>();
param2.add(28);
param2.add(6);
param2.add(37);
param2.add(4);
param2.add(17);
param2.add(5);
param2.add(28);
param2.add(16);
param2.add(25);
param2.add(16);
List<Integer> param3 = new ArrayList<>();
param3.add(29);
param3.add(5);
param3.add(26);
param3.add(7);
param3.add(27);
param3.add(8);
param3.add(34);
param3.add(30);
param3.add(33);
param3.add(22);
List<Integer> param4 = new ArrayList<>();
param4.add(23);
param4.add(7);
param4.add(42);
param4.add(7);
param4.add(17);
param4.add(9);
param4.add(31);
param4.add(24);
param4.add(33);
param4.add(22);
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());
}
} | 6,017 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_LINE_PASSES_ORIGIN.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_LINE_PASSES_ORIGIN{
static boolean f_gold ( int x1 , int y1 , int x2 , int y2 ) {
return ( x1 * ( y2 - y1 ) == y1 * ( x2 - x1 ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(10);
param0.add(0);
param0.add(1);
param0.add(82);
param0.add(78);
param0.add(13);
param0.add(18);
param0.add(42);
param0.add(29);
List<Integer> param1 = new ArrayList<>();
param1.add(28);
param1.add(0);
param1.add(1);
param1.add(1);
param1.add(86);
param1.add(86);
param1.add(46);
param1.add(29);
param1.add(35);
param1.add(17);
List<Integer> param2 = new ArrayList<>();
param2.add(2);
param2.add(20);
param2.add(0);
param2.add(10);
param2.add(19);
param2.add(11);
param2.add(33);
param2.add(95);
param2.add(25);
param2.add(45);
List<Integer> param3 = new ArrayList<>();
param3.add(56);
param3.add(0);
param3.add(17);
param3.add(10);
param3.add(4);
param3.add(6);
param3.add(33);
param3.add(12);
param3.add(36);
param3.add(35);
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());
}
} | 6,018 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_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 HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER{
static int f_gold ( int n , int k ) {
if ( k <= 0 ) return n ;
return ( n & ~ ( 1 << ( k - 1 ) ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(49);
param0.add(59);
param0.add(76);
param0.add(27);
param0.add(61);
param0.add(67);
param0.add(63);
param0.add(85);
param0.add(90);
param0.add(24);
List<Integer> param1 = new ArrayList<>();
param1.add(15);
param1.add(69);
param1.add(20);
param1.add(76);
param1.add(60);
param1.add(27);
param1.add(71);
param1.add(25);
param1.add(64);
param1.add(55);
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());
}
} | 6,019 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT{
static String f_gold ( int n , int k ) {
String res = "" ;
for ( int i = 0 ;
i < k ;
i ++ ) res = res + ( char ) ( 'a' + i ) ;
int count = 0 ;
for ( int i = 0 ;
i < n - k ;
i ++ ) {
res = res + ( char ) ( 'a' + count ) ;
count ++ ;
if ( count == k ) count = 0 ;
}
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(60);
param0.add(56);
param0.add(16);
param0.add(42);
param0.add(55);
param0.add(64);
param0.add(68);
param0.add(88);
param0.add(64);
param0.add(42);
List<Integer> param1 = new ArrayList<>();
param1.add(71);
param1.add(17);
param1.add(16);
param1.add(60);
param1.add(56);
param1.add(59);
param1.add(24);
param1.add(2);
param1.add(94);
param1.add(79);
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());
}
} | 6,020 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES{
static int f_gold ( int n , int k ) {
int p = 1 ;
if ( k % 2 != 0 ) p = - 1 ;
return ( int ) ( Math . pow ( n - 1 , k ) + p * ( n - 1 ) ) / n ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(27);
param0.add(70);
param0.add(77);
param0.add(83);
param0.add(16);
param0.add(90);
param0.add(39);
param0.add(48);
param0.add(56);
param0.add(10);
List<Integer> param1 = new ArrayList<>();
param1.add(59);
param1.add(87);
param1.add(40);
param1.add(26);
param1.add(2);
param1.add(66);
param1.add(72);
param1.add(26);
param1.add(77);
param1.add(47);
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());
}
} | 6,021 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/BINARY_SEARCH.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_SEARCH{
static int f_gold ( int arr [ ] , int l , int r , int x ) {
if ( r >= l ) {
int mid = l + ( r - l ) / 2 ;
if ( arr [ mid ] == x ) return mid ;
if ( arr [ mid ] > x ) return f_gold ( arr , l , mid - 1 , x ) ;
return f_gold ( arr , mid + 1 , r , x ) ;
}
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,4,4,8,9,13,13,15,18,27,30,32,42,48,50,52,56,66,69,69,77,84,84,93});
param0.add(new int[]{52,-58,-22,-80,44,-52,-34,94,-34,-74,42,60,-62,70,98,32,10,94,26,56,-48,-50,42,2,46,28,-68,-16,-96,-12,66,-46,74,-60,-52,28,-92,-78,32,28,16,34,30,-60,-14});
param0.add(new int[]{0,1});
param0.add(new int[]{28,84,40,81});
param0.add(new int[]{-66,-62,-60,-56,-56,-2,40,44,50,74,82,94});
param0.add(new int[]{1,0,0,0,0,1,0,1,0,1,1});
param0.add(new int[]{15,26,31,36,36,61,68,72,75,79,82,98});
param0.add(new int[]{0,-82,-94,48,48,-96,14,66,76,-30,86,28,-28,-66,-64,92,-94,-66,86,26,8,94,-82,-80,4,-26,76,-46,72,88,-6,8,-30,40,-88,2,-40,-98,-22,-20,4,-12,54,-20,-36,12});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1});
param0.add(new int[]{81,47});
List<Integer> param1 = new ArrayList<>();
param1.add(19);
param1.add(40);
param1.add(1);
param1.add(2);
param1.add(8);
param1.add(7);
param1.add(6);
param1.add(38);
param1.add(12);
param1.add(1);
List<Integer> param2 = new ArrayList<>();
param2.add(12);
param2.add(35);
param2.add(1);
param2.add(2);
param2.add(6);
param2.add(7);
param2.add(7);
param2.add(33);
param2.add(10);
param2.add(1);
List<Integer> param3 = new ArrayList<>();
param3.add(22);
param3.add(44);
param3.add(1);
param3.add(2);
param3.add(8);
param3.add(10);
param3.add(8);
param3.add(39);
param3.add(6);
param3.add(1);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,022 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DICE_THROW_PROBLEM.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DICE_THROW_PROBLEM{
public static long f_gold ( int m , int n , int x ) {
long [ ] [ ] table = new long [ n + 1 ] [ x + 1 ] ;
for ( int j = 1 ;
j <= m && j <= x ;
j ++ ) table [ 1 ] [ j ] = 1 ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
for ( int j = 1 ;
j <= x ;
j ++ ) {
for ( int k = 1 ;
k < j && k <= m ;
k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ] ;
}
}
return table [ n ] [ x ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(94);
param0.add(7);
param0.add(20);
param0.add(90);
param0.add(50);
param0.add(32);
param0.add(46);
param0.add(82);
param0.add(43);
param0.add(6);
List<Integer> param1 = new ArrayList<>();
param1.add(4);
param1.add(12);
param1.add(44);
param1.add(94);
param1.add(58);
param1.add(90);
param1.add(25);
param1.add(50);
param1.add(82);
param1.add(83);
List<Integer> param2 = new ArrayList<>();
param2.add(69);
param2.add(33);
param2.add(24);
param2.add(88);
param2.add(27);
param2.add(29);
param2.add(6);
param2.add(87);
param2.add(70);
param2.add(19);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,023 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES{
static int f_gold ( int n ) {
int [ ] dp = new int [ n + 1 ] ;
dp [ 0 ] = 0 ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
if ( i >= 1 && i <= 3 ) dp [ i ] = 1 ;
else if ( i == 4 ) dp [ i ] = 2 ;
else {
dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ] ;
}
}
return dp [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(61);
param0.add(22);
param0.add(65);
param0.add(57);
param0.add(36);
param0.add(25);
param0.add(16);
param0.add(26);
param0.add(92);
param0.add(5);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,024 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY{
static int f_gold ( int arr [ ] , int n , int k ) {
int dist_count = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int j ;
for ( j = 0 ;
j < n ;
j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break ;
if ( j == n ) dist_count ++ ;
if ( dist_count == k ) return arr [ i ] ;
}
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,3,8,18,20,33,53,56,60,71,76,80,81,87,88,89,92,95});
param0.add(new int[]{-78,6,32,52,-12,-32,22,-40,-82,24,30,10,-40});
param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1});
param0.add(new int[]{3,28,55,21,42,60,96,83,98,75,29,73,51,21,27,65,19,47,12,81,19,94,50,43,21,32,52,44,52,91,49,59,52,10,75,86,46,43,3,49,70,60,77,99,27,63});
param0.add(new int[]{-96,-90,-76,-44,-16,-8,0,0,2,2,8,14,16,18,18,20,20,28,34,44,68,74,84,90});
param0.add(new int[]{0,1,1,0,0,0,0,0,1,0,0,1,0});
param0.add(new int[]{3,4,5,8,9,15,26,26,26,35,39,40,42,43,45,45,48,52,54,56,57,67,74,77,79,80,81,86,87,92,95,97});
param0.add(new int[]{-76,-24,-12,66,-40,26,72,46,-56,58,-68,2,-82});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{29,83,32,75,5,22,68,64,36,18,7,63,16,42,77,61,1,26,12,41,67,85,85,35,94,18,14,65,8,55,44,34,48,23,8,27,86,2,51,91});
List<Integer> param1 = new ArrayList<>();
param1.add(16);
param1.add(8);
param1.add(7);
param1.add(40);
param1.add(23);
param1.add(10);
param1.add(26);
param1.add(6);
param1.add(27);
param1.add(28);
List<Integer> param2 = new ArrayList<>();
param2.add(16);
param2.add(6);
param2.add(5);
param2.add(39);
param2.add(12);
param2.add(8);
param2.add(24);
param2.add(10);
param2.add(17);
param2.add(24);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,025 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUBARRAYS_WITH_SAME_EVEN_AND_ODD_ELEMENTS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SUBARRAYS_WITH_SAME_EVEN_AND_ODD_ELEMENTS{
static int f_gold ( int [ ] arr , int n ) {
int difference = 0 ;
int ans = 0 ;
int [ ] hash_positive = new int [ n + 1 ] ;
int [ ] hash_negative = new int [ n + 1 ] ;
hash_positive [ 0 ] = 1 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( ( arr [ i ] & 1 ) == 1 ) {
difference ++ ;
}
else {
difference -- ;
}
if ( difference < 0 ) {
ans += hash_negative [ - difference ] ;
hash_negative [ - difference ] ++ ;
}
else {
ans += hash_positive [ difference ] ;
hash_positive [ difference ] ++ ;
}
}
return ans ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,8,12,13,14,19,20,22,28,30,31,31,32,34,34,39,39,43,45,46,47,62,63,63,65,66,69,69,71,76,79,82,83,88,89,92,93,95,97,97});
param0.add(new int[]{20,-98,-44,-82,28,20,-76,-16,42,0,-88,74,56,6,-68,-30,28,88,58,-78,46,2});
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});
param0.add(new int[]{44,4,29,83,28,75,58,89,40,38,29,45,21,87,97,42,95,20,48,38,15,67,23,81,50,53,64,67,30,13,52,56,87,10,80,38,31,19});
param0.add(new int[]{-94,-94,-94,-90,-88,-86,-86,-82,-78,-76,-74,-68,-64,-62,-62,-60,-52,-48,-48,-46,-44,-44,-32,-28,-22,-12,-12,-8,-8,-4,4,6,10,14,28,40,42,52,56,60,60,60,64,68,70,82,82,84,96});
param0.add(new int[]{1,0,0,0,1,0,1,1,1,0,0,0,1,0,0,1,1,1,0,1,1,1,0,0,1,1,0,1,1,1,1,0,1,1,0,0,1,1,1,1});
param0.add(new int[]{6,16,21,26,34,35,44,46,46,86});
param0.add(new int[]{86,12,80,46,-12,6});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{71,94,91,19,85,5,87,96,66,17,95,5,32,17,93,48,46,24});
List<Integer> param1 = new ArrayList<>();
param1.add(26);
param1.add(15);
param1.add(24);
param1.add(23);
param1.add(48);
param1.add(27);
param1.add(7);
param1.add(4);
param1.add(15);
param1.add(12);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,026 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_MINIMUM_DISTANCE_BETWEEN_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 FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS_1{
static int f_gold ( int arr [ ] , int n , int x , int y ) {
int i = 0 ;
int min_dist = Integer . MAX_VALUE ;
int prev = 0 ;
for ( i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] == x || arr [ i ] == y ) {
prev = i ;
break ;
}
}
for ( ;
i < n ;
i ++ ) {
if ( arr [ i ] == x || arr [ i ] == y ) {
if ( arr [ prev ] != arr [ i ] && ( i - prev ) < min_dist ) {
min_dist = i - prev ;
prev = i ;
}
else prev = i ;
}
}
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());
}
} | 6,027 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_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 SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1{
static int f_gold ( int x , int y , int z ) {
if ( ( y / x ) != 1 ) return ( ( y / z ) != 1 ) ? y : z ;
return ( ( x / z ) != 1 ) ? x : z ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(48);
param0.add(11);
param0.add(50);
param0.add(21);
param0.add(94);
param0.add(22);
param0.add(3);
param0.add(67);
param0.add(59);
param0.add(50);
List<Integer> param1 = new ArrayList<>();
param1.add(63);
param1.add(55);
param1.add(89);
param1.add(71);
param1.add(39);
param1.add(44);
param1.add(41);
param1.add(62);
param1.add(2);
param1.add(11);
List<Integer> param2 = new ArrayList<>();
param2.add(56);
param2.add(84);
param2.add(96);
param2.add(74);
param2.add(42);
param2.add(86);
param2.add(68);
param2.add(94);
param2.add(83);
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());
}
} | 6,028 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF_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_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF_1{
static int f_gold ( String str ) {
int n = str . length ( ) ;
int maxlen = 0 ;
int sum [ ] [ ] = new int [ n ] [ n ] ;
for ( int i = 0 ;
i < n ;
i ++ ) sum [ i ] [ i ] = str . charAt ( i ) - '0' ;
for ( int len = 2 ;
len <= n ;
len ++ ) {
for ( int i = 0 ;
i < n - len + 1 ;
i ++ ) {
int j = i + len - 1 ;
int k = len / 2 ;
sum [ i ] [ j ] = sum [ i ] [ j - k ] + sum [ j - k + 1 ] [ j ] ;
if ( len % 2 == 0 && sum [ i ] [ j - k ] == sum [ ( j - k + 1 ) ] [ j ] && len > maxlen ) maxlen = len ;
}
}
return maxlen ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("jNkTf");
param0.add("7");
param0.add("100001101001");
param0.add("fRXyQrTUjEk");
param0.add("908404");
param0.add("0101010010");
param0.add("svq");
param0.add("19");
param0.add("11100010001");
param0.add("O HgwJyOVfnV");
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());
}
} | 6,029 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_GIVEN_MATRIX_SPARSE_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_GIVEN_MATRIX_SPARSE_NOT{
static boolean f_gold ( int array [ ] [ ] , int m , int n ) {
int counter = 0 ;
for ( int i = 0 ;
i < m ;
++ i ) for ( int j = 0 ;
j < n ;
++ j ) if ( array [ i ] [ j ] == 0 ) ++ counter ;
return ( counter > ( ( m * n ) / 2 ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{79,48,59,39,33,8,8,47,45,54,35,40,70,98,70,81,48,52,74,83,67,46,14,60,47,12},new int[]{95,48,3,19,14,81,2,3,72,55,5,88,98,97,75,61,42,46,49,14,20,16,9,66,21,66},new int[]{98,83,30,38,55,85,23,83,32,84,5,6,76,59,12,22,33,28,36,9,2,9,18,24,65,73},new int[]{58,62,97,33,65,60,11,68,52,60,54,47,82,66,16,20,75,55,38,20,24,46,11,22,1,75},new int[]{3,83,28,4,72,68,64,23,94,1,3,97,46,21,47,41,23,63,1,15,24,36,71,40,87,56},new int[]{87,70,71,85,10,80,33,46,87,36,16,25,15,97,13,87,87,74,37,21,37,4,99,23,31,53},new int[]{37,67,88,27,27,86,32,90,65,26,93,49,91,15,13,9,96,69,56,80,87,41,91,59,46,85},new int[]{65,76,25,87,63,66,39,69,8,43,67,97,94,91,99,34,71,70,95,74,88,21,42,80,16,68},new int[]{48,96,30,38,71,98,72,14,43,37,38,71,37,89,51,85,27,7,20,36,96,75,76,58,50,36},new int[]{77,5,4,57,52,38,62,82,49,46,36,97,70,53,83,74,74,42,72,11,88,75,11,92,40,10},new int[]{72,83,15,66,57,13,85,41,9,30,67,28,1,72,92,51,76,44,52,6,74,33,31,10,71,50},new int[]{42,98,1,67,51,2,18,44,14,56,4,74,34,39,50,27,48,33,67,18,12,86,32,5,90,75},new int[]{90,43,82,96,38,98,79,41,78,36,3,73,74,65,74,34,85,45,77,37,89,9,86,54,10,64},new int[]{53,62,86,98,61,70,18,81,57,96,65,59,12,21,96,31,16,66,13,61,31,70,43,64,84,46},new int[]{53,28,98,9,34,67,46,53,57,37,85,4,29,96,59,32,45,22,52,27,66,20,57,18,97,99},new int[]{32,80,33,40,8,25,13,66,26,33,30,16,37,16,93,50,58,89,87,3,26,42,56,60,81,15},new int[]{46,79,18,27,8,63,81,54,19,21,3,40,86,31,18,50,11,22,80,68,60,3,82,52,30,11},new int[]{48,21,33,73,88,88,15,97,46,7,33,59,91,17,80,76,58,84,10,78,93,47,3,2,17,17},new int[]{67,93,87,24,28,29,20,48,26,25,25,79,47,31,10,55,48,18,59,57,89,20,14,44,34,52},new int[]{87,26,22,3,40,62,64,72,52,71,11,8,79,37,28,81,21,63,90,22,74,85,26,92,57,89},new int[]{80,51,54,52,35,3,13,49,36,3,12,41,91,28,29,30,40,58,73,60,95,61,52,75,91,94},new int[]{90,99,20,51,37,85,46,21,62,17,16,48,61,89,79,55,5,51,88,68,38,62,42,38,16,52},new int[]{95,40,54,18,67,64,52,21,52,98,84,96,48,21,34,84,18,2,47,24,78,15,10,87,88,77},new int[]{89,24,15,93,26,70,3,93,64,62,85,67,6,88,66,14,19,22,33,89,91,7,1,39,37,50},new int[]{40,20,50,29,3,11,66,40,11,65,13,97,87,70,1,37,25,99,81,99,95,66,88,47,54,91},new int[]{36,44,14,79,81,56,56,12,7,31,74,3,18,83,27,18,75,6,46,70,69,1,95,92,12,52}});
param0.add(new int[][]{new int[]{67,41,95,96,46,82,5,44,41,3,55,19,1,18,59,62,56,37,60,49,5,79,68},new int[]{85,12,82,41,38,52,33,75,11,46,3,21,13,93,20,42,52,95,74,69,93,1,81},new int[]{95,24,13,91,41,41,85,4,98,89,97,25,13,33,18,51,54,58,24,7,33,7,65},new int[]{60,17,53,18,95,76,49,84,61,35,53,48,45,88,73,51,51,8,61,97,76,15,38},new int[]{30,58,80,23,72,21,10,98,40,36,54,67,79,97,94,59,86,77,93,36,77,84,5},new int[]{89,42,17,26,96,26,88,89,86,21,97,39,96,57,83,24,6,85,68,12,15,92,16},new int[]{45,85,17,37,50,90,60,57,3,31,32,44,66,61,32,47,2,49,38,99,21,43,95},new int[]{46,50,98,39,76,81,51,16,48,63,37,54,73,30,3,41,74,61,13,4,66,92,49},new int[]{25,60,8,35,12,70,77,66,35,88,40,57,38,97,31,44,6,13,3,68,28,58,72},new int[]{68,78,45,66,58,8,25,90,77,1,55,60,98,54,71,60,18,86,29,48,78,75,4},new int[]{56,95,41,62,43,81,32,55,95,35,61,11,34,70,27,99,59,90,27,33,71,16,35},new int[]{68,16,57,90,76,38,11,75,31,81,12,62,9,3,58,51,88,25,80,72,44,14,15},new int[]{99,24,44,97,54,95,80,78,12,1,86,77,27,55,54,40,65,87,6,16,14,36,87},new int[]{53,8,42,68,29,57,22,34,4,87,69,56,6,81,15,83,81,31,61,7,18,2,81},new int[]{26,43,12,57,23,79,80,26,70,36,33,28,27,72,97,52,13,90,45,1,44,81,38},new int[]{43,82,40,76,62,67,88,72,93,2,18,87,14,1,15,88,32,39,68,31,44,54,16},new int[]{99,50,21,42,96,76,40,78,48,32,66,65,10,62,39,16,41,78,59,50,50,5,83},new int[]{92,92,66,22,29,40,40,16,41,61,64,13,63,76,63,10,91,12,20,88,79,54,47},new int[]{61,68,76,59,98,25,18,44,3,95,61,77,12,39,79,83,92,13,75,39,6,5,65},new int[]{49,12,1,19,6,19,8,86,44,61,23,88,6,52,85,67,13,74,64,46,54,96,86},new int[]{2,39,65,66,43,54,6,96,27,88,90,65,26,65,23,89,26,78,76,94,37,83,3},new int[]{46,32,63,18,68,16,40,27,77,56,92,52,14,6,15,3,22,48,40,51,13,95,21},new int[]{28,13,95,35,18,71,3,37,46,77,61,89,52,94,46,90,59,3,19,49,79,14,49}});
param0.add(new int[][]{new int[]{54,80,87,13,57,54,87,86,35,80,99,77,74,67,40,17,2,58,15,68,51,81,39,80,19,51,2,90},new int[]{91,30,51,84,38,71,75,65,72,14,2,93,22,1,32,18,39,41,69,18,94,21,5,12,50,10,89,85},new int[]{47,9,38,92,12,34,4,35,7,80,82,20,97,74,6,41,22,60,39,84,81,73,79,73,73,36,17,6},new int[]{7,58,59,11,60,12,79,26,93,56,6,87,74,91,87,6,5,35,80,73,16,81,40,92,98,30,73,39},new int[]{60,35,37,72,3,55,13,47,47,87,50,33,52,15,76,10,24,24,77,62,57,66,61,28,33,40,45,65},new int[]{71,80,22,56,73,49,79,4,8,73,27,16,27,35,47,36,73,19,86,37,95,73,46,57,29,19,44,9},new int[]{62,34,21,35,50,13,75,34,74,12,95,30,75,30,10,48,49,8,75,31,15,95,65,86,69,4,59,46},new int[]{55,27,65,56,88,34,92,9,71,38,35,64,72,19,25,82,80,77,46,33,51,55,35,74,24,76,16,14},new int[]{7,7,61,69,10,36,34,91,47,37,52,23,46,16,65,85,1,85,58,61,61,15,36,62,39,88,85,35},new int[]{62,81,60,3,16,7,82,42,49,99,49,10,67,87,10,33,63,71,1,33,93,98,48,58,21,26,82,47},new int[]{3,5,47,13,28,79,22,51,58,41,74,52,88,43,84,70,40,24,29,83,59,23,63,58,2,32,32,81},new int[]{86,20,78,78,53,93,60,99,51,87,70,30,99,16,52,14,99,21,96,48,5,86,89,48,15,79,55,57},new int[]{92,16,18,8,89,97,99,62,26,58,19,25,3,87,56,45,94,76,80,23,93,56,61,63,33,5,83,91},new int[]{54,92,96,19,75,7,54,70,29,40,35,11,21,41,72,65,41,60,58,58,81,11,44,32,50,71,48,58},new int[]{36,34,49,92,54,31,67,69,91,4,23,34,43,5,47,66,93,20,40,19,80,57,77,24,31,21,7,20},new int[]{64,55,68,71,33,93,9,44,10,50,92,24,66,88,72,92,11,55,67,33,61,29,88,76,58,14,42,34},new int[]{17,23,25,42,98,72,96,14,43,38,14,96,30,93,14,86,43,17,16,57,52,22,47,63,11,76,3,39},new int[]{45,3,94,41,65,72,49,18,42,81,49,8,19,8,5,47,47,71,23,13,20,62,43,44,49,61,83,97},new int[]{15,97,29,80,77,46,44,71,86,75,45,76,70,44,41,68,78,76,60,13,75,37,49,34,2,94,43,86},new int[]{23,12,73,12,86,62,39,61,9,26,31,73,97,48,74,10,31,55,6,39,3,80,38,48,99,35,47,93},new int[]{84,75,94,3,7,20,17,77,30,36,45,68,98,73,17,29,87,69,19,38,71,86,84,36,55,51,85,44},new int[]{60,12,36,49,28,96,10,20,61,87,4,68,46,19,94,49,96,96,16,69,19,51,92,59,78,2,34,40},new int[]{13,54,9,18,58,3,33,77,52,93,97,12,8,71,6,69,11,71,54,6,80,64,28,82,19,98,28,46},new int[]{54,68,45,43,98,63,32,70,81,32,31,39,23,32,84,87,99,91,43,97,96,42,65,98,74,5,94,88},new int[]{17,29,96,93,95,20,40,37,56,74,98,15,22,83,18,75,81,99,6,27,38,29,72,57,40,26,94,49},new int[]{79,96,80,43,95,44,13,62,30,10,98,65,59,46,90,56,93,38,68,40,76,19,30,20,19,80,56,5},new int[]{75,90,50,89,77,6,72,68,73,94,5,21,80,36,36,88,7,49,69,16,44,78,86,59,86,49,26,33},new int[]{94,79,16,65,95,4,84,59,56,78,36,5,47,40,4,17,21,17,57,27,26,35,26,1,32,13,88,72}});
param0.add(new int[][]{new int[]{39,82,13,38,88,30,51,34,53,58,54,87,30,72,77,48,55,34,87},new int[]{70,86,28,68,52,48,78,42,68,21,27,35,41,53,76,18,39,24,61},new int[]{16,38,21,46,59,52,95,97,88,90,43,83,11,25,40,18,37,47,3},new int[]{53,9,6,43,54,79,86,88,68,7,79,21,70,88,77,63,90,45,64},new int[]{99,16,85,5,92,38,81,26,48,18,1,43,8,59,28,47,51,31,90},new int[]{4,87,14,14,97,51,81,65,25,1,22,32,46,85,90,21,85,42,44},new int[]{8,96,27,63,63,65,73,66,9,54,89,93,26,72,58,71,25,67,22},new int[]{76,76,64,6,24,23,29,82,7,76,93,28,54,79,47,45,53,93,24},new int[]{13,30,78,6,4,21,75,30,78,42,11,19,36,4,40,35,64,19,56},new int[]{61,15,99,3,59,34,15,16,3,74,70,81,11,56,24,79,31,95,30},new int[]{86,49,28,58,35,14,20,83,59,88,68,16,29,74,54,64,39,89,34},new int[]{79,40,23,60,79,43,88,1,21,5,51,30,20,72,63,28,56,80,2},new int[]{46,70,71,17,9,12,98,70,89,72,99,25,10,9,58,67,91,97,55},new int[]{84,89,11,89,91,37,34,88,35,68,92,53,90,40,12,56,16,51,32},new int[]{18,89,27,59,9,86,56,35,70,5,30,5,53,42,75,63,28,14,20},new int[]{21,83,86,48,24,16,5,97,65,79,51,42,2,36,2,70,64,31,19},new int[]{94,81,22,39,33,76,10,41,94,25,33,15,78,17,42,53,46,69,50},new int[]{45,90,30,89,62,86,37,35,8,38,64,17,6,20,92,83,84,28,41},new int[]{51,97,5,17,16,93,15,74,74,98,24,25,66,71,95,44,47,39,41}});
param0.add(new int[][]{new int[]{45,34,40,86,92,30,11,67,66,18,30,47,69,10,98,55,85,39,46,78},new int[]{49,6,79,57,39,75,91,82,91,18,86,11,46,94,96,93,31,73,98,60},new int[]{40,27,52,15,85,14,9,6,47,67,46,13,29,75,53,71,80,56,88,30},new int[]{36,24,45,38,71,83,10,64,26,16,31,30,33,89,69,93,59,14,19,91},new int[]{23,84,17,24,58,16,79,4,84,37,91,9,15,34,52,9,24,1,81,30},new int[]{34,83,45,69,25,64,16,98,87,41,68,1,17,10,81,9,87,16,48,1},new int[]{26,8,59,97,5,70,41,34,95,34,92,34,76,27,83,84,90,83,39,81},new int[]{58,55,22,85,45,11,27,6,71,61,97,72,78,81,93,9,21,60,96,37},new int[]{2,25,36,41,31,74,4,1,70,34,45,6,19,23,5,72,48,3,66,90},new int[]{37,17,39,34,86,86,49,64,89,98,23,48,76,47,34,81,77,11,67,20},new int[]{6,4,27,99,14,45,92,84,63,36,50,24,98,16,81,89,94,33,13,4},new int[]{51,11,25,40,65,38,4,73,67,76,81,43,87,55,28,26,49,51,97,41},new int[]{10,68,99,15,59,15,1,35,8,40,58,29,36,63,51,54,41,83,92,8},new int[]{26,35,58,32,90,53,11,57,43,67,9,95,98,74,29,24,8,40,83,34},new int[]{46,96,63,39,20,39,69,98,23,30,29,13,24,95,72,27,18,31,78,68},new int[]{15,75,63,63,95,80,19,52,10,53,88,55,94,73,85,47,85,6,80,99},new int[]{67,79,6,51,9,27,54,1,69,13,39,14,64,7,85,72,90,66,87,55},new int[]{55,88,18,52,43,74,81,63,6,8,62,71,28,93,4,49,75,79,66,7},new int[]{34,21,47,36,76,83,10,31,91,83,12,14,43,91,51,23,45,27,66,63},new int[]{96,65,87,13,87,14,33,15,79,29,14,84,77,95,47,48,44,17,78,82}});
param0.add(new int[][]{new int[]{42,12,11,27,59,79,58,6,82,98,65,11,95,88,36,77,61,28,50,28,70,14,95,80,20,65,34,20,88,46,82},new int[]{1,96,71,86,2,9,74,20,86,87,24,96,26,21,1,69,81,31,10,37,36,39,1,27,75,69,30,36,72,28,98},new int[]{18,65,21,19,89,33,81,88,43,82,73,24,95,93,47,28,17,84,14,83,26,60,11,59,10,88,15,56,70,87,6},new int[]{66,16,52,35,8,58,36,40,75,53,58,99,56,22,72,14,68,44,41,64,8,50,37,36,15,19,45,15,43,53,88},new int[]{73,21,71,14,86,73,13,23,69,2,31,46,92,48,21,1,90,16,38,69,86,43,49,64,6,67,78,26,55,14,57},new int[]{82,84,40,95,26,69,81,37,37,83,31,49,24,25,55,95,60,16,31,51,68,54,21,67,88,72,67,88,60,43,52},new int[]{44,44,36,89,17,72,6,53,12,96,46,89,63,84,33,17,61,24,53,7,51,32,98,74,86,38,31,72,95,97,81},new int[]{85,45,94,87,79,71,68,12,22,58,22,85,14,7,37,88,36,92,47,34,5,72,97,54,65,46,12,66,25,46,8},new int[]{58,48,97,83,67,99,28,41,80,28,94,82,76,16,59,78,65,11,28,7,95,29,58,68,14,38,47,12,69,66,18},new int[]{53,14,30,70,31,44,10,1,79,76,33,79,65,54,25,96,51,80,53,66,10,42,46,57,41,39,51,13,4,28,44},new int[]{54,45,31,12,11,54,5,58,36,27,84,18,78,61,49,31,31,88,10,13,19,43,28,9,34,51,17,83,15,49,62},new int[]{71,83,64,18,74,48,19,52,99,50,98,49,8,73,43,85,52,19,77,83,81,43,73,63,80,45,43,80,63,6,52},new int[]{47,20,16,17,59,58,56,14,39,1,66,15,76,22,23,53,97,17,76,24,66,62,46,63,87,9,31,72,14,68,50},new int[]{64,94,13,2,45,48,57,13,11,31,34,7,24,90,24,66,26,61,9,15,8,28,86,76,37,4,92,35,72,93,93},new int[]{58,80,95,77,7,36,55,28,37,2,85,62,43,9,46,14,29,63,16,14,40,80,94,86,32,1,45,48,43,44,47},new int[]{94,14,6,63,92,78,80,77,40,19,74,67,13,14,25,74,76,76,62,25,55,23,61,98,32,39,61,86,4,47,69},new int[]{20,46,96,16,79,16,86,10,30,20,25,69,74,88,15,91,74,97,2,5,13,37,92,8,99,14,46,19,19,74,67},new int[]{26,34,34,85,1,51,34,55,91,6,24,45,7,94,21,77,88,14,36,59,10,26,6,33,18,40,9,13,53,42,24},new int[]{46,40,59,19,6,86,68,5,55,32,75,24,8,90,1,58,83,20,23,33,5,76,13,52,87,6,35,28,2,1,94},new int[]{42,82,23,86,81,20,39,5,51,50,92,87,74,50,40,87,39,9,82,71,15,81,8,99,36,16,40,8,10,74,96},new int[]{5,36,89,45,15,98,24,17,30,40,27,73,31,71,56,30,92,84,18,29,22,32,41,22,54,94,87,93,78,87,75},new int[]{59,94,45,80,53,46,25,43,26,66,24,35,93,77,76,88,48,63,86,59,84,12,50,91,30,51,33,95,56,91,73},new int[]{90,74,86,27,96,47,7,33,42,67,94,71,10,49,19,46,49,12,91,86,43,34,87,35,71,24,10,89,6,19,48},new int[]{50,66,60,59,81,36,45,77,60,2,24,89,58,34,38,90,92,63,80,85,47,1,1,35,21,11,78,39,42,65,74},new int[]{1,87,40,86,74,21,38,82,16,26,8,16,44,92,83,64,79,2,75,95,40,35,57,56,55,12,59,94,94,35,94},new int[]{35,64,13,52,28,88,14,55,63,81,51,1,98,97,42,13,24,33,40,85,88,4,86,63,34,82,70,42,76,57,36},new int[]{82,10,12,74,92,50,4,74,42,91,76,86,97,6,92,64,83,2,64,15,59,43,24,48,95,16,36,69,21,11,88},new int[]{23,19,93,9,85,70,28,44,28,79,48,78,38,24,77,41,46,73,97,50,81,7,44,66,98,7,17,99,27,98,16},new int[]{98,24,28,57,76,91,95,14,27,87,68,78,75,5,61,43,86,36,1,48,11,36,92,5,4,44,32,72,18,61,82},new int[]{74,52,92,80,86,94,3,63,40,42,69,93,95,57,55,88,47,23,92,24,92,16,35,73,40,76,98,25,29,18,99},new int[]{54,18,49,72,31,41,51,75,72,54,76,74,42,72,63,89,4,3,19,34,63,25,93,77,45,46,5,85,30,93,18}});
param0.add(new int[][]{new int[]{31,83,88,14,5,89,29,61,90,20,15,11,57,68,68,11,8,72,4,96,69,42,26,96,55,42,48,89},new int[]{40,32,27,51,96,95,49,46,65,66,48,71,86,96,95,51,1,50,9,65,17,35,5,63,50,53,79,46},new int[]{93,89,15,91,97,99,42,74,43,90,50,41,42,41,72,51,64,28,69,81,53,64,66,44,55,72,48,79},new int[]{62,71,53,27,36,9,97,5,58,99,91,90,45,50,27,67,76,83,80,58,81,46,94,56,32,46,81,10},new int[]{74,60,54,4,68,71,98,4,2,96,21,48,68,21,32,82,61,63,74,27,29,15,14,38,35,87,2,62},new int[]{41,71,71,83,67,39,88,38,84,65,84,84,19,11,19,75,36,98,81,19,67,3,75,41,17,29,39,86},new int[]{48,58,48,48,26,84,42,94,22,89,29,59,71,53,21,30,2,17,68,42,66,97,95,64,89,52,1,62},new int[]{65,64,7,14,73,61,98,8,26,55,98,72,19,22,47,61,90,86,99,82,91,18,12,45,88,77,40,53},new int[]{22,19,71,37,53,90,29,28,20,14,8,98,52,59,97,22,90,83,99,94,60,75,16,83,43,53,49,88},new int[]{83,71,91,80,33,91,19,23,42,21,77,80,64,67,39,12,38,87,5,1,98,52,12,73,14,48,85,68},new int[]{32,34,50,56,19,81,20,17,23,32,83,56,96,87,94,88,91,21,27,10,53,57,3,80,90,72,13,25},new int[]{83,78,50,75,10,50,44,86,45,27,82,63,17,99,37,99,51,27,6,20,25,15,83,53,95,14,27,36},new int[]{37,59,5,5,54,95,23,26,55,77,58,63,23,88,20,83,89,11,39,80,40,75,48,26,70,93,6,6},new int[]{64,69,75,19,11,23,73,83,23,53,45,10,34,6,95,52,87,20,27,90,23,83,65,21,64,48,12,38},new int[]{79,9,79,55,45,30,21,52,55,31,83,17,42,68,86,55,63,49,57,16,18,5,10,96,12,52,44,51},new int[]{39,29,63,29,91,23,16,41,88,1,22,43,14,43,74,84,40,53,78,85,25,88,95,18,4,69,71,69},new int[]{98,52,2,83,27,24,72,22,50,24,42,39,57,89,94,90,20,63,59,71,92,64,64,9,71,95,12,42},new int[]{81,10,77,3,50,2,50,52,87,83,32,80,18,15,63,16,59,44,23,14,89,14,20,93,66,22,97,36},new int[]{85,87,81,24,2,41,66,56,86,31,41,79,10,49,68,18,90,50,37,18,77,48,30,77,10,41,38,90},new int[]{27,4,40,48,20,70,90,81,98,41,56,2,46,57,28,21,60,60,42,89,87,90,16,58,56,76,89,36},new int[]{33,9,29,18,59,89,83,54,22,11,44,9,26,91,76,36,93,73,91,89,89,1,95,61,19,65,82,57},new int[]{30,78,79,87,39,53,77,49,34,1,22,74,71,77,39,25,40,91,21,69,56,40,98,65,19,60,95,43},new int[]{66,4,31,83,70,97,24,72,60,73,21,47,47,19,21,6,85,61,15,93,83,45,8,29,22,34,8,51},new int[]{51,96,68,8,55,48,54,62,71,29,83,95,84,5,39,96,61,87,55,47,69,93,79,1,49,75,11,34},new int[]{19,60,96,25,29,36,41,92,13,28,5,58,97,76,71,89,36,89,21,32,60,31,92,53,92,1,69,22},new int[]{21,47,54,12,93,11,86,4,54,25,52,84,14,86,54,19,31,38,52,24,88,16,87,45,14,97,25,81},new int[]{15,92,56,70,82,14,58,46,62,61,25,16,10,35,23,18,19,8,25,80,10,18,30,63,74,56,98,20},new int[]{60,17,40,74,8,64,22,37,82,10,36,27,21,30,6,78,17,60,87,42,87,9,19,33,19,20,94,18}});
param0.add(new int[][]{new int[]{86,39,88,64,64,37,73,80,25,79,52,51,19,48,70,73,48,63,88,16,65,48,18,28,86,68,39,5,55,72,32,80,36,99,34},new int[]{48,65,65,73,63,75,55,30,69,9,72,86,91,97,40,82,5,27,81,60,14,1,26,40,66,25,90,67,99,91,72,58,90,15,32},new int[]{23,80,72,57,90,2,90,95,85,57,31,8,50,43,82,6,52,75,80,62,45,2,12,63,85,70,26,16,70,81,7,32,37,94,98},new int[]{15,21,54,26,33,81,87,40,92,3,85,11,78,60,22,41,52,56,59,35,32,46,52,94,7,87,37,97,93,62,28,5,49,82,22},new int[]{76,57,20,20,21,61,42,5,77,98,55,66,19,93,10,63,95,65,56,79,97,53,34,6,10,40,40,31,85,64,41,69,13,87,53},new int[]{6,47,51,40,50,99,74,22,81,41,4,80,4,43,91,22,21,15,63,17,34,66,39,55,36,66,97,38,55,87,18,97,31,89,65},new int[]{75,45,99,54,56,42,4,40,26,96,88,36,81,33,95,53,81,39,28,25,75,8,69,40,16,30,37,78,71,31,87,42,22,36,17},new int[]{40,19,21,62,43,32,10,82,99,29,95,44,95,94,16,14,1,50,32,96,88,83,15,1,84,6,45,63,14,11,83,74,76,96,53},new int[]{78,42,30,64,97,13,16,42,44,61,2,67,81,11,51,80,99,2,42,54,51,51,96,3,16,49,5,44,75,56,74,48,72,43,7},new int[]{30,13,90,78,1,17,42,50,87,19,86,72,78,4,86,39,8,43,49,48,19,60,27,24,74,73,13,59,32,34,55,93,24,84,56},new int[]{71,81,10,4,78,71,76,75,47,17,8,27,67,21,59,79,47,26,30,40,80,44,54,37,11,9,94,73,42,82,49,19,47,75,59},new int[]{59,76,5,83,49,4,17,80,90,96,52,83,24,8,81,92,32,77,76,70,34,47,63,68,15,66,20,92,55,81,77,17,8,81,73},new int[]{42,41,17,73,48,41,60,14,37,36,68,95,62,2,48,41,85,76,85,91,11,4,18,24,71,25,27,57,81,80,62,4,18,72,8},new int[]{38,10,4,2,15,22,30,4,70,25,43,60,74,55,1,50,1,20,99,52,27,42,12,51,10,3,91,27,69,82,98,21,70,1,36},new int[]{11,38,88,76,14,36,99,12,60,88,12,30,57,95,77,4,74,43,20,3,15,30,26,91,88,21,96,31,22,65,79,32,38,97,20},new int[]{91,68,2,42,32,36,69,28,59,46,34,14,94,2,13,60,38,54,14,30,2,83,99,20,65,77,61,1,27,14,15,26,38,65,4},new int[]{94,68,94,65,13,26,89,89,27,10,22,34,32,84,91,6,97,95,53,88,53,77,54,35,61,52,29,25,88,35,73,83,95,13,11},new int[]{12,14,83,83,42,39,88,9,99,11,13,11,78,75,96,30,3,76,68,78,15,98,46,92,71,64,45,22,71,80,4,91,60,66,22},new int[]{10,29,19,7,13,42,4,98,67,72,47,42,54,72,3,6,58,55,12,96,62,46,83,78,22,16,98,36,25,92,67,32,11,15,2},new int[]{39,67,9,76,60,65,51,86,92,15,34,71,79,34,76,71,69,38,88,26,17,85,91,85,6,18,96,7,6,71,95,49,98,78,5},new int[]{89,10,38,46,2,86,85,95,58,25,7,14,61,61,82,75,78,32,28,84,74,64,1,2,99,54,29,8,67,29,96,95,76,83,94},new int[]{16,74,25,21,88,17,42,20,7,10,85,58,88,82,14,47,87,59,23,53,34,50,51,84,32,98,50,40,25,31,74,35,58,43,89},new int[]{5,35,15,66,10,31,80,97,78,68,70,1,30,19,73,2,61,77,37,72,59,3,97,99,16,68,24,35,33,60,28,17,11,27,92},new int[]{39,7,84,66,13,77,85,75,47,93,22,38,11,24,13,88,42,29,14,23,68,95,41,30,43,73,91,16,37,18,14,51,46,22,39},new int[]{23,80,42,44,50,99,71,76,57,68,10,39,4,25,24,53,15,31,64,84,50,87,61,3,34,82,81,4,59,35,7,46,32,20,56},new int[]{81,91,69,77,25,97,84,86,33,18,24,71,98,70,66,41,36,92,65,4,12,25,19,19,49,30,20,90,30,67,11,12,5,27,54},new int[]{36,75,39,62,33,96,58,29,40,24,58,25,78,3,30,99,26,82,62,77,62,81,14,34,26,29,13,34,65,21,99,61,33,24,12},new int[]{23,36,37,10,68,81,51,93,63,32,8,2,58,68,39,59,54,45,31,52,95,18,61,50,4,42,2,48,84,51,62,36,1,75,16},new int[]{51,30,65,41,21,92,69,37,82,90,94,83,58,69,15,70,76,53,26,33,68,21,7,29,57,75,23,49,54,14,85,93,45,3,66},new int[]{11,77,15,97,25,31,51,21,51,45,28,85,69,24,81,54,14,30,37,83,59,40,15,29,49,61,90,47,81,46,86,36,50,69,87},new int[]{37,31,92,34,89,71,27,44,82,49,16,10,66,50,66,83,61,7,16,13,56,84,87,71,84,25,92,2,24,53,44,14,30,58,51},new int[]{44,46,26,61,98,73,52,50,29,62,67,4,16,14,96,64,58,51,62,45,90,59,59,76,17,94,65,69,7,98,36,79,6,88,79},new int[]{31,74,85,47,10,66,82,98,24,16,63,86,6,15,96,33,45,6,39,8,23,83,46,11,35,26,1,41,10,11,45,65,49,49,14},new int[]{38,49,34,11,77,96,90,2,3,18,14,32,14,86,13,55,66,86,28,47,88,40,8,51,28,76,95,22,9,70,99,98,71,78,25},new int[]{59,83,92,82,62,79,88,91,65,45,82,96,99,72,63,35,89,96,93,83,11,89,33,3,54,62,71,65,67,71,69,30,79,6,16}});
param0.add(new int[][]{new int[]{93,31,15,23,44,84,3,83,86,47,93},new int[]{79,70,36,92,40,24,18,39,41,97,9},new int[]{11,36,96,6,22,15,34,56,34,68,34},new int[]{52,69,93,9,63,72,7,78,84,87,16},new int[]{53,5,78,45,85,29,33,32,34,93,78},new int[]{41,43,9,62,60,66,82,69,35,97,64},new int[]{34,33,87,61,11,92,47,56,60,85,3},new int[]{32,44,45,55,46,6,67,16,12,34,11},new int[]{24,47,38,60,54,10,71,86,75,86,4},new int[]{80,33,53,67,42,69,3,87,73,15,96},new int[]{22,38,56,60,17,44,73,96,75,3,27}});
param0.add(new int[][]{new int[]{65}});
List<Integer> param1 = new ArrayList<>();
param1.add(25);
param1.add(22);
param1.add(27);
param1.add(11);
param1.add(14);
param1.add(22);
param1.add(24);
param1.add(20);
param1.add(10);
param1.add(0);
List<Integer> param2 = new ArrayList<>();
param2.add(16);
param2.add(12);
param2.add(20);
param2.add(9);
param2.add(14);
param2.add(20);
param2.add(19);
param2.add(22);
param2.add(8);
param2.add(0);
for(int i =0; i < param0.size(); i+=2 ){
for(int j =0; j < param0.get(i).length; ++j ){
for(int k =0; k < param0.get(i)[j].length; ++k){
param0.get(i)[j][k]= param0.get(i)[j][k] %2 == 0 || param0.get(i)[j][k] % 3 == 0 ? 0 : param0.get(i)[j][k];
}
}
}
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());
}
} | 6,030 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_CHARACTERS_POSITION_ENGLISH_ALPHABETS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_CHARACTERS_POSITION_ENGLISH_ALPHABETS{
static int f_gold ( String str ) {
int result = 0 ;
for ( int i = 0 ;
i < str . length ( ) ;
i ++ ) {
if ( i == ( str . charAt ( i ) - 'a' ) || i == ( str . charAt ( i ) - 'A' ) ) {
result ++ ;
}
}
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("lLkhFeZGcb");
param0.add("ABcED");
param0.add("geeksforgeeks");
param0.add("Alphabetical");
param0.add("abababab");
param0.add("bcdefgxyz");
param0.add("cBzaqx L");
param0.add(" bcd");
param0.add("11");
param0.add("MqqKY");
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());
}
} | 6,031 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/N_TH_TERM_SERIES_2_12_36_80_150.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_TERM_SERIES_2_12_36_80_150{
public static int f_gold ( int n ) {
return ( n * n ) + ( n * n * n ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(90);
param0.add(95);
param0.add(22);
param0.add(29);
param0.add(62);
param0.add(40);
param0.add(52);
param0.add(21);
param0.add(33);
param0.add(11);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,032 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_STRINGS_ADJACENT_CHARACTERS_DIFFERENCE_ONE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_ADJACENT_CHARACTERS_DIFFERENCE_ONE{
static long f_gold ( int n ) {
long [ ] [ ] dp = new long [ n + 1 ] [ 27 ] ;
for ( int i = 0 ;
i < n + 1 ;
i ++ ) {
for ( int j = 0 ;
j < 27 ;
j ++ ) {
dp [ i ] [ j ] = 0 ;
}
}
for ( int i = 0 ;
i <= 25 ;
i ++ ) {
dp [ 1 ] [ i ] = 1 ;
}
for ( int i = 2 ;
i <= n ;
i ++ ) {
for ( int j = 0 ;
j <= 25 ;
j ++ ) {
if ( j == 0 ) {
dp [ i ] [ j ] = dp [ i - 1 ] [ j + 1 ] ;
}
else {
dp [ i ] [ j ] = ( dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ] ) ;
}
}
}
long sum = 0 ;
for ( int i = 0 ;
i <= 25 ;
i ++ ) {
sum = ( sum + dp [ n ] [ i ] ) ;
}
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(7);
param0.add(47);
param0.add(72);
param0.add(66);
param0.add(71);
param0.add(56);
param0.add(61);
param0.add(68);
param0.add(78);
param0.add(22);
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());
}
} | 6,033 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DIVISIBILITY_BY_7.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DIVISIBILITY_BY_7{
static boolean f_gold ( int num ) {
if ( num < 0 ) return f_gold ( - num ) ;
if ( num == 0 || num == 7 ) return true ;
if ( num < 10 ) return false ;
return f_gold ( num / 10 - 2 * ( num - num / 10 * 10 ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(0);
param0.add(-21);
param0.add(7);
param0.add(63);
param0.add(84);
param0.add(73);
param0.add(81);
param0.add(-10);
param0.add(47);
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());
}
} | 6,034 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_OF_SUB_STRINGS_THAT_DO_NOT_CONTAIN_ALL_THE_CHARACTERS_FROM_THE_SET_A_B_C_AT_THE_SAME_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 COUNT_OF_SUB_STRINGS_THAT_DO_NOT_CONTAIN_ALL_THE_CHARACTERS_FROM_THE_SET_A_B_C_AT_THE_SAME_TIME{
static int f_gold ( char str [ ] , int n ) {
int ans = ( n * ( n + 1 ) ) / 2 ;
int a_index = 0 ;
int b_index = 0 ;
int c_index = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( str [ i ] == 'a' ) {
a_index = i + 1 ;
ans -= Math . min ( b_index , c_index ) ;
}
else if ( str [ i ] == 'b' ) {
b_index = i + 1 ;
ans -= Math . min ( a_index , c_index ) ;
}
else {
c_index = i + 1 ;
ans -= Math . min ( a_index , b_index ) ;
}
}
return ans ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<char [ ]> param0 = new ArrayList<>();
param0.add(new char[]{'E','F','G','I','K','M','O','Q','Q','S','T','U','X','Z','a','b','c','d','e','f','h','h','i','j','l','m','s','s','t','x','y','y'});
param0.add(new char[]{'1','3','5','6','6','4','6','1','8','0','3','8','3','5','9','6','8','5','7','2','3','7','1','7','6','1','8','9','3','6','7','0','8','5','8','3','2','6','7','4','5','1','3','3','7','5','6'});
param0.add(new char[]{'0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1'});
param0.add(new char[]{'c','Z','s','F','v',' ','Y','e','u','I','P','y','j','o','n'});
param0.add(new char[]{'0','0','2','2','3','3','4','5','6','6','6','7','8','9'});
param0.add(new char[]{'0','1','0','1','1','1','1','0','0','0','1','1','0','0','0','0','0','0','1','1','1','1','0','1','0','1','1','1','1','1','0','0'});
param0.add(new char[]{'E','G','G','J','L','O','O','S','T','U','V','V','Y','c','d','e','f','g','g','j','m','n','p','q','q','r','u','u','x'});
param0.add(new char[]{'8','1','9','6','4','3','8','2','8','5','5','3','0','1','7','3','1','5','4','8','2','3','3','2','2','4','9','6','3','1','4','1','4','0','4','9','4','8','4','7'});
param0.add(new char[]{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'});
param0.add(new char[]{'j','z','H','Q'});
List<Integer> param1 = new ArrayList<>();
param1.add(23);
param1.add(24);
param1.add(15);
param1.add(9);
param1.add(8);
param1.add(19);
param1.add(21);
param1.add(36);
param1.add(33);
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());
}
} | 6,035 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MODULUS_TWO_FLOAT_DOUBLE_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 MODULUS_TWO_FLOAT_DOUBLE_NUMBERS{
static double f_gold ( double a , double b ) {
if ( a < 0 ) a = - a ;
if ( b < 0 ) b = - b ;
double mod = a ;
while ( mod >= b ) mod = mod - b ;
if ( a < 0 ) return - mod ;
return mod ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(3243.229719038493);
param0.add(-4362.665881044217);
param0.add(7255.066257575837);
param0.add(-6929.554320261099);
param0.add(3569.942027998315);
param0.add(-6513.849053096595);
param0.add(7333.183189243961);
param0.add(-2856.1752826258803);
param0.add(9787.228111241662);
param0.add(-1722.873699288031);
List<Double> param1 = new ArrayList<>();
param1.add(5659.926861939672);
param1.add(-9196.507113304497);
param1.add(2623.200060506935);
param1.add(-3009.0234530313287);
param1.add(6920.809419868375);
param1.add(-70.95992406437102);
param1.add(580.3500610971768);
param1.add(-9625.97442825802);
param1.add(2419.6844962423256);
param1.add(-8370.700544254058);
for(int i = 0; i < param0.size(); ++i)
{
if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,036 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_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 FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K{
static boolean f_gold ( int a1 [ ] , int a2 [ ] , int a3 [ ] , int n1 , int n2 , int n3 , int sum ) {
for ( int i = 0 ;
i < n1 ;
i ++ ) for ( int j = 0 ;
j < n2 ;
j ++ ) for ( int k = 0 ;
k < n3 ;
k ++ ) if ( a1 [ i ] + a2 [ j ] + a3 [ k ] == sum ) return true ;
return false ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,9,10,19,24,25,26,30,36,43,44,49,52,62,66,69,72,77,80,80,82,84,90,93,94,98});
param0.add(new int[]{-24,-80,-72,80,-96,-94,64,18,12,16,74,16,54,66,-96,-90,54,72,-32,-2,90,-18,-98,12,-42,-30,-82,-56,-86,40});
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[]{28,15,21,28,85,68,24});
param0.add(new int[]{-86,-82,-66,-44,-44,-38,-22,-6,-2,14,26,40,54,58,60,66,72,80,94,96,98});
param0.add(new int[]{1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0,0,1,0,1});
param0.add(new int[]{44,53,85,85,86,88,93});
param0.add(new int[]{70,-38,62,-34,74,-32,-58,-34,-54});
param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{41,64,39,96,54,54,57,4,82,43,44,56,1});
List<int [ ]> param1 = new ArrayList<>();
param1.add(new int[]{4,8,17,20,22,25,27,30,31,33,35,35,38,41,49,51,60,61,66,67,69,82,84,85,86,88});
param1.add(new int[]{30,-60,-24,18,40,44,-40,62,66,-38,50,-74,-42,-86,-82,-8,50,-72,-2,-48,-38,-20,-8,56,-32,68,94,80,-48,0});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1});
param1.add(new int[]{57,46,47,49,16,81,60});
param1.add(new int[]{-96,-86,-74,-56,-52,-42,-32,-22,-16,-10,-4,-4,10,42,48,52,58,62,84,90,96});
param1.add(new int[]{0,1,1,1,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1});
param1.add(new int[]{4,5,8,15,29,40,91});
param1.add(new int[]{48,-86,-18,14,88,92,-56,-8,-74});
param1.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{44,58,40,87,22,82,8,81,88,42,15,14,81});
List<int [ ]> param2 = new ArrayList<>();
param2.add(new int[]{12,14,17,20,22,27,29,31,32,38,41,43,56,59,59,64,66,67,68,69,71,76,83,83,85,99});
param2.add(new int[]{-24,80,50,-56,-92,20,86,-42,-30,96,40,-32,-64,54,-38,-72,-70,54,-28,98,60,98,-12,-30,-30,68,-66,68,-58,52});
param2.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1});
param2.add(new int[]{76,49,6,44,71,24,57});
param2.add(new int[]{-92,-92,-90,-82,-62,-44,-42,-40,-38,-36,-22,-20,-8,12,22,26,30,44,54,64,86});
param2.add(new int[]{1,0,1,0,0,0,1,1,1,0,1,1,1,0,0,0,1,1,0,0,1,1,1,0,1,0,0,0,0,1,1,1,0,0});
param2.add(new int[]{30,53,71,75,76,82,84});
param2.add(new int[]{8,8,32,76,76,94,22,-60,-42});
param2.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1});
param2.add(new int[]{64,20,24,42,37,46,6,47,12,93,8,5,11});
List<Integer> param3 = new ArrayList<>();
param3.add(25);
param3.add(26);
param3.add(14);
param3.add(6);
param3.add(13);
param3.add(25);
param3.add(5);
param3.add(6);
param3.add(15);
param3.add(7);
List<Integer> param4 = new ArrayList<>();
param4.add(18);
param4.add(22);
param4.add(14);
param4.add(5);
param4.add(20);
param4.add(25);
param4.add(3);
param4.add(6);
param4.add(14);
param4.add(8);
List<Integer> param5 = new ArrayList<>();
param5.add(16);
param5.add(20);
param5.add(14);
param5.add(5);
param5.add(17);
param5.add(23);
param5.add(4);
param5.add(6);
param5.add(10);
param5.add(6);
List<Integer> param6 = new ArrayList<>();
param6.add(222);
param6.add(21);
param6.add(2);
param6.add(73);
param6.add(6);
param6.add(0);
param6.add(3);
param6.add(7);
param6.add(13);
param6.add(10);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i),param5.get(i),param6.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i),param4.get(i),param5.get(i),param6.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,037 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_UNIT_DIGIT_X_RAISED_POWER_Y_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_UNIT_DIGIT_X_RAISED_POWER_Y_1{
static int f_gold ( int x , int y ) {
x = x % 10 ;
if ( y != 0 ) y = y % 4 + 4 ;
return ( ( ( int ) ( Math . pow ( x , y ) ) ) % 10 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(37);
param0.add(70);
param0.add(26);
param0.add(9);
param0.add(82);
param0.add(95);
param0.add(43);
param0.add(7);
param0.add(19);
param0.add(49);
List<Integer> param1 = new ArrayList<>();
param1.add(17);
param1.add(52);
param1.add(23);
param1.add(96);
param1.add(71);
param1.add(36);
param1.add(40);
param1.add(27);
param1.add(56);
param1.add(28);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,038 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE{
public static int f_gold ( int base ) {
base = ( base - 2 ) ;
base = base / 2 ;
return base * ( base + 1 ) / 2 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(95);
param0.add(49);
param0.add(10);
param0.add(73);
param0.add(74);
param0.add(40);
param0.add(10);
param0.add(94);
param0.add(64);
param0.add(16);
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());
}
} | 6,039 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES{
static boolean f_gold ( int p ) {
double checkNumber = Math . pow ( 2 , p ) - 1 ;
double nextval = 4 % checkNumber ;
for ( int i = 1 ;
i < p - 1 ;
i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber ;
return ( nextval == 0 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(11);
param0.add(27);
param0.add(31);
param0.add(47);
param0.add(3);
param0.add(14);
param0.add(41);
param0.add(72);
param0.add(39);
param0.add(22);
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());
}
} | 6,040 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_SUM_CHOOSING_MINIMUM_PAIRS_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_CHOOSING_MINIMUM_PAIRS_ARRAY{
static int f_gold ( int [ ] A , int n ) {
int min_val = Arrays . stream ( A ) . min ( ) . getAsInt ( ) ;
return ( min_val * ( n - 1 ) ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,9,10,13,13,15,16,16,17,18,18,23,24,24,25,25,25,32,32,36,38,39,40,40,40,41,43,48,51,56,59,60,70,72,74,76,79,83,83,85,88,90,92,94,95,95});
param0.add(new int[]{46,-10,56,46,-30,-68,50,8,72,-2,38,-12,20,-30,-38,-78,-18,-34,16,94,30,-86,36,88,-26,-56,-98,-92,96,-70,-78,-60,20,-54,36,-12,78,24,14,98,-14,-88,76,12});
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});
param0.add(new int[]{59,64,29,99,29,63,29,63,88,94,82,92,99,56,51,74,73,22,42,37,21,36,68,69,16,81,3,85,67,13,41,87,67,99,83,47,95,90,24,31,1,54,61,35,51,13});
param0.add(new int[]{-98,-92,-82,-78,-76,-72,-64,-60,-44,-28,-22,-22,-14,-12,2,2,4,6,10,14,16,24,28,28,32,34,36,46,46,48,52,60,62,66,68,72,74,84,96});
param0.add(new int[]{1,1,1,1,1,0,1});
param0.add(new int[]{5,20,34,37,51,55,89});
param0.add(new int[]{-70,78,-52,-82,-24,96,-32,8,-50,38,-76,-56,64,-28,-22,94,52,-32,66,-34,-30,14,42,98,96,-56,50,50,-24,-56,70,6,78,86,52,-40,92,46,46,-14,-74,40});
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[]{51,42,29,30,65,42,7,2,90,85,1,47,79,98,90,66,47,54,32,83});
List<Integer> param1 = new ArrayList<>();
param1.add(26);
param1.add(25);
param1.add(32);
param1.add(45);
param1.add(31);
param1.add(6);
param1.add(3);
param1.add(33);
param1.add(26);
param1.add(19);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,041 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_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 SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_1{
static int f_gold ( int m , int n ) {
int T [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ;
for ( int i = 0 ;
i < m + 1 ;
i ++ ) {
for ( int j = 0 ;
j < n + 1 ;
j ++ ) {
if ( i == 0 || j == 0 ) T [ i ] [ j ] = 0 ;
else if ( i < j ) T [ i ] [ j ] = 0 ;
else if ( j == 1 ) T [ i ] [ j ] = i ;
else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ] ;
}
}
return T [ m ] [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(10);
param0.add(5);
param0.add(2);
param0.add(83);
param0.add(91);
param0.add(18);
param0.add(83);
param0.add(98);
param0.add(43);
param0.add(31);
List<Integer> param1 = new ArrayList<>();
param1.add(4);
param1.add(2);
param1.add(8);
param1.add(7);
param1.add(0);
param1.add(53);
param1.add(41);
param1.add(53);
param1.add(37);
param1.add(20);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
}
| 6,042 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MEDIAN_OF_TWO_SORTED_ARRAYS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MEDIAN_OF_TWO_SORTED_ARRAYS{
static int f_gold ( int ar1 [ ] , int ar2 [ ] , int n ) {
int i = 0 ;
int j = 0 ;
int count ;
int m1 = - 1 , m2 = - 1 ;
for ( count = 0 ;
count <= n ;
count ++ ) {
if ( i == n ) {
m1 = m2 ;
m2 = ar2 [ 0 ] ;
break ;
}
else if ( j == n ) {
m1 = m2 ;
m2 = ar1 [ 0 ] ;
break ;
}
if ( ar1 [ i ] < ar2 [ j ] ) {
m1 = m2 ;
m2 = ar1 [ i ] ;
i ++ ;
}
else {
m1 = m2 ;
m2 = ar2 [ j ] ;
j ++ ;
}
}
return ( m1 + m2 ) / 2 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,6,18,21,23,27,44,44,69,72,78,88,90,98});
param0.add(new int[]{90,54,24,-10,-84,-74,58,96,-28,-92,-18,90,70,-60,72,78,10,42,-2,-18,-38,-16,18,-86,40,-46,-38,66,20,-16,48});
param0.add(new int[]{0,1,1});
param0.add(new int[]{53,17,94,21,16,75,67,51,44,71,65,82});
param0.add(new int[]{-96,-92,-80,-68,-64,-64,-60,-56,-52,-50,-50,-22,-20,-4,-2,0,6,20,22,28,38,40,48,50,56,58,64,64,80,82,90,92,92,92});
param0.add(new int[]{0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,1});
param0.add(new int[]{8,15,17,19,21,32,34,38,41,41,49,49,51,54,54,56,56,57,59,63,70,74,79,79,84,84,86,88,89,93,98});
param0.add(new int[]{96,-42,-94,-46,-68,76,8,16,-54,-94,76,24,94,10,34,78,-30,0,-52,80,98,-58,92,12,26,64});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1});
param0.add(new int[]{61,69,66,3});
List<int [ ]> param1 = new ArrayList<>();
param1.add(new int[]{6,12,16,18,26,34,48,48,49,56,61,79,81,89});
param1.add(new int[]{-72,-62,14,-58,70,54,88,-40,-94,4,60,-16,-38,-98,-70,-46,66,42,26,36,56,-4,32,30,-46,-42,-72,44,16,4,24});
param1.add(new int[]{0,1,1});
param1.add(new int[]{98,50,8,11,80,41,59,24,94,41,75,78});
param1.add(new int[]{-88,-72,-72,-58,-54,-50,-48,-34,-24,-14,-14,-14,-10,-6,4,12,16,18,26,30,32,34,40,46,52,54,58,62,62,72,82,82,92,98});
param1.add(new int[]{1,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,1,1,0,1,0,1,1,0,1,0,0,0,0,1});
param1.add(new int[]{5,6,17,18,22,29,32,33,36,44,45,47,59,59,60,65,67,68,69,71,72,76,78,81,84,85,85,86,86,87,92});
param1.add(new int[]{88,78,-26,10,84,34,56,-8,-30,46,48,20,26,-78,96,44,92,-44,-86,24,-58,-96,-86,-12,-98,18});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1});
param1.add(new int[]{39,84,97,15});
List<Integer> param2 = new ArrayList<>();
param2.add(12);
param2.add(16);
param2.add(2);
param2.add(10);
param2.add(25);
param2.add(40);
param2.add(29);
param2.add(17);
param2.add(17);
param2.add(3);
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());
}
} | 6,043 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/STEINS_ALGORITHM_FOR_FINDING_GCD_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 STEINS_ALGORITHM_FOR_FINDING_GCD_1{
static int f_gold ( int a , int b ) {
if ( a == b ) return a ;
if ( a == 0 ) return b ;
if ( b == 0 ) return a ;
if ( ( ~ a & 1 ) == 1 ) {
if ( ( b & 1 ) == 1 ) return f_gold ( a >> 1 , b ) ;
else return f_gold ( a >> 1 , b >> 1 ) << 1 ;
}
if ( ( ~ b & 1 ) == 1 ) return f_gold ( a , b >> 1 ) ;
if ( a > b ) return f_gold ( ( a - b ) >> 1 , b ) ;
return f_gold ( ( b - a ) >> 1 , a ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(52);
param0.add(36);
param0.add(12);
param0.add(69);
param0.add(45);
param0.add(7);
param0.add(45);
param0.add(62);
param0.add(96);
param0.add(89);
List<Integer> param1 = new ArrayList<>();
param1.add(29);
param1.add(94);
param1.add(6);
param1.add(7);
param1.add(11);
param1.add(51);
param1.add(55);
param1.add(86);
param1.add(63);
param1.add(12);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,044 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNTING_PAIRS_PERSON_CAN_FORM_PAIR_ONE_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 COUNTING_PAIRS_PERSON_CAN_FORM_PAIR_ONE_1{
static int f_gold ( int x ) {
int dp [ ] = new int [ x + 1 ] ;
dp [ 0 ] = dp [ 1 ] = 1 ;
for ( int i = 2 ;
i <= x ;
i ++ ) dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ] ;
return dp [ x ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(22);
param0.add(92);
param0.add(15);
param0.add(81);
param0.add(3);
param0.add(30);
param0.add(88);
param0.add(4);
param0.add(43);
param0.add(92);
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());
}
} | 6,045 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM{
static boolean f_gold ( int arr [ ] , int n , int x ) {
int i ;
for ( i = 0 ;
i < n - 1 ;
i ++ ) if ( arr [ i ] > arr [ i + 1 ] ) break ;
int l = ( i + 1 ) % n ;
int r = i ;
while ( l != r ) {
if ( arr [ l ] + arr [ r ] == x ) return true ;
if ( arr [ l ] + arr [ r ] < x ) l = ( l + 1 ) % n ;
else r = ( n + r - 1 ) % n ;
}
return false ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,8,10,15,18,19,20,20,21,22,26,30,32,34,43,45,50,50,51,52,53,56,57,58,62,63,65,82,86,91,91,92,92,93,97});
param0.add(new int[]{30,-34,86,-30,-26,2,90,8,26,-8,-8,0,-86,68,22,72,-76,48,-24,90,-22,-58,-54,90,-12,-12,88,72,-58,68,84,22,60,66,-52,-38,-90,62,30,-26,88,-36,92,32,-32,-42,-90,-40,-10});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{20,68,40,19,74,69});
param0.add(new int[]{-98,-94,-94,-94,-90,-88,-88,-78,-74,-70,-68,-66,-64,-62,-54,-50,-40,-40,-40,-40,-28,-22,-22,-18,-14,-12,0,6,6,8,12,20,22,26,28,36,42,44,48,52,56,60,68,84});
param0.add(new int[]{1,1,0});
param0.add(new int[]{12,22,38,76,80,86});
param0.add(new int[]{-36,-10,-26,34,-50,66,-2,-14,-62,60,-48,94,-70,6,-60,-90,28,-4,-20,-52,40,-76,-92,-14,54,4,-58,38,-74,-96,-88,86,-54,98,48,68,78,-28,-80,-46});
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[]{69,99,25,52,41,51,7,33,42,91,85,57,91,89,86,11,70,67,30,92,81,23,51,98,85,5,50,44});
List<Integer> param1 = new ArrayList<>();
param1.add(17);
param1.add(41);
param1.add(26);
param1.add(4);
param1.add(28);
param1.add(2);
param1.add(4);
param1.add(26);
param1.add(17);
param1.add(21);
List<Integer> param2 = new ArrayList<>();
param2.add(30);
param2.add(10);
param2.add(1);
param2.add(88);
param2.add(94);
param2.add(60);
param2.add(3);
param2.add(37);
param2.add(20);
param2.add(27);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,046 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION_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 DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION_1{
static int f_gold ( int p [ ] , int n ) {
int m [ ] [ ] = new int [ n ] [ n ] ;
int i , j , k , L , q ;
for ( i = 1 ;
i < n ;
i ++ ) m [ i ] [ i ] = 0 ;
for ( L = 2 ;
L < n ;
L ++ ) {
for ( i = 1 ;
i < n - L + 1 ;
i ++ ) {
j = i + L - 1 ;
if ( j == n ) continue ;
m [ i ] [ j ] = Integer . MAX_VALUE ;
for ( k = i ;
k <= j - 1 ;
k ++ ) {
q = m [ i ] [ k ] + m [ k + 1 ] [ j ] + p [ i - 1 ] * p [ k ] * p [ j ] ;
if ( q < m [ i ] [ j ] ) m [ i ] [ j ] = q ;
}
}
}
return m [ 1 ] [ n - 1 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,4,11,17,26,33,37,51,62,70,71,73,74,74,81,82,83,90,95,98,98});
param0.add(new int[]{-50,74,-8,2,-24,28,-86,34,-36,92,-70,-98});
param0.add(new int[]{0,0,0,1,1,1,1});
param0.add(new int[]{4,73,3,88,79,40,25,58,39,53,32,20,95,60,60,98,23,95,42,26,95,14,43,97,30,83,29,37,74,72,37,31,32,83,57,40,56,95,8,79,67,62});
param0.add(new int[]{-92,-88,-88,-88,-86,-84,-80,-78,-76,-74,-72,-68,-68,-66,-62,-42,-34,-30,-28,-24,-20,-14,-12,-10,-8,-8,-8,6,10,26,26,36,38,42,46,48,48,54,54,58,60,66,70,76,78,80,82,98});
param0.add(new int[]{1,1,0,1,0,0,1});
param0.add(new int[]{8,25,38,39,41,57,71,89});
param0.add(new int[]{76,-28,20,62,-44,8,-46,52,26,76,22,38,-36,10,2,-86,42,-62,-68,-56,10});
param0.add(new int[]{0,0,0,0,1,1,1});
param0.add(new int[]{98,96,76,76,8,4,53,34,54,10,98,46,58,7,36,72,32,59,52,99,40,52,50,43,26,93,76,90,12,82,31,50,55,34,61,78});
List<Integer> param1 = new ArrayList<>();
param1.add(20);
param1.add(10);
param1.add(3);
param1.add(41);
param1.add(47);
param1.add(4);
param1.add(6);
param1.add(18);
param1.add(5);
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());
}
} | 6,047 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_EQUAL_POINT_STRING_BRACKETS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_EQUAL_POINT_STRING_BRACKETS{
static int f_gold ( String str ) {
int len = str . length ( ) ;
int open [ ] = new int [ len + 1 ] ;
int close [ ] = new int [ len + 1 ] ;
int index = - 1 ;
open [ 0 ] = 0 ;
close [ len ] = 0 ;
if ( str . charAt ( 0 ) == '(' ) open [ 1 ] = 1 ;
if ( str . charAt ( len - 1 ) == ')' ) close [ len - 1 ] = 1 ;
for ( int i = 1 ;
i < len ;
i ++ ) {
if ( str . charAt ( i ) == '(' ) open [ i + 1 ] = open [ i ] + 1 ;
else open [ i + 1 ] = open [ i ] ;
}
for ( int i = len - 2 ;
i >= 0 ;
i -- ) {
if ( str . charAt ( i ) == ')' ) close [ i ] = close [ i + 1 ] + 1 ;
else close [ i ] = close [ i + 1 ] ;
}
if ( open [ len ] == 0 ) return len ;
if ( close [ 0 ] == 0 ) return 0 ;
for ( int i = 0 ;
i <= len ;
i ++ ) if ( open [ i ] == close [ i ] ) index = i ;
return index ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("(())))(");
param0.add("))");
param0.add("((");
param0.add("))(()(()()(");
param0.add(")((()(()");
param0.add("))(()");
param0.add("()))");
param0.add("()");
param0.add("1100110");
param0.add("dhfSnebD");
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());
}
} | 6,048 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CIRCLE_LATTICE_POINTS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CIRCLE_LATTICE_POINTS{
static int f_gold ( int r ) {
if ( r <= 0 ) return 0 ;
int result = 4 ;
for ( int x = 1 ;
x < r ;
x ++ ) {
int ySquare = r * r - x * x ;
int y = ( int ) Math . sqrt ( ySquare ) ;
if ( y * y == ySquare ) result += 4 ;
}
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(34);
param0.add(56);
param0.add(90);
param0.add(47);
param0.add(36);
param0.add(63);
param0.add(21);
param0.add(76);
param0.add(18);
param0.add(75);
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());
}
} | 6,049 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_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 LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_1{
static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > hM = new HashMap < Integer , Integer > ( ) ;
int sum = 0 ;
int max_len = 0 ;
int ending_index = - 1 ;
int start_index = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
arr [ i ] = ( arr [ i ] == 0 ) ? - 1 : 1 ;
}
for ( int i = 0 ;
i < n ;
i ++ ) {
sum += arr [ i ] ;
if ( sum == 0 ) {
max_len = i + 1 ;
ending_index = i ;
}
if ( hM . containsKey ( sum + n ) ) {
if ( max_len < i - hM . get ( sum + n ) ) {
max_len = i - hM . get ( sum + n ) ;
ending_index = i ;
}
}
else hM . put ( sum + n , i ) ;
}
for ( int i = 0 ;
i < n ;
i ++ ) {
arr [ i ] = ( arr [ i ] == - 1 ) ? 0 : 1 ;
}
int end = ending_index - max_len + 1 ;
System . out . println ( end + " to " + ending_index ) ;
return max_len ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,6,16,16,18,19,22,39,40,42,60,66,69,70,70,73,74,80,99});
param0.add(new int[]{-88,-66});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{85,98,67,27,98,13,96,32,26,44,32});
param0.add(new int[]{-96,-94,-90,-88,-86,-66,-64,-52,-46,-46,-42,-40,-38,-32,-28,-22,-16,-10,-8,-8,-4,2,10,26,26,28,28,40,40,42,50,60,66,68,72,74,86,92,94});
param0.add(new int[]{1,1,1,1,1,1,0,0,0});
param0.add(new int[]{25,64,86});
param0.add(new int[]{-4,78,-76,12,4,-38,-98,-26,-8,-98,56,0,-34,36,-90,-36,54,-68,12,-44,62,60,-34,-52,18});
param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1});
param0.add(new int[]{2,25,45,98,71,8,58,94,53});
List<Integer> param1 = new ArrayList<>();
param1.add(9);
param1.add(1);
param1.add(19);
param1.add(8);
param1.add(34);
param1.add(4);
param1.add(1);
param1.add(17);
param1.add(9);
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());
}
} | 6,050 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MAXIMUM_AVERAGE_SUM_PARTITION_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_AVERAGE_SUM_PARTITION_ARRAY{
static double f_gold ( int [ ] A , int K ) {
int n = A . length ;
double [ ] pre_sum = new double [ n + 1 ] ;
pre_sum [ 0 ] = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ] ;
double [ ] dp = new double [ n ] ;
double sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i ) ;
for ( int k = 0 ;
k < K - 1 ;
k ++ ) for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ;
return dp [ 0 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,11,14,27,32,37,39,49,52,53,57,62,67,67,68,69,76,77,78,81,85,85,87,91,91,91,99,99,99});
param0.add(new int[]{80,12,32,44,24,82,-40,42,26,36,58,52,-34,44,12,-18,-72,52,2,-8,22,-18,98,-60,62,92,-46,20,20,-46,52,94,0,-28,-22,80,26,-92,-50,48,-80});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{32,16,67,53,99,56,80,92,84,21,36,46,94,31,63,67,59,88,41,17,74,47,95,12,27,99,32,4,82,31,65,40,93,72,23,33,93,9,62,47});
param0.add(new int[]{-92,-86,-80,-78,-72,-70,-70,-68,-66,-62,-60,-54,-54,-52,-52,-40,-36,-32,-28,-26,-22,-22,-20,-16,-16,-8,0,6,8,10,14,18,20,42,46,52,60,66,68,70,74,86,88,88,92,94,98});
param0.add(new int[]{1,0,0,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0});
param0.add(new int[]{1,1,3,3,6,7,10,11,12,13,16,16,22,23,24,27,28,30,30,30,31,33,35,35,39,40,41,52,52,58,59,60,61,61,66,66,71,73,74,75,75,76,80,83,85,95,96,97,97});
param0.add(new int[]{28,-52,48,96,54,94,60,18});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{26,80,12,87,90,98,46,91,38,46,20,64,53,4,60,87,44,88,22,30});
List<Integer> param1 = new ArrayList<>();
param1.add(24);
param1.add(26);
param1.add(15);
param1.add(36);
param1.add(36);
param1.add(16);
param1.add(34);
param1.add(7);
param1.add(31);
param1.add(19);
for(int i = 0; i < param0.size(); ++i)
{
if(Math.abs(1 - (0.0000001 + Math.abs(f_gold(param0.get(i),param1.get(i))) )/ (Math.abs(f_filled(param0.get(i),param1.get(i))) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,051 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FRIENDS_PAIRING_PROBLEM_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 FRIENDS_PAIRING_PROBLEM_2{
static int f_gold ( int n ) {
int a = 1 , b = 2 , c = 0 ;
if ( n <= 2 ) {
return n ;
}
for ( int i = 3 ;
i <= n ;
i ++ ) {
c = b + ( i - 1 ) * a ;
a = b ;
b = c ;
}
return c ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(24);
param0.add(1);
param0.add(91);
param0.add(90);
param0.add(89);
param0.add(29);
param0.add(3);
param0.add(60);
param0.add(75);
param0.add(14);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,052 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_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 MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K{
static int f_gold ( int a [ ] , int n , int k ) {
int result = 0 ;
for ( int i = 0 ;
i < n ;
++ i ) {
if ( a [ i ] != 1 && a [ i ] > k ) {
result = result + Math . min ( a [ i ] % k , k - a [ i ] % k ) ;
}
else {
result = result + k - a [ i ] ;
}
}
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,7,27,32,36,37,44,48,50,64,86});
param0.add(new int[]{-22,6,-20,60,-74,98,52,-22});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{77,11,51,11,84,79,43,12,14,50,15,6,85,32,74,49,7,2,58});
param0.add(new int[]{-90,-66,-64,-58,-46,-44,-32,-30,-30,-22,-18,-14,12,12,18,34,44,60,70,70,74,76,86,98,98});
param0.add(new int[]{1,1,0,0,0,0,1,0,0,1,1,1,0,1,1,1,0,0,0,1,1,1,1,0,1,0,1,1,1,1,1,0,0,0,0,1,1});
param0.add(new int[]{9,22,27,27,37,53,53,56,63,73,76,81,82});
param0.add(new int[]{-46,60,80,80,42,-98,30,-48,4,-32,-78,40,52,26,88,4,22,62,88,-94,2,0,58,38,52,-50,-52,58,-62,30,-38,-8,-82,-66});
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});
param0.add(new int[]{42,69,93,82,8,23,73,1,77,39,49,4,95,85});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(5);
param1.add(23);
param1.add(9);
param1.add(12);
param1.add(36);
param1.add(10);
param1.add(18);
param1.add(19);
param1.add(12);
List<Integer> param2 = new ArrayList<>();
param2.add(10);
param2.add(4);
param2.add(29);
param2.add(17);
param2.add(22);
param2.add(31);
param2.add(11);
param2.add(19);
param2.add(22);
param2.add(13);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,053 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MINIMUM_PRODUCT_K_INTEGERS_ARRAY_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 MINIMUM_PRODUCT_K_INTEGERS_ARRAY_POSITIVE_INTEGERS{
public static int f_gold ( int [ ] arr , int n , int k ) {
PriorityQueue < Integer > pq = new PriorityQueue < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) pq . add ( arr [ i ] ) ;
int count = 0 , ans = 1 ;
while ( pq . isEmpty ( ) == false && count < k ) {
ans = ans * pq . element ( ) ;
pq . remove ( ) ;
count ++ ;
}
return ans ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{57,66,91});
param0.add(new int[]{-44,86,28,-70,-12,96,-10,74,-50,-52,-6,64,-62,92,-24,90,-26,-4,-92,-24,-84,76,-92,62,-62,-86,-86,-14,50,30,62,2,-88,-78,-48});
param0.add(new int[]{0,0,1,1});
param0.add(new int[]{99,85,37,27,55,20,76,38,33,78,24,80,74,42,15,16,97,51,71,92,18,63,47,10,6,72,40,21,14,68,98,49,48,64,50,66,44,1,26,55,61,43,9,16,8,42,51,98,1});
param0.add(new int[]{-58,-12,16,18,24});
param0.add(new int[]{0,0,1,0,0,1,0,1,0,0,0,0,0,1,1,1});
param0.add(new int[]{5,10,13,14,19,21,22,25,28,36,39,44,46,53,54,55,55,67,73,75,77,78,80,84,91,94,96});
param0.add(new int[]{18,-44,46,64,86,-36,8,-10,-50,-98,-6,-38,-34,14,-34,86,58,-30,76,6,38,98,78,56,-56,-66,-58,62,92,-94});
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,74,28,75,84,52,5,19,80,12,76,14,28,63,30,29,16,74,28,48,97,77,62,19,67,26,14,44,52,86,9,31,41,14,66,27,36,98,48,37,2,12,2});
List<Integer> param1 = new ArrayList<>();
param1.add(2);
param1.add(29);
param1.add(3);
param1.add(36);
param1.add(2);
param1.add(8);
param1.add(23);
param1.add(23);
param1.add(13);
param1.add(27);
List<Integer> param2 = new ArrayList<>();
param2.add(2);
param2.add(21);
param2.add(3);
param2.add(47);
param2.add(3);
param2.add(15);
param2.add(23);
param2.add(20);
param2.add(17);
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());
}
} | 6,054 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_PALINDROME_SUB_STRINGS_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_PALINDROME_SUB_STRINGS_STRING{
static int f_gold ( char str [ ] , int n ) {
int dp [ ] [ ] = new int [ n ] [ n ] ;
boolean P [ ] [ ] = new boolean [ n ] [ n ] ;
for ( int i = 0 ;
i < n ;
i ++ ) P [ i ] [ i ] = true ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) {
if ( str [ i ] == str [ i + 1 ] ) {
P [ i ] [ i + 1 ] = true ;
dp [ i ] [ i + 1 ] = 1 ;
}
}
for ( int gap = 2 ;
gap < n ;
gap ++ ) {
for ( int i = 0 ;
i < n - gap ;
i ++ ) {
int j = gap + i ;
if ( str [ i ] == str [ j ] && P [ i + 1 ] [ j - 1 ] ) P [ i ] [ j ] = true ;
if ( P [ i ] [ j ] == true ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i + 1 ] [ j ] + 1 - dp [ i + 1 ] [ j - 1 ] ;
else dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i + 1 ] [ j ] - dp [ i + 1 ] [ j - 1 ] ;
}
}
return dp [ 0 ] [ n - 1 ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<char [ ]> param0 = new ArrayList<>();
param0.add(new char[]{'E','E','J','P','T','U','X','Y','Z','e','f','h','l','m','n','o','z'});
param0.add(new char[]{'8','7','3','4','9','5','3','1','4','0','6','8','2','5','8','3','5','2','8','6','6','3','5','7','5','5','3','7'});
param0.add(new char[]{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'});
param0.add(new char[]{'f','E','e','z','B','o','i','v','K','u','P','C','z','f','k','J','t','R','t','A','f','G','D','X','H','e','p','l','l','k','Z','Y','u','g','H','C','f','J','H','W'});
param0.add(new char[]{'0','0','0','1','1','1','1','1','1','2','2','2','3','3','3','3','3','4','4','4','4','4','4','5','5','5','5','6','6','7','7','9','9','9','9','9','9'});
param0.add(new char[]{'1','0','1','1','0','0','1','1','1','0','1','0','1','1','0','1','0','1','1','1','1','1','0','1','1','0','1','0','1','1','0','0','1','0','1','0','0','0','0','0','1','1','0','1','0','1'});
param0.add(new char[]{'C','C','D','F','L','M','P','X','a','f','i','j','w'});
param0.add(new char[]{'7','9','0','2','8','0','7','5','9','4','5','4','8','1','9','5','3','2','4','1','2'});
param0.add(new char[]{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'});
param0.add(new char[]{'m','X','N','M'});
List<Integer> param1 = new ArrayList<>();
param1.add(11);
param1.add(27);
param1.add(23);
param1.add(27);
param1.add(35);
param1.add(43);
param1.add(9);
param1.add(16);
param1.add(32);
param1.add(3);
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());
}
} | 6,055 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS{
public static int f_gold ( int a , int b , int c ) {
if ( ( a < b && b < c ) || ( c < b && b < a ) ) return b ;
else if ( ( b < a && a < c ) || ( c < a && a < b ) ) return a ;
else return c ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(56);
param0.add(56);
param0.add(36);
param0.add(71);
param0.add(3);
param0.add(84);
param0.add(30);
param0.add(82);
param0.add(90);
param0.add(38);
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(60);
param1.add(56);
param1.add(54);
param1.add(70);
param1.add(57);
param1.add(80);
param1.add(54);
param1.add(70);
param1.add(4);
List<Integer> param2 = new ArrayList<>();
param2.add(82);
param2.add(17);
param2.add(51);
param2.add(6);
param2.add(81);
param2.add(47);
param2.add(85);
param2.add(32);
param2.add(55);
param2.add(5);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,056 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SWAP_TWO_NIBBLES_BYTE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SWAP_TWO_NIBBLES_BYTE{
static int f_gold ( int x ) {
return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(99);
param0.add(66);
param0.add(97);
param0.add(95);
param0.add(42);
param0.add(95);
param0.add(89);
param0.add(3);
param0.add(84);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,057 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1{
static int f_gold ( int n ) {
int ans = 0 , temp = 0 , num ;
for ( int i = 1 ;
i <= n && temp < n ;
i ++ ) {
temp = i - 1 ;
num = 1 ;
while ( temp < n ) {
if ( temp + i <= n ) ans += ( i * num ) ;
else ans += ( ( n - temp ) * num ) ;
temp += i ;
num ++ ;
}
}
return ans ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(35);
param0.add(93);
param0.add(7);
param0.add(81);
param0.add(80);
param0.add(47);
param0.add(7);
param0.add(41);
param0.add(59);
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());
}
} | 6,058 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_FIBONACCI_NUMBERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_FIBONACCI_NUMBERS{
static int f_gold ( int n ) {
if ( n <= 0 ) return 0 ;
int fibo [ ] = new int [ n + 1 ] ;
fibo [ 0 ] = 0 ;
fibo [ 1 ] = 1 ;
int sum = fibo [ 0 ] + fibo [ 1 ] ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ] ;
sum += fibo [ i ] ;
}
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(9);
param0.add(50);
param0.add(7);
param0.add(21);
param0.add(21);
param0.add(91);
param0.add(11);
param0.add(25);
param0.add(62);
param0.add(4);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,059 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LONGEST_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS{
static int f_gold ( int arr1 [ ] , int n , int arr2 [ ] , int m ) {
int table [ ] = new int [ m ] ;
for ( int j = 0 ;
j < m ;
j ++ ) table [ j ] = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int current = 0 ;
for ( int j = 0 ;
j < m ;
j ++ ) {
if ( arr1 [ i ] == arr2 [ j ] ) if ( current + 1 > table [ j ] ) table [ j ] = current + 1 ;
if ( arr1 [ i ] > arr2 [ j ] ) if ( table [ j ] > current ) current = table [ j ] ;
}
}
int result = 0 ;
for ( int i = 0 ;
i < m ;
i ++ ) if ( table [ i ] > result ) result = table [ i ] ;
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,7,9,35,43,51,51,66,88});
param0.add(new int[]{-52,52,-92,-46,-94,30,-36,18,-98,22,-36,96,-88,-50,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});
param0.add(new int[]{5,74,29});
param0.add(new int[]{-84,-74,-70,-62,-56,-56,-52,-2,6,24,28,44,44,52});
param0.add(new int[]{0,0,0,1,0,1,0,0,1,1,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0});
param0.add(new int[]{3,4,4,7,15,15,16,22,32,32,37,39,39,41,43,46,47,47,49,75,79,80,86,88,93});
param0.add(new int[]{70,-64,0,52,32,-98,38,-8,34,70,98,58,-48,-60,-28,-22,-72,82,-98,-36});
param0.add(new int[]{0,0,1,1,1,1,1,1});
param0.add(new int[]{46,87,98});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(7);
param1.add(36);
param1.add(1);
param1.add(8);
param1.add(17);
param1.add(19);
param1.add(16);
param1.add(7);
param1.add(2);
List<int [ ]> param2 = new ArrayList<>();
param2.add(new int[]{10,21,38,50,65,67,87,93,99});
param2.add(new int[]{-58,40,56,-62,-92,-94,40,18,-2,-76,-78,-14,44,84,4});
param2.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param2.add(new int[]{57,33,48});
param2.add(new int[]{-98,-96,-88,-66,-32,-26,-24,-20,-4,20,48,74,90,96});
param2.add(new int[]{1,0,1,1,0,0,0,0,1,1,1,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,0});
param2.add(new int[]{9,12,15,20,22,27,28,28,30,31,35,39,47,58,58,60,73,74,76,78,80,86,95,96,98});
param2.add(new int[]{-18,88,-40,-52,30,-10,-18,-56,84,-22,-64,80,-14,-64,40,92,48,-8,24,82});
param2.add(new int[]{0,1,1,1,1,1,1,1});
param2.add(new int[]{67,31,54});
List<Integer> param3 = new ArrayList<>();
param3.add(8);
param3.add(10);
param3.add(22);
param3.add(1);
param3.add(12);
param3.add(15);
param3.add(14);
param3.add(12);
param3.add(7);
param3.add(2);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i),param3.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i),param3.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,060 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_SUBSETS_DISTINCT_EVEN_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_SUBSETS_DISTINCT_EVEN_NUMBERS{
static int f_gold ( int arr [ ] , int n ) {
HashSet < Integer > us = new HashSet < > ( ) ;
int even_count = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) if ( arr [ i ] % 2 == 0 ) us . add ( arr [ i ] ) ;
even_count = us . size ( ) ;
return ( int ) ( Math . pow ( 2 , even_count ) - 1 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,8,14,22,24,24,26,32,33,46,50,51,51,52,53,71,76,93});
param0.add(new int[]{-62,30,12,30,22,6,-42,80,-62,34,32,-72,-6,-16,42,82,-78,-20,-96,44,-24,-50,-50,-94,72,-90,38,84,-86,-24,-62,86,94,6,90,12,-36,0,44,4,-78,-86,-12,-18,26,32,90,76});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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[]{70,55,67,9,78,57,31,25});
param0.add(new int[]{-98,-90,-80,-80,-68,-68,-50,-44,-38,-34,-18,-16,-10,-8,14,14,16,24,26,28,30,40,44,46,52,54,58,66,74,74,74,76,80,86,94,96});
param0.add(new int[]{0,1,1,0,1,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1});
param0.add(new int[]{7,10,11,13,14,16,20,26,30,31,33,33,35,39,42,50,51,52,55,57,58,59,62,63,63,65,67,67,68,69,69,71,73,73,74,76,82,86,87,87,87,88,94,99});
param0.add(new int[]{-6,8,-14,2,-36,-44,-50,-4,-4,-22,94,-94,-62,4,-84,-82,88,84,28,76,-84,-72,14,-28,96,18,-56,-96,2,-66,62,-78,88,34,0,-48,-76,-84,-2,-98,58,38,56});
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});
param0.add(new int[]{75,92,42,5,53,78,42,97,99,56,23,16,90,1,79,49,63,95,12,21,82,31,10,35,34,80,22,73,68,68,48,11,15,60,24,57,74,18,30,57,66,97,78,65,79});
List<Integer> param1 = new ArrayList<>();
param1.add(16);
param1.add(47);
param1.add(32);
param1.add(6);
param1.add(30);
param1.add(11);
param1.add(39);
param1.add(23);
param1.add(17);
param1.add(29);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,061 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_ROTATION_COUNT_ROTATED_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_ROTATION_COUNT_ROTATED_SORTED_ARRAY_1{
static int f_gold ( int arr [ ] , int low , int high ) {
if ( high < low ) return 0 ;
if ( high == low ) return low ;
int mid = low + ( high - low ) / 2 ;
if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return ( mid + 1 ) ;
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return mid ;
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr , low , mid - 1 ) ;
return f_gold ( arr , mid + 1 , high ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,16,38,39,48,74,79});
param0.add(new int[]{-46,72,72,-66,96,92,40,8,94,-84,6,-90,38,-6,48,-20,-86,-76,88,-50,-44,-14,54,-6,-2,72,8,-64,-46,44,-88,50,86,38,42,-56});
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});
param0.add(new int[]{48,74,59,57,95,11,25,61,46,54,34,84,7,97,62,57,99,93,76,5,76,93,35,84,37,60,65,16,30,73,42,61,74,77,48,62,84,93,64,57,68,46,28,77});
param0.add(new int[]{-72,-68,-66,-66,-62,-62,-52,-48,-42,-42,-42,-38,-30,-22,-20,-20,-16,-16,-14,0,2,2,2,4,12,20,22,26,32,34,46,46,64,64,64,66,68,68,68,74,80,84,84,88,88,90,96,98});
param0.add(new int[]{1});
param0.add(new int[]{7,11,20,21,22,27,30,30,34,35,36,37,38,60,61,63,63,69,70,75,80,84,88,97});
param0.add(new int[]{-2,70,-40});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{71,71,27,10,97,43,55,71,6,6,77,48,77,2,83,51,61,19,2,51,26,70,20,23,54,15,6,92,35,75,8,57,50,49,88,21,36});
List<Integer> param1 = new ArrayList<>();
param1.add(6);
param1.add(32);
param1.add(16);
param1.add(24);
param1.add(29);
param1.add(0);
param1.add(23);
param1.add(2);
param1.add(30);
param1.add(24);
List<Integer> param2 = new ArrayList<>();
param2.add(6);
param2.add(21);
param2.add(29);
param2.add(26);
param2.add(43);
param2.add(0);
param2.add(22);
param2.add(1);
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());
}
} | 6,062 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_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 LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_ARRAY{
static int f_gold ( int set [ ] , int n ) {
if ( n <= 2 ) return n ;
int L [ ] [ ] = new int [ n ] [ n ] ;
int llap = 2 ;
for ( int i = 0 ;
i < n ;
i ++ ) L [ i ] [ n - 1 ] = 2 ;
for ( int j = n - 2 ;
j >= 1 ;
j -- ) {
int i = j - 1 , k = j + 1 ;
while ( i >= 0 && k <= n - 1 ) {
if ( set [ i ] + set [ k ] < 2 * set [ j ] ) k ++ ;
else if ( set [ i ] + set [ k ] > 2 * set [ j ] ) {
L [ i ] [ j ] = 2 ;
i -- ;
}
else {
L [ i ] [ j ] = L [ j ] [ k ] + 1 ;
llap = Math . max ( llap , L [ i ] [ j ] ) ;
i -- ;
k ++ ;
}
}
while ( i >= 0 ) {
L [ i ] [ j ] = 2 ;
i -- ;
}
}
return llap ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,4,4,7,8,19,21,22,25,27,28,29,38,40,41,42,43,46,50,50,53,53,54,55,60,64,64,69,70,75,77,81,81,82,86,87,87,88,91,94,97});
param0.add(new int[]{40,-6,50,-18,42,78,38,-90,-44,-42,-86,78,-68,2,-32,-20,-44,54,80,54,70,26,82,-14,-74,-20,74,82});
param0.add(new int[]{0,0,0,0,1,1,1});
param0.add(new int[]{76,80});
param0.add(new int[]{-92,-90,-88,-76,-76,-60,-46,-40,-24,-8,-8,-6,2,12,36,38,58,76,80});
param0.add(new int[]{1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1});
param0.add(new int[]{5,8,11,27,27,32,32,37,50,51,55,61,62,68,73,83});
param0.add(new int[]{52,-74,-32,-64,-52,-60,-70,36,70,40,40,-18,90,-70,-82,-64,-8,-6,36,4,-58,62,-96,78,36,90,-70,-6,-84,24,84,32,-90,36,70,-60,-56,78,48,34,-16,80,82,58,14,-6,-8,76});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{11,21,76,45,8,49,97,66,17,11,87,4,34,89,79,88,6,91,19,56,91,25,17,90,26,59,34,32,43,17,98,39,72,78,93,43});
List<Integer> param1 = new ArrayList<>();
param1.add(27);
param1.add(21);
param1.add(5);
param1.add(1);
param1.add(13);
param1.add(15);
param1.add(8);
param1.add(29);
param1.add(27);
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());
}
} | 6,063 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_UNIT_DIGIT_X_RAISED_POWER_Y.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_UNIT_DIGIT_X_RAISED_POWER_Y{
static int f_gold ( int x , int y ) {
int res = 1 ;
for ( int i = 0 ;
i < y ;
i ++ ) res = ( res * x ) % 10 ;
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(33);
param0.add(95);
param0.add(21);
param0.add(3);
param0.add(40);
param0.add(64);
param0.add(17);
param0.add(58);
param0.add(44);
param0.add(27);
List<Integer> param1 = new ArrayList<>();
param1.add(55);
param1.add(7);
param1.add(63);
param1.add(62);
param1.add(53);
param1.add(24);
param1.add(23);
param1.add(74);
param1.add(13);
param1.add(54);
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());
}
} | 6,064 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_THE_ELEMENT_THAT_APPEARS_ONCE_2.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_ELEMENT_THAT_APPEARS_ONCE_2{
static int f_gold ( int a [ ] , int n ) {
HashSet < Integer > s = new HashSet < Integer > ( ) ;
for ( int i : a ) {
s . add ( i ) ;
}
int arr_sum = 0 ;
for ( int i : a ) {
arr_sum += i ;
}
int set_sum = 0 ;
for ( int i : s ) {
set_sum += i ;
}
return ( 3 * set_sum - arr_sum ) / 2 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,3,3,12,16,28,31,44,48,57,59,60,68,69,70,70,72,73,76,78,78,79,84,86,93,96});
param0.add(new int[]{-2,-62,8,-96,-50,-70,-48,-20,76,-54,-62,8,30,-68,-64,-94,-10,-78,-68,-98,0,30,62,-40,-36,90,-46,38,28,-86,-20,12,56,-50,82,-18,-28,-62,88,-58});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{85,33,83,92,40,53,18,39,17,71,15,85,44,12,56,77,54,87,11,74,11,9,73,72,64,98,18,13,74,64,59,44,95,56,6,96,47,36,35,51,30,39,91,74,68});
param0.add(new int[]{-94,-90,-82,-80,-74,-40,-40,-38,-36,-28,-26,-20,-16,-14,-14,-10,-8,-8,10,14,18,22,22,28,28,30,74,82});
param0.add(new int[]{1,1,1,1,1,0,1,0,1,1,0,0,0,0,1,0,1,1,1,0,1,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1});
param0.add(new int[]{2,6,6,12,13,13,15,16,24,25,29,36,42,44,47,47,47,48,51,51,55,55,55,58,58,60,61,62,62,64,66,70,70,75,76,77,78,78,79,80,80,82,83,83,84,85,90,99});
param0.add(new int[]{-94,50,-86,-94,92,-50,74,-54,54,-20,-28,-44,-94,-80,-12,-38,64,-22,38,70,-4,62,66,88,-94,72,88,32,-80,60,-70,-74,-66,82,82});
param0.add(new int[]{0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{62,29,76,58,16,7,83,45,17,67,88,78,6,36,33,99,39,59,77,64,32,20,10,92,3,20,7,14,11,28});
List<Integer> param1 = new ArrayList<>();
param1.add(14);
param1.add(26);
param1.add(18);
param1.add(35);
param1.add(27);
param1.add(35);
param1.add(42);
param1.add(34);
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());
}
} | 6,065 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_RECTANGLES_NM_GRID.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_RECTANGLES_NM_GRID{
public static long f_gold ( int n , int m ) {
return ( m * n * ( n + 1 ) * ( m + 1 ) ) / 4 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(86);
param0.add(33);
param0.add(3);
param0.add(91);
param0.add(33);
param0.add(13);
param0.add(75);
param0.add(58);
param0.add(50);
param0.add(4);
List<Integer> param1 = new ArrayList<>();
param1.add(70);
param1.add(65);
param1.add(5);
param1.add(12);
param1.add(27);
param1.add(75);
param1.add(36);
param1.add(64);
param1.add(51);
param1.add(44);
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());
}
} | 6,066 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES{
static boolean f_gold ( int x , int y , int n ) {
boolean [ ] dp = new boolean [ n + 1 ] ;
Arrays . fill ( dp , false ) ;
dp [ 0 ] = false ;
dp [ 1 ] = true ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
if ( i - 1 >= 0 && dp [ i - 1 ] == false ) dp [ i ] = true ;
else if ( i - x >= 0 && dp [ i - x ] == false ) dp [ i ] = true ;
else if ( i - y >= 0 && dp [ i - y ] == false ) dp [ i ] = true ;
else dp [ i ] = false ;
}
return dp [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(6);
param0.add(32);
param0.add(99);
param0.add(22);
param0.add(26);
param0.add(67);
param0.add(69);
param0.add(39);
param0.add(7);
param0.add(91);
List<Integer> param1 = new ArrayList<>();
param1.add(27);
param1.add(88);
param1.add(18);
param1.add(1);
param1.add(78);
param1.add(51);
param1.add(57);
param1.add(8);
param1.add(82);
param1.add(56);
List<Integer> param2 = new ArrayList<>();
param2.add(51);
param2.add(69);
param2.add(48);
param2.add(74);
param2.add(95);
param2.add(27);
param2.add(91);
param2.add(9);
param2.add(41);
param2.add(7);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,067 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER{
static int f_gold ( int [ ] arr , int n ) {
Queue < Integer > q = new LinkedList < > ( ) ;
Arrays . sort ( arr ) ;
q . add ( arr [ 0 ] ) ;
for ( int i = 1 ;
i < n ;
i ++ ) {
int now = q . element ( ) ;
if ( arr [ i ] >= 2 * now ) q . remove ( ) ;
q . add ( arr [ i ] ) ;
}
return q . size ( ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,3,17,17,18,28,28,29,34,43,44,52,54,80,84,84,91,92,97});
param0.add(new int[]{-34,70,-90,-10,-26,64,4,28,24,-90,-78,72,74,80,82,-94});
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});
param0.add(new int[]{20,87,5,62,12,81,30,83,96,16,2,76,3,8,37,53,55,88});
param0.add(new int[]{-94,-92,-60,-58,-54,-42,-36,-12,-8,-2,8,14,18,20,26,32,38,56,58,60,70,78,80,86,98});
param0.add(new int[]{0,1,1,1,0,0,1,1,1,1,1,1,1,1,0,0});
param0.add(new int[]{1,1,2,3,3,11,16,18,19,21,21,22,22,24,27,28,29,43,43,52,55,57,60,62,62,63,65,66,70,70,73,77,78,79,79,80,85,85,86,88,89,90,97,98});
param0.add(new int[]{88,12,-22,-60,30,-30,-14,80,-58,-80,-10,86,-94,-14,4,-18,-18,54,-82,-8,-68,-6,-44,-44,50,88,-78,-42,12,52,44,14,6,48,18,-30,4});
param0.add(new int[]{0,0,0,0,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{82,62,43,39,5,90,75,50,16,83,52,69,71,3,89,10,51,69,32,96,5,43,83,12,31,81,22,59,52,47,86,49,56,90,31,59});
List<Integer> param1 = new ArrayList<>();
param1.add(12);
param1.add(10);
param1.add(40);
param1.add(9);
param1.add(18);
param1.add(9);
param1.add(30);
param1.add(21);
param1.add(7);
param1.add(28);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,068 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1{
public static int f_gold ( int k ) {
return k * k * k ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(96);
param0.add(14);
param0.add(64);
param0.add(24);
param0.add(74);
param0.add(85);
param0.add(27);
param0.add(78);
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());
}
} | 6,069 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NON_REPEATING_ELEMENT_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 NON_REPEATING_ELEMENT_1{
static int f_gold ( int arr [ ] , int n ) {
Map < Integer , Integer > m = new HashMap < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( m . containsKey ( arr [ i ] ) ) {
m . put ( arr [ i ] , m . get ( arr [ i ] ) + 1 ) ;
}
else {
m . put ( arr [ i ] , 1 ) ;
}
}
for ( int i = 0 ;
i < n ;
i ++ ) if ( m . get ( arr [ i ] ) == 1 ) return arr [ i ] ;
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,7,14,18,18,18,21,25,28,38,40,42,42,45,48,50,50,50,53,54,58,59,62,65,65,66,67,68,69,73,74,76,77,83,84,85,87});
param0.add(new int[]{24,-84,86,-50,60,-36,92,70,84,40,-8,74,-24,-38,98,40,-78,-36,38,-22,-98,82,-22,80,-80,-62,16,-46,18,64,16,2,24,-92,-46,42,38,8,72,8,14,-68,18,16,-82,8,58,-2});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1});
param0.add(new int[]{59,77,13,49,90});
param0.add(new int[]{-80,-76,-66,-60,-44,-42,-38,-36,-32,-30,-24,-18,-6,2,4,14,32,42,54,70,92,98});
param0.add(new int[]{0,0,0,0,1,0,1,0,0,1,0,0,0,1,0,1,1,1,0,1,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0,0,0,0});
param0.add(new int[]{6,22,24,27,29,30,35,42,57,59,59,63,71,73,76,98});
param0.add(new int[]{-82,-48,36});
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});
param0.add(new int[]{88,49,13,64,30,60,26,55,55,97,98,69,72,72,79,59,46,87,76,61,87,12,91,8,34,15,93,64,83,33,69,58,32,14,72,67,25,7,55,21,12,78,63});
List<Integer> param1 = new ArrayList<>();
param1.add(33);
param1.add(25);
param1.add(16);
param1.add(2);
param1.add(12);
param1.add(33);
param1.add(13);
param1.add(1);
param1.add(35);
param1.add(24);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,070 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/TILING_WITH_DOMINOES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class TILING_WITH_DOMINOES{
static int f_gold ( int n ) {
int [ ] A = new int [ n + 1 ] ;
int [ ] B = new int [ n + 1 ] ;
A [ 0 ] = 1 ;
A [ 1 ] = 0 ;
B [ 0 ] = 0 ;
B [ 1 ] = 1 ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
A [ i ] = A [ i - 2 ] + 2 * B [ i - 1 ] ;
B [ i ] = A [ i - 1 ] + B [ i - 2 ] ;
}
return A [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(29);
param0.add(13);
param0.add(25);
param0.add(65);
param0.add(27);
param0.add(42);
param0.add(19);
param0.add(50);
param0.add(59);
param0.add(13);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,071 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS{
public static int f_gold ( int a , int b ) {
if ( a == 0 ) return b ;
return f_gold ( b % a , a ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(46);
param0.add(26);
param0.add(40);
param0.add(58);
param0.add(25);
param0.add(2);
param0.add(8);
param0.add(21);
param0.add(82);
param0.add(17);
List<Integer> param1 = new ArrayList<>();
param1.add(89);
param1.add(82);
param1.add(12);
param1.add(4);
param1.add(44);
param1.add(87);
param1.add(65);
param1.add(87);
param1.add(10);
param1.add(61);
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());
}
} | 6,072 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH_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_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH_1{
static int f_gold ( int arr [ ] , int n , int k ) {
if ( k > n ) return - 1 ;
int sum = arr [ 0 ] ;
for ( int i = 1 ;
i < k ;
i ++ ) sum += arr [ i ] ;
int max_sum = sum , max_end = k - 1 ;
for ( int i = k ;
i < n ;
i ++ ) {
sum = sum + arr [ i ] - arr [ i - k ] ;
if ( sum > max_sum ) {
max_sum = sum ;
max_end = i ;
}
}
return max_end - k + 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,5,11,37,41,49,49,63,98});
param0.add(new int[]{84,-72,12,0,86,-32,-18,48,60,42,8,-6,-10,-6,-52,-84,-98,76,-10,-14,-94,-48,94,-10,-20,40,-52,0,94,-68,44,-34,-26,-6,-94,34,-80,-62,-40,56,52,-20,74,-46,-88,-26,22});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{94,97,74,88,14,66,65,50,76,55,70,93,53,30,2,60,65,24,80,73,84,95,49,32,55,70,17,26,96,20,36,2,89,49,83,67,42,51,71,11,61,78,17,78,94,68});
param0.add(new int[]{-98,-90,-60,-38,38,42});
param0.add(new int[]{1,0,0,1,1,1,1});
param0.add(new int[]{4,9,17,17,19,32,35,36,37,40,44,45,47,48,48,56,56,60,61,65,66,79,83,91,93,99});
param0.add(new int[]{78,82,-92,-46,-16,-64,28,60,64,52,54,-84,70,22,24,0,-14,20,-90,30,0,86,12,72,-64,-52,86,16,-42});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{81,77,6,3,72,24,75,47,17,29,69,15,15,50,30,83,11,7,59,7,12,82,45,76,9,48,98,49,29,66,3,53,37,13,72,58,37,87,55});
List<Integer> param1 = new ArrayList<>();
param1.add(8);
param1.add(34);
param1.add(11);
param1.add(35);
param1.add(3);
param1.add(3);
param1.add(22);
param1.add(25);
param1.add(25);
param1.add(34);
List<Integer> param2 = new ArrayList<>();
param2.add(7);
param2.add(43);
param2.add(18);
param2.add(33);
param2.add(5);
param2.add(4);
param2.add(24);
param2.add(27);
param2.add(20);
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());
}
} | 6,073 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_BINARY_DIGIT_NUMBERS_SMALLER_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_BINARY_DIGIT_NUMBERS_SMALLER_N{
static int f_gold ( int N ) {
Queue < Integer > q = new LinkedList < > ( ) ;
q . add ( 1 ) ;
int cnt = 0 ;
int t ;
while ( q . size ( ) > 0 ) {
t = q . peek ( ) ;
q . remove ( ) ;
if ( t <= N ) {
cnt ++ ;
q . add ( t * 10 ) ;
q . add ( t * 10 + 1 ) ;
}
}
return cnt ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(3);
param0.add(150932532);
param0.add(71);
param0.add(44);
param0.add(36);
param0.add(88);
param0.add(69);
param0.add(53);
param0.add(20);
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());
}
} | 6,074 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/LENGTH_LONGEST_STRICT_BITONIC_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 LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE{
static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > inc = new HashMap < Integer , Integer > ( ) ;
HashMap < Integer , Integer > dcr = new HashMap < Integer , Integer > ( ) ;
int len_inc [ ] = new int [ n ] ;
int len_dcr [ ] = new int [ n ] ;
int longLen = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int len = 0 ;
if ( inc . containsKey ( arr [ i ] - 1 ) ) len = inc . get ( arr [ i ] - 1 ) ;
len_inc [ i ] = len + 1 ;
inc . put ( arr [ i ] , len_inc [ i ] ) ;
}
for ( int i = n - 1 ;
i >= 0 ;
i -- ) {
int len = 0 ;
if ( dcr . containsKey ( arr [ i ] - 1 ) ) len = dcr . get ( arr [ i ] - 1 ) ;
len_dcr [ i ] = len + 1 ;
dcr . put ( arr [ i ] , len_dcr [ i ] ) ;
}
for ( int i = 0 ;
i < n ;
i ++ ) if ( longLen < ( len_inc [ i ] + len_dcr [ i ] - 1 ) ) longLen = len_inc [ i ] + len_dcr [ i ] - 1 ;
return longLen ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{78});
param0.add(new int[]{-6,-18,-48,58,-54,76,80,-56,86,58,-86,-86,-88,32,12,58,58,-16,86,-24,84,86,36,18,30,-32,-4,-36,-72,-4,42,94});
param0.add(new int[]{0,1});
param0.add(new int[]{92,26,72,8,66,28,34,61,28});
param0.add(new int[]{-86,-82,-76,-68,-66,-64,-62,-56,-48,-42,-38,-30,-22,-18,-10,-10,-4,-2,4,28,42,44,50,50,56,58,60,76,82,86,86,98});
param0.add(new int[]{0,0,1,0,1,1,0,0,1,0,1,1,0,1,1,1,0,0,0,0,1,0});
param0.add(new int[]{3,4,8,9,12,13,16,19,23,25,29,31,34,36,38,41,42,47,49,50,51,51,58,63,66,70,73,74,75,75,75,76,76,80,82,83,83,84,86,89,90,91,91,95,96});
param0.add(new int[]{4,-76,60,48,-14,72});
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});
param0.add(new int[]{66,80,79,72,1,67,20,67,32,40,22,64,58,67,10,21,37,49});
List<Integer> param1 = new ArrayList<>();
param1.add(0);
param1.add(18);
param1.add(1);
param1.add(5);
param1.add(25);
param1.add(17);
param1.add(44);
param1.add(3);
param1.add(17);
param1.add(15);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,075 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE{
static boolean f_gold ( int A [ ] , int arr_size , int sum ) {
int l , r ;
for ( int i = 0 ;
i < arr_size - 2 ;
i ++ ) {
for ( int j = i + 1 ;
j < arr_size - 1 ;
j ++ ) {
for ( int k = j + 1 ;
k < arr_size ;
k ++ ) {
if ( A [ i ] + A [ j ] + A [ k ] == sum ) {
System . out . print ( "Triplet is " + A [ i ] + ", " + A [ j ] + ", " + A [ k ] ) ;
return true ;
}
}
}
}
return false ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{15,18,38,47,75,88});
param0.add(new int[]{28,-2,62,38,86,-86,56,58,96,6,-28,8,68,-16,-80,-4,98,-92,4,-4,58,-62,46,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,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{19,77,17,91,6,35,22,4,30,23,97,56,78,16,22,23,95,57,43,27,47,44,23,10,3,94,55,22,93,32,89,28,64,22,13,24,38,44,6,1,80});
param0.add(new int[]{-98,-98,-94,-88,-80,-74,-68,-68,-64,-44,-36,-24,-10,-8,-8,0,4,6,8,8,12,14,16,38,50,52,54,56,66,68,76,88});
param0.add(new int[]{1,1,0,0,1,0,1,1});
param0.add(new int[]{7,22,24,30,42,44,49,49,65,70,70,74,74,75,90,95,96});
param0.add(new int[]{40,-76,-68,-86,-14,82,-20,54,-26,56,-24,-44,44,60,52,-20,80,-24,-90,-30,-2});
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[]{33,92,6,99,83,97,49,97,85,52});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(22);
param1.add(27);
param1.add(22);
param1.add(18);
param1.add(4);
param1.add(8);
param1.add(11);
param1.add(15);
param1.add(6);
List<Integer> param2 = new ArrayList<>();
param2.add(4);
param2.add(18);
param2.add(23);
param2.add(29);
param2.add(19);
param2.add(5);
param2.add(13);
param2.add(18);
param2.add(17);
param2.add(7);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,076 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PRIME_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 PRIME_NUMBERS{
static boolean f_gold ( int n ) {
if ( n <= 1 ) return false ;
for ( int i = 2 ;
i < n ;
i ++ ) if ( n % i == 0 ) return false ;
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(2);
param0.add(74);
param0.add(46);
param0.add(38);
param0.add(51);
param0.add(48);
param0.add(6);
param0.add(14);
param0.add(31);
param0.add(10);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,077 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_SERIES_12_32_52_2N_12_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_SERIES_12_32_52_2N_12_1{
static int f_gold ( int n ) {
return ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(84);
param0.add(74);
param0.add(91);
param0.add(34);
param0.add(36);
param0.add(28);
param0.add(70);
param0.add(7);
param0.add(24);
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());
}
} | 6,078 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_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_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
if ( n < 3 ) {
return - 1 ;
}
Arrays . sort ( arr ) ;
return Math . max ( arr [ 0 ] * arr [ 1 ] * arr [ n - 1 ] , arr [ n - 1 ] * arr [ n - 2 ] * arr [ n - 3 ] ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,8,14,15,18,21,21,21,27,29,30,33,34,34,35,37,40,41,44,44,46,49,54,58,60,61,61,63,66,69,69,70,81,82,82,90,90,90,91,92,92,96,97,99});
param0.add(new int[]{72,-32,-2,-76,-56,70,-52,12,-50,32,-98,48,-32,-90,-66,-98,56,-58,-88,50,-22,18,-60,68,70,28});
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[]{38,69,18,72,99,49,17,76,86,53,6,94,66,5,2,62,99,5,31,81,63,91,95,74,76,18,77});
param0.add(new int[]{-92,-58,-8,20,24,24,42,98});
param0.add(new int[]{0,1,1,0,1,0,0,1,0,1,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,0,1,1,1,1,0});
param0.add(new int[]{46,64,81});
param0.add(new int[]{4,-26,20,34,-4,-40,76,94,-14,-80,42,60,92,-96,44,58,34,68,96,-8,-18,-92});
param0.add(new int[]{0,0,0,1,1,1,1,1});
param0.add(new int[]{61,17,28,18,52,58,41,75,98,79,1,97,73,17,79,4,46,70,6,83,23,94,1});
List<Integer> param1 = new ArrayList<>();
param1.add(39);
param1.add(18);
param1.add(17);
param1.add(21);
param1.add(4);
param1.add(38);
param1.add(1);
param1.add(17);
param1.add(7);
param1.add(19);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,079 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/PANGRAM_CHECKING.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PANGRAM_CHECKING{
public static boolean f_gold ( String str ) {
boolean [ ] mark = new boolean [ 26 ] ;
int index = 0 ;
for ( int i = 0 ;
i < str . length ( ) ;
i ++ ) {
if ( 'A' <= str . charAt ( i ) && str . charAt ( i ) <= 'Z' ) index = str . charAt ( i ) - 'A' ;
else if ( 'a' <= str . charAt ( i ) && str . charAt ( i ) <= 'z' ) index = str . charAt ( i ) - 'a' ;
mark [ index ] = true ;
}
for ( int i = 0 ;
i <= 25 ;
i ++ ) if ( mark [ i ] == false ) return ( false ) ;
return ( true ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("The quick brown fox jumps over the lazy dog ");
param0.add("The quick brown fox jumps over the dog");
param0.add("abcdefghijklmnopqrstuvwxyz");
param0.add("AbcdefghijKlmnopqrstUVwxyz");
param0.add("The quicK broWn fOX jumps over the laZYy dog ");
param0.add("AbcdefghijKlmnopqrstVwxyz");
param0.add("U");
param0.add("397548458372");
param0.add("11");
param0.add("iwCiUFU r");
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());
}
} | 6,080 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES{
static int f_gold ( int N ) {
return ( int ) Math . ceil ( Math . log ( N + 1 ) / Math . log ( 2 ) ) - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(65);
param0.add(94);
param0.add(52);
param0.add(31);
param0.add(9);
param0.add(1);
param0.add(41);
param0.add(98);
param0.add(45);
param0.add(24);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,081 |
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_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 HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2{
static int f_gold ( int no ) {
return no == 0 ? 0 : no % 10 + f_gold ( no / 10 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(73);
param0.add(91);
param0.add(27);
param0.add(79);
param0.add(31);
param0.add(84);
param0.add(68);
param0.add(9);
param0.add(85);
param0.add(35);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,082 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY{
public static boolean f_gold ( int arr [ ] , int n ) {
int remainder = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) remainder = ( remainder + arr [ i ] ) % 3 ;
return ( remainder == 0 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,9,11,12,15,16,19,21,21,23,23,24,30,31,31,32,34,37,41,41,43,45,46,47,54,58,60,62,66,66,74,74,75,75,77,77,85,89,90,92,92,93,95,98});
param0.add(new int[]{0,66,92,24,-8,88,-92,86,80,82,42,-20,-56,-2,-84,32});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{99,83,11,99,80,76,32,12,94,66,76});
param0.add(new int[]{-88,-84,-80,-80,-80,-80,-72,-68,-64,-62,-60,-52,-48,-44,-36,-24,-20,-18,-14,-8,-6,-6,-4,6,10,14,18,24,26,26,50,50,52,60,76,90,96,98});
param0.add(new int[]{0,1,0,0,1,1,0,0,0,1,1,1,0,1,0,0,0,0,0,1,1,0,1});
param0.add(new int[]{6,6,8,8,10,24,24,26,27,30,34,34,36,36,39,40,41,44,45,50,52,53,57,62,64,64,70,71,72,78,78,79,80,82,89,95,96});
param0.add(new int[]{-28,-84,-14,-20,-14,-26,28,-66,48,82,-46,-10,-94,76,56,-6,72,-92,-32,66,50,-72,64,12,48,88,-36,-12,-6,-18,-36,-34,44,40,-54});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{17,47,89,75,57,69,70,57,83,79,57,49});
List<Integer> param1 = new ArrayList<>();
param1.add(30);
param1.add(14);
param1.add(29);
param1.add(5);
param1.add(19);
param1.add(14);
param1.add(28);
param1.add(25);
param1.add(19);
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());
}
} | 6,083 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_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_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1{
static int f_gold ( String a , String b ) {
int m = a . length ( ) ;
int n = b . length ( ) ;
int lookup [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ;
for ( int i = 0 ;
i <= n ;
++ i ) lookup [ 0 ] [ i ] = 0 ;
for ( int i = 0 ;
i <= m ;
++ i ) lookup [ i ] [ 0 ] = 1 ;
for ( int i = 1 ;
i <= m ;
i ++ ) {
for ( int j = 1 ;
j <= n ;
j ++ ) {
if ( a . charAt ( i - 1 ) == b . charAt ( j - 1 ) ) lookup [ i ] [ j ] = lookup [ i - 1 ] [ j - 1 ] + lookup [ i - 1 ] [ j ] ;
else lookup [ i ] [ j ] = lookup [ i - 1 ] [ j ] ;
}
}
return lookup [ m ] [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("fZOKCdZ Lav");
param0.add("2");
param0.add("1000001110");
param0.add("IAOyBzgIWHo");
param0.add("211806");
param0.add("1");
param0.add("CVaQTG");
param0.add("6265187228");
param0.add("10111101101000");
param0.add("vEi");
List<String> param1 = new ArrayList<>();
param1.add("fKA");
param1.add("187012");
param1.add("0");
param1.add("oA");
param1.add("10");
param1.add("001011100");
param1.add("CT");
param1.add("628");
param1.add("01111");
param1.add("bigsvkQG");
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());
}
} | 6,084 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_DIVISIBILITY_LARGE_NUMBER_999.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_DIVISIBILITY_LARGE_NUMBER_999{
static boolean f_gold ( String num ) {
int n = num . length ( ) ;
if ( n == 0 && num . charAt ( 0 ) == '0' ) return true ;
if ( n % 3 == 1 ) num = "00" + num ;
if ( n % 3 == 2 ) num = "0" + num ;
int gSum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int group = 0 ;
group += ( num . charAt ( i ++ ) - '0' ) * 100 ;
group += ( num . charAt ( i ++ ) - '0' ) * 10 ;
group += num . charAt ( i ) - '0' ;
gSum += group ;
}
if ( gSum > 1000 ) {
num = Integer . toString ( gSum ) ;
n = num . length ( ) ;
gSum = f_gold ( num ) ? 1 : 0 ;
}
return ( gSum == 999 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("235764");
param0.add("321308924");
param0.add("101111");
param0.add("1998");
param0.add("339589");
param0.add("0000101");
param0.add("264735");
param0.add("19570453184");
param0.add("000");
param0.add("SsHh");
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,085 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1{
static int f_gold ( int arr [ ] , int n , int k ) {
Map < Integer , Integer > h = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( h . containsKey ( arr [ i ] ) ) h . put ( arr [ i ] , h . get ( arr [ i ] ) + 1 ) ;
else h . put ( arr [ i ] , 1 ) ;
}
if ( h . size ( ) < k ) return - 1 ;
int dist_count = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( h . get ( arr [ i ] ) == 1 ) dist_count ++ ;
if ( dist_count == k ) return arr [ i ] ;
}
return - 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{17,25,27,27,73,91});
param0.add(new int[]{-86,-74,-88,28,-32,20,-34,32});
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[]{5,11,36,27,6,24,58,44,14,68});
param0.add(new int[]{-98,-98,-94,-92,-86,-86,-70,-66,-64,-64,-58,-52,-46,-44,-44,-38,-38,-28,-24,-12,-10,-4,-2,2,8,10,12,20,22,26,26,36,42,52,54,60,60,68,82,82,92,98});
param0.add(new int[]{0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,1,1,1,0,0,0,1,0,0,1,0,1,1,1,1});
param0.add(new int[]{3,8,9,10,10,13,14,16,18,23,24,25,27,28,30,33,36,39,42,42,44,45,45,48,52,52,55,55,59,59,59,60,61,61,66,66,67,68,71,72,75,76,79,80,94,94});
param0.add(new int[]{-12,56,-48,52,-96,-84,32,-12,-6,82,70,18,66,-6,-22,-46,-54,18,-14,-32,68,82,-44,-42,10,56,8,-56,24,20,-38,30,-52,-66,82,-64,68,-82,52,-88,-34,-26,94,58,-4,-84,-60});
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});
param0.add(new int[]{1,23,75,84,28,34,15,13,51,69,94,45,38,38});
List<Integer> param1 = new ArrayList<>();
param1.add(5);
param1.add(5);
param1.add(33);
param1.add(7);
param1.add(27);
param1.add(27);
param1.add(44);
param1.add(37);
param1.add(22);
param1.add(13);
List<Integer> param2 = new ArrayList<>();
param2.add(3);
param2.add(6);
param2.add(32);
param2.add(5);
param2.add(27);
param2.add(20);
param2.add(26);
param2.add(46);
param2.add(21);
param2.add(12);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,086 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_LARGE_NUMBER_DIVISIBLE_6_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_6_NOT{
static boolean f_gold ( String str ) {
int n = str . length ( ) ;
if ( ( str . charAt ( n - 1 ) - '0' ) % 2 != 0 ) return false ;
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("2112");
param0.add("1124");
param0.add("1110");
param0.add("O");
param0.add("65530186");
param0.add("132");
param0.add("UqOE");
param0.add("587");
param0.add("1010");
param0.add("QETUfLQ");
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());
}
} | 6,087 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_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;
public class CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED{
static boolean f_gold ( int arr [ ] , int n ) {
int temp [ ] = new int [ n ] ;
for ( int i = 0 ;
i < n ;
i ++ ) {
temp [ i ] = arr [ i ] ;
}
Arrays . sort ( temp ) ;
int front ;
for ( front = 0 ;
front < n ;
front ++ ) {
if ( temp [ front ] != arr [ front ] ) {
break ;
}
}
int back ;
for ( back = n - 1 ;
back >= 0 ;
back -- ) {
if ( temp [ back ] != arr [ back ] ) {
break ;
}
}
if ( front >= back ) {
return true ;
}
do {
front ++ ;
if ( arr [ front - 1 ] < arr [ front ] ) {
return false ;
}
}
while ( front != back ) ;
return true ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,9,9,16,17,22,32,40,45,53,57,58,66,69,76,80,91,93,94});
param0.add(new int[]{52,-76,-18,86,56});
param0.add(new int[]{0,0,1});
param0.add(new int[]{66,44,98,44});
param0.add(new int[]{-96,-62,-56,-46,-44,-38,-38,-26,-22,-22,-16,-12,-6,12,22,34,36,44,44,68,70,74,94});
param0.add(new int[]{1,1,0,0,1,1,1,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0,1,1});
param0.add(new int[]{5,9,11,12,13,16,19,23,23,23,25,27,27,28,31,36,40,44,48,59,60,63,66,66,67,67,69,69,70,71,73,76,76,79,86,86,92,92,93,93});
param0.add(new int[]{6,82,-88,-46,-60,70,-54,-96,-94,46,-52,48,-26,-50,-92,-92,6,-6,42,0,-66,-96,66,6,-68,-30,-54,76,60,30,72,-66,-12,-74});
param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{62,54,36,35,36,91,45,87,74,49,15,15,73,77,63,70,74,65,11,18});
List<Integer> param1 = new ArrayList<>();
param1.add(10);
param1.add(3);
param1.add(1);
param1.add(2);
param1.add(14);
param1.add(27);
param1.add(34);
param1.add(28);
param1.add(13);
param1.add(16);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i)) == f_gold(param0.get(i),param1.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,088 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REMAINDER_7_LARGE_NUMBERS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REMAINDER_7_LARGE_NUMBERS{
static int f_gold ( String num ) {
int series [ ] = {
1 , 3 , 2 , - 1 , - 3 , - 2 };
int series_index = 0 ;
int result = 0 ;
for ( int i = num . length ( ) - 1 ;
i >= 0 ;
i -- ) {
int digit = num . charAt ( i ) - '0' ;
result += digit * series [ series_index ] ;
series_index = ( series_index + 1 ) % 6 ;
result %= 7 ;
}
if ( result < 0 ) result = ( result + 7 ) % 7 ;
return result ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("K");
param0.add("850076");
param0.add("00111");
param0.add("X");
param0.add("1");
param0.add("10010001100");
param0.add(" pgPeLz");
param0.add("53212456821275");
param0.add("101");
param0.add("V");
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());
}
} | 6,089 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FRIENDS_PAIRING_PROBLEM.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FRIENDS_PAIRING_PROBLEM{
static int f_gold ( int n ) {
int dp [ ] = new int [ n + 1 ] ;
for ( int i = 0 ;
i <= n ;
i ++ ) {
if ( i <= 2 ) dp [ i ] = i ;
else dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ] ;
}
return dp [ n ] ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(99);
param0.add(62);
param0.add(87);
param0.add(87);
param0.add(61);
param0.add(88);
param0.add(73);
param0.add(62);
param0.add(98);
param0.add(57);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,090 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_CHARACTERS_GIVEN_STRING_CAN_REARRANGED_FORM_PALINDROME_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_CHARACTERS_GIVEN_STRING_CAN_REARRANGED_FORM_PALINDROME_1{
static boolean f_gold ( String str ) {
List < Character > list = new ArrayList < Character > ( ) ;
for ( int i = 0 ;
i < str . length ( ) ;
i ++ ) {
if ( list . contains ( str . charAt ( i ) ) ) list . remove ( ( Character ) str . charAt ( i ) ) ;
else list . add ( str . charAt ( i ) ) ;
}
if ( str . length ( ) % 2 == 0 && list . isEmpty ( ) || ( str . length ( ) % 2 == 1 && list . size ( ) == 1 ) ) return true ;
else return false ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("abccba");
param0.add("2674377254");
param0.add("11");
param0.add("abcdecba");
param0.add("26382426486138");
param0.add("111010111010");
param0.add("hUInqJXNdbfP");
param0.add("5191");
param0.add("1110101101");
param0.add("NupSrU xz");
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());
}
} | 6,091 |
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_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_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1{
static int f_gold ( int n ) {
int count = 0 ;
int x = n & ( n - 1 ) ;
if ( n > 0 && x == 0 ) {
while ( n > 1 ) {
n >>= 1 ;
count += 1 ;
}
return ( count % 2 == 0 ) ? 1 : 0 ;
}
return 0 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(4);
param0.add(64);
param0.add(-64);
param0.add(128);
param0.add(1024);
param0.add(45);
param0.add(33);
param0.add(66);
param0.add(74);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,092 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/COUNT_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_WAYS_TO_CONSTRUCT_BUILDINGS{
static int f_gold ( int N ) {
if ( N == 1 ) return 4 ;
int countB = 1 , countS = 1 , prev_countB , prev_countS ;
for ( int i = 2 ;
i <= N ;
i ++ ) {
prev_countB = countB ;
prev_countS = countS ;
countS = prev_countB + prev_countS ;
countB = prev_countS ;
}
int result = countS + countB ;
return ( result * result ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(17);
param0.add(66);
param0.add(53);
param0.add(97);
param0.add(34);
param0.add(54);
param0.add(9);
param0.add(99);
param0.add(59);
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());
}
} | 6,093 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/SUM_PAIRWISE_PRODUCTS_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_PAIRWISE_PRODUCTS_1{
static int f_gold ( int n ) {
int multiTerms = n * ( n + 1 ) / 2 ;
int sum = multiTerms ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
multiTerms = multiTerms - ( i - 1 ) ;
sum = sum + multiTerms * i ;
}
return sum ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(41);
param0.add(50);
param0.add(67);
param0.add(18);
param0.add(60);
param0.add(6);
param0.add(27);
param0.add(46);
param0.add(50);
param0.add(20);
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());
}
} | 6,094 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_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 REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY{
public static int f_gold ( int a [ ] , int b [ ] , int n , int m ) {
HashMap < Integer , Integer > countA = new HashMap < Integer , Integer > ( ) ;
HashMap < Integer , Integer > countB = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( countA . containsKey ( a [ i ] ) ) countA . put ( a [ i ] , countA . get ( a [ i ] ) + 1 ) ;
else countA . put ( a [ i ] , 1 ) ;
}
for ( int i = 0 ;
i < m ;
i ++ ) {
if ( countB . containsKey ( b [ i ] ) ) countB . put ( b [ i ] , countB . get ( b [ i ] ) + 1 ) ;
else countB . put ( b [ i ] , 1 ) ;
}
int res = 0 ;
Set < Integer > s = countA . keySet ( ) ;
for ( int x : s ) if ( countB . containsKey ( x ) ) res += Math . min ( countB . get ( x ) , countA . get ( x ) ) ;
return res ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,7,10,12,12,24,29,38,45,51,53,54,59,68,72,73,85,86,88,92,92,95});
param0.add(new int[]{-6,48,-70,14,-86,56,80,-64,64,-88,-14,78,14,-18,52,2,22,88});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1});
param0.add(new int[]{10,93,2,16,36,49,36,86,6,99,95,2});
param0.add(new int[]{-98,-96,-80,-64,-42,-30,-6,10,62,66,82});
param0.add(new int[]{1,1,0,1,1});
param0.add(new int[]{7,11,13,15,21,33,36,39,66,99});
param0.add(new int[]{-40});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{79,91,31,16,28,45,37,43,73,73,76,28,71,60,64,60,99,36,47,38,65,34,22,94,84,51,72,45,71,2});
List<int [ ]> param1 = new ArrayList<>();
param1.add(new int[]{7,9,17,23,25,26,29,32,35,56,56,58,59,59,62,63,72,82,85,86,95,97});
param1.add(new int[]{-62,-58,60,-30,42,8,66,-48,-18,64,-76,-90,-48,-90,-24,64,-88,-98});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{99,28,7,21,62,89,82,41,43,77,8,14});
param1.add(new int[]{-62,-50,-42,24,44,46,52,54,60,72,72});
param1.add(new int[]{1,1,1,0,0});
param1.add(new int[]{23,36,42,44,62,65,70,78,82,89});
param1.add(new int[]{-98});
param1.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param1.add(new int[]{58,94,12,27,98,38,75,20,94,43,32,90,23,41,88,2,62,96,53,57,48,79,6,16,11,46,73,57,67,7});
List<Integer> param2 = new ArrayList<>();
param2.add(15);
param2.add(15);
param2.add(10);
param2.add(6);
param2.add(9);
param2.add(4);
param2.add(9);
param2.add(0);
param2.add(31);
param2.add(18);
List<Integer> param3 = new ArrayList<>();
param3.add(13);
param3.add(9);
param3.add(10);
param3.add(10);
param3.add(6);
param3.add(2);
param3.add(9);
param3.add(0);
param3.add(26);
param3.add(18);
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());
}
} | 6,095 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_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 N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2{
public static int f_gold ( int n ) {
int nthElement = 19 + ( n - 1 ) * 9 ;
int outliersCount = ( int ) Math . log10 ( nthElement ) - 1 ;
nthElement += 9 * outliersCount ;
return nthElement ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(68);
param0.add(70);
param0.add(69);
param0.add(93);
param0.add(99);
param0.add(44);
param0.add(91);
param0.add(8);
param0.add(83);
param0.add(51);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,096 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_AVERAGE_SUBARRAY_OF_K_LENGTH{
static int f_gold ( int [ ] arr , int n , int k ) {
if ( k > n ) return - 1 ;
int [ ] csum = new int [ n ] ;
csum [ 0 ] = arr [ 0 ] ;
for ( int i = 1 ;
i < n ;
i ++ ) csum [ i ] = csum [ i - 1 ] + arr [ i ] ;
int max_sum = csum [ k - 1 ] , max_end = k - 1 ;
for ( int i = k ;
i < n ;
i ++ ) {
int curr_sum = csum [ i ] - csum [ i - k ] ;
if ( curr_sum > max_sum ) {
max_sum = curr_sum ;
max_end = i ;
}
}
return max_end - k + 1 ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,6,19,21,23,32,34,47,51,56,57,57,65,68,68,69,70,71,73,74,74,77,77,79,82,82,86,87,87,88,89,90,91,92});
param0.add(new int[]{24,62,-32,-28,42,-46,-96,-70,-68,60,44,34,-30,96,-26,92,62,42,-46,-38,44,54,-94,52,66,68,-96,-58,84,-2,66,30,42});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{94,6,48,34,31});
param0.add(new int[]{-98,-88,-82,-80,-76,-70,-70,-60,-60,-52,-50,-46,-44,-44,-44,-20,-18,-12,-12,-12,-10,-8,-6,-4,4,4,18,28,32,34,42,42,44,46,48,54,60,70,70,72,78,78,78,78,84,86,90,96,98});
param0.add(new int[]{0,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0});
param0.add(new int[]{1,5,13,17,26,26,32,35,38,38,39,45,52,58,60,61,62,63,82,83,85,89,89,91});
param0.add(new int[]{-68,-52,4,-90,90,88,38,-18,86,4,14,-32,-14,-44,-88,-50,-12,-26,-68,-20,-30,22,0,14,-40,58,-6,28,-44,8,28,96,-46,-12});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{17,33,36,34,32,10,37,48,47,32,21,18,75,8,18,52,21,73,25,25,80,32,10,24,1,89,7,42,86,85,73,12,20,20,1,74,77,4,24,74,8});
List<Integer> param1 = new ArrayList<>();
param1.add(29);
param1.add(23);
param1.add(32);
param1.add(4);
param1.add(45);
param1.add(15);
param1.add(13);
param1.add(32);
param1.add(13);
param1.add(20);
List<Integer> param2 = new ArrayList<>();
param2.add(20);
param2.add(31);
param2.add(31);
param2.add(3);
param2.add(30);
param2.add(8);
param2.add(22);
param2.add(22);
param2.add(11);
param2.add(28);
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0.get(i),param1.get(i),param2.get(i)) == f_gold(param0.get(i),param1.get(i),param2.get(i)))
{
n_success+=1;
}
}
System.out.println("#Results:" + n_success + ", " + param0.size());
}
} | 6,097 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/NUMBER_ORDERED_PAIRS_AI_AJ_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 NUMBER_ORDERED_PAIRS_AI_AJ_0{
static int f_gold ( int a [ ] , int n ) {
int count = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = i + 1 ;
j < n ;
j ++ ) if ( ( a [ i ] & a [ j ] ) == 0 ) count += 2 ;
}
return count ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{17,20,32,35,35,36,43,47,59,59,68,69,70,70,75,82,88,94,96,99});
param0.add(new int[]{-78,-40,58,-36,34,-12,-38,48,-66,16,50,-26,-22,46,-70,-68,-44,-52,-78,-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,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{49,57,17,37,56,61,10,3,33,33,70,35,50,85,48,65,83,21,96,19,66,43,69,17,60,87,82,3,83,44,63,19,55,58,77,76,50,96});
param0.add(new int[]{-94,-88,-86,-80,-80,-72,-64,-60,-58,-58,-58,-50,-44,-32,-8,-8,0,6,8,10,14,14,18,28,34,34,46,54,56,56,56,64,66,66,70,82,84,88,96});
param0.add(new int[]{1,1,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0});
param0.add(new int[]{1,3,10,11,13,14,15,17,20,25,26,26,27,29,32,36,36,36,42,46,47,49,51,54,54,55,60,66,67,68,68,68,72,77,78,79,83,84,92,98});
param0.add(new int[]{-76,-72,16,38,-60,44,-2,-76,-76,-56,40,36,50,-50,-32,48,-96,80,84,60,84,38,-54,-42,48,30,66,-62,-52,-94,64,-16,54,98});
param0.add(new int[]{0,0,1,1,1,1});
param0.add(new int[]{63,82,22,84,11,62,18,43,57,25,4,27,62,46,55,16,1,9,10,73,36,80,95,87,47,64,27,25,70});
List<Integer> param1 = new ArrayList<>();
param1.add(17);
param1.add(11);
param1.add(23);
param1.add(37);
param1.add(33);
param1.add(13);
param1.add(32);
param1.add(28);
param1.add(5);
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());
}
} | 6,098 |
0 | Create_ds/CodeGen/data/transcoder_evaluation_gfg | Create_ds/CodeGen/data/transcoder_evaluation_gfg/java/CHECK_WHETHER_LARGE_NUMBER_DIVISIBLE_7.java | // Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file 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_LARGE_NUMBER_DIVISIBLE_7{
static boolean f_gold ( String num ) {
int n = num . length ( ) ;
if ( n == 0 && num . charAt ( 0 ) == '0' ) return true ;
if ( n % 3 == 1 ) num = "00" + num ;
if ( n % 3 == 2 ) num = "0" + num ;
n = num . length ( ) ;
int gSum = 0 , p = 1 ;
for ( int i = n - 1 ;
i >= 0 ;
i -- ) {
int group = 0 ;
group += num . charAt ( i -- ) - '0' ;
group += ( num . charAt ( i -- ) - '0' ) * 10 ;
group += ( num . charAt ( i ) - '0' ) * 100 ;
gSum = gSum + group * p ;
p = p * - 1 ;
}
return ( gSum % 7 == 0 ) ;
}
//TOFILL
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("8955795758");
param0.add("0515");
param0.add("101");
param0.add("14");
param0.add("0");
param0.add("9250318");
param0.add("336");
param0.add("68143991");
param0.add("11010001");
param0.add("zsS");
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());
}
} | 6,099 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.