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 ⌀ |
|---|---|---|---|---|---|---|
LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K{
static int f_gold ( int k , String s1 , String s2 ) {
int n = s1 . length ( ) ;
int m = s2 . length ( ) ;
int lcs [ ] [ ] = new int [ n + 1 ] [ m + 1 ] ;
int... | def f_gold ( k , s1 , s2 ) :
n = len ( s1 )
m = len ( s2 )
lcs = [ [ 0 for x in range ( m + 1 ) ] for y in range ( n + 1 ) ]
cnt = [ [ 0 for x in range ( m + 1 ) ] for y in range ( n + 1 ) ]
for i in range ( 1 , n + 1 ) :
for j in range ( 1 , m + 1 ) :
lcs [ i ] [ j ] = max ( lcs... |
using namespace std;
int f_gold ( int k, string s1, string s2 ) {
int n = s1 . length ( );
int m = s2 . length ( );
int lcs [ n + 1 ] [ m + 1 ];
int cnt [ n + 1 ] [ m + 1 ];
memset ( lcs, 0, sizeof ( lcs ) );
memset ( cnt, 0, sizeof ( cnt ) );
for ( int i = 1;
i <= n;
i ++ ) {
for ( int j = 1;
... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(4);
param0.add(2);
param0.add(3);
param0.add(5);
param0.add(2);
param0.add(3);
param0.add(3);
param0.add(1);
param0.add(2);
param0.add(2);
List<String> pa... |
if __name__ == '__main__':
param = [
(4,'aggayxysdfa','aggajxaaasdfa',),
(2,'55571659965107','390286654154',),
(3,'01011011100','0000110001000',),
(5,'aggasdfa','aggajasdfaxy',),
(2,'5710246551','79032504084062',),
(3,'0100010','10100000',),
(3,'aabcaaaa','baaabcd',),
(1,'1219','333... |
int main() {
int n_success = 0;
vector<int> param0 {4,2,3,5,2,3,3,1,2,2};
vector<string> param1 {"aggayxysdfa","55571659965107","01011011100","aggasdfa","5710246551","0100010","aabcaaaa","1219","111000011","wiC oD"};
vector<string> param2 {"aggajxaaasdfa","390286654154","0000110001000","aggajasdfaxy","... |
COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS{
static int f_gold ( String str ) {
int result = 0 ;
int n = str . length ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) for ( int j = i + 1 ;
j < n ;
j ++ ... | def f_gold ( str1 ) :
result = 0 ;
n = len ( str1 )
for i in range ( 0 , n ) :
for j in range ( i + 1 , n ) :
if ( abs ( ord ( str1 [ i ] ) - ord ( str1 [ j ] ) ) == abs ( i - j ) ) :
result += 1 ;
return result ;
|
using namespace std;
int f_gold ( string str ) {
int result = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) if ( abs ( str [ i ] - str [ j ] ) == abs ( i - j ) ) result ++;
return result;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("smnKL");
param0.add("270083");
param0.add("0");
param0.add("kcZdsz");
param0.add("483544224");
param0.add("000011");
param0.add("WysGCirMwKBzP");
param0.add("3366");
... |
if __name__ == '__main__':
param = [
('smnKL',),
('270083',),
('0',),
('kcZdsz',),
('483544224',),
('000011',),
('WysGCirMwKBzP',),
('3366',),
('110',),
('NlaMkpCjUgg',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameter... |
int main() {
int n_success = 0;
vector<string> param0 {"smnKL","270083","0","kcZdsz","483544224","000011","WysGCirMwKBzP","3366","110","NlaMkpCjUgg"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
co... |
RECURSIVE_PROGRAM_PRIME_NUMBER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class RECURSIVE_PROGRAM_PRIME_NUMBER{
static boolean f_gold ( int n , int i ) {
if ( n <= 2 ) return ( n == 2 ) ? true : false ;
if ( n % i == 0 ) return false ;
if ( i * i > n ) return true ;
return f_gold ( n ... | null |
using namespace std;
bool f_gold ( int n, int i = 2 ) {
if ( n <= 2 ) return ( n == 2 ) ? true : false;
if ( n % i == 0 ) return false;
if ( i * i > n ) return true;
return f_gold ( n, i + 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(3);
param0.add(7);
param0.add(89);
param0.add(97);
param0.add(41);
param0.add(73);
param0.add(95);
param0.add(69);
param0.add(20);
param0.add(30);
List<In... | null |
int main() {
int n_success = 0;
vector<int> param0 {3,7,89,97,41,73,95,69,20,30};
vector<int> param1 {2,2,2,2,2,2,2,2,2,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;
}
}
cout ... |
COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE{
static int f_gold ( String S , String T ) {
int m = T . length ( ) ;
int n = S . length ( ) ;
if ( m > n ) return 0 ;
int mat [ ] [ ] = new int [ m + 1 ] [ n + ... | def f_gold ( S , T ) :
m = len ( T )
n = len ( S )
if m > n :
return 0
mat = [ [ 0 for _ in range ( n + 1 ) ] for __ in range ( m + 1 ) ]
for i in range ( 1 , m + 1 ) :
mat [ i ] [ 0 ] = 0
for j in range ( n + 1 ) :
mat [ 0 ] [ j ] = 1
for i in range ( 1 , m + 1 ) :
... |
using namespace std;
int f_gold ( string S, string T ) {
int m = T . length ( ), n = S . length ( );
if ( m > n ) return 0;
int mat [ m + 1 ] [ n + 1 ];
for ( int i = 1;
i <= m;
i ++ ) mat [ i ] [ 0 ] = 0;
for ( int j = 0;
j <= n;
j ++ ) mat [ 0 ] [ j ] = 1;
for ( int i = 1;
i <= m;
i ++ ) {
... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("banana");
param0.add("49597223");
param0.add("1000010000011");
param0.add("BTlzufK");
param0.add("3474007");
param0.add("0010");
param0.add("dKHhoTD");
param0.add("91... |
if __name__ == '__main__':
param = [
('banana','ban',),
('49597223','42',),
('1000010000011','010',),
('BTlzufK','EpsVuzP lf',),
('3474007','370',),
('0010','00000',),
('dKHhoTD','doT',),
('9123259723','123',),
('11001000111110','0',),
('iY WJlIZ','iI',)
]
n_succ... |
int main() {
int n_success = 0;
vector<string> param0 {"banana","49597223","1000010000011","BTlzufK","3474007","0010","dKHhoTD","9123259723","11001000111110","iY WJlIZ"};
vector<string> param1 {"ban","42","010","lf","370","00000","doT","123","0","iI"};
for(int i = 0; i < param0.size(); ++i)
{
... |
CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER{
static boolean f_gold ( char [ ] str1 , char [ ] str2 ) {
int n1 = str1 . length ;
int n2 = str2 . length ;
if ( n1 != n2 ) return false ;
Arrays . sort... | def f_gold ( str1 , str2 ) :
n1 = len ( str1 )
n2 = len ( str2 )
if n1 != n2 :
return 0
str1 = sorted ( str1 )
str2 = sorted ( str2 )
for i in range ( 0 , n1 ) :
if str1 [ i ] != str2 [ i ] :
return 0
return 1
| null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("LISTEN");
param0.add("TRIANGLE");
param0.add("test");
param0.add("night");
param0.add("Inch");
param0.add("Dusty");
param0.add("GJLMOOSTTXaabceefgllpwz");
param0.add(... |
if __name__ == '__main__':
param = [
(['LISTEN'],['SILENT'],),
(['TRIANGLE'],['INTEGRAL'],),
(['test'],['ttew'],),
(['night'],['thing'],),
(['Inch'],['Study'],),
(['Dusty'],['1'],),
(['GJLMOOSTTXaabceefgllpwz'],['EJRXYajoy'],),
(['41658699122772743330'],['9931020'],),
(['0000000... | null |
COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS{
static int f_gold ( int n , int x , int y ) {
boolean [ ] arr = new boolean [ n + 1 ] ;
if ( x <= n ) arr [ x ] = true ;
if ( y <= n ) arr [ y ] = true ;
in... | def f_gold ( n , x , y ) :
arr = [ False for i in range ( n + 2 ) ]
if ( x <= n ) :
arr [ x ] = True
if ( y <= n ) :
arr [ y ] = True
result = 0
for i in range ( min ( x , y ) , n + 1 ) :
if ( arr [ i ] ) :
if ( i + x <= n ) :
arr [ i + x ] = True
... |
using namespace std;
int f_gold ( int n, int x, int y ) {
vector < bool > arr ( n + 1, false );
if ( x <= n ) arr [ x ] = true;
if ( y <= n ) arr [ y ] = true;
int result = 0;
for ( int i = min ( x, y );
i <= n;
i ++ ) {
if ( arr [ i ] ) {
if ( i + x <= n ) arr [ i + x ] = true;
if ( i + ... |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(23);
param0.add(56);
param0.add(30);
param0.add(51);
param0.add(21);
param0.add(69);
param0.add(12);
param0.add(44);
param0.add(99);
param0.add(46);
List<... |
if __name__ == '__main__':
param = [
(23,16,16,),
(56,95,6,),
(30,63,1,),
(51,89,46,),
(21,99,38,),
(69,63,50,),
(12,69,73,),
(44,52,9,),
(99,65,10,),
(46,58,37,)
]
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,56,30,51,21,69,12,44,99,46};
vector<int> param1 {16,95,63,89,99,63,69,52,65,58};
vector<int> param2 {16,6,1,46,38,50,73,9,10,37};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i... |
SUM_PAIRWISE_PRODUCTS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class SUM_PAIRWISE_PRODUCTS{
static int f_gold ( int n ) {
int sum = 0 ;
for ( int i = 1 ;
i <= n ;
i ++ ) for ( int j = i ;
j <= n ;
j ++ ) sum = sum + i * j ;
return sum ;
}
| def f_gold ( n ) :
sm = 0
for i in range ( 1 , n + 1 ) :
for j in range ( i , n + 1 ) :
sm = sm + i * j
return sm
|
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) sum = sum + i * j;
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(21);
param0.add(32);
param0.add(16);
param0.add(38);
param0.add(9);
param0.add(3);
param0.add(5);
param0.add(46);
param0.add(45);
param0.add(87);
for(int ... |
if __name__ == '__main__':
param = [
(21,),
(32,),
(16,),
(38,),
(9,),
(3,),
(5,),
(46,),
(45,),
(87,)
]
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 {21,32,16,38,9,3,5,46,45,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();
re... |
COUNT_SET_BITS_IN_AN_INTEGER |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class COUNT_SET_BITS_IN_AN_INTEGER{
static int f_gold ( int n ) {
int count = 0 ;
while ( n > 0 ) {
count += n & 1 ;
n >>= 1 ;
}
return count ;
}
| def f_gold ( n ) :
count = 0
while ( n ) :
count += n & 1
n >>= 1
return count
|
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int count = 0;
while ( n ) {
count += n & 1;
n >>= 1;
}
return count;
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(58);
param0.add(92);
param0.add(73);
param0.add(52);
param0.add(24);
param0.add(14);
param0.add(58);
param0.add(11);
param0.add(8);
param0.add(52);
for(in... |
if __name__ == '__main__':
param = [
(58,),
(92,),
(73,),
(52,),
(24,),
(14,),
(58,),
(11,),
(8,),
(52,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
p... |
int main() {
int n_success = 0;
vector<int> param0 {58,92,73,52,24,14,58,11,8,52};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
... |
LONGEST_PALINDROME_SUBSEQUENCE_SPACE |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_PALINDROME_SUBSEQUENCE_SPACE{
static int f_gold ( String s ) {
int n = s . length ( ) ;
int a [ ] = new int [ n ] ;
for ( int i = n - 1 ;
i >= 0 ;
i -- ) {
int back_up = 0 ;
for ( int j =... | def f_gold ( s ) :
n = len ( s )
a = [ 0 ] * n
for i in range ( n - 1 , - 1 , - 1 ) :
back_up = 0
for j in range ( i , n ) :
if j == i :
a [ j ] = 1
elif s [ i ] == s [ j ] :
temp = a [ j ]
a [ j ] = back_up + 2
... |
using namespace std;
int f_gold ( string & s ) {
int n = s . length ( );
int a [ n ];
for ( int i = n - 1;
i >= 0;
i -- ) {
int back_up = 0;
for ( int j = i;
j < n;
j ++ ) {
if ( j == i ) a [ j ] = 1;
else if ( s [ i ] == s [ j ] ) {
int temp = a [ j ];
a [ j ] = b... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add(" E");
param0.add("0845591950");
param0.add("00101011");
param0.add("pLSvlwrACvFaoT");
param0.add("7246");
param0.add("1010101100000");
param0.add("obPkcLSFp");
param0... |
if __name__ == '__main__':
param = [
(' E',),
('0845591950',),
('00101011',),
('pLSvlwrACvFaoT',),
('7246',),
('1010101100000',),
('obPkcLSFp',),
('914757557818',),
('1',),
('PKvUWIQ',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_f... |
int main() {
int n_success = 0;
vector<string> param0 {" E","0845591950","00101011","pLSvlwrACvFaoT","7246","1010101100000","obPkcLSFp","914757557818","1","PKvUWIQ"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF{
static int f_gold ( String str ) {
int n = str . length ( ) ;
int maxlen = 0 ;
for ( int i = 0 ;
i < n ;
i ++ ) {
for ( int j = i + 1 ;
j < n ... | null | null |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("yQHVDWxcfsazM");
param0.add("7889372253");
param0.add("00");
param0.add("N");
param0.add("178791892313");
param0.add("110111101111");
param0.add("Ba");
param0.add("32... | null | null |
DYCK_PATH |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DYCK_PATH{
public static int f_gold ( int n ) {
int res = 1 ;
for ( int i = 0 ;
i < n ;
++ i ) {
res *= ( 2 * n - i ) ;
res /= ( i + 1 ) ;
}
return res / ( n + 1 ) ;
}
| def f_gold ( n ) :
res = 1
for i in range ( 0 , n ) :
res *= ( 2 * n - i )
res /= ( i + 1 )
return res / ( n + 1 )
|
using namespace std;
int f_gold ( unsigned int n ) {
int res = 1;
for ( int i = 0;
i < n;
++ i ) {
res *= ( 2 * n - i );
res /= ( i + 1 );
}
return res / ( n + 1 );
}
|
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(72);
param0.add(90);
param0.add(61);
param0.add(28);
param0.add(70);
param0.add(13);
param0.add(7);
param0.add(98);
param0.add(99);
param0.add(67);
for(in... |
if __name__ == '__main__':
param = [
(72,),
(90,),
(61,),
(28,),
(70,),
(13,),
(7,),
(98,),
(99,),
(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 {72,90,61,28,70,13,7,98,99,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();
... |
PRINT_A_CLOSEST_STRING_THAT_DOES_NOT_CONTAIN_ADJACENT_DUPLICATES |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class PRINT_A_CLOSEST_STRING_THAT_DOES_NOT_CONTAIN_ADJACENT_DUPLICATES{
public static String f_gold ( String s1 ) {
int n = s1 . length ( ) ;
char [ ] s = s1 . toCharArray ( ) ;
for ( int i = 1 ;
i < n ;
i ++ ... | null |
using namespace std;
string f_gold ( string s ) {
int n = s . length ( );
for ( int i = 1;
i < n;
i ++ ) {
if ( s [ i ] == s [ i - 1 ] ) {
s [ i ] = 'a';
while ( s [ i ] == s [ i - 1 ] || ( i + 1 < n && s [ i ] == s [ i + 1 ] ) ) s [ i ] ++;
i ++;
}
}
return s;
}
|
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("cHcZCdkbIMGUYe");
param0.add("2292016725711");
param0.add("10110111100010");
param0.add("wHso xGbBY");
param0.add("21884");
param0.add("0");
param0.add("I");
param0.a... | null |
int main() {
int n_success = 0;
vector<string> param0 {"cHcZCdkbIMGUYe","2292016725711","10110111100010","wHso xGbBY","21884","0","I","716213436","101","HXdDbjcyPc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
... |
OVERLAPPING_SUM_TWO_ARRAY |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class OVERLAPPING_SUM_TWO_ARRAY{
static int f_gold ( int [ ] A , int [ ] B , int n ) {
HashMap < Integer , Integer > hash = new HashMap < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( hash . containsKey ( ... | null |
using namespace std;
int f_gold ( int A [ ], int B [ ], int n ) {
unordered_map < int, int > hash;
for ( int i = 0;
i < n;
i ++ ) {
hash [ A [ i ] ] ++;
hash [ B [ i ] ] ++;
}
int sum = 0;
for ( auto x : hash ) if ( x . second == 1 ) sum += x . first;
return sum;
}
|
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{13,31,63,75,90,92,94,98});
param0.add(new int[]{-20});
param0.add(new int[]{0,0,0,1,1,1});
param0.add(new int[]{47,71,9,64,66,99,7,44,75,84,88,49,95,56,3,90,73,2});
par... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,31,63,75,90,92,94,98},{-20},{0,0,0,1,1,1},{47,71,9,64,66,99,7,44,75,84,88,49,95,56,3,90,73,2},{-76,-72,-70,-60,-44,-38,-38,-26,-16,-10,-4,-2,4,18,30,38,54,56,64,66,68,70,72,82,84},{0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,0,1,0,0,1,0,0,1,1,1},{3,4,4,6,11,1... |
MOBILE_NUMERIC_KEYPAD_PROBLEM |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class MOBILE_NUMERIC_KEYPAD_PROBLEM{
static int f_gold ( char keypad [ ] [ ] , int n ) {
if ( keypad == null || n <= 0 ) return 0 ;
if ( n == 1 ) return 10 ;
int [ ] odd = new int [ 10 ] ;
int [ ] even = new int... | def f_gold ( keypad , n ) :
if ( not keypad or n <= 0 ) :
return 0
if ( n == 1 ) :
return 10
odd = [ 0 ] * 10
even = [ 0 ] * 10
i = 0
j = 0
useOdd = 0
totalCount = 0
for i in range ( 10 ) :
odd [ i ] = 1
for j in range ( 2 , n + 1 ) :
useOdd = 1 - ... | null |
public static void main(String args[]) {
int n_success = 0;
List<char [ ] [ ]> param0 = new ArrayList<>();
param0.add(new char[][]{new char[]{' ','A','C','K','R','R','V','c','d','i','i','j','m','o','q','q','r','r','v','v','x','z'},new char[]{'B','D','I','M','N','Q','R','Z','c','f','i','j','j','l','l','n','... |
if __name__ == '__main__':
param = [
([[' ', 'A', 'C', 'K', 'R', 'R', 'V', 'c', 'd', 'i', 'i', 'j', 'm', 'o', 'q', 'q', 'r', 'r', 'v', 'v', 'x', 'z'], ['B', 'D', 'I', 'M', 'N', 'Q', 'R', 'Z', 'c', 'f', 'i', 'j', 'j', 'l', 'l', 'n', 'p', 'q', 's', 't', 't', 'w'], ['A', 'F', 'F', 'G', 'H', 'J', 'K', 'K', 'N', 'V... | null |
CHECK_VALID_SEQUENCE_DIVISIBLE_M_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class CHECK_VALID_SEQUENCE_DIVISIBLE_M_1{
static int f_gold ( int n , int index , int modulo , int M , int arr [ ] , int dp [ ] [ ] ) {
modulo = ( ( modulo % M ) + M ) % M ;
if ( index == n ) {
if ( modulo == 0 ... | def f_gold ( n , index , modulo , M , arr , dp ) :
modulo = ( ( modulo % M ) + M ) % M
if ( index == n ) :
if ( modulo == 0 ) :
return 1
return 0
if ( dp [ index ] [ modulo ] != - 1 ) :
return dp [ index ] [ modulo ]
placeAdd = f_gold ( n , index + 1 , modulo + arr [ ... | null |
public static void main(String args[]) {
int n_success = 0;
List<Integer> param0 = new ArrayList<>();
param0.add(19);
param0.add(14);
param0.add(5);
param0.add(8);
param0.add(14);
param0.add(16);
param0.add(24);
param0.add(7);
param0.add(35);
param0.add(8);
List<Inte... |
if __name__ == '__main__':
param = [
(19,29,20,19,[1, 2, 2, 3, 6, 15, 16, 17, 20, 21, 27, 28, 28, 29, 44, 47, 53, 53, 54, 59, 60, 60, 66, 68, 78, 79, 80, 84, 87, 91, 92, 97],[[4, 7, 9, 11, 16, 22, 22, 24, 31, 35, 36, 37, 44, 46, 47, 50, 52, 56, 59, 62, 62, 63, 65, 65, 67, 67, 72, 74, 74, 79, 92, 92], [6, 10, 1... | null |
DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY_1 |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY_1{
static int f_gold ( int arr [ ] , int n ) {
Map < Integer , Integer > mp = new HashMap < > ( ) ;
for ( int i = 0 ;
i < n ;
i ++ ) {
if ( ... | null |
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > hm;
for ( int i = 0;
i < n;
i ++ ) hm [ arr [ i ] ] ++;
int max_count = 0, min_count = n;
for ( auto x : hm ) {
max_count = max ( max_count, x . second );
min_count = min ( min_count, x . second );
}
return ( ma... |
public static void main(String args[]) {
int n_success = 0;
List<int [ ]> param0 = new ArrayList<>();
param0.add(new int[]{2,3,23,24,39,53,55,57,59,60,68,87});
param0.add(new int[]{-76,46,50,90,-98,98,8,-14,24,-70,-86,-44,-88,-60,76,-16,-24,24,52,-94,-44,-76,60,-12,-70,10,90,70,64,-4,-88,28,62,74,-30,6... | null |
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,23,24,39,53,55,57,59,60,68,87},{-76,46,50,90,-98,98,8,-14,24,-70,-86,-44,-88,-60,76,-16,-24,24,52,-94,-44,-76,60,-12,-70,10,90,70,64,-4,-88,28,62,74,-30,64,-78,-54,14,62,40,76,-26,26},{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},{6... |
WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS |
import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS{
static int f_gold ( String a , String b ) {
int n = a . length ( ) , m = b . length ( ) ;
if ( m == 0 ) {
return 1 ;
}
int dp [ ] [ ] = new int [ m +... | def f_gold ( a , b ) :
n = len ( a )
m = len ( b )
if m == 0 :
return 1
dp = [ [ 0 ] * ( n + 1 ) for _ in range ( m + 1 ) ]
for i in range ( m ) :
for j in range ( i , n ) :
if i == 0 :
if j == 0 :
if a [ j ] == b [ i ] :
... |
using namespace std;
int f_gold ( string a, string b ) {
int n = a . size ( ), m = b . size ( );
if ( m == 0 ) return 1;
int dp [ m + 1 ] [ n + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < m;
i ++ ) {
for ( int j = i;
j < n;
j ++ ) {
if ( i == 0 ) {
if ( j == 0 ) d... |
public static void main(String args[]) {
int n_success = 0;
List<String> param0 = new ArrayList<>();
param0.add("abcccdf");
param0.add("aabba");
param0.add("aabsdfljk");
param0.add("IONiqV");
param0.add("9667771256770");
param0.add("10001011");
param0.add("fczbDtMDT");
param0.ad... |
if __name__ == '__main__':
param = [
('abcccdf','abccdf',),
('aabba','ab',),
('aabsdfljk','aa',),
('IONiqV','XKbBiGZ',),
('9667771256770','50915176',),
('10001011','01',),
('fczbDtMDT','FbX',),
('298746088','29888',),
('01100011000','0',),
('Qk','',)
]
n_success ... |
int main() {
int n_success = 0;
vector<string> param0 {"abcccdf","aabba","aabsdfljk","IONiqV","9667771256770","10001011","fczbDtMDT","298746088","01100011000","Qk"};
vector<string> param1 {"abccdf","ab","aa","XKbBiGZ","50915176","01","FbX","29888","0",""};
for(int i = 0; i < param0.size(); ++i)
{
... |
End of preview. Expand in Data Studio
- Downloads last month
- 33