qid stringlengths 1 3 | title stringlengths 9 106 | language stringclasses 1
value | signature stringlengths 24 145 | arguments list | source_py stringlengths 54 989 | source_cpp stringlengths 59 951 | question_info dict |
|---|---|---|---|---|---|---|---|
538 | Sum Series 555555 N Terms | C++ | long long sumSeries555555NTerms(int n) { | [
"n"
] | def sum_series_555555_n_terms(n):
return int(((0.6172 * (pow(10, n) - 1)) - (0.55 * n))) | int sum_series_555555_n_terms(int n) {
return 0.6172 * ( pow ( 10, n ) - 1 ) - 0.55 * n;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
539 | Sum Squares Binomial Coefficients | C++ | long long sumSquaresBinomialCoefficients(int n) { | [
"n"
] | def sum_squares_binomial_coefficients(n):
C = [[0 for i in range((n + 1))] for j in range((n + 1))]
for i in range(0, (n + 1)):
for j in range(0, (min(i, n) + 1)):
if ((j == 0) or (j == i)):
C[i][j] = 1
else:
C[i][j] = (C[(i - 1)][(j - 1)] + C[(i -... | int sum_squares_binomial_coefficients(int n) {
int C [ n + 1 ] [ n + 1 ];
int i, j;
for ( i = 0;
i <= n;
i ++ ) {
for ( j = 0;
j <= min ( i, n );
j ++ ) {
if ( j == 0 || j == i ) C [ i ] [ j ] = 1;
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int sum = 0;... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
540 | Sum Subsets Set Formed First N Natural Numbers | C++ | double sumSubsetsSetFormedFirstNNaturalNumbers(int n) { | [
"n"
] | def sum_subsets_set_formed_first_n_natural_numbers(n):
return (((n * (n + 1)) / 2) * (1 << (n - 1))) | unsigned long long sum_subsets_set_formed_first_n_natural_numbers(int n) {
return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) );
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
541 | Sum Two Large Numbers | C++ | string sumTwoLargeNumbers(string str1, string str2) { | [
"str1",
"str2"
] | def sum_two_large_numbers(str1, str2):
if (len(str1) > len(str2)):
t = str1
str1 = str2
str2 = t
str = ''
n1 = len(str1)
n2 = len(str2)
str1 = str1[::(- 1)]
str2 = str2[::(- 1)]
carry = 0
for i in range(n1):
sum = ((ord(str1[i]) - 48) + ((ord(str2[i]) - 48... | string sum_two_large_numbers(string str1, string str2) {
if ( str1 . length ( ) > str2 . length ( ) ) swap ( str1, str2 );
string str = "";
int n1 = str1 . length ( ), n2 = str2 . length ( );
reverse ( str1 . begin ( ), str1 . end ( ) );
reverse ( str2 . begin ( ), str2 . end ( ) );
int carry = 0;
for ( i... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
542 | Swap All Odd And Even Bits | C++ | int swapAllOddAndEvenBits(int x) { | [
"x"
] | def swap_all_odd_and_even_bits(x):
even_bits = (x & 2863311530)
odd_bits = (x & 1431655765)
even_bits >>= 1
odd_bits <<= 1
return (even_bits | odd_bits) | unsigned int swap_all_odd_and_even_bits(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 );
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
543 | Swap Bits In A Given Number | C++ | int swapBitsInAGivenNumber(int x, int p1, int p2, int n) { | [
"x",
"p1",
"p2",
"n"
] | def swap_bits_in_a_given_number(x, p1, p2, n):
set1 = ((x >> p1) & ((1 << n) - 1))
set2 = ((x >> p2) & ((1 << n) - 1))
xor = (set1 ^ set2)
xor = ((xor << p1) | (xor << p2))
result = (x ^ xor)
return result | int swap_bits_in_a_given_number(unsigned int x, unsigned int p1, unsigned int p2, unsigned int n) {
unsigned int set1 = ( x >> p1 ) & ( ( 1U << n ) - 1 );
unsigned int set2 = ( x >> p2 ) & ( ( 1U << n ) - 1 );
unsigned int Xor = ( set1 ^ set2 );
Xor = ( Xor << p1 ) | ( Xor << p2 );
unsigned int result = x ^ X... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
544 | Swap Two Nibbles Byte | C++ | int swapTwoNibblesByte(int x) { | [
"x"
] | def swap_two_nibbles_byte(x):
return (((x & 15) << 4) | ((x & 240) >> 4)) | int swap_two_nibbles_byte(int x) {
return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 );
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
545 | Tail Recursion | C++ | long long tailRecursion(int n) { | [
"n"
] | def tail_recursion(n):
if (n == 0):
return 1
return (n * tail_recursion((n - 1))) | unsigned int tail_recursion(unsigned int n) {
if ( n == 0 ) return 1;
return n * tail_recursion ( n - 1 );
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
547 | Temple Offerings | C++ | int templeOfferings(int n, vector<int> templeheight) { | [
"n",
"templeheight"
] | def temple_offerings(n, templeHeight):
sum = 0
for i in range(n):
left = 0
right = 0
for j in range((i - 1), (- 1), (- 1)):
if (templeHeight[j] < templeHeight[(j + 1)]):
left += 1
else:
break
for j in range((i + 1), n):
... | int temple_offerings(int n, vector<int> templeHeight) {
int sum = 0;
for ( int i = 0;
i < n;
++ i ) {
int left = 0, right = 0;
for ( int j = i - 1;
j >= 0;
-- j ) {
if ( templeHeight [ j ] < templeHeight [ j + 1 ] ) ++ left;
else break;
}
for ( int j = i + 1;
j < n;
+... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
548 | Tiling With Dominoes | C++ | long long tilingWithDominoes(int n) { | [
"n"
] | def tiling_with_dominoes(n):
A = ([0] * (n + 1))
B = ([0] * (n + 1))
A[0] = 1
A[1] = 0
B[0] = 0
B[1] = 1
for i in range(2, (n + 1)):
A[i] = (A[(i - 2)] + (2 * B[(i - 1)]))
B[i] = (A[(i - 1)] + B[(i - 2)])
return A[n] | int tiling_with_dominoes(int n) {
int A [ n + 1 ], B [ n + 1 ];
A [ 0 ] = 1, A [ 1 ] = 0, B [ 0 ] = 0, B [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) {
A [ i ] = A [ i - 2 ] + 2 * B [ i - 1 ];
B [ i ] = A [ i - 1 ] + B [ i - 2 ];
}
return A [ n ];
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
549 | Total Number Of Non Decreasing Numbers With N Digits | C++ | long long totalNumberOfNonDecreasingNumbersWithNDigits(int n) { | [
"n"
] | def total_number_of_non_decreasing_numbers_with_n_digits(n):
dp = [[0 for i in range((n + 1))] for i in range(10)]
for i in range(10):
dp[i][1] = 1
for digit in range(10):
for len in range(2, (n + 1)):
for x in range((digit + 1)):
dp[digit][len] += dp[x][(len - 1)... | long long int total_number_of_non_decreasing_numbers_with_n_digits(int n) {
long long int dp [ 10 ] [ n + 1 ];
memset ( dp, 0, sizeof dp );
for ( int i = 0;
i < 10;
i ++ ) dp [ i ] [ 1 ] = 1;
for ( int digit = 0;
digit <= 9;
digit ++ ) {
for ( int len = 2;
len <= n;
len ++ ) {
for ( in... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
550 | Total Number Of Non Decreasing Numbers With N Digits 1 | C++ | long long totalNumberOfNonDecreasingNumbersWithNDigits1(int n) { | [
"n"
] | def total_number_of_non_decreasing_numbers_with_n_digits_1(n):
N = 10
count = 1
for i in range(1, (n + 1)):
count = int((count * ((N + i) - 1)))
count = int((count / i))
return count | long long int total_number_of_non_decreasing_numbers_with_n_digits_1(int n) {
int N = 10;
long long count = 1;
for ( int i = 1;
i <= n;
i ++ ) {
count *= ( N + i - 1 );
count /= i;
}
return count;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
551 | Triangular Matchstick Number | C++ | float triangularMatchstickNumber(int x) { | [
"x"
] | def triangular_matchstick_number(x):
return (((3 * x) * (x + 1)) / 2) | int triangular_matchstick_number(int x) {
return ( 3 * x * ( x + 1 ) ) / 2;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
552 | Triangular Numbers | C++ | bool triangularNumbers(int num) { | [
"num"
] | def triangular_numbers(num):
if (num < 0):
return False
(sum, n) = (0, 1)
while (sum <= num):
sum = (sum + n)
if (sum == num):
return True
n += 1
return False | bool triangular_numbers(int num) {
if ( num < 0 ) return false;
int sum = 0;
for ( int n = 1;
sum <= num;
n ++ ) {
sum = sum + n;
if ( sum == num ) return true;
}
return false;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
553 | Triangular Numbers 1 | C++ | bool triangularNumbers1(int num) { | [
"num"
] | def triangular_numbers_1(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.floor(root1) ... | bool triangular_numbers_1(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 ( root1 ) == ro... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
554 | Turn Off The Rightmost Set Bit | C++ | int turnOffTheRightmostSetBit(int n) { | [
"n"
] | def turn_off_the_rightmost_set_bit(n):
return (n & (n - 1)) | int turn_off_the_rightmost_set_bit(unsigned int n) {
return n & ( n - 1 );
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
555 | Ugly Numbers | C++ | int uglyNumbers(int n) { | [
"n"
] | def ugly_numbers(n):
ugly = ([0] * n)
ugly[0] = 1
i2 = i3 = i5 = 0
next_multiple_of_2 = 2
next_multiple_of_3 = 3
next_multiple_of_5 = 5
for l in range(1, n):
ugly[l] = min(next_multiple_of_2, next_multiple_of_3, next_multiple_of_5)
if (ugly[l] == next_multiple_of_2):
... | unsigned ugly_numbers(unsigned n) {
unsigned ugly [ n ];
unsigned i2 = 0, i3 = 0, i5 = 0;
unsigned next_multiple_of_2 = 2;
unsigned next_multiple_of_3 = 3;
unsigned next_multiple_of_5 = 5;
unsigned next_ugly_no = 1;
ugly [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
next_ugly_no = min ( next_multi... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
556 | Ways Remove One Element Binary String Xor Becomes Zero | C++ | int waysRemoveOneElementBinaryStringXorBecomesZero(string str) { | [
"str"
] | def ways_remove_one_element_binary_string_xor_becomes_zero(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_cou... | int ways_remove_one_element_binary_string_xor_becomes_zero(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;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
557 | Ways Transforming One String Removing 0 Characters | C++ | int waysTransformingOneStringRemoving0Characters(string a, string b) { | [
"a",
"b"
] | def ways_transforming_one_string_removing_0_characters(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]... | int ways_transforming_one_string_removing_0_characters(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 ) {
... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
558 | Write An Efficient Method To Check If A Number Is Multiple Of 3 | C++ | int writeAnEfficientMethodToCheckIfANumberIsMultipleOf3(int n) { | [
"n"
] | def write_an_efficient_method_to_check_if_a_number_is_multiple_of_3(n):
odd_count = 0
even_count = 0
if (n < 0):
n = (- n)
if (n == 0):
return 1
if (n == 1):
return 0
while n:
if (n & 1):
odd_count += 1
if (n & 2):
even_count += 1
... | int write_an_efficient_method_to_check_if_a_number_is_multiple_of_3(int n) {
int odd_count = 0;
int even_count = 0;
if ( n < 0 ) n = - n;
if ( n == 0 ) return 1;
if ( n == 1 ) return 0;
while ( n ) {
if ( n & 1 ) odd_count ++;
if ( n & 2 ) even_count ++;
n = n >> 2;
}
return write_an_efficie... | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
559 | Write A C Program To Find The Parity Of An Unsigned Integer | C++ | int writeACProgramToFindTheParityOfAnUnsignedInteger(int n) { | [
"n"
] | def write_a_c_program_to_find_the_parity_of_an_unsigned_integer(n):
parity = 0
while n:
parity = (~ parity)
n = (n & (n - 1))
return parity | bool write_a_c_program_to_find_the_parity_of_an_unsigned_integer(unsigned int n) {
bool parity = 0;
while ( n ) {
parity = ! parity;
n = n & ( n - 1 );
}
return parity;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
560 | Write One Line C Function To Find Whether A No Is Power Of Two | C++ | bool writeOneLineCFunctionToFindWhetherANoIsPowerOfTwo(int n) { | [
"n"
] | def write_one_line_c_function_to_find_whether_a_no_is_power_of_two(n):
if (n == 0):
return False
while (n != 1):
if ((n % 2) != 0):
return False
n = (n // 2)
return True | bool write_one_line_c_function_to_find_whether_a_no_is_power_of_two(int n) {
if ( n == 0 ) return 0;
while ( n != 1 ) {
if ( n % 2 != 0 ) return 0;
n = n / 2;
}
return 1;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
561 | Write You Own Power Without Using Multiplication And Division | C++ | int writeYouOwnPowerWithoutUsingMultiplicationAndDivision(int a, int b) { | [
"a",
"b"
] | def write_you_own_power_without_using_multiplication_and_division(a, b):
if (b == 0):
return 1
answer = a
increment = a
for i in range(1, b):
for j in range(1, a):
answer += increment
increment = answer
return answer | int write_you_own_power_without_using_multiplication_and_division(int a, int b) {
if ( b == 0 ) return 1;
int answer = a;
int increment = a;
int i, j;
for ( i = 1;
i < b;
i ++ ) {
for ( j = 1;
j < a;
j ++ ) {
answer += increment;
}
increment = answer;
}
return answer;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
562 | Zeckendorfs Theorem Non Neighbouring Fibonacci Representation | C++ | int zeckendorfsTheoremNonNeighbouringFibonacciRepresentation(int n) { | [
"n"
] | def zeckendorfs_theorem_non_neighbouring_fibonacci_representation(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 | int zeckendorfs_theorem_non_neighbouring_fibonacci_representation(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;
} | {
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.