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 ⌀ |
|---|---|---|---|---|---|---|
RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1{
static int f_gold ( int n ) {
int dp [ ] = new int [ n + 1 ] ;
dp [ 0 ] = 0 ;
dp [ 1 ] = 1 ;
for ( int i = 2 ;
i <= n ;
i ++ ) dp [ i ] = Math . max ... | def f_gold ( n ) :
dp = [ 0 ] * ( n + 1 )
dp [ 0 ] = 0
dp [ 1 ] = 1
for i in range ( 2 , n + 1 ) :
dp [ i ] = max ( dp [ int ( i / 2 ) ] + dp [ int ( i / 3 ) ] + dp [ int ( i / 4 ) ] , i ) ;
return dp [ n ]
|
using namespace std;
int f_gold ( int n ) {
int dp [ n + 1 ];
dp [ 0 ] = 0, dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = max ( dp [ i / 2 ] + dp [ i / 3 ] + dp [ i / 4 ], i );
return dp [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(50);
param0.add(83);
param0.add(18);
param0.add(24);
param0.add(31);
param0.add(38);
param0.add(94);
param0.add(24);
param0.add(13);
param0.add(53);
for(i... |
if __name__ == '__main__':
param = [
(50,),
(83,),
(18,),
(24,),
(31,),
(38,),
(94,),
(24,),
(13,),
(53,)
]
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 {50,83,18,24,31,38,94,24,13,53};
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();
... |
MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN{
static int f_gold ( int coin [ ] , int n , int k ) {
Arrays . sort ( coin ) ;
int coins_needed = ( int ) Math . ceil ( 1.0 * n /... | import math
def f_gold ( coin , n , k ) :
coin.sort ( )
coins_needed = math.ceil ( 1.0 * n // ( k + 1 ) ) ;
ans = 0
for i in range ( coins_needed - 1 + 1 ) :
ans += coin [ i ]
return ans
|
using namespace std;
int f_gold ( int coin [ ], int n, int k ) {
sort ( coin, coin + n );
int coins_needed = ceil ( 1.0 * n / ( k + 1 ) );
int ans = 0;
for ( int i = 0;
i <= coins_needed - 1;
i ++ ) ans += coin [ i ];
return ans;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,5,9,10,10,11,14,15,19,21,22,29,36,36,38,39,39,39,41,41,42,45,45,48,55,56,57,64,66,66,66,66,69,74,76,80,81,82,82,85,87,95,95});
param0.add(new int[]{-6,-52,20,-98,-10,48,36,66,-... |
if __name__ == '__main__':
param = [
([2, 4, 5, 9, 10, 10, 11, 14, 15, 19, 21, 22, 29, 36, 36, 38, 39, 39, 39, 41, 41, 42, 45, 45, 48, 55, 56, 57, 64, 66, 66, 66, 66, 69, 74, 76, 80, 81, 82, 82, 85, 87, 95, 95],33,27,),
([-6, -52, 20, -98, -10, 48, 36, 66, -88, 94, 68, 16],6,10,),
([0, 0, 0, 0, 0, 0, 0... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,5,9,10,10,11,14,15,19,21,22,29,36,36,38,39,39,39,41,41,42,45,45,48,55,56,57,64,66,66,66,66,69,74,76,80,81,82,82,85,87,95,95},{-6,-52,20,-98,-10,48,36,66,-88,94,68,16},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{91,62,29,49,6,11,10,43,7... |
PADOVAN_SEQUENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PADOVAN_SEQUENCE{
static int f_gold ( int n ) {
int pPrevPrev = 1 , pPrev = 1 , pCurr = 1 , pNext = 1 ;
for ( int i = 3 ;
i <= n ;
i ++ ) {
pNext = pPrevPrev + pPrev ;
pPrevPrev = pPrev ;
pPrev... | def f_gold ( n ) :
pPrevPrev , pPrev , pCurr , pNext = 1 , 1 , 1 , 1
for i in range ( 3 , n + 1 ) :
pNext = pPrevPrev + pPrev
pPrevPrev = pPrev
pPrev = pCurr
pCurr = pNext
return pNext ;
|
using namespace std;
int f_gold ( int n ) {
int pPrevPrev = 1, pPrev = 1, pCurr = 1, pNext = 1;
for ( int i = 3;
i <= n;
i ++ ) {
pNext = pPrevPrev + pPrev;
pPrevPrev = pPrev;
pPrev = pCurr;
pCurr = pNext;
}
return pNext;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(92);
param0.add(29);
param0.add(52);
param0.add(55);
param0.add(13);
param0.add(83);
param0.add(83);
param0.add(10);
param0.add(67);
for(in... |
if __name__ == '__main__':
param = [
(1,),
(92,),
(29,),
(52,),
(55,),
(13,),
(83,),
(83,),
(10,),
(67,)
]
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 {1,92,29,52,55,13,83,83,10,67};
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();
... |
CEILING_IN_A_SORTED_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CEILING_IN_A_SORTED_ARRAY{
static int f_gold ( int arr [ ] , int low , int high , int x ) {
int i ;
if ( x <= arr [ low ] ) return low ;
for ( i = low ;
i < high ;
i ++ ) {
if ( arr [ i ] == x ) retu... | def f_gold ( arr , low , high , x ) :
if x <= arr [ low ] :
return low
i = low
for i in range ( high ) :
if arr [ i ] == x :
return i
if arr [ i ] < x and arr [ i + 1 ] >= x :
return i + 1
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int low, int high, int x ) {
int i;
if ( x <= arr [ low ] ) return low;
for ( i = low;
i < high;
i ++ ) {
if ( arr [ i ] == x ) return i;
if ( arr [ i ] < x && arr [ i + 1 ] >= x ) return i + 1;
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,3,4,6,8,9,9,10,11,16,19,20,21,21,21,24,24,25,28,30,30,30,32,34,35,39,41,42,49,52,57,59,61,62,66,68,71,73,76,79,83,84,85,86,87,87});
param0.add(new int[]{92,50,-84,60,32,-54,84,-8... |
if __name__ == '__main__':
param = [
([2, 3, 4, 6, 8, 9, 9, 10, 11, 16, 19, 20, 21, 21, 21, 24, 24, 25, 28, 30, 30, 30, 32, 34, 35, 39, 41, 42, 49, 52, 57, 59, 61, 62, 66, 68, 71, 73, 76, 79, 83, 84, 85, 86, 87, 87],23,37,44,),
([92, 50, -84, 60, 32, -54, 84, -82, -42, -72, -64, -28, -48, 66, 92, -42, 42, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,4,6,8,9,9,10,11,16,19,20,21,21,21,24,24,25,28,30,30,30,32,34,35,39,41,42,49,52,57,59,61,62,66,68,71,73,76,79,83,84,85,86,87,87},{92,50,-84,60,32,-54,84,-82,-42,-72,-64,-28,-48,66,92,-42,42,-66,52,-30,48,42,36,-4,64,62,-16,0,20,26,78,78,12,-6,-30,... |
MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1{
static int f_gold ( int ar [ ] , int n ) {
if ( n <= 4 ) return Arrays . stream ( ar ) . min ( ) . getAsInt ( ) ;
int [ ] sum = new i... | def f_gold ( ar , n ) :
if ( n <= 4 ) :
return min ( ar )
sum = [ 0 for i in range ( n ) ]
sum [ 0 ] = ar [ 0 ]
sum [ 1 ] = ar [ 1 ]
sum [ 2 ] = ar [ 2 ]
sum [ 3 ] = ar [ 3 ]
for i in range ( 4 , n ) :
sum [ i ] = ar [ i ] + min ( sum [ i - 4 : i ] )
return min ( sum [ n ... |
using namespace std;
int f_gold ( int ar [ ], int n ) {
if ( n <= 4 ) return * min_element ( ar, ar + n );
int sum [ n ];
sum [ 0 ] = ar [ 0 ];
sum [ 1 ] = ar [ 1 ];
sum [ 2 ] = ar [ 2 ];
sum [ 3 ] = ar [ 3 ];
for ( int i = 4;
i < n;
i ++ ) sum [ i ] = ar [ i ] + ( * min_element ( sum + i - 4, sum + ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,4,9,26,31,31,33,35,40,45,48,52,57,60,69,75,82,89,90,92,95,97});
param0.add(new int[]{60,-68,30,-62,-8,48,-20,30,16,-60,-20});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0... |
if __name__ == '__main__':
param = [
([4, 4, 9, 26, 31, 31, 33, 35, 40, 45, 48, 52, 57, 60, 69, 75, 82, 89, 90, 92, 95, 97],19,),
([60, -68, 30, -62, -8, 48, -20, 30, 16, -60, -20],5,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,4,9,26,31,31,33,35,40,45,48,52,57,60,69,75,82,89,90,92,95,97},{60,-68,30,-62,-8,48,-20,30,16,-60,-20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{15,70,50,28,67,11,27,42,1,61,37,8,66,54,50,91,86,57,4... |
COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X |
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{
static int f_gold ( int [ ] arr1 , int [ ] arr2 , int m , int n , int x ) {
int count = 0 ;
for ( int i = 0 ;
i < m ;
i ++ ) for ( int j = 0 ;
... | def f_gold ( arr1 , arr2 , m , n , x ) :
count = 0
for i in range ( m ) :
for j in range ( n ) :
if arr1 [ i ] + arr2 [ j ] == x :
count = count + 1
return count
|
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int x ) {
int count = 0;
for ( int i = 0;
i < m;
i ++ ) for ( int j = 0;
j < n;
j ++ ) if ( ( arr1 [ i ] + arr2 [ j ] ) == x ) count ++;
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{11,13,16,23,26,28,31,34,37,39,44,48,56,59,79,91,96,98});
param0.add(new int[]{50,14,-98,14,90,36,66,44,10,-98,-24,-36,-32,-50});
param0.add(new int[]{0,0,0,0,0,0,1,1,1,1,1,1,1,... |
if __name__ == '__main__':
param = [
([11, 13, 16, 23, 26, 28, 31, 34, 37, 39, 44, 48, 56, 59, 79, 91, 96, 98],[1, 1, 9, 14, 17, 23, 26, 31, 33, 36, 53, 60, 71, 75, 76, 84, 87, 88],9,15,11,),
([50, 14, -98, 14, 90, 36, 66, 44, 10, -98, -24, -36, -32, -50],[34, -6, -66, 0, -6, 82, 60, -98, -8, 60, -2, 4, 22... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{11,13,16,23,26,28,31,34,37,39,44,48,56,59,79,91,96,98},{50,14,-98,14,90,36,66,44,10,-98,-24,-36,-32,-50},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{88,14,29,87,86,58},{-98,-92,-88,-86,-82,-76,-72,-66,-56,-48,-34,-28,-28,-26,-20,-18,-18,-16,-16,-12,-4,0,6,12,... |
CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT{
static boolean f_gold ( int num ) {
if ( num / 10 == 0 ) return true ;
while ( num != 0 ) {
if ( num / 10 == 0 ) return true ;
int digit1 = num % 10 ;
int digit... | def f_gold ( num ) :
if ( num // 10 == 0 ) :
return True
while ( num != 0 ) :
if ( num // 10 == 0 ) :
return True
digit1 = num % 10
digit2 = ( num // 10 ) % 10
if ( abs ( digit2 - digit1 ) > 1 ) :
return False
num = num // 10
return Tru... |
using namespace std;
bool f_gold ( int num ) {
if ( num / 10 == 0 ) return true;
while ( num != 0 ) {
if ( num / 10 == 0 ) return true;
int digit1 = num % 10;
int digit2 = ( num / 10 ) % 10;
if ( abs ( digit2 - digit1 ) > 1 ) return false;
num = num / 10;
}
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(77);
param0.add(35);
param0.add(79);
param0.add(45);
param0.add(22);
param0.add(68);
param0.add(17);
param0.add(5);
param0.add(85);
for(in... |
if __name__ == '__main__':
param = [
(67,),
(77,),
(35,),
(79,),
(45,),
(22,),
(68,),
(17,),
(5,),
(85,)
]
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 {67,77,35,79,45,22,68,17,5,85};
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();
... |
EFFICIENTLY_FIND_FIRST_REPEATED_CHARACTER_STRING_WITHOUT_USING_ADDITIONAL_DATA_STRUCTURE_ONE_TRAVERSAL |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EFFICIENTLY_FIND_FIRST_REPEATED_CHARACTER_STRING_WITHOUT_USING_ADDITIONAL_DATA_STRUCTURE_ONE_TRAVERSAL{
static int f_gold ( String str ) {
int checker = 0 ;
for ( int i = 0 ;
i < str . length ( ) ;
++ i ) ... | null |
using namespace std;
int f_gold ( string str ) {
int checker = 0;
for ( int i = 0;
i < str . length ( );
++ i ) {
int val = ( str [ i ] - 'a' );
if ( ( checker & ( 1 << val ) ) > 0 ) return i;
checker |= ( 1 << val );
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("XFGfXTDgpIuerN");
param0.add("5621946166");
param0.add("11010110");
param0.add("xL");
param0.add("2575");
param0.add("0100010");
param0.add("SZmmQ");
param0.add("9735... | null |
int main() {
int n_success = 0;
vector<string> param0 {"XFGfXTDgpIuerN","5621946166","11010110","xL","2575","0100010","SZmmQ","9735892999350","1001101101101","oEXDbOU"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
LONGEST_REPEATED_SUBSEQUENCE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_REPEATED_SUBSEQUENCE_1{
static String f_gold ( String str ) {
int n = str . length ( ) ;
int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ;
for ( int i = 0 ;
i <= n ;
i ++ ) for ( int j = 0 ;
j <= ... | def f_gold ( str ) :
n = len ( str )
dp = [ [ 0 for i in range ( n + 1 ) ] for j in range ( 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 ]
e... |
using namespace std;
string 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 [ j - 1 ] && i ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("qnQxjoRx");
param0.add("27473733400077");
param0.add("000010111111");
param0.add("TNVwgrWSLu");
param0.add("9537");
param0.add("1100");
param0.add("lYcoiQfzN");
param... |
if __name__ == '__main__':
param = [
('qnQxjoRx',),
('27473733400077',),
('000010111111',),
('TNVwgrWSLu',),
('9537',),
('1100',),
('lYcoiQfzN',),
('52',),
('00100001100',),
('Rkxe',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fil... |
int main() {
int n_success = 0;
vector<string> param0 {"qnQxjoRx","27473733400077","000010111111","TNVwgrWSLu","9537","1100","lYcoiQfzN","52","00100001100","Rkxe"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES{
static int f_gold ( int n ) {
int ans = 0 ;
for ( int length = 1 ;
length <= Math . sqrt ( n ) ;
++ length ) for ( int height = length ;
height * len... | import math
def f_gold ( n ) :
ans = 0
for length in range ( 1 , int ( math.sqrt ( n ) ) + 1 ) :
height = length
while ( height * length <= n ) :
ans += 1
height += 1
return ans
|
using namespace std;
int f_gold ( int n ) {
int ans = 0;
for ( int length = 1;
length <= sqrt ( n );
++ length ) for ( int height = length;
height * length <= n;
++ height ) ans ++;
return ans;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(34);
param0.add(49);
param0.add(41);
param0.add(17);
param0.add(67);
param0.add(38);
param0.add(59);
param0.add(64);
param0.add(61);
param0.add(58);
for(i... |
if __name__ == '__main__':
param = [
(34,),
(49,),
(41,),
(17,),
(67,),
(38,),
(59,),
(64,),
(61,),
(58,)
]
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 {34,49,41,17,67,38,59,64,61,58};
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();
... |
POSITION_ELEMENT_STABLE_SORT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class POSITION_ELEMENT_STABLE_SORT{
static int f_gold ( int arr [ ] , int n , int idx ) {
int result = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] < arr [ idx ] ) result ++ ;
if ( arr [ i ] == ... | def f_gold ( arr , n , idx ) :
result = 0
for i in range ( n ) :
if ( arr [ i ] < arr [ idx ] ) :
result += 1
if ( arr [ i ] == arr [ idx ] and i < idx ) :
result += 1
return result ;
|
using namespace std;
int f_gold ( int arr [ ], int n, int idx ) {
int result = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] < arr [ idx ] ) result ++;
if ( arr [ i ] == arr [ idx ] && i < idx ) result ++;
}
return result;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,8,9,12,15,16,18,28,28,31,33,36,36,37,40,41,44,44,46,50,50,50,52,52,54,55,60,61,65,68,71,75,75,78,81,84,87,89,90,92,94,97,97,98,98,99});
param0.add(new int[]{-16,86,94,-86,-38,64,... |
if __name__ == '__main__':
param = [
([4, 8, 9, 12, 15, 16, 18, 28, 28, 31, 33, 36, 36, 37, 40, 41, 44, 44, 46, 50, 50, 50, 52, 52, 54, 55, 60, 61, 65, 68, 71, 75, 75, 78, 81, 84, 87, 89, 90, 92, 94, 97, 97, 98, 98, 99],37,32,),
([-16, 86, 94, -86, -38, 64, 96, -64, 94, 10, -10, -62, -50, -46, -62, -32, -4... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,8,9,12,15,16,18,28,28,31,33,36,36,37,40,41,44,44,46,50,50,50,52,52,54,55,60,61,65,68,71,75,75,78,81,84,87,89,90,92,94,97,97,98,98,99},{-16,86,94,-86,-38,64,96,-64,94,10,-10,-62,-50,-46,-62,-32,-4,72,14,36,74,-66,46,82,-44,-22,-26,16,-8,0,-90,94,-50... |
NUMBER_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int count = 0 ;
for ( int i = 0 ;
i < n ;
++ i ) if ( s . charAt ( i ) == '4' || s . charAt ( i ) ... | def f_gold ( s ) :
n = len ( s )
count = 0 ;
for i in range ( 0 , n , 1 ) :
if ( s [ i ] == '4' or s [ i ] == '8' or s [ i ] == '0' ) :
count += 1
for i in range ( 0 , n - 1 , 1 ) :
h = ( ord ( s [ i ] ) - ord ( '0' ) ) * 10 + ( ord ( s [ i + 1 ] ) - ord ( '0' ) )
if ... |
using namespace std;
int f_gold ( char s [ ] ) {
int n = strlen ( s );
int count = 0;
for ( int i = 0;
i < n;
++ i ) if ( s [ i ] == '4' || s [ i ] == '8' || s [ i ] == '0' ) count ++;
for ( int i = 0;
i < n - 1;
++ i ) {
int h = ( s [ i ] - '0' ) * 10 + ( s [ i + 1 ] - '0' );
if ( h % 4 == 0 )... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("Qaq");
param0.add("9400761825850");
param0.add("0011001111");
param0.add("lasWqrLRq");
param0.add("5662");
param0.add("110");
param0.add(" tOYKf");
param0.add("653699... |
if __name__ == '__main__':
param = [
('Qaq',),
('9400761825850',),
('0011001111',),
('lasWqrLRq',),
('5662',),
('110',),
(' tOYKf',),
('6536991235305',),
('11111',),
('uZftT iDHcYiCt',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_f... |
int main() {
int n_success = 0;
vector<string> param0 {"Qaq","9400761825850","0011001111","lasWqrLRq","5662","110"," tOYKf","6536991235305","11111","uZftT iDHcYiCt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front()) == f_gold(¶m0[i].front()))
{
n_... |
SQUARE_ROOT_OF_A_PERFECT_SQUARE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SQUARE_ROOT_OF_A_PERFECT_SQUARE{
static float f_gold ( float n ) {
float x = n ;
float y = 1 ;
double e = 0.000001 ;
while ( x - y > e ) {
x = ( x + y ) / 2 ;
y = n / x ;
}
return x ;
}
| def f_gold ( n ) :
x = n
y = 1
e = 0.000001
while ( x - y > e ) :
x = ( x + y ) / 2
y = n / x
return x
| null |
public static void main(String args[]) {
int n_success = 0;
List<Float> param0 = new ArrayList<>();
param0.add(1763.655093333857F);
param0.add(-3544.737136289062F);
param0.add(7893.209433000695F);
param0.add(-3008.0331952533734F);
param0.add(6155.190186637041F);
param0.add(-5799.7514673... |
if __name__ == '__main__':
param = [
(1763.655093333857,),
(-3544.737136289062,),
(7893.209433000695,),
(-3008.0331952533734,),
(6155.190186637041,),
(-5799.751467314729,),
(8234.151546380555,),
(-1829.5367705266551,),
(5778.227173218819,),
(-7785.473710863676,)
]
... | null |
EFFICIENT_WAY_TO_MULTIPLY_WITH_7 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EFFICIENT_WAY_TO_MULTIPLY_WITH_7{
static int f_gold ( int n ) {
return ( ( n << 3 ) - n ) ;
}
| def f_gold ( n ) :
return ( ( n << 3 ) - n )
|
using namespace std;
long f_gold ( long n ) {
return ( ( n << 3 ) - n );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(41);
param0.add(42);
param0.add(62);
param0.add(4);
param0.add(31);
param0.add(75);
param0.add(5);
param0.add(75);
param0.add(85);
param0.add(19);
for(int... |
if __name__ == '__main__':
param = [
(41,),
(42,),
(62,),
(4,),
(31,),
(75,),
(5,),
(75,),
(85,),
(19,)
]
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 {41,42,62,4,31,75,5,75,85,19};
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... |
MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE{
static int f_gold ( int n ) {
int [ ] [ ] C = new int [ n + 1 ] [ n + 1 ] ;
for ( int i = 0 ;
i <= n ;
i ++ ) {
for ( int j = 0 ;
j <= Math . min ( i , n ) ... | def f_gold ( n ) :
C = [ [ 0 for x in range ( n + 1 ) ] for y in range ( n + 1 ) ] ;
for i in range ( n + 1 ) :
for j in range ( 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 ];
for ( int i = 0;
i <= n;
i ++ ) {
for ( int 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 maxvalue = 0;
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(23);
param0.add(41);
param0.add(69);
param0.add(56);
param0.add(71);
param0.add(38);
param0.add(26);
param0.add(52);
param0.add(93);
param0.add(44);
for(i... |
if __name__ == '__main__':
param = [
(23,),
(41,),
(69,),
(56,),
(71,),
(38,),
(26,),
(52,),
(93,),
(44,)
]
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 {23,41,69,56,71,38,26,52,93,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();
... |
PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM{
static float f_gold ( float l , float b , float h ) {
float volume = ( l * b * h ) / 2 ;
return volume ;
}
| def f_gold ( l , b , h ) :
return ( ( l * b * h ) / 2 )
|
using namespace std;
float f_gold ( float l, float b, float h ) {
float volume = ( l * b * h ) / 2;
return volume;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Float> param0 = new ArrayList<>();
param0.add(8448.900678262902F);
param0.add(-1849.728957491451F);
param0.add(412.667844022232F);
param0.add(-5954.835911765373F);
param0.add(8437.913444665008F);
param0.add(-7183.181663518... |
if __name__ == '__main__':
param = [
(8448.900678262902,8135.461799983198,6577.239053611328,),
(-1849.728957491451,-4240.89241631363,-9953.518310747193,),
(412.667844022232,9798.083992381831,1449.9204200270522,),
(-5954.835911765373,-661.8872499003203,-8049.6051526695055,),
(8437.913444665008,8... |
int main() {
int n_success = 0;
vector<float> param0 {8448.900678262902F,-1849.728957491451F,412.667844022232F,-5954.835911765373F,8437.913444665008F,-7183.181663518317F,2340.7905920227954F,-7281.157547371143F,471.3930826982504F,-7550.426360065503F};
vector<float> param1 {8135.461799983198F,-4240.892416313... |
MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE{
static int f_gold ( int arr [ ] , int n ) {
if ( n <= 0 ) return 0 ;
int incl = arr [ 0 ] ;
int excl = 0 ;
for ( int i = 1 ;
i < n ;
i ++ ... | def f_gold(arr, n):
if (n <= 0):
return 0
incl = arr[0]
excl = 0
for i in range(1, n):
incl_new = arr[i] + min(excl, incl)
excl_new = incl
incl = incl_new
excl = excl_new
return min(incl, excl)
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
if ( n <= 0 ) return 0;
int incl = arr [ 0 ];
int excl = 0;
for ( int i = 1;
i < n;
i ++ ) {
int incl_new = arr [ i ] + min ( excl, incl );
int excl_new = incl;
incl = incl_new;
excl = excl_new;
}
return min ( incl, excl );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,17,25,27,29,30,34,49,72,75,90,93,93,94});
param0.add(new int[]{-70,-32,62,0,-10,92,-94,-86,52,6,-26,-92,-10,70,-82,28,86,58,86,-58,84,-80,-18,-92,-34,6,34,36,70,-50,-6,-54,84,22,... |
if __name__ == '__main__':
param = [
([5, 17, 25, 27, 29, 30, 34, 49, 72, 75, 90, 93, 93, 94], 8,),
([-70, -32, 62, 0, -10, 92, -94, -86, 52, 6, -26, -92, -10, 70, -82, 28, 86, 58, 86, -58, 84, -80, -18, -
92, -34, 6, 34, 36, 70, -50, -6, -54, 84, 22, 30, -96, -84, 72, 2, 26, -20, 4, 48, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,17,25,27,29,30,34,49,72,75,90,93,93,94},{-70,-32,62,0,-10,92,-94,-86,52,6,-26,-92,-10,70,-82,28,86,58,86,-58,84,-80,-18,-92,-34,6,34,36,70,-50,-6,-54,84,22,30,-96,-84,72,2,26,-20,4,48,-98,62,-28,-68},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{3... |
PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON{
static double f_gold ( double side ) {
return ( 2 * ( Math . sqrt ( 3 ) ) * ( side * side ) ) ;
}
| import math
def f_gold ( side ) :
return ( 2 * ( math.sqrt ( 3 ) ) * ( side * side ) )
|
using namespace std;
double f_gold ( double side ) {
return ( 2 * ( sqrt ( 3 ) ) * ( side * side ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(1449.255716877097);
param0.add(-8772.104874265995);
param0.add(2948.419328234334);
param0.add(-1184.220109553511);
param0.add(7422.825800698956);
param0.add(-5808.280006171851... |
if __name__ == '__main__':
param = [
(1449.255716877097,),
(-8772.104874265995,),
(2948.419328234334,),
(-1184.220109553511,),
(7422.825800698956,),
(-5808.280006171851,),
(829.8963781665169,),
(-7368.438572511732,),
(5572.033890611617,),
(-3998.9441642787706,)
]
... |
int main() {
int n_success = 0;
vector<double> param0 {1449.255716877097,-8772.104874265995,2948.419328234334,-1184.220109553511,7422.825800698956,-5808.280006171851,829.8963781665169,-7368.438572511732,5572.033890611617,-3998.9441642787706};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - ... |
CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER{
static boolean f_gold ( String s , char c ) {
boolean oneSeen = false ;
int i = 0 , n = s . length ( ) ;
while ( i < n ) {
if ( s . charAt ( i ) == c ) {
... | def f_gold ( s , c ) :
oneSeen = False
i = 0
n = len ( s )
while ( i < n ) :
if ( s [ i ] == c ) :
if ( oneSeen == True ) :
return False
while ( i < n and s [ i ] == c ) :
i = i + 1
oneSeen = True
else :
i = ... |
using namespace std;
bool f_gold ( string s, char c ) {
bool oneSeen = false;
int i = 0, n = s . length ( );
while ( i < n ) {
if ( s [ i ] == c ) {
if ( oneSeen == true ) return false;
while ( i < n && s [ i ] == c ) i ++;
oneSeen = true;
}
else i ++;
}
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("gILrzLimS");
param0.add("307471222");
param0.add("110");
param0.add("GcAB");
param0.add("113");
param0.add("011110010");
param0.add("wcwob");
param0.add("745715822161... |
if __name__ == '__main__':
param = [
('gILrzLimS','m',),
('307471222','2',),
('110','0',),
('GcAB','v',),
('113','3',),
('011110010','0',),
('wcwob','w',),
('74571582216153','1',),
('100000011','0',),
('ryPErkzY','q',)
]
n_success = 0
for i, parameters_set in... |
int main() {
int n_success = 0;
vector<string> param0 {"gILrzLimS","307471222","110","GcAB","113","011110010","wcwob","74571582216153","100000011","ryPErkzY"};
vector<char> param1 {'m','2','0','v','3','0','w','1','0','q'};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param... |
MINIMUM_DIFFERENCE_BETWEEN_GROUPS_OF_SIZE_TWO |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_DIFFERENCE_BETWEEN_GROUPS_OF_SIZE_TWO{
static long f_gold ( long a [ ] , int n ) {
Arrays . sort ( a ) ;
int i , j ;
Vector < Long > s = new Vector < > ( ) ;
for ( i = 0 , j = n - 1 ;
i < j ;
i... | def f_gold ( a , n ) :
a.sort ( ) ;
s = [ ] ;
i = 0 ;
j = n - 1 ;
while ( i < j ) :
s.append ( ( a [ i ] + a [ j ] ) ) ;
i += 1 ;
j -= 1 ;
mini = min ( s ) ;
maxi = max ( s ) ;
return abs ( maxi - mini ) ;
| null |
public static void main(String args[]) {
int n_success = 0;
List<long [ ]> param0 = new ArrayList<>();
param0.add(new long[]{11L,12L,14L,15L,20L,21L,28L,28L,30L,33L,39L,39L,42L,43L,44L,45L,48L,53L,53L,58L,59L,67L,68L,70L,70L,72L,74L,76L,76L,81L,87L,91L});
param0.add(new long[]{28L,-42L,-14L,0L,-56L,42L... |
if __name__ == '__main__':
param = [
([11, 12, 14, 15, 20, 21, 28, 28, 30, 33, 39, 39, 42, 43, 44, 45, 48, 53, 53, 58, 59, 67, 68, 70, 70, 72, 74, 76, 76, 81, 87, 91],31,),
([28, -42, -14, 0, -56, 42, 14, 52, 58, 58, 92, -62, -14, -12, -84, -30, -94, -70, 18, -44, 88, -60],11,),
([0, 0, 0, 0, 0, 0, 0, ... | null |
PROGRAM_TO_CHECK_IF_A_MATRIX_IS_SYMMETRIC |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_TO_CHECK_IF_A_MATRIX_IS_SYMMETRIC{
static boolean f_gold ( int mat [ ] [ ] , int N ) {
for ( int i = 0 ;
i < N ;
i ++ ) for ( int j = 0 ;
j < N ;
j ++ ) if ( mat [ i ] [ j ] != mat [ j ] [ i ] ) ... | def f_gold ( mat , N ) :
for i in range ( N ) :
for j in range ( N ) :
if ( mat [ i ] [ j ] != mat [ j ] [ i ] ) :
return False
return True
| null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{29}});
param0.add(new int[][]{new int[]{ 1, 3, 5 }, new int[]{ 3, 2, 4 }, new int[]{ 5, 4, 1 }});
param0.add(new int[][]{new int[]{ 1, 2, 5 }, new int[]{ 3, 2, ... |
if __name__ == '__main__':
param = [
([[29]],0,),
([[ 1, 3, 5 ], [ 3, 2, 4 ], [ 5, 4, 1 ]], 3,),
([[ 1, 2, 5 ], [ 3, 2, 4 ], [ 5, 4, 1 ]], 3,),
([[37, 56, 39, 95, 78, 69, 89, 45, 66, 99, 20, 10, 6, 33, 78, 26, 86, 61, 78, 36, 62, 23, 80, 89, 83], [42, 75, 30, 64, 25, 95, 17, 90, 6, 11, 1, 77, 16, 7... | null |
FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE{
static int f_gold ( int n ) {
int count = 0 , ans = 1 ;
while ( n % 2 == 0 ) {
count ++ ;
n /= 2 ;
}
if ( count % 2 == 1 ) ans *= 2 ;
for (... | import math
def f_gold ( n ) :
count = 0
ans = 1
while n % 2 == 0 :
count += 1
n //= 2
if count % 2 is not 0 :
ans *= 2
for i in range ( 3 , ( int ) ( math.sqrt ( n ) ) + 1 , 2 ) :
count = 0
while n % i == 0 :
count += 1
n //= i
... |
using namespace std;
int f_gold ( int n ) {
int count = 0, ans = 1;
while ( n % 2 == 0 ) {
count ++;
n /= 2;
}
if ( count % 2 ) ans *= 2;
for ( int i = 3;
i <= sqrt ( n );
i += 2 ) {
count = 0;
while ( n % i == 0 ) {
count ++;
n /= i;
}
if ( count % 2 ) ans *= i;
}
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(95);
param0.add(48);
param0.add(3);
param0.add(10);
param0.add(82);
param0.add(1);
param0.add(77);
param0.add(99);
param0.add(23);
param0.add(61);
for(int... |
if __name__ == '__main__':
param = [
(95,),
(48,),
(3,),
(10,),
(82,),
(1,),
(77,),
(99,),
(23,),
(61,)
]
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 {95,48,3,10,82,1,77,99,23,61};
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_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUM_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int sum = 0 ;
HashSet < Integer > s = new HashSet < Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if (... | def f_gold ( arr , n ) :
s = set ( )
sum = 0
for i in range ( n ) :
if arr [ i ] not in s :
s.add ( arr [ i ] )
for i in s :
sum = sum + i
return sum
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum = 0;
unordered_set < int > s;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . find ( arr [ i ] ) == s . end ( ) ) {
sum += arr [ i ];
s . insert ( arr [ i ] );
}
}
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,6,8,10,21,22,27,32,35,36,43,44,46,48,49,55,60,61,69,69,71,72,73,78,88,94});
param0.add(new int[]{80,94,16,-74,32,-64,-84,-66,-10});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0... |
if __name__ == '__main__':
param = [
([5, 6, 8, 10, 21, 22, 27, 32, 35, 36, 43, 44, 46, 48, 49, 55, 60, 61, 69, 69, 71, 72, 73, 78, 88, 94],24,),
([80, 94, 16, -74, 32, -64, -84, -66, -10],6,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],27,),
([99... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,6,8,10,21,22,27,32,35,36,43,44,46,48,49,55,60,61,69,69,71,72,73,78,88,94},{80,94,16,-74,32,-64,-84,-66,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,4,96,39,39,24,15,47,25,74,7,98,88,91,62,12,31,14,48,26,37,25,11,32,34,64... |
C_PROGRAM_FACTORIAL_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class C_PROGRAM_FACTORIAL_NUMBER{
static int f_gold ( int n ) {
if ( n == 0 ) return 1 ;
return 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;
unsigned int f_gold ( unsigned int n ) {
if ( n == 0 ) return 1;
return n * f_gold ( n - 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(84);
param0.add(41);
param0.add(5);
param0.add(38);
param0.add(79);
param0.add(80);
param0.add(64);
param0.add(62);
param0.add(24);
param0.add(12);
for(in... |
if __name__ == '__main__':
param = [
(84,),
(41,),
(5,),
(38,),
(79,),
(80,),
(64,),
(62,),
(24,),
(12,)
]
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 {84,41,5,38,79,80,64,62,24,12};
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();
... |
FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1{
static String f_gold ( String seq ) {
int n = seq . length ( ) ;
if ( n >= 9 ) return "-1" ;
char result [ ] = new char [ n + 1 ] ;
int count = 1 ;
for ( int i ... | def f_gold ( seq ) :
n = len ( seq )
if ( n >= 9 ) :
return "-1"
result = [ None ] * ( n + 1 )
count = 1
for i in range ( n + 1 ) :
if ( i == n or seq [ i ] == 'I' ) :
for j in range ( i - 1 , - 2 , - 1 ) :
result [ j + 1 ] = int ( '0' + str ( count ) )
... |
using namespace std;
string f_gold ( string seq ) {
int n = seq . length ( );
if ( n >= 9 ) return "-1";
string result ( n + 1, ' ' );
int count = 1;
for ( int i = 0;
i <= n;
i ++ ) {
if ( i == n || seq [ i ] == 'I' ) {
for ( int j = i - 1;
j >= - 1;
j -- ) {
result [ j + 1 ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("D");
param0.add("I");
param0.add("DD");
param0.add("II");
param0.add("DIDI");
param0.add("IIDDD");
param0.add("DDIDDIID");
param0.add("176297");
param0.add("1");
... |
if __name__ == '__main__':
param = [
('D',),
('I',),
('DD',),
('II',),
('DIDI',),
('IIDDD',),
('DDIDDIID',),
('176297',),
('1',),
('XHkhZq',)
]
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 {"D","I","DD","II","DIDI","IIDDD","DDIDDIID","176297","1","XHkhZq"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << ... |
FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS{
public static int f_gold ( int stack1 [ ] , int stack2 [ ] , int stack3 [ ] , int n1 , int n2 , int n3 ) {
int sum1 = 0 , sum2 = 0 , sum3 = 0 ;
for ( int i = 0... | def f_gold ( stack1 , stack2 , stack3 , n1 , n2 , n3 ) :
sum1 , sum2 , sum3 = 0 , 0 , 0
for i in range ( n1 ) :
sum1 += stack1 [ i ]
for i in range ( n2 ) :
sum2 += stack2 [ i ]
for i in range ( n3 ) :
sum3 += stack3 [ i ]
top1 , top2 , top3 = 0 , 0 , 0
ans = 0
while ... |
using namespace std;
int f_gold ( int stack1 [ ], int stack2 [ ], int stack3 [ ], int n1, int n2, int n3 ) {
int sum1 = 0, sum2 = 0, sum3 = 0;
for ( int i = 0;
i < n1;
i ++ ) sum1 += stack1 [ i ];
for ( int i = 0;
i < n2;
i ++ ) sum2 += stack2 [ i ];
for ( int i = 0;
i < n3;
i ++ ) sum3 += stack3 [... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,10,11,24,27,33,34,36,36,40,42,43,52,58,67,69,77,86,86,88});
param0.add(new int[]{40,54,14,58,-64,-60,-98,-64,-52,30,0,-42,74,46,-14,76,84,74,-24,30,96,88,-98,82,44,-86,-92,-52,28... |
if __name__ == '__main__':
param = [
([4, 10, 11, 24, 27, 33, 34, 36, 36, 40, 42, 43, 52, 58, 67, 69, 77, 86, 86, 88],[4, 13, 34, 40, 41, 47, 47, 52, 55, 62, 66, 66, 69, 70, 73, 74, 75, 76, 85, 98],[6, 8, 10, 12, 14, 29, 41, 52, 53, 54, 55, 66, 69, 73, 77, 77, 78, 80, 90, 99],10,12,18,),
([40, 54, 14, 58, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,10,11,24,27,33,34,36,36,40,42,43,52,58,67,69,77,86,86,88},{40,54,14,58,-64,-60,-98,-64,-52,30,0,-42,74,46,-14,76,84,74,-24,30,96,88,-98,82,44,-86,-92,-52,28,62},{0,0},{64,40,45,93,30,79,24,95,1,84,74,5,9,6,22,33,10,53,33,9,31,21,22,77,21,93,86,68,9... |
FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER{
static int f_gold ( int N , int K ) {
int ans = 0 ;
for ( int i = 1 ;
i <= N ;
i ++ ) ans += ( i % K ) ;
return ans ;
}
| def f_gold ( N , K ) :
ans = 0 ;
for i in range ( 1 , N + 1 ) :
ans += ( i % K ) ;
return ans ;
|
using namespace std;
int f_gold ( int N, int K ) {
int ans = 0;
for ( int i = 1;
i <= N;
i ++ ) ans += ( i % K );
return ans;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(11);
param0.add(36);
param0.add(71);
param0.add(74);
param0.add(66);
param0.add(38);
param0.add(2);
param0.add(73);
param0.add(79);
param0.add(30);
List<I... |
if __name__ == '__main__':
param = [
(11,5,),
(36,69,),
(71,28,),
(74,1,),
(66,84,),
(38,14,),
(2,11,),
(73,87,),
(79,11,),
(30,55,)
]
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 {11,36,71,74,66,38,2,73,79,30};
vector<int> param1 {5,69,28,1,84,14,11,87,11,55};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
... |
MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING{
static int f_gold ( String str ) {
int n = str . length ( ) ;
int res = - 1 ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ )... | def f_gold ( str ) :
n = len ( str )
res = - 1
for i in range ( 0 , n - 1 ) :
for j in range ( i + 1 , n ) :
if ( str [ i ] == str [ j ] ) :
res = max ( res , abs ( j - i - 1 ) )
return res
|
using namespace std;
int f_gold ( string & str ) {
int n = str . length ( );
int res = - 1;
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) if ( str [ i ] == str [ j ] ) res = max ( res, abs ( j - i - 1 ) );
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("cI");
param0.add("76478");
param0.add("1");
param0.add("tr");
param0.add("10");
param0.add("01");
param0.add("Rmhzp");
param0.add("5784080133917");
param0.add("11... |
if __name__ == '__main__':
param = [
('cI',),
('76478',),
('1',),
('tr',),
('10',),
('01',),
('Rmhzp',),
('5784080133917',),
('1100',),
('OK',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*paramete... |
int main() {
int n_success = 0;
vector<string> param0 {"cI","76478","1","tr","10","01","Rmhzp","5784080133917","1100","OK"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " <... |
CHECK_ARRAY_MAJORITY_ELEMENT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_ARRAY_MAJORITY_ELEMENT{
static boolean f_gold ( int a [ ] , int n ) {
HashMap < Integer , Integer > mp = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) if ( mp . containsKey... | null |
using namespace std;
bool f_gold ( int a [ ], int n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ a [ i ] ] ++;
for ( auto x : mp ) if ( x . second >= n / 2 ) return true;
return false;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,14,20,26,32,33,34,35,35,49,51,55,57,64,64,68,70,72,74,77,78,78,78,80,91,91,94});
param0.add(new int[]{-14,-98,-36,68,-20,18,16,-50,66,98,12,-2,-68});
param0.add(new int[]{0,0... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,14,20,26,32,33,34,35,35,49,51,55,57,64,64,68,70,72,74,77,78,78,78,80,91,91,94},{-14,-98,-36,68,-20,18,16,-50,66,98,12,-2,-68},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,96,94,67,87,65,27,21,60,49,73,85,9,17,72,3,73,69... |
COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW{
static int f_gold ( int a , int b ) {
return ( a + b ) / 2 ;
}
| from math import floor
def f_gold ( a , b ) :
return floor ( ( a + b ) / 2 )
|
using namespace std;
int f_gold ( int a, int b ) {
return ( a + b ) / 2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(6);
param0.add(75);
param0.add(51);
param0.add(19);
param0.add(82);
param0.add(72);
param0.add(48);
param0.add(12);
param0.add(41);
List<In... |
if __name__ == '__main__':
param = [
(1,44,),
(6,61,),
(75,20,),
(51,17,),
(19,25,),
(82,98,),
(72,21,),
(48,41,),
(12,17,),
(41,80,)
]
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 {1,6,75,51,19,82,72,48,12,41};
vector<int> param1 {44,61,20,17,25,98,21,41,17,80};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
COST_BALANCE_PARANTHESES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COST_BALANCE_PARANTHESES{
static int f_gold ( String s ) {
if ( s . length ( ) == 0 ) System . out . println ( 0 ) ;
int ans = 0 ;
int o = 0 , c = 0 ;
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
... | def f_gold ( s ) :
if ( len ( s ) == 0 ) :
print ( 0 )
ans = 0
o = 0
c = 0
for i in range ( len ( s ) ) :
if ( s [ i ] == '(' ) :
o += 1
if ( s [ i ] == ')' ) :
c += 1
if ( o != c ) :
return - 1
a = [ 0 for i in range ( len ( s ) ) ]
... |
using namespace std;
int f_gold ( string s ) {
if ( s . length ( ) == 0 ) cout << 0 << endl;
int ans = 0;
int o = 0, c = 0;
for ( int i = 0;
i < s . length ( );
i ++ ) {
if ( s [ i ] == '(' ) o ++;
if ( s [ i ] == ')' ) c ++;
}
if ( o != c ) return - 1;
int a [ s . size ( ) ];
if ( s [ 0 ] ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("()");
param0.add("))((");
param0.add("())");
param0.add("(()");
param0.add("(()()())");
param0.add("))())(()(())");
param0.add("))(())((");
param0.add("49");
para... |
if __name__ == '__main__':
param = [
('()',),
('))((',),
('())',),
('(()',),
('(()()())',),
('))())(()(())',),
('))(())((',),
('49',),
('00001111',),
('KDahByG ',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set)... |
int main() {
int n_success = 0;
vector<string> param0 {"()","))((","())","(()","(()()())","))())(()(())","))(())((","49","00001111","KDahByG "};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << ... |
PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE{
public static int f_gold ( int arr [ ] , int n ) {
int l = 0 , sum = 0 , ans = 360 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
sum += arr [ i ] ... | def f_gold ( arr , n ) :
l = 0
_sum = 0
ans = 360
for i in range ( n ) :
_sum += arr [ i ]
while _sum >= 180 :
ans = min ( ans , 2 * abs ( 180 - _sum ) )
_sum -= arr [ l ]
l += 1
ans = min ( ans , 2 * abs ( 180 - _sum ) )
return ans
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int l = 0, sum = 0, ans = 360;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ];
while ( sum >= 180 ) {
ans = min ( ans, 2 * abs ( 180 - sum ) );
sum -= arr [ l ];
l ++;
}
ans = min ( ans, 2 * abs ( 180 - sum ) );
}
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,4,5,5,13,14,14,16,19,20,30,31,32,33,35,38,38,42,44,44,48,48,52,58,60,64,65,66,68,69,70,70,71,72,73,79,81,83,83,84,86,87,88,88,91,92,95,95,98});
param0.add(new int[]{-56,88,-50,70... |
if __name__ == '__main__':
param = [
([4, 4, 5, 5, 13, 14, 14, 16, 19, 20, 30, 31, 32, 33, 35, 38, 38, 42, 44, 44, 48, 48, 52, 58, 60, 64, 65, 66, 68, 69, 70, 70, 71, 72, 73, 79, 81, 83, 83, 84, 86, 87, 88, 88, 91, 92, 95, 95, 98],27,),
([-56, 88, -50, 70, 20, 58, 42, -56, -52, -78, 98, 20, -26, 4, 20, -66... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,4,5,5,13,14,14,16,19,20,30,31,32,33,35,38,38,42,44,44,48,48,52,58,60,64,65,66,68,69,70,70,71,72,73,79,81,83,83,84,86,87,88,88,91,92,95,95,98},{-56,88,-50,70,20,58,42,-56,-52,-78,98,20,-26,4,20,-66,-46,-58,74,74,-72,2,16,-78,-4,10,58,60,-46,-2,32,-9... |
WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1{
static boolean f_gold ( int x ) {
return x != 0 && ( ( x & ( x - 1 ) ) == 0 ) ;
}
| def f_gold ( x ) :
return ( x and ( not ( x & ( x - 1 ) ) ) )
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(2);
param0.add(8);
param0.add(1024);
param0.add(24);
param0.add(7);
param0.add(46);
param0.add(61);
param0.add(73);
param0.add(66);
for(int... |
if __name__ == '__main__':
param = [
(1,),
(2,),
(8,),
(1024,),
(24,),
(7,),
(46,),
(61,),
(73,),
(66,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pr... | null |
HARDY_RAMANUJAN_THEOREM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HARDY_RAMANUJAN_THEOREM{
static int f_gold ( int n ) {
int count = 0 ;
if ( n % 2 == 0 ) {
count ++ ;
while ( n % 2 == 0 ) n = n / 2 ;
}
for ( int i = 3 ;
i <= Math . sqrt ( n ) ;
i = i + 2 ) {... | import math
def f_gold ( n ) :
count = 0
if ( n % 2 == 0 ) :
count = count + 1
while ( n % 2 == 0 ) :
n = int ( n / 2 )
i = 3
while ( i <= int ( math.sqrt ( n ) ) ) :
if ( n % i == 0 ) :
count = count + 1
while ( n % i == 0 ) :
... |
using namespace std;
int f_gold ( int n ) {
int count = 0;
if ( n % 2 == 0 ) {
count ++;
while ( n % 2 == 0 ) n = n / 2;
}
for ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
if ( n % i == 0 ) {
count ++;
while ( n % i == 0 ) n = n / i;
}
}
if ( n > 2 ) count ++;
return count;... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(99);
param0.add(33);
param0.add(50);
param0.add(17);
param0.add(18);
param0.add(69);
param0.add(23);
param0.add(18);
param0.add(94);
param0.add(16);
for(i... |
if __name__ == '__main__':
param = [
(99,),
(33,),
(50,),
(17,),
(18,),
(69,),
(23,),
(18,),
(94,),
(16,)
]
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 {99,33,50,17,18,69,23,18,94,16};
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();
... |
GCD_ELEMENTS_GIVEN_RANGE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class GCD_ELEMENTS_GIVEN_RANGE{
static int f_gold ( int n , int m ) {
return ( n == m ) ? n : 1 ;
}
| def f_gold ( n , m ) :
return n if ( n == m ) else 1
|
using namespace std;
int f_gold ( int n, int m ) {
return ( n == m ) ? n : 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(22);
param0.add(17);
param0.add(74);
param0.add(93);
param0.add(56);
param0.add(5);
param0.add(5);
param0.add(9);
param0.add(98);
List<Int... |
if __name__ == '__main__':
param = [
(57,57,),
(22,22,),
(17,17,),
(74,74,),
(93,22,),
(56,54,),
(5,33,),
(5,68,),
(9,75,),
(98,21,)
]
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 {57,22,17,74,93,56,5,5,9,98};
vector<int> param1 {57,22,17,74,22,54,33,68,75,21};
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_MINIMUM_SUM_FACTORS_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MINIMUM_SUM_FACTORS_NUMBER{
static int f_gold ( int num ) {
int sum = 0 ;
for ( int i = 2 ;
i * i <= num ;
i ++ ) {
while ( num % i == 0 ) {
sum += i ;
num /= i ;
}
}
sum += nu... | def f_gold ( num ) :
sum = 0
i = 2
while ( i * i <= num ) :
while ( num % i == 0 ) :
sum += i
num /= i
i += 1
sum += num
return sum
|
using namespace std;
int f_gold ( int num ) {
int sum = 0;
for ( int i = 2;
i * i <= num;
i ++ ) {
while ( num % i == 0 ) {
sum += i;
num /= i;
}
}
sum += num;
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(83);
param0.add(88);
param0.add(60);
param0.add(6);
param0.add(26);
param0.add(98);
param0.add(38);
param0.add(90);
param0.add(76);
param0.add(66);
for(in... |
if __name__ == '__main__':
param = [
(83,),
(88,),
(60,),
(6,),
(26,),
(98,),
(38,),
(90,),
(76,),
(66,)
]
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 {83,88,60,6,26,98,38,90,76,66};
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();
... |
PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP{
static double f_gold ( int n ) {
return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 ) ;
}
| def f_gold ( n ) :
return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 )
|
using namespace std;
double f_gold ( int n ) {
return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(46);
param0.add(5);
param0.add(44);
param0.add(15);
param0.add(72);
param0.add(2);
param0.add(86);
param0.add(17);
param0.add(30);
param0.add(42);
for(int... |
if __name__ == '__main__':
param = [
(46,),
(5,),
(44,),
(15,),
(72,),
(2,),
(86,),
(17,),
(30,),
(42,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) ... |
int main() {
int n_success = 0;
vector<int> param0 {46,5,44,15,72,2,86,17,30,42};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results... |
GOLD_MINE_PROBLEM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class GOLD_MINE_PROBLEM{
static int f_gold ( int gold [ ] [ ] , int m , int n ) {
int goldTable [ ] [ ] = new int [ m ] [ n ] ;
for ( int [ ] rows : goldTable ) Arrays . fill ( rows , 0 ) ;
for ( int col = n - 1 ;... | def f_gold ( gold , m , n ) :
goldTable = [ [ 0 for i in range ( n ) ] for j in range ( m ) ]
for col in range ( n - 1 , - 1 , - 1 ) :
for row in range ( m ) :
if ( col == n - 1 ) :
right = 0
else :
right = goldTable [ row ] [ col + 1 ]
... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{19,20,23,25,28,35,35,40,45,46,48,54,57,59,74,76,78,82,84,86,87,90,91,96},new int[]{9,13,17,20,26,27,42,46,48,62,67,69,72,73,76,77,82,83,86,93,95,95,98,98},new int[]{2,1... |
if __name__ == '__main__':
param = [
([[19, 20, 23, 25, 28, 35, 35, 40, 45, 46, 48, 54, 57, 59, 74, 76, 78, 82, 84, 86, 87, 90, 91, 96], [9, 13, 17, 20, 26, 27, 42, 46, 48, 62, 67, 69, 72, 73, 76, 77, 82, 83, 86, 93, 95, 95, 98, 98], [2, 12, 18, 25, 29, 30, 31, 33, 39, 45, 48, 49, 56, 57, 60, 61, 64, 72, 73, 7... | null |
SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER{
static int f_gold ( int num ) {
int result = 0 ;
for ( int i = 2 ;
i <= Math . sqrt ( num ) ;
i ++ ) {
if ( num % i == 0 ) {
if ( i == ( num / i ) ... | import math
def f_gold ( num ) :
result = 0
i = 2
while i <= ( math.sqrt ( num ) ) :
if ( num % i == 0 ) :
if ( i == ( num / i ) ) :
result = result + i ;
else :
result = result + ( i + num / i ) ;
i = i + 1
return ( result + 1 ) ;... |
using namespace std;
int f_gold ( int num ) {
int result = 0;
for ( int i = 2;
i <= sqrt ( num );
i ++ ) {
if ( num % i == 0 ) {
if ( i == ( num / i ) ) result += i;
else result += ( i + num / i );
}
}
return ( result + 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(2);
param0.add(57);
param0.add(28);
param0.add(43);
param0.add(38);
param0.add(29);
param0.add(45);
param0.add(47);
param0.add(44);
param0.add(3);
for(int... |
if __name__ == '__main__':
param = [
(2,),
(57,),
(28,),
(43,),
(38,),
(29,),
(45,),
(47,),
(44,),
(3,)
]
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 {2,57,28,43,38,29,45,47,44,3};
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... |
COUNTS_PATHS_POINT_REACH_ORIGIN_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNTS_PATHS_POINT_REACH_ORIGIN_1{
static int f_gold ( int n , int m ) {
int dp [ ] [ ] = new int [ n + 1 ] [ m + 1 ] ;
for ( int i = 0 ;
i <= n ;
i ++ ) dp [ i ] [ 0 ] = 1 ;
for ( int i = 0 ;
i <= m ;... | null |
using namespace std;
int f_gold ( int n, int m ) {
int dp [ n + 1 ] [ m + 1 ];
for ( int i = 0;
i <= n;
i ++ ) dp [ i ] [ 0 ] = 1;
for ( int i = 0;
i <= m;
i ++ ) dp [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= m;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i ] [... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(55);
param0.add(74);
param0.add(76);
param0.add(6);
param0.add(2);
param0.add(36);
param0.add(40);
param0.add(14);
param0.add(42);
param0.add(62);
List<In... | null |
int main() {
int n_success = 0;
vector<int> param0 {55,74,76,6,2,36,40,14,42,62};
vector<int> param1 {30,15,57,90,64,1,71,56,4,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
... |
NEWMAN_CONWAY_SEQUENCE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NEWMAN_CONWAY_SEQUENCE_1{
static int f_gold ( int n ) {
int f [ ] = new int [ n + 1 ] ;
f [ 0 ] = 0 ;
f [ 1 ] = 1 ;
f [ 2 ] = 1 ;
int i ;
for ( i = 3 ;
i <= n ;
i ++ ) f [ i ] = f [ f [ i - 1 ] ] +... | null |
using namespace std;
int f_gold ( int n ) {
int f [ n + 1 ];
int i;
f [ 0 ] = 0;
f [ 1 ] = 1;
f [ 2 ] = 1;
for ( i = 3;
i <= n;
i ++ ) f [ i ] = f [ f [ i - 1 ] ] + f [ i - f [ i - 1 ] ];
return f [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(39);
param0.add(93);
param0.add(3);
param0.add(28);
param0.add(23);
param0.add(95);
param0.add(41);
param0.add(31);
param0.add(46);
param0.add(29);
for(in... | null |
int main() {
int n_success = 0;
vector<int> param0 {39,93,3,28,23,95,41,31,46,29};
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_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS{
static int f_gold ( int A ) {
int n = 2 * A ;
int [ ] dpArray = new int [ n + 1 ] ;
dpArray [ 0 ] = 1 ;
dpArray [ 2 ] = 1 ;
for ( int i = 4 ;
i... | def f_gold ( A ) :
n = 2 * A
dpArray = [ 0 ] * ( n + 1 )
dpArray [ 0 ] = 1
dpArray [ 2 ] = 1
for i in range ( 4 , n + 1 , 2 ) :
for j in range ( 0 , i - 1 , 2 ) :
dpArray [ i ] += ( dpArray [ j ] * dpArray [ i - 2 - j ] )
return int ( dpArray [ n ] )
|
using namespace std;
int f_gold ( int A ) {
int n = 2 * A;
int dpArray [ n + 1 ] = {
0 };
dpArray [ 0 ] = 1;
dpArray [ 2 ] = 1;
for ( int i = 4;
i <= n;
i += 2 ) {
for ( int j = 0;
j < i - 1;
j += 2 ) {
dpArray [ i ] += ( dpArray [ j ] * dpArray [ i - 2 - j ] );
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(32);
param0.add(52);
param0.add(52);
param0.add(32);
param0.add(73);
param0.add(31);
param0.add(29);
param0.add(75);
param0.add(39);
param0.add(49);
for(i... |
if __name__ == '__main__':
param = [
(32,),
(52,),
(52,),
(32,),
(73,),
(31,),
(29,),
(75,),
(39,),
(49,)
]
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 {32,52,52,32,73,31,29,75,39,49};
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_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY{
static int f_gold ( int [ ] arr , int n ) {
int res = 0 ;
HashMap < Integer , Integer > m = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ... | def f_gold ( arr , n ) :
res = 0
m = dict ( )
for i in range ( n ) :
Sum = 0
for j in range ( i , n ) :
Sum += arr [ j ]
m [ Sum ] = m.get ( Sum , 0 ) + 1
for x in m :
if m [ x ] == 1 :
res += x
return res
|
using namespace std;
long long int f_gold ( int arr [ ], int n ) {
int res = 0;
unordered_map < int, int > m;
for ( int i = 0;
i < n;
i ++ ) {
int sum = 0;
for ( int j = i;
j < n;
j ++ ) {
sum += arr [ j ];
m [ sum ] ++;
}
}
for ( auto x : m ) if ( x . second == 1 ) res +=... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,24,34,35,36,40,49,51,53,74,78});
param0.add(new int[]{-34,60,32});
param0.add(new int[]{0});
param0.add(new int[]{80,64,10,82,14,75,51,91,1,25,98,22,36,27,21,31,93,6,52,9... |
if __name__ == '__main__':
param = [
([7, 24, 34, 35, 36, 40, 49, 51, 53, 74, 78],9,),
([-34, 60, 32],2,),
([0],0,),
([80, 64, 10, 82, 14, 75, 51, 91, 1, 25, 98, 22, 36, 27, 21, 31, 93, 6, 52, 91, 80, 8, 62, 95, 10, 71, 40, 80, 35, 86, 85, 26, 74, 72, 64, 88, 4, 71, 4, 16],31,),
([-94, -46, -36... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,24,34,35,36,40,49,51,53,74,78},{-34,60,32},{0},{80,64,10,82,14,75,51,91,1,25,98,22,36,27,21,31,93,6,52,91,80,8,62,95,10,71,40,80,35,86,85,26,74,72,64,88,4,71,4,16},{-94,-46,-36,-24,-22,0,10,14,34,34,90,92,98},{1,0,1,0,1,1,1,1,1,1,1,0,1,0,0,0,1,0,0,... |
FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES{
static int f_gold ( int n ) {
int DP [ ] = new int [ n + 1 ] ;
DP [ 0 ] = 0 ;
DP [ 1 ] = 1 ;
for ( int i = 2 ;
i <= n ;
i ++ ) {
if ( i % 2 == 0 ) DP ... | def f_gold ( n ) :
DP = [ 0 ] * ( n + 1 )
DP [ 0 ] = 0
DP [ 1 ] = 1
for i in range ( 2 , n + 1 ) :
if ( int ( i % 2 ) == 0 ) :
DP [ i ] = DP [ int ( i / 2 ) ]
else :
DP [ i ] = ( DP [ int ( ( i - 1 ) / 2 ) ] + DP [ int ( ( i + 1 ) / 2 ) ] )
return DP [ n ]
|
using namespace std;
int f_gold ( int n ) {
int DP [ n + 1 ];
DP [ 0 ] = 0;
DP [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) {
if ( i % 2 == 0 ) DP [ i ] = DP [ i / 2 ];
else DP [ i ] = DP [ ( i - 1 ) / 2 ] + DP [ ( i + 1 ) / 2 ];
}
return DP [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(37);
param0.add(24);
param0.add(13);
param0.add(56);
param0.add(26);
param0.add(67);
param0.add(82);
param0.add(60);
param0.add(64);
param0.add(65);
for(i... |
if __name__ == '__main__':
param = [
(37,),
(24,),
(13,),
(56,),
(26,),
(67,),
(82,),
(60,),
(64,),
(65,)
]
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 {37,24,13,56,26,67,82,60,64,65};
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_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING{
static int f_gold ( int n ) {
int res [ ] = new int [ n + 1 ] ;
res [ 0 ] = 0 ;
res [ 1 ] = 1 ;
for ( int i = 2 ;
i <= n ;
i ++ ) res [ i ] = Math . ma... | def f_gold ( n ) :
res = list ( )
res.append ( 0 )
res.append ( 1 )
i = 2
while i < n + 1 :
res.append ( max ( i , ( res [ int ( i / 2 ) ] + res [ int ( i / 3 ) ] + res [ int ( i / 4 ) ] + res [ int ( i / 5 ) ] ) ) )
i = i + 1
return res [ n ]
|
using namespace std;
int f_gold ( int n ) {
int res [ n + 1 ];
res [ 0 ] = 0;
res [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) res [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) );
return res [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(3);
param0.add(19);
param0.add(39);
param0.add(89);
param0.add(96);
param0.add(68);
param0.add(48);
param0.add(5);
param0.add(3);
param0.add(4);
for(int i... |
if __name__ == '__main__':
param = [
(3,),
(19,),
(39,),
(89,),
(96,),
(68,),
(48,),
(5,),
(3,),
(4,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
prin... |
int main() {
int n_success = 0;
vector<int> param0 {3,19,39,89,96,68,48,5,3,4};
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();
ret... |
NEXT_POWER_OF_2_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NEXT_POWER_OF_2_1{
static int f_gold ( int n ) {
int p = 1 ;
if ( n > 0 && ( n & ( n - 1 ) ) == 0 ) return n ;
while ( p < n ) p <<= 1 ;
return p ;
}
| def f_gold ( n ) :
p = 1
if ( n and not ( n & ( n - 1 ) ) ) :
return n
while ( p < n ) :
p <<= 1
return p ;
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int p = 1;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( p < n ) p <<= 1;
return p;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(8);
param0.add(79);
param0.add(31);
param0.add(63);
param0.add(18);
param0.add(2);
param0.add(6);
param0.add(85);
param0.add(29);
param0.add(8);
for(int i... |
if __name__ == '__main__':
param = [
(8,),
(79,),
(31,),
(63,),
(18,),
(2,),
(6,),
(85,),
(29,),
(8,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
prin... |
int main() {
int n_success = 0;
vector<int> param0 {8,79,31,63,18,2,6,85,29,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();
ret... |
COUNT_PAIRS_DIFFERENCE_EQUAL_K |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_PAIRS_DIFFERENCE_EQUAL_K{
static int f_gold ( int arr [ ] , int n , int k ) {
int count = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = i + 1 ;
j < n ;
j ++ ) if ( arr [ i ] - arr ... | def f_gold ( arr , n , k ) :
count = 0
for i in range ( 0 , n ) :
for j in range ( i + 1 , n ) :
if arr [ i ] - arr [ j ] == k or arr [ j ] - arr [ i ] == k :
count += 1
return count
|
using namespace std;
int f_gold ( int arr [ ], int n, int k ) {
int count = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) if ( arr [ i ] - arr [ j ] == k || arr [ j ] - arr [ i ] == k ) count ++;
}
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{9,14,17,19,22,23,23,27,30,31,34,37,37,39,39,42,57,61,68,73,77,79,91,96,97});
param0.add(new int[]{-78,-42,28,-88,18,-52});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,... |
if __name__ == '__main__':
param = [
([9, 14, 17, 19, 22, 23, 23, 27, 30, 31, 34, 37, 37, 39, 39, 42, 57, 61, 68, 73, 77, 79, 91, 96, 97],19,19,),
([-78, -42, 28, -88, 18, -52],3,4,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1],16,14,),
([8, 46, 57, 28, 80, 2, 75, 57, 83, 45, 32, 49, 77, 3... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,14,17,19,22,23,23,27,30,31,34,37,37,39,39,42,57,61,68,73,77,79,91,96,97},{-78,-42,28,-88,18,-52},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{8,46,57,28,80,2,75,57,83,45,32,49,77,30,94,33,23,29,35,81,85},{-90,-72,-72,-62,-62,-54,-54,-52,-48,-38,-22,-22,-22... |
MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION{
static int f_gold ( int n ) {
int table [ ] = new int [ n + 1 ] ;
for ( int i = 0 ;
i <= n ;
i ++ ) table [ i ] = n - i ;
for ( int i = n ;
i >= 1 ;
i --... | def f_gold ( n ) :
table = [ 0 ] * ( n + 1 )
for i in range ( n + 1 ) :
table [ i ] = n - i
for i in range ( n , 0 , - 1 ) :
if ( not ( i % 2 ) ) :
table [ i // 2 ] = min ( table [ i ] + 1 , table [ i // 2 ] )
if ( not ( i % 3 ) ) :
table [ i // 3 ] = min ( ta... |
using namespace std;
int f_gold ( int n ) {
int table [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) table [ i ] = n - i;
for ( int i = n;
i >= 1;
i -- ) {
if ( ! ( i % 2 ) ) table [ i / 2 ] = min ( table [ i ] + 1, table [ i / 2 ] );
if ( ! ( i % 3 ) ) table [ i / 3 ] = min ( table [ i ] + 1, table ... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(59);
param0.add(7);
param0.add(90);
param0.add(78);
param0.add(49);
param0.add(15);
param0.add(45);
param0.add(56);
param0.add(7);
param0.add(70);
for(int... |
if __name__ == '__main__':
param = [
(59,),
(7,),
(90,),
(78,),
(49,),
(15,),
(45,),
(56,),
(7,),
(70,)
]
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 {59,7,90,78,49,15,45,56,7,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();
r... |
PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1{
static int f_gold ( int n ) {
int res = 1 , i ;
for ( i = 2 ;
i <= n ;
i ++ ) res *= i ;
return res ;
}
| def f_gold ( n ) :
return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ;
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(28);
param0.add(23);
param0.add(79);
param0.add(52);
param0.add(42);
param0.add(79);
param0.add(77);
param0.add(99);
param0.add(70);
for(i... |
if __name__ == '__main__':
param = [
(57,),
(28,),
(23,),
(79,),
(52,),
(42,),
(79,),
(77,),
(99,),
(70,)
]
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 {57,28,23,79,52,42,79,77,99,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();
... |
MAXIMUM_DIFFERENCE_BETWEEN_FREQUENCY_OF_TWO_ELEMENTS_SUCH_THAT_ELEMENT_HAVING_GREATER_FREQUENCY_IS_ALSO_GREATER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_DIFFERENCE_BETWEEN_FREQUENCY_OF_TWO_ELEMENTS_SUCH_THAT_ELEMENT_HAVING_GREATER_FREQUENCY_IS_ALSO_GREATER{
static int f_gold ( int arr [ ] , int n ) {
Map < Integer , Integer > freq = new HashMap < > ( ) ;... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > freq;
for ( int i = 0;
i < n;
i ++ ) freq [ arr [ i ] ] ++;
int ans = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = 0;
j < n;
j ++ ) {
if ( freq [ arr [ i ] ] > freq [ arr [ j ] ] && arr [ i ] > ar... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,6,16,22,33,37,46,49,50,51,65,82,94});
param0.add(new int[]{-4,-16,92,-28,-44,50,54,24,-28,-32,20,-94,-78,-20,26,90,-90,10,36,-52,60,-96,-64,-34,10,-12,86,78,32,-46,92,-66,18,-78,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,6,16,22,33,37,46,49,50,51,65,82,94},{-4,-16,92,-28,-44,50,54,24,-28,-32,20,-94,-78,-20,26,90,-90,10,36,-52,60,-96,-64,-34,10,-12,86,78,32,-46,92,-66,18,-78,-28,14,-26,26,4,16,-96,86,-50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,... |
PYTHAGOREAN_QUADRUPLE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PYTHAGOREAN_QUADRUPLE{
static Boolean f_gold ( int a , int b , int c , int d ) {
int sum = a * a + b * b + c * c ;
if ( d * d == sum ) return true ;
else return false ;
}
| def f_gold ( a , b , c , d ) :
sum = a * a + b * b + c * c ;
if ( d * d == sum ) :
return True
else :
return False
|
using namespace std;
bool f_gold ( int a, int b, int c, int d ) {
int sum = a * a + b * b + c * c;
if ( d * d == sum ) return true;
else return false;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(3);
param0.add(0);
param0.add(-1);
param0.add(82);
param0.add(14);
param0.add(6);
param0.add(13);
param0.add(96);
param0.add(70);
List<Inte... |
if __name__ == '__main__':
param = [
(1,1,1,3,),
(3,2,5,38,),
(0,0,0,0,),
(-1,-1,-1,1,),
(82,79,6,59,),
(14,57,35,29,),
(6,96,45,75,),
(13,7,3,63,),
(96,65,72,93,),
(70,33,6,2,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*p... |
int main() {
int n_success = 0;
vector<int> param0 {1,3,0,-1,82,14,6,13,96,70};
vector<int> param1 {1,2,0,-1,79,57,96,7,65,33};
vector<int> param2 {1,5,0,-1,6,35,45,3,72,6};
vector<int> param3 {3,38,0,1,59,29,75,63,93,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i... |
PROGRAM_CHECK_PLUS_PERFECT_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_CHECK_PLUS_PERFECT_NUMBER{
static boolean f_gold ( int x ) {
int temp = x ;
int n = 0 ;
while ( x != 0 ) {
x /= 10 ;
n ++ ;
}
x = temp ;
int sum = 0 ;
while ( x != 0 ) {
sum += Ma... | import math
def f_gold ( x ) :
temp = x
n = 0
while ( x != 0 ) :
x = x // 10
n = n + 1
x = temp
sm = 0
while ( x != 0 ) :
sm = sm + ( int ) ( math.pow ( x % 10 , n ) )
x = x // 10
return ( sm == temp )
|
using namespace std;
bool f_gold ( int x ) {
int temp = x;
int n = 0;
while ( x != 0 ) {
x /= 10;
n ++;
}
x = temp;
int sum = 0;
while ( x != 0 ) {
sum += pow ( x % 10, n );
x /= 10;
}
return ( sum == temp );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(371);
param0.add(9474);
param0.add(85);
param0.add(35);
param0.add(54);
param0.add(17);
param0.add(97);
param0.add(63);
param0.add(12);
param0.add(43);
fo... |
if __name__ == '__main__':
param = [
(371,),
(9474,),
(85,),
(35,),
(54,),
(17,),
(97,),
(63,),
(12,),
(43,)
]
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 {371,9474,85,35,54,17,97,63,12,43};
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_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION{
static int f_gold ( int a [ ] , int n , int k ) {
int max_so_far = 0 ;
int INT_MIN , max_ending_here = 0 ;
for ( int i = 0 ;
i < n * k ;
i ++ ) ... | def f_gold ( a , n , k ) :
max_so_far = - 2147483648
max_ending_here = 0
for i in range ( n * k ) :
max_ending_here = max_ending_here + a [ i % n ]
if ( max_so_far < max_ending_here ) :
max_so_far = max_ending_here
if ( max_ending_here < 0 ) :
max_ending_here ... |
using namespace std;
int f_gold ( int a [ ], int n, int k ) {
int max_so_far = INT_MIN, max_ending_here = 0;
for ( int i = 0;
i < n * k;
i ++ ) {
max_ending_here = max_ending_here + a [ i % n ];
if ( max_so_far < max_ending_here ) max_so_far = max_ending_here;
if ( max_ending_here < 0 ) max_ending_... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,6,12,20,23,28,33,37,47,51,53,56,63,65,65,68,69,76,76,78,83});
param0.add(new int[]{68,10,52,-44,34,-4,-34,2,50,-60,50,94,-98,-98,-44,-36,-4,-62,-2,-92,-70,-48,-78,-10,94});
p... |
if __name__ == '__main__':
param = [
([5, 6, 12, 20, 23, 28, 33, 37, 47, 51, 53, 56, 63, 65, 65, 68, 69, 76, 76, 78, 83],18,20,),
([68, 10, 52, -44, 34, -4, -34, 2, 50, -60, 50, 94, -98, -98, -44, -36, -4, -62, -2, -92, -70, -48, -78, -10, 94],22,22,),
([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 {{5,6,12,20,23,28,33,37,47,51,53,56,63,65,65,68,69,76,76,78,83},{68,10,52,-44,34,-4,-34,2,50,-60,50,94,-98,-98,-44,-36,-4,-62,-2,-92,-70,-48,-78,-10,94},{0,0,0,0,0,0,0,0,0,0,0,0,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},{71,59,21,82,73,29,... |
FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1{
static boolean f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n ) {
int i = 0 ;
int j = 0 ;
for ( i = 0 ;
i < n ;
i ++ ) {
for ( j = 0 ;
... | def f_gold ( arr1 , arr2 , m , n ) :
i = 0
j = 0
for i in range ( n ) :
for j in range ( m ) :
if ( arr2 [ i ] == arr1 [ j ] ) :
break
if ( j == m ) :
return 0
return 1
|
using namespace std;
bool f_gold ( int arr1 [ ], int arr2 [ ], int m, int n ) {
int i = 0;
int j = 0;
for ( i = 0;
i < n;
i ++ ) {
for ( j = 0;
j < m;
j ++ ) {
if ( arr2 [ i ] == arr1 [ j ] ) break;
}
if ( j == m ) return 0;
}
return 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,10,10,10,13,17,23,24,25,28,30,33,37,49,49,50,57,60,60,63,63,64,65,65,72,81,84,85,85,94,96});
param0.add(new int[]{12,30,-94,-92,-62,-18,-56,44,-50,-92,6,2,56,-90,0,0,18,86,-58,58... |
if __name__ == '__main__':
param = [
([7, 10, 10, 10, 13, 17, 23, 24, 25, 28, 30, 33, 37, 49, 49, 50, 57, 60, 60, 63, 63, 64, 65, 65, 72, 81, 84, 85, 85, 94, 96],
[10,13,17,63],29,4,),
([12, 30, -94, -92, -62, -18, -56, 44, -50, -92, 6, 2, 56, -90, 0, 0, 18, 86, -58, 58, -54, 62, -94, 94, 0, 8, 82, -6... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,10,10,10,13,17,23,24,25,28,30,33,37,49,49,50,57,60,60,63,63,64,65,65,72,81,84,85,85,94,96},{12,30,-94,-92,-62,-18,-56,44,-50,-92,6,2,56,-90,0,0,18,86,-58,58,-54,62,-94,94,0,8,82,-68,-88,-18,8,-80,-42,18,62,-8,56,-76,-42,56,44,-2,-20,62,-14,74,-86,-... |
NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K{
static int f_gold ( int arr [ ] , int n , int sum ) {
HashMap < Integer , Integer > prevSum = new HashMap < > ( ) ;
int res = 0 ;
int currsum = 0 ;
for ( int i = 0 ;
... | null |
using namespace std;
int f_gold ( int arr [ ], int n, int sum ) {
unordered_map < int, int > prevSum;
int res = 0;
int currsum = 0;
for ( int i = 0;
i < n;
i ++ ) {
currsum += arr [ i ];
if ( currsum == sum ) res ++;
if ( prevSum . find ( currsum - sum ) != prevSum . end ( ) ) res += ( prevSum ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{9,18,27,52,70,91});
param0.add(new int[]{60,-88,-48,90,-28,20,18,34,-58,76,-78,-18,68,-48,8,34,60,-34,-10,32,78,-84,-22,54,-18,-82,-70,-58,-20,-76,88,-30,-6,68});
param0.add(ne... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,18,27,52,70,91},{60,-88,-48,90,-28,20,18,34,-58,76,-78,-18,68,-48,8,34,60,-34,-10,32,78,-84,-22,54,-18,-82,-70,-58,-20,-76,88,-30,-6,68},{0,0,0,0,0,0,0,0,1,1,1,1},{67,39,22,32,59,44,86,26,46,60,99,12,32,46,16,22,45,85,21,92,77,50,65,23,93,26,23,20,... |
FIND_PAIR_MAXIMUM_GCD_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_PAIR_MAXIMUM_GCD_ARRAY{
public static int f_gold ( int arr [ ] , int n ) {
int high = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) high = Math . max ( high , arr [ i ] ) ;
int divisors [ ] = new int [ high ... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int high = 0;
for ( int i = 0;
i < n;
i ++ ) high = max ( high, arr [ i ] );
int divisors [ high + 1 ] = {
0 };
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = 1;
j <= sqrt ( arr [ i ] );
j ++ ) {
if ( arr [ i ]... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,3,8,10,12,13,14,16,16,19,20,21,25,29,33,35,35,35,35,36,38,41,42,45,45,45,46,48,51,52,53,55,56,57,58,62,69,73,73,76,76,80,89,91,92,93,93,96});
param0.add(new int[]{12,52,-66,50,50... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,8,10,12,13,14,16,16,19,20,21,25,29,33,35,35,35,35,36,38,41,42,45,45,45,46,48,51,52,53,55,56,57,58,62,69,73,73,76,76,80,89,91,92,93,93,96},{12,52,-66,50,50,-78,-14,26,56,74,8,-58,58,-66,-58,-12,80},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... |
MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY{
static int f_gold ( Integer arr [ ] , int n ) {
Arrays . sort ( arr , Collections . reverseOrder ( ) ) ;
int [ ] dimension = {
0 , 0 };
for ( int i = 0 ... | def f_gold ( arr , n ) :
arr.sort ( reverse = True )
dimension = [ 0 , 0 ]
i = 0
j = 0
while ( i < n - 1 and j < 2 ) :
if ( arr [ i ] == arr [ i + 1 ] ) :
dimension [ j ] = arr [ i ]
j += 1
i += 1
i += 1
return ( dimension [ 0 ] * dimension [ 1... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n, greater < int > ( ) );
int dimension [ 2 ] = {
0, 0 };
for ( int i = 0, j = 0;
i < n - 1 && j < 2;
i ++ ) if ( arr [ i ] == arr [ i + 1 ] ) dimension [ j ++ ] = arr [ i ++ ];
return ( dimension [ 0 ] * dimension [ 1 ]... |
public static void main(String args[]) {
int n_success = 0;
List<Integer [ ]> param0 = new ArrayList<>();
param0.add(new Integer[]{1,5,6,8,9,11,12,14,16,17,24,25,36,40,44,47,49,51,51,52,67,68,72,74,81,82,83,84,92,95,95,96,99});
param0.add(new Integer[]{-54,-82,-92,-32});
param0.add(new Integer[]{0,... |
if __name__ == '__main__':
param = [
([1, 5, 6, 8, 9, 11, 12, 14, 16, 17, 24, 25, 36, 40, 44, 47, 49, 51, 51, 52, 67, 68, 72, 74, 81, 82, 83, 84, 92, 95, 95, 96, 99],27,),
([-54, -82, -92, -32],2,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1],15,),
([16, 62, 17, 15, 26, 45, 2, 17, 65, 9... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,6,8,9,11,12,14,16,17,24,25,36,40,44,47,49,51,51,52,67,68,72,74,81,82,83,84,92,95,95,96,99},{-54,-82,-92,-32},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{16,62,17,15,26,45,2,17,65,94,96,30,68,44,96,60,99},{-88,-82,-78,-52,-50,-42,-34,-28,16,46,54,56,66... |
INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
int neg = 0 , pos = 0 ;
int sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
sum += arr [ i ] ;
if ... | def f_gold ( arr , n ) :
neg = 0
pos = 0
sum = 0
for i in range ( 0 , n ) :
sum += arr [ i ]
if ( arr [ i ] < 0 ) :
neg += 1
else :
pos += 1
return ( sum / abs ( neg - pos ) )
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int neg = 0, pos = 0;
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ];
if ( arr [ i ] < 0 ) neg ++;
else pos ++;
}
return ( sum / abs ( neg - pos ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{49,98});
param0.add(new int[]{82,66,-68,24,-10});
param0.add(new int[]{0,0,0,0,0,0,0,1,1,1,1,1,1,1});
param0.add(new int[]{56,3,18,5,20,56,47,29,60,98,60,40,42,2,54,56,91,8... |
if __name__ == '__main__':
param = [
([49, 98],1,),
([82, 66, -68, 24, -10],2,),
([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1],8,),
([56, 3, 18, 5, 20, 56, 47, 29, 60, 98, 60, 40, 42, 2, 54, 56, 91, 8, 93, 14, 31, 27, 61, 49, 23, 12, 71],25,),
([-94, -94, -92, -86, -50, -48, -6, 8, 28, 40, 44, 58... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{49,98},{82,66,-68,24,-10},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{56,3,18,5,20,56,47,29,60,98,60,40,42,2,54,56,91,8,93,14,31,27,61,49,23,12,71},{-94,-94,-92,-86,-50,-48,-6,8,28,40,44,58,62,72,94},{0,0,1,0,1,0,1,1,1,0,1,0,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,1,0,1,... |
N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN |
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{
public static int f_gold ( int n ) {
int count = 0 ;
for ( int curr = 1 ;
;
curr ++ ) {
int sum = 0 ;
for ( int x = curr ;
x > 0 ;
x = x / 10 ) sum =... | import itertools
def f_gold ( n ) :
count = 0
for curr in itertools.count ( ) :
sum = 0
x = curr
while ( x ) :
sum = sum + x % 10
x = x // 10
if ( sum == 10 ) :
count = count + 1
if ( count == n ) :
return curr
return -... |
using namespace std;
int f_gold ( int n ) {
int count = 0;
for ( int curr = 1;
;
curr ++ ) {
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(37);
param0.add(13);
param0.add(51);
param0.add(69);
param0.add(76);
param0.add(10);
param0.add(97);
param0.add(40);
param0.add(69);
param0.add(4);
for(in... |
if __name__ == '__main__':
param = [
(37,),
(13,),
(51,),
(69,),
(76,),
(10,),
(97,),
(40,),
(69,),
(4,)
]
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 {37,13,51,69,76,10,97,40,69,4};
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();
... |
MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1{
public static int f_gold ( int mat [ ] [ ] , int n ) {
int i_des , j_des , q ;
int tot_energy = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = 0 ;
j... | def f_gold ( mat , n ) :
tot_energy = 0
for i in range ( n ) :
for j in range ( n ) :
q = mat [ i ] [ j ] // n
i_des = q
j_des = mat [ i ] [ j ] - ( n * q )
tot_energy += ( abs ( i_des - i ) + abs ( j_des - j ) )
return tot_energy
| null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{4,7,10,11,14,22,27,43,45,47,48,48,49,49,51,54,56,57,59,62,63,64,66,79,82,83,87,96,97,97,98},new int[]{1,1,10,13,14,18,31,33,35,37,37,42,43,44,46,54,60,61,63,63,67,67,74... |
if __name__ == '__main__':
param = [
([[4, 7, 10, 11, 14, 22, 27, 43, 45, 47, 48, 48, 49, 49, 51, 54, 56, 57, 59, 62, 63, 64, 66, 79, 82, 83, 87, 96, 97, 97, 98], [1, 1, 10, 13, 14, 18, 31, 33, 35, 37, 37, 42, 43, 44, 46, 54, 60, 61, 63, 63, 67, 67, 74, 76, 81, 83, 88, 91, 91, 96, 97], [2, 3, 4, 10, 11, 13, 17... | null |
SUM_OF_ALL_SUBSTRINGS_OF_A_STRING_REPRESENTING_A_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_OF_ALL_SUBSTRINGS_OF_A_STRING_REPRESENTING_A_NUMBER{
public static int f_gold ( String num ) {
int n = num . length ( ) ;
int sumofdigit [ ] = new int [ n ] ;
sumofdigit [ 0 ] = num . charAt ( 0 ) - '0' ... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("rA");
param0.add("552541909988");
param0.add("000110001");
param0.add("s wXTz");
param0.add("4");
param0.add("0001");
param0.add("EdZPQyLD F");
param0.add("926277661"... | null | null |
LOWER_CASE_UPPER_CASE_INTERESTING_FACT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LOWER_CASE_UPPER_CASE_INTERESTING_FACT{
static String f_gold ( char [ ] in ) {
for ( int i = 0 ;
i < in . length ;
i ++ ) {
if ( 'a' <= in [ i ] & in [ i ] <= 'z' ) {
in [ i ] = ( char ) ( in [ i ]... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<char [ ]> param0 = new ArrayList<>();
param0.add(new char[]{'B','N','O','p','t'});
param0.add(new char[]{'2','8','2','7','3','3','1','2','1','4','1','0','8','1','0','1','1','8','2','9','2','0','6','3','0','4','2','3','3','4','6','7','1','... | null | null |
NUMBER_TRIANGLES_N_MOVES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_TRIANGLES_N_MOVES{
public static int f_gold ( int n ) {
int [ ] answer = new int [ n + 1 ] ;
answer [ 0 ] = 1 ;
for ( int i = 1 ;
i <= n ;
i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2 ;
return... | def f_gold ( n ) :
answer = [ None ] * ( n + 1 ) ;
answer [ 0 ] = 1 ;
i = 1
while i <= n :
answer [ i ] = answer [ i - 1 ] * 3 + 2 ;
i = i + 1
return answer [ n ] ;
|
using namespace std;
int f_gold ( int n ) {
int answer [ n + 1 ] = {
0 };
answer [ 0 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2;
return answer [ n ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(33);
param0.add(72);
param0.add(81);
param0.add(93);
param0.add(8);
param0.add(76);
param0.add(97);
param0.add(91);
param0.add(61);
param0.add(6);
for(int... |
if __name__ == '__main__':
param = [
(33,),
(72,),
(81,),
(93,),
(8,),
(76,),
(97,),
(91,),
(61,),
(6,)
]
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 {33,72,81,93,8,76,97,91,61,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();
r... |
MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1{
static int f_gold ( int price [ ] , int n , int k ) {
int profit [ ] [ ] = new int [ k + 1 ] [ n + 1 ] ;
for ( int i = 0 ;
i <= k ;
i ++ ) pr... | def f_gold ( price , n , k ) :
profit = [ [ 0 for i in range ( n + 1 ) ] for j in range ( k + 1 ) ]
for i in range ( 1 , k + 1 ) :
prevDiff = float ( '-inf' )
for j in range ( 1 , n ) :
prevDiff = max ( prevDiff , profit [ i - 1 ] [ j - 1 ] - price [ j - 1 ] )
profit [ i ... |
using namespace std;
int f_gold ( int price [ ], int n, int k ) {
int profit [ k + 1 ] [ n + 1 ];
for ( int i = 0;
i <= k;
i ++ ) profit [ i ] [ 0 ] = 0;
for ( int j = 0;
j <= n;
j ++ ) profit [ 0 ] [ j ] = 0;
for ( int i = 1;
i <= k;
i ++ ) {
int prevDiff = INT_MIN;
for ( int j = 1;
j ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,6,16,16,19,37,47,49,74,77,86,96});
param0.add(new int[]{-6,-70,-26,78,98,-72,48,-94,-38,52,-50,58,84,16,-74,32,-44,-50,68,-48,28,94,-26,-96,-42,96,-24,42,-70,10,-16,-32,98,38,-2,... |
if __name__ == '__main__':
param = [
([3, 6, 16, 16, 19, 37, 47, 49, 74, 77, 86, 96],6,6,),
([-6, -70, -26, 78, 98, -72, 48, -94, -38, 52, -50, 58, 84, 16, -74, 32, -44, -50, 68, -48, 28, 94, -26, -96, -42, 96, -24, 42, -70, 10, -16, -32, 98, 38, -2, 26, -26, -78, 44, -72, -56, -22],31,32,),
([0, 0, 0,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,6,16,16,19,37,47,49,74,77,86,96},{-6,-70,-26,78,98,-72,48,-94,-38,52,-50,58,84,16,-74,32,-44,-50,68,-48,28,94,-26,-96,-42,96,-24,42,-70,10,-16,-32,98,38,-2,26,-26,-78,44,-72,-56,-22},{0,0,0,0,0,0,0,1,1,1},{22,12,58,70},{-96,-96,-94,-92,-90,-88,-88,... |
COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > vis = new HashMap < Integer , Integer > ( ) {
@ Override public Integer get (... | def f_gold(arr, n):
vis = dict()
for i in range(n):
vis[arr[i]] = 1
k = len(vis)
vid = dict()
ans = 0
right = 0
window = 0
for left in range(n):
while (right < n and window < k):
if arr[right] in vid.keys():
vid[arr[right]] += 1
els... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > vis;
for ( int i = 0;
i < n;
++ i ) vis [ arr [ i ] ] = 1;
int k = vis . size ( );
vis . clear ( );
int ans = 0, right = 0, window = 0;
for ( int left = 0;
left < n;
++ left ) {
while ( right < n && window < k )... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{13,39,49,52,53,69,72,79,83,96});
param0.add(new int[]{-98,-98,22,-10,-28,0,56,72,36,88,96,22,90,74,-60,-64,0,2,-42,0,94,-82,-74});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,... |
if __name__ == '__main__':
param = [
([13, 39, 49, 52, 53, 69, 72, 79, 83, 96], 5,),
([-98, -98, 22, -10, -28, 0, 56, 72, 36, 88, 96, 22,
90, 74, -60, -64, 0, 2, -42, 0, 94, -82, -74], 20,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,39,49,52,53,69,72,79,83,96},{-98,-98,22,-10,-28,0,56,72,36,88,96,22,90,74,-60,-64,0,2,-42,0,94,-82,-74},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{35,23,41,58,66,92,3,33,78,70,80,86,21,21,74,19},{-98,-80,-52,-10,4,76},{1,0,0,0,1,... |
FIND_REPETITIVE_ELEMENT_1_N_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_REPETITIVE_ELEMENT_1_N_1{
static int f_gold ( int [ ] arr , int n ) {
int sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) sum += arr [ i ] ;
return sum - ( ( ( n - 1 ) * n ) / 2 ) ;
}
| def f_gold ( arr , n ) :
return sum ( arr ) - ( ( ( n - 1 ) * n ) // 2 )
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
return accumulate ( arr, arr + n, 0 ) - ( ( n - 1 ) * n / 2 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,8,27,34,39,42,43,54,72});
param0.add(new int[]{-38,-66,-38,-48,-96,74,-32,-62,-34,-32,-88,-12,-8,-4});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1});
param0.add(... |
if __name__ == '__main__':
param = [
([4, 8, 27, 34, 39, 42, 43, 54, 72],5,),
([-38, -66, -38, -48, -96, 74, -32, -62, -34, -32, -88, -12, -8, -4],9,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1],8,),
([88, 86, 23, 81, 76, 16, 94, 64, 59, 50, 71, 62, 10, 89, 73, 64, 65, 96, 83, 40, 99, 40, 77... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,8,27,34,39,42,43,54,72},{-38,-66,-38,-48,-96,74,-32,-62,-34,-32,-88,-12,-8,-4},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1},{88,86,23,81,76,16,94,64,59,50,71,62,10,89,73,64,65,96,83,40,99,40,77,33,14,62,6,89,74,96,93,29,15,93,9,58,98,76,23,23,70,99},{-96,-94,... |
SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS{
static int f_gold ( int m , int n ) {
if ( m < n ) return 0 ;
if ( n == 0 ) return 1 ;
return f_gold ( m - 1 , n ) + f_gold ( m / 2 , n - 1 ) ;
}
| def f_gold(m, n):
if m < n:
return 0
if n == 0:
return 1
res = (f_gold(m - 1, n) + f_gold(m // 2, n - 1))
return res
|
using namespace std;
int f_gold ( int m, int n ) {
if ( m < n ) return 0;
if ( n == 0 ) return 1;
return f_gold ( m - 1, n ) + f_gold ( m / 2, n - 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(38);
param0.add(39);
param0.add(24);
param0.add(90);
param0.add(44);
param0.add(49);
param0.add(58);
param0.add(97);
param0.add(99);
param0.add(19);
List<... |
if __name__ == '__main__':
param = [
(38, 34,),
(39, 29,),
(24, 99,),
(90, 23,),
(44, 2,),
(49, 70,),
(58, 84,),
(97, 34,),
(99, 72,),
(19, 67,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled... |
int main() {
int n_success = 0;
vector<int> param0 {38,39,24,90,44,49,58,97,99,19};
vector<int> param1 {34,29,99,23,2,70,84,34,72,67};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
... |
MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
Set < Integer > s = new HashSet < > ( ) ;
int first = 0 , second = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
... | def f_gold ( arr , n ) :
s = [ ]
first = 0
second = 0
for i in range ( n ) :
if arr [ i ] not in s :
s.append ( arr [ i ] )
continue
if ( arr [ i ] > first ) :
second = first
first = arr [ i ]
elif ( arr [ i ] > second ) :
... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_set < int > s;
int first = 0, second = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . find ( arr [ i ] ) == s . end ( ) ) {
s . insert ( arr [ i ] );
continue;
}
if ( arr [ i ] > first ) {
second = first;
fir... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,6,7,8,12,13,14,15,18,18,19,19,26,26,32,32,33,34,34,36,41,43,47,47,51,51,52,53,55,56,57,60,61,71,74,75,76,77,79,87,87,87,90,95,98,99});
param0.add(new int[]{-64,-72,6,-62,54,14,28... |
if __name__ == '__main__':
param = [
([4, 6, 7, 8, 12, 13, 14, 15, 18, 18, 19, 19, 26, 26, 32, 32, 33, 34, 34, 36, 41, 43, 47, 47, 51, 51, 52, 53, 55, 56, 57, 60, 61, 71, 74, 75, 76, 77, 79, 87, 87, 87, 90, 95, 98, 99],37,),
([-64, -72, 6, -62, 54, 14, 28, 60, -96, 14, -32, -2, 80, 8, -56, 68, 86, 64, 86, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,6,7,8,12,13,14,15,18,18,19,19,26,26,32,32,33,34,34,36,41,43,47,47,51,51,52,53,55,56,57,60,61,71,74,75,76,77,79,87,87,87,90,95,98,99},{-64,-72,6,-62,54,14,28,60,-96,14,-32,-2,80,8,-56,68,86,64,86,-12,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,... |
MINIMUM_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION{
static int f_gold ( int N , int insert , int remove , int copy ) {
if ( N == 0 ) return 0 ;
if ( N == 1 ) return insert ;
int dp [ ] = new in... | def f_gold ( N , insrt , remov , cpy ) :
if N == 0 :
return 0
if N == 1 :
return insrt
dp = [ 0 ] * ( N + 1 )
for i in range ( 1 , N + 1 ) :
if i % 2 == 0 :
dp [ i ] = min ( dp [ i - 1 ] + insrt , dp [ i // 2 ] + cpy )
else :
dp [ i ] = min ( dp [ ... |
using namespace std;
int f_gold ( int N, int insert, int remove, int copy ) {
if ( N == 0 ) return 0;
if ( N == 1 ) return insert;
int dp [ N + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 1;
i <= N;
i ++ ) {
if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy );
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(59);
param0.add(66);
param0.add(98);
param0.add(63);
param0.add(99);
param0.add(45);
param0.add(60);
param0.add(11);
param0.add(96);
param0.add(54);
List<... |
if __name__ == '__main__':
param = [
(59,75,12,45,),
(66,68,32,41,),
(98,55,69,5,),
(63,4,41,12,),
(99,37,98,55,),
(45,28,59,7,),
(60,53,40,52,),
(11,96,50,50,),
(96,95,48,84,),
(54,6,50,82,)
]
n_success = 0
for i, parameters_set in enumerate(param):
... |
int main() {
int n_success = 0;
vector<int> param0 {59,66,98,63,99,45,60,11,96,54};
vector<int> param1 {75,68,55,4,37,28,53,96,95,6};
vector<int> param2 {12,32,69,41,98,59,40,50,48,50};
vector<int> param3 {45,41,5,12,55,7,52,50,84,82};
for(int i = 0; i < param0.size(); ++i)
{
if(f_f... |
POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES{
static boolean f_gold ( int [ ] arr , int N ) {
if ( N < 3 ) return false ;
Arrays . sort ( arr ) ;
for ( int i = 0 ;
i < N - 2 ;
i ++ ) if ( arr [ i ] + arr [ i + 1 ... | def f_gold ( arr , N ) :
if N < 3 :
return False
arr.sort ( )
for i in range ( N - 2 ) :
if arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] :
return True
|
using namespace std;
bool f_gold ( int arr [ ], int N ) {
if ( N < 3 ) return false;
sort ( arr, arr + N );
for ( int i = 0;
i < N - 2;
i ++ ) if ( arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] ) return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,6,8,10,14,15,16,19,21,26,26,26,28,29,30,33,33,35,36,36,41,44,45,45,45,49,51,54,57,59,61,64,68,70,70,72,73,74,76,78,87,89,89,91,92,93,94,95,97});
param0.add(new int[]{50,-58,-44,9... |
if __name__ == '__main__':
param = [
([2, 6, 8, 10, 14, 15, 16, 19, 21, 26, 26, 26, 28, 29, 30, 33, 33, 35, 36, 36, 41, 44, 45, 45, 45, 49, 51, 54, 57, 59, 61, 64, 68, 70, 70, 72, 73, 74, 76, 78, 87, 89, 89, 91, 92, 93, 94, 95, 97],25,),
([50, -58, -44, 90, 18, -26, -74, -46, 96, 32, 72, 46, -90, 86, -10, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,8,10,14,15,16,19,21,26,26,26,28,29,30,33,33,35,36,36,41,44,45,45,45,49,51,54,57,59,61,64,68,70,70,72,73,74,76,78,87,89,89,91,92,93,94,95,97},{50,-58,-44,90,18,-26,-74,-46,96,32,72,46,-90,86,-10,82,-72,86,-64,-96,-12,-14,-36,16,38,56,54,10,74,-86,... |
GOOGLE_CASE_GIVEN_SENTENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class GOOGLE_CASE_GIVEN_SENTENCE{
static String f_gold ( String s ) {
int n = s . length ( ) ;
String s1 = "" ;
s1 = s1 + Character . toLowerCase ( s . charAt ( 0 ) ) ;
for ( int i = 1 ;
i < n ;
i ++ ) {
... | def f_gold(s):
n = len(s)
s1 = ""
s1 = s1 + s[0].lower()
i = 1
while i < n:
if (s[i] == ' ' and i <= n):
s1 = s1 + " " + (s[i + 1]).lower()
i = i + 1
else:
s1 = s1 + (s[i]).upper()
i = i + 1
return s1
|
using namespace std;
string f_gold ( string s ) {
int n = s . length ( );
s [ 0 ] = tolower ( s [ 0 ] );
for ( int i = 1;
i < n;
i ++ ) {
if ( s [ i ] == ' ' && i < n ) {
s [ i + 1 ] = tolower ( s [ i + 1 ] );
i ++;
}
else s [ i ] = toupper ( s [ i ] );
}
return s;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("TEYndweqZA");
param0.add("01865");
param0.add("11001100");
param0.add("CzwznJmQet");
param0.add("318305446");
param0.add("0000001111110");
param0.add("yzT");
param0.a... |
if __name__ == '__main__':
param = [
('TEYndweqZA',),
('01865',),
('11001100',),
('CzwznJmQet',),
('318305446',),
('0000001111110',),
('yzT',),
('38630230',),
('01101',),
('zoizI',)
]
n_success = 0
for i, parameters_set in ... |
int main() {
int n_success = 0;
vector<string> param0 {"TEYndweqZA","01865","11001100","CzwznJmQet","318305446","0000001111110","yzT","38630230","01101","zoizI"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
... |
PROGRAM_BINARY_DECIMAL_CONVERSION_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_BINARY_DECIMAL_CONVERSION_1{
static int f_gold ( String n ) {
String num = n ;
int dec_value = 0 ;
int base = 1 ;
int len = num . length ( ) ;
for ( int i = len - 1 ;
i >= 0 ;
i -- ) {
if... | def f_gold ( n ) :
num = n ;
dec_value = 0 ;
base1 = 1 ;
len1 = len ( num ) ;
for i in range ( len1 - 1 , - 1 , - 1 ) :
if ( num [ i ] == '1' ) :
dec_value += base1 ;
base1 = base1 * 2 ;
return dec_value ;
|
using namespace std;
int f_gold ( string n ) {
string num = n;
int dec_value = 0;
int base = 1;
int len = num . length ( );
for ( int i = len - 1;
i >= 0;
i -- ) {
if ( num [ i ] == '1' ) dec_value += base;
base = base * 2;
}
return dec_value;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("uEmIAgF");
param0.add("753310137");
param0.add("010011010");
param0.add("kNi");
param0.add("04562016903312");
param0.add("000111101");
param0.add("bk");
param0.add("9... |
if __name__ == '__main__':
param = [
('uEmIAgF',),
('753310137',),
('010011010',),
('kNi',),
('04562016903312',),
('000111101',),
('bk',),
('9',),
('1',),
('XxT nXLlk',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameter... |
int main() {
int n_success = 0;
vector<string> param0 {"uEmIAgF","753310137","010011010","kNi","04562016903312","000111101","bk","9","1","XxT nXLlk"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
co... |
MINIMUM_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS{
static int f_gold ( int [ ] a , int n ) {
int min = a [ 0 ] ;
for ( int i = 1 ;
i < a . length ;
i ++ ) {
if ( a [ i ] < min ) min = a [ i ] ;
}
... | def f_gold ( a , n ) :
return ( ( n - 1 ) * min ( a ) )
|
using namespace std;
int f_gold ( int a [ ], int n ) {
return ( n - 1 ) * ( * min_element ( a, a + n ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,3,4,7,8,10,10,16,20,22,22,23,23,23,27,29,32,35,39,41,46,51,53,54,59,59,60,61,69,70,70,79,79,81,84,90,91,98});
param0.add(new int[]{-6,10});
param0.add(new int[]{0,0,0,0,0,0... |
if __name__ == '__main__':
param = [
([1, 2, 3, 4, 7, 8, 10, 10, 16, 20, 22, 22, 23, 23, 23, 27, 29, 32, 35, 39, 41, 46, 51, 53, 54, 59, 59, 60, 61, 69, 70, 70, 79, 79, 81, 84, 90, 91, 98],25,),
([-6, 10],1,),
([0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],15,),
([20, 61, 92, 45, 75, 26, 8... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,3,4,7,8,10,10,16,20,22,22,23,23,23,27,29,32,35,39,41,46,51,53,54,59,59,60,61,69,70,70,79,79,81,84,90,91,98},{-6,10},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{20,61,92,45,75,26,83,5,85,27,39,88,36,39,83,41,56,77,39,69,72,98,39,15,29,69,64,92,96,49,59... |
MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO{
static long f_gold ( long a , long b , long mod ) {
long res = 0 ;
a %= mod ;
while ( b > 0 ) {
if ( ( b & 1 ) > 0 ) {
res = ( res + a ) % mod ;
}
... | def f_gold ( a , b , mod ) :
res = 0 ;
a = a % mod ;
while ( b ) :
if ( b & 1 ) :
res = ( res + a ) % mod ;
a = ( 2 * a ) % mod ;
b >>= 1 ;
return res ;
|
using namespace std;
long long f_gold ( long long a, long long b, long long mod ) {
long long res = 0;
a %= mod;
while ( b ) {
if ( b & 1 ) res = ( res + a ) % mod;
a = ( 2 * a ) % mod;
b >>= 1;
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(60L);
param0.add(46L);
param0.add(4L);
param0.add(67L);
param0.add(93L);
param0.add(89L);
param0.add(8L);
param0.add(53L);
param0.add(96L);
param0.add(38L);
... |
if __name__ == '__main__':
param = [
(60,24,58,),
(46,43,29,),
(4,50,71,),
(67,1,66,),
(93,35,73,),
(89,97,8,),
(8,78,55,),
(53,73,22,),
(96,92,83,),
(38,64,83,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) =... |
int main() {
int n_success = 0;
vector<long> param0 {60,46,4,67,93,89,8,53,96,38};
vector<long> param1 {24,43,50,1,35,97,78,73,92,64};
vector<long> param2 {58,29,71,66,73,8,55,22,83,83};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0... |
NUMBER_DAYS_TANK_WILL_BECOME_EMPTY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_DAYS_TANK_WILL_BECOME_EMPTY{
static int f_gold ( int C , int l ) {
if ( l >= C ) return C ;
double eq_root = ( Math . sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2 ;
return ( int ) ( Math . ceil ( eq_root ) + ... | import math
def f_gold ( C , l ) :
if ( l >= C ) : return C
eq_root = ( math.sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2
return math.ceil ( eq_root ) + l
|
using namespace std;
int f_gold ( int C, int l ) {
if ( l >= C ) return C;
double eq_root = ( std :: sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2;
return std :: ceil ( eq_root ) + l;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(91);
param0.add(99);
param0.add(11);
param0.add(23);
param0.add(12);
param0.add(1);
param0.add(18);
param0.add(14);
param0.add(13);
param0.add(36);
List<I... |
if __name__ == '__main__':
param = [
(91,29,),
(99,55,),
(11,56,),
(23,56,),
(12,97,),
(1,64,),
(18,5,),
(14,37,),
(13,55,),
(36,99,)
]
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 {91,99,11,23,12,1,18,14,13,36};
vector<int> param1 {29,55,56,56,97,64,5,37,55,99};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM{
static int f_gold ( int process , int need ) {
int minResources = 0 ;
minResources = process * ( need - 1 ) + 1 ;
return minResources ;
}
| def f_gold ( process , need ) :
minResources = 0
minResources = process * ( need - 1 ) + 1
return minResources
|
using namespace std;
int f_gold ( int process, int need ) {
int minResources = 0;
minResources = process * ( need - 1 ) + 1;
return minResources;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(38);
param0.add(82);
param0.add(2);
param0.add(38);
param0.add(31);
param0.add(80);
param0.add(11);
param0.add(2);
param0.add(26);
param0.add(37);
List<In... |
if __name__ == '__main__':
param = [
(38,37,),
(82,3,),
(2,26,),
(38,72,),
(31,85,),
(80,73,),
(11,9,),
(2,31,),
(26,59,),
(37,67,)
]
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 {38,82,2,38,31,80,11,2,26,37};
vector<int> param1 {37,3,26,72,85,73,9,31,59,67};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
... |
LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S{
static int f_gold ( int arr [ ] , int n ) {
HashMap < Integer , Integer > um = new HashMap < Integer , Integer > ( ) ;
int sum = 0 , maxLen = 0 ;
for ( int i = 0 ;
i... | def f_gold ( arr , n ) :
um = { i : 0 for i in range ( 10 ) }
sum = 0
maxLen = 0
for i in range ( n ) :
if arr [ i ] == 0 :
sum += - 1
else :
sum += 1
if ( sum == 1 ) :
maxLen = i + 1
elif ( sum not in um ) :
um [ sum ] = i
... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > um;
int sum = 0, maxLen = 0;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ] == 0 ? - 1 : 1;
if ( sum == 1 ) maxLen = i + 1;
else if ( um . find ( sum ) == um . end ( ) ) um [ sum ] = i;
if ( um . find ( sum... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,10,31,35});
param0.add(new int[]{4,88,-72,28,-54,32,-34});
param0.add(new int[]{0,0,0,1,1,1,1,1,1});
param0.add(new int[]{39,22,15,10,34,87,46,83,74,77,61,90,43,67,64,72,... |
if __name__ == '__main__':
param = [
([6, 10, 31, 35],2,),
([4, 88, -72, 28, -54, 32, -34],6,),
([0, 0, 0, 1, 1, 1, 1, 1, 1],4,),
([39, 22, 15, 10, 34, 87, 46, 83, 74, 77, 61, 90, 43, 67, 64, 72, 92, 52, 68, 53, 67, 32, 82, 76, 76, 47, 74, 47, 8, 80, 85, 58, 75],26,),
([-82, -58, -50, -30, -14,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,10,31,35},{4,88,-72,28,-54,32,-34},{0,0,0,1,1,1,1,1,1},{39,22,15,10,34,87,46,83,74,77,61,90,43,67,64,72,92,52,68,53,67,32,82,76,76,47,74,47,8,80,85,58,75},{-82,-58,-50,-30,-14,-4,-2,-2,0,22,36,58,70,80,80,82,84,90},{1,0,1,0,0,1,1,1,0,0,1},{4,11,17,... |
NEXT_POWER_OF_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NEXT_POWER_OF_2{
static int f_gold ( int n ) {
int count = 0 ;
if ( n > 0 && ( n & ( n - 1 ) ) == 0 ) return n ;
while ( n != 0 ) {
n >>= 1 ;
count += 1 ;
}
return 1 << count ;
}
| def f_gold ( n ) :
count = 0 ;
if ( n and not ( n & ( n - 1 ) ) ) :
return n
while ( n != 0 ) :
n >>= 1
count += 1
return 1 << count ;
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(74);
param0.add(70);
param0.add(85);
param0.add(78);
param0.add(71);
param0.add(32);
param0.add(97);
param0.add(90);
param0.add(64);
param0.add(48);
for(i... |
if __name__ == '__main__':
param = [
(74,),
(70,),
(85,),
(78,),
(71,),
(32,),
(97,),
(90,),
(64,),
(48,)
]
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 {74,70,85,78,71,32,97,90,64,48};
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();
... |
CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING{
static int f_gold ( String str ) {
int res = str . charAt ( 0 ) - '0' ;
for ( int i = 1 ;
i < str . length ( ) ;
i ++ ) {
if ( str . charAt ( i ) ... | def f_gold ( str ) :
res = ord ( str [ 0 ] ) - 48
for i in range ( 1 , len ( str ) ) :
if ( str [ i ] == '0' or str [ i ] == '1' or res < 2 ) :
res += ord ( str [ i ] ) - 48
else :
res *= ord ( str [ i ] ) - 48
return res
|
using namespace std;
int f_gold ( string str ) {
int res = str [ 0 ] - '0';
for ( int i = 1;
i < str . length ( );
i ++ ) {
if ( str [ i ] == '0' || str [ i ] == '1' || res < 2 ) res += ( str [ i ] - '0' );
else res *= ( str [ i ] - '0' );
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("pR");
param0.add("9518");
param0.add("1");
param0.add("nNMCIXUCpRMmvO");
param0.add("3170487");
param0.add("0100101010");
param0.add("Z rONcUqWb");
param0.add("004192... |
if __name__ == '__main__':
param = [
('pR',),
('9518',),
('1',),
('nNMCIXUCpRMmvO',),
('3170487',),
('0100101010',),
('Z rONcUqWb',),
('00419297',),
('00',),
('r',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set... |
int main() {
int n_success = 0;
vector<string> param0 {"pR","9518","1","nNMCIXUCpRMmvO","3170487","0100101010","Z rONcUqWb","00419297","00","r"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout <<... |
PROGRAM_CHECK_ISBN |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_CHECK_ISBN{
static boolean f_gold ( String isbn ) {
int n = isbn . length ( ) ;
if ( n != 10 ) return false ;
int sum = 0 ;
for ( int i = 0 ;
i < 9 ;
i ++ ) {
int digit = isbn . charAt ( i ... | null |
using namespace std;
bool f_gold ( string & isbn ) {
int n = isbn . length ( );
if ( n != 10 ) return false;
int sum = 0;
for ( int i = 0;
i < 9;
i ++ ) {
int digit = isbn [ i ] - '0';
if ( 0 > digit || 9 < digit ) return false;
sum += ( digit * ( 10 - i ) );
}
char last = isbn [ 9 ];
if ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("007462542X");
param0.add("0112112425");
param0.add("0545010225");
param0.add("0552527408");
param0.add("424519151311");
param0.add("101011");
param0.add("9780552527408");... | null |
int main() {
int n_success = 0;
vector<string> param0 {"007462542X","0112112425","0545010225","0552527408","424519151311","101011","9780552527408","2290344397","1473226406","DDdguSGiRr"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
... |
COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
int result = 0 ;
HashSet < Integer > Hash = new HashSet < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
Hash . ad... | def f_gold ( arr , n ) :
result = 0
Hash = set ( )
for i in range ( n ) :
Hash.add ( arr [ i ] )
for i in range ( n ) :
for j in range ( i + 1 , n ) :
product = arr [ i ] * arr [ j ]
if product in ( Hash ) :
result += 1
return result
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int result = 0;
set < int > Hash;
for ( int i = 0;
i < n;
i ++ ) Hash . insert ( arr [ i ] );
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) {
int product = arr [ i ] * arr [ j ];
if ( Hash . find ( pr... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,10,17,17,18,20,27,28,29,29,31,32,41,43,45,46,63,66,69,69,70,75,87,95});
param0.add(new int[]{-60});
param0.add(new int[]{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1});
param0.add(new i... |
if __name__ == '__main__':
param = [
([7, 10, 17, 17, 18, 20, 27, 28, 29, 29, 31, 32, 41, 43, 45, 46, 63, 66, 69, 69, 70, 75, 87, 95],17,),
([-60],0,),
([0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],9,),
([52, 83, 36, 57, 93, 11, 32, 91, 52],8,),
([-98, -94, -90, -88, -76, -76, -64, -62, -60, -... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,10,17,17,18,20,27,28,29,29,31,32,41,43,45,46,63,66,69,69,70,75,87,95},{-60},{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{52,83,36,57,93,11,32,91,52},{-98,-94,-90,-88,-76,-76,-64,-62,-60,-50,-46,-32,-24,-22,-20,-16,-4,-2,6,10,20,28,30,32,34,38,40,42,54,64,72,76... |
COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
int invcount = 0 ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) {
int small = 0 ;
for ( int j = i + 1 ;
j <... | def f_gold ( arr , n ) :
invcount = 0
for i in range ( 1 , n - 1 ) :
small = 0
for j in range ( i + 1 , n ) :
if ( arr [ i ] > arr [ j ] ) :
small += 1
great = 0 ;
for j in range ( i - 1 , - 1 , - 1 ) :
if ( arr [ i ] < arr [ j ] ) :
... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int invcount = 0;
for ( int i = 1;
i < n - 1;
i ++ ) {
int small = 0;
for ( int j = i + 1;
j < n;
j ++ ) if ( arr [ i ] > arr [ j ] ) small ++;
int great = 0;
for ( int j = i - 1;
j >= 0;
j -- ) if ( arr [ i ] < arr [ j ] ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,75,89});
param0.add(new int[]{84,-66,-52,34,-28,-6,20,22,-78,-26,14,24,-92,-18,32,-94,-64,-38,56,4,-10,58,-66,-58,-10,-8,-62,-60,-26});
param0.add(new int[]{0,0,0,1,1,1,1,1})... |
if __name__ == '__main__':
param = [
([4, 75, 89],1,),
([84, -66, -52, 34, -28, -6, 20, 22, -78, -26, 14, 24, -92, -18, 32, -94, -64, -38, 56, 4, -10, 58, -66, -58, -10, -8, -62, -60, -26],26,),
([0, 0, 0, 1, 1, 1, 1, 1],7,),
([18, 7, 43, 57, 94, 37, 38, 41, 59, 64, 97, 29, 51, 37, 64, 91, 42, 83, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,75,89},{84,-66,-52,34,-28,-6,20,22,-78,-26,14,24,-92,-18,32,-94,-64,-38,56,4,-10,58,-66,-58,-10,-8,-62,-60,-26},{0,0,0,1,1,1,1,1},{18,7,43,57,94,37,38,41,59,64,97,29,51,37,64,91,42,83,13,22,68},{-94,-86,-84,-84,-82,-66,-62,-58,-52,-48,-44,-40,-38,-... |
FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int max_count = 0 ;
int max_index = 0 ;
int prev_zero = - 1 ;
int prev_prev_zero = - 1 ;... | def f_gold ( arr , n ) :
max_count = 0
max_index = 0
prev_zero = - 1
prev_prev_zero = - 1
for curr in range ( n ) :
if ( arr [ curr ] == 0 ) :
if ( curr - prev_prev_zero > max_count ) :
max_count = curr - prev_prev_zero
max_index = prev_zero
... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,8,9,13,13,19,19,21,21,24,28,28,29,29,29,32,34,38,39,43,45,46,57,59,62,63,67,67,68,69,70,70,71,72,74,74,76,78,79,81,90,90,95,96,98});
param0.add(new int[]{28,92,-16,0,6,12,-88,42,... |
if __name__ == '__main__':
param = [
([2, 8, 9, 13, 13, 19, 19, 21, 21, 24, 28, 28, 29, 29, 29, 32, 34, 38, 39, 43, 45, 46, 57, 59, 62, 63, 67, 67, 68, 69, 70, 70, 71, 72, 74, 74, 76, 78, 79, 81, 90, 90, 95, 96, 98],36,),
([28, 92, -16, 0, 6, 12, -88, 42, -48, 72, 2, -38, 80, 82, 96, 32, -42, -38, 62, -76,... | null |
LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE{
public static int f_gold ( int arr [ ] , int n ) {
int [ ] lioes = new int [ n ] ;
int maxLen = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) lioes [ i ] = 1 ;
for ( int... | def f_gold ( arr , n ) :
lioes = list ( )
maxLen = 0
for i in range ( n ) :
lioes.append ( 1 )
i = 1
for i in range ( n ) :
for j in range ( i ) :
if ( arr [ i ] > arr [ j ] and ( arr [ i ] + arr [ j ] ) % 2 != 0 and lioes [ i ] < lioes [ j ] + 1 ) :
lioes... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int lioes [ n ];
int maxLen = 0;
for ( int i = 0;
i < n;
i ++ ) lioes [ i ] = 1;
for ( int i = 1;
i < n;
i ++ ) for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && ( arr [ i ] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 )... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{7,8,9,16,16,27,32,33,35,35,39,39,41,42,44,47,48,50,56,59,66,69,70,73,74,76,78,87,87,89,94,96,96,98,98});
param0.add(new int[]{40,76,-54,-92,-28,-96,8,60,28,-38,-62,-40,-16,16,52,28... |
if __name__ == '__main__':
param = [
([7, 8, 9, 16, 16, 27, 32, 33, 35, 35, 39, 39, 41, 42, 44, 47, 48, 50, 56, 59, 66, 69, 70, 73, 74, 76, 78, 87, 87, 89, 94, 96, 96, 98, 98],32,),
([40, 76, -54, -92, -28, -96, 8, 60, 28, -38, -62, -40, -16, 16, 52, 28, 70, -56, -50, 46, 68, -16, -56, 46, 42, 70, 52, -34,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,8,9,16,16,27,32,33,35,35,39,39,41,42,44,47,48,50,56,59,66,69,70,73,74,76,78,87,87,89,94,96,96,98,98},{40,76,-54,-92,-28,-96,8,60,28,-38,-62,-40,-16,16,52,28,70,-56,-50,46,68,-16,-56,46,42,70,52,-34,86,-32,-50,64,36,54,20,82,84},{0,0,0,0,1,1,1},{15,... |
BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS{
static int f_gold ( int weight [ ] , int n , int c ) {
int res = 0 , bin_rem = c ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( weight [ i ] > bin_rem ) {
... | null |
using namespace std;
int f_gold ( int weight [ ], int n, int c ) {
int res = 0, bin_rem = c;
for ( int i = 0;
i < n;
i ++ ) {
if ( weight [ i ] > bin_rem ) {
res ++;
bin_rem = c - weight [ i ];
}
else bin_rem -= weight [ i ];
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,12,14,16,19,24,29,31,33,34,41,43,47,53,53,59,64,70,70,71,72,73,74,80,81,89,90});
param0.add(new int[]{-88,-26,70,-92,96,84,-24,-18,84,62,-72,42,72,2,30,86});
param0.add(new i... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,12,14,16,19,24,29,31,33,34,41,43,47,53,53,59,64,70,70,71,72,73,74,80,81,89,90},{-88,-26,70,-92,96,84,-24,-18,84,62,-72,42,72,2,30,86},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{51,7,6,24,19,83,9,36,40,93,24,48,63,69,53,54,42,45,... |
PROGRAM_BINARY_DECIMAL_CONVERSION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_BINARY_DECIMAL_CONVERSION{
static int f_gold ( int n ) {
int num = n ;
int dec_value = 0 ;
int base = 1 ;
int temp = num ;
while ( temp > 0 ) {
int last_digit = temp % 10 ;
temp = temp / ... | def f_gold ( n ) :
num = n ;
dec_value = 0 ;
base = 1 ;
temp = num ;
while ( temp ) :
last_digit = temp % 10 ;
temp = int ( temp / 10 ) ;
dec_value += last_digit * base ;
base = base * 2 ;
return dec_value ;
|
using namespace std;
int f_gold ( int n ) {
int num = n;
int dec_value = 0;
int base = 1;
int temp = num;
while ( temp ) {
int last_digit = temp % 10;
temp = temp / 10;
dec_value += last_digit * base;
base = base * 2;
}
return dec_value;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(70);
param0.add(95);
param0.add(41);
param0.add(97);
param0.add(8);
param0.add(16);
param0.add(41);
param0.add(57);
param0.add(81);
param0.add(78);
for(in... |
if __name__ == '__main__':
param = [
(70,),
(95,),
(41,),
(97,),
(8,),
(16,),
(41,),
(57,),
(81,),
(78,)
]
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 {70,95,41,97,8,16,41,57,81,78};
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_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER{
static int f_gold ( int n ) {
int result = 0 ;
for ( int i = 1 ;
i <= 9 ;
i ++ ) {
Stack < Integer > s = new Stack < > ( ) ;
if ( i <= n ) {
... | def f_gold ( n ) :
result = 0
for i in range ( 1 , 10 ) :
s = [ ]
if ( i <= n ) :
s.append ( i )
result += 1
while len ( s ) != 0 :
tp = s [ - 1 ]
s.pop ( )
for j in range ( tp % 10 , 10 ) :
x = tp * 10 + j
... |
using namespace std;
int f_gold ( int n ) {
int result = 0;
for ( int i = 1;
i <= 9;
i ++ ) {
stack < int > s;
if ( i <= n ) {
s . push ( i );
result ++;
}
while ( ! s . empty ( ) ) {
int tp = s . top ( );
s . pop ( );
for ( int j = tp % 10;
j <= 9;
j +... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(69);
param0.add(72);
param0.add(88);
param0.add(7);
param0.add(66);
param0.add(34);
param0.add(23);
param0.add(37);
param0.add(33);
param0.add(21);
for(in... |
if __name__ == '__main__':
param = [
(69,),
(72,),
(88,),
(7,),
(66,),
(34,),
(23,),
(37,),
(33,),
(21,)
]
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 {69,72,88,7,66,34,23,37,33,21};
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();
... |
MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK{
static int f_gold ( int input , int unlock_code ) {
int rotation = 0 ;
int input_digit , code_digit ;
while ( input > 0 || unlock_code > 0 ) {
input_digit = input ... | def f_gold ( input , unlock_code ) :
rotation = 0 ;
while ( input > 0 or unlock_code > 0 ) :
input_digit = input % 10 ;
code_digit = unlock_code % 10 ;
rotation += min ( abs ( input_digit - code_digit ) , 10 - abs ( input_digit - code_digit ) ) ;
input = int ( input / 10 ) ;
... |
using namespace std;
int f_gold ( int input, int unlock_code ) {
int rotation = 0;
int input_digit, code_digit;
while ( input || unlock_code ) {
input_digit = input % 10;
code_digit = unlock_code % 10;
rotation += min ( abs ( input_digit - code_digit ), 10 - abs ( input_digit - code_digit ) );
in... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(71);
param0.add(90);
param0.add(28);
param0.add(41);
param0.add(32);
param0.add(39);
param0.add(33);
param0.add(89);
param0.add(50);
param0.add(92);
List<... |
if __name__ == '__main__':
param = [
(71,46,),
(90,65,),
(28,84,),
(41,23,),
(32,58,),
(39,82,),
(33,58,),
(89,32,),
(50,51,),
(92,77,)
]
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 {71,90,28,41,32,39,33,89,50,92};
vector<int> param1 {46,65,84,23,58,82,58,32,51,77};
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_MISSING_NUMBER_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_MISSING_NUMBER_1{
static int f_gold ( int a [ ] , int n ) {
int total = 1 ;
for ( int i = 2 ;
i <= ( n + 1 ) ;
i ++ ) {
total += i ;
total -= a [ i - 2 ] ;
}
return total ;
}
| def f_gold ( a , n ) :
i , total = 0 , 1
for i in range ( 2 , n + 2 ) :
total += i
total -= a [ i - 2 ]
return total
|
using namespace std;
int f_gold ( int a [ ], int n ) {
int i, total = 1;
for ( i = 2;
i <= ( n + 1 );
i ++ ) {
total += i;
total -= a [ i - 2 ];
}
return total;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{13,27,46,59,62,82,92});
param0.add(new int[]{22,86,-64,-20,-56,-16,86,42,72,-90,10,42,56,8,50,24,-34,0,-78,64,18,20,-84,-22,90,-20,86,26,-54,0,90,-48,4,88,18,-64,-22,-74,48,-36,-86... |
if __name__ == '__main__':
param = [
([13, 27, 46, 59, 62, 82, 92],6,),
([22, 86, -64, -20, -56, -16, 86, 42, 72, -90, 10, 42, 56, 8, 50, 24, -34, 0, -78, 64, 18, 20, -84, -22, 90, -20, 86, 26, -54, 0, 90, -48, 4, 88, 18, -64, -22, -74, 48, -36, -86, -24, 88, -64, 68, 62, 92],38,),
([0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,27,46,59,62,82,92},{22,86,-64,-20,-56,-16,86,42,72,-90,10,42,56,8,50,24,-34,0,-78,64,18,20,-84,-22,90,-20,86,26,-54,0,90,-48,4,88,18,-64,-22,-74,48,-36,-86,-24,88,-64,68,62,92},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{55,89,56,85,26,4,91,9... |
LOWER_INSERTION_POINT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LOWER_INSERTION_POINT{
static int f_gold ( int arr [ ] , int n , int X ) {
if ( X < arr [ 0 ] ) return 0 ;
else if ( X > arr [ n - 1 ] ) return n ;
int lowerPnt = 0 ;
int i = 1 ;
while ( i < n && arr [ i... | def f_gold ( arr , n , X ) :
if ( X < arr [ 0 ] ) :
return 0 ;
elif ( X > arr [ n - 1 ] ) :
return n
lowerPnt = 0
i = 1
while ( i < n and arr [ i ] < X ) :
lowerPnt = i
i = i * 2
while ( lowerPnt < n and arr [ lowerPnt ] < X ) :
lowerPnt += 1
return lo... |
using namespace std;
int f_gold ( int arr [ ], int n, int X ) {
if ( X < arr [ 0 ] ) return 0;
else if ( X > arr [ n - 1 ] ) return n;
int lowerPnt = 0;
int i = 1;
while ( i < n && arr [ i ] < X ) {
lowerPnt = i;
i = i * 2;
}
while ( lowerPnt < n && arr [ lowerPnt ] < X ) lowerPnt ++;
return lo... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,5,5,16,16,20,26,32,35,39,39,41,44,48,48,51,59,59,62,66,66,70,74,75,78,80,86,86,96});
param0.add(new int[]{-76,80,-6,-2,50,72,84,-56,70,8,48,6,-24,-50,-72});
param0.add(new ... |
if __name__ == '__main__':
param = [
([1, 2, 5, 5, 16, 16, 20, 26, 32, 35, 39, 39, 41, 44, 48, 48, 51, 59, 59, 62, 66, 66, 70, 74, 75, 78, 80, 86, 86, 96],17,29,),
([-76, 80, -6, -2, 50, 72, 84, -56, 70, 8, 48, 6, -24, -50, -72],14,9,),
([0, 0, 0, 0, 0, 1, 1, 1, 1],8,4,),
([74, 65, 84, 71],2,3,),
... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,5,5,16,16,20,26,32,35,39,39,41,44,48,48,51,59,59,62,66,66,70,74,75,78,80,86,86,96},{-76,80,-6,-2,50,72,84,-56,70,8,48,6,-24,-50,-72},{0,0,0,0,0,1,1,1,1},{74,65,84,71},{-96,-92,-90,-86,-84,-76,-76,-62,-58,-54,-50,-50,-44,-42,-38,-34,-14,-8,6,12,24... |
COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1{
static int f_gold ( int M [ ] [ ] , int n , int m ) {
int count = 0 ;
int i = 0 ;
int j = m - 1 ;
while ( j >= 0 && i < n ) {
if ( M [ ... | def f_gold ( M , n , m ) :
count = 0
i = 0
j = m - 1
while j >= 0 and i < n :
if M [ i ] [ j ] < 0 :
count += ( j + 1 )
i += 1
else :
j -= 1
return count
| null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{76,39,83,83,24,11,7,97,81,52,7,81,68,25,14,54,69,12,53,38,94,77,75,28,38,92,47,46,86},new int[]{63,95,96,14,82,98,75,5,72,27,71,62,15,55,63,37,10,2,68,98,15,21,25,83,84... |
if __name__ == '__main__':
param = [
([[76, 39, 83, 83, 24, 11, 7, 97, 81, 52, 7, 81, 68, 25, 14, 54, 69, 12, 53, 38, 94, 77, 75, 28, 38, 92, 47, 46, 86], [63, 95, 96, 14, 82, 98, 75, 5, 72, 27, 71, 62, 15, 55, 63, 37, 10, 2, 68, 98, 15, 21, 25, 83, 84, 46, 93, 23, 87], [47, 23, 49, 53, 26, 14, 50, 50, 5, 3, 2... | null |
COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S{
static int f_gold ( int arr [ ] , int n ) {
Map < Integer , Integer > um = new HashMap < > ( ) ;
int curr_sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
curr_sum += ... | def f_gold ( arr , n ) :
um = dict ( )
curr_sum = 0
for i in range ( n ) :
curr_sum += ( - 1 if ( arr [ i ] == 0 ) else arr [ i ] )
if um.get ( curr_sum ) :
um [ curr_sum ] += 1
else :
um [ curr_sum ] = 1
count = 0
for itr in um :
if um [ itr ]... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > um;
int curr_sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
curr_sum += ( arr [ i ] == 0 ) ? - 1 : arr [ i ];
um [ curr_sum ] ++;
}
int count = 0;
for ( auto itr = um . begin ( );
itr != um . end ( );
itr ++ ) {
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,12,18,19,19,20,20,21,25,29,38,54,54,71,72,72,74,75,77,78,80,80,81,84,97,97});
param0.add(new int[]{10,70,24,-38,32,-68,88,-28,-24,-70,-64,50,-30,64,54,-6,18,-30,-30,-62,-10,94,-5... |
if __name__ == '__main__':
param = [
([2, 12, 18, 19, 19, 20, 20, 21, 25, 29, 38, 54, 54, 71, 72, 72, 74, 75, 77, 78, 80, 80, 81, 84, 97, 97],24,),
([10, 70, 24, -38, 32, -68, 88, -28, -24, -70, -64, 50, -30, 64, 54, -6, 18, -30, -30, -62, -10, 94, -54, -22, -88, 96, 22, 26, -92, -40, -76, 46, 36, 30, 24, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,12,18,19,19,20,20,21,25,29,38,54,54,71,72,72,74,75,77,78,80,80,81,84,97,97},{10,70,24,-38,32,-68,88,-28,-24,-70,-64,50,-30,64,54,-6,18,-30,-30,-62,-10,94,-54,-22,-88,96,22,26,-92,-40,-76,46,36,30,24,-52,0},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{66,50,17,15... |
FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME{
static int f_gold ( int n ) {
if ( n <= 1 ) return n ;
int a = 0 , b = 1 , c = 1 ;
int res = 1 ;
while ( c < n ) {
c = a + b ;
res ++ ;
a = b ;
... | def f_gold ( n ) :
if ( n <= 1 ) :
return n
a = 0
b = 1
c = 1
res = 1
while ( c < n ) :
c = a + b
res = res + 1
a = b
b = c
return res
|
using namespace std;
int f_gold ( int n ) {
if ( n <= 1 ) return n;
int a = 0, b = 1, c = 1;
int res = 1;
while ( c < n ) {
c = a + b;
res ++;
a = b;
b = c;
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(5);
param0.add(19);
param0.add(7);
param0.add(94);
param0.add(58);
param0.add(65);
param0.add(69);
param0.add(96);
param0.add(80);
param0.add(14);
for(int... |
if __name__ == '__main__':
param = [
(5,),
(19,),
(7,),
(94,),
(58,),
(65,),
(69,),
(96,),
(80,),
(14,)
]
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 {5,19,7,94,58,65,69,96,80,14};
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... |
POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS{
static void f_gold ( int a [ ] , int size ) {
int positive = 0 , negative = 1 , temp ;
while ( true ) {
while ( positive < size && a [ positive ] >= 0 ) positive += ... | def f_gold ( a , size ) :
positive = 0
negative = 1
while ( True ) :
while ( positive < size and a [ positive ] >= 0 ) :
positive = positive + 2
while ( negative < size and a [ negative ] <= 0 ) :
negative = negative + 2
if ( positive < size and negative < siz... |
using namespace std;
void f_gold ( int a [ ], int size ) {
int positive = 0, negative = 1;
while ( true ) {
while ( positive < size && a [ positive ] >= 0 ) positive += 2;
while ( negative < size && a [ negative ] <= 0 ) negative += 2;
if ( positive < size && negative < size ) swap ( a [ positive ], a ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93});
param0.add(new int[]{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,9... |
if __name__ == '__main__':
param = [
([8, 11, 18, 23, 24, 28, 28, 34, 35, 42, 44, 53, 57, 65, 71, 72, 76, 78, 82, 82, 85, 86, 92, 93],15,),
([0, -95, -51, -2, -70, -28, 3, -37, 75, -74, 85, -63, -93, 27, 68, -8, 67, 90, 3, -47, 32, 8, 12, 53, -93, 56, 97],15,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93},{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97},{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}... |
NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int [ ] auxArr = new int [ n ] ;
if ( s . charAt ( 0 ) == '1' ) auxArr [ 0 ] = 1 ;
... | def f_gold ( s ) :
n = len ( s )
auxArr = [ 0 for i in range ( n ) ]
if ( s [ 0 ] == '1' ) :
auxArr [ 0 ] = 1
for i in range ( 0 , n ) :
if ( s [ i ] == '1' ) :
auxArr [ i ] = auxArr [ i - 1 ] + 1
else :
auxArr [ i ] = auxArr [ i - 1 ]
count = 0
fo... |
using namespace std;
int f_gold ( string s ) {
int n = s . length ( );
int auxArr [ n ] = {
0 };
if ( s [ 0 ] == '1' ) auxArr [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
if ( s [ i ] == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1;
else auxArr [ i ] = auxArr [ i - 1 ];
}
int co... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("OGiOkJF");
param0.add("517376");
param0.add("11");
param0.add("Ze");
param0.add("8763644247018");
param0.add("00111010001");
param0.add("HGwkBKUOVu");
param0.add("652... |
if __name__ == '__main__':
param = [
('OGiOkJF',),
('517376',),
('11',),
('Ze',),
('8763644247018',),
('00111010001',),
('HGwkBKUOVu',),
('652',),
('101000011110',),
('kvdpG ',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*p... |
int main() {
int n_success = 0;
vector<string> param0 {"OGiOkJF","517376","11","Ze","8763644247018","00111010001","HGwkBKUOVu","652","101000011110","kvdpG "};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
... |
EVEN_FIBONACCI_NUMBERS_SUM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EVEN_FIBONACCI_NUMBERS_SUM{
static int f_gold ( int limit ) {
if ( limit < 2 ) return 0 ;
long ef1 = 0 , ef2 = 2 ;
long sum = ef1 + ef2 ;
while ( ef2 <= limit ) {
long ef3 = 4 * ef2 + ef1 ;
if ( ef... | def f_gold ( limit ) :
if ( limit < 2 ) :
return 0
ef1 = 0
ef2 = 2
sm = ef1 + ef2
while ( ef2 <= limit ) :
ef3 = 4 * ef2 + ef1
if ( ef3 > limit ) :
break
ef1 = ef2
ef2 = ef3
sm = sm + ef2
return sm
|
using namespace std;
int f_gold ( int limit ) {
if ( limit < 2 ) return 0;
long long int ef1 = 0, ef2 = 2;
long long int sum = ef1 + ef2;
while ( ef2 <= limit ) {
long long int ef3 = 4 * ef2 + ef1;
if ( ef3 > limit ) break;
ef1 = ef2;
ef2 = ef3;
sum += ef2;
}
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(67);
param0.add(89);
param0.add(12);
param0.add(94);
param0.add(96);
param0.add(25);
param0.add(49);
param0.add(8);
param0.add(33);
param0.add(59);
for(in... |
if __name__ == '__main__':
param = [
(67,),
(89,),
(12,),
(94,),
(96,),
(25,),
(49,),
(8,),
(33,),
(59,)
]
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 {67,89,12,94,96,25,49,8,33,59};
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 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED{
static boolean f_gold ( int arr [ ] , int n ) {
int max = Integer . MIN_VALUE ;
int min = Integer . MAX_VALUE ;
for ( int i = 0 ;
i < n ;
i ++... | def f_gold ( arr , n ) :
max1 = max ( arr )
min1 = min ( arr )
m = max1 - min1 + 1
if ( m > n ) :
return False
visited = [ 0 ] * m
for i in range ( 0 , n ) :
visited [ arr [ i ] - min1 ] = True
for i in range ( 0 , m ) :
if ( visited [ i ] == False ) :
ret... |
using namespace std;
bool f_gold ( int arr [ ], int n ) {
int max = * max_element ( arr, arr + n );
int min = * min_element ( arr, arr + n );
int m = max - min + 1;
if ( m > n ) return false;
bool visited [ m ];
memset ( visited, false, sizeof ( visited ) );
for ( int i = 0;
i < n;
i ++ ) visited [ a... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,19,25,65,72,75,83,90,92});
param0.add(new int[]{46,2,28,-44,74,-36,-8,30,-96,60,52,-58,16,-38,78,38,-28,16,26,-42,48,40,6,72});
param0.add(new int[]{0,1,1,1});
param0.a... |
if __name__ == '__main__':
param = [
([2, 4, 19, 25, 65, 72, 75, 83, 90, 92],8,),
([46, 2, 28, -44, 74, -36, -8, 30, -96, 60, 52, -58, 16, -38, 78, 38, -28, 16, 26, -42, 48, 40, 6, 72],14,),
([0, 1, 1, 1],2,),
([50, 21, 9, 29, 86, 2, 82, 49, 34, 18, 77, 83, 44, 67, 85, 58, 15, 85, 22, 3, 39, 67, 42... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,19,25,65,72,75,83,90,92},{46,2,28,-44,74,-36,-8,30,-96,60,52,-58,16,-38,78,38,-28,16,26,-42,48,40,6,72},{0,1,1,1},{50,21,9,29,86,2,82,49,34,18,77,83,44,67,85,58,15,85,22,3,39,67,42,37,6,35,18,57,41,32,39,30,41,68,84,36,64,36},{-92,-82,-80,-78,-66... |
HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING{
static int f_gold ( int arr [ ] , int n , int x ) {
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] == x ) return i ;
}
return - 1 ;
}
| null |
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
for ( int 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[]{3,15,15,15,16,17,23,23,33,33,40,43,55,56,63,66,69,76,79,88,99});
param0.add(new int[]{78,-64,-20,12,96,54,16,50,-20,96,-22,-84,54,-66,-16,-78,-78,90,-46,-70,-72,12,96,-86,42,-80,8,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,15,15,15,16,17,23,23,33,33,40,43,55,56,63,66,69,76,79,88,99},{78,-64,-20,12,96,54,16,50,-20,96,-22,-84,54,-66,-16,-78,-78,90,-46,-70,-72,12,96,-86,42,-80,8,-2,70,4,70},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{73,60,4,59,75,39,39,30,66,11,90,80,46... |
COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2{
static int f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) {
int count = 0 ;
int l = 0 , r = n - 1 ;
while ( l < m && r >= 0 ) {
... | def f_gold ( arr1 , arr2 , m , n , x ) :
count , l , r = 0 , 0 , n - 1
while ( l < m and r >= 0 ) :
if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) :
l += 1
r -= 1
count += 1
elif ( ( arr1 [ l ] + arr2 [ r ] ) < x ) :
l += 1
else :
r -=... |
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int x ) {
int count = 0;
int l = 0, r = n - 1;
while ( l < m && r >= 0 ) {
if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) {
l ++;
r --;
count ++;
}
else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++;
else r --;
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{5,5,7,10,14,14,17,21,32,34,37,40,40,40,46,46,50,50,51,55,57,62,65,67,67,69,70,70,72,73,76,77,77,78,84,85,85,86,87,88,88,89,89,90,93,99});
param0.add(new int[]{-84,52,-34,96,16,92,-... |
if __name__ == '__main__':
param = [
([5, 5, 7, 10, 14, 14, 17, 21, 32, 34, 37, 40, 40, 40, 46, 46, 50, 50, 51, 55, 57, 62, 65, 67, 67, 69, 70, 70, 72, 73, 76, 77, 77, 78, 84, 85, 85, 86, 87, 88, 88, 89, 89, 90, 93, 99],[2, 5, 8, 8, 10, 12, 13, 15, 17, 18, 20, 20, 21, 27, 28, 31, 34, 37, 40, 46, 48, 52, 53, 54... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,5,7,10,14,14,17,21,32,34,37,40,40,40,46,46,50,50,51,55,57,62,65,67,67,69,70,70,72,73,76,77,77,78,84,85,85,86,87,88,88,89,89,90,93,99},{-84,52,-34,96,16,92,-64,-74},{0,0,0,0,0,0,0,0,0,0,0,0,0,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... |
CHECK_LINE_PASSES_ORIGIN |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_LINE_PASSES_ORIGIN{
static boolean f_gold ( int x1 , int y1 , int x2 , int y2 ) {
return ( x1 * ( y2 - y1 ) == y1 * ( x2 - x1 ) ) ;
}
| def f_gold ( x1 , y1 , x2 , y2 ) :
return ( x1 * ( y2 - y1 ) == y1 * ( x2 - x1 ) )
|
using namespace std;
bool f_gold ( int x1, int y1, int x2, int y2 ) {
return ( x1 * ( y2 - y1 ) == y1 * ( x2 - x1 ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(10);
param0.add(0);
param0.add(1);
param0.add(82);
param0.add(78);
param0.add(13);
param0.add(18);
param0.add(42);
param0.add(29);
List<Int... |
if __name__ == '__main__':
param = [
(1,28,2,56,),
(10,0,20,0,),
(0,1,0,17,),
(1,1,10,10,),
(82,86,19,4,),
(78,86,11,6,),
(13,46,33,33,),
(18,29,95,12,),
(42,35,25,36,),
(29,17,45,35,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fi... |
int main() {
int n_success = 0;
vector<int> param0 {1,10,0,1,82,78,13,18,42,29};
vector<int> param1 {28,0,1,1,86,86,46,29,35,17};
vector<int> param2 {2,20,0,10,19,11,33,95,25,45};
vector<int> param3 {56,0,17,10,4,6,33,12,36,35};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(p... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.