id stringlengths 9 111 | java stringlengths 188 2.04k | python stringlengths 40 1.94k ⌀ | cpp stringlengths 65 1.25k ⌀ | java_test stringlengths 532 56.4k | python_test stringlengths 348 57.4k ⌀ | cpp_test stringlengths 328 4.71k ⌀ |
|---|---|---|---|---|---|---|
MINIMUM_XOR_VALUE_PAIR |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_XOR_VALUE_PAIR{
static int f_gold ( int arr [ ] , int n ) {
int min_xor = Integer . MAX_VALUE ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) min_xor = Math . min ( min_... | def f_gold ( arr , n ) :
arr.sort ( ) ;
min_xor = 999999
val = 0
for i in range ( 0 , n - 1 ) :
for j in range ( i + 1 , n - 1 ) :
val = arr [ i ] ^ arr [ j ]
min_xor = min ( min_xor , val )
return min_xor
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int min_xor = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) min_xor = min ( min_xor, arr [ i ] ^ arr [ j ] );
return min_xor;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,5,7,10,10,11,14,19,21,24,27,27,27,28,28,28,33,34,41,42,43,48,52,53,53,59,62,64,66,71,77,78,78,79,80,82,90,97,99,99});
param0.add(new int[]{-68,-58,52,88,90,66,-66,-84,-70,-64,56,... |
if __name__ == '__main__':
param = [
([4, 5, 7, 10, 10, 11, 14, 19, 21, 24, 27, 27, 27, 28, 28, 28, 33, 34, 41, 42, 43, 48, 52, 53, 53, 59, 62, 64, 66, 71, 77, 78, 78, 79, 80, 82, 90, 97, 99, 99],34,),
([-68, -58, 52, 88, 90, 66, -66, -84, -70, -64, 56, 42, 94, -10, 0, 80, 8, 28, -94, 36, 90, 56, 56, 80, -... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,5,7,10,10,11,14,19,21,24,27,27,27,28,28,28,33,34,41,42,43,48,52,53,53,59,62,64,66,71,77,78,78,79,80,82,90,97,99,99},{-68,-58,52,88,90,66,-66,-84,-70,-64,56,42,94,-10,0,80,8,28,-94,36,90,56,56,80,-94,50,90,-28,-22,-2,-96,74,-16,-14},{0,0,0,0,0,0,1,1... |
SUM_DIVISORS_1_N_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_DIVISORS_1_N_1{
static int f_gold ( int n ) {
int sum = 0 ;
for ( int i = 1 ;
i <= n ;
++ i ) sum += ( n / i ) * i ;
return sum ;
}
| def f_gold ( n ) :
sum = 0
for i in range ( 1 , n + 1 ) :
sum += int ( n / i ) * i
return int ( sum )
|
using namespace std;
int f_gold ( int n ) {
int sum = 0;
for ( int i = 1;
i <= n;
++ i ) sum += ( n / i ) * i;
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(73);
param0.add(41);
param0.add(36);
param0.add(28);
param0.add(49);
param0.add(24);
param0.add(85);
param0.add(59);
param0.add(82);
param0.add(40);
for(i... |
if __name__ == '__main__':
param = [
(73,),
(41,),
(36,),
(28,),
(49,),
(24,),
(85,),
(59,),
(82,),
(40,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {73,41,36,28,49,24,85,59,82,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES{
static int f_gold ( int n ) {
return 1 + n * ( n + 1 ) / 2 ;
}
| def f_gold ( n ) :
return int ( 1 + n * ( n + 1 ) / 2 )
|
using namespace std;
int f_gold ( int n ) {
return 1 + n * ( n + 1 ) / 2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(46);
param0.add(68);
param0.add(4);
param0.add(12);
param0.add(56);
param0.add(14);
param0.add(81);
param0.add(29);
param0.add(26);
param0.add(40);
for(in... |
if __name__ == '__main__':
param = [
(46,),
(68,),
(4,),
(12,),
(56,),
(14,),
(81,),
(29,),
(26,),
(40,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {46,68,4,12,56,14,81,29,26,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
MAXIMUM_TRIPLET_SUM_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_TRIPLET_SUM_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int sum = - 1000000 ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) for ( int k = j + 1 ;
k < n ;
k ++... | def f_gold ( arr , n ) :
sm = - 1000000
for i in range ( 0 , n ) :
for j in range ( i + 1 , n ) :
for k in range ( j + 1 , n ) :
if ( sm < ( arr [ i ] + arr [ j ] + arr [ k ] ) ) :
sm = arr [ i ] + arr [ j ] + arr [ k ]
return sm
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) if ( sum < arr [ i ] + arr [ j ] + arr [ k ] ) sum = arr [ i ] + arr [ j ] + arr [ k ];
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,10,14,19,24,29,42,43,44,47,47,55,57,59,60,61,76,76,77,81,84,92,92,93,95,97});
param0.add(new int[]{-98,72,52,-62,74,-26,-82,-74,90,58,94,-2,76,-28,12,64,-94,86,56,10,40,20,92,-4,... |
if __name__ == '__main__':
param = [
([6, 10, 14, 19, 24, 29, 42, 43, 44, 47, 47, 55, 57, 59, 60, 61, 76, 76, 77, 81, 84, 92, 92, 93, 95, 97],15,),
([-98, 72, 52, -62, 74, -26, -82, -74, 90, 58, 94, -2, 76, -28, 12, 64, -94, 86, 56, 10, 40, 20, 92, -4, -80, 26, -40, 36, 66, -46, 4, -42, -76, 76, -90, -48, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,10,14,19,24,29,42,43,44,47,47,55,57,59,60,61,76,76,77,81,84,92,92,93,95,97},{-98,72,52,-62,74,-26,-82,-74,90,58,94,-2,76,-28,12,64,-94,86,56,10,40,20,92,-4,-80,26,-40,36,66,-46,4,-42,-76,76,-90,-48,22,30,48,38,78},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... |
MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
Arrays . sort ( arr ) ;
int a = 0 , b = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( i % 2 != 0 ) a = a * 10 + ... | def f_gold ( arr , n ) :
arr.sort ( )
a = 0 ; b = 0
for i in range ( n ) :
if ( i % 2 != 0 ) :
a = a * 10 + arr [ i ]
else :
b = b * 10 + arr [ i ]
return a + b
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
int a = 0, b = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( i & 1 ) a = a * 10 + arr [ i ];
else b = b * 10 + arr [ i ];
}
return a + b;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,4,5,10,14,16,18,42,43,43,45,46,51,52,53,58,61,66,79,81,82,84});
param0.add(new int[]{48,-22,60,32,48,-2,-76,-50,-26,56,-86,98,-30,-22,82,-20,58,40,76,-2,82,-90,8,-46,22,94});
... |
if __name__ == '__main__':
param = [
([3, 4, 5, 10, 14, 16, 18, 42, 43, 43, 45, 46, 51, 52, 53, 58, 61, 66, 79, 81, 82, 84],19,),
([48, -22, 60, 32, 48, -2, -76, -50, -26, 56, -86, 98, -30, -22, 82, -20, 58, 40, 76, -2, 82, -90, 8, -46, 22, 94],25,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,5,10,14,16,18,42,43,43,45,46,51,52,53,58,61,66,79,81,82,84},{48,-22,60,32,48,-2,-76,-50,-26,56,-86,98,-30,-22,82,-20,58,40,76,-2,82,-90,8,-46,22,94},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{79,45},{-90,-68,-38,-34,-4,6,10,28,48,52,5... |
LONGEST_PREFIX_ALSO_SUFFIX_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_PREFIX_ALSO_SUFFIX_1{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int lps [ ] = new int [ n ] ;
lps [ 0 ] = 0 ;
int len = 0 ;
int i = 1 ;
while ( i < n ) {
if ( s . charAt ( i... | def f_gold ( s ) :
n = len ( s )
lps = [ 0 ] * n
l = 0
i = 1
while ( i < n ) :
if ( s [ i ] == s [ l ] ) :
l = l + 1
lps [ i ] = l
i = i + 1
else :
if ( l != 0 ) :
l = lps [ l - 1 ]
else :
lps... |
using namespace std;
int f_gold ( string s ) {
int n = s . length ( );
int lps [ n ];
lps [ 0 ] = 0;
int len = 0;
int i = 1;
while ( i < n ) {
if ( s [ i ] == s [ len ] ) {
len ++;
lps [ i ] = len;
i ++;
}
else {
if ( len != 0 ) {
len = lps [ len - 1 ];
}
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("aabcdaabc");
param0.add("1372494598");
param0.add("110000100001");
param0.add("abcab");
param0.add("488938");
param0.add("011010101011");
param0.add("aaaa");
param0.a... |
if __name__ == '__main__':
param = [
('aabcdaabc',),
('1372494598',),
('110000100001',),
('abcab',),
('488938',),
('011010101011',),
('aaaa',),
('3356203205',),
('1010',),
('kkXiiTZkGeh',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if ... |
int main() {
int n_success = 0;
vector<string> param0 {"aabcdaabc","1372494598","110000100001","abcab","488938","011010101011","aaaa","3356203205","1010","kkXiiTZkGeh"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
SEARCHING_ARRAY_ADJACENT_DIFFER_K |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SEARCHING_ARRAY_ADJACENT_DIFFER_K{
static int f_gold ( int arr [ ] , int n , int x , int k ) {
int i = 0 ;
while ( i < n ) {
if ( arr [ i ] == x ) return i ;
i = i + Math . max ( 1 , Math . abs ( arr [... | def f_gold ( arr , n , x , k ) :
i = 0
while ( i < n ) :
if ( arr [ i ] == x ) :
return i
i = i + max ( 1 , int ( abs ( arr [ i ] - x ) / k ) )
print ( "number is not present!" )
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int n, int x, int k ) {
int i = 0;
while ( i < n ) {
if ( arr [ i ] == x ) return i;
i = i + max ( 1, abs ( arr [ i ] - x ) / k );
}
cout << "number is not present!";
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,5,9,11,14,18,19,21,26,32,38,38,43,47,49,52,55,61,65,67,69,73,74,79,84,90,91,91,92,93,94,99});
param0.add(new int[]{12,-86,-66,-50,-48,78,-92,-56,-2,66,64});
param0.add(new in... |
if __name__ == '__main__':
param = [
([1, 5, 9, 11, 14, 18, 19, 21, 26, 32, 38, 38, 43, 47, 49, 52, 55, 61, 65, 67, 69, 73, 74, 79, 84, 90, 91, 91, 92, 93, 94, 99],22,19,26,),
([12, -86, -66, -50, -48, 78, -92, -56, -2, 66, 64],5,10,5,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,9,11,14,18,19,21,26,32,38,38,43,47,49,52,55,61,65,67,69,73,74,79,84,90,91,91,92,93,94,99},{12,-86,-66,-50,-48,78,-92,-56,-2,66,64},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{10,87,39,87,45,33,... |
COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1{
static int f_gold ( int m , int n ) {
int count [ ] [ ] = new int [ m ] [ n ] ;
for ( int i = 0 ;
i < m ;
i ++ ) count [ i ] [ 0 ] = 1 ;
for ( int... | null |
using namespace std;
int f_gold ( int m, int n ) {
int count [ m ] [ n ];
for ( int i = 0;
i < m;
i ++ ) count [ i ] [ 0 ] = 1;
for ( int j = 0;
j < n;
j ++ ) count [ 0 ] [ j ] = 1;
for ( int i = 1;
i < m;
i ++ ) {
for ( int j = 1;
j < n;
j ++ ) count [ i ] [ j ] = count [ i - 1 ] [ j ]... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(79);
param0.add(95);
param0.add(15);
param0.add(71);
param0.add(16);
param0.add(91);
param0.add(10);
param0.add(98);
param0.add(30);
param0.add(58);
List<... | null |
int main() {
int n_success = 0;
vector<int> param0 {79,95,15,71,16,91,10,98,30,58};
vector<int> param1 {16,62,9,18,85,52,91,81,42,69};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
... |
MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS{
static int f_gold ( int x , int y ) {
if ( y == 0 ) return 0 ;
if ( y > 0 ) return ( x + f_gold ( x , y - 1 ) ) ;
if ( y <... | def f_gold ( x , y ) :
if ( y == 0 ) :
return 0
if ( y > 0 ) :
return ( x + f_gold ( x , y - 1 ) )
if ( y < 0 ) :
return - f_gold ( x , - y )
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(18);
param0.add(23);
param0.add(24);
param0.add(75);
param0.add(25);
param0.add(57);
param0.add(31);
param0.add(8);
param0.add(12);
param0.add(74);
List<I... |
if __name__ == '__main__':
param = [
(18,94,),
(23,36,),
(24,22,),
(75,92,),
(25,43,),
(57,32,),
(31,57,),
(8,17,),
(12,76,),
(74,70,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
... | null |
FIND_NUMBER_PAIRS_ARRAY_XOR_0 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_NUMBER_PAIRS_ARRAY_XOR_0{
static int f_gold ( int a [ ] , int n ) {
Arrays . sort ( a ) ;
int count = 1 ;
int answer = 0 ;
for ( int i = 1 ;
i < n ;
i ++ ) {
if ( a [ i ] == a [ i - 1 ] ) {
... | null |
using namespace std;
int f_gold ( int a [ ], int n ) {
sort ( a, a + n );
int count = 1;
int answer = 0;
for ( int i = 1;
i < n;
i ++ ) {
if ( a [ i ] == a [ i - 1 ] ) {
count += 1;
}
else {
answer = answer + ( count * ( count - 1 ) ) / 2;
count = 1;
}
}
answer = answe... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,7,9,12,13,13,14,16,19,23,24,25,28,29,38,38,41,42,44,51,55,56,58,59,61,62,62,63,63,64,67,68,69,71,78,78,80,82,82,82,83,85,86,92,94,98});
param0.add(new int[]{42,-20,52,34,58,62,-6... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,9,12,13,13,14,16,19,23,24,25,28,29,38,38,41,42,44,51,55,56,58,59,61,62,62,63,63,64,67,68,69,71,78,78,80,82,82,82,83,85,86,92,94,98},{42,-20,52,34,58,62,-60,70,36,-8,-26,68,34,-92,42,94,56,84,-70,70},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... |
FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY{
static int f_gold ( int [ ] arr , int n ) {
int result = - 1 ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = 0 ;
j < n - 1 ;
j ++ ) for ( int k = j + 1 ;
k ... | def f_gold ( arr , n ) :
result = - 1
for i in range ( n ) :
for j in range ( n - 1 ) :
for k in range ( j + 1 , n ) :
if ( arr [ j ] * arr [ k ] == arr [ i ] ) :
result = max ( result , arr [ i ] )
return result
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int result = - 1;
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = max ( result, arr [ i ] );
return result;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,78,84});
param0.add(new int[]{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-... |
if __name__ == '__main__':
param = [
([4, 78, 84],2,),
([-54, 64, 60, 14, 18, -68, -54, -58, 38, -72, -84, 46, 74, 76, 28, -2, 54, 24, 18, -74, -78, 14, -38, -70, 26, -54, -36, -96, -12, 8, 62, -42, -84, 10, -6, 36, -72, 10, 10, -20, 16, 92, -64, -34, 74, -98, 18],26,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,78,84},{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,49,94,80,48,34,6... |
NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1{
public static int f_gold ( int a , int b ) {
if ( a == 0 || b == 0 ) return 1 ;
return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ... | import math
def f_gold ( a , b ) :
if ( a == 0 or b == 0 ) :
return 1
return math.floor ( math.log10 ( abs ( a ) ) + math.log10 ( abs ( b ) ) ) + 1
|
using namespace std;
int f_gold ( int a, int b ) {
if ( a == 0 || b == 0 ) return 1;
return floor ( log10 ( abs ( a ) ) + log10 ( abs ( b ) ) ) + 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(97);
param0.add(52);
param0.add(95);
param0.add(35);
param0.add(40);
param0.add(18);
param0.add(92);
param0.add(73);
param0.add(10);
param0.add(82);
List<... |
if __name__ == '__main__':
param = [
(97,91,),
(52,49,),
(95,34,),
(35,40,),
(40,85,),
(18,97,),
(92,15,),
(73,98,),
(10,62,),
(82,22,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):... |
int main() {
int n_success = 0;
vector<int> param0 {97,52,95,35,40,18,92,73,10,82};
vector<int> param1 {91,49,34,40,85,97,15,98,62,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
... |
COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS{
static long f_gold ( int n ) {
long dp [ ] [ ] = new long [ 2 ] [ n + 1 ] ;
dp [ 0 ] [ 1 ] = 1 ;
dp [ 1 ] [ 1 ] = 2 ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
... | def f_gold ( n ) :
dp = [ [ 0 ] * ( n + 1 ) for i in range ( 2 ) ]
dp [ 0 ] [ 1 ] = 1
dp [ 1 ] [ 1 ] = 2
for i in range ( 2 , n + 1 ) :
dp [ 0 ] [ i ] = dp [ 0 ] [ i - 1 ] + dp [ 1 ] [ i - 1 ]
dp [ 1 ] [ i ] = ( dp [ 0 ] [ i - 1 ] * 2 + dp [ 1 ] [ i - 1 ] )
return dp [ 0 ] [ n ] + dp... |
using namespace std;
long f_gold ( int n ) {
long dp [ 2 ] [ n + 1 ];
dp [ 0 ] [ 1 ] = 1;
dp [ 1 ] [ 1 ] = 2;
for ( int i = 2;
i <= n;
i ++ ) {
dp [ 0 ] [ i ] = dp [ 0 ] [ i - 1 ] + dp [ 1 ] [ i - 1 ];
dp [ 1 ] [ i ] = dp [ 0 ] [ i - 1 ] * 2 + dp [ 1 ] [ i - 1 ];
}
return dp [ 0 ] [ n ] + dp [ ... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(68);
param0.add(91);
param0.add(99);
param0.add(79);
param0.add(61);
param0.add(48);
param0.add(89);
param0.add(20);
param0.add(83);
param0.add(1);
for(in... |
if __name__ == '__main__':
param = [
(68,),
(91,),
(99,),
(79,),
(61,),
(48,),
(89,),
(20,),
(83,),
(1,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {68,91,99,79,61,48,89,20,83,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
PROGRAM_FIND_CIRCUMFERENCE_CIRCLE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FIND_CIRCUMFERENCE_CIRCLE{
static double f_gold ( double r ) {
double PI = 3.1415 ;
double cir = 2 * PI * r ;
return cir ;
}
| null | null |
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(8650.932760642281);
param0.add(-9475.213251789266);
param0.add(3895.3903681587985);
param0.add(-2977.0280936855806);
param0.add(8513.1890392562);
param0.add(-239.5023899621529... | null | null |
NTH_NON_FIBONACCI_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NTH_NON_FIBONACCI_NUMBER{
static int f_gold ( int n ) {
int prevPrev = 1 , prev = 2 , curr = 3 ;
while ( n > 0 ) {
prevPrev = prev ;
prev = curr ;
curr = prevPrev + prev ;
n = n - ( curr - prev... | def f_gold ( n ) :
prevPrev = 1
prev = 2
curr = 3
while n > 0 :
prevPrev = prev
prev = curr
curr = prevPrev + prev
n = n - ( curr - prev - 1 )
n = n + ( curr - prev - 1 )
return prev + n
|
using namespace std;
int f_gold ( int n ) {
int prevPrev = 1, prev = 2, curr = 3;
while ( n > 0 ) {
prevPrev = prev;
prev = curr;
curr = prevPrev + prev;
n = n - ( curr - prev - 1 );
}
n = n + ( curr - prev - 1 );
return prev + n;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(76);
param0.add(91);
param0.add(62);
param0.add(65);
param0.add(83);
param0.add(57);
param0.add(76);
param0.add(6);
param0.add(2);
param0.add(86);
for(int... |
if __name__ == '__main__':
param = [
(76,),
(91,),
(62,),
(65,),
(83,),
(57,),
(76,),
(6,),
(2,),
(86,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pr... |
int main() {
int n_success = 0;
vector<int> param0 {76,91,62,65,83,57,76,6,2,86};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
r... |
PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT{
static boolean f_gold ( int n ) {
boolean arr [ ] = new boolean [ 10 ] ;
for ( int i = 0 ;
i < 10 ;
i ++ ) arr [ i ] = false ;
while ... | import math
def f_gold ( n ) :
ar = [ 0 ] * 10
while ( n > 0 ) :
digit = math.floor ( n % 10 )
if ( ar [ digit ] ) :
return 0
ar [ digit ] = 1
n = n / 10
return 1
|
using namespace std;
bool f_gold ( int n ) {
bool arr [ 10 ];
for ( int i = 0;
i < 10;
i ++ ) arr [ i ] = false;
while ( n > 0 ) {
int digit = n % 10;
if ( arr [ digit ] ) return false;
arr [ digit ] = true;
n = n / 10;
}
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(474);
param0.add(9445);
param0.add(90);
param0.add(30);
param0.add(37453);
param0.add(27);
param0.add(2400);
param0.add(98);
param0.add(46);
param0.add(722);
... |
if __name__ == '__main__':
param = [
(474,),
(9445,),
(90,),
(30,),
(37453,),
(27,),
(2400,),
(98,),
(46,),
(722,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_succes... |
int main() {
int n_success = 0;
vector<int> param0 {474,9445,90,30,37453,27,2400,98,46,722};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.si... |
AREA_OF_A_HEXAGON |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class AREA_OF_A_HEXAGON{
public static double f_gold ( double s ) {
return ( ( 3 * Math . sqrt ( 3 ) * ( s * s ) ) / 2 ) ;
}
| import math
def f_gold ( s ) :
return ( ( 3 * math.sqrt ( 3 ) * ( s * s ) ) / 2 ) ;
|
using namespace std;
double f_gold ( double s ) {
return ( ( 3 * sqrt ( 3 ) * ( s * s ) ) / 2 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(1772.6589509256596);
param0.add(-599.737107809315);
param0.add(1074.1765931782);
param0.add(-1182.4087746714795);
param0.add(8083.035797247716);
param0.add(-6126.414356565494)... |
if __name__ == '__main__':
param = [
(1772.6589509256596,),
(-599.737107809315,),
(1074.1765931782,),
(-1182.4087746714795,),
(8083.035797247716,),
(-6126.414356565494,),
(5370.057504189614,),
(-6947.020794285176,),
(2110.5107873533325,),
(-6458.751326919488,)
]
... |
int main() {
int n_success = 0;
vector<double> param0 {1772.6589509256596,-599.737107809315,1074.1765931782,-1182.4087746714795,8083.035797247716,-6126.414356565494,5370.057504189614,-6947.020794285176,2110.5107873533325,-6458.751326919488};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (... |
REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT{
static int f_gold ( int dp [ ] [ ] , int a [ ] , int low , int high , int turn ) {
if ( low == high ) {
return a [ low ] * turn ;
}
if ( dp [ low ] [ high ]... | def f_gold ( dp , a , low , high , turn ) :
if ( low == high ) :
return a [ low ] * turn
if ( dp [ low ] [ high ] != 0 ) :
return dp [ low ] [ high ]
dp [ low ] [ high ] = max ( a [ low ] * turn + f_gold ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_gold ( dp , a , low , hig... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{23,37,54,57,59,75,97},new int[]{9,15,34,39,80,96,99},new int[]{15,25,26,31,43,47,93},new int[]{22,31,37,44,54,62,91},new int[]{7,19,32,56,57,70,81},new int[]{16,37,49,7... |
if __name__ == '__main__':
param = [
([[23, 37, 54, 57, 59, 75, 97], [9, 15, 34, 39, 80, 96, 99], [15, 25, 26, 31, 43, 47, 93], [22, 31, 37, 44, 54, 62, 91], [7, 19, 32, 56, 57, 70, 81], [16, 37, 49, 77, 81, 82, 85], [44, 48, 64, 74, 79, 89, 99]],[31, 50, 50, 68, 69, 80, 87],6,5,4,),
([[-24, -34, -86, -16,... | null |
STEINS_ALGORITHM_FOR_FINDING_GCD |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class STEINS_ALGORITHM_FOR_FINDING_GCD{
static int f_gold ( int a , int b ) {
if ( a == 0 ) return b ;
if ( b == 0 ) return a ;
int k ;
for ( k = 0 ;
( ( a | b ) & 1 ) == 0 ;
++ k ) {
a >>= 1 ;
b >>=... | def f_gold ( a , b ) :
if ( a == 0 ) :
return b
if ( b == 0 ) :
return a
k = 0
while ( ( ( a | b ) & 1 ) == 0 ) :
a = a >> 1
b = b >> 1
k = k + 1
while ( ( a & 1 ) == 0 ) :
a = a >> 1
while ( b != 0 ) :
while ( ( b & 1 ) == 0 ) :
... | null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(37);
param0.add(58);
param0.add(89);
param0.add(75);
param0.add(59);
param0.add(84);
param0.add(47);
param0.add(37);
param0.add(83);
param0.add(28);
List<... |
if __name__ == '__main__':
param = [
(37,93,),
(58,13,),
(89,27,),
(75,14,),
(59,47,),
(84,39,),
(47,76,),
(37,75,),
(83,62,),
(28,58,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):... | null |
FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT{
static boolean f_gold ( int n ) {
return 1162261467 % n == 0 ;
}
| def f_gold ( n ) :
return 1162261467 % n == 0
|
using namespace std;
bool f_gold ( int n ) {
return 1162261467 % n == 0;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(3);
param0.add(27);
param0.add(9);
param0.add(-9);
param0.add(11);
param0.add(57);
param0.add(21);
param0.add(60);
param0.add(44);
for(int ... |
if __name__ == '__main__':
param = [
(1,),
(3,),
(27,),
(9,),
(-9,),
(11,),
(57,),
(21,),
(60,),
(44,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {1,3,27,9,-9,11,57,21,60,44};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
re... |
MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L{
static int f_gold ( int [ ] arr , int n ) {
if ( n < 4 ) {
System . out . println ( "The array should have" + " atleast 4 elements" ) ;
}
int table1 [ ] = ... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{18,27,36,51,67,70,71,72,79,85,86,89,93,94,97});
param0.add(new int[]{4,70,88,90,-34,-4,-36,-38,16,-46,-60,-50,-72,-68,-42,-96,46,32,-80,46,-4,-86,-72,16,40,-74,78,-64,-38});
pa... | null | null |
COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS{
static int f_gold ( int arr [ ] , int n ) {
Arrays . sort ( arr ) ;
int count = 1 ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) {
if ( arr [ i ... | def f_gold(arr, n):
x = sorted(arr)
count = 1
for i in range(0, n - 1):
if (x[i] + 1 != x[i + 1]):
count = count + 1
return count
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
int count = 1;
for ( int i = 0;
i < n - 1;
i ++ ) {
if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++;
}
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,7,7,11,14,14,14,16,17,17,21,22,24,27,27,27,31,33,35,36,36,37,38,43,45,49,52,54,57,59,59,60,67,73,74,74,74,75,75,79,83,87,90,93,97});
param0.add(new int[]{-28,72,60,62,40,64,50,-3... |
if __name__ == '__main__':
param = [
([3, 7, 7, 11, 14, 14, 14, 16, 17, 17, 21, 22, 24, 27, 27, 27, 31, 33, 35, 36, 36, 37, 38, 43,
45, 49, 52, 54, 57, 59, 59, 60, 67, 73, 74, 74, 74, 75, 75, 79, 83, 87, 90, 93, 97], 42,),
([-28, 72, 60, 62, 40, 64, 50, -36, -24, 40, -6, 78, -80, -82, 2, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,7,7,11,14,14,14,16,17,17,21,22,24,27,27,27,31,33,35,36,36,37,38,43,45,49,52,54,57,59,59,60,67,73,74,74,74,75,75,79,83,87,90,93,97},{-28,72,60,62,40,64,50,-36,-24,40,-6,78,-80,-82,2,-30,70,94,-2,-30,92,12,-46,32,-96,-2,36,-40,-42,66,98},{1,1},{96,89... |
EQUILIBRIUM_INDEX_OF_AN_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EQUILIBRIUM_INDEX_OF_AN_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int i , j ;
int leftsum , rightsum ;
for ( i = 0 ;
i < n ;
++ i ) {
leftsum = 0 ;
for ( j = 0 ;
j < i ;
j ++ ) l... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i, j;
int leftsum, rightsum;
for ( i = 0;
i < n;
++ i ) {
leftsum = 0;
for ( j = 0;
j < i;
j ++ ) leftsum += arr [ j ];
rightsum = 0;
for ( j = i + 1;
j < n;
j ++ ) rightsum += arr [ j ];
if ( leftsum == rightsum... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,6,7,8,15,15,19,23,27,28,29,31,37,40,41,42,50,51,57,58,63,63,64,70,71,72,78,83,85,90,90});
param0.add(new int[]{-68,-92});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,6,7,8,15,15,19,23,27,28,29,31,37,40,41,42,50,51,57,58,63,63,64,70,71,72,78,83,85,90,90},{-68,-92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{80,74,45,81,62,88,90,54},{-92,-84,-84,-66,-64,-50,-50,-48,-46,-44,-36,-36... |
LONGEST_REPEATING_SUBSEQUENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_REPEATING_SUBSEQUENCE{
static int f_gold ( String str ) {
int n = str . length ( ) ;
int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
for ( int j = 1 ;
j... | def f_gold ( str ) :
n = len ( str )
dp = [ [ 0 ] * ( n + 1 ) ] * ( n + 1 )
for i in range ( 1 , n + 1 ) :
for j in range ( 1 , n + 1 ) :
if ( str [ i - 1 ] == str [ j - 1 ] and i != j ) :
dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ]
else :
dp [... |
using namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int dp [ n + 1 ] [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) for ( int j = 0;
j <= n;
j ++ ) dp [ i ] [ j ] = 0;
for ( int i = 1;
i <= n;
i ++ ) {
for ( int j = 1;
j <= n;
j ++ ) {
if ( str [ i - 1 ] == str ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("JxZFz");
param0.add("7648992235770");
param0.add("11100000");
param0.add("cRN SgYjPsctJ");
param0.add("434");
param0.add("1");
param0.add("JRfZIAsbrPBZ");
param0.add... |
if __name__ == '__main__':
param = [
('JxZFz',),
('7648992235770',),
('11100000',),
('cRN SgYjPsctJ',),
('434',),
('1',),
('JRfZIAsbrPBZ',),
('03779368305592',),
('1111000',),
('BkULuIi',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if... |
int main() {
int n_success = 0;
vector<string> param0 {"JxZFz","7648992235770","11100000","cRN SgYjPsctJ","434","1","JRfZIAsbrPBZ","03779368305592","1111000","BkULuIi"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM{
static int f_gold ( int a , int b ) {
int res = 0 ;
while ( b > 0 ) {
if ( ( b & 1 ) != 0 ) res = res + a ;
... | def f_gold ( a , b ) :
res = 0
while ( b > 0 ) :
if ( b & 1 ) :
res = res + a
a = a << 1
b = b >> 1
return res
|
using namespace std;
unsigned int f_gold ( unsigned int a, unsigned int b ) {
int res = 0;
while ( b > 0 ) {
if ( b & 1 ) res = res + a;
a = a << 1;
b = b >> 1;
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(4);
param0.add(36);
param0.add(65);
param0.add(55);
param0.add(35);
param0.add(69);
param0.add(84);
param0.add(5);
param0.add(15);
param0.add(67);
List<In... |
if __name__ == '__main__':
param = [
(4,33,),
(36,67,),
(65,52,),
(55,37,),
(35,76,),
(69,98,),
(84,62,),
(5,80,),
(15,36,),
(67,84,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
... |
int main() {
int n_success = 0;
vector<int> param0 {4,36,65,55,35,69,84,5,15,67};
vector<int> param1 {33,67,52,37,76,98,62,80,36,84};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1{
static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > hmap = new HashMap < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( hmap . co... | def f_gold ( arr , size ) :
Hash = dict ( )
for i in range ( size ) :
Hash [ arr [ i ] ] = Hash.get ( arr [ i ] , 0 ) + 1 ;
for i in Hash :
if ( Hash [ i ] % 2 != 0 ) :
return i
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int size ) {
unordered_map < int, int > hash;
for ( int i = 0;
i < size;
i ++ ) {
hash [ arr [ i ] ] ++;
}
for ( auto i : hash ) {
if ( i . second % 2 != 0 ) {
return i . first;
}
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{49,90});
param0.add(new int[]{-96,94,92,-24,48,54,-30,-86,28,-18,12,-64,-36,68,68,-78,-6,30,-84,20,52,-36,40,-62,90,-48,86,98,12,44,98,-66,52,34,36,76,-50,-20,-20,-20});
param0... |
if __name__ == '__main__':
param = [
([49, 90],1,),
([-96, 94, 92, -24, 48, 54, -30, -86, 28, -18, 12, -64, -36, 68, 68, -78, -6, 30, -84, 20, 52, -36, 40, -62, 90, -48, 86, 98, 12, 44, 98, -66, 52, 34, 36, 76, -50, -20, -20, -20],39,),
([0, 1],1,),
([79, 55, 18, 99, 38, 93, 19, 49, 21, 74, 16, 76,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{49,90},{-96,94,92,-24,48,54,-30,-86,28,-18,12,-64,-36,68,68,-78,-6,30,-84,20,52,-36,40,-62,90,-48,86,98,12,44,98,-66,52,34,36,76,-50,-20,-20,-20},{0,1},{79,55,18,99,38,93,19,49,21,74,16,76,82,52,86,17,42,9,6,63,1,40,75,59,41,81},{-90,-84,-82,-68,-66,... |
SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2{
static int f_gold ( int n ) {
n -- ;
n |= n >> 1 ;
n |= n >> 2 ;
n |= n >> 4 ;
n |= n >> 8 ;
n |= n >> 16 ;
n ++ ;
return n ;
}
| def f_gold ( n ) :
n -= 1
n |= n >> 1
n |= n >> 2
n |= n >> 4
n |= n >> 8
n |= n >> 16
n += 1
return n
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
n --;
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n ++;
return n;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(60);
param0.add(20);
param0.add(33);
param0.add(34);
param0.add(68);
param0.add(79);
param0.add(20);
param0.add(41);
param0.add(36);
param0.add(17);
for(i... |
if __name__ == '__main__':
param = [
(60,),
(20,),
(33,),
(34,),
(68,),
(79,),
(20,),
(41,),
(36,),
(17,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {60,20,33,34,68,79,20,41,36,17};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D{
static int f_gold ( int [ ] S , int n ) {
boolean found = false ;
Arrays . sort ( S ) ;
for ( int i = n - 1 ;
i >= 0 ;
i -- ) {
for ( int j = 0 ;
j < n ... | def f_gold ( S , n ) :
found = False
S.sort ( )
for i in range ( n - 1 , - 1 , - 1 ) :
for j in range ( 0 , n ) :
if ( i == j ) :
continue
for k in range ( j + 1 , n ) :
if ( i == k ) :
continue
for l in rang... |
using namespace std;
int f_gold ( int S [ ], int n ) {
bool found = false;
sort ( S, S + n );
for ( int i = n - 1;
i >= 0;
i -- ) {
for ( int j = 0;
j < n;
j ++ ) {
if ( i == j ) continue;
for ( int k = j + 1;
k < n;
k ++ ) {
if ( i == k ) continue;
for ( i... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,12,14,15,16,20,27,28,29,30,35,41,46,51,53,55,55,58,63,64,72,73,75,75,75,82,82,86,89,91,92,94,95,95,97,97,98});
param0.add(new int[]{-62,48,-22,-44,-58,-50,-82,34,26,-2,86,-44,92,... |
if __name__ == '__main__':
param = [
([8, 12, 14, 15, 16, 20, 27, 28, 29, 30, 35, 41, 46, 51, 53, 55, 55, 58, 63, 64, 72, 73, 75, 75, 75, 82, 82, 86, 89, 91, 92, 94, 95, 95, 97, 97, 98],24,),
([-62, 48, -22, -44, -58, -50, -82, 34, 26, -2, 86, -44, 92, -96, 42, -20, 10, 74, -56, -12, -28, -40],19,),
([... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,12,14,15,16,20,27,28,29,30,35,41,46,51,53,55,55,58,63,64,72,73,75,75,75,82,82,86,89,91,92,94,95,95,97,97,98},{-62,48,-22,-44,-58,-50,-82,34,26,-2,86,-44,92,-96,42,-20,10,74,-56,-12,-28,-40},{0,0,0,0,0,0,0,1,1,1},{84,58,10,67,77,66,10,47,65,55,54},{... |
N_TH_ROOT_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class N_TH_ROOT_NUMBER{
static double f_gold ( int A , int N ) {
double xPre = Math . random ( ) % 10 ;
double eps = 0.001 ;
double delX = 2147483647 ;
double xK = 0.0 ;
while ( delX > eps ) {
xK = ( ( N -... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(94);
param0.add(74);
param0.add(29);
param0.add(29);
param0.add(18);
param0.add(96);
param0.add(3);
param0.add(35);
param0.add(51);
param0.add(19);
List<I... | null | null |
REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S{
static String f_gold ( String s , char c1 , char c2 ) {
int l = s . length ( ) ;
char [ ] arr = s . toCharArray ( ) ;
for ( int i = 0 ;
i < l ;
i ++ ) {
if ( a... | def f_gold ( s , c1 , c2 ) :
l = len ( s )
for i in range ( l ) :
if ( s [ i ] == c1 ) :
s = s [ 0 : i ] + c2 + s [ i + 1 : ]
elif ( s [ i ] == c2 ) :
s = s [ 0 : i ] + c1 + s [ i + 1 : ]
return s
|
using namespace std;
string f_gold ( string s, char c1, char c2 ) {
int l = s . length ( );
for ( int i = 0;
i < l;
i ++ ) {
if ( s [ i ] == c1 ) s [ i ] = c2;
else if ( s [ i ] == c2 ) s [ i ] = c1;
}
return s;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("IZTSMw j");
param0.add("7288334");
param0.add("010110000");
param0.add("b gJX");
param0.add("734");
param0.add("1");
param0.add("xCaUKdhA");
param0.add("4370992644981... |
if __name__ == '__main__':
param = [
('IZTSMw j','W','k',),
('7288334','6','9',),
('010110000','1','1',),
('b gJX','t','P',),
('734','4','4',),
('1','1','1',),
('xCaUKdhA','X','S',),
('4370992644981','5','6',),
('01010','0','1',),
('ZNIFGshaWA','Q','x',)
]
n_succ... |
int main() {
int n_success = 0;
vector<string> param0 {"IZTSMw j","7288334","010110000","b gJX","734","1","xCaUKdhA","4370992644981","01010","ZNIFGshaWA"};
vector<char> param1 {'W','6','1','t','4','1','X','5','0','Q'};
vector<char> param2 {'k','9','1','P','4','1','S','6','1','x'};
for(int i = 0; i ... |
FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int i ;
for ( i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] == i ) return i ;
}
return - 1 ;
}
| def f_gold ( arr , n ) :
for i in range ( n ) :
if arr [ i ] is i :
return i
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == i ) return i;
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,16,21,26,27,29,34,35,35,37,38,40,48,52,58,59,60,61,63,63,65,66,69,75,79,83,86,88,91,91,96});
param0.add(new int[]{22,-70,34,-44,84,54,14,-88});
param0.add(new int[]{0,0,0,0,0... |
if __name__ == '__main__':
param = [
([8, 16, 21, 26, 27, 29, 34, 35, 35, 37, 38, 40, 48, 52, 58, 59, 60, 61, 63, 63, 65, 66, 69, 75, 79, 83, 86, 88, 91, 91, 96],23,),
([22, -70, 34, -44, 84, 54, 14, -88],7,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,16,21,26,27,29,34,35,35,37,38,40,48,52,58,59,60,61,63,63,65,66,69,75,79,83,86,88,91,91,96},{22,-70,34,-44,84,54,14,-88},{0,0,0,0,0,0,0,0,0,0,0,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},{59,67,70,34,18,22,52,95,11,66,60,24,7,71,52,88,32,5... |
COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1{
static int f_gold ( int n ) {
return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 ) ;
}
| def f_gold ( n ) :
return ( 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) // 2 ) )
|
using namespace std;
int f_gold ( int n ) {
return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(55);
param0.add(36);
param0.add(69);
param0.add(92);
param0.add(73);
param0.add(16);
param0.add(88);
param0.add(19);
param0.add(66);
param0.add(68);
for(i... |
if __name__ == '__main__':
param = [
(55,),
(36,),
(69,),
(92,),
(73,),
(16,),
(88,),
(19,),
(66,),
(68,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {55,36,69,92,73,16,88,19,66,68};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1{
static Boolean f_gold ( int arr [ ] , int n ) {
HashSet < Integer > us = new HashSet < Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) us . a... | null |
using namespace std;
bool f_gold ( int arr [ ], int n ) {
unordered_set < int > us;
for ( int i = 0;
i < n;
i ++ ) us . insert ( arr [ i ] );
int count = 1;
int curr_ele = arr [ 0 ] - 1;
while ( us . find ( curr_ele ) != us . end ( ) ) {
count ++;
curr_ele --;
}
curr_ele = arr [ 0 ] + 1;
wh... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{15,19,38,59,71});
param0.add(new int[]{-20,66,-22,-56,-6,94,70,-80,24,-26,-58,-76,-20,-8,-62,18,-56,-20,42,-40,-88,-74,64,-26,-92,66,-18,-64,66,12,24,-8,78,-82,14,-76});
param0... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{15,19,38,59,71},{-20,66,-22,-56,-6,94,70,-80,24,-26,-58,-76,-20,-8,-62,18,-56,-20,42,-40,-88,-74,64,-26,-92,66,-18,-64,66,12,24,-8,78,-82,14,-76},{0,0,1,1,1},{40,38,17,50,16,35,34,23,3,12,97,53,75,36,3,73,99,11,70,9,23,3,11,9,64,44,62,94,55,69,44,59,... |
NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR{
static int f_gold ( int n ) {
return n * ( n - 1 ) * ( n - 2 ) / 6 ;
}
| def f_gold ( n ) :
return ( n * ( n - 1 ) * ( n - 2 ) // 6 )
|
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 ) * ( n - 2 ) / 6;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(58);
param0.add(67);
param0.add(60);
param0.add(4);
param0.add(97);
param0.add(9);
param0.add(16);
param0.add(83);
param0.add(87);
for(int... |
if __name__ == '__main__':
param = [
(67,),
(58,),
(67,),
(60,),
(4,),
(97,),
(9,),
(16,),
(83,),
(87,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pr... |
int main() {
int n_success = 0;
vector<int> param0 {67,58,67,60,4,97,9,16,83,87};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
r... |
FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS{
static int f_gold ( int n ) {
int C [ ] [ ] = new int [ n + 1 ] [ n + 1 ] ;
int i , j ;
for ( i = 0 ;
i <= n ;
i ++ ) {
for ( j = 0 ;
j <= Math . min ( ... | def f_gold ( n ) :
C = [ [ 0 for x in range ( n + 1 ) ] for y in range ( n + 1 ) ]
for i in range ( 0 , n + 1 ) :
for j in range ( 0 , min ( i , n + 1 ) ) :
if j == 0 or j == i :
C [ i ] [ j ] = 1
else :
C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ ... |
using namespace std;
int f_gold ( int n ) {
int C [ n + 1 ] [ n + 1 ];
int i, j;
for ( i = 0;
i <= n;
i ++ ) {
for ( j = 0;
j <= min ( i, n );
j ++ ) {
if ( j == 0 || j == i ) C [ i ] [ j ] = 1;
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int sum = 0;
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(18);
param0.add(54);
param0.add(67);
param0.add(17);
param0.add(47);
param0.add(99);
param0.add(26);
param0.add(93);
param0.add(57);
param0.add(98);
for(i... |
if __name__ == '__main__':
param = [
(18,),
(54,),
(67,),
(17,),
(47,),
(99,),
(26,),
(93,),
(57,),
(98,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {18,54,67,17,47,99,26,93,57,98};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
DECODE_MEDIAN_STRING_ORIGINAL_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DECODE_MEDIAN_STRING_ORIGINAL_STRING{
static String f_gold ( String s ) {
int l = s . length ( ) ;
String s1 = "" ;
boolean isEven = ( l % 2 == 0 ) ? true : false ;
for ( int i = 0 ;
i < l ;
i += 2 ) {... | def f_gold ( s ) :
l = len ( s )
s1 = ""
if ( l % 2 == 0 ) :
isEven = True
else :
isEven = False
for i in range ( 0 , l , 2 ) :
if ( isEven ) :
s1 = s [ i ] + s1
s1 += s [ i + 1 ]
else :
if ( l - i > 1 ) :
s1 += s [ ... |
using namespace std;
string f_gold ( string s ) {
int l = s . length ( );
string s1 = "";
bool isEven = ( l % 2 == 0 ) ? true : false;
for ( int i = 0;
i < l;
i += 2 ) {
if ( isEven ) {
s1 = s [ i ] + s1;
s1 += s [ i + 1 ];
}
else {
if ( l - i > 1 ) {
s1 += s [ i ];
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add(" EgvQCeqYpZtv");
param0.add("488540");
param0.add("0000101010111");
param0.add("syw");
param0.add("402355");
param0.add("0");
param0.add("wmHMlAtq");
param0.add("7962... |
if __name__ == '__main__':
param = [
(' EgvQCeqYpZtv',),
('488540',),
('0000101010111',),
('syw',),
('402355',),
('0',),
('wmHMlAtq',),
('7962',),
('111111',),
('UbgRGDquop',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*par... |
int main() {
int n_success = 0;
vector<string> param0 {" EgvQCeqYpZtv","488540","0000101010111","syw","402355","0","wmHMlAtq","7962","111111","UbgRGDquop"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
... |
LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING{
static String f_gold ( String str ) {
String mx = "" ;
for ( int i = 0 ;
i < str . length ( ) ;
++ i ) {
if ( mx . compareTo ( str . substring ( i ) ) <= 0 ) {... | def f_gold ( str ) :
mx = ""
for i in range ( len ( str ) ) :
mx = max ( mx , str [ i : ] )
return mx
|
using namespace std;
string f_gold ( string str ) {
string mx = "";
for ( int i = 0;
i < str . length ( );
++ i ) mx = max ( mx, str . substr ( i ) );
return mx;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("HCoAefoaan");
param0.add("80336005");
param0.add("01111111110");
param0.add("qIH");
param0.add("4210598472796");
param0.add("10101");
param0.add("imqmKdatcgXjs");
par... |
if __name__ == '__main__':
param = [
('HCoAefoaan',),
('80336005',),
('01111111110',),
('qIH',),
('4210598472796',),
('10101',),
('imqmKdatcgXjs',),
('950509666021',),
('10111101101',),
('wasqgYFvz',)
]
n_success = 0
for i, parameters_set in enumerate(param):... |
int main() {
int n_success = 0;
vector<string> param0 {"HCoAefoaan","80336005","01111111110","qIH","4210598472796","10101","imqmKdatcgXjs","950509666021","10111101101","wasqgYFvz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_suc... |
FIND_LARGEST_PRIME_FACTOR_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_LARGEST_PRIME_FACTOR_NUMBER{
static long f_gold ( long n ) {
long maxPrime = - 1 ;
while ( n % 2 == 0 ) {
maxPrime = 2 ;
n >>= 1 ;
}
for ( int i = 3 ;
i <= Math . sqrt ( n ) ;
i += 2 ) {
... | import math
def f_gold ( n ) :
maxPrime = - 1
while n % 2 == 0 :
maxPrime = 2
n >>= 1
for i in range ( 3 , int ( math.sqrt ( n ) ) + 1 , 2 ) :
while n % i == 0 :
maxPrime = i
n = n / i
if n > 2 :
maxPrime = n
return int ( maxPrime )
|
using namespace std;
long long f_gold ( long long n ) {
long long maxPrime = - 1;
while ( n % 2 == 0 ) {
maxPrime = 2;
n >>= 1;
}
for ( int i = 3;
i <= sqrt ( n );
i += 2 ) {
while ( n % i == 0 ) {
maxPrime = i;
n = n / i;
}
}
if ( n > 2 ) maxPrime = n;
return maxPrime;
}
... |
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(98L);
param0.add(8L);
param0.add(78L);
param0.add(65L);
param0.add(55L);
param0.add(10L);
param0.add(10L);
param0.add(37L);
param0.add(39L);
param0.add(15L);
... |
if __name__ == '__main__':
param = [
(98,),
(8,),
(78,),
(65,),
(55,),
(10,),
(10,),
(37,),
(39,),
(15,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<long> param0 {98,8,78,65,55,10,10,37,39,15};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1{
static int f_gold ( int n ) {
int nCr = 1 , res = 1 ;
for ( int r = 1 ;
r <= n ;
r ++ ) {
nCr = ( nCr * ( n + 1 - r ) )... | def f_gold ( n ) :
nCr = 1
res = 1
for r in range ( 1 , n + 1 ) :
nCr = ( nCr * ( n + 1 - r ) ) / r ;
res += nCr * nCr ;
return res ;
|
using namespace std;
int f_gold ( int n ) {
int nCr = 1, res = 1;
for ( int r = 1;
r <= n;
r ++ ) {
nCr = ( nCr * ( n + 1 - r ) ) / r;
res += nCr * nCr;
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(52);
param0.add(75);
param0.add(25);
param0.add(80);
param0.add(18);
param0.add(17);
param0.add(33);
param0.add(8);
param0.add(99);
param0.add(8);
for(int... |
if __name__ == '__main__':
param = [
(52,),
(75,),
(25,),
(80,),
(18,),
(17,),
(33,),
(8,),
(99,),
(8,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pr... |
int main() {
int n_success = 0;
vector<int> param0 {52,75,25,80,18,17,33,8,99,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
r... |
COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION{
static int f_gold ( int a , int b ) {
String s = String . valueOf ( b ) ;
int i ;
for ( i = 0 ;
i < s . length ( ) ;
i ++ ) {
if ( s . charAt ( i ) != '... | def f_gold ( a , b ) :
s = str ( b )
i = 0
while i < ( len ( s ) ) :
if ( s [ i ] != '9' ) :
break
i += 1
result = 0
if ( i == len ( s ) ) :
result = a * len ( s )
else :
result = a * ( len ( s ) - 1 )
return result
|
using namespace std;
int f_gold ( int a, int b ) {
string s = to_string ( b );
int i;
for ( i = 0;
i < s . length ( );
i ++ ) {
if ( s [ i ] != '9' ) break;
}
int result;
if ( i == s . length ( ) ) result = a * s . length ( );
else result = a * ( s . length ( ) - 1 );
return result;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(31);
param0.add(72);
param0.add(23);
param0.add(42);
param0.add(13);
param0.add(93);
param0.add(33);
param0.add(94);
param0.add(60);
param0.add(11);
List<... |
if __name__ == '__main__':
param = [
(31,91,),
(72,85,),
(23,49,),
(42,32,),
(13,7,),
(93,5,),
(33,32,),
(94,76,),
(60,60,),
(11,26,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
... |
int main() {
int n_success = 0;
vector<int> param0 {31,72,23,42,13,93,33,94,60,11};
vector<int> param1 {91,85,49,32,7,5,32,76,60,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING_1{
public static int f_gold ( String s ) {
int p = - 1 , i , k ;
int MAX_CHAR = 256 ;
int hash [ ] = new int [ MAX_CHAR ] ;
int pos [ ] = new int [ MAX_CHAR ] ;... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("iwLT");
param0.add("225168787");
param0.add("00100111");
param0.add("ktdzbGbqsvQ");
param0.add("5574573212164");
param0.add("01000110101101");
param0.add("ftiv");
par... | null | null |
WILDCARD_CHARACTER_MATCHING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WILDCARD_CHARACTER_MATCHING{
static boolean f_gold ( String first , String second ) {
if ( first . length ( ) == 0 && second . length ( ) == 0 ) return true ;
if ( first . length ( ) > 1 && first . charAt ( 0 ... | def f_gold ( first , second ) :
if len ( first ) == 0 and len ( second ) == 0 :
return True
if len ( first ) > 1 and first [ 0 ] == '*' and len ( second ) == 0 :
return False
if ( len ( first ) > 1 and first [ 0 ] == '?' ) or ( len ( first ) != 0 and len ( second ) != 0 and first [ 0 ] == se... | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("g*ks");
param0.add("ge?ks*");
param0.add("g*k");
param0.add("*pqrs");
param0.add("abc*bcd");
param0.add("abc*c?d");
param0.add("*c*d");
param0.add("*?c*d");
param... |
if __name__ == '__main__':
param = [
('g*ks','geeks',),
('ge?ks*','geeksforgeeks',),
('g*k','gee',),
('*pqrs','pqrst',),
('abc*bcd','abcdhghgbcd',),
('abc*c?d','abcd',),
('*c*d','abcd',),
('*?c*d','abcd',),
('?*1','010111111001',),
('a*','CBzHMjUGCUJD',)
]
n_succ... | null |
SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE{
public static int f_gold ( int a [ ] , int n , int k ) {
HashMap < Integer , Integer > m = new HashMap < Integer , Integer > ( ) ;
for ( int i... | null |
using namespace std;
int f_gold ( int a [ ], int n, int k ) {
unordered_map < int, int > m;
for ( int i = 0;
i < n;
i ++ ) m [ a [ i ] ] ++;
int res = INT_MAX;
for ( auto it = m . begin ( );
it != m . end ( );
++ it ) if ( it -> second == k ) res = min ( res, it -> first );
return ( res != INT_MAX ) ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,5,5,8,11,13,14,15,15,16,18,23,24,26,28,31,33,39,39,39,40,41,44,51,53,55,55,59,59,61,64,65,74,74,76,76,76,77,87,88,88,94,95,96});
param0.add(new int[]{-98,-64,-44,20,-46,96,-48,-5... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,5,8,11,13,14,15,15,16,18,23,24,26,28,31,33,39,39,39,40,41,44,51,53,55,55,59,59,61,64,65,74,74,76,76,76,77,87,88,88,94,95,96},{-98,-64,-44,20,-46,96,-48,-54,-26,30,-42,94,58,-58,-54,50,6,-34,-44,-50,-66,-14,-96,74,4,-86,56,-46,-94,-24,-80,58,34,24... |
COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1{
static int f_gold ( int n ) {
int der [ ] = new int [ n + 1 ] ;
der [ 0 ] = 1 ;
der [ 1 ] = 0 ;
der [ 2 ] = 1 ;
for... | def f_gold ( n ) :
der = [ 0 for i in range ( n + 1 ) ]
der [ 0 ] = 1
der [ 1 ] = 0
der [ 2 ] = 1
for i in range ( 3 , n + 1 ) :
der [ i ] = ( i - 1 ) * ( der [ i - 1 ] + der [ i - 2 ] )
return der [ n ]
|
using namespace std;
int f_gold ( int n ) {
int der [ n + 1 ];
der [ 0 ] = 1;
der [ 1 ] = 0;
der [ 2 ] = 1;
for ( int i = 3;
i <= n;
++ i ) der [ i ] = ( i - 1 ) * ( der [ i - 1 ] + der [ i - 2 ] );
return der [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(22);
param0.add(91);
param0.add(33);
param0.add(93);
param0.add(90);
param0.add(59);
param0.add(88);
param0.add(41);
param0.add(70);
param0.add(63);
for(i... |
if __name__ == '__main__':
param = [
(22,),
(91,),
(33,),
(93,),
(90,),
(59,),
(88,),
(41,),
(70,),
(63,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {22,91,33,93,90,59,88,41,70,63};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int invcount = 0 ;
for ( int i = 0 ;
i < n - 2 ;
i ++ ) {
for ( int j = i + 1 ;
j < n - 1 ;
j ++ ) {
... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int invcount = 0;
for ( int i = 0;
i < n - 2;
i ++ ) {
for ( int j = i + 1;
j < n - 1;
j ++ ) {
if ( arr [ i ] > arr [ j ] ) {
for ( int k = j + 1;
k < n;
k ++ ) {
if ( arr [ j ] > arr [ k ] ) invcount ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{11,17,27,29,31,31,32,44,45,93});
param0.add(new int[]{-48,-10,-44,-94,50,-24,30,72,-6,56,94,-44,-96,-52,-2,68,-52,30,98,0,12,-98,-94,48,-96,-86});
param0.add(new int[]{0,0,0,1,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{11,17,27,29,31,31,32,44,45,93},{-48,-10,-44,-94,50,-24,30,72,-6,56,94,-44,-96,-52,-2,68,-52,30,98,0,12,-98,-94,48,-96,-86},{0,0,0,1,1,1,1,1,1},{78,82,51,92,88,95},{-98,-96,-84,-72,-70,-62,-62,-58,-56,-54,-52,-52,-52,-50,-40,-40,-38,-36,-34,-26,-26,-2... |
BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10{
static int f_gold ( String N ) {
int len = N . length ( ) ;
int l = ( len ) / 2 ;
int count = 0 ;
for ( int i = 1 ;
i <= l ;
i ++ ) {
S... | def f_gold ( N ) :
length = len ( N )
l = int ( ( length ) / 2 )
count = 0
for i in range ( l + 1 ) :
s = N [ 0 : 0 + i ]
l1 = len ( s )
t = N [ i : l1 + i ]
try :
if s [ 0 ] == '0' or t [ 0 ] == '0' :
continue
except :
cont... |
using namespace std;
int f_gold ( string N ) {
int len = N . length ( );
int l = ( len ) / 2;
int count = 0;
for ( int i = 1;
i <= l;
i ++ ) {
string s = N . substr ( 0, i );
int l1 = s . length ( );
string t = N . substr ( i, l1 );
if ( s [ 0 ] == '0' || t [ 0 ] == '0' ) continue;
if (... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ZCoQhuM");
param0.add("2674377254");
param0.add("11");
param0.add("LbuGlvRyWAPBpo");
param0.add("26382426486138");
param0.add("111010111010");
param0.add("hUInqJXNdbfP");... |
if __name__ == '__main__':
param = [
('ZCoQhuM',),
('2674377254',),
('11',),
('LbuGlvRyWAPBpo',),
('26382426486138',),
('111010111010',),
('hUInqJXNdbfP',),
('5191',),
('1110101101',),
('2202200',)
]
n_success = 0
for i, parameters_set in enumerate(param):
... |
int main() {
int n_success = 0;
vector<string> param0 {"ZCoQhuM","2674377254","11","LbuGlvRyWAPBpo","26382426486138","111010111010","hUInqJXNdbfP","5191","1110101101","2202200"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_succes... |
DOUBLE_FACTORIAL_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DOUBLE_FACTORIAL_1{
static int f_gold ( int n ) {
int res = 1 ;
for ( int i = n ;
i >= 0 ;
i = i - 2 ) {
if ( i == 0 || i == 1 ) return res ;
else res *= i ;
}
return res ;
}
| def f_gold ( n ) :
res = 1 ;
for i in range ( n , - 1 , - 2 ) :
if ( i == 0 or i == 1 ) :
return res ;
else :
res *= i ;
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1;
for ( int i = n;
i >= 0;
i = i - 2 ) {
if ( i == 0 || i == 1 ) return res;
else res *= i;
}
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(88);
param0.add(24);
param0.add(3);
param0.add(22);
param0.add(53);
param0.add(2);
param0.add(88);
param0.add(30);
param0.add(38);
param0.add(2);
for(int ... |
if __name__ == '__main__':
param = [
(88,),
(24,),
(3,),
(22,),
(53,),
(2,),
(88,),
(30,),
(38,),
(2,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {88,24,3,22,53,2,88,30,38,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
re... |
COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME{
static int f_gold ( int n ) {
int table [ ] = new int [ n + 1 ] , i ;
Arrays . fill ( table , 0 ) ;
table [ 0 ] = 1 ;
for ( i = 3 ;
i <= n ;
i ++ ) table [ i ]... | def f_gold ( n ) :
table = [ 0 for i in range ( n + 1 ) ]
table [ 0 ] = 1
for i in range ( 3 , n + 1 ) :
table [ i ] += table [ i - 3 ]
for i in range ( 5 , n + 1 ) :
table [ i ] += table [ i - 5 ]
for i in range ( 10 , n + 1 ) :
table [ i ] += table [ i - 10 ]
return tab... |
using namespace std;
int f_gold ( int n ) {
int table [ n + 1 ], i;
for ( int j = 0;
j < n + 1;
j ++ ) table [ j ] = 0;
table [ 0 ] = 1;
for ( i = 3;
i <= n;
i ++ ) table [ i ] += table [ i - 3 ];
for ( i = 5;
i <= n;
i ++ ) table [ i ] += table [ i - 5 ];
for ( i = 10;
i <= n;
i ++ ) table... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(83);
param0.add(29);
param0.add(17);
param0.add(12);
param0.add(93);
param0.add(55);
param0.add(97);
param0.add(75);
param0.add(22);
param0.add(52);
for(i... |
if __name__ == '__main__':
param = [
(83,),
(29,),
(17,),
(12,),
(93,),
(55,),
(97,),
(75,),
(22,),
(52,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {83,29,17,12,93,55,97,75,22,52};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ{
public static int f_gold ( int n , int k ) {
if ( n + 1 >= k ) return ( k - 1 ) ;
else return ( 2 * n + 1 - k ) ;
}
| def f_gold(n, k):
if (n + 1 >= k):
return (k - 1)
else:
return (2 * n + 1 - k)
|
using namespace std;
int f_gold ( int n, int k ) {
if ( n + 1 >= k ) return ( k - 1 );
else return ( 2 * n + 1 - k );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(90);
param0.add(86);
param0.add(92);
param0.add(72);
param0.add(25);
param0.add(11);
param0.add(94);
param0.add(91);
param0.add(66);
param0.add(34);
List<... |
if __name__ == '__main__':
param = [
(90, 74,),
(86, 36,),
(92, 38,),
(72, 71,),
(25, 57,),
(11, 53,),
(94, 80,),
(91, 75,),
(66, 58,),
(34, 88,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fille... |
int main() {
int n_success = 0;
vector<int> param0 {90,86,92,72,25,11,94,91,66,34};
vector<int> param1 {74,36,38,71,57,53,80,75,58,88};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
... |
FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X{
static long f_gold ( long y , long x ) {
if ( ( Math . log ( y ) / Math . log ( 2 ) ) < x ) return y ;
if ( x > 63 ) return y ;
return ( y % ( 1 << ( int ) x ) ) ;
}
... | def f_gold ( y , x ) :
return ( y % pow ( 2 , x ) )
|
using namespace std;
long long int f_gold ( long long int y, long long int x ) {
if ( log2 ( y ) < x ) return y;
if ( x > 63 ) return y;
return ( y % ( 1 << x ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(57L);
param0.add(80L);
param0.add(84L);
param0.add(35L);
param0.add(3L);
param0.add(42L);
param0.add(7L);
param0.add(99L);
param0.add(13L);
param0.add(44L);
... |
if __name__ == '__main__':
param = [
(57,76,),
(80,46,),
(84,96,),
(35,16,),
(3,84,),
(42,79,),
(7,2,),
(99,83,),
(13,61,),
(44,8,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
... |
int main() {
int n_success = 0;
vector<long> param0 {57,80,84,35,3,42,7,99,13,44};
vector<long> param1 {76,46,96,16,84,79,2,83,61,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS{
static int f_gold ( int n ) {
int table [ ] = new int [ n + 1 ] ;
Arrays . fill ( table , 0 ) ;
table [ 0 ] = 1 ;
for ( int i = 1 ;
i < n ;
i ++... | null |
using namespace std;
int f_gold ( int n ) {
int table [ n + 1 ];
memset ( table, 0, sizeof ( table ) );
table [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) table [ j ] += table [ j - i ];
return table [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(66);
param0.add(90);
param0.add(8);
param0.add(77);
param0.add(44);
param0.add(20);
param0.add(34);
param0.add(22);
param0.add(50);
param0.add(10);
for(in... | null |
int main() {
int n_success = 0;
vector<int> param0 {66,90,8,77,44,20,34,22,50,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME{
static int f_gold ( int arr [ ] , int n ) {
int count = 0 ;
int cummulative_sum = 0 ;
Arrays . sort ( arr ) ;
for ( int i = 0 ;
i < n ;
i ++ )... | def f_gold ( arr , n ) :
count = 0
cummulative_sum = 0
arr.sort ( )
for i in range ( n ) :
if arr [ i ] >= cummulative_sum :
count += 1
cummulative_sum += arr [ i ]
return count
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int count = 0;
int cummulative_sum = 0;
sort ( arr, arr + n );
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] >= cummulative_sum ) {
count ++;
cummulative_sum += arr [ i ];
}
}
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,33,34,42,42,45,73});
param0.add(new int[]{32,-10,-64,-20,92,-66,6,44,-62,-98,4,-48,44,42,12,-90,52,86,-30,-80,64,94,14});
param0.add(new int[]{0,0,0,0,1});
param0.add(new... |
if __name__ == '__main__':
param = [
([7, 33, 34, 42, 42, 45, 73],5,),
([32, -10, -64, -20, 92, -66, 6, 44, -62, -98, 4, -48, 44, 42, 12, -90, 52, 86, -30, -80, 64, 94, 14],16,),
([0, 0, 0, 0, 1],2,),
([11, 85, 89, 71, 82, 44],3,),
([-96, -92, -78, -72, -68, -58, -52, -50, -50, -48, -42, -32, -... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,33,34,42,42,45,73},{32,-10,-64,-20,92,-66,6,44,-62,-98,4,-48,44,42,12,-90,52,86,-30,-80,64,94,14},{0,0,0,0,1},{11,85,89,71,82,44},{-96,-92,-78,-72,-68,-58,-52,-50,-50,-48,-42,-32,-20,-18,-4,0,0,2,18,18,20,24,32,34,36,38,38,60,66,68,70,72,72,74,76,9... |
MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME{
static boolean f_gold ( String s ) {
int l = s . length ( ) ;
for ( int i = 0 , j = l - 1 ;
i <= j ;
i ++ , j -- ) {
if ( s . charAt ( i ) != s . ... | def f_gold ( s ) :
l = len ( s )
i = 0
j = l - 1
while i <= j :
if ( s [ i ] != s [ j ] ) :
return False
i += 1
j -= 1
return True
|
using namespace std;
bool f_gold ( string s ) {
int l = s . length ( );
int j;
for ( int i = 0, j = l - 1;
i <= j;
i ++, j -- ) {
if ( s [ i ] != s [ j ] ) return false;
}
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("aadaa");
param0.add("2674377254");
param0.add("11");
param0.add("0011000 ");
param0.add("26382426486138");
param0.add("111010111010");
param0.add("abccba");
param0.ad... |
if __name__ == '__main__':
param = [
('aadaa',),
('2674377254',),
('11',),
('0011000 ',),
('26382426486138',),
('111010111010',),
('abccba',),
('5191',),
('1110101101',),
('abcdecbe',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fi... |
int main() {
int n_success = 0;
vector<string> param0 {"aadaa","2674377254","11","0011000","26382426486138","111010111010","abccba","5191","1110101101","abcdecbe"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES{
static boolean f_gold ( String str1 , String str2 ) {
if ( str1 . length ( ) != str2 . length ( ) ) return false ;
String clock_rot = "" ;
String a... | def f_gold ( str1 , str2 ) :
if ( len ( str1 ) != len ( str2 ) ) :
return False
clock_rot = ""
anticlock_rot = ""
l = len ( str2 )
anticlock_rot = ( anticlock_rot + str2 [ l - 2 : ] + str2 [ 0 : l - 2 ] )
clock_rot = clock_rot + str2 [ 2 : ] + str2 [ 0 : 2 ]
return ( str1 == clock_ro... |
using namespace std;
bool f_gold ( string str1, string str2 ) {
if ( str1 . length ( ) != str2 . length ( ) ) return false;
string clock_rot = "";
string anticlock_rot = "";
int len = str2 . length ( );
anticlock_rot = anticlock_rot + str2 . substr ( len - 2, 2 ) + str2 . substr ( 0, len - 2 );
clock_rot =... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("amazon");
param0.add("onamaz");
param0.add("amazon");
param0.add("ab");
param0.add("737009");
param0.add("000110");
param0.add("l");
param0.add("4420318628");
par... |
if __name__ == '__main__':
param = [
("amazon","azonam",),
("onamaz","amazon",),
("amazon","azoman",),
("ab","ab",),
('737009','239119',),
('000110','01111',),
('l','YVo hqvnGxow',),
('4420318628','52856',),
('11011111000000','10',),
(' pvFHANc','xBIDFbiGb',)
]
n... |
int main() {
int n_success = 0;
vector<string> param0 {"amazon","onamaz","amazon","ab","737009","000110","l","4420318628","11011111000000"," pvFHANc"};
vector<string> param1 {"azonam","amazon","azoman","ab","239119","01111","YVo hqvnGxow","52856","10","xBIDFbiGb"};
for(int i = 0; i < param0.size(); ++i... |
REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int ans = - 1 ;
String num = "" ;
for ( int i = 1 ;
i < ( 1 << n ) ;
i ++ ) {
St... | null |
using namespace std;
int f_gold ( string s ) {
int n = s . size ( );
int ans = - 1;
string num;
for ( int i = 1;
i < ( 1 << n );
i ++ ) {
string str = "";
for ( int j = 0;
j < n;
j ++ ) {
if ( ( i >> j ) & 1 ) {
str += s [ j ];
}
}
if ( str [ 0 ] != '0' ) {
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("h");
param0.add("1391212");
param0.add("010");
param0.add("ksRFLRVL");
param0.add("5809836998");
param0.add("1111000");
param0.add("hJoDzrrBaF");
param0.add("6076");
... | null |
int main() {
int n_success = 0;
vector<string> param0 {"h","1391212","010","ksRFLRVL","5809836998","1111000","hJoDzrrBaF","6076","001010010","lU DBBVF"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
... |
MINIMUM_ROTATIONS_REQUIRED_GET_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_ROTATIONS_REQUIRED_GET_STRING{
static int f_gold ( String str ) {
String tmp = str + str ;
int n = str . length ( ) ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
String substring = tmp . substring ( ... | def f_gold ( str ) :
tmp = str + str
n = len ( str )
for i in range ( 1 , n + 1 ) :
substring = tmp [ i : n ]
if ( str == substring ) :
return i
return n
|
using namespace std;
int f_gold ( string str ) {
string tmp = str + str;
int n = str . length ( );
for ( int i = 1;
i <= n;
i ++ ) {
string substring = tmp . substr ( i, str . size ( ) );
if ( str == substring ) return i;
}
return n;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("vdevdNdQSopPtj");
param0.add("5");
param0.add("100010101011");
param0.add("tlDOvJHAyMllu");
param0.add("06");
param0.add("101");
param0.add("DYgtU");
param0.add("4");... |
if __name__ == '__main__':
param = [
('vdevdNdQSopPtj',),
('5',),
('100010101011',),
('tlDOvJHAyMllu',),
('06',),
('101',),
('DYgtU',),
('4',),
('00',),
('Dt',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) ==... |
int main() {
int n_success = 0;
vector<string> param0 {"vdevdNdQSopPtj","5","100010101011","tlDOvJHAyMllu","06","101","DYgtU","4","00","Dt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#R... |
MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
int cum_sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) cum_sum += arr [ i ] ;
int curr_val = 0 ;
for ( int i = 0... | def f_gold ( arr , n ) :
cum_sum = 0
for i in range ( 0 , n ) :
cum_sum += arr [ i ]
curr_val = 0
for i in range ( 0 , n ) :
curr_val += i * arr [ i ]
res = curr_val
for i in range ( 1 , n ) :
next_val = ( curr_val - ( cum_sum - arr [ i - 1 ] ) + arr [ i - 1 ] * ( n - 1 )... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int cum_sum = 0;
for ( int i = 0;
i < n;
i ++ ) cum_sum += arr [ i ];
int curr_val = 0;
for ( int i = 0;
i < n;
i ++ ) curr_val += i * arr [ i ];
int res = curr_val;
for ( int i = 1;
i < n;
i ++ ) {
int next_val = curr_val - ( cum_sum... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,6,13,14,16,20,24,24,24,27,28,36,49,51,55,56,62,69,74,74,76,85,86,90,92,98});
param0.add(new int[]{-42,96,68,64,14,-74,76,42,34,-92,-20,28,-80,-34,-22,96,-46,96,10,-82,82,50,-24,4... |
if __name__ == '__main__':
param = [
([6, 6, 13, 14, 16, 20, 24, 24, 24, 27, 28, 36, 49, 51, 55, 56, 62, 69, 74, 74, 76, 85, 86, 90, 92, 98],13,),
([-42, 96, 68, 64, 14, -74, 76, 42, 34, -92, -20, 28, -80, -34, -22, 96, -46, 96, 10, -82, 82, 50, -24, 48, 56, 72, -40, -86, 84, 66, -62, 50, -76, 34],27,),
... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,6,13,14,16,20,24,24,24,27,28,36,49,51,55,56,62,69,74,74,76,85,86,90,92,98},{-42,96,68,64,14,-74,76,42,34,-92,-20,28,-80,-34,-22,96,-46,96,10,-82,82,50,-24,48,56,72,-40,-86,84,66,-62,50,-76,34},{0,0,0,0,0,1,1,1,1,1,1},{37,88,70,86,24,62,34,44,37,42,... |
SQUARE_ROOT_OF_A_PERFECT_SQUARE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SQUARE_ROOT_OF_A_PERFECT_SQUARE_1{
static long f_gold ( int n ) {
int x = n ;
int y = 1 ;
while ( x > y ) {
x = ( x + y ) / 2 ;
y = n / x ;
}
return ( long ) x ;
}
| null | null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(58);
param0.add(55);
param0.add(51);
param0.add(42);
param0.add(2);
param0.add(30);
param0.add(77);
param0.add(82);
param0.add(31);
param0.add(9);
for(int... | null | null |
MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS{
static int f_gold ( int arr [ ] , int N , int K ) {
Arrays . sort ( arr ) ;
int res = 2147483647 ;
for ( int i = 0 ;
i <= ( N - K ) ;
i ++ ) {
int curSeqDif... | def f_gold ( arr , N , K ) :
arr.sort ( )
res = 2147483647
for i in range ( ( N - K ) + 1 ) :
curSeqDiff = arr [ i + K - 1 ] - arr [ i ]
res = min ( res , curSeqDiff )
return res
|
using namespace std;
int f_gold ( int arr [ ], int N, int K ) {
sort ( arr, arr + N );
int res = INT_MAX;
for ( int i = 0;
i <= ( N - K );
i ++ ) {
int curSeqDiff = arr [ i + K - 1 ] - arr [ i ];
res = min ( res, curSeqDiff );
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,1,4,18,21,35,37,39,76,81,86,92,96});
param0.add(new int[]{-8,-6,62,52,-86,2,-94,0,-48,-38,24,-48,34});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,... |
if __name__ == '__main__':
param = [
([1, 1, 4, 18, 21, 35, 37, 39, 76, 81, 86, 92, 96],7,6,),
([-8, -6, 62, 52, -86, 2, -94, 0, -48, -38, 24, -48, 34],9,12,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],16,26,),
([23, 36, 43, 50, 74, 81, 94, 13, 30, 57, 30... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,4,18,21,35,37,39,76,81,86,92,96},{-8,-6,62,52,-86,2,-94,0,-48,-38,24,-48,34},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{23,36,43,50,74,81,94,13,30,57,30,71,10,99,66,94,83,39,37,3,89,34},{-96,-94,-92,-84,-80,-72,-24,-22,-18,-14,6,8... |
SORT_ARRAY_APPLYING_GIVEN_EQUATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class SORT_ARRAY_APPLYING_GIVEN_EQUATION{
static void f_gold ( int arr [ ] , int n , int A , int B , int C ) {
for ( int i = 0 ;
i < n ;
i ++ ) arr [ i ] = A * arr [ i ] * arr [ i ] + B * arr [ i ] + C ;
int index = - ... | import sys
def f_gold(arr, n, A, B, C):
for i in range(n):
arr[i] = (A * arr[i] * arr[i] + B * arr[i] + C)
index = - (sys.maxsize - 1)
maximum = - (sys.maxsize - 1)
for i in range(n):
if maximum < arr[i]:
index = i
maximum = arr[i]
i = 0
j = n - 1
ne... |
using namespace std;
void f_gold ( int arr [ ], int n, int A, int B, int C ) {
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = A * arr [ i ] * arr [ i ] + B * arr [ i ] + C;
int index, maximum = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( maximum < arr [ i ] ) {
index = i;
maximum = arr [ i... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{9,30,49,65,78,85,85,92});
param0.add(new int[]{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16});
param0.add(new int[]... |
if __name__ == '__main__':
param = [
([9, 30, 49, 65, 78, 85, 85, 92], 4, 4, 5, 4,),
([-48, 89, -60, 66, 71, -37, 47, -50, 61, 41, -22, -3, 90, -57, 77, -64, 22,
8, -90, -5, -94, -43, 29, -29, 86, -79, -8, 27, -20, -44, 16], 18, 20, 20, 23,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,30,49,65,78,85,85,92},{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,6... |
ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS{
static int f_gold ( int arr [ ] , int n , int x ) {
int i ;
for ( i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] == x ) {
return i ;
}
}
return ... | def f_gold ( arr , n , x ) :
i = 0
for i in range ( i , n ) :
if ( arr [ i ] == x ) :
return i
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,5,5,11,13,14,15,19,22,22,23,26,29,29,36,44,48,49,65,65,67,68,70,76,79,79,81,85,88,91,91,92,92,97});
param0.add(new int[]{-24,-78,-32,-48,0,4,-42});
param0.add(new int[]{0,0,0... |
if __name__ == '__main__':
param = [
([4, 5, 5, 11, 13, 14, 15, 19, 22, 22, 23, 26, 29, 29, 36, 44, 48, 49, 65, 65, 67, 68, 70, 76, 79, 79, 81, 85, 88, 91, 91, 92, 92, 97],17,5,),
([-24, -78, -32, -48, 0, 4, -42],4,0,),
([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1],6,0,),
([38, 14, 75, 16, 91, 11, 98, 43, 67,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,5,5,11,13,14,15,19,22,22,23,26,29,29,36,44,48,49,65,65,67,68,70,76,79,79,81,85,88,91,91,92,92,97},{-24,-78,-32,-48,0,4,-42},{0,0,0,0,0,0,0,1,1,1,1},{38,14,75,16,91,11,98,43,67,9,21,10,82,72,32,81,48,60,2,91,10,90,12,83},{-92,-92,-82,-80,-76,-66,-64... |
ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES{
static int f_gold ( int a [ ] , int n , int k ) {
if ( k >= n - 1 ) return n ;
int best = 0 , times = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( a [ i ] > b... | def f_gold ( a , n , k ) :
if k >= n - 1 :
return n
best = 0
times = 0
for i in range ( n ) :
if a [ i ] > best :
best = a [ i ]
if i == True :
times = 1
else :
times += 1
if times >= k :
return best
retu... |
using namespace std;
int f_gold ( int a [ ], int n, int k ) {
if ( k >= n - 1 ) return n;
int best = 0, times = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] > best ) {
best = a [ i ];
if ( i ) times = 1;
}
else times += 1;
if ( times >= k ) return best;
}
return best;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,5,5,9,10,10,11,14,23,27,31,32,33,33,33,37,39,41,41,42,42,43,47,60,61,68,73,73,73,78,80,80,82,83,86,87,89,92,94,98});
param0.add(new int[]{80,-58,64,48,-16,60,-50,-52,62,-86,-96,5... |
if __name__ == '__main__':
param = [
([2, 5, 5, 9, 10, 10, 11, 14, 23, 27, 31, 32, 33, 33, 33, 37, 39, 41, 41, 42, 42, 43, 47, 60, 61, 68, 73, 73, 73, 78, 80, 80, 82, 83, 86, 87, 89, 92, 94, 98],33,37,),
([80, -58, 64, 48, -16, 60, -50, -52, 62, -86, -96, 52, 26, -30, 14],14,13,),
([0, 0, 0, 0, 0, 0, 0... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,5,9,10,10,11,14,23,27,31,32,33,33,33,37,39,41,41,42,42,43,47,60,61,68,73,73,73,78,80,80,82,83,86,87,89,92,94,98},{80,-58,64,48,-16,60,-50,-52,62,-86,-96,52,26,-30,14},{0,0,0,0,0,0,0,0,0,1,1},{90,23,43,42,7,71,79},{-96,-96,-90,-84,-68,-64,-56,-56,... |
NUMBER_DIGITS_PRODUCT_TWO_NUMBERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_DIGITS_PRODUCT_TWO_NUMBERS{
static int f_gold ( int a , int b ) {
int count = 0 ;
int p = Math . abs ( a * b ) ;
if ( p == 0 ) return 1 ;
while ( p > 0 ) {
count ++ ;
p = p / 10 ;
}
retu... | def f_gold(a, b):
count = 0
p = abs(a * b)
if (p == 0):
return 1
while (p > 0):
count = count + 1
p = p // 10
return count
|
using namespace std;
int f_gold ( int a, int b ) {
int count = 0;
int p = abs ( a * b );
if ( p == 0 ) return 1;
while ( p > 0 ) {
count ++;
p = p / 10;
}
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(86);
param0.add(81);
param0.add(48);
param0.add(64);
param0.add(56);
param0.add(5);
param0.add(25);
param0.add(94);
param0.add(5);
param0.add(46);
List<In... |
if __name__ == '__main__':
param = [
(86, 39,),
(81, 87,),
(48, 84,),
(64, 80,),
(56, 20,),
(5, 70,),
(25, 13,),
(94, 83,),
(5, 55,),
(46, 46,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(... |
int main() {
int n_success = 0;
vector<int> param0 {86,81,48,64,56,5,25,94,5,46};
vector<int> param1 {39,87,84,80,20,70,13,83,55,46};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
FLOOR_IN_A_SORTED_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FLOOR_IN_A_SORTED_ARRAY_1{
static int f_gold ( int arr [ ] , int low , int high , int x ) {
if ( low > high ) return - 1 ;
if ( x >= arr [ high ] ) return high ;
int mid = ( low + high ) / 2 ;
if ( arr [ m... | def f_gold ( arr , low , high , x ) :
if ( low > high ) :
return - 1
if ( x >= arr [ high ] ) :
return high
mid = int ( ( low + high ) / 2 )
if ( arr [ mid ] == x ) :
return mid
if ( mid > 0 and arr [ mid - 1 ] <= x and x < arr [ mid ] ) :
return mid - 1
if ( x < ... |
using namespace std;
int f_gold ( int arr [ ], int low, int high, int x ) {
if ( low > high ) return - 1;
if ( x >= arr [ high ] ) return high;
int mid = ( low + high ) / 2;
if ( arr [ mid ] == x ) return mid;
if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1;
if ( x < arr [ mid ] ) ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,11,20,42,42,55,58,98,99});
param0.add(new int[]{50,-90,-38,-46,-10,-22,-66,72,-52,38,90,34,-12,-44,-6,0,-20,-38,86,26,64,-24,40,90,-26,-2,-28,12,22,-14});
param0.add(new int[... |
if __name__ == '__main__':
param = [
([5, 11, 20, 42, 42, 55, 58, 98, 99],5,7,6,),
([50, -90, -38, -46, -10, -22, -66, 72, -52, 38, 90, 34, -12, -44, -6, 0, -20, -38, 86, 26, 64, -24, 40, 90, -26, -2, -28, 12, 22, -14],26,28,23,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1],11,9,18,),
... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,11,20,42,42,55,58,98,99},{50,-90,-38,-46,-10,-22,-66,72,-52,38,90,34,-12,-44,-6,0,-20,-38,86,26,64,-24,40,90,-26,-2,-28,12,22,-14},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,28,68,98,24,67,86,2,18,22,44,77,52,62,24,46},{-96,-94,-88,-84,-68,-60,-52... |
HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1{
static int f_gold ( int n ) {
int sum ;
for ( sum = 0 ;
n > 0 ;
sum += n % 10 , n /= 10 ) ;
return sum ;
}
| def f_gold ( n ) :
sum = 0
while ( n > 0 ) :
sum += int ( n % 10 )
n = int ( n / 10 )
return sum
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(50);
param0.add(92);
param0.add(49);
param0.add(94);
param0.add(7);
param0.add(30);
param0.add(88);
param0.add(98);
param0.add(94);
param0.add(23);
for(in... |
if __name__ == '__main__':
param = [
(50,),
(92,),
(49,),
(94,),
(7,),
(30,),
(88,),
(98,),
(94,),
(23,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... | null |
BREAK_NUMBER_THREE_PARTS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BREAK_NUMBER_THREE_PARTS_1{
static long f_gold ( long n ) {
long count = 0 ;
count = ( n + 1 ) * ( n + 2 ) / 2 ;
return count ;
}
| def f_gold ( n ) :
count = 0
count = ( n + 1 ) * ( n + 2 ) // 2
return count
| null |
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(71L);
param0.add(71L);
param0.add(36L);
param0.add(3L);
param0.add(97L);
param0.add(69L);
param0.add(15L);
param0.add(48L);
param0.add(77L);
param0.add(6L);
... |
if __name__ == '__main__':
param = [
(71,),
(71,),
(36,),
(3,),
(97,),
(69,),
(15,),
(48,),
(77,),
(6,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pr... | null |
WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3{
static int f_gold ( int n ) {
int odd_count = 0 ;
int even_count = 0 ;
if ( n < 0 ) n = - n ;
if ( n == 0 ) return 1 ;
if ( n == 1 ) retur... | def f_gold ( n ) :
odd_count = 0
even_count = 0
if ( n < 0 ) :
n = - n
if ( n == 0 ) :
return 1
if ( n == 1 ) :
return 0
while ( n ) :
if ( n & 1 ) :
odd_count += 1
if ( n & 2 ) :
even_count += 1
n = n >> 2
return f_gold... |
using namespace std;
int f_gold ( int n ) {
int odd_count = 0;
int even_count = 0;
if ( n < 0 ) n = - n;
if ( n == 0 ) return 1;
if ( n == 1 ) return 0;
while ( n ) {
if ( n & 1 ) odd_count ++;
if ( n & 2 ) even_count ++;
n = n >> 2;
}
return f_gold ( abs ( odd_count - even_count ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(94);
param0.add(94);
param0.add(79);
param0.add(39);
param0.add(16);
param0.add(90);
param0.add(64);
param0.add(76);
param0.add(83);
param0.add(47);
for(i... |
if __name__ == '__main__':
param = [
(94,),
(94,),
(79,),
(39,),
(16,),
(90,),
(64,),
(76,),
(83,),
(47,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {94,94,79,39,16,90,64,76,83,47};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
BINARY_REPRESENTATION_OF_NEXT_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BINARY_REPRESENTATION_OF_NEXT_NUMBER{
static String f_gold ( String num ) {
int l = num . length ( ) ;
int i ;
for ( i = l - 1 ;
i >= 0 ;
i -- ) {
if ( num . charAt ( i ) == '0' ) {
num = num .... | def f_gold ( num1 ) :
l = len ( num1 ) ;
num = list ( num1 ) ;
i = l - 1 ;
while ( i >= 0 ) :
if ( num [ i ] == '0' ) :
num [ i ] = '1' ;
break ;
else :
num [ i ] = '0' ;
i -= 1 ;
num1 = ''.join ( num ) ;
if ( i < 0 ) :
num1 = '... | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("DXh");
param0.add("48703586411816");
param0.add("0001");
param0.add("yWg WvjNKS");
param0.add("8408568459");
param0.add("01");
param0.add("DFECZ CWtN");
param0.add("3... |
if __name__ == '__main__':
param = [
('DXh',),
('48703586411816',),
('0001',),
('yWg WvjNKS',),
('8408568459',),
('01',),
('DFECZ CWtN',),
('37742236',),
('001101',),
('LDxERLmYn',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fille... | null |
CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD{
public static boolean f_gold ( int n ) {
return ( n % 2 == 0 ) ;
}
| def f_gold ( n ) :
return ( n % 2 == 0 )
|
using namespace std;
bool f_gold ( int n ) {
return ( n % 2 == 0 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(90);
param0.add(55);
param0.add(90);
param0.add(83);
param0.add(32);
param0.add(58);
param0.add(38);
param0.add(87);
param0.add(87);
for(i... |
if __name__ == '__main__':
param = [
(67,),
(90,),
(55,),
(90,),
(83,),
(32,),
(58,),
(38,),
(87,),
(87,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {67,90,55,90,83,32,58,38,87,87};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER{
static int f_gold ( int n ) {
return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 ) ;
}
| def f_gold ( n ) :
return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ;
|
using namespace std;
int f_gold ( int n ) {
return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(58);
param0.add(42);
param0.add(76);
param0.add(16);
param0.add(49);
param0.add(60);
param0.add(99);
param0.add(45);
param0.add(6);
param0.add(70);
for(in... |
if __name__ == '__main__':
param = [
(58,),
(42,),
(76,),
(16,),
(49,),
(60,),
(99,),
(45,),
(6,),
(70,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {58,42,76,16,49,60,99,45,6,70};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
UGLY_NUMBERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class UGLY_NUMBERS{
static int f_gold ( int n ) {
int ugly [ ] = new int [ n ] ;
int i2 = 0 , i3 = 0 , i5 = 0 ;
int next_multiple_of_2 = 2 ;
int next_multiple_of_3 = 3 ;
int next_multiple_of_5 = 5 ;
int next... | def f_gold ( n ) :
ugly = [ 0 ] * n
ugly [ 0 ] = 1
i2 = i3 = i5 = 0
next_multiple_of_2 = 2
next_multiple_of_3 = 3
next_multiple_of_5 = 5
for l in range ( 1 , n ) :
ugly [ l ] = min ( next_multiple_of_2 , next_multiple_of_3 , next_multiple_of_5 )
if ugly [ l ] == next_multiple... |
using namespace std;
unsigned f_gold ( unsigned n ) {
unsigned ugly [ n ];
unsigned i2 = 0, i3 = 0, i5 = 0;
unsigned next_multiple_of_2 = 2;
unsigned next_multiple_of_3 = 3;
unsigned next_multiple_of_5 = 5;
unsigned next_ugly_no = 1;
ugly [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
next_ugly_no... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(27);
param0.add(64);
param0.add(93);
param0.add(90);
param0.add(85);
param0.add(86);
param0.add(72);
param0.add(86);
param0.add(32);
param0.add(1);
for(in... |
if __name__ == '__main__':
param = [
(27,),
(64,),
(93,),
(90,),
(85,),
(86,),
(72,),
(86,),
(32,),
(1,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {27,64,93,90,85,86,72,86,32,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
UNIQUE_CELLS_BINARY_MATRIX |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class UNIQUE_CELLS_BINARY_MATRIX{
static int f_gold ( int mat [ ] [ ] , int n , int m ) {
int [ ] rowsum = new int [ n ] ;
int [ ] colsum = new int [ m ] ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = 0 ;
... | def f_gold ( mat , n , m ) :
rowsum = [ 0 ] * n ;
colsum = [ 0 ] * m ;
for i in range ( n ) :
for j in range ( m ) :
if ( mat [ i ] [ j ] != 0 ) :
rowsum [ i ] += 1 ;
colsum [ j ] += 1 ;
uniquecount = 0 ;
for i in range ( n ) :
for j in ran... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{ new int[] {0, 1, 0, 0}, new int[] {0, 0, 1, 0}, new int[] {1, 0, 0, 1}});
param0.add(new int[][]{ new int[] {0, 1, 0, 0}, new int[] {0, 0, 1, 1}, new int[] {1, 0, 1, 1}});
... |
if __name__ == '__main__':
param = [
([[0, 1, 0, 0],
[0, 0, 1, 0],
[1, 0, 0, 1]] ,3,4,),
([[0, 1, 0, 0],
[0, 0, 1, 0],
[1, 0, 0, 1]] ,2,2,),
([[0, 1, 0, 0],
[0, 0, 1, 1],
[1, 0, 1, 1]] ,3,4,),
([[0, 1, 0, 0],
[0, 0, 1, 0],
[1, 1, 0, 1]... | null |
COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1{
static int f_gold ( char digits [ ] , int n ) {
int count [ ] = new int [ n + 1 ] ;
count [ 0 ] = 1 ;
count [ 1 ] = 1 ;
if ( digits [ 0 ] == '0' ) return 0 ... | def f_gold ( digits , n ) :
count = [ 0 ] * ( n + 1 ) ;
count [ 0 ] = 1 ;
count [ 1 ] = 1 ;
for i in range ( 2 , n + 1 ) :
count [ i ] = 0 ;
if ( digits [ i - 1 ] > '0' ) :
count [ i ] = count [ i - 1 ] ;
if ( digits [ i - 2 ] == '1' or ( digits [ i - 2 ] == '2' and d... | null |
public static void main(String args[]) {
int n_success = 0;
List<char [ ]> param0 = new ArrayList<>();
param0.add(new char[]{'B','C','E','E','F','F','G','J','K','K','L','L','M','O','O','P','Q','R','V','X','Z','a','a','a','c','c','c','d','e','g','g','k','k','k','l','m','m','n','p','t','y','z'});
param0.... |
if __name__ == '__main__':
param = [
(['B', 'C', 'E', 'E', 'F', 'F', 'G', 'J', 'K', 'K', 'L', 'L', 'M', 'O', 'O', 'P', 'Q', 'R', 'V', 'X', 'Z', 'a', 'a', 'a', 'c', 'c', 'c', 'd', 'e', 'g', 'g', 'k', 'k', 'k', 'l', 'm', 'm', 'n', 'p', 't', 'y', 'z'],31,),
(['0', '9', '5', '0', '2', '6', '5', '4', '4', '5', ... | null |
PERFECT_REVERSIBLE_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PERFECT_REVERSIBLE_STRING{
static boolean f_gold ( String str ) {
int i = 0 , j = str . length ( ) - 1 ;
while ( i < j ) {
if ( str . charAt ( i ) != str . charAt ( j ) ) return false ;
i ++ ;
j --... | def f_gold ( str ) :
i = 0 ; j = len ( str ) - 1 ;
while ( i < j ) :
if ( str [ i ] != str [ j ] ) :
return False ;
i += 1 ;
j -= 1 ;
return True ;
|
using namespace std;
bool f_gold ( string str ) {
int i = 0, j = str . length ( ) - 1;
while ( i < j ) {
if ( str [ i ] != str [ j ] ) return false;
i ++;
j --;
}
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ab");
param0.add("303");
param0.add("11110000");
param0.add("aba");
param0.add("404");
param0.add("10101");
param0.add("abab");
param0.add("6366");
param0.add("00... |
if __name__ == '__main__':
param = [
('ab',),
('303',),
('11110000',),
('aba',),
('404',),
('10101',),
('abab',),
('6366',),
('001',),
('',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_... |
int main() {
int n_success = 0;
vector<string> param0 {"ab","303","11110000","aba","404","10101","abab","6366","001",""};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n... |
FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2{
static boolean f_gold ( int n ) {
return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ( n & 0xAAAAAAAA ) == 0 ;
}
| def f_gold ( n ) :
return ( n != 0 and ( ( n & ( n - 1 ) ) == 0 ) and not ( n & 0xAAAAAAAA ) ) ;
|
using namespace std;
bool f_gold ( unsigned int n ) {
return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ! ( n & 0xAAAAAAAA );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(4);
param0.add(64);
param0.add(-64);
param0.add(128);
param0.add(1024);
param0.add(97);
param0.add(86);
param0.add(14);
param0.add(99);
for... |
if __name__ == '__main__':
param = [
(1,),
(4,),
(64,),
(-64,),
(128,),
(1024,),
(97,),
(86,),
(14,),
(99,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... |
int main() {
int n_success = 0;
vector<int> param0 {1,4,64,-64,128,1024,97,86,14,99};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE{
static int f_gold ( int arr [ ] , int n ) {
int brr [ ] = new int [ 2 * n + 1 ] ;
for ( int i = 0 ;
i < n ;
i ++ ) brr [ i ] = arr [ i ] ;
for ( int i = 0 ;... | def f_gold ( arr , n ) :
brr = [ 0 ] * ( 2 * n + 1 )
for i in range ( n ) :
brr [ i ] = arr [ i ]
for i in range ( n ) :
brr [ n + i ] = arr [ i ]
maxHam = 0
for i in range ( 1 , n ) :
currHam = 0
k = 0
for j in range ( i , i + n ) :
if brr [ j ] !... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int brr [ 2 * n + 1 ];
for ( int i = 0;
i < n;
i ++ ) brr [ i ] = arr [ i ];
for ( int i = 0;
i < n;
i ++ ) brr [ n + i ] = arr [ i ];
int maxHam = 0;
for ( int i = 1;
i < n;
i ++ ) {
int currHam = 0;
for ( int j = i, k = 0;
j <... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,4,18,22,28,34,35,39,44,45,67,73,75,79,81,83,89,93,96});
param0.add(new int[]{52,-28});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,... |
if __name__ == '__main__':
param = [
([1, 4, 18, 22, 28, 34, 35, 39, 44, 45, 67, 73, 75, 79, 81, 83, 89, 93, 96],12,),
([52, -28],1,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],21,),
([24],0,),
([-68, 14, 36, 62],2,),
... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,18,22,28,34,35,39,44,45,67,73,75,79,81,83,89,93,96},{52,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{24},{-68,14,36,62},{1,0,1,1,1,1,1,0,0,0,1,0,0,0,1,1,0,1,0,1,1,0,1,0,0},{7,10,19,22,24,28,29,39,46,55,62,66... |
STOOGE_SORT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class STOOGE_SORT{
static void f_gold ( int arr [ ] , int l , int h ) {
if ( l >= h ) return ;
if ( arr [ l ] > arr [ h ] ) {
int t = arr [ l ] ;
arr [ l ] = arr [ h ] ;
arr [ h ] = t ;
}
if ( h - l + 1 > 2... | def f_gold ( arr , l , h ) :
if l >= h :
return
if arr [ l ] > arr [ h ] :
t = arr [ l ]
arr [ l ] = arr [ h ]
arr [ h ] = t
if h - l + 1 > 2 :
t = ( int ) ( ( h - l + 1 ) / 3 )
f_gold ( arr , l , ( h - t ) )
f_gold ( arr , l + t , ( h ) )
f_go... |
using namespace std;
void f_gold ( int arr [ ], int l, int h ) {
if ( l >= h ) return;
if ( arr [ l ] > arr [ h ] ) swap ( arr [ l ], arr [ h ] );
if ( h - l + 1 > 2 ) {
int t = ( h - l + 1 ) / 3;
f_gold ( arr, l, h - t );
f_gold ( arr, l + t, h );
f_gold ( arr, l, h - t );
}
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,25,42,52,53,54,58,66,67,70});
param0.add(new int[]{-13,-98,50,-63,48,3,-76,12,-35,93,29,17,16,5,-97,-54,-45,-25});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... |
if __name__ == '__main__':
param = [
([6, 25, 42, 52, 53, 54, 58, 66, 67, 70],6,6,),
([-13, -98, 50, -63, 48, 3, -76, 12, -35, 93, 29, 17, 16, 5, -97, -54, -45, -25],16,14,),
([0, 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, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,25,42,52,53,54,58,66,67,70},{-13,-98,50,-63,48,3,-76,12,-35,93,29,17,16,5,-97,-54,-45,-25},{0,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},{7,49,26,33,48,79,2,71,32,4,20,36},{88},{1,1,1,1,0,0,0,1,1,0,0,0,1,... |
COUNT_DIGITS_FACTORIAL_SET_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_DIGITS_FACTORIAL_SET_1{
static int f_gold ( int n ) {
if ( n < 0 ) return 0 ;
if ( n <= 1 ) return 1 ;
double digits = 0 ;
for ( int i = 2 ;
i <= n ;
i ++ ) digits += Math . log10 ( i ) ;
retur... | import math
def f_gold ( n ) :
if ( n < 0 ) :
return 0 ;
if ( n <= 1 ) :
return 1 ;
digits = 0 ;
for i in range ( 2 , n + 1 ) :
digits += math.log10 ( i ) ;
return math.floor ( digits ) + 1 ;
|
using namespace std;
int f_gold ( int n ) {
if ( n < 0 ) return 0;
if ( n <= 1 ) return 1;
double digits = 0;
for ( int i = 2;
i <= n;
i ++ ) digits += log10 ( i );
return floor ( digits ) + 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(66);
param0.add(7);
param0.add(55);
param0.add(37);
param0.add(76);
param0.add(16);
param0.add(17);
param0.add(95);
param0.add(71);
param0.add(90);
for(in... |
if __name__ == '__main__':
param = [
(66,),
(7,),
(55,),
(37,),
(76,),
(16,),
(17,),
(95,),
(71,),
(90,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {66,7,55,37,76,16,17,95,71,90};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE{
static int f_gold ( int a ) {
return 4 * a ;
}
| def f_gold ( a ) :
return ( 4 * a )
|
using namespace std;
int f_gold ( int a ) {
return 4 * a;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(98);
param0.add(9);
param0.add(18);
param0.add(38);
param0.add(84);
param0.add(8);
param0.add(39);
param0.add(6);
param0.add(60);
param0.add(47);
for(int ... |
if __name__ == '__main__':
param = [
(98,),
(9,),
(18,),
(38,),
(84,),
(8,),
(39,),
(6,),
(60,),
(47,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {98,9,18,38,84,8,39,6,60,47};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
re... |
SPACE_OPTIMIZED_SOLUTION_LCS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SPACE_OPTIMIZED_SOLUTION_LCS{
public static int f_gold ( String X , String Y ) {
int m = X . length ( ) , n = Y . length ( ) ;
int L [ ] [ ] = new int [ 2 ] [ n + 1 ] ;
int bi = 0 ;
for ( int i = 0 ;
i <... | def f_gold ( X , Y ) :
m = len ( X )
n = len ( Y )
L = [ [ 0 for i in range ( n + 1 ) ] for j in range ( 2 ) ]
bi = bool
for i in range ( m ) :
bi = i & 1
for j in range ( n + 1 ) :
if ( i == 0 or j == 0 ) :
L [ bi ] [ j ] = 0
elif ( X [ i ] ==... |
using namespace std;
int f_gold ( string & X, string & Y ) {
int m = X . length ( ), n = Y . length ( );
int L [ 2 ] [ n + 1 ];
bool bi;
for ( int i = 0;
i <= m;
i ++ ) {
bi = i & 1;
for ( int j = 0;
j <= n;
j ++ ) {
if ( i == 0 || j == 0 ) L [ bi ] [ j ] = 0;
else if ( X [ i - ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("YNpjSv");
param0.add("736519");
param0.add("11010000100010");
param0.add("v ");
param0.add("8311172");
param0.add("100011101011");
param0.add("u");
param0.add("394304... |
if __name__ == '__main__':
param = [
('YNpjSv','qtUkJn',),
('736519','07592',),
('11010000100010','0',),
('v ','qGBQT',),
('8311172','157219329531',),
('100011101011','1000001111',),
('u','YzkubTqLhP',),
('3943042','3859',),
('101','00010000101010',),
('MpbfF OsizevaM','WgsF... |
int main() {
int n_success = 0;
vector<string> param0 {"YNpjSv","736519","11010000100010","v ","8311172","100011101011","u","3943042","101","MpbfF OsizevaM"};
vector<string> param1 {"qtUkJn","07592","0","qGBQT","157219329531","1000001111","YzkubTqLhP","3859","00010000101010","WgsFGaQwtp"};
for(int i = ... |
SUM_PAIRWISE_PRODUCTS_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_PAIRWISE_PRODUCTS_2{
static int f_gold ( int n ) {
return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24 ;
}
| def f_gold ( n ) :
return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24
|
using namespace std;
long long int f_gold ( int n ) {
return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(18);
param0.add(97);
param0.add(9);
param0.add(42);
param0.add(67);
param0.add(71);
param0.add(66);
param0.add(69);
param0.add(18);
for(in... |
if __name__ == '__main__':
param = [
(57,),
(18,),
(97,),
(9,),
(42,),
(67,),
(71,),
(66,),
(69,),
(18,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {57,18,97,9,42,67,71,66,69,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1{
public static int f_gold ( int n ) {
int count = 0 ;
for ( int curr = 19 ;
;
curr += 9 ) {
int sum = 0 ;
for ( int x = curr ;
x > 0 ;
x = x / 10 ) ... | def f_gold ( n ) :
count = 0 ;
curr = 19 ;
while ( True ) :
sum = 0 ;
x = curr ;
while ( x > 0 ) :
sum = sum + x % 10 ;
x = int ( x / 10 ) ;
if ( sum == 10 ) :
count += 1 ;
if ( count == n ) :
return curr ;
curr ... |
using namespace std;
int f_gold ( int n ) {
int count = 0;
for ( int curr = 19;
;
curr += 9 ) {
int sum = 0;
for ( int x = curr;
x > 0;
x = x / 10 ) sum = sum + x % 10;
if ( sum == 10 ) count ++;
if ( count == n ) return curr;
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(93);
param0.add(10);
param0.add(55);
param0.add(94);
param0.add(2);
param0.add(5);
param0.add(37);
param0.add(4);
param0.add(11);
param0.add(46);
for(int ... |
if __name__ == '__main__':
param = [
(93,),
(10,),
(55,),
(94,),
(2,),
(5,),
(37,),
(4,),
(11,),
(46,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {93,10,55,94,2,5,37,4,11,46};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
re... |
MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY{
public static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > hash = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ )... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > hash;
for ( int i = 0;
i < n;
i ++ ) hash [ arr [ i ] ] ++;
int max_count = 0;
for ( auto i : hash ) if ( max_count < i . second ) max_count = i . second;
return ( n - max_count );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,6,8,17,25,29,33,33,33,38,42,43,49,55,60,62,63,68,69,70,75,77,79,79,85,87,87,90,90,90,90,94,98});
param0.add(new int[]{-66,-44,72,-82,46,66,-78,-62,32,86,62,56,22,-58,46,-6,94})... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,8,17,25,29,33,33,33,38,42,43,49,55,60,62,63,68,69,70,75,77,79,79,85,87,87,90,90,90,90,94,98},{-66,-44,72,-82,46,66,-78,-62,32,86,62,56,22,-58,46,-6,94},{0,1,1},{68,78,2,48,1,10,18,67,97,31,72,12,25,39,51,12,29,46,93,66,28,29,5,86,97,59,7,94,64,... |
SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N{
static int f_gold ( int n ) {
int prime [ ] = new int [ n + 1 ] , sum = 0 ;
Arrays . fill ( prime , 0 ) ;
int max = n / 2 ;
for ( int p = 2 ;
p <= max ;
p ... | def f_gold(n):
prime = [0] * (n + 1)
sum = 0
max = int(n / 2)
for p in range(2, max + 1):
if prime[p] == 0:
for i in range(p * 2, n + 1, p):
prime[i] = p
for p in range(2, n + 1):
if prime[p]:
sum += prime[p]
else:
sum += p
... |
using namespace std;
int f_gold ( int n ) {
int prime [ n + 1 ], sum = 0;
memset ( prime, 0, sizeof ( prime ) );
int max = n / 2;
for ( int p = 2;
p <= max;
p ++ ) {
if ( prime [ p ] == 0 ) {
for ( int i = p * 2;
i <= n;
i += p ) prime [ i ] = p;
}
}
for ( int p = 2;
p <= n;... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(6);
param0.add(35);
param0.add(87);
param0.add(91);
param0.add(63);
param0.add(11);
param0.add(66);
param0.add(17);
param0.add(92);
param0.add(81);
for(in... |
if __name__ == '__main__':
param = [
(6,),
(35,),
(87,),
(91,),
(63,),
(11,),
(66,),
(17,),
(92,),
(81,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_... |
int main() {
int n_success = 0;
vector<int> param0 {6,35,87,91,63,11,66,17,92,81};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1{
static int f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) {
int count = 0 ;
HashSet < Integer > us = new HashSet < Integer > ( ) ;... | def f_gold ( arr1 , arr2 , m , n , x ) :
count = 0
us = set ( )
for i in range ( m ) :
us.add ( arr1 [ i ] )
for j in range ( n ) :
if x - arr2 [ j ] in us :
count += 1
return count
|
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int x ) {
int count = 0;
unordered_set < int > us;
for ( int i = 0;
i < m;
i ++ ) us . insert ( arr1 [ i ] );
for ( int j = 0;
j < n;
j ++ ) if ( us . find ( x - arr2 [ j ] ) != us . end ( ) ) count ++;
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,5,5,9,11,12,14,16,18,35,36,39,44,50,52,52,59,69,81,82,84,85,87,87,87,88,88,89,90,90,92,97});
param0.add(new int[]{52,28,-38,78,-86,78,-48,-70,-80,28,-8,60,-28,90,6,76,32,-54,30... |
if __name__ == '__main__':
param = [
([1, 2, 5, 5, 9, 11, 12, 14, 16, 18, 35, 36, 39, 44, 50, 52, 52, 59, 69, 81, 82, 84, 85, 87, 87, 87, 88, 88, 89, 90, 90, 92, 97],[5, 5, 8, 20, 20, 24, 25, 29, 34, 37, 43, 45, 48, 49, 59, 60, 68, 70, 70, 72, 72, 75, 76, 77, 79, 81, 84, 85, 86, 88, 95, 96, 96],17,29,32,),
... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,5,5,9,11,12,14,16,18,35,36,39,44,50,52,52,59,69,81,82,84,85,87,87,87,88,88,89,90,90,92,97},{52,28,-38,78,-86,78,-48,-70,-80,28,-8,60,-28,90,6,76,32,-54,30,30,-32,-24,-36,62,36,-66,56,92,-20,90,32},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{91,95,13,13,76,1... |
PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K{
static boolean f_gold ( Integer a [ ] , int b [ ] , int n , int k ) {
Arrays . sort ( a , Collections . reverseOrder ( ) ) ;
Arrays . sort ( b ) ;
for ( int... | def f_gold ( a , b , n , k ) :
a.sort ( reverse = True )
b.sort ( )
for i in range ( n ) :
if ( a [ i ] + b [ i ] < k ) :
return False
return True
|
using namespace std;
bool f_gold ( int a [ ], int b [ ], int n, int k ) {
sort ( a, a + n );
sort ( b, b + n, greater < int > ( ) );
for ( int i = 0;
i < n;
i ++ ) if ( a [ i ] + b [ i ] < k ) return false;
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer [ ]> param0 = new ArrayList<>();
param0.add(new Integer[]{9,12,16,25,27,40,43,52,52,70,87,88,90,97,99});
param0.add(new Integer[]{-96,-90,-80,10,-84,-96,-28,-42,30,-92,-44,-14,18,-68,-94,6,-76,72,-90,42,70,-78,56,-26,8,74,12,-74,2... |
if __name__ == '__main__':
param = [
([9, 12, 16, 25, 27, 40, 43, 52, 52, 70, 87, 88, 90, 97, 99],[4, 7, 11, 20, 34, 35, 36, 44, 46, 71, 72, 78, 85, 85, 91],10,7,),
([-96, -90, -80, 10, -84, -96, -28, -42, 30, -92, -44, -14, 18, -68, -94, 6, -76, 72, -90, 42, 70, -78, 56, -26, 8, 74, 12, -74, 20, -86, -74,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,12,16,25,27,40,43,52,52,70,87,88,90,97,99},{-96,-90,-80,10,-84,-96,-28,-42,30,-92,-44,-14,18,-68,-94,6,-76,72,-90,42,70,-78,56,-26,8,74,12,-74,20,-86,-74,-90,-98,92,30,94,14,92,88,-98,42,-48},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{13,35,6,69,42,55,... |
SUM_TWO_LARGE_NUMBERS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_TWO_LARGE_NUMBERS_1{
static String f_gold ( String str1 , String str2 ) {
if ( str1 . length ( ) > str2 . length ( ) ) {
String t = str1 ;
str1 = str2 ;
str2 = t ;
}
String str = "" ;
int n... | null |
using namespace std;
string f_gold ( string str1, string str2 ) {
if ( str1 . length ( ) > str2 . length ( ) ) swap ( str1, str2 );
string str = "";
int n1 = str1 . length ( ), n2 = str2 . length ( );
int diff = n2 - n1;
int carry = 0;
for ( int i = n1 - 1;
i >= 0;
i -- ) {
int sum = ( ( str1 [ i ]... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("G");
param0.add("48578");
param0.add("010");
param0.add("KkGp");
param0.add("48928969618416");
param0.add("0101011010");
param0.add("X");
param0.add("10073867");
... | null |
int main() {
int n_success = 0;
vector<string> param0 {"G","48578","010","KkGp","48928969618416","0101011010","X","10073867","01110000000","k "};
vector<string> param1 {"FcAiuKhw","5117561223135","00000","nSE","88497275","11","MomtbuxLRR","28","0110","aSSlhOYp"};
for(int i = 0; i < param0.size(); ++i)
... |
BREAK_NUMBER_THREE_PARTS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BREAK_NUMBER_THREE_PARTS{
static long f_gold ( long n ) {
long count = 0 ;
for ( int i = 0 ;
i <= n ;
i ++ ) for ( int j = 0 ;
j <= n ;
j ++ ) for ( int k = 0 ;
k <= n ;
k ++ ) if ( i + j + k == n ... | def f_gold ( n ) :
count = 0
for i in range ( 0 , n + 1 ) :
for j in range ( 0 , n + 1 ) :
for k in range ( 0 , n + 1 ) :
if ( i + j + k == n ) :
count = count + 1
return count
| null |
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(52L);
param0.add(47L);
param0.add(75L);
param0.add(36L);
param0.add(68L);
param0.add(16L);
param0.add(99L);
param0.add(38L);
param0.add(84L);
param0.add(45L);
... |
if __name__ == '__main__':
param = [
(52,),
(47,),
(75,),
(36,),
(68,),
(16,),
(99,),
(38,),
(84,),
(45,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... | null |
BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET{
static int f_gold ( int n ) {
int [ ] [ ] bell = new int [ n + 1 ] [ n + 1 ] ;
bell [ 0 ] [ 0 ] = 1 ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
bell [ i ] [ ... | def f_gold ( n ) :
bell = [ [ 0 for i in range ( n + 1 ) ] for j in range ( n + 1 ) ]
bell [ 0 ] [ 0 ] = 1
for i in range ( 1 , n + 1 ) :
bell [ i ] [ 0 ] = bell [ i - 1 ] [ i - 1 ]
for j in range ( 1 , i + 1 ) :
bell [ i ] [ j ] = bell [ i - 1 ] [ j - 1 ] + bell [ i ] [ j - 1 ]
... |
using namespace std;
int f_gold ( int n ) {
int bell [ n + 1 ] [ n + 1 ];
bell [ 0 ] [ 0 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) {
bell [ i ] [ 0 ] = bell [ i - 1 ] [ i - 1 ];
for ( int j = 1;
j <= i;
j ++ ) bell [ i ] [ j ] = bell [ i - 1 ] [ j - 1 ] + bell [ i ] [ j - 1 ];
}
return bell ... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(84);
param0.add(78);
param0.add(9);
param0.add(73);
param0.add(4);
param0.add(53);
param0.add(85);
param0.add(38);
param0.add(39);
param0.add(6);
for(int ... |
if __name__ == '__main__':
param = [
(84,),
(78,),
(9,),
(73,),
(4,),
(53,),
(85,),
(38,),
(39,),
(6,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {84,78,9,73,4,53,85,38,39,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
re... |
FIND_ONE_EXTRA_CHARACTER_STRING_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_ONE_EXTRA_CHARACTER_STRING_1{
static char f_gold ( String strA , String strB ) {
int res = 0 , i ;
for ( i = 0 ;
i < strA . length ( ) ;
i ++ ) {
res ^= strA . charAt ( i ) ;
}
for ( i = 0 ;
... | def f_gold ( strA , strB ) :
res = 0
for i in range ( 0 , len ( strA ) ) :
res = res ^ ( ord ) ( strA [ i ] )
for i in range ( 0 , len ( strB ) ) :
res = res ^ ( ord ) ( strB [ i ] )
return ( ( chr ) ( res ) ) ;
|
using namespace std;
char f_gold ( string strA, string strB ) {
int res = 0, i;
for ( i = 0;
i < strA . length ( );
i ++ ) {
res ^= strA [ i ];
}
for ( i = 0;
i < strB . length ( );
i ++ ) {
res ^= strB [ i ];
}
return ( ( char ) ( res ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("obfLA mmMYvghH");
param0.add("2941");
param0.add("0111111");
param0.add("oWvbFstI");
param0.add("4937516500");
param0.add("101110100");
param0.add("hYZscJQFBE");
para... |
if __name__ == '__main__':
param = [
('obfLA mmMYvghH','obfLA mmMYvghH',),
('2941','2941',),
('0111111','0111111',),
('oWvbFstI','oWvbFstI',),
('4937516500','4937516500',),
('101110100','101110100',),
('hYZscJQFBE','hYZscJQFBE',),
('58443','58443',),
('1100','1100',),
('ZUd... |
int main() {
int n_success = 0;
vector<string> param0 {"obfLA mmMYvghH","2941","0111111","oWvbFstI","4937516500","101110100","hYZscJQFBE","58443","1100","ZUdYuIBVNaeeb"};
vector<string> param1 {"obfLA mmMYvghH","23941","01011111","oWvsbFstI","49376516500","1011210100","hYZscJQQFBE","584443","11000","ZUdYV... |
MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS{
static String f_gold ( String num1 , String num2 ) {
int len1 = num1 . length ( ) ;
int len2 = num2 . length ( ) ;
if ( len1 == 0 || len2 == 0 ) return "0" ;
... | def f_gold ( num1 , num2 ) :
len1 = len ( num1 )
len2 = len ( num2 )
if len1 == 0 or len2 == 0 :
return "0"
result = [ 0 ] * ( len1 + len2 )
i_n1 = 0
i_n2 = 0
for i in range ( len1 - 1 , - 1 , - 1 ) :
carry = 0
n1 = ord ( num1 [ i ] ) - 48
i_n2 = 0
for... |
using namespace std;
string f_gold ( string num1, string num2 ) {
int len1 = num1 . size ( );
int len2 = num2 . size ( );
if ( len1 == 0 || len2 == 0 ) return "0";
vector < int > result ( len1 + len2, 0 );
int i_n1 = 0;
int i_n2 = 0;
for ( int i = len1 - 1;
i >= 0;
i -- ) {
int carry = 0;
int... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("OaITtzE");
param0.add("88111031");
param0.add("1100111");
param0.add("eiWPbMrFx");
param0.add("43701248");
param0.add("100001111110");
param0.add("jVgOapMp");
param0.... |
if __name__ == '__main__':
param = [
('OaITtzE','RnYlJUqzk',),
('88111031','558471',),
('1100111','11111110111101',),
('eiWPbMrFx','tBAJaI',),
('43701248','4027',),
('100001111110','11',),
('jVgOapMp','Xm',),
('68337672','56939',),
('00110101','1',),
('JqSh','iAfjQRwuVyost',... |
int main() {
int n_success = 0;
vector<string> param0 {"OaITtzE","88111031","1100111","eiWPbMrFx","43701248","100001111110","jVgOapMp","68337672","00110101","JqSh"};
vector<string> param1 {"RnYlJUqzk","558471","11111110111101","tBAJaI","4027","11","Xm","56939","1","iAfjQRwuVyost"};
for(int i = 0; i < p... |
MAXIMUM_PRODUCT_SUBSET_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_PRODUCT_SUBSET_ARRAY{
static int f_gold ( int a [ ] , int n ) {
if ( n == 1 ) {
return a [ 0 ] ;
}
int max_neg = Integer . MIN_VALUE ;
int count_neg = 0 , count_zero = 0 ;
int prod = 1 ;
fo... | def f_gold ( a , n ) :
if n == 1 :
return a [ 0 ]
max_neg = - 999999999999
count_neg = 0
count_zero = 0
prod = 1
for i in range ( n ) :
if a [ i ] == 0 :
count_zero += 1
continue
if a [ i ] < 0 :
count_neg += 1
max_neg = max... |
using namespace std;
int f_gold ( int a [ ], int n ) {
if ( n == 1 ) return a [ 0 ];
int max_neg = INT_MIN;
int count_neg = 0, count_zero = 0;
int prod = 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] == 0 ) {
count_zero ++;
continue;
}
if ( a [ i ] < 0 ) {
count_neg ++;
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{22,62,97});
param0.add(new int[]{-96,30,34,16,82,12,68,6,-2,-78,-74,-52,38,62,20,4,-32,44,-34,12,-44,-66,-94,24,-86,56,-20,-62,90,-16,-2,54,80,-16,-56,-98,20,84,30,-44,-78,66,-62,1... |
if __name__ == '__main__':
param = [
([22, 62, 97],2,),
([-96, 30, 34, 16, 82, 12, 68, 6, -2, -78, -74, -52, 38, 62, 20, 4, -32, 44, -34, 12, -44, -66, -94, 24, -86, 56, -20, -62, 90, -16, -2, 54, 80, -16, -56, -98, 20, 84, 30, -44, -78, 66, -62, 18],41,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{22,62,97},{-96,30,34,16,82,12,68,6,-2,-78,-74,-52,38,62,20,4,-32,44,-34,12,-44,-66,-94,24,-86,56,-20,-62,90,-16,-2,54,80,-16,-56,-98,20,84,30,-44,-78,66,-62,18},{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,... |
SCHEDULE_ELEVATOR_TO_REDUCE_THE_TOTAL_TIME_TAKEN |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SCHEDULE_ELEVATOR_TO_REDUCE_THE_TOTAL_TIME_TAKEN{
static int f_gold ( int n , int k , int a [ ] ) {
int temp ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = i + 1 ;
j < n ;
j ++ ) {
if... | null |
using namespace std;
int f_gold ( int n, int k, int a [ ] ) {
sort ( a, a + n, greater < int > ( ) );
int f_gold = 0;
for ( int i = 0;
i < n;
i += k ) f_gold += ( 2 * a [ i ] );
return f_gold;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(17);
param0.add(2);
param0.add(0);
param0.add(16);
param0.add(31);
param0.add(28);
param0.add(9);
param0.add(32);
param0.add(17);
param0.add(19);
List<Int... | null |
int main() {
int n_success = 0;
vector<int> param0 {17,2,0,16,31,28,9,32,17,19};
vector<int> param1 {15,2,0,27,23,33,10,26,22,15};
vector<vector<int>> param2 {{1,4,8,18,24,34,38,38,39,39,41,53,56,57,63,72,73,77,79,99},{-8,70,-90,-74},{0},{3,66,11,21,82,75,19,39,1,55,7,26,10,87,11,94,91,76,21,91,83,18,4... |
SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY{
static int f_gold ( int arr [ ] , int l , int h , int key ) {
if ( l > h ) return - 1 ;
int mid = ( l + h ) / 2 ;
if ( arr [ mid ] == key ) return mid ;
if ... | def f_gold(arr, l, h, key):
if l > h:
return - 1
mid = (l + h) // 2
if arr[mid] == key:
return mid
if arr[l] <= arr[mid]:
if key >= arr[l] and key <= arr[mid]:
return f_gold(arr, l, mid - 1, key)
return f_gold(arr, mid + 1, h, key)
if key >= arr[mid] and k... |
using namespace std;
int f_gold ( int arr [ ], int l, int h, int key ) {
if ( l > h ) return - 1;
int mid = ( l + h ) / 2;
if ( arr [ mid ] == key ) return mid;
if ( arr [ l ] <= arr [ mid ] ) {
if ( key >= arr [ l ] && key <= arr [ mid ] ) return f_gold ( arr, l, mid - 1, key );
return f_gold ( arr, m... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5, 6, 7, 8, 9, 10, 1, 2, 3});
param0.add(new int[]{{30, 40, 50, 10, 20});
param0.add(new int[]{40,50,55,67,70,4,5,6,7});
param0.add(new int[]{14,41,38,67,99,11,96,52,4,29,2... |
if __name__ == '__main__':
param = [
([5, 6, 7, 8, 9, 10, 1, 2, 3], 0, 8, 3,),
([30, 40, 50, 10, 20], 0, 4, 40,),
([40, 50, 55, 67, 70, 4, 5, 6, 7], 0, 9, 67,),
([14, 41, 38, 67, 99, 11, 96, 52, 4, 29, 22, 57, 3, 45, 14, 76, 70,
38, 93, 5, 74, 50, 18, 17, 20, 34, 51, 69, 8... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5, 6, 7, 8, 9, 10, 1, 2, 3},{30, 40, 50, 10, 20},{40,50,55,67,70,4,5,6,7},{14,41,38,67,99,11,96,52,4,29,22,57,3,45,14,76,70,38,93,5,74,50,18,17,20,34,51,69,86,73},{-90,-88,-88,-82,-62,-44,-38,-38,-36,-34,-34,-32,-30,-28,-28,-26,-24,-20,-16,-16,-16,-6... |
DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT{
static boolean f_gold ( String bin ) {
int n = bin . length ( ) ;
if ( bin . charAt ( n - 1 ) == '1' ) return false ;
int sum = 0 ;
for ( int i ... | def f_gold ( bin ) :
n = len ( bin )
if ( bin [ n - 1 ] == '1' ) :
return False
sum = 0
i = n - 2
while i >= 0 :
if ( bin [ i ] == '1' ) :
posFromRight = n - i - 1
if ( posFromRight % 4 == 1 ) :
sum = sum + 2
elif ( posFromRight % 4... |
using namespace std;
bool f_gold ( string bin ) {
int n = bin . size ( );
if ( bin [ n - 1 ] == '1' ) return false;
int sum = 0;
for ( int i = n - 2;
i >= 0;
i -- ) {
if ( bin [ i ] == '1' ) {
int posFromRight = n - i - 1;
if ( posFromRight % 4 == 1 ) sum = sum + 2;
else if ( posFromR... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("101000");
param0.add("39613456759141");
param0.add("11");
param0.add("PoiHjo");
param0.add("2");
param0.add("0000101");
param0.add("T s dZKeDX gK");
param0.add("3944... |
if __name__ == '__main__':
param = [
('101000',),
('39613456759141',),
('11',),
('PoiHjo',),
('2',),
('0000101',),
('T s dZKeDX gK',),
('3944713969',),
('1000',),
('ifYUgdpmt',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*... |
int main() {
int n_success = 0;
vector<string> param0 {"101000","39613456759141","11","PoiHjo","2","0000101","T s dZKeDX gK","3944713969","1000","ifYUgdpmt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
... |
FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS{
public static int f_gold ( int arr [ ] [ ] , int n ) {
int d1 = 0 , d2 = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = 0 ;
j < n ;
j ++ ) {... | def f_gold ( arr , n ) :
d1 = 0
d2 = 0
for i in range ( 0 , n ) :
for j in range ( 0 , n ) :
if ( i == j ) :
d1 += arr [ i ] [ j ]
if ( i == n - j - 1 ) :
d2 += arr [ i ] [ j ]
return abs ( d1 - d2 ) ;
| null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{1,7,17,19,22,25,27,29,41,60,67,73,79,85,94},new int[]{2,6,16,21,30,42,43,48,50,52,60,61,68,92,95},new int[]{4,8,10,14,15,20,22,23,23,39,40,63,70,75,87},new int[]{7,21,2... |
if __name__ == '__main__':
param = [
([[1, 7, 17, 19, 22, 25, 27, 29, 41, 60, 67, 73, 79, 85, 94], [2, 6, 16, 21, 30, 42, 43, 48, 50, 52, 60, 61, 68, 92, 95], [4, 8, 10, 14, 15, 20, 22, 23, 23, 39, 40, 63, 70, 75, 87], [7, 21, 24, 36, 39, 43, 50, 58, 58, 67, 70, 89, 94, 98, 99], [4, 13, 17, 20, 21, 24, 30, 45,... | null |
NTH_MULTIPLE_NUMBER_FIBONACCI_SERIES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NTH_MULTIPLE_NUMBER_FIBONACCI_SERIES{
public static int f_gold ( int k , int n ) {
long f1 = 0 , f2 = 1 , f3 ;
int i = 2 ;
while ( i != 0 ) {
f3 = f1 + f2 ;
f1 = f2 ;
f2 = f3 ;
if ( f2 % k ==... | def f_gold(k, n):
f1 = 0
f2 = 1
i = 2
while i != 0:
f3 = f1 + f2
f1 = f2
f2 = f3
if f2 % k == 0:
return n * i
i += 1
return
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(50);
param0.add(52);
param0.add(42);
param0.add(2);
param0.add(37);
param0.add(48);
param0.add(31);
param0.add(9);
param0.add(78);
param0.add(64);
List<In... |
if __name__ == '__main__':
param = [
(50, 60,),
(52, 45,),
(42, 17,),
(2, 68,),
(37, 43,),
(48, 46,),
(31, 4,),
(9, 64,),
(78, 14,),
(64, 80,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*... | null |
PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1{
static boolean f_gold ( int arr [ ] , int n ) {
if ( n == 0 || n == 1 ) return true ;
for ( int i = 1 ;
i < n ;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] )... | def f_gold ( arr , n ) :
if ( n == 0 or n == 1 ) :
return True
for i in range ( 1 , n ) :
if ( arr [ i - 1 ] > arr [ i ] ) :
return False
return True
|
using namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,8,8,16,19,19,21,23,26,33,34,36,38,39,41,41,45,47,52,52,55,57,60,60,60,61,69,69,70,70,72,73,73,75,78,81,84,84,85,88,88,89,90,91,97});
param0.add(new int[]{2,-90,66,24,-18,70,34,18... |
if __name__ == '__main__':
param = [
([6, 8, 8, 16, 19, 19, 21, 23, 26, 33, 34, 36, 38, 39, 41, 41, 45, 47, 52, 52, 55, 57, 60, 60, 60, 61, 69, 69, 70, 70, 72, 73, 73, 75, 78, 81, 84, 84, 85, 88, 88, 89, 90, 91, 97],22,),
([2, -90, 66, 24, -18, 70, 34, 18, 84, -62],9,),
([1, 1],1,),
([12, 88, 65, 8... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,8,8,16,19,19,21,23,26,33,34,36,38,39,41,41,45,47,52,52,55,57,60,60,60,61,69,69,70,70,72,73,73,75,78,81,84,84,85,88,88,89,90,91,97},{2,-90,66,24,-18,70,34,18,84,-62},{1,1},{12,88,65,82,23,39,60,27,57,44,70,28,23,34,25,11,48,65,10,73,26,10,18,60,73,4... |
LONGEST_SUBARRAY_SUM_DIVISIBLE_K |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_SUBARRAY_SUM_DIVISIBLE_K{
static int f_gold ( int arr [ ] , int n , int k ) {
HashMap < Integer , Integer > um = new HashMap < Integer , Integer > ( ) ;
int mod_arr [ ] = new int [ n ] ;
int max = 0 ... | null |
using namespace std;
int f_gold ( int arr [ ], int n, int k ) {
unordered_map < int, int > um;
int mod_arr [ n ], max = 0;
int curr_sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
curr_sum += arr [ i ];
mod_arr [ i ] = ( ( curr_sum % k ) + k ) % k;
}
for ( int i = 0;
i < n;
i ++ ) {
if ( mod_... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{14,16,17,17,31,32,34,35,37,38,39,46,47,52,57,58,60,61,69,75,76,77,81,88,97});
param0.add(new int[]{-16,64,-62,-86,10,-40,52,50,-42,34,-32,-32,90,72,-96,-46,-6,92,14,98,-66,96,-48,-... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{14,16,17,17,31,32,34,35,37,38,39,46,47,52,57,58,60,61,69,75,76,77,81,88,97},{-16,64,-62,-86,10,-40,52,50,-42,34,-32,-32,90,72,-96,-46,-6,92,14,98,-66,96,-48,-80,-22,-82,-50,-60,-70,82,-78,-68,88,-56,24,-52},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{33,1... |
SUM_AREA_RECTANGLES_POSSIBLE_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_AREA_RECTANGLES_POSSIBLE_ARRAY{
static int f_gold ( int [ ] a , int n ) {
Arrays . sort ( a ) ;
int sum = 0 ;
boolean flag = false ;
int len = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( ( a ... | null |
using namespace std;
int f_gold ( int a [ ], int n ) {
sort ( a, a + n, greater < int > ( ) );
int sum = 0;
bool flag = false;
int len;
for ( int i = 0;
i < n;
i ++ ) {
if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( ! flag ) ) {
flag = true;
len = a [ i + 1 ];
i ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,11,14,15,22,33,64,81,82,95});
param0.add(new int[]{-42,2,84,18,60,84,-12,64,46,60,40,52,-62,-48,60,64,76,50,88,92,42,-82,44,-98,-4});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,11,14,15,22,33,64,81,82,95},{-42,2,84,18,60,84,-12,64,46,60,40,52,-62,-48,60,64,76,50,88,92,42,-82,44,-98,-4},{0,0,0,0,0,0,0,0,0,0,0,0,0,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},{50,6,43,82,99,1,20,7,52,18,52,18,45,75,58,48,49,70,69,19,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.