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 ⌀ |
|---|---|---|---|---|---|---|
MAXIMUM_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY{
static int f_gold ( int [ ] arr , int n ) {
HashMap < Integer , Integer > map = new HashMap < > ( ) ;
int max_dist = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {... | def f_gold ( arr , n ) :
mp = { }
maxDict = 0
for i in range ( n ) :
if arr [ i ] not in mp.keys ( ) :
mp [ arr [ i ] ] = i
else :
maxDict = max ( maxDict , i - mp [ arr [ i ] ] )
return maxDict
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > mp;
int max_dist = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( mp . find ( arr [ i ] ) == mp . end ( ) ) mp [ arr [ i ] ] = i;
else max_dist = max ( max_dist, i - mp [ arr [ i ] ] );
}
return max_dist;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,20,25,28,29,31,34,35,38,39,41,43,46,55,56,60,65,66,74,77,79,80,81,83,84,88,88,88,90,91,99});
param0.add(new int[]{26,14,56,84,-56,-84,-98,12,-78,18,-42,58,46,-66,-46,66,98,34,-16... |
if __name__ == '__main__':
param = [
([1, 20, 25, 28, 29, 31, 34, 35, 38, 39, 41, 43, 46, 55, 56, 60, 65, 66, 74, 77, 79, 80, 81, 83, 84, 88, 88, 88, 90, 91, 99],27,),
([26, 14, 56, 84, -56, -84, -98, 12, -78, 18, -42, 58, 46, -66, -46, 66, 98, 34, -16, 8, -20, 66, 74, 26, 42, -84, 38, 86, 14, 86, 26, -42,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,20,25,28,29,31,34,35,38,39,41,43,46,55,56,60,65,66,74,77,79,80,81,83,84,88,88,88,90,91,99},{26,14,56,84,-56,-84,-98,12,-78,18,-42,58,46,-66,-46,66,98,34,-16,8,-20,66,74,26,42,-84,38,86,14,86,26,-42,-30,6,-54,-76,-66,18,58,66,74,-62,8,-42,62,-14,-90... |
NTH_PENTAGONAL_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NTH_PENTAGONAL_NUMBER{
static int f_gold ( int n ) {
return ( 3 * n * n - n ) / 2 ;
}
| def f_gold ( n ) :
return ( 3 * n * n - n ) / 2
|
using namespace std;
int f_gold ( int n ) {
return ( 3 * n * n - n ) / 2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(96);
param0.add(93);
param0.add(15);
param0.add(8);
param0.add(21);
param0.add(14);
param0.add(11);
param0.add(79);
param0.add(24);
param0.add(94);
for(in... |
if __name__ == '__main__':
param = [
(96,),
(93,),
(15,),
(8,),
(21,),
(14,),
(11,),
(79,),
(24,),
(94,)
]
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 {96,93,15,8,21,14,11,79,24,94};
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();
... |
SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N{
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 ... | 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(13);
param0.add(27);
param0.add(1);
param0.add(24);
param0.add(98);
param0.add(94);
param0.add(36);
param0.add(41);
param0.add(74);
param0.add(39);
for(in... |
if __name__ == '__main__':
param = [
(13,),
(27,),
(1,),
(24,),
(98,),
(94,),
(36,),
(41,),
(74,),
(39,)
]
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 {13,27,1,24,98,94,36,41,74,39};
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();
... |
K_TH_ELEMENT_TWO_SORTED_ARRAYS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class K_TH_ELEMENT_TWO_SORTED_ARRAYS{
static int f_gold ( int arr1 [ ] , int arr2 [ ] , int m , int n , int k ) {
int [ ] sorted1 = new int [ m + n ] ;
int i = 0 , j = 0 , d = 0 ;
while ( i < m && j < n ) {
if... | def f_gold ( arr1 , arr2 , m , n , k ) :
sorted1 = [ 0 ] * ( m + n )
i = 0
j = 0
d = 0
while ( i < m and j < n ) :
if ( arr1 [ i ] < arr2 [ j ] ) :
sorted1 [ d ] = arr1 [ i ]
i += 1
else :
sorted1 [ d ] = arr2 [ j ]
j += 1
d += ... |
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int k ) {
int sorted1 [ m + n ];
int i = 0, j = 0, d = 0;
while ( i < m && j < n ) {
if ( arr1 [ i ] < arr2 [ j ] ) sorted1 [ d ++ ] = arr1 [ i ++ ];
else sorted1 [ d ++ ] = arr2 [ j ++ ];
}
while ( i < m ) sorted1 [ d ++ ] =... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,2,4,4,9,10,14,16,16,19,20,21,25,26,29,36,36,37,38,44,44,49,53,54,56,61,62,64,72,72,73,77,80,84,84,87,93,94});
param0.add(new int[]{2,4,-90,62,22,-94,-74,-22,44,-94,20,-40,20,0,32... |
if __name__ == '__main__':
param = [
([2, 2, 4, 4, 9, 10, 14, 16, 16, 19, 20, 21, 25, 26, 29, 36, 36, 37, 38, 44, 44, 49, 53, 54, 56, 61, 62, 64, 72, 72, 73, 77, 80, 84, 84, 87, 93, 94],[6, 8, 10, 10, 12, 14, 24, 31, 33, 33, 35, 35, 35, 41, 46, 47, 49, 51, 52, 56, 57, 59, 62, 65, 72, 72, 73, 73, 79, 80, 82, 83... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,4,4,9,10,14,16,16,19,20,21,25,26,29,36,36,37,38,44,44,49,53,54,56,61,62,64,72,72,73,77,80,84,84,87,93,94},{2,4,-90,62,22,-94,-74,-22,44,-94,20,-40,20,0,32,24,78,8,4,98,-74,-60},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,... |
FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7{
static int f_gold ( String n ) {
int k = 0 , pos = 0 , i = 0 ;
while ( k != n . length ( ) ) {
switch ( n . charAt ( i ) ) {
case '4' : pos = pos * ... | def f_gold(n):
i = 0
j = len(n)
pos = 0
while (i < j):
if (n[i] == '4'):
pos = pos * 2 + 1
if (n[i] == '7'):
pos = pos * 2 + 2
i = i + 1
return pos
|
using namespace std;
int f_gold ( string n ) {
int i = 0, pos = 0;
while ( n [ i ] != '\0' ) {
switch ( n [ i ] ) {
case '4' : pos = pos * 2 + 1;
break;
case '7' : pos = pos * 2 + 2;
break;
}
i ++;
}
return pos;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("7");
param0.add("305745689");
param0.add("444");
param0.add("4");
param0.add("2074");
param0.add("27");
param0.add("447");
param0.add("255");
param0.add("10000111... |
if __name__ == '__main__':
param = [
('7',),
('305745689',),
('444',),
('4',),
('2074',),
('27',),
('447',),
('255',),
('10000111111011',),
('fAKcSDRTNz',)
]
n_success = 0
for i, parameters_set in enumerate(param):
... |
int main() {
int n_success = 0;
vector<string> param0 {"7","305745689","444","4","2074","27","447","255","10000111111011","fAKcSDRTNz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Result... |
FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT{
static int f_gold ( int n ) {
if ( n == 0 ) return 0 ;
while ( n != 1 ) {
if ( n % 4 != 0 ) return 0 ;
n = n / 4 ;
}
return 1 ;
}
| def f_gold ( n ) :
if ( n == 0 ) :
return False
while ( n != 1 ) :
if ( n % 4 != 0 ) :
return False
n = n // 4
return True
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(45);
param0.add(16);
param0.add(15);
param0.add(91);
param0.add(82);
param0.add(18);
param0.add(31);
param0.add(6);
param0.add(93);
param0.add(35);
for(in... |
if __name__ == '__main__':
param = [
(45,),
(16,),
(15,),
(91,),
(82,),
(18,),
(31,),
(6,),
(93,),
(35,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... | null |
QUICK_WAY_CHECK_CHARACTERS_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class QUICK_WAY_CHECK_CHARACTERS_STRING{
static boolean f_gold ( String s ) {
int n = s . length ( ) ;
for ( int i = 1 ;
i < n ;
i ++ ) if ( s . charAt ( i ) != s . charAt ( 0 ) ) return false ;
return true ;
... | def f_gold ( s ) :
n = len ( s )
for i in range ( 1 , n ) :
if s [ i ] != s [ 0 ] :
return False
return True
|
using namespace std;
bool f_gold ( string s ) {
int n = s . length ( );
for ( int i = 1;
i < n;
i ++ ) if ( s [ i ] != s [ 0 ] ) return false;
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("");
param0.add("ggg");
param0.add("11");
param0.add("KoYIHns");
param0.add("232");
param0.add("10111000011101");
param0.add("DDDD");
param0.add("11");
param0.add(... |
if __name__ == '__main__':
param = [
('',),
('ggg',),
('11',),
('KoYIHns',),
('232',),
('10111000011101',),
('DDDD',),
('11',),
('11111',),
('ewJvixQzu',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gol... |
int main() {
int n_success = 0;
vector<string> param0 {"","ggg","11","KoYIHns","232","10111000011101","DDDD","11","11111","ewJvixQzu"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results... |
FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int min = arr [ 0 ] , min_index = - 1 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( min > arr [ i ] ) {
min = arr... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int min = arr [ 0 ], min_index;
for ( int i = 0;
i < n;
i ++ ) {
if ( min > arr [ i ] ) {
min = arr [ i ];
min_index = i;
}
}
return min_index;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,4,4,9,10,13,14,15,28,28,41,46,47,48,52,55,62,67,69,73,74,79,79,80,87,90,96,99});
param0.add(new int[]{44,62,-40,62,98,30,16,76,-4,-2,78,-96,78,-72,94,-66,-38,-80,40,78,-26,28,-40... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,4,9,10,13,14,15,28,28,41,46,47,48,52,55,62,67,69,73,74,79,79,80,87,90,96,99},{44,62,-40,62,98,30,16,76,-4,-2,78,-96,78,-72,94,-66,-38,-80,40,78,-26,28,-40,-32,-64,76,26,-2,12,82,16,-46,10,70,-62,-54,-6,58,32,98},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1... |
SWAP_ALL_ODD_AND_EVEN_BITS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SWAP_ALL_ODD_AND_EVEN_BITS{
static int f_gold ( int x ) {
int even_bits = x & 0xAAAAAAAA ;
int odd_bits = x & 0x55555555 ;
even_bits >>= 1 ;
odd_bits <<= 1 ;
return ( even_bits | odd_bits ) ;
}
| def f_gold ( x ) :
even_bits = x & 0xAAAAAAAA
odd_bits = x & 0x55555555
even_bits >>= 1
odd_bits <<= 1
return ( even_bits | odd_bits )
|
using namespace std;
unsigned int f_gold ( unsigned int x ) {
unsigned int even_bits = x & 0xAAAAAAAA;
unsigned int odd_bits = x & 0x55555555;
even_bits >>= 1;
odd_bits <<= 1;
return ( even_bits | odd_bits );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(99);
param0.add(94);
param0.add(11);
param0.add(3);
param0.add(77);
param0.add(57);
param0.add(54);
param0.add(66);
param0.add(98);
param0.add(36);
for(in... |
if __name__ == '__main__':
param = [
(99,),
(94,),
(11,),
(3,),
(77,),
(57,),
(54,),
(66,),
(98,),
(36,)
]
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 {99,94,11,3,77,57,54,66,98,36};
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();
... |
QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE{
static int f_gold ( int arr [ ] , int n , int x , int y ) {
int count = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( arr [ i ] >= x && arr [ i ] <= y ) ... | def f_gold ( arr , n , x , y ) :
count = 0 ;
for i in range ( n ) :
if ( arr [ i ] >= x and arr [ i ] <= y ) :
count += 1
return count
|
using namespace std;
int f_gold ( int arr [ ], int n, int x, int y ) {
int count = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] >= x && arr [ i ] <= y ) count ++;
}
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{9,16,19,24,36,38,42,49,51,53,53,57,57,58,71,78,78,92,92,93});
param0.add(new int[]{28,-74,-18,10,26,28,-96,-80,82,94,22,50,72,-90,76,50,20,-44,-80});
param0.add(new int[]{0,0,0... |
if __name__ == '__main__':
param = [
([9, 16, 19, 24, 36, 38, 42, 49, 51, 53, 53, 57, 57, 58, 71, 78, 78, 92, 92, 93],13,12,13,),
([28, -74, -18, 10, 26, 28, -96, -80, 82, 94, 22, 50, 72, -90, 76, 50, 20, -44, -80],18,13,13,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,16,19,24,36,38,42,49,51,53,53,57,57,58,71,78,78,92,92,93},{28,-74,-18,10,26,28,-96,-80,82,94,22,50,72,-90,76,50,20,-44,-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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{25,8,66,90,50,65,76,90,27},{-98,-96,-90... |
CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND{
static int f_gold ( double h , double m ) {
if ( h < 0 || m < 0 || h > 12 || m > 60 ) System . out . println ( "Wrong input" ) ;
if ( h == 12 ) h = 0 ;
if ( m == 60 ) m... | def f_gold ( h , m ) :
if ( h < 0 or m < 0 or h > 12 or m > 60 ) :
print ( 'Wrong input' )
if ( h == 12 ) :
h = 0
if ( m == 60 ) :
m = 0
hour_angle = 0.5 * ( h * 60 + m )
minute_angle = 6 * m
angle = abs ( hour_angle - minute_angle )
angle = min ( 360 - angle , angle ... |
using namespace std;
int f_gold ( double h, double m ) {
if ( h < 0 || m < 0 || h > 12 || m > 60 ) printf ( "Wrong input" );
if ( h == 12 ) h = 0;
if ( m == 60 ) m = 0;
int hour_angle = 0.5 * ( h * 60 + m );
int minute_angle = 6 * m;
int angle = abs ( hour_angle - minute_angle );
angle = min ( 360 - angl... |
public static void main(String args[]) {
int n_success = 0;
List<Double> param0 = new ArrayList<>();
param0.add(7322.337365895532);
param0.add(-0.5025472034247969);
param0.add(8735.336068205026);
param0.add(-5478.862697905712);
param0.add(8264.126919165505);
param0.add(-9671.31177384283... |
if __name__ == '__main__':
param = [
(7322.337365895532,6996.326968156217,),
(-0.5025472034247969,-2910.070017192333,),
(8735.336068205026,1910.3752934680874,),
(-5478.862697905712,-9470.18148108585,),
(8264.126919165505,7058.937313484608,),
(-9671.311773842834,-3867.070379361206,),
(99... |
int main() {
int n_success = 0;
vector<double> param0 {7322.337365895532,-0.5025472034247969,8735.336068205026,-5478.862697905712,8264.126919165505,-9671.311773842834,9995.328351000411,-5274.574323066984,1310.8711644223736,-2829.678131972794};
vector<double> param1 {6996.326968156217,-2910.070017192333,191... |
TRIANGULAR_MATCHSTICK_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class TRIANGULAR_MATCHSTICK_NUMBER{
public static int f_gold ( int x ) {
return ( 3 * x * ( x + 1 ) ) / 2 ;
}
| def f_gold ( x ) :
return ( 3 * x * ( x + 1 ) ) / 2
|
using namespace std;
int f_gold ( int x ) {
return ( 3 * x * ( x + 1 ) ) / 2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(6);
param0.add(25);
param0.add(15);
param0.add(30);
param0.add(17);
param0.add(80);
param0.add(27);
param0.add(13);
param0.add(12);
param0.add(67);
for(in... |
if __name__ == '__main__':
param = [
(6,),
(25,),
(15,),
(30,),
(17,),
(80,),
(27,),
(13,),
(12,),
(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 {6,25,15,30,17,80,27,13,12,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();
... |
CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1{
static boolean f_gold ( int arr [ ] , int n ) {
if ( n == 1 ) {
return true ;
}
int i ;
for ( i = 1 ;
arr [ i - 1 ] < arr [ i ] && i < n ;
i ++ ) ;
... | def f_gold ( arr , n ) :
if ( n == 1 ) :
return True
i = 1
for i in range ( 1 , n ) :
if arr [ i - 1 ] < arr [ i ] :
if ( i == n ) :
return True
j = i
while ( arr [ j ] < arr [ j - 1 ] ) :
if ( i > 1 and arr [ j ] < arr [ i - 2 ] ) :
re... |
using namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 1 ) return true;
int i;
for ( i = 1;
i < n && arr [ i - 1 ] < arr [ i ];
i ++ );
if ( i == n ) return true;
int j = i;
while ( arr [ j ] < arr [ j - 1 ] ) {
if ( i > 1 && arr [ j ] < arr [ i - 2 ] ) return false;
j ++;
}
if... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,5,4,3});
param0.add(new int[]{1,2,4,5,3});
param0.add(new int[]{1,1,0,0});
param0.add(new int[]{5,99,40,33,61,4,64,92,28,27,21,35,40,79,10,20,76,87,80,15,57,39,96,98,99... |
if __name__ == '__main__':
param = [
([1,2,5,4,3],5,),
([1,2,4,5,3],5,),
([1,1,0,0],4,),
([5, 99, 40, 33, 61, 4, 64, 92, 28, 27, 21, 35, 40, 79, 10, 20, 76, 87, 80, 15, 57, 39, 96, 98, 99, 72, 72, 50, 61, 39, 35, 70, 27],32,),
([-98, -92, -86, -58, -22, -12, 0, 26],6,),
([0, 0, 1, 0, 1, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {
{1,2,5,4,3},
{1,2,4,5,3},
{1,1,0,0},
{5,99,40,33,61,4,64,92,28,27,21,35,40,79,10,20,76,87,80,15,57,39,96,98,99,72,72,50,61,39,35,70,27},
{-98,-92,-86,-58,-22,-12,0,26},
{0,0,1,0,1,0,1,0,0,1,0,1,0,1,1,1,0,1,1,1,1,1,0,0,1,0,1,0,... |
C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1{
static int f_gold ( int [ ] arr , int n ) {
Arrays . sort ( arr ) ;
return arr [ n - 1 ] ;
}
| def f_gold ( arr , n ) :
return max ( arr )
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
return * max_element ( arr, arr + n );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{10,12,14,16,17,17,20,24,26,28,37,38,41,45,49,50,59,61,63,65,65,66,69,70,70,73,73,74,81,81,83,87,94,97});
param0.add(new int[]{-56,38,-22,84,-60,2,68,-78,62,-98,24,26,48,62,-80,-14,... |
if __name__ == '__main__':
param = [
([10, 12, 14, 16, 17, 17, 20, 24, 26, 28, 37, 38, 41, 45, 49, 50, 59, 61, 63, 65, 65, 66, 69, 70, 70, 73, 73, 74, 81, 81, 83, 87, 94, 97],17,),
([-56, 38, -22, 84, -60, 2, 68, -78, 62, -98, 24, 26, 48, 62, -80, -14, -84, 12, -54, -12, -20, -82, 10, -34, -50, -72, 78, 16... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{10,12,14,16,17,17,20,24,26,28,37,38,41,45,49,50,59,61,63,65,65,66,69,70,70,73,73,74,81,81,83,87,94,97},{-56,38,-22,84,-60,2,68,-78,62,-98,24,26,48,62,-80,-14,-84,12,-54,-12,-20,-82,10,-34,-50,-72,78,16,30,-76,72,34,6,52,44,18,-38,48,-14},{0,0,0,0,0,0... |
PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR{
static int f_gold ( int num , int divisor ) {
return ( num - divisor * ( num / divisor ) ) ;
}
| def f_gold ( num , divisor ) :
return ( num - divisor * ( num // divisor ) )
|
using namespace std;
int f_gold ( int num, int divisor ) {
return ( num - divisor * ( num / divisor ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(80);
param0.add(63);
param0.add(1);
param0.add(22);
param0.add(66);
param0.add(61);
param0.add(45);
param0.add(29);
param0.add(95);
param0.add(9);
List<In... |
if __name__ == '__main__':
param = [
(80,54,),
(63,21,),
(1,56,),
(22,39,),
(66,7,),
(61,67,),
(45,63,),
(29,44,),
(95,65,),
(9,68,)
]
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 {80,63,1,22,66,61,45,29,95,9};
vector<int> param1 {54,21,56,39,7,67,63,44,65,68};
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_INCREASING_SUBSEQUENCE_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_INCREASING_SUBSEQUENCE_1{
static int f_gold ( int arr [ ] , int n ) {
int f_gold [ ] = new int [ n ] ;
int i , j , max = 0 ;
for ( i = 0 ;
i < n ;
i ++ ) f_gold [ i ] = 1 ;
for ( i = 1 ;
i < ... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int f_gold [ n ];
f_gold [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
f_gold [ i ] = 1;
for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1;
}
return * max_el... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{14,17,27,28,36,38,40,49,51,57,58,61,62,71,91,94,99});
param0.add(new int[]{-48,54,98,68,24,-46,4,-28,-34,40});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{14,17,27,28,36,38,40,49,51,57,58,61,62,71,91,94,99},{-48,54,98,68,24,-46,4,-28,-34,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{94,74,27,59,3,71,67,91,91,87,1,79,42,33,85,37,76,86,80,84,62,8,31,54,17,48,4,12,88,63,12,51,36,20,73,48,41,88,... |
CONSTRUCT_LEXICOGRAPHICALLY_SMALLEST_PALINDROME |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CONSTRUCT_LEXICOGRAPHICALLY_SMALLEST_PALINDROME{
static String f_gold ( char [ ] str , int len ) {
int i = 0 , j = len - 1 ;
for ( ;
i < j ;
i ++ , j -- ) {
if ( str [ i ] == str [ j ] && str [ i ] != ... | def f_gold ( string , l ) :
string = list ( string )
i = - 1
j = l
while i < j :
i += 1
j -= 1
if ( string [ i ] == string [ j ] and string [ i ] != '*' ) :
continue
elif ( string [ i ] == string [ j ] and string [ i ] == '*' ) :
string [ i ] = 'a'... | null |
public static void main(String args[]) {
int n_success = 0;
List<char [ ]> param0 = new ArrayList<>();
param0.add(new char[]{'A','B','C','G','I','L','L','O','O','P','Q','S','W','Y','c','d','e','f','f','i','m','m','o','q','v','w','x','x','y','z'});
param0.add(new char[]{'3','2','3','6','8','9','0','5','... |
if __name__ == '__main__':
param = [
(['A', 'B', 'C', 'G', 'I', 'L', 'L', 'O', 'O', 'P', 'Q', 'S', 'W', 'Y', 'c', 'd', 'e', 'f', 'f', 'i', 'm', 'm', 'o', 'q', 'v', 'w', 'x', 'x', 'y', 'z'],27,),
(['3', '2', '3', '6', '8', '9', '0', '5', '0', '5', '8', '7', '9', '0', '3', '6', '9', '6', '2', '4', '2', '3', ... | null |
REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE{
public static void f_gold ( int arr [ ] , int n ) {
int max_idx = n - 1 , min_idx = 0 ;
int max_elem = arr [ n - 1 ] + 1 ;
for ( int i = 0 ;
i < n ;
i ... | def f_gold ( arr , n ) :
max_idx = n - 1
min_idx = 0
max_elem = arr [ n - 1 ] + 1
for i in range ( 0 , n ) :
if i % 2 == 0 :
arr [ i ] += ( arr [ max_idx ] % max_elem ) * max_elem
max_idx -= 1
else :
arr [ i ] += ( arr [ min_idx ] % max_elem ) * max_el... |
using namespace std;
void f_gold ( int arr [ ], int n ) {
int max_idx = n - 1, min_idx = 0;
int max_elem = arr [ n - 1 ] + 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) {
arr [ i ] += ( arr [ max_idx ] % max_elem ) * max_elem;
max_idx --;
}
else {
arr [ i ] += ( arr [ mi... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,1,2,3,9,10,14,22,26,28,29,29,30,32,32,32,34,37,39,40,42,42,42,43,45,47,49,52,53,54,56,58,59,68,71,73,76,81,81,83,84,91,94});
param0.add(new int[]{50,46,6,-57,67,34,-52,26,-93,97,... |
if __name__ == '__main__':
param = [
([1, 1, 2, 3, 9, 10, 14, 22, 26, 28, 29, 29, 30, 32, 32, 32, 34, 37, 39, 40, 42, 42, 42, 43, 45, 47, 49, 52, 53, 54, 56, 58, 59, 68, 71, 73, 76, 81, 81, 83, 84, 91, 94],29,),
([50, 46, 6, -57, 67, 34, -52, 26, -93, 97, -84, 29, 15, -63, 65, 25, -19, 92, -38, -28, 89, 25... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,9,10,14,22,26,28,29,29,30,32,32,32,34,37,39,40,42,42,42,43,45,47,49,52,53,54,56,58,59,68,71,73,76,81,81,83,84,91,94},{50,46,6,-57,67,34,-52,26,-93,97,-84,29,15,-63,65,25,-19,92,-38,-28,89,25,61,-34,-70,-80,88,-18,7,52,32,-63,32,-23,-11,46,-12... |
HORNERS_METHOD_POLYNOMIAL_EVALUATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HORNERS_METHOD_POLYNOMIAL_EVALUATION{
static int f_gold ( int poly [ ] , int n , int x ) {
int result = poly [ 0 ] ;
for ( int i = 1 ;
i < n ;
i ++ ) result = result * x + poly [ i ] ;
return result ;
}
... | def f_gold ( poly , n , x ) :
result = poly [ 0 ]
for i in range ( 1 , n ) :
result = result * x + poly [ i ]
return result
|
using namespace std;
int f_gold ( int poly [ ], int n, int x ) {
int result = poly [ 0 ];
for ( int i = 1;
i < n;
i ++ ) result = result * x + poly [ i ];
return result;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,18,22,27,31,33,36,36,37,37,40,48,49,49,50,58,66,71,75,85,89,91});
param0.add(new int[]{42,-88,28,8,30,-8,-16,86,50,84,12,-20,-70,-40,-54,-76,84,90,-40,-68,-40,36,-34,14,94,-44,70... |
if __name__ == '__main__':
param = [
([3, 18, 22, 27, 31, 33, 36, 36, 37, 37, 40, 48, 49, 49, 50, 58, 66, 71, 75, 85, 89, 91],16,16,),
([42, -88, 28, 8, 30, -8, -16, 86, 50, 84, 12, -20, -70, -40, -54, -76, 84, 90, -40, -68, -40, 36, -34, 14, 94, -44, 70, 58, -48, -72, 14, -70, 32],31,20,),
([0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,18,22,27,31,33,36,36,37,37,40,48,49,49,50,58,66,71,75,85,89,91},{42,-88,28,8,30,-8,-16,86,50,84,12,-20,-70,-40,-54,-76,84,90,-40,-68,-40,36,-34,14,94,-44,70,58,-48,-72,14,-70,32},{0,0,0,0,0,0,0,1,1,1,1},{66,72,27,72,71,75,94,49,47,21,21,71,84,61,14... |
PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS{
static boolean f_gold ( int arr [ ] , int n , int x ) {
for ( int i = 0 ;
i < n - 1 ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) if ( arr [ i ] * a... | def f_gold ( arr , n , x ) :
for i in arr :
for j in arr :
if i * j == x :
return True
return False
|
using namespace std;
bool f_gold ( int arr [ ], int n, int x ) {
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
i < n;
i ++ ) if ( arr [ i ] * arr [ j ] == x ) return true;
return false;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{10, 20, 9, 40});
param0.add(new int[]{1,-10, 20, 9, -40});
param0.add(new int[]{0,0,0,0,0,1,1,1,1});
param0.add(new int[]{4,10, 20, 9, -40});
param0.add(new int[]{-90,-... |
if __name__ == '__main__':
param = [
([10, 20, 9, 40],4,400,),
([1,-10, 20, 9, -40],5,400,),
([0,0,0,0,0,1,1,1,1],7,8,),
([4,10, 20, 9, -40],5,-400,),
([-90,-86,-76,-72,-70,-62,-56,-50,-18,-12,-10,4,16,26,42,48,52,54,54,70,84,86,88,98],23,23,),
([1],0,0,),
([... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,5,5,6,11,18,29,29,30,35,36,38,38,40,43,43,43,50,53,58,61,62,63,64,64,65,72,73,77,78,78,84,90,94,96},{-72,16,0,68,-58,58,46,38,-28,-56,-28,-14,-56,40,30,80,94,-52,0,-88,8,-96,-52,-96,48,-10,-32,-74,88,18,70},{0,0,0,0,0,1,1,1,1},{78,49,30,28,71,70,... |
FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B{
static int f_gold ( long A , long B ) {
int variable = 1 ;
if ( A == B ) return 1 ;
else if ( ( B - A ) >= 5 ) return 0 ;
else {
for ( long i = A + 1 ;
... | def f_gold ( A , B ) :
variable = 1
if ( A == B ) :
return 1
elif ( ( B - A ) >= 5 ) :
return 0
else :
for i in range ( A + 1 , B + 1 ) :
variable = ( variable * ( i % 10 ) ) % 10
return variable % 10
|
using namespace std;
int f_gold ( long long int A, long long int B ) {
int variable = 1;
if ( A == B ) return 1;
else if ( ( B - A ) >= 5 ) return 0;
else {
for ( long long int i = A + 1;
i <= B;
i ++ ) variable = ( variable * ( i % 10 ) ) % 10;
return variable % 10;
}
}
|
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(79L);
param0.add(61L);
param0.add(39L);
param0.add(39L);
param0.add(61L);
param0.add(86L);
param0.add(7L);
param0.add(86L);
param0.add(86L);
param0.add(11L);
... |
if __name__ == '__main__':
param = [
(79,84,),
(61,29,),
(39,77,),
(39,65,),
(61,78,),
(86,73,),
(7,92,),
(86,50,),
(86,63,),
(11,2,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
... |
int main() {
int n_success = 0;
vector<long> param0 {79,61,39,39,61,86,7,86,86,11};
vector<long> param1 {84,29,77,65,78,73,92,50,63,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
... |
SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES{
static int f_gold ( int s ) {
int sum = 0 ;
for ( int n = 1 ;
sum < s ;
n ++ ) {
sum += n * n ;
if ( sum == s ) return n ;
}
return - 1 ;
}
| def f_gold ( s ) :
_sum = 0
n = 1
while ( _sum < s ) :
_sum += n * n
n += 1
n -= 1
if _sum == s :
return n
return - 1
|
using namespace std;
int f_gold ( int s ) {
int sum = 0;
for ( int n = 1;
sum < s;
n ++ ) {
sum += n * n;
if ( sum == s ) return n;
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(5);
param0.add(14);
param0.add(140);
param0.add(204);
param0.add(3);
param0.add(506);
param0.add(42);
param0.add(4);
param0.add(87);
for(in... |
if __name__ == '__main__':
param = [
(1,),
(5,),
(14,),
(140,),
(204,),
(3,),
(506,),
(42,),
(4,),
(87,)
]
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,5,14,140,204,3,506,42,4,87};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
FIND_MINIMUM_DIFFERENCE_PAIR |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MINIMUM_DIFFERENCE_PAIR{
static int f_gold ( int [ ] arr , int n ) {
int diff = Integer . MAX_VALUE ;
for ( int i = 0 ;
i < n - 1 ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ) if ( Math . abs ( ( ... | def f_gold ( arr , n ) :
diff = 10 ** 20
for i in range ( n - 1 ) :
for j in range ( i + 1 , n ) :
if abs ( arr [ i ] - arr [ j ] ) < diff :
diff = abs ( arr [ i ] - arr [ j ] )
return diff
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int diff = INT_MAX;
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) if ( abs ( arr [ i ] - arr [ j ] ) < diff ) diff = abs ( arr [ i ] - arr [ j ] );
return diff;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,1,2,3,5,8,10,11,15,15,16,20,26,28,30,30,33,33,39,50,50,50,54,62,66,68,69,69,74,74,75,75,76,78,82,83,85,86,86,89,89,91,91,92,92,92,93,94,98});
param0.add(new int[]{6,6,-20,88,-78,... |
if __name__ == '__main__':
param = [
([1, 1, 2, 3, 5, 8, 10, 11, 15, 15, 16, 20, 26, 28, 30, 30, 33, 33, 39, 50, 50, 50, 54, 62, 66, 68, 69, 69, 74, 74, 75, 75, 76, 78, 82, 83, 85, 86, 86, 89, 89, 91, 91, 92, 92, 92, 93, 94, 98],32,),
([6, 6, -20, 88, -78, -18, 74, 72, 80, 76, -62, 38],11,),
([0, 1, 1,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,5,8,10,11,15,15,16,20,26,28,30,30,33,33,39,50,50,50,54,62,66,68,69,69,74,74,75,75,76,78,82,83,85,86,86,89,89,91,91,92,92,92,93,94,98},{6,6,-20,88,-78,-18,74,72,80,76,-62,38},{0,1,1,1,1},{75,85,49,66,44,89,80,39,64,70,25,21,81,33,90,68,51},{-9... |
POSITION_OF_RIGHTMOST_SET_BIT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class POSITION_OF_RIGHTMOST_SET_BIT{
public static int f_gold ( int n ) {
return ( int ) ( ( Math . log10 ( n & - n ) ) / Math . log10 ( 2 ) ) + 1 ;
}
| import math
def f_gold ( n ) :
return math.log2 ( n & - n ) + 1
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(45);
param0.add(26);
param0.add(74);
param0.add(80);
param0.add(46);
param0.add(67);
param0.add(16);
param0.add(87);
param0.add(27);
param0.add(17);
for(i... |
if __name__ == '__main__':
param = [
(45,),
(26,),
(74,),
(80,),
(46,),
(67,),
(16,),
(87,),
(27,),
(17,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
... | null |
STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER{
static boolean f_gold ( int ip [ ] , int op [ ] , int n ) {
Queue < Integer > input = new LinkedList < > ( ) ;
for ( int i = 0 ;
i < n ;
... | from queue import Queue
def f_gold ( ip , op , n ) :
Input = Queue ( )
for i in range ( n ) :
Input.put ( ip [ i ] )
output = Queue ( )
for i in range ( n ) :
output.put ( op [ i ] )
tempStack = [ ]
while ( not Input.empty ( ) ) :
ele = Input.queue [ 0 ]
Input.ge... |
using namespace std;
bool f_gold ( int ip [ ], int op [ ], int n ) {
queue < int > input;
for ( int i = 0;
i < n;
i ++ ) input . push ( ip [ i ] );
queue < int > output;
for ( int i = 0;
i < n;
i ++ ) output . push ( op [ i ] );
stack < int > tempStack;
while ( ! input . empty ( ) ) {
int ele =... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,3,3,3,4,5,6,9,18,20,35,39,39,45,50,55,57,61,63,65,72,73,77,77,78,87,88,91,93,95,98});
param0.add(new int[]{-86,10,-8,8,-24,-2,-84,-86,-54,50,56,-22,-8,-62,0,-50,-32});
param0... |
if __name__ == '__main__':
param = [
([2, 3, 3, 3, 4, 5, 6, 9, 18, 20, 35, 39, 39, 45, 50, 55, 57, 61, 63, 65, 72, 73, 77, 77, 78, 87, 88, 91, 93, 95, 98],[2, 5, 7, 13, 16, 23, 24, 25, 27, 31, 31, 33, 34, 35, 38, 46, 49, 49, 51, 52, 58, 61, 62, 66, 68, 71, 73, 78, 91, 94, 98],23,),
([-86, 10, -8, 8, -24, -... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,3,3,4,5,6,9,18,20,35,39,39,45,50,55,57,61,63,65,72,73,77,77,78,87,88,91,93,95,98},{-86,10,-8,8,-24,-2,-84,-86,-54,50,56,-22,-8,-62,0,-50,-32},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,42,88,89,41,71,67,5,84,20,75,36... |
MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1{
static int f_gold ( int a [ ] , int n ) {
return ( int ) Math . floor ( ( - 1 + Math . sqrt ( 1 + ( 8 * n ) ) ) / 2 ) ;
}
| import math
def f_gold ( a , n ) :
return ( - 1 + int ( math.sqrt ( 1 + ( 8 * n ) ) ) ) // 2
|
using namespace std;
int f_gold ( int a [ ], int n ) {
return floor ( ( - 1 + sqrt ( 1 + ( 8 * n ) ) ) / 2 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,2,3,5,6,7,8,8,12,15,16,18,18,20,21,21,22,22,24,24,25,30,35,42,49,52,55,55,63,68,70,72,73,77,80,83,87,87,88,88,94,95,97});
param0.add(new int[]{48,-72,84,-24,28,94,36,28,32,66,-... |
if __name__ == '__main__':
param = [
([1, 2, 2, 3, 5, 6, 7, 8, 8, 12, 15, 16, 18, 18, 20, 21, 21, 22, 22, 24, 24, 25, 30, 35, 42, 49, 52, 55, 55, 63, 68, 70, 72, 73, 77, 80, 83, 87, 87, 88, 88, 94, 95, 97],22,),
([48, -72, 84, -24, 28, 94, 36, 28, 32, 66, -62, 64, 6, -68, -12, 46, 4, 98, 18, 86, -60, 76, 1... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,2,3,5,6,7,8,8,12,15,16,18,18,20,21,21,22,22,24,24,25,30,35,42,49,52,55,55,63,68,70,72,73,77,80,83,87,87,88,88,94,95,97},{48,-72,84,-24,28,94,36,28,32,66,-62,64,6,-68,-12,46,4,98,18,86,-60,76,14,98},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0... |
EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS{
static boolean f_gold ( int n , int p ) {
n = n % p ;
for ( int x = 2 ;
x < p ;
x ++ ) if ( ( x * x ) % p == n ) return true ;
return false ;
... | def f_gold ( n , p ) :
n = n % p
for x in range ( 2 , p , 1 ) :
if ( ( x * x ) % p == n ) :
return True
return False
|
using namespace std;
bool f_gold ( int n, int p ) {
n = n % p;
for ( int x = 2;
x < p;
x ++ ) if ( ( x * x ) % p == n ) return true;
return false;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(71);
param0.add(85);
param0.add(4);
param0.add(20);
param0.add(71);
param0.add(72);
param0.add(36);
param0.add(95);
param0.add(83);
param0.add(72);
List<I... |
if __name__ == '__main__':
param = [
(71,78,),
(85,75,),
(4,35,),
(20,99,),
(71,29,),
(72,88,),
(36,54,),
(95,52,),
(83,33,),
(72,13,)
]
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,85,4,20,71,72,36,95,83,72};
vector<int> param1 {78,75,35,99,29,88,54,52,33,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
... |
CHECK_IF_A_GIVEN_ARRAY_CAN_REPRESENT_PREORDER_TRAVERSAL_OF_BINARY_SEARCH_TREE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_IF_A_GIVEN_ARRAY_CAN_REPRESENT_PREORDER_TRAVERSAL_OF_BINARY_SEARCH_TREE{
static boolean f_gold ( int pre [ ] , int n ) {
Stack < Integer > s = new Stack < Integer > ( ) ;
int root = Integer . MIN_VALUE ;... | null |
using namespace std;
bool f_gold ( int pre [ ], int n ) {
stack < int > s;
int root = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( pre [ i ] < root ) return false;
while ( ! s . empty ( ) && s . top ( ) < pre [ i ] ) {
root = s . top ( );
s . pop ( );
}
s . push ( pre [ i ] );
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,9,21,25,33,36,44,48,55,55,56,58,66,66,66,66,78,92,96,97});
param0.add(new int[]{-16,80,70,72,-86,-28,42,28,-28,56,-32,40,-78,32,22,-52,-58});
param0.add(new int[]{0,0,0,0,0,0... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,9,21,25,33,36,44,48,55,55,56,58,66,66,66,66,78,92,96,97},{-16,80,70,72,-86,-28,42,28,-28,56,-32,40,-78,32,22,-52,-58},{0,0,0,0,0,0,0,0,0,0,0,0,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},{10,85,45,52,98,9,59,58,61,91,4,90,43,48,47}... |
WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO{
static int f_gold ( String s ) {
int one_count = 0 , zero_count = 0 ;
char [ ] str = s . toCharArray ( ) ;
int n = str . length ;
for ( int i = 0 ;
... | def f_gold ( str ) :
one_count = 0
zero_count = 0
n = len ( str )
for i in range ( 0 , n , 1 ) :
if ( str [ i ] == '1' ) :
one_count += 1
else :
zero_count += 1
if ( one_count % 2 == 0 ) :
return zero_count
return one_count
|
using namespace std;
int f_gold ( string str ) {
int one_count = 0, zero_count = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) if ( str [ i ] == '1' ) one_count ++;
else zero_count ++;
if ( one_count % 2 == 0 ) return zero_count;
return one_count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("KfcTJNP");
param0.add("05312505872");
param0.add("100111");
param0.add("tDEEhKxrQ");
param0.add("50824233019");
param0.add("10001110010");
param0.add("T SEZaNm MYQ");
... |
if __name__ == '__main__':
param = [
('KfcTJNP',),
('05312505872',),
('100111',),
('tDEEhKxrQ',),
('50824233019',),
('10001110010',),
('T SEZaNm MYQ',),
('838415739',),
('01110100',),
('WYQiAey H',)
]
n_success = 0
for i, parameters_set in enumerate(param):
... |
int main() {
int n_success = 0;
vector<string> param0 {"KfcTJNP","05312505872","100111","tDEEhKxrQ","50824233019","10001110010","T SEZaNm MYQ","838415739","01110100","WYQiAey H"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_succe... |
LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE{
static int f_gold ( int arr [ ] , int n ) {
int dp [ ] = new int [ n ] ;
for ( int i = 0 ;
i < n ;
i ++ ) dp [ i ] = 1 ;
for ( int i = 1... | def f_gold ( arr , n ) :
dp = [ 1 for i in range ( n ) ]
for i in range ( n ) :
for j in range ( i ) :
if ( ( arr [ i ] == arr [ j ] + 1 ) or ( arr [ i ] == arr [ j ] - 1 ) ) :
dp [ i ] = max ( dp [ i ] , dp [ j ] + 1 )
result = 1
for i in range ( n ) :
if ( r... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int dp [ n ];
for ( int i = 0;
i < n;
i ++ ) dp [ i ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
for ( int j = 0;
j < i;
j ++ ) {
if ( ( arr [ i ] == arr [ j ] + 1 ) || ( arr [ i ] == arr [ j ] - 1 ) ) dp [ i ] = max ( dp [ i ], dp [ j... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,13,15,17,18,20,22,24,28,34,37,43,46,47,49,51,52,54,58,64,65,77,78,79,87,90,92,93,94,97});
param0.add(new int[]{-86,-56,76,86,42,-40,8,34,-48,-54,-80,6,42,48,76,-26,6});
param... |
if __name__ == '__main__':
param = [
([2, 13, 15, 17, 18, 20, 22, 24, 28, 34, 37, 43, 46, 47, 49, 51, 52, 54, 58, 64, 65, 77, 78, 79, 87, 90, 92, 93, 94, 97],23,),
([-86, -56, 76, 86, 42, -40, 8, 34, -48, -54, -80, 6, 42, 48, 76, -26, 6],15,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,13,15,17,18,20,22,24,28,34,37,43,46,47,49,51,52,54,58,64,65,77,78,79,87,90,92,93,94,97},{-86,-56,76,86,42,-40,8,34,-48,-54,-80,6,42,48,76,-26,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{5,22,15,26,29,47,22},{-90,-84,-76,-76,-74,-74,-66,-5... |
FIND_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY{
static int f_gold ( int arr [ ] , int low , int high ) {
if ( high < low ) return arr [ 0 ] ;
if ( high == low ) return arr [ low ] ;
int mid = low + ( hig... | def f_gold ( arr , low , high ) :
if high < low :
return arr [ 0 ]
if high == low :
return arr [ low ]
mid = int ( ( low + high ) / 2 )
if mid < high and arr [ mid + 1 ] < arr [ mid ] :
return arr [ mid + 1 ]
if mid > low and arr [ mid ] < arr [ mid - 1 ] :
return arr... |
using namespace std;
int f_gold ( int arr [ ], int low, int high ) {
if ( high < low ) return arr [ 0 ];
if ( high == low ) return arr [ low ];
int mid = low + ( high - low ) / 2;
if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return arr [ mid + 1 ];
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) retu... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{16,22,50,64,68,79,84,88,89});
param0.add(new int[]{88,-38,46,24,-52,-12,-90,28,18,14,-72,58,-98,28,-84,44,-42,-32,-22,-22,-82,-30,90,18,62,62,92,6,60,28,-90,92,82,62,98,-68,48,-74,... |
if __name__ == '__main__':
param = [
([16, 22, 50, 64, 68, 79, 84, 88, 89],4,6,),
([88, -38, 46, 24, -52, -12, -90, 28, 18, 14, -72, 58, -98, 28, -84, 44, -42, -32, -22, -22, -82, -30, 90, 18, 62, 62, 92, 6, 60, 28, -90, 92, 82, 62, 98, -68, 48, -74, -8, 50, 62, 24, 30, -86, 98, -96, -98],42,31,),
([0,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,22,50,64,68,79,84,88,89},{88,-38,46,24,-52,-12,-90,28,18,14,-72,58,-98,28,-84,44,-42,-32,-22,-22,-82,-30,90,18,62,62,92,6,60,28,-90,92,82,62,98,-68,48,-74,-8,50,62,24,30,-86,98,-96,-98},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,... |
MINIMUM_NUMBER_OF_SQUARES_WHOSE_SUM_EQUALS_TO_GIVEN_NUMBER_N_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_NUMBER_OF_SQUARES_WHOSE_SUM_EQUALS_TO_GIVEN_NUMBER_N_1{
static int f_gold ( int n ) {
if ( n <= 3 ) return n ;
int dp [ ] = new int [ n + 1 ] ;
dp [ 0 ] = 0 ;
dp [ 1 ] = 1 ;
dp [ 2 ] = 2 ;
dp [... | null |
using namespace std;
int f_gold ( int n ) {
int * dp = new int [ n + 1 ];
dp [ 0 ] = 0;
dp [ 1 ] = 1;
dp [ 2 ] = 2;
dp [ 3 ] = 3;
for ( int i = 4;
i <= n;
i ++ ) {
dp [ i ] = i;
for ( int x = 1;
x <= ceil ( sqrt ( i ) );
x ++ ) {
int temp = x * x;
if ( temp > i ) break;
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(16);
param0.add(33);
param0.add(47);
param0.add(98);
param0.add(36);
param0.add(81);
param0.add(55);
param0.add(19);
param0.add(4);
param0.add(22);
for(in... | null |
int main() {
int n_success = 0;
vector<int> param0 {16,33,47,98,36,81,55,19,4,22};
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_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_COST_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY{
static int f_gold ( int a [ ] , int n ) {
int mn = Integer . MAX_VALUE ;
int sum = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
mn = Math . min ( a [ ... | import sys
def f_gold ( a , n ) :
mn = sys.maxsize
sum = 0
for i in range ( n ) :
mn = min ( a [ i ] , mn )
sum += a [ i ]
return mn * ( sum - mn )
|
using namespace std;
int f_gold ( int a [ ], int n ) {
int mn = INT_MAX;
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
mn = min ( a [ i ], mn );
sum += a [ i ];
}
return mn * ( sum - mn );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,8,14,15,17,17,19,21,22,23,29,32,36,37,43,45,46,47,47,53,57,57,70,71,72,76,81,82,90,95,96,98,99});
param0.add(new int[]{94,-18,50,94,-74,-50,-44,-92,-58,14,-66,-78});
param0.a... |
if __name__ == '__main__':
param = [
([3, 8, 14, 15, 17, 17, 19, 21, 22, 23, 29, 32, 36, 37, 43, 45, 46, 47, 47, 53, 57, 57, 70, 71, 72, 76, 81, 82, 90, 95, 96, 98, 99],32,),
([94, -18, 50, 94, -74, -50, -44, -92, -58, 14, -66, -78],10,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,8,14,15,17,17,19,21,22,23,29,32,36,37,43,45,46,47,47,53,57,57,70,71,72,76,81,82,90,95,96,98,99},{94,-18,50,94,-74,-50,-44,-92,-58,14,-66,-78},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{15,18,64,28},{-96,-88,-88,-84,-82,-... |
FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2{
static boolean f_gold ( int A [ ] , int arr_size , int sum ) {
for ( int i = 0 ;
i < arr_size - 2 ;
i ++ ) {
HashSet < Integer > s = new HashSet < Integer > ( ... | def f_gold ( A , arr_size , sum ) :
for i in range ( 0 , arr_size - 1 ) :
s = set ( )
curr_sum = sum - A [ i ]
for j in range ( i + 1 , arr_size ) :
if ( curr_sum - A [ j ] ) in s :
print ( "Triplet is" , A [ i ] , ", " , A [ j ] , ", " , curr_sum - A [ j ] )
... |
using namespace std;
bool f_gold ( int A [ ], int arr_size, int sum ) {
for ( int i = 0;
i < arr_size - 2;
i ++ ) {
unordered_set < int > s;
int curr_sum = sum - A [ i ];
for ( int j = i + 1;
j < arr_size;
j ++ ) {
if ( s . find ( curr_sum - A [ j ] ) != s . end ( ) ) {
printf (... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,6,8,8,9,11,13,13,15,17,21,24,38,38,42,43,46,46,47,54,55,56,57,58,60,60,60,62,63,63,65,66,67,67,69,81,84,84,85,86,95,99});
param0.add(new int[]{20,-86,-24,38,-32,-64,-72,72,68,94,... |
if __name__ == '__main__':
param = [
([1, 6, 8, 8, 9, 11, 13, 13, 15, 17, 21, 24, 38, 38, 42, 43, 46, 46, 47, 54, 55, 56, 57, 58, 60, 60, 60, 62, 63, 63, 65, 66, 67, 67, 69, 81, 84, 84, 85, 86, 95, 99],27,24,),
([20, -86, -24, 38, -32, -64, -72, 72, 68, 94, 18, -60, -4, -18, -18, -70, 6, -86, 46, -16, 46, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,6,8,8,9,11,13,13,15,17,21,24,38,38,42,43,46,46,47,54,55,56,57,58,60,60,60,62,63,63,65,66,67,67,69,81,84,84,85,86,95,99},{20,-86,-24,38,-32,-64,-72,72,68,94,18,-60,-4,-18,-18,-70,6,-86,46,-16,46,-28},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{13,96,31,3... |
MAXIMUM_PRODUCT_INCREASING_SUBSEQUENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_PRODUCT_INCREASING_SUBSEQUENCE{
static int f_gold ( int [ ] arr , int n ) {
int [ ] mpis = new int [ n ] ;
int max = Integer . MIN_VALUE ;
for ( int i = 0 ;
i < n ;
i ++ ) mpis [ i ] = arr [ i ] ... | def f_gold ( arr , n ) :
mpis = [ 0 ] * ( n )
for i in range ( n ) :
mpis [ i ] = arr [ i ]
for i in range ( 1 , n ) :
for j in range ( i ) :
if ( arr [ i ] > arr [ j ] and mpis [ i ] < ( mpis [ j ] * arr [ i ] ) ) :
mpis [ i ] = mpis [ j ] * arr [ i ]
return ... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,1,4,7,7,9,12,20,45,53,58,63,65,65,86,98,98});
param0.add(new int[]{46,-58,70,60,74,42,6,-26,78,32,14,-56,-48,86,-2,94,-44,-62,-50,-8,-4,-36,-62,-98,-98,-78,56,92,88});
param0... |
if __name__ == '__main__':
param = [
([1, 1, 4, 7, 7, 9, 12, 20, 45, 53, 58, 63, 65, 65, 86, 98, 98],12,),
([46, -58, 70, 60, 74, 42, 6, -26, 78, 32, 14, -56, -48, 86, -2, 94, -44, -62, -50, -8, -4, -36, -62, -98, -98, -78, 56, 92, 88],27,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1,... | null |
FIND_NUMBER_PERFECT_SQUARES_TWO_GIVEN_NUMBERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_NUMBER_PERFECT_SQUARES_TWO_GIVEN_NUMBERS{
static int f_gold ( int a , int b ) {
int cnt = 0 ;
for ( int i = a ;
i <= b ;
i ++ ) for ( int j = 1 ;
j * j <= i ;
j ++ ) if ( j * j == i ) cnt ++ ;
r... | null |
using namespace std;
int f_gold ( int a, int b ) {
int cnt = 0;
for ( int i = a;
i <= b;
i ++ ) for ( int j = 1;
j * j <= i;
j ++ ) if ( j * j == i ) cnt ++;
return cnt;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(48);
param0.add(3);
param0.add(20);
param0.add(98);
param0.add(96);
param0.add(40);
param0.add(9);
param0.add(57);
param0.add(28);
param0.add(98);
List<In... | null |
int main() {
int n_success = 0;
vector<int> param0 {48,3,20,98,96,40,9,57,28,98};
vector<int> param1 {42,82,72,98,90,82,15,77,80,75};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS{
static double f_gold ( int n ) {
return ( 0.666 ) * ( 1 - 1 / Math . pow ( 10 , n ) ) ;
}
| def f_gold ( n ) :
return ( ( 0.666 ) * ( 1 - 1 / pow ( 10 , n ) ) ) ;
|
using namespace std;
float f_gold ( int n ) {
return ( 0.666 ) * ( 1 - 1 / pow ( 10, n ) );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(2);
param0.add(3);
param0.add(4);
param0.add(5);
param0.add(74);
param0.add(77);
param0.add(67);
param0.add(9);
param0.add(12);
for(int i =... |
if __name__ == '__main__':
param = [
(1,),
(2,),
(3,),
(4,),
(5,),
(74,),
(77,),
(67,),
(9,),
(12,)
]
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)) + 0.... |
int main() {
int n_success = 0;
vector<int> param0 {1,2,3,4,5,74,77,67,9,12};
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:" <... |
MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int sum = 0 ;
Arrays . sort ( arr ) ;
for ( int i = 0 ;
i < n / 2 ;
i ++ ) {
sum -= ( 2 * arr [ i ] ) ... | def f_gold ( arr , n ) :
sum = 0
arr.sort ( )
for i in range ( 0 , int ( n / 2 ) ) :
sum -= ( 2 * arr [ i ] )
sum += ( 2 * arr [ n - i - 1 ] )
return sum
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum = 0;
sort ( arr, arr + n );
for ( int i = 0;
i < n / 2;
i ++ ) {
sum -= ( 2 * arr [ i ] );
sum += ( 2 * arr [ n - i - 1 ] );
}
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{8,9,12,13,17,21,24,29,37,37,39,40,41,45,49,50,53,54,56,59,60,60,70,71,72,74,77,77,78,85,89,89,90,90,95,98,98});
param0.add(new int[]{0,48,-32,28,-84,14,30,-80,92,76,-52,-20,52,78,2... |
if __name__ == '__main__':
param = [
([8, 9, 12, 13, 17, 21, 24, 29, 37, 37, 39, 40, 41, 45, 49, 50, 53, 54, 56, 59, 60, 60, 70, 71, 72, 74, 77, 77, 78, 85, 89, 89, 90, 90, 95, 98, 98],34,),
([0, 48, -32, 28, -84, 14, 30, -80, 92, 76, -52, -20, 52, 78, 20, 32, 96, 66, 48, 26, 88, 6, 94, 32, -40, 44, -84, 5... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,9,12,13,17,21,24,29,37,37,39,40,41,45,49,50,53,54,56,59,60,60,70,71,72,74,77,77,78,85,89,89,90,90,95,98,98},{0,48,-32,28,-84,14,30,-80,92,76,-52,-20,52,78,20,32,96,66,48,26,88,6,94,32,-40,44,-84,54,-84,-80,-80,-64,-92,-84,-16,-18},{0,0,0,1,1,1},{47... |
FINDING_POWER_PRIME_NUMBER_P_N |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FINDING_POWER_PRIME_NUMBER_P_N{
static int f_gold ( int n , int p ) {
int ans = 0 ;
for ( int i = 1 ;
i <= n ;
i ++ ) {
int count = 0 , temp = i ;
while ( temp % p == 0 ) {
count ++ ;
t... | def f_gold ( n , p ) :
ans = 0 ;
temp = p ;
while ( temp <= n ) :
ans += n / temp ;
temp = temp * p ;
return ans ;
|
using namespace std;
int f_gold ( int n, int p ) {
int ans = 0;
int temp = p;
while ( temp <= n ) {
ans += n / temp;
temp = temp * p;
}
return ans;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(49);
param0.add(80);
param0.add(10);
param0.add(81);
param0.add(11);
param0.add(45);
param0.add(86);
param0.add(27);
param0.add(80);
param0.add(97);
List<... |
if __name__ == '__main__':
param = [
(49,30,),
(80,25,),
(10,9,),
(81,57,),
(11,4,),
(45,34,),
(86,90,),
(27,78,),
(80,60,),
(97,31,)
]
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 {49,80,10,81,11,45,86,27,80,97};
vector<int> param1 {30,25,9,57,4,34,90,78,60,31};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}... |
DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION{
static int f_gold ( int p [ ] , int i , int j ) {
if ( i == j ) return 0 ;
int min = Integer . MAX_VALUE ;
for ( int k = i ;
k < j ;
k ++ ) {
in... | null |
using namespace std;
int f_gold ( int p [ ], int i, int j ) {
if ( i == j ) return 0;
int k;
int min = INT_MAX;
int count;
for ( k = i;
k < j;
k ++ ) {
count = f_gold ( p, i, k ) + f_gold ( p, k + 1, j ) + p [ i - 1 ] * p [ k ] * p [ j ];
if ( count < min ) min = count;
}
return min;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,12,16,30,31,31,33,34,45,48,57,63,81,83});
param0.add(new int[]{30,-78,42,-6,42,56,-38,28,-96,-96,84,-18,0,20,-56,-40,-58,-74,64,62,-22,78,10,-22,16,-48,2,14,82,-92,-64,-18,42,24,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,12,16,30,31,31,33,34,45,48,57,63,81,83},{30,-78,42,-6,42,56,-38,28,-96,-96,84,-18,0,20,-56,-40,-58,-74,64,62,-22,78,10,-22,16,-48,2,14,82,-92,-64,-18,42,24,22,-50,12,-76,38,-30,-86,-58,-6,-4,10,28},{0,0,0,0,0,0,1,1,1,1,1,1,1},{54,46},{-80,-76,-68,-... |
NON_REPEATING_ELEMENT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NON_REPEATING_ELEMENT{
static int f_gold ( int arr [ ] , int n ) {
for ( int i = 0 ;
i < n ;
i ++ ) {
int j ;
for ( j = 0 ;
j < n ;
j ++ ) if ( i != j && arr [ i ] == arr [ j ] ) break ;
... | def f_gold ( arr , n ) :
for i in range ( n ) :
j = 0
while ( j < n ) :
if ( i != j and arr [ i ] == arr [ j ] ) :
break
j += 1
if ( j == n ) :
return arr [ i ]
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) {
int j;
for ( j = 0;
j < n;
j ++ ) if ( i != j && arr [ i ] == arr [ j ] ) break;
if ( j == n ) return arr [ i ];
}
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{1,2,3,4,6,6,7,9,10,13,16,23,30,32,36,42,42,43,44,47,48,48,49,52,52,53,55,56,58,59,60,60,63,67,68,68,74,75,76,80,81,81,83,83,86,87,91,92,97});
param0.add(new int[]{-96,-46,-86,56,-7... |
if __name__ == '__main__':
param = [
([1, 2, 3, 4, 6, 6, 7, 9, 10, 13, 16, 23, 30, 32, 36, 42, 42, 43, 44, 47, 48, 48, 49, 52, 52, 53, 55, 56, 58, 59, 60, 60, 63, 67, 68, 68, 74, 75, 76, 80, 81, 81, 83, 83, 86, 87, 91, 92, 97],47,),
([-96, -46, -86, 56, -72, 50, 18, 8, 50],8,),
([0, 0, 0, 0, 0, 0, 0, 0... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,3,4,6,6,7,9,10,13,16,23,30,32,36,42,42,43,44,47,48,48,49,52,52,53,55,56,58,59,60,60,63,67,68,68,74,75,76,80,81,81,83,83,86,87,91,92,97},{-96,-46,-86,56,-72,50,18,8,50},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{19,10,49,40,34,21,63,51},{-96,-96,-90,-... |
PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1{
static boolean f_gold ( int n ) {
if ( n <= 1 ) return false ;
if ( n <= 3 ) return true ;
if ( n % 2 == 0 || n % 3 == 0 ) return false ;
for ( int i ... | def f_gold(n):
if (n <= 1):
return False
if (n <= 3):
return True
if (n % 2 == 0 or n % 3 == 0):
return False
i = 5
while (i * i <= n):
if (n % i == 0 or n % (i + 2) == 0):
return False
i = i + 6
return True
|
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
if ( n <= 3 ) return true;
if ( n % 2 == 0 || n % 3 == 0 ) return false;
for ( int i = 5;
i * i <= n;
i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return false;
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(15);
param0.add(90);
param0.add(38);
param0.add(65);
param0.add(91);
param0.add(16);
param0.add(48);
param0.add(74);
param0.add(14);
param0.add(47);
for(i... |
if __name__ == '__main__':
param = [
(15,),
(90,),
(38,),
(65,),
(91,),
(16,),
(48,),
(74,),
(14,),
(47,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters... |
int main() {
int n_success = 0;
vector<int> param0 {15,90,38,65,91,16,48,74,14,47};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
MAXIMUM_PRODUCT_OF_4_ADJACENT_ELEMENTS_IN_MATRIX |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_PRODUCT_OF_4_ADJACENT_ELEMENTS_IN_MATRIX{
static int f_gold ( int arr [ ] [ ] , int n ) {
int max = 0 , result ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = 0 ;
j < n ;
j ++ ) {
... | def f_gold ( arr , n ) :
max = 0
for i in range ( n ) :
for j in range ( n ) :
if ( ( j - 3 ) >= 0 ) :
result = ( arr [ i ] [ j ] * arr [ i ] [ j - 1 ] * arr [ i ] [ j - 2 ] * arr [ i ] [ j - 3 ] )
if ( max < result ) :
max = result
... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{new int[]{1,2,5,6,7,11,12,14,15,16,19,19,24,25,32,34,36,36,38,38,39,43,43,45,47,49,51,51,51,52,53,56,59,59,67,69,70,74,75,75,77,79,81,90,94,96,96,96},new int[]{1,2,4,6,9,9,9,16,1... |
if __name__ == '__main__':
param = [
([[1, 2, 5, 6, 7, 11, 12, 14, 15, 16, 19, 19, 24, 25, 32, 34, 36, 36, 38, 38, 39, 43, 43, 45, 47, 49, 51, 51, 51, 52, 53, 56, 59, 59, 67, 69, 70, 74, 75, 75, 77, 79, 81, 90, 94, 96, 96, 96], [1, 2, 4, 6, 9, 9, 9, 16, 18, 21, 23, 26, 26, 30, 36, 37, 37, 38, 39, 42, 45, 49, 5... | null |
HOW_TO_AVOID_OVERFLOW_IN_MODULAR_MULTIPLICATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_TO_AVOID_OVERFLOW_IN_MODULAR_MULTIPLICATION{
static long f_gold ( long a , long b , long mod ) {
long res = 0 ;
a = a % mod ;
while ( b > 0 ) {
if ( b % 2 == 1 ) {
res = ( res + a ) % mod ;
... | def f_gold ( a , b , mod ) :
res = 0 ;
a = a % mod ;
while ( b > 0 ) :
if ( b % 2 == 1 ) :
res = ( res + a ) % mod ;
a = ( a * 2 ) % mod ;
b //= 2 ;
return res % mod ;
| null |
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(99L);
param0.add(11L);
param0.add(51L);
param0.add(49L);
param0.add(9L);
param0.add(90L);
param0.add(19L);
param0.add(17L);
param0.add(54L);
param0.add(5L);
... |
if __name__ == '__main__':
param = [
(99,75,40,),
(11,4,41,),
(51,37,23,),
(49,51,88,),
(9,34,30,),
(90,85,55,),
(19,96,41,),
(17,96,37,),
(54,3,51,),
(5,69,60,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) =... | null |
MINIMUM_COST_TO_FILL_GIVEN_WEIGHT_IN_A_BAG |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_COST_TO_FILL_GIVEN_WEIGHT_IN_A_BAG{
public static int f_gold ( int cost [ ] , int n , int W ) {
Vector < Integer > val = new Vector < Integer > ( ) ;
Vector < Integer > wt = new Vector < Integer > ( ) ... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,38,74});
param0.add(new int[]{-40,52,-54,-26,66,-28,22,-10,-28,-12,38,-92,28,76,-34,30,-16,-68,-20,56,-34,-68});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,... | null | null |
PROGRAM_CENSOR_WORD_ASTERISKS_SENTENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_CENSOR_WORD_ASTERISKS_SENTENCE{
static String f_gold ( String text , String word ) {
String [ ] word_list = text . split ( "\\s+" ) ;
String result = "" ;
String stars = "" ;
for ( int i = 0 ;
i ... | def f_gold ( text , word ) :
word_list = text.split ( )
result = ''
stars = '*' * len ( word )
count = 0
index = 0 ;
for i in word_list :
if i == word :
word_list [ index ] = stars
index += 1
result = ' '.join ( word_list )
return result
| null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("IggvAXtmJ");
param0.add("76711241128");
param0.add("010");
param0.add("HIKOn");
param0.add("3680369217");
param0.add("1111");
param0.add("zIi");
param0.add("06");
... |
if __name__ == '__main__':
param = [
('IggvAXtmJ','kzHdEJuCaO',),
('76711241128','5',),
('010','0101001',),
('HIKOn','XlnBwpx',),
('3680369217','017523',),
('1111','1011',),
('zIi','ONNXygON',),
('06','54171617',),
('111','0010001011001',),
('NJNnrVU','AGwmS',)
]
... | null |
FIND_EXPRESSION_DUPLICATE_PARENTHESIS_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_EXPRESSION_DUPLICATE_PARENTHESIS_NOT{
static boolean f_gold ( String s ) {
Stack < Character > Stack = new Stack < > ( ) ;
char [ ] str = s . toCharArray ( ) ;
for ( char ch : str ) {
if ( ch == ')'... | def f_gold ( string ) :
Stack = [ ]
for ch in string :
if ch == ')' :
top = Stack.pop ( )
elementsInside = 0
while top != '(' :
elementsInside += 1
top = Stack.pop ( )
if elementsInside < 1 :
return True
... |
using namespace std;
bool f_gold ( string str ) {
stack < char > Stack;
for ( char ch : str ) {
if ( ch == ')' ) {
char top = Stack . top ( );
Stack . pop ( );
int elementsInside = 0;
while ( top != '(' ) {
elementsInside ++;
top = Stack . top ( );
Stack . pop ( ... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("((a+b)+((c+d)))");
param0.add("(((a+(b)))+(c+d))");
param0.add("(((a+(b))+c+d))");
param0.add("((a+b)+(c+d))");
param0.add("(8582007)");
param0.add("((a+(b))+(c+d))");
pa... |
if __name__ == '__main__':
param = [
("((a+b)+((c+d)))",),
("(((a+(b)))+(c+d))",),
("(((a+(b))+c+d))",),
("((a+b)+(c+d))",),
("(8582007)",),
("((a+(b))+(c+d))",),
("(PylsShEdKAE)",),
('886980680541',),
('001',),
('jsVmFeOq',)
]
n_success = 0
for i, parameters... |
int main() {
int n_success = 0;
vector<string> param0 {
"((a+b)+((c+d)))",
"(((a+(b)))+(c+d))",
"(((a+(b))+c+d))",
"((a+b)+(c+d))",
"(8582007)",
"((a+(b))+(c+d))",
"(PylsShEdKAE)",
"886980680541",
"001",
"jsVmFeOq"};
for(int i = 0; i < param0.size(); ++i)
{
... |
PROGRAM_FIND_SLOPE_LINE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_FIND_SLOPE_LINE{
static float f_gold ( float x1 , float y1 , float x2 , float y2 ) {
return ( y2 - y1 ) / ( x2 - x1 ) ;
}
| def f_gold ( x1 , y1 , x2 , y2 ) :
return ( float ) ( y2 - y1 ) / ( x2 - x1 )
|
using namespace std;
float f_gold ( float x1, float y1, float x2, float y2 ) {
return ( y2 - y1 ) / ( x2 - x1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Float> param0 = new ArrayList<>();
param0.add(236.27324548309292F);
param0.add(-9201.144918204123F);
param0.add(3480.4716834445326F);
param0.add(-6915.538971485092F);
param0.add(8887.97173657486F);
param0.add(-3785.5177159... |
if __name__ == '__main__':
param = [
(236.27324548309292,5792.493225762838,7177.837879115863,1289.5700425822731,),
(-9201.144918204123,-2716.3347716140406,-5161.142121227645,-3205.784279961129,),
(3480.4716834445326,3577.9608612055613,8611.515262945342,6744.864707668983,),
(-6915.538971485092,-4113... |
int main() {
int n_success = 0;
vector<float> param0 {236.27324548309292F,-9201.144918204123F,3480.4716834445326F,-6915.538971485092F,8887.97173657486F,-3785.5177159369946F,3037.6696554256832F,-7925.458496016523F,1404.2919985268031F,-4748.744241168378F};
vector<float> param1 {5792.493225762838F,-2716.33477... |
ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION{
public static int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n ;
int f1 = 0 , f2 = 1 , f3 = 1 ;
while ( f3 <= n ) {
f1 = f2 ;
f2 ... | def f_gold ( n ) :
if ( n == 0 or n == 1 ) :
return n
f1 , f2 , f3 = 0 , 1 , 1
while ( f3 <= n ) :
f1 = f2 ;
f2 = f3 ;
f3 = f1 + f2 ;
return f2 ;
|
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
int f1 = 0, f2 = 1, f3 = 1;
while ( f3 <= n ) {
f1 = f2;
f2 = f3;
f3 = f1 + f2;
}
return f2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(54);
param0.add(71);
param0.add(64);
param0.add(71);
param0.add(96);
param0.add(43);
param0.add(70);
param0.add(94);
param0.add(95);
param0.add(69);
for(i... |
if __name__ == '__main__':
param = [
(54,),
(71,),
(64,),
(71,),
(96,),
(43,),
(70,),
(94,),
(95,),
(69,)
]
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 {54,71,64,71,96,43,70,94,95,69};
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();
... |
SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE{
static long f_gold ( int n ) {
long sum = 0 ;
for ( int row = 0 ;
row < n ;
row ++ ) {
sum = sum + ( 1 << row ) ;
}
return sum ;
}
| def f_gold ( n ) :
sum = 0
for row in range ( n ) :
sum = sum + ( 1 << row )
return sum
|
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int row = 0;
row < n;
row ++ ) {
sum = sum + ( 1 << row );
}
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(21);
param0.add(4);
param0.add(31);
param0.add(79);
param0.add(38);
param0.add(75);
param0.add(36);
param0.add(32);
param0.add(23);
param0.add(65);
for(in... |
if __name__ == '__main__':
param = [
(21,),
(4,),
(31,),
(79,),
(38,),
(75,),
(36,),
(32,),
(23,),
(65,)
]
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 {21,4,31,79,38,75,36,32,23,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();
... |
NUMBER_N_DIGITS_NON_DECREASING_INTEGERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_N_DIGITS_NON_DECREASING_INTEGERS{
static int f_gold ( int n ) {
int [ ] [ ] a = new int [ n + 1 ] [ 10 ] ;
for ( int i = 0 ;
i <= 9 ;
i ++ ) a [ 0 ] [ i ] = 1 ;
for ( int i = 1 ;
i <= n ;
i ++... | null |
using namespace std;
int f_gold ( int n ) {
int a [ n + 1 ] [ 10 ];
for ( int i = 0;
i <= 9;
i ++ ) a [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= n;
i ++ ) a [ i ] [ 9 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 8;
j >= 0;
j -- ) a [ i ] [ j ] = a [ i - 1 ] [ j ] + a [ i ] [ j + 1 ];
retu... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(2);
param0.add(19);
param0.add(79);
param0.add(62);
param0.add(93);
param0.add(39);
param0.add(7);
param0.add(31);
param0.add(3);
param0.add(21);
for(int ... | null |
int main() {
int n_success = 0;
vector<int> param0 {2,19,79,62,93,39,7,31,3,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();
re... |
ADD_1_TO_A_GIVEN_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ADD_1_TO_A_GIVEN_NUMBER{
static int f_gold ( int x ) {
int m = 1 ;
while ( ( int ) ( x & m ) >= 1 ) {
x = x ^ m ;
m <<= 1 ;
}
x = x ^ m ;
return x ;
}
| def f_gold ( x ) :
m = 1
while ( x & m ) :
x = x ^ m
m <<= 1
x = x ^ m
return x
|
using namespace std;
int f_gold ( int x ) {
int m = 1;
while ( x & m ) {
x = x ^ m;
m <<= 1;
}
x = x ^ m;
return x;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(96);
param0.add(66);
param0.add(67);
param0.add(13);
param0.add(75);
param0.add(78);
param0.add(1);
param0.add(83);
param0.add(27);
param0.add(65);
for(in... |
if __name__ == '__main__':
param = [
(96,),
(66,),
(67,),
(13,),
(75,),
(78,),
(1,),
(83,),
(27,),
(65,)
]
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 {96,66,67,13,75,78,1,83,27,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();
... |
SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY{
static int f_gold ( int arr [ ] , int n , int key ) {
for ( int i = 0 ;
i < n ;
i ++ ) if ( arr [ i ] == key ) return i ;
return - 1 ;
}
| def f_gold ( arr , n , key ) :
for i in range ( n ) :
if ( arr [ i ] == key ) :
return i
return - 1
|
using namespace std;
int f_gold ( int arr [ ], int n, int key ) {
int i;
for ( i = 0;
i < n;
i ++ ) if ( arr [ i ] == key ) return i;
return - 1;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,8,11,23,55,57,73,74,77,79,93});
param0.add(new int[]{-88,12,-62,-66,-24,18,12,22,94,30,-50,-42,-94,18,76,-6,-48,-68,48,36,-78,52,-82,76,2,-44,-10,88});
param0.add(new int[]{0... |
if __name__ == '__main__':
param = [
([4, 8, 11, 23, 55, 57, 73, 74, 77, 79, 93],8,11,),
([-88, 12, -62, -66, -24, 18, 12, 22, 94, 30, -50, -42, -94, 18, 76, -6, -48, -68, 48, 36, -78, 52, -82, 76, 2, -44, -10, 88],27,12,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1],11,0,),
([33,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,8,11,23,55,57,73,74,77,79,93},{-88,12,-62,-66,-24,18,12,22,94,30,-50,-42,-94,18,76,-6,-48,-68,48,36,-78,52,-82,76,2,-44,-10,88},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{33,9,93,70,81,70,56,66,72,81,74,32,71,72,3,81,70,22,82,2,75,18,90,29,48},{-98... |
MAKE_LARGEST_PALINDROME_CHANGING_K_DIGITS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAKE_LARGEST_PALINDROME_CHANGING_K_DIGITS{
static String f_gold ( String str , int k ) {
char palin [ ] = str . toCharArray ( ) ;
String ans = "" ;
int l = 0 ;
int r = str . length ( ) - 1 ;
while ( l < ... | null |
using namespace std;
string f_gold ( string str, int k ) {
string palin = str;
int l = 0;
int r = str . length ( ) - 1;
while ( l < r ) {
if ( str [ l ] != str [ r ] ) {
palin [ l ] = palin [ r ] = max ( str [ l ], str [ r ] );
k --;
}
l ++;
r --;
}
if ( k < 0 ) return "Not poss... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("wUJmbRlwogtFv");
param0.add("43435");
param0.add("43435");
param0.add("12345");
param0.add("5032");
param0.add("0100000001101");
param0.add("sBrbNQiRwQd");
param0.add... | null |
int main() {
int n_success = 0;
vector<string> param0 {"wUJmbRlwogtFv","43435","43435","12345","5032","0100000001101","sBrbNQiRwQd","7549384614","10000001","VqrTsaoD"};
vector<int> param1 {5,3,1,1,3,5,4,3,4,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_g... |
FIND_THE_MISSING_NUMBER_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THE_MISSING_NUMBER_2{
static int f_gold ( int a [ ] , int n ) {
int x1 = a [ 0 ] ;
int x2 = 1 ;
for ( int i = 1 ;
i < n ;
i ++ ) x1 = x1 ^ a [ i ] ;
for ( int i = 2 ;
i <= n + 1 ;
i ++ ) x2 = ... | def f_gold ( a , n ) :
x1 = a [ 0 ]
x2 = 1
for i in range ( 1 , n ) :
x1 = x1 ^ a [ i ]
for i in range ( 2 , n + 2 ) :
x2 = x2 ^ i
return x1 ^ x2
|
using namespace std;
int f_gold ( int a [ ], int n ) {
int x1 = a [ 0 ];
int x2 = 1;
for ( int i = 1;
i < n;
i ++ ) x1 = x1 ^ a [ i ];
for ( int i = 2;
i <= n + 1;
i ++ ) x2 = x2 ^ i;
return ( x1 ^ x2 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,5,7,8,10,14,27,32,51,52,57,58,65,68,68,72,73,73,83,92,98});
param0.add(new int[]{-60,-48,38,-78,88,86,-4,-94,16,-64,32,88,58,-78,-16,48,38,30,66,-60,20,40,-28,-64,-48,-86,-80,-8,... |
if __name__ == '__main__':
param = [
([2, 5, 7, 8, 10, 14, 27, 32, 51, 52, 57, 58, 65, 68, 68, 72, 73, 73, 83, 92, 98],12,),
([-60, -48, 38, -78, 88, 86, -4, -94, 16, -64, 32, 88, 58, -78, -16, 48, 38, 30, 66, -60, 20, 40, -28, -64, -48, -86, -80, -8, -58, 52, 80, -32, 46, -4, -70, 76, -4, 78, -64, 38, -40... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,8,10,14,27,32,51,52,57,58,65,68,68,72,73,73,83,92,98},{-60,-48,38,-78,88,86,-4,-94,16,-64,32,88,58,-78,-16,48,38,30,66,-60,20,40,-28,-64,-48,-86,-80,-8,-58,52,80,-32,46,-4,-70,76,-4,78,-64,38,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,... |
REMOVE_BRACKETS_ALGEBRAIC_STRING_CONTAINING_OPERATORS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class REMOVE_BRACKETS_ALGEBRAIC_STRING_CONTAINING_OPERATORS{
static String f_gold ( String str ) {
int len = str . length ( ) ;
char res [ ] = new char [ len ] ;
int index = 0 , i = 0 ;
Stack < Integer > s = new... | def f_gold ( Str ) :
Len = len ( Str )
res = [ None ] * Len
index = 0
i = 0
s = [ ]
s.append ( 0 )
while ( i < Len ) :
if ( Str [ i ] == '+' ) :
if ( s [ - 1 ] == 1 ) :
res [ index ] = '-'
index += 1
if ( s [ - 1 ] == 0 ) :
... | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ggbsMvMZcMOVd");
param0.add("384292670");
param0.add("10000100");
param0.add("fdHME");
param0.add("09198832");
param0.add("0011111011");
param0.add("SnXwRS");
param0.... |
if __name__ == '__main__':
param = [
('ggbsMvMZcMOVd',),
('384292670',),
('10000100',),
('fdHME',),
('09198832',),
('0011111011',),
('SnXwRS',),
('071',),
('01101',),
('xwmqxgBa',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled... | null |
FINDING_POWER_PRIME_NUMBER_P_N_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FINDING_POWER_PRIME_NUMBER_P_N_1{
static int f_gold ( int n , int p ) {
int ans = 0 ;
int temp = p ;
while ( temp <= n ) {
ans += n / temp ;
temp = temp * p ;
}
return ans ;
}
| def f_gold ( n , p ) :
ans = 0
temp = p
while ( temp <= n ) :
ans += n / temp
temp = temp * p
return int ( ans )
|
using namespace std;
int f_gold ( int n, int p ) {
int ans = 0;
int temp = p;
while ( temp <= n ) {
ans += n / temp;
temp = temp * p;
}
return ans;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(76);
param0.add(77);
param0.add(9);
param0.add(59);
param0.add(8);
param0.add(97);
param0.add(78);
param0.add(41);
param0.add(72);
param0.add(71);
List<In... |
if __name__ == '__main__':
param = [
(76,43,),
(77,91,),
(9,42,),
(59,67,),
(8,52,),
(97,8,),
(78,24,),
(41,88,),
(72,61,),
(71,28,)
]
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 {76,77,9,59,8,97,78,41,72,71};
vector<int> param1 {43,91,42,67,52,8,24,88,61,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
... |
DICE_THROW_PROBLEM_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DICE_THROW_PROBLEM_1{
public static long f_gold ( int f , int d , int s ) {
long mem [ ] [ ] = new long [ d + 1 ] [ s + 1 ] ;
mem [ 0 ] [ 0 ] = 1 ;
for ( int i = 1 ;
i <= d ;
i ++ ) {
for ( int j = i... | def f_gold ( f , d , s ) :
mem = [ [ 0 for i in range ( s + 1 ) ] for j in range ( d + 1 ) ]
mem [ 0 ] [ 0 ] = 1
for i in range ( 1 , d + 1 ) :
for j in range ( 1 , s + 1 ) :
mem [ i ] [ j ] = mem [ i ] [ j - 1 ] + mem [ i - 1 ] [ j - 1 ]
if j - f - 1 >= 0 :
m... |
using namespace std;
long f_gold ( int f, int d, int s ) {
long mem [ d + 1 ] [ s + 1 ];
memset ( mem, 0, sizeof mem );
mem [ 0 ] [ 0 ] = 1;
for ( int i = 1;
i <= d;
i ++ ) {
for ( int j = i;
j <= s;
j ++ ) {
mem [ i ] [ j ] = mem [ i ] [ j - 1 ] + mem [ i - 1 ] [ j - 1 ];
if ( j - ... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(57);
param0.add(58);
param0.add(38);
param0.add(5);
param0.add(91);
param0.add(76);
param0.add(38);
param0.add(97);
param0.add(97);
param0.add(99);
List<I... |
if __name__ == '__main__':
param = [
(57,5,33,),
(58,45,4,),
(38,89,9,),
(5,39,30,),
(91,90,47,),
(76,56,46,),
(38,43,84,),
(97,26,52,),
(97,90,90,),
(99,2,26,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) ==... |
int main() {
int n_success = 0;
vector<int> param0 {57,58,38,5,91,76,38,97,97,99};
vector<int> param1 {5,45,89,39,90,56,43,26,90,2};
vector<int> param2 {33,4,9,30,47,46,84,52,90,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],... |
FIND_REPEATING_ELEMENT_SORTED_ARRAY_SIZE_N |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_REPEATING_ELEMENT_SORTED_ARRAY_SIZE_N{
static int f_gold ( int arr [ ] , int low , int high ) {
if ( low > high ) return - 1 ;
int mid = ( low + high ) / 2 ;
if ( arr [ mid ] != mid + 1 ) {
if ( mid... | null |
using namespace std;
int f_gold ( int arr [ ], int low, int high ) {
if ( low > high ) return - 1;
int mid = ( low + high ) / 2;
if ( arr [ mid ] != mid + 1 ) {
if ( mid > 0 && arr [ mid ] == arr [ mid - 1 ] ) return mid;
return f_gold ( arr, low, mid - 1 );
}
return f_gold ( arr, mid + 1, high );
}
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{15,21,32,42,42,44,57,68,75,80,83,84});
param0.add(new int[]{-60,-90,-88,-80,-86,18,54,56,84,42,-60,-90,52,-44,-62,-56,-16,28,22,-24,-36,-56,80,68,-16});
param0.add(new int[]{0,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{15,21,32,42,42,44,57,68,75,80,83,84},{-60,-90,-88,-80,-86,18,54,56,84,42,-60,-90,52,-44,-62,-56,-16,28,22,-24,-36,-56,80,68,-16},{0,0,0,0,0,0,0,0,0,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},{87,43,74},{-82,-66,-66,-62,-56,-52,-44,-42,-28,-... |
CHANGE_ARRAY_PERMUTATION_NUMBERS_1_N |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
class CHANGE_ARRAY_PERMUTATION_NUMBERS_1_N{
static void f_gold ( int [ ] a , int n ) {
HashMap < Integer , Integer > count = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( count . c... | def f_gold ( a , n ) :
count = dict ( )
for i in range ( n ) :
if count.get ( a [ i ] ) :
count [ a [ i ] ] += 1
else :
count [ a [ i ] ] = 1 ;
next_missing = 1
for i in range ( n ) :
if count [ a [ i ] ] != 1 or a [ i ] > n or a [ i ] < 1 :
co... |
using namespace std;
void f_gold ( int a [ ], int n ) {
unordered_map < int, int > count;
for ( int i = 0;
i < n;
i ++ ) count [ a [ i ] ] ++;
int next_missing = 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( count [ a [ i ] ] != 1 || a [ i ] > n || a [ i ] < 1 ) {
count [ a [ i ] ] --;
while... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{19});
param0.add(new int[]{-47,72});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.add(new int[]{93,3,20,59,36,19,90,67,19,20,96,71,52,... |
if __name__ == '__main__':
param = [
([19],0,),
([-47, 72],1,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],18,),
([93, 3, 20, 59, 36, 19, 90, 67, 19, 20, 96, 71, 52, 33, 40, 39],9,),
([-98, -93, -91, -89, -63, -58, -52, -52, -46, -40, -25, -16, -10, -1, -1, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19},{-47,72},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{93,3,20,59,36,19,90,67,19,20,96,71,52,33,40,39},{-98,-93,-91,-89,-63,-58,-52,-52,-46,-40,-25,-16,-10,-1,-1,4,12,12,13,13,16,20,29,29,31,40,44,47,48,51,52,52,59,60,61,64,66,78,85,97},... |
DIAGONALLY_DOMINANT_MATRIX |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DIAGONALLY_DOMINANT_MATRIX{
static boolean f_gold ( int m [ ] [ ] , int n ) {
for ( int i = 0 ;
i < n ;
i ++ ) {
int sum = 0 ;
for ( int j = 0 ;
j < n ;
j ++ ) sum += Math . abs ( m [ i ] [ j... | def f_gold ( m , n ) :
for i in range ( 0 , n ) :
sum = 0
for j in range ( 0 , n ) :
sum = sum + abs ( m [ i ] [ j ] )
sum = sum - abs ( m [ i ] [ i ] )
if ( abs ( m [ i ] [ i ] ) < sum ) :
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[] {3, -2, 1,}, new int[] {1 -3, 2}, new int[] {-1, 2, 4}});
param0.add(new int[][]{ new int[] {2, -2, 1,}, new int[] {1 -3, 2}, new int[] {-1, 2, 4}});
param0.ad... |
if __name__ == '__main__':
param = [
([[ 3, -2, 1 ], [ 1, -3, 2 ], [ -1, 2, 4 ]],2,),
([[ 2, -2, 1 ], [ 1, -3, 2 ], [ -1, 2, 4 ]],3,),
([[78, 46, 33, 58, 79, 94, 94, 31, 69], [83, 48, 11, 74, 33, 61, 88, 15, 29], [27, 20, 36, 14, 37, 88, 49, 36, 58], [93, 15, 39, 5, 97, 45, 1, 47, 34], [8, 88, 54, 87, ... | null |
SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS{
static int f_gold ( int x , int y , int z ) {
int c = 0 ;
while ( x != 0 && y != 0 && z != 0 ) {
x -- ;
y -- ;
z -- ;
c ++ ;
}
retur... | def f_gold ( x , y , z ) :
c = 0
while ( x and y and z ) :
x = x - 1
y = y - 1
z = z - 1
c = c + 1
return c
|
using namespace std;
int f_gold ( int x, int y, int z ) {
int c = 0;
while ( x && y && z ) {
x --;
y --;
z --;
c ++;
}
return c;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(23);
param0.add(87);
param0.add(35);
param0.add(25);
param0.add(93);
param0.add(52);
param0.add(95);
param0.add(91);
param0.add(75);
param0.add(96);
List<... |
if __name__ == '__main__':
param = [
(23,98,25,),
(87,55,94,),
(35,90,29,),
(25,9,41,),
(93,22,39,),
(52,42,96,),
(95,88,26,),
(91,64,51,),
(75,1,6,),
(96,44,76,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) ... |
int main() {
int n_success = 0;
vector<int> param0 {23,87,35,25,93,52,95,91,75,96};
vector<int> param1 {98,55,90,9,22,42,88,64,1,44};
vector<int> param2 {25,94,29,41,39,96,26,51,6,76};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i... |
SMALLEST_SUM_CONTIGUOUS_SUBARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SMALLEST_SUM_CONTIGUOUS_SUBARRAY{
static int f_gold ( int arr [ ] , int n ) {
int min_ending_here = 2147483647 ;
int min_so_far = 2147483647 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( min_ending_here ... | import sys
def f_gold ( arr , n ) :
min_ending_here = sys.maxsize
min_so_far = sys.maxsize
for i in range ( n ) :
if ( min_ending_here > 0 ) :
min_ending_here = arr [ i ]
else :
min_ending_here += arr [ i ]
min_so_far = min ( min_so_far , min_ending_here )
... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int min_ending_here = INT_MAX;
int min_so_far = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) {
if ( min_ending_here > 0 ) min_ending_here = arr [ i ];
else min_ending_here += arr [ i ];
min_so_far = min ( min_so_far, min_ending_here );
}
ret... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,9,13,14,15,18,19,19,25,26,29,29,29,30,31,36,37,37,38,39,39,40,40,42,42,46,50,53,58,60,62,64,65,67,68,69,72,77,78,83,85,89,90,93,95,95,97});
param0.add(new int[]{14,-58,8,78,-26,-... |
if __name__ == '__main__':
param = [
([2, 9, 13, 14, 15, 18, 19, 19, 25, 26, 29, 29, 29, 30, 31, 36, 37, 37, 38, 39, 39, 40, 40, 42, 42, 46, 50, 53, 58, 60, 62, 64, 65, 67, 68, 69, 72, 77, 78, 83, 85, 89, 90, 93, 95, 95, 97],24,),
([14, -58, 8, 78, -26, -20, -60, 42, -64, -12],6,),
([0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,9,13,14,15,18,19,19,25,26,29,29,29,30,31,36,37,37,38,39,39,40,40,42,42,46,50,53,58,60,62,64,65,67,68,69,72,77,78,83,85,89,90,93,95,95,97},{14,-58,8,78,-26,-20,-60,42,-64,-12},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{44,88,20,47,69,42,26,49,71,91,18,95,... |
TRIANGULAR_NUMBERS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class TRIANGULAR_NUMBERS_1{
static boolean f_gold ( int num ) {
if ( num < 0 ) return false ;
int c = ( - 2 * num ) ;
int b = 1 , a = 1 ;
int d = ( b * b ) - ( 4 * a * c ) ;
if ( d < 0 ) return false ;
float... | import math
def f_gold ( num ) :
if ( num < 0 ) :
return False
c = ( - 2 * num )
b , a = 1 , 1
d = ( b * b ) - ( 4 * a * c )
if ( d < 0 ) :
return False
root1 = ( - b + math.sqrt ( d ) ) / ( 2 * a )
root2 = ( - b - math.sqrt ( d ) ) / ( 2 * a )
if ( root1 > 0 and math.fl... |
using namespace std;
bool f_gold ( int num ) {
if ( num < 0 ) return false;
int c = ( - 2 * num );
int b = 1, a = 1;
int d = ( b * b ) - ( 4 * a * c );
if ( d < 0 ) return false;
float root1 = ( - b + sqrt ( d ) ) / ( 2 * a );
float root2 = ( - b - sqrt ( d ) ) / ( 2 * a );
if ( root1 > 0 && floor ( ro... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(1);
param0.add(3);
param0.add(6);
param0.add(10);
param0.add(55);
param0.add(48);
param0.add(63);
param0.add(72);
param0.add(16);
param0.add(85);
for(int ... |
if __name__ == '__main__':
param = [
(1,),
(3,),
(6,),
(10,),
(55,),
(48,),
(63,),
(72,),
(16,),
(85,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {1,3,6,10,55,48,63,72,16,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();
re... |
CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS{
static boolean f_gold ( String str1 , String str2 , int k ) {
if ( ( str1 . length ( ) + str2 . length ( ) ) < k ) return true ;
int commonLength = 0 ... | def f_gold(str1, str2, k):
if ((len(str1) + len(str2)) < k):
return True
commonLength = 0
for i in range(0, min(len(str1), len(str2)), 1):
if (str1[i] == str2[i]):
commonLength += 1
else:
break
if ((k - len(str1) - len(str2) + 2 * commonLength) % 2 == 0):
... |
using namespace std;
bool f_gold ( string str1, string str2, int k ) {
if ( ( str1 . length ( ) + str2 . length ( ) ) < k ) return true;
int commonLength = 0;
for ( int i = 0;
i < min ( str1 . length ( ), str2 . length ( ) );
i ++ ) {
if ( str1 [ i ] == str2 [ i ] ) commonLength ++;
else break;
}
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ZNHGro");
param0.add("382880806774");
param0.add("0");
param0.add("lxHTRFCTSQ");
param0.add("6399914758");
param0.add("01100011100000");
param0.add("WkGqlob");
param0... |
if __name__ == '__main__':
param = [
('ZNHGro', 'jAdbtDUYQu', 3,),
('382880806774', '65565', 10,),
('0', '00100010100', 2,),
('lxHTRFCTSQ', 'sViXYE', 89,),
('6399914758', '780990121', 9,),
('01100011100000', '0100', 0,),
('WkGqlob', 'NpQVdXzEtUZy', 6,),
... |
int main() {
int n_success = 0;
vector<string> param0 {"ZNHGro","382880806774","0","lxHTRFCTSQ","6399914758","01100011100000","WkGqlob","46974006151","1001001","IJQ"};
vector<string> param1 {"jAdbtDUYQu","65565","00100010100","sViXYE","780990121","0100","NpQVdXzEtUZy","74438","1000010","nFOHAeYEAp"};
v... |
FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1{
static boolean f_gold ( int a1 [ ] , int a2 [ ] , int a3 [ ] , int n1 , int n2 , int n3 , int sum ) {
HashSet < Integer > s = new HashSet ... | def f_gold ( a1 , a2 , a3 , n1 , n2 , n3 , sum ) :
s = set ( )
for i in range ( n1 ) :
s.add ( a1 [ i ] )
for i in range ( n2 ) :
for j in range ( n3 ) :
if sum - a2 [ i ] - a3 [ j ] in s :
return True
return False
|
using namespace std;
bool f_gold ( int a1 [ ], int a2 [ ], int a3 [ ], int n1, int n2, int n3, int sum ) {
unordered_set < int > s;
for ( int i = 0;
i < n1;
i ++ ) s . insert ( a1 [ i ] );
for ( int i = 0;
i < n2;
i ++ ) {
for ( int j = 0;
j < n3;
j ++ ) {
if ( s . find ( sum - a2 [ i ]... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{6,7,10,15,28,30,30,35,38,43,44,44,54,55,64,68,69,73,75,75,86,87,92,93,94});
param0.add(new int[]{-72,-90,-92,4,22,14,-50,16,-56,-66,62,-32,82,8,12,-24,92,-98,-94,56,-74,-66,26,-98,... |
if __name__ == '__main__':
param = [
([6, 7, 10, 15, 28, 30, 30, 35, 38, 43, 44, 44, 54, 55, 64, 68, 69, 73, 75, 75, 86, 87, 92, 93, 94],[11, 17, 18, 24, 26, 26, 33, 35, 38, 41, 55, 60, 63, 63, 69, 73, 78, 81, 82, 87, 90, 91, 93, 94, 99],[3, 3, 8, 22, 24, 24, 28, 30, 32, 32, 34, 39, 40, 45, 46, 50, 54, 59, 75,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,10,15,28,30,30,35,38,43,44,44,54,55,64,68,69,73,75,75,86,87,92,93,94},{-72,-90,-92,4,22,14,-50,16,-56,-66,62,-32,82,8,12,-24,92,-98,-94,56,-74,-66,26,-98,10,-74,-14,2,60,-88,-84,34,82,28,-86,-90,-92,52,72,90,92,-20,-86,74,-96,-46,28},{0,0,0,0,0,0... |
HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS{
static int f_gold ( int N ) {
if ( N <= 6 ) return N ;
int [ ] screen = new int [ N ] ;
int b ;
int n ;
for ( n = 1 ;
n <= 6 ;
n ++ ) screen [ ... | def f_gold ( N ) :
if ( N <= 6 ) :
return N
screen = [ 0 ] * N
for n in range ( 1 , 7 ) :
screen [ n - 1 ] = n
for n in range ( 7 , N + 1 ) :
screen [ n - 1 ] = max ( 2 * screen [ n - 4 ] , max ( 3 * screen [ n - 5 ] , 4 * screen [ n - 6 ] ) ) ;
return screen [ N - 1 ]
|
using namespace std;
int f_gold ( int N ) {
if ( N <= 6 ) return N;
int screen [ N ];
int b;
int n;
for ( n = 1;
n <= 6;
n ++ ) screen [ n - 1 ] = n;
for ( n = 7;
n <= N;
n ++ ) {
screen [ n - 1 ] = max ( 2 * screen [ n - 4 ], max ( 3 * screen [ n - 5 ], 4 * screen [ n - 6 ] ) );
}
return s... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(41);
param0.add(94);
param0.add(80);
param0.add(40);
param0.add(76);
param0.add(5);
param0.add(43);
param0.add(67);
param0.add(24);
param0.add(90);
for(in... |
if __name__ == '__main__':
param = [
(41,),
(94,),
(80,),
(40,),
(76,),
(5,),
(43,),
(67,),
(24,),
(90,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {41,94,80,40,76,5,43,67,24,90};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2{
static int f_gold ( int n ) {
int res = 0 ;
for ( int x = 0 ;
x * x < n ;
x ++ ) for ( int y = 0 ;
x * x + y * y < n ;
y ++ ) res ++ ... | def f_gold ( n ) :
res = 0
x = 0
while ( x * x < n ) :
y = 0
while ( x * x + y * y < n ) :
res = res + 1
y = y + 1
x = x + 1
return res
|
using namespace std;
int f_gold ( int n ) {
int res = 0;
for ( int x = 0;
x * x < n;
x ++ ) for ( int y = 0;
x * x + y * y < n;
y ++ ) res ++;
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(61);
param0.add(45);
param0.add(53);
param0.add(4);
param0.add(82);
param0.add(86);
param0.add(37);
param0.add(48);
param0.add(81);
param0.add(50);
for(in... |
if __name__ == '__main__':
param = [
(61,),
(45,),
(53,),
(4,),
(82,),
(86,),
(37,),
(48,),
(81,),
(50,)
]
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 {61,45,53,4,82,86,37,48,81,50};
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();
... |
HIGHWAY_BILLBOARD_PROBLEM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class HIGHWAY_BILLBOARD_PROBLEM{
static int f_gold ( int m , int [ ] x , int [ ] revenue , int n , int t ) {
int [ ] maxRev = new int [ m + 1 ] ;
for ( int i = 0 ;
i < m + 1 ;
i ++ ) maxRev [ i ] = 0 ;
int nxt... | def f_gold ( m , x , revenue , n , t ) :
maxRev = [ 0 ] * ( m + 1 )
nxtbb = 0 ;
for i in range ( 1 , m + 1 ) :
if ( nxtbb < n ) :
if ( x [ nxtbb ] != i ) :
maxRev [ i ] = maxRev [ i - 1 ]
else :
if ( i <= t ) :
maxRev [ i ] ... |
using namespace std;
int f_gold ( int m, int x [ ], int revenue [ ], int n, int t ) {
int maxRev [ m + 1 ];
memset ( maxRev, 0, sizeof ( maxRev ) );
int nxtbb = 0;
for ( int i = 1;
i <= m;
i ++ ) {
if ( nxtbb < n ) {
if ( x [ nxtbb ] != i ) maxRev [ i ] = maxRev [ i - 1 ];
else {
if... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(16);
param0.add(39);
param0.add(5);
param0.add(10);
param0.add(14);
param0.add(32);
param0.add(2);
param0.add(22);
param0.add(15);
param0.add(8);
List<int... |
if __name__ == '__main__':
param = [
(16,[6, 15, 15, 18, 23, 29, 32, 36, 37, 39, 40, 41, 44, 49, 51, 52, 53, 57, 66, 68, 82, 89, 96],[1, 2, 5, 5, 24, 26, 31, 32, 33, 41, 57, 59, 71, 75, 79, 87, 87, 88, 92, 94, 96, 96, 99],12,12,),
(39,[76, 60, 88, 46, -20, -78, -22, 54, -18, 92, -42, -66, -90, -72, -48, 22... |
int main() {
int n_success = 0;
vector<int> param0 {16,39,5,10,14,32,2,22,15,8};
vector<vector<int>> param1 {{6,15,15,18,23,29,32,36,37,39,40,41,44,49,51,52,53,57,66,68,82,89,96},{76,60,88,46,-20,-78,-22,54,-18,92,-42,-66,-90,-72,-48,22,-72,-42,-46,94,82,-78,14,86,10,-64,-78,66,78,-36,50,-20,-40,-12,10,-46... |
COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING{
static int f_gold ( String str ) {
int len = str . length ( ) ;
boolean oneSeen = false ;
int count = 0 ;
for ( int i = 0 ;
i < len ;
i ++ ) {
cha... | def f_gold ( s ) :
length = len ( s )
oneSeen = False
count = 0
for i in range ( length ) :
if ( s [ i ] == '1' and oneSeen ) :
if ( s [ i - 1 ] == '0' ) :
count += 1
if ( s [ i ] == '1' and oneSeen == 0 ) :
oneSeen = True
if ( s [ i ] != '... |
using namespace std;
int f_gold ( string str ) {
int len = str . size ( );
bool oneSeen = 0;
int count = 0;
for ( int i = 0;
i < len;
i ++ ) {
if ( str [ i ] == '1' && oneSeen == 1 ) if ( str [ i - 1 ] == '0' ) count ++;
if ( str [ i ] == '1' && oneSeen == 0 ) {
oneSeen = 1;
continue;
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("1001ab010abc01001");
param0.add("1001010001");
param0.add("010100010100");
param0.add("DLCu");
param0.add("7072430592");
param0.add("011");
param0.add("pnJpypYOza");
... |
if __name__ == '__main__':
param = [
('1001ab010abc01001',),
('1001010001',),
('010100010100',),
('DLCu',),
('7072430592',),
('011',),
('pnJpypYOza',),
('1037',),
('111',),
('HxK',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fille... |
int main() {
int n_success = 0;
vector<string> param0 {"1001ab010abc01001","1001010001","010100010100","DLCu","7072430592","011","pnJpypYOza","1037","111","HxK"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
... |
CHECK_INTEGER_OVERFLOW_MULTIPLICATION |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_INTEGER_OVERFLOW_MULTIPLICATION{
static Boolean f_gold ( long a , long b ) {
if ( a == 0 || b == 0 ) return false ;
long result = a * b ;
if ( a == result / b ) return false ;
else return true ;
}
| def f_gold ( a , b ) :
if ( a == 0 or b == 0 ) :
return False
result = a * b
if ( result >= 9223372036854775807 or result <= - 9223372036854775808 ) :
result = 0
if ( a == ( result // b ) ) :
print ( result // b )
return False
else :
return True
|
using namespace std;
bool f_gold ( long long a, long long b ) {
if ( a == 0 || b == 0 ) return false;
long long result = a * b;
if ( a == result / b ) return false;
else return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(37L);
param0.add(Long.parseLong("10000000000"));
param0.add(Long.parseLong("10000000000"));
param0.add(Long.parseLong("999999999"));
param0.add(39L);
param0.add(92L);
param0... |
if __name__ == '__main__':
param = [
(37,80,),
(10000000000,-10000000000,),
(10000000000,10000000000,),
(999999999,999999999,),
(39,36,),
(92,56,),
(14,21,),
(19,38,),
(14,82,),
(88,41,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_... |
int main() {
int n_success = 0;
vector<long> param0 {37,10000000000,10000000000,999999999,39,92,14,19,14,88};
vector<long> param1 {80,-10000000000,10000000000,999999999,36,56,21,38,82,41};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i... |
CHANGE_BITS_CAN_MADE_ONE_FLIP_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHANGE_BITS_CAN_MADE_ONE_FLIP_1{
static boolean f_gold ( String str ) {
int sum = 0 ;
int n = str . length ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) sum += str . charAt ( i ) - '0' ;
return ( sum == n - 1... | null |
using namespace std;
bool f_gold ( string str ) {
int sum = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) sum += str [ i ] - '0';
return ( sum == n - 1 || sum == 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("00001");
param0.add("0000");
param0.add("11");
param0.add("111110");
param0.add("1");
param0.add("111010111010");
param0.add("hUInqJXNdbfP");
param0.add("5191");
... | null |
int main() {
int n_success = 0;
vector<string> param0 {"00001","0000","11","111110","1","111010111010","hUInqJXNdbfP","5191","1110101101","NupSrU xz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
c... |
CENTER_ELEMENT_OF_MATRIX_EQUALS_SUMS_OF_HALF_DIAGONALS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CENTER_ELEMENT_OF_MATRIX_EQUALS_SUMS_OF_HALF_DIAGONALS{
static boolean f_gold ( int mat [ ] [ ] , int n ) {
int diag1_left = 0 , diag1_right = 0 ;
int diag2_left = 0 , diag2_right = 0 ;
for ( int i = 0 , j =... | def f_gold ( mat , n ) :
diag1_left = 0
diag1_right = 0
diag2_left = 0
diag2_right = 0
i = 0
j = n - 1
while i < n :
if ( i < n // 2 ) :
diag1_left += mat [ i ] [ i ]
diag2_left += mat [ j ] [ i ]
elif ( i > n // 2 ) :
diag1_right += mat [ ... | null |
public static void main(String args[]) {
int n_success = 0;
List<int [ ] [ ]> param0 = new ArrayList<>();
param0.add(new int[][]{
new int[]{ 2, 9, 1, 4, -2},
new int[]{ 6, 7, 2, 11, 4},
new int[]{ 4, 2, 9, 2, 4},
new int[]{ 1, 9, 2, 4, 4},
new int[]{ 0, 2, 4, 2, 5} });
param0.add(ne... |
if __name__ == '__main__':
param = [
([[2, 9, 1, 4, -2],
[6, 7, 2, 11, 4],
[ 4, 2, 9, 2, 4],
[1, 9, 2, 4, 4 ],
[ 0, 2, 4, 2, 5]],5,),
([[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
[0... | null |
MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED{
static int f_gold ( int A [ ] , int B [ ] , int n ) {
Arrays . sort ( A ) ;
Arrays . sort ( B ) ;
int result = 0 ;
for ( int i = 0 ;
i < n ;
i ++ )... | def f_gold ( A , B , n ) :
sorted ( A )
sorted ( B )
result = 0
for i in range ( n ) :
result += ( A [ i ] * B [ n - i - 1 ] )
return result
|
using namespace std;
int f_gold ( int A [ ], int B [ ], int n ) {
sort ( A, A + n );
sort ( B, B + n );
int result = 0;
for ( int i = 0;
i < n;
i ++ ) result += ( A [ i ] * B [ n - i - 1 ] );
return result;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{31,85});
param0.add(new int[]{22,-6,84,70,84,6,28,-74,-14,68,22,90,-10});
param0.add(new int[]{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1});
param0.add(new int[]{12,33,93,2,83,9,61,84,9... |
if __name__ == '__main__':
param = [
([31, 85],[18, 33],1,),
([22, -6, 84, 70, 84, 6, 28, -74, -14, 68, 22, 90, -10],[2, -48, -36, -4, -22, -98, -74, -92, -72, -4, 48, -32, 94],6,),
([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1],[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],14,),
([12, 33, 93, 2, 8... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{31,85},{22,-6,84,70,84,6,28,-74,-14,68,22,90,-10},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{12,33,93,2,83,9,61,84,9,69,2},{-92,-88,-84,-78,-78,-76,-66,-54,-52,-48,-46,-44,-40,-34,-32,-24,-20,-14,-6,-4,2,6,10,10,22,26,32,36,36,40,46,48,56,58,64,76,80,80,80,84,... |
AREA_CIRCUMSCRIBED_CIRCLE_SQUARE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class AREA_CIRCUMSCRIBED_CIRCLE_SQUARE{
static float f_gold ( float a ) {
float PI = 3.14159265f ;
return ( a * a * ( PI / 2 ) ) ;
}
| null | null |
public static void main(String args[]) {
int n_success = 0;
List<Float> param0 = new ArrayList<>();
param0.add(3296.590241413969F);
param0.add(-1688.6061770081972F);
param0.add(1571.9067680023313F);
param0.add(-3117.129927920369F);
param0.add(8561.027934208052F);
param0.add(-5052.211066... | null | null |
MINIMUM_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL{
static int f_gold ( int arr [ ] , int n , int k ) {
Arrays . sort ( arr ) ;
int max = arr [ arr . length - 1 ] ;
int res = 0 ;
for ( int i = 0 ;
i < n ... | def f_gold ( arr , n , k ) :
max1 = max ( arr )
res = 0
for i in range ( 0 , n ) :
if ( ( max1 - arr [ i ] ) % k != 0 ) :
return - 1
else :
res += ( max1 - arr [ i ] ) / k
return int ( res )
|
using namespace std;
int f_gold ( int arr [ ], int n, int k ) {
int max = * max_element ( arr, arr + n );
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( ( max - arr [ i ] ) % k != 0 ) return - 1;
else res += ( max - arr [ i ] ) / k;
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4, 7, 19, 16});
param0.add(new int[]{4,4,4,4,4});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1});
param0.ad... |
if __name__ == '__main__':
param = [
([4, 7, 19, 16],4,3),
([4,4,4,4,4],5,3),
([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],39,1),
([85,36,52,8,52,15,16],5,6),
([-10,-5,-5,-20,10,30],6,5),
([0,1,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0],10,15),
([1,5,5,9,1... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4, 7, 19, 16},{4,4,4,4,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,36,52,8,52,15,16},{-10,-5,-5,-20,10,30},{0,1,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0},{1,5,5,9,11,12,12,13,13,14,16,18,26,26,28,28,30,31,... |
RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM{
static int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n ;
return Math . max ( ( f_gold ( n / 2 ) + f_gold ( n / 3 ) + f_gold ( n / 4 ) ) , n ) ;
}
| def f_gold ( n ) :
if ( n == 0 or n == 1 ) :
return n
return max ( ( f_gold ( n // 2 ) + f_gold ( n // 3 ) + f_gold ( n // 4 ) ) , n )
|
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
return max ( ( f_gold ( n / 2 ) + f_gold ( n / 3 ) + f_gold ( n / 4 ) ), n );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(39);
param0.add(79);
param0.add(7);
param0.add(76);
param0.add(48);
param0.add(18);
param0.add(58);
param0.add(17);
param0.add(36);
param0.add(5);
for(int... |
if __name__ == '__main__':
param = [
(39,),
(79,),
(7,),
(76,),
(48,),
(18,),
(58,),
(17,),
(36,),
(5,)
]
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 {39,79,7,76,48,18,58,17,36,5};
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_SUM_SUBARRAY_REMOVING_ONE_ELEMENT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUM_SUBARRAY_REMOVING_ONE_ELEMENT{
static int f_gold ( int arr [ ] , int n ) {
int fw [ ] = new int [ n ] ;
int bw [ ] = new int [ n ] ;
int cur_max = arr [ 0 ] , max_so_far = arr [ 0 ] ;
fw [ 0 ] ... | def f_gold ( arr , n ) :
fw = [ 0 for k in range ( n ) ]
bw = [ 0 for k in range ( n ) ]
cur_max , max_so_far = arr [ 0 ] , arr [ 0 ]
for i in range ( n ) :
cur_max = max ( arr [ i ] , cur_max + arr [ i ] )
max_so_far = max ( max_so_far , cur_max )
fw [ i ] = cur_max
cur_max ... |
using namespace std;
int f_gold ( int arr [ ], int n ) {
int fw [ n ], bw [ n ];
int cur_max = arr [ 0 ], max_so_far = arr [ 0 ];
fw [ 0 ] = arr [ 0 ];
for ( int i = 1;
i < n;
i ++ ) {
cur_max = max ( arr [ i ], cur_max + arr [ i ] );
max_so_far = max ( max_so_far, cur_max );
fw [ i ] = cur_max... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,8,14,17,19,35,38,45,50,53,55,70,82,88,92,96});
param0.add(new int[]{-64,-56,-80,-82,72,62,-8,48,-96,34,64,-38,-60,80,4,-64,-62,34,94,-16,38,62,-84,48,42,-40});
param0.add(new... |
if __name__ == '__main__':
param = [
([2, 8, 14, 17, 19, 35, 38, 45, 50, 53, 55, 70, 82, 88, 92, 96],13,),
([-64, -56, -80, -82, 72, 62, -8, 48, -96, 34, 64, -38, -60, 80, 4, -64, -62, 34, 94, -16, 38, 62, -84, 48, 42, -40],22,),
([0, 0, 0, 0, 1, 1, 1],6,),
([3, 7, 50, 53, 72, 14, 18, 74, 27, 65, 4... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,8,14,17,19,35,38,45,50,53,55,70,82,88,92,96},{-64,-56,-80,-82,72,62,-8,48,-96,34,64,-38,-60,80,4,-64,-62,34,94,-16,38,62,-84,48,42,-40},{0,0,0,0,1,1,1},{3,7,50,53,72,14,18,74,27,65,41,20,54,17,87,40,63,15,47},{-96,-96,-94,-80,-74,-74,-74,-74,-70,-6... |
NUMBER_IS_DIVISIBLE_BY_29_OR_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_IS_DIVISIBLE_BY_29_OR_NOT{
static boolean f_gold ( long n ) {
while ( n / 100 > 0 ) {
int last_digit = ( int ) n % 10 ;
n /= 10 ;
n += last_digit * 3 ;
}
return ( n % 29 == 0 ) ;
}
| def f_gold ( n ) :
while ( int ( n / 100 ) ) :
last_digit = int ( n % 10 )
n = int ( n / 10 )
n += last_digit * 3
return ( n % 29 == 0 )
|
using namespace std;
bool f_gold ( long long int n ) {
while ( n / 100 ) {
int last_digit = n % 10;
n /= 10;
n += last_digit * 3;
}
return ( n % 29 == 0 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Long> param0 = new ArrayList<>();
param0.add(29L);
param0.add(0L);
param0.add(65L);
param0.add(1419L);
param0.add(54L);
param0.add(7L);
param0.add(44L);
param0.add(34L);
param0.add(1160L);
param0.add(292929002929L);
for(int i = 0; i < par... |
if __name__ == '__main__':
param = [
(29,),
(0,),
(65,),
(1419,),
(54,),
(7,),
(44,),
(34,),
(1160,),
(292929002929,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i"... |
int main() {
int n_success = 0;
vector<long> param0 {50,11,65,32,8,54,7,44,34,63};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
MINIMUM_PRODUCT_SUBSET_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MINIMUM_PRODUCT_SUBSET_ARRAY{
static int f_gold ( int a [ ] , int n ) {
if ( n == 1 ) return a [ 0 ] ;
int negmax = Integer . MIN_VALUE ;
int posmin = Integer . MAX_VALUE ;
int count_neg = 0 , count_zero =... | def f_gold ( a , n ) :
if ( n == 1 ) :
return a [ 0 ]
max_neg = float ( '-inf' )
min_pos = float ( 'inf' )
count_neg = 0
count_zero = 0
prod = 1
for i in range ( 0 , n ) :
if ( a [ i ] == 0 ) :
count_zero = count_zero + 1
continue
if ( a [ i ] ... |
using namespace std;
int f_gold ( int a [ ], int n ) {
if ( n == 1 ) return a [ 0 ];
int max_neg = INT_MIN;
int min_pos = INT_MAX;
int count_neg = 0, count_zero = 0;
int prod = 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] == 0 ) {
count_zero ++;
continue;
}
if ( a [ i ] < 0 ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{3,6,7,8,8,9,12,12,12,13,15,15,15,16,18,18,18,19,20,21,22,22,23,28,29,30,30,33,33,35,35,36,40,43,58,63,73,78,82,83,84,87,89,89,92,94});
param0.add(new int[]{18,-6,-8,98,66,-86,24,6,... |
if __name__ == '__main__':
param = [
([3, 6, 7, 8, 8, 9, 12, 12, 12, 13, 15, 15, 15, 16, 18, 18, 18, 19, 20, 21, 22, 22, 23, 28, 29, 30, 30, 33, 33, 35, 35, 36, 40, 43, 58, 63, 73, 78, 82, 83, 84, 87, 89, 89, 92, 94],23,),
([18, -6, -8, 98, 66, -86, 24, 6, 58, 74, 82],10,),
([0, 0, 0, 0, 0, 0, 0, 0, 0,... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,6,7,8,8,9,12,12,12,13,15,15,15,16,18,18,18,19,20,21,22,22,23,28,29,30,30,33,33,35,35,36,40,43,58,63,73,78,82,83,84,87,89,89,92,94},{18,-6,-8,98,66,-86,24,6,58,74,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1... |
PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD{
static boolean f_gold ( int n ) {
if ( n <= 1 ) return false ;
for ( int i = 2 ;
i < n ;
i ++ ) if ( n % i == 0 ) return false ;
return true ;
}
| def f_gold ( n ) :
if n <= 1 :
return False
for i in range ( 2 , n ) :
if n % i == 0 :
return False ;
return True
|
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(37);
param0.add(39);
param0.add(73);
param0.add(8);
param0.add(28);
param0.add(66);
param0.add(20);
param0.add(36);
param0.add(6);
param0.add(51);
for(int... |
if __name__ == '__main__':
param = [
(37,),
(39,),
(73,),
(8,),
(28,),
(66,),
(20,),
(36,),
(6,),
(51,)
]
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 {37,39,73,8,28,66,20,36,6,51};
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... |
FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE{
static char f_gold ( String str ) {
for ( int i = 0 ;
i < str . length ( ) ;
i ++ ) if ( Character . isUpperCase ( str . charAt ( i ) ) ) return st... | def f_gold ( str ) :
for i in range ( 0 , len ( str ) ) :
if ( str [ i ].istitle ( ) ) :
return str [ i ]
return 0
|
using namespace std;
char f_gold ( string str ) {
for ( int i = 0;
i < str . length ( );
i ++ ) if ( isupper ( str [ i ] ) ) return str [ i ];
return 0;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("pH");
param0.add("96544000");
param0.add("000010000");
param0.add("ujqpx");
param0.add("20684847994");
param0.add("111");
param0.add("rclkv");
param0.add("45173693434... |
if __name__ == '__main__':
param = [
('pH',),
('96544000',),
('000010000',),
('ujqpx',),
('20684847994',),
('111',),
('rclkv',),
('45173693434',),
('11111011001101',),
('f',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*para... |
int main() {
int n_success = 0;
vector<string> param0 {"pH","96544000","000010000","ujqpx","20684847994","111","rclkv","45173693434","11111011001101","f"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
... |
PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING{
public static int f_gold ( String s , char c ) {
int res = 0 ;
for ( int i = 0 ;
i < s . length ( ) ;
i ++ ) {
if ( s . charAt ( i ) == c ) res ++ ;
}... | def f_gold ( s , c ) :
res = 0
for i in range ( len ( s ) ) :
if ( s [ i ] == c ) :
res = res + 1
return res
|
using namespace std;
int f_gold ( string s, char c ) {
int res = 0;
for ( int i = 0;
i < s . length ( );
i ++ ) if ( s [ i ] == c ) res ++;
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("mhjnKfd");
param0.add("716662107");
param0.add("01");
param0.add("wPHSxIbnHakGRO");
param0.add("721106");
param0.add("111");
param0.add("TIBFU");
param0.add("0");
... |
if __name__ == '__main__':
param = [
('mhjnKfd','l',),
('716662107','6',),
('01','1',),
('wPHSxIbnHakGRO','n',),
('721106','8',),
('111','0',),
('TIBFU','Q',),
('0','3',),
('10','0',),
('lqq','d',)
]
n_success = 0
for i, parameters_set in enumerate(param):
... |
int main() {
int n_success = 0;
vector<string> param0 {"mhjnKfd","716662107","01","wPHSxIbnHakGRO","721106","111","TIBFU","0","10","lqq"};
vector<char> param1 {'l','6','1','n','8','0','Q','3','0','d'};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param... |
FIND_SUM_ODD_FACTORS_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUM_ODD_FACTORS_NUMBER{
static int f_gold ( int n ) {
int res = 1 ;
while ( n % 2 == 0 ) n = n / 2 ;
for ( int i = 3 ;
i <= Math . sqrt ( n ) ;
i ++ ) {
int count = 0 , curr_sum = 1 ;
int cu... | import math
def f_gold ( n ) :
res = 1
while n % 2 == 0 :
n = n // 2
for i in range ( 3 , int ( math.sqrt ( n ) + 1 ) ) :
count = 0
curr_sum = 1
curr_term = 1
while n % i == 0 :
count += 1
n = n // i
curr_term *= i
curr... |
using namespace std;
int f_gold ( int n ) {
int res = 1;
while ( n % 2 == 0 ) n = n / 2;
for ( int i = 3;
i <= sqrt ( n );
i ++ ) {
int count = 0, curr_sum = 1;
int curr_term = 1;
while ( n % i == 0 ) {
count ++;
n = n / i;
curr_term *= i;
curr_sum += curr_term;
}
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(20);
param0.add(6);
param0.add(39);
param0.add(80);
param0.add(88);
param0.add(7);
param0.add(16);
param0.add(27);
param0.add(83);
param0.add(6);
for(int ... |
if __name__ == '__main__':
param = [
(20,),
(6,),
(39,),
(80,),
(88,),
(7,),
(16,),
(27,),
(83,),
(6,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
pri... |
int main() {
int n_success = 0;
vector<int> param0 {20,6,39,80,88,7,16,27,83,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
re... |
CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT{
static boolean f_gold ( String num ) {
int length = num . length ( ) ;
if ( length == 1 && num . charAt ( 0 ) == '0' ) return true ;
if ( length % 3 == 1 ) {
num += "... | def f_gold ( num ) :
length = len ( num )
if ( length == 1 and num [ 0 ] == '0' ) :
return True
if ( length % 3 == 1 ) :
num = str ( num ) + "00"
length += 2
elif ( length % 3 == 2 ) :
num = str ( num ) + "0"
length += 1
sum = 0
p = 1
for i in range ( ... |
using namespace std;
bool f_gold ( string num ) {
int length = num . size ( );
if ( length == 1 && num [ 0 ] == '0' ) return true;
if ( length % 3 == 1 ) {
num += "00";
length += 2;
}
else if ( length % 3 == 2 ) {
num += "0";
length += 1;
}
int sum = 0, p = 1;
for ( int i = length - 1;
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("vzTUaItpCpLnjY");
param0.add("33855");
param0.add("0011110101011");
param0.add("MMQ");
param0.add("439340517954");
param0.add("000000000");
param0.add("UugAuRRJbjEgl");
... |
if __name__ == '__main__':
param = [
('vzTUaItpCpLnjY',),
('33855',),
('0011110101011',),
('MMQ',),
('439340517954',),
('000000000',),
('UugAuRRJbjEgl',),
('6406553695441',),
('011001',),
('yjFqEEvgiNjEX',)
]
n_success = 0
for i, parameters_set in enumerate(p... |
int main() {
int n_success = 0;
vector<string> param0 {"vzTUaItpCpLnjY","33855","0011110101011","MMQ","439340517954","000000000","UugAuRRJbjEgl","6406553695441","011001","yjFqEEvgiNjEX"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
... |
LARGEST_SUBSEQUENCE_GCD_GREATER_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LARGEST_SUBSEQUENCE_GCD_GREATER_1{
static int f_gold ( int arr [ ] , int n ) {
int ans = 0 ;
int maxele = Arrays . stream ( arr ) . max ( ) . getAsInt ( ) ;
;
for ( int i = 2 ;
i <= maxele ;
++ i ) {
... | def f_gold ( arr , n ) :
ans = 0
maxele = max ( arr )
for i in range ( 2 , maxele + 1 ) :
count = 0
for j in range ( n ) :
if ( arr [ j ] % i == 0 ) :
count += 1
ans = max ( ans , count )
return ans
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int ans = 0;
int maxele = * max_element ( arr, arr + n );
for ( int i = 2;
i <= maxele;
++ i ) {
int count = 0;
for ( int j = 0;
j < n;
++ j ) {
if ( arr [ j ] % i == 0 ) ++ count;
}
ans = max ( ans, count );
}
return ... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{10,18,22,22,22,29,30,32,33,34,37,39,40,41,44,47,49,50,50,51,53,67,69,70,71,71,73,75,78,80,81,82,91,91,93,97,97,99});
param0.add(new int[]{-42,62,6,98,38,-4,-38,72,42,4,-22,-94,78,-... |
if __name__ == '__main__':
param = [
([10, 18, 22, 22, 22, 29, 30, 32, 33, 34, 37, 39, 40, 41, 44, 47, 49, 50, 50, 51, 53, 67, 69, 70, 71, 71, 73, 75, 78, 80, 81, 82, 91, 91, 93, 97, 97, 99],35,),
([-42, 62, 6, 98, 38, -4, -38, 72, 42, 4, -22, -94, 78, -90, 14],10,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{10,18,22,22,22,29,30,32,33,34,37,39,40,41,44,47,49,50,50,51,53,67,69,70,71,71,73,75,78,80,81,82,91,91,93,97,97,99},{-42,62,6,98,38,-4,-38,72,42,4,-22,-94,78,-90,14},{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}... |
PRINT_WORDS_STRING_REVERSE_ORDER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRINT_WORDS_STRING_REVERSE_ORDER{
static String f_gold ( String str ) {
int i = str . length ( ) - 1 ;
int start , end = i + 1 ;
String result = "" ;
while ( i >= 0 ) {
if ( str . charAt ( i ) == ' ' )... | def f_gold ( str ) :
i = len ( str ) - 1
start = end = i + 1
result = ''
while i >= 0 :
if str [ i ] == ' ' :
start = i + 1
while start != end :
result += str [ start ]
start += 1
result += ' '
end = i
i -= 1... |
using namespace std;
string f_gold ( string str ) {
int i = str . length ( ) - 1;
int start, end = i + 1;
string result = "";
while ( i >= 0 ) {
if ( str [ i ] == ' ' ) {
start = i + 1;
while ( start != end ) result += str [ start ++ ];
result += ' ';
end = i;
}
i --;
}
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("m Dm YZ");
param0.add("65 48 57 71");
param0.add("01 010");
param0.add("mT vhByi");
param0.add("19 44 9 1");
param0.add("0");
param0.add("z vUi ");
param0.add("7 591... |
if __name__ == '__main__':
param = [
('m Dm YZ',),
('65 48 57 71',),
('01 010',),
('mT vhByi',),
('19 44 9 1',),
('0',),
('z vUi ',),
('7 591 36643 9 055',),
('01',),
('ti YGaijPY',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_fil... |
int main() {
int n_success = 0;
vector<string> param0 {
"m Dm YZ",
"65 48 57 71",
"01 010",
"mT vhByi",
"19 44 9 1",
"0",
"z vUi ",
"7 591 36643 9 055",
"01",
"ti YGaijPY"
};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(p... |
PROGRAM_DECIMAL_BINARY_CONVERSION_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PROGRAM_DECIMAL_BINARY_CONVERSION_2{
static int f_gold ( int N ) {
int B_Number = 0 ;
int cnt = 0 ;
while ( N != 0 ) {
int rem = N % 2 ;
double c = Math . pow ( 10 , cnt ) ;
B_Number += rem * c ;... | def f_gold ( N ) :
B_Number = 0
cnt = 0
while ( N != 0 ) :
rem = N % 2
c = pow ( 10 , cnt )
B_Number += rem * c
N //= 2
cnt += 1
return B_Number
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(18);
param0.add(92);
param0.add(87);
param0.add(50);
param0.add(56);
param0.add(88);
param0.add(3);
param0.add(16);
param0.add(45);
param0.add(58);
for(in... |
if __name__ == '__main__':
param = [
(18,),
(92,),
(87,),
(50,),
(56,),
(88,),
(3,),
(16,),
(45,),
(58,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... | null |
MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE{
static int f_gold ( int b , int m ) {
return ( b / m - 1 ) * ( b / m ) / 2 ;
}
| def f_gold ( b , m ) :
return ( b / m - 1 ) * ( b / m ) / 2
|
using namespace std;
int f_gold ( int b, int m ) {
return ( b / m - 1 ) * ( b / m ) / 2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(40);
param0.add(38);
param0.add(47);
param0.add(52);
param0.add(21);
param0.add(50);
param0.add(8);
param0.add(56);
param0.add(93);
param0.add(21);
List<I... |
if __name__ == '__main__':
param = [
(40,74,),
(38,35,),
(47,71,),
(52,29,),
(21,9,),
(50,33,),
(8,82,),
(56,80,),
(93,5,),
(21,90,)
]
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 {40,38,47,52,21,50,8,56,93,21};
vector<int> param1 {74,35,71,29,9,33,82,80,5,90};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
... |
K_TH_DIGIT_RAISED_POWER_B |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class K_TH_DIGIT_RAISED_POWER_B{
public static int f_gold ( int a , int b , int k ) {
int p = ( int ) Math . pow ( a , b ) ;
int count = 0 ;
while ( p > 0 && count < k ) {
int rem = p % 10 ;
count ++ ;
... | def f_gold ( a , b , k ) :
p = a ** b
count = 0
while ( p > 0 and count < k ) :
rem = p % 10
count = count + 1
if ( count == k ) :
return rem
p = p / 10 ;
|
using namespace std;
int f_gold ( int a, int b, int k ) {
int p = pow ( a, b );
int count = 0;
while ( p > 0 && count < k ) {
int rem = p % 10;
count ++;
if ( count == k ) return rem;
p = p / 10;
}
return 0;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(11);
param0.add(41);
param0.add(5);
param0.add(1);
param0.add(24);
param0.add(5);
param0.add(66);
param0.add(7);
param0.add(77);
param0.add(60);
List<Integer> param1 = new ArrayList<>();
... |
if __name__ == '__main__':
param = [
(11,2,1),
(41,3,3),
(5,4,3),
(1,2,4),
(24,1,5),
(5,2,3),
(66,5,8),
(7,10,3),
(77,30,10),
(60,50,1)
]
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,41,5,1,24,5,66,7,77,60};
vector<int> param1 {2,3,4,2,1,2,5,10,30,50};
vector<int> param2 {1,0,3,4,5,3,8,3,10,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],para... |
ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE{
static int f_gold ( int start , int end , int arr [ ] ) {
Map < Integer , Integer > mp = new HashMap < > ( ) ;
for ( int i = start ;
i <= end ;
i ++ ) mp . put... | def f_gold ( start , end , arr ) :
frequency = dict ( )
for i in range ( start , end + 1 ) :
if arr [ i ] in frequency.keys ( ) :
frequency [ arr [ i ] ] += 1
else :
frequency [ arr [ i ] ] = 1
count = 0
for x in frequency :
if x == frequency [ x ] :
... |
using namespace std;
int f_gold ( int start, int end, int arr [ ] ) {
unordered_map < int, int > frequency;
for ( int i = start;
i <= end;
i ++ ) frequency [ arr [ i ] ] ++;
int count = 0;
for ( auto x : frequency ) if ( x . first == x . second ) count ++;
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(0);
param0.add(1);
param0.add(3);
param0.add(10);
param0.add(2);
param0.add(0);
param0.add(14);
param0.add(29);
param0.add(31);
param0.add(21);
List<Integ... |
if __name__ == '__main__':
param = [
(0,31,[1,2,2,3,3,3,12,13,18,18,26,28,29,36,37,39,40,49,55,57,63,69,69,73,85,86,87,87,89,89,90,91,92,93,93,93,95,99],),
(1,25,[24,-62,2,1,94,56,-22,-70,-22,-34,-92,-18,56,2,60,38,-88,16,-28,30,-30,58,-80,94,6,56],),
(3,4,[0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1],),
(... |
int main() {
int n_success = 0;
vector<int> param0 {0,1,3,10,2,0,14,29,31,21};
vector<int> param1 {31,25,4,15,3,6,18,33,19,32};
vector<vector<int>> param2 {
{1,2,2,3,3,3,12,13,18,18,26,28,29,36,37,39,40,49,55,57,63,69,69,73,85,86,87,87,89,89,90,91,92,93,93,93,95,99},
{24,-62,2,1,94,56,-22,-70,-... |
FIND_SUBARRAY_WITH_GIVEN_SUM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class FIND_SUBARRAY_WITH_GIVEN_SUM{
static int f_gold ( int arr [ ] , int n , int sum ) {
int curr_sum , i , j ;
for ( i = 0 ;
i < n ;
i ++ ) {
curr_sum = arr [ i ] ;
for ( j = i + 1 ;
j <= n ;
j... | def f_gold ( arr , n , sum ) :
for i in range ( n ) :
curr_sum = arr [ i ]
j = i + 1
while j <= n :
if curr_sum == sum :
print ( "Sum found between" )
print ( "indexes %d and %d" % ( i , j - 1 ) )
return 1
if curr_sum > ... |
using namespace std;
int f_gold ( int arr [ ], int n, int sum ) {
int curr_sum, i, j;
for ( i = 0;
i < n;
i ++ ) {
curr_sum = arr [ i ];
for ( j = i + 1;
j <= n;
j ++ ) {
if ( curr_sum == sum ) {
cout << "Sum found between indexes " << i << " and " << j - 1;
return 1;
... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,8,8,10,15,18,19,22,25,26,30,32,35,36,40,41,43,48,53,57,59,63,64,68,71,76,76,77,78,89,96,97});
param0.add(new int[]{-78,16,-16,-10,-2,-38,58,-72,-78,50,-68,-16,-96,82,70,2,-20});
... |
if __name__ == '__main__':
param = [
([4, 8, 8, 10, 15, 18, 19, 22, 25, 26, 30, 32, 35, 36, 40, 41, 43, 48, 53, 57, 59, 63, 64, 68, 71, 76, 76, 77, 78, 89, 96, 97],26,23,),
([-78, 16, -16, -10, -2, -38, 58, -72, -78, 50, -68, -16, -96, 82, 70, 2, -20],9,12,),
([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1]... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,8,8,10,15,18,19,22,25,26,30,32,35,36,40,41,43,48,53,57,59,63,64,68,71,76,76,77,78,89,96,97},{-78,16,-16,-10,-2,-38,58,-72,-78,50,-68,-16,-96,82,70,2,-20},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{16,10,55,43,46,74,57,65,86,60,28,6,92},{-98,-98,-90,-84,-84,-80... |
MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY{
static int f_gold ( int arr [ ] , int n ) {
int res = Integer . MIN_VALUE ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int curr_sum = 0 ;
for ( int j = 0 ;
... | import sys
def f_gold ( arr , n ) :
res = - sys.maxsize
for i in range ( 0 , n ) :
curr_sum = 0
for j in range ( 0 , n ) :
index = int ( ( i + j ) % n )
curr_sum += j * arr [ index ]
res = max ( res , curr_sum )
return res
|
using namespace std;
int f_gold ( int arr [ ], int n ) {
int res = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
int curr_sum = 0;
for ( int j = 0;
j < n;
j ++ ) {
int index = ( i + j ) % n;
curr_sum += j * arr [ index ];
}
res = max ( res, curr_sum );
}
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{11,12,16,26,29,40,54,59,65,70,71,73,78,81,87,87,88,90,95,97});
param0.add(new int[]{-46,-32,54,96,-72,-58,-36,-44,26,-2,-68,42,90,26,-92,-96,88,-42,-18,46,-70,24,0,24,34,34,-52,50,... |
if __name__ == '__main__':
param = [
([11, 12, 16, 26, 29, 40, 54, 59, 65, 70, 71, 73, 78, 81, 87, 87, 88, 90, 95, 97],11,),
([-46, -32, 54, 96, -72, -58, -36, -44, 26, -2, -68, 42, 90, 26, -92, -96, 88, -42, -18, 46, -70, 24, 0, 24, 34, 34, -52, 50, 94, -60, 64, 58],22,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, ... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{11,12,16,26,29,40,54,59,65,70,71,73,78,81,87,87,88,90,95,97},{-46,-32,54,96,-72,-58,-36,-44,26,-2,-68,42,90,26,-92,-96,88,-42,-18,46,-70,24,0,24,34,34,-52,50,94,-60,64,58},{0,0,0,0,0,0,0,0,0,0,0,0,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... |
PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND{
public static int f_gold ( int arr1 [ ] , int arr2 [ ] , int n1 , int n2 ) {
Arrays . sort ( arr1 ) ;
Arrays . sort ( arr2 ) ;
return arr1 [ n1 - 1 ] * arr2 [ 0 ] ... | null |
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n1, int n2 ) {
sort ( arr1, arr1 + n1 );
sort ( arr2, arr2 + n2 );
return arr1 [ n1 - 1 ] * arr2 [ 0 ];
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{4,11,12,12,14,14,15,33,51,51,61,63,68,69,75,83,84,97});
param0.add(new int[]{88,-10,-18,74,56,-36,-86,72,76,26,-36,10,-6,-80,-34,14,-82,74,48,-76,-78,-50,-62,-86,96,22,42,-28,18,6,... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,11,12,12,14,14,15,33,51,51,61,63,68,69,75,83,84,97},{88,-10,-18,74,56,-36,-86,72,76,26,-36,10,-6,-80,-34,14,-82,74,48,-76,-78,-50,-62,-86,96,22,42,-28,18,6,58,-72,54},{0,0,0,0,0,0,0,0,0,0,0,0,0,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,... |
PRINT_MAXIMUM_SHORTEST_DISTANCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRINT_MAXIMUM_SHORTEST_DISTANCE{
static int f_gold ( int a [ ] , int n , int k ) {
HashMap < Integer , Integer > b = new HashMap < Integer , Integer > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
int x = a... | def f_gold ( a , n , k ) :
b = dict ( )
for i in range ( n ) :
x = a [ i ]
d = min ( 1 + i , n - i )
if x not in b.keys ( ) :
b [ x ] = d
else :
b [ x ] = min ( d , b [ x ] )
ans = 10 ** 9
for i in range ( n ) :
x = a [ i ]
if ( x !... |
using namespace std;
int f_gold ( int a [ ], int n, int k ) {
unordered_map < int, int > b;
for ( int i = 0;
i < n;
i ++ ) {
int x = a [ i ];
int d = min ( 1 + i, n - i );
if ( b . find ( x ) == b . end ( ) ) b [ x ] = d;
else b [ x ] = min ( d, b [ x ] );
}
int ans = INT_MAX;
for ( int i... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,27,66,89,96,96});
param0.add(new int[]{84,-38,-56,-20,-98,-40,-16,22,20,98,-56,-32,-44,30,-58,26,-44,-32,50,46,92});
param0.add(new int[]{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,... |
if __name__ == '__main__':
param = [
([2, 27, 66, 89, 96, 96],4,4,),
([84, -38, -56, -20, -98, -40, -16, 22, 20, 98, -56, -32, -44, 30, -58, 26, -44, -32, 50, 46, 92],13,11,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],23,13,),
([20, 71, 66, 58, 74, 2, 63, 13, 1, 3... |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,27,66,89,96,96},{84,-38,-56,-20,-98,-40,-16,22,20,98,-56,-32,-44,30,-58,26,-44,-32,50,46,92},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{20,71,66,58,74,2,63,13,1,36,28,83,24,20,85,30,59,56,8,97,58,28,28,42},{-94,-88,-86,-68,-66,-64,-28,-12... |
NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1{
static int f_gold ( int n ) {
return ( ( n + 1 ) * ( n + 2 ) ) / 2 ;
}
| def f_gold ( n ) :
return int ( ( ( n + 1 ) * ( n + 2 ) ) / 2 )
|
using namespace std;
int f_gold ( int n ) {
return ( ( n + 1 ) * ( n + 2 ) ) / 2;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(41);
param0.add(72);
param0.add(54);
param0.add(75);
param0.add(87);
param0.add(41);
param0.add(78);
param0.add(80);
param0.add(46);
param0.add(9);
for(in... |
if __name__ == '__main__':
param = [
(41,),
(72,),
(54,),
(75,),
(87,),
(41,),
(78,),
(80,),
(46,),
(9,)
]
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 {41,72,54,75,87,41,78,80,46,9};
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();
... |
BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS_1{
public static int f_gold ( int a , int b , int x , int y ) {
if ( a == 0 ) {
x = 0 ;
y = 1 ;
return b ;
}
int x1 = 1 , y1 = 1 ;
int gcd = f_gold ( b %... | def f_gold ( a , b , x , y ) :
if a == 0 :
x = 0
y = 1
return b
x1 = 1
y1 = 1
gcd = f_gold ( b % a , a , x1 , y1 )
x = y1 - ( b / a ) * x1
y = x1
return gcd
| null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(44);
param0.add(33);
param0.add(39);
param0.add(52);
param0.add(64);
param0.add(45);
param0.add(53);
param0.add(86);
param0.add(57);
param0.add(11);
List<... |
if __name__ == '__main__':
param = [
(44,17,10,65,),
(33,81,67,20,),
(39,77,21,34,),
(52,96,23,97,),
(64,48,17,33,),
(45,32,89,3,),
(53,88,24,74,),
(86,19,29,21,),
(57,67,30,32,),
(11,86,96,81,)
]
n_success = 0
for i, parameters_set in enumerate(param):
... | null |
DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING{
static int f_gold ( String str ) {
int n = str . length ( ) ;
int [ ] [ ] C = new int [ n ] [ n ] ;
boolean [ ] [ ] P = new boolean [ n ] [ n ] ;
int i ,... | def f_gold ( str ) :
n = len ( str )
C = [ [ 0 for i in range ( n ) ] for i in range ( n ) ]
P = [ [ False for i in range ( n ) ] for i in range ( n ) ]
j = 0
k = 0
L = 0
for i in range ( n ) :
P [ i ] [ i ] = True ;
C [ i ] [ i ] = 0 ;
for L in range ( 2 , n + 1 ) :
... | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("ydYdV");
param0.add("4446057");
param0.add("0111");
param0.add("keEj");
param0.add("642861576557");
param0.add("11111000101");
param0.add("ram");
param0.add("09773261... |
if __name__ == '__main__':
param = [
('ydYdV',),
('4446057',),
('0111',),
('keEj',),
('642861576557',),
('11111000101',),
('ram',),
('09773261',),
('1',),
('AVBEKClFdj',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*paramete... | null |
COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS{
static int f_gold ( String str [ ] , int n ) {
HashMap < String , Integer > m = new HashMap < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( m . conta... | def f_gold ( stri , n ) :
m = dict ( )
for i in range ( n ) :
m [ stri [ i ] ] = m.get ( stri [ i ] , 0 ) + 1
res = 0
for i in m.values ( ) :
if i == 2 :
res += 1
return res
|
using namespace std;
int f_gold ( string str [ ], int n ) {
unordered_map < string, int > m;
for ( int i = 0;
i < n;
i ++ ) m [ str [ i ] ] += 1;
int res = 0;
for ( auto it = m . begin ( );
it != m . end ( );
it ++ ) if ( ( it -> second == 2 ) ) res ++;
return res;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String [ ]> param0 = new ArrayList<>();
param0.add(new String[]{"hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"});
param0.add(new String[]{"16","946613197072","532052","42780833","511552","1241934","4","... |
if __name__ == '__main__':
param = [
(["hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"],10,),
(["16","946613197072","532052","42780833","511552","1241934","4","3444540","47487223670074","23753","14158","4","95420017116714","16","0845","689000748","976403809728","8922","48... |
int main() {
int n_success = 0;
vector<vector<string>> param0 {
{"hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"},
{"16","946613197072","532052","42780833","511552","1241934","4","3444540","47487223670074","23753","14158","4","95420017116714","16","0845","689000748","... |
NEXT_POWER_OF_2_2 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class NEXT_POWER_OF_2_2{
static int f_gold ( int n ) {
n -- ;
n |= n >> 1 ;
n |= n >> 2 ;
n |= n >> 4 ;
n |= n >> 8 ;
n |= n >> 16 ;
n ++ ;
return n ;
}
| def f_gold ( n ) :
n -= 1
n |= n >> 1
n |= n >> 2
n |= n >> 4
n |= n >> 8
n |= n >> 16
n += 1
return n
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
n --;
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n ++;
return n;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(63);
param0.add(78);
param0.add(13);
param0.add(5);
param0.add(34);
param0.add(69);
param0.add(63);
param0.add(78);
param0.add(80);
param0.add(19);
for(in... |
if __name__ == '__main__':
param = [
(63,),
(78,),
(13,),
(5,),
(34,),
(69,),
(63,),
(78,),
(80,),
(19,)
]
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 {63,78,13,5,34,69,63,78,80,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();
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.