id
stringlengths 25
27
| content
stringlengths 66
1.28k
|
|---|---|
g-transeval-python_data_201
|
def int_to_mini_roman ( number ) : NEW_LINE INDENT num = [ 1000 , 900 , 500 , 400 , 100 , 90 , 50 , 40 , 10 , 9 , 5 , 4 , 1 ] NEW_LINE sym = [ "m" , "cm" , "d" , "cd" , "c" , "xc" , "l" , "xl" , "x" , "ix" , "v" , "iv" , "i" ] NEW_LINE pos = 0 NEW_LINE res = [ ] NEW_LINE while number > 0 : NEW_LINE INDENT while number >= num [ pos ] : NEW_LINE INDENT res . append ( sym [ pos ] ) NEW_LINE number -= num [ pos ] NEW_LINE DEDENT if number > 0 : NEW_LINE INDENT pos += 1 NEW_LINE DEDENT DEDENT return "" . join ( res ) NEW_LINE DEDENT
|
g-transeval-python_data_202
|
def eat ( number , need , remaining ) : NEW_LINE INDENT return [ number + remaining , 0 ] if need > remaining else [ number + need , remaining - need ] NEW_LINE DEDENT
|
g-transeval-python_data_203
|
def do_algebra ( ops , operands ) : NEW_LINE INDENT nums = list ( operands ) NEW_LINE current_ops = list ( ops ) NEW_LINE i = len ( current_ops ) - 1 NEW_LINE while i >= 0 : NEW_LINE INDENT if current_ops [ i ] == "**" : NEW_LINE INDENT nums [ i ] = pow ( nums [ i ] , nums [ i + 1 ] ) NEW_LINE nums . pop ( i + 1 ) NEW_LINE current_ops . pop ( i ) NEW_LINE DEDENT i -= 1 NEW_LINE DEDENT i = 0 NEW_LINE while i < len ( current_ops ) : NEW_LINE INDENT if current_ops [ i ] == "*" : NEW_LINE INDENT nums [ i ] *= nums [ i + 1 ] NEW_LINE nums . pop ( i + 1 ) NEW_LINE current_ops . pop ( i ) NEW_LINE DEDENT elif current_ops [ i ] == "//" : NEW_LINE INDENT nums [ i ] //= nums [ i + 1 ] NEW_LINE nums . pop ( i + 1 ) NEW_LINE current_ops . pop ( i ) NEW_LINE DEDENT else : NEW_LINE INDENT i += 1 NEW_LINE DEDENT DEDENT i = 0 NEW_LINE while i < len ( current_ops ) : NEW_LINE INDENT if current_ops [ i ] == "+" : NEW_LINE INDENT nums [ i ] += nums [ i + 1 ] NEW_LINE nums . pop ( i + 1 ) NEW_LINE current_ops . pop ( i ) NEW_LINE DEDENT elif current_ops [ i ] == "-" : NEW_LINE INDENT nums [ i ] -= nums [ i + 1 ] NEW_LINE nums . pop ( i + 1 ) NEW_LINE current_ops . pop ( i ) NEW_LINE DEDENT else : NEW_LINE INDENT i += 1 NEW_LINE DEDENT DEDENT return nums [ 0 ] NEW_LINE DEDENT
|
g-transeval-python_data_204
|
def generate_integers ( a , b ) : NEW_LINE INDENT lower = max ( 2 , min ( a , b ) ) NEW_LINE upper = min ( 8 , max ( a , b ) ) NEW_LINE result = [ ] NEW_LINE for i in range ( lower , upper + 1 , 2 ) : NEW_LINE INDENT result . append ( i ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_205
|
def isStepNum ( n ) : NEW_LINE INDENT prev_digit = - 1 NEW_LINE while n > 0 : NEW_LINE INDENT cur_digit = n % 10 NEW_LINE if prev_digit == - 1 : NEW_LINE INDENT prev_digit = cur_digit NEW_LINE DEDENT else : NEW_LINE INDENT if abs ( prev_digit - cur_digit ) != 1 : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT prev_digit = cur_digit NEW_LINE n //= 10 NEW_LINE DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_206
|
def num_of_ways ( n , k ) : NEW_LINE INDENT p = 1 NEW_LINE if k % 2 : NEW_LINE INDENT p = - 1 NEW_LINE DEDENT return ( ( n - 1 ) ** k + p * ( n - 1 ) ) // n NEW_LINE DEDENT
|
g-transeval-python_data_207
|
def find_divisors ( n ) : NEW_LINE INDENT v = [ ] NEW_LINE for i in range ( 1 , int ( math . sqrt ( n ) ) + 1 ) : NEW_LINE INDENT if n % i == 0 : NEW_LINE INDENT if n / i == i : NEW_LINE INDENT v . append ( i ) NEW_LINE DEDENT else : NEW_LINE INDENT v . append ( i ) NEW_LINE v . append ( n // i ) NEW_LINE DEDENT DEDENT DEDENT return v NEW_LINE DEDENT
|
g-transeval-python_data_208
|
def egg_drop ( n , k ) : NEW_LINE INDENT if k == 1 or k == 0 : NEW_LINE INDENT return k NEW_LINE DEDENT if n == 1 : NEW_LINE INDENT return k NEW_LINE DEDENT min = sys . maxsize NEW_LINE for x in range ( 1 , k + 1 ) : NEW_LINE INDENT res = max ( egg_drop ( n - 1 , x - 1 ) , egg_drop ( n , k - x ) ) NEW_LINE if res < min : NEW_LINE INDENT min = res NEW_LINE DEDENT DEDENT return min + 1 NEW_LINE DEDENT
|
g-transeval-python_data_209
|
def is_power_of_two ( n ) : NEW_LINE INDENT return math . ceil ( math . log2 ( n ) ) == math . floor ( math . log2 ( n ) ) NEW_LINE DEDENT
|
g-transeval-python_data_210
|
def shortest_palindrome ( s ) : NEW_LINE INDENT n = len ( s ) NEW_LINE v = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT l = i NEW_LINE r = i NEW_LINE ans1 = "" NEW_LINE ans2 = "" NEW_LINE while l >= 0 and r < n and s [ l ] == s [ r ] : NEW_LINE INDENT ans1 += s [ l ] NEW_LINE l -= 1 NEW_LINE r += 1 NEW_LINE DEDENT l = i - 1 NEW_LINE r = i NEW_LINE while l >= 0 and r < n and s [ l ] == s [ r ] : NEW_LINE INDENT ans2 += s [ l ] NEW_LINE l -= 1 NEW_LINE r += 1 NEW_LINE DEDENT v . append ( ans1 ) NEW_LINE v . append ( ans2 ) NEW_LINE DEDENT ans = v [ 0 ] NEW_LINE for i in range ( len ( v ) ) : NEW_LINE INDENT if v [ i ] != "" : NEW_LINE INDENT ans = min ( ans , v [ i ] ) NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_211
|
def minimum_adjacent_difference ( a , n , k ) : NEW_LINE INDENT min_diff = sys . maxsize NEW_LINE for i in range ( k + 1 ) : NEW_LINE INDENT max_diff = - sys . maxsize NEW_LINE for j in range ( n - k - 1 ) : NEW_LINE INDENT for p in range ( i , i + j + 1 ) : NEW_LINE INDENT max_diff = max ( max_diff , a [ p + 1 ] - a [ p ] ) NEW_LINE DEDENT DEDENT min_diff = min ( min_diff , max_diff ) NEW_LINE DEDENT return min_diff NEW_LINE DEDENT
|
g-transeval-python_data_212
|
def cal ( a , mid ) : NEW_LINE INDENT chocolate = 0 NEW_LINE for i in a : NEW_LINE INDENT if i >= mid : NEW_LINE INDENT chocolate += i - mid NEW_LINE DEDENT DEDENT return chocolate NEW_LINE DEDENT
|
g-transeval-python_data_213
|
def check ( v , a , m ) : NEW_LINE INDENT tec = 0 NEW_LINE ans = 0 NEW_LINE b = [ 0 ] * ( len ( a ) + 3 ) NEW_LINE for i in range ( len ( a ) ) : NEW_LINE INDENT tec -= b [ i ] NEW_LINE if a [ i ] + tec < v : NEW_LINE INDENT mov = v - a [ i ] - tec NEW_LINE ans = ans + mov NEW_LINE tec += mov NEW_LINE b [ i + 2 ] = mov NEW_LINE DEDENT DEDENT return ans <= m NEW_LINE DEDENT
|
g-transeval-python_data_214
|
def largest_num ( arr ) : NEW_LINE INDENT res = 0 NEW_LINE arr . sort ( ) NEW_LINE l , r = 0 , len ( arr ) - 1 NEW_LINE while l < r : NEW_LINE INDENT sum = arr [ l ] + arr [ r ] NEW_LINE if sum == 0 : NEW_LINE INDENT res = max ( res , max ( arr [ l ] , arr [ r ] ) ) NEW_LINE return res NEW_LINE DEDENT elif sum < 0 : NEW_LINE INDENT l += 1 NEW_LINE DEDENT else : NEW_LINE INDENT r -= 1 NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_215
|
def binary_search ( p , n ) : NEW_LINE INDENT i = 0 NEW_LINE j = len ( p ) - 1 NEW_LINE index = - 1 NEW_LINE while i <= j : NEW_LINE INDENT mid = i + ( j - i ) // 2 NEW_LINE if p [ mid ] >= n : NEW_LINE INDENT index = mid NEW_LINE j = mid - 1 NEW_LINE DEDENT else : NEW_LINE INDENT i = mid + 1 NEW_LINE DEDENT DEDENT return index NEW_LINE DEDENT
|
g-transeval-python_data_216
|
def find_min_length ( arr ) : NEW_LINE INDENT index = len ( arr ) - 1 NEW_LINE while index > 0 and arr [ index ] >= arr [ index - 1 ] : NEW_LINE INDENT index -= 1 NEW_LINE DEDENT return index NEW_LINE DEDENT
|
g-transeval-python_data_217
|
def min_digits ( n , k ) : NEW_LINE INDENT digits_num = math . floor ( math . log10 ( n ) + 1 ) NEW_LINE temp_sum = 0 NEW_LINE temp = digits_num NEW_LINE result = 0 NEW_LINE x , v = 0 , 0 NEW_LINE sum = 0 NEW_LINE num2 = n NEW_LINE while num2 != 0 : NEW_LINE INDENT sum += num2 % 10 NEW_LINE num2 //= 10 NEW_LINE DEDENT if sum <= k : NEW_LINE INDENT x = 0 NEW_LINE DEDENT else : NEW_LINE INDENT while temp > 0 : NEW_LINE INDENT v = n // ( 10 ** ( temp - 1 ) ) NEW_LINE temp_sum += v % 10 NEW_LINE if temp_sum >= k : NEW_LINE INDENT v //= 10 NEW_LINE v += 1 NEW_LINE result = v * ( 10 ** temp ) NEW_LINE break NEW_LINE DEDENT temp -= 1 NEW_LINE DEDENT x = result - n NEW_LINE return x NEW_LINE DEDENT return - 1 NEW_LINE DEDENT
|
g-transeval-python_data_218
|
def check_for_perfect_square ( arr , i , j ) : NEW_LINE INDENT mid , sum = 0 , 0 NEW_LINE for m in range ( i , j + 1 ) : NEW_LINE INDENT sum += arr [ m ] NEW_LINE DEDENT low , high = 0 , sum // 2 NEW_LINE while low <= high : NEW_LINE INDENT mid = low + ( high - low ) // 2 NEW_LINE if mid * mid == sum : NEW_LINE INDENT return mid NEW_LINE DEDENT elif mid * mid > sum : NEW_LINE INDENT high = mid - 1 NEW_LINE DEDENT else : NEW_LINE INDENT low = mid + 1 NEW_LINE DEDENT DEDENT return - 1 NEW_LINE DEDENT
|
g-transeval-python_data_219
|
def min_flips ( mat , s ) : NEW_LINE INDENT n = len ( mat ) NEW_LINE m = len ( mat [ 0 ] ) NEW_LINE count = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT for j in range ( m ) : NEW_LINE INDENT if mat [ i ] [ j ] != ord ( s [ i + j ] ) - ord ( '0' ) : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_220
|
def construct_tree ( n , edges ) : NEW_LINE INDENT adjl = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT adjl . append ( [ ] ) NEW_LINE DEDENT for e in edges : NEW_LINE INDENT u = e [ 0 ] NEW_LINE v = e [ 1 ] NEW_LINE adjl [ u ] . append ( v ) NEW_LINE adjl [ v ] . append ( u ) NEW_LINE DEDENT return adjl NEW_LINE DEDENT
|
g-transeval-python_data_221
|
def find_sum_of_values ( v , parent , values_children ) : NEW_LINE INDENT cur_node = v NEW_LINE Sum = 0 NEW_LINE while cur_node != - 1 : NEW_LINE INDENT Sum += values_children [ cur_node ] NEW_LINE cur_node = parent [ cur_node ] NEW_LINE DEDENT return Sum NEW_LINE DEDENT
|
g-transeval-python_data_222
|
def get_distinct ( d , count ) : NEW_LINE INDENT num = 0 NEW_LINE count = 10 ** ( count - 1 ) NEW_LINE while count > 0 : NEW_LINE INDENT num += count * d NEW_LINE count //= 10 NEW_LINE DEDENT return num NEW_LINE DEDENT
|
g-transeval-python_data_223
|
def is_increasing ( arr ) : NEW_LINE INDENT for i in range ( len ( arr ) - 1 ) : NEW_LINE INDENT if arr [ i ] > arr [ i + 1 ] : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_224
|
def min_adj_swaps ( mat ) : NEW_LINE INDENT n = len ( mat ) NEW_LINE cnt_zero = [ 0 ] * n NEW_LINE for i in range ( n ) : NEW_LINE INDENT for j in range ( n - 1 , - 1 , - 1 ) : NEW_LINE INDENT if mat [ i ] [ j ] != 0 : NEW_LINE INDENT break NEW_LINE DEDENT cnt_zero [ i ] += 1 NEW_LINE DEDENT DEDENT cnt_swaps = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT if cnt_zero [ i ] < ( n - i - 1 ) : NEW_LINE INDENT first = i NEW_LINE while first < n and cnt_zero [ first ] < ( n - i - 1 ) : NEW_LINE INDENT first += 1 NEW_LINE DEDENT if first == n : NEW_LINE INDENT return - 1 NEW_LINE DEDENT while first > i : NEW_LINE INDENT cnt_zero [ first ] , cnt_zero [ first - 1 ] = cnt_zero [ first - 1 ] , cnt_zero [ first ] NEW_LINE first -= 1 NEW_LINE cnt_swaps += 1 NEW_LINE DEDENT DEDENT DEDENT return cnt_swaps NEW_LINE DEDENT
|
g-transeval-python_data_225
|
def solve ( values , salary , mod ) : NEW_LINE INDENT ret = 1 NEW_LINE amt = 0 NEW_LINE values . sort ( ) NEW_LINE salary . sort ( ) NEW_LINE while len ( salary ) > 0 : NEW_LINE INDENT while len ( values ) and values [ - 1 ] >= salary [ - 1 ] : NEW_LINE INDENT amt += 1 NEW_LINE values . pop ( ) NEW_LINE DEDENT if amt == 0 : NEW_LINE INDENT return 0 NEW_LINE DEDENT ret *= amt NEW_LINE amt -= 1 NEW_LINE ret %= mod NEW_LINE salary . pop ( ) NEW_LINE DEDENT return ret NEW_LINE DEDENT
|
g-transeval-python_data_226
|
def organize_in_order ( vec , op , n ) : NEW_LINE INDENT result = [ 0 ] * n NEW_LINE vec . sort ( ) NEW_LINE i , j , k = 0 , n - 1 , 0 NEW_LINE while i <= j and k <= n - 2 : NEW_LINE INDENT if op [ k ] == '<' : NEW_LINE INDENT result [ k ] = vec [ i ] NEW_LINE i += 1 NEW_LINE DEDENT else : NEW_LINE INDENT result [ k ] = vec [ j ] NEW_LINE j -= 1 NEW_LINE DEDENT k += 1 NEW_LINE DEDENT result [ n - 1 ] = vec [ i ] NEW_LINE return result NEW_LINE DEDENT
|
g-transeval-python_data_227
|
def count_points ( n , m , a , b , x , y ) : NEW_LINE INDENT a . sort ( ) NEW_LINE b . sort ( ) NEW_LINE j = 0 NEW_LINE count = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT while j < m : NEW_LINE INDENT if a [ i ] + y < b [ j ] : NEW_LINE INDENT break NEW_LINE DEDENT if b [ j ] >= a [ i ] - x and b [ j ] <= a [ i ] + y : NEW_LINE INDENT count += 1 NEW_LINE j += 1 NEW_LINE break NEW_LINE DEDENT else : NEW_LINE INDENT j += 1 NEW_LINE DEDENT DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_228
|
def are_same ( a , b ) : NEW_LINE INDENT a . sort ( ) NEW_LINE b . sort ( ) NEW_LINE return a == b NEW_LINE DEDENT
|
g-transeval-python_data_229
|
def count_number_of_strings ( s ) : NEW_LINE INDENT n = len ( s ) - 1 NEW_LINE count = 2 ** n NEW_LINE return count NEW_LINE DEDENT
|
g-transeval-python_data_230
|
def prime_power ( x ) : NEW_LINE INDENT prime_pow = [ ] NEW_LINE for i in range ( 2 , x + 1 ) : NEW_LINE INDENT if i * i > x + 1 : NEW_LINE INDENT break NEW_LINE DEDENT if x % i == 0 : NEW_LINE INDENT p = 1 NEW_LINE while x % i == 0 : NEW_LINE INDENT x //= i NEW_LINE p *= i NEW_LINE DEDENT prime_pow . append ( p ) NEW_LINE DEDENT DEDENT if x > 1 : NEW_LINE INDENT prime_pow . append ( x ) NEW_LINE DEDENT return prime_pow NEW_LINE DEDENT
|
g-transeval-python_data_231
|
def is_perfect ( n0 ) : NEW_LINE INDENT n = math . sqrt ( n0 ) NEW_LINE if math . floor ( n ) != math . ceil ( n ) : NEW_LINE INDENT return 0 NEW_LINE DEDENT return 1 NEW_LINE DEDENT
|
g-transeval-python_data_232
|
def find_sum ( l , r ) : NEW_LINE INDENT arr = [ ] NEW_LINE i = 0 NEW_LINE x = 2 NEW_LINE while i <= r : NEW_LINE INDENT arr . append ( i + x ) NEW_LINE if i + 1 <= r : NEW_LINE INDENT arr . append ( i + 1 + x ) NEW_LINE DEDENT x *= - 1 NEW_LINE i += 2 NEW_LINE DEDENT sum = 0 NEW_LINE for i in range ( l , r + 1 ) : NEW_LINE INDENT sum += arr [ i ] NEW_LINE DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_233
|
def results ( n , k ) : NEW_LINE INDENT return round ( n ** ( 1.0 / 2 ** k ) ) NEW_LINE DEDENT
|
g-transeval-python_data_234
|
def factors ( n ) : NEW_LINE INDENT v = [ ] NEW_LINE v . append ( 1 ) NEW_LINE for i in range ( 2 , int ( math . sqrt ( n ) ) + 1 , 1 ) : NEW_LINE INDENT if n % i == 0 : NEW_LINE INDENT v . append ( i ) NEW_LINE if n // i != i : NEW_LINE INDENT v . append ( n // i ) NEW_LINE DEDENT DEDENT DEDENT return v NEW_LINE DEDENT
|
g-transeval-python_data_235
|
def smallest_num ( n ) : NEW_LINE INDENT x = 10.0 ** ( ( n - 1 ) / 2.0 ) NEW_LINE return math . ceil ( x ) NEW_LINE DEDENT
|
g-transeval-python_data_236
|
def smallest ( s ) : NEW_LINE INDENT a = [ 0 ] * len ( s ) NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT a [ i ] = ord ( s [ i ] ) - ord ( '0' ) NEW_LINE DEDENT b = [ ] NEW_LINE for i in range ( len ( a ) ) : NEW_LINE INDENT if a [ i ] % 2 != 0 : NEW_LINE INDENT b . append ( a [ i ] ) NEW_LINE DEDENT DEDENT b . sort ( ) NEW_LINE if len ( b ) > 1 : NEW_LINE INDENT return b [ 0 ] * 10 + b [ 1 ] NEW_LINE DEDENT return - 1 NEW_LINE DEDENT
|
g-transeval-python_data_237
|
def diagonals ( a , b , c , d ) : NEW_LINE INDENT ans = [ ] NEW_LINE ans . append ( math . sqrt ( ( a * c + b * d ) * ( a * d + b * c ) / ( a * b + c * d ) ) ) NEW_LINE ans . append ( math . sqrt ( ( a * c + b * d ) * ( a * b + c * d ) / ( a * d + b * c ) ) ) NEW_LINE return ans NEW_LINE DEDENT
|
g-transeval-python_data_238
|
def find_number_of_digits ( n , base ) : NEW_LINE INDENT dig = math . floor ( math . log ( n ) / math . log ( base ) ) + 1 NEW_LINE return dig NEW_LINE DEDENT
|
g-transeval-python_data_239
|
def n_gon ( n ) : NEW_LINE INDENT pro_angle_var = 0 NEW_LINE if n % 4 == 0 : NEW_LINE INDENT pro_angle_var = math . pi * ( 180.0 / n ) / 180 NEW_LINE DEDENT else : NEW_LINE INDENT pro_angle_var = math . pi * ( 180.0 / ( 2 * n ) ) / 180 NEW_LINE DEDENT neg_x = 1.0e+99 NEW_LINE pos_x = - 1.0e+99 NEW_LINE neg_y = 1.0e+99 NEW_LINE pos_y = - 1.0e+99 NEW_LINE for j in range ( n ) : NEW_LINE INDENT px = math . cos ( 2 * math . pi * j / n + pro_angle_var ) NEW_LINE py = math . sin ( 2 * math . pi * j / n + pro_angle_var ) NEW_LINE neg_x = min ( neg_x , px ) NEW_LINE pos_x = max ( pos_x , px ) NEW_LINE neg_y = min ( neg_y , py ) NEW_LINE pos_y = max ( pos_y , py ) NEW_LINE DEDENT opt2 = max ( pos_x - neg_x , pos_y - neg_y ) NEW_LINE return opt2 / math . sin ( math . pi / n ) / 2 NEW_LINE DEDENT
|
g-transeval-python_data_240
|
def find_max_k ( n ) : NEW_LINE INDENT p = int ( math . log2 ( n ) ) NEW_LINE return 2 ** p NEW_LINE DEDENT
|
g-transeval-python_data_241
|
def nth_fibo ( n ) : NEW_LINE INDENT a = ( 5 ** 0.5 + 1 ) / 2 NEW_LINE b = ( - 5 ** 0.5 + 1 ) / 2 NEW_LINE r = 5 ** 0.5 NEW_LINE ans = ( a ** n - b ** n ) / r NEW_LINE return int ( ans ) NEW_LINE DEDENT
|
g-transeval-python_data_242
|
def find_prob ( l , r ) : NEW_LINE INDENT count_of_ps = math . floor ( math . sqrt ( r ) ) - math . ceil ( math . sqrt ( l ) ) + 1 NEW_LINE total = r - l + 1 NEW_LINE prob = count_of_ps / total NEW_LINE return prob NEW_LINE DEDENT
|
g-transeval-python_data_243
|
def previous_fibonacci ( n ) : NEW_LINE INDENT a = n / ( ( 1 + math . sqrt ( 5 ) ) / 2.0 ) NEW_LINE return round ( a ) NEW_LINE DEDENT
|
g-transeval-python_data_244
|
def dist_prime ( arr , all_primes ) : NEW_LINE INDENT list1 = [ ] NEW_LINE for i in all_primes : NEW_LINE INDENT for j in arr : NEW_LINE INDENT if j % i == 0 : NEW_LINE INDENT list1 . append ( i ) NEW_LINE break NEW_LINE DEDENT DEDENT DEDENT return list1 NEW_LINE DEDENT
|
g-transeval-python_data_245
|
def get_array ( n ) : NEW_LINE INDENT ans = [ ] NEW_LINE p2 = 1 NEW_LINE while n > 0 : NEW_LINE INDENT if n % 2 == 1 : NEW_LINE INDENT ans . append ( p2 ) NEW_LINE DEDENT n >>= 1 NEW_LINE p2 *= 2 NEW_LINE DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_246
|
def maximum_length ( a ) : NEW_LINE INDENT counts = [ 0 ] * 11 NEW_LINE ans = 0 NEW_LINE for index in range ( len ( a ) ) : NEW_LINE INDENT counts [ a [ index ] ] += 1 NEW_LINE k = [ ] NEW_LINE for i in counts : NEW_LINE INDENT if i != 0 : NEW_LINE INDENT k . append ( i ) NEW_LINE DEDENT DEDENT k . sort ( ) NEW_LINE if len ( k ) == 1 or ( k [ 0 ] == k [ - 2 ] and k [ - 1 ] - k [ - 2 ] == 1 ) or ( k [ 0 ] == 1 and k [ 1 ] == k [ - 1 ] ) : NEW_LINE INDENT ans = index NEW_LINE DEDENT DEDENT return ans + 1 NEW_LINE DEDENT
|
g-transeval-python_data_247
|
def max_edges ( n ) : NEW_LINE INDENT edges = math . floor ( n * n // 4 ) NEW_LINE return edges NEW_LINE DEDENT
|
g-transeval-python_data_248
|
def find_k ( n , k ) : NEW_LINE INDENT a = [ ] NEW_LINE for i in range ( 1 , n ) : NEW_LINE INDENT if i % 2 == 1 : NEW_LINE INDENT a . append ( i ) NEW_LINE DEDENT DEDENT for i in range ( 1 , n ) : NEW_LINE INDENT if i % 2 == 0 : NEW_LINE INDENT a . append ( i ) NEW_LINE DEDENT DEDENT return a [ k - 1 ] NEW_LINE DEDENT
|
g-transeval-python_data_249
|
def is_keith ( x , temp ) : NEW_LINE INDENT terms = [ ] NEW_LINE n = 0 NEW_LINE while temp > 0 : NEW_LINE INDENT terms . append ( temp % 10 ) NEW_LINE temp = temp // 10 NEW_LINE n += 1 NEW_LINE DEDENT terms . reverse ( ) NEW_LINE next_term , i = 0 , n NEW_LINE while next_term < x : NEW_LINE INDENT next_term = 0 NEW_LINE for j in range ( 1 , n + 1 ) : NEW_LINE INDENT next_term += terms [ i - j ] NEW_LINE DEDENT terms . append ( next_term ) NEW_LINE i += 1 NEW_LINE DEDENT return next_term == x NEW_LINE DEDENT
|
g-transeval-python_data_250
|
def factors ( n , k ) : NEW_LINE INDENT v = [ ] NEW_LINE while n % 2 == 0 : NEW_LINE INDENT v . append ( 2 ) NEW_LINE n //= 2 NEW_LINE DEDENT if len ( v ) >= k : NEW_LINE INDENT return True NEW_LINE DEDENT for i in range ( 3 , n + 1 , 2 ) : NEW_LINE INDENT if i * i > n : NEW_LINE INDENT break NEW_LINE DEDENT while n % i == 0 : NEW_LINE INDENT n = n // i NEW_LINE v . append ( i ) NEW_LINE DEDENT if len ( v ) >= k : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT if n > 2 : NEW_LINE INDENT v . append ( n ) NEW_LINE DEDENT if len ( v ) >= k : NEW_LINE INDENT return True NEW_LINE DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_251
|
def separate_paren_groups ( paren_string ) : NEW_LINE INDENT all_parens = [ ] NEW_LINE current_paren = [ ] NEW_LINE current_depth = 0 NEW_LINE for c in paren_string : NEW_LINE INDENT if c == "(" : NEW_LINE INDENT current_depth += 1 NEW_LINE current_paren . append ( c ) NEW_LINE DEDENT elif c == ")" : NEW_LINE INDENT current_depth -= 1 NEW_LINE current_paren . append ( c ) NEW_LINE if current_depth == 0 : NEW_LINE INDENT all_parens . append ( "" . join ( current_paren ) ) NEW_LINE current_paren . clear ( ) NEW_LINE DEDENT DEDENT DEDENT return all_parens NEW_LINE DEDENT
|
g-transeval-python_data_252
|
def parse_nested_parens ( paren_string ) : NEW_LINE INDENT all_levels = [ ] NEW_LINE level = 0 NEW_LINE max_level = 0 NEW_LINE for i in range ( len ( paren_string ) ) : NEW_LINE INDENT chr = paren_string [ i ] NEW_LINE if chr == "(" : NEW_LINE INDENT level += 1 NEW_LINE if level > max_level : NEW_LINE INDENT max_level = level NEW_LINE DEDENT DEDENT if chr == ")" : NEW_LINE INDENT level -= 1 NEW_LINE if level == 0 : NEW_LINE INDENT all_levels . append ( max_level ) NEW_LINE max_level = 0 NEW_LINE DEDENT DEDENT DEDENT return all_levels NEW_LINE DEDENT
|
g-transeval-python_data_253
|
def filter_by_substring ( strings , substring ) : NEW_LINE INDENT result = [ ] NEW_LINE for s in strings : NEW_LINE INDENT if substring in s : NEW_LINE INDENT result . append ( s ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_254
|
def rolling_max ( numbers ) : NEW_LINE INDENT running_max = 0 NEW_LINE result = [ ] NEW_LINE for n in numbers : NEW_LINE INDENT if n > running_max : NEW_LINE INDENT running_max = n NEW_LINE DEDENT result . append ( running_max ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_255
|
def make_palindrome ( s ) : NEW_LINE INDENT if not s : NEW_LINE INDENT return "" NEW_LINE DEDENT for i in range ( len ( s ) ) : NEW_LINE INDENT r_str = s [ i : ] NEW_LINE if r_str == r_str [ : : - 1 ] : NEW_LINE INDENT n_str = s [ 0 : i ] NEW_LINE n2_str = n_str [ : : - 1 ] NEW_LINE return s + n2_str NEW_LINE DEDENT DEDENT return s [ : - 2 ] + s [ : : - 1 ] NEW_LINE DEDENT
|
g-transeval-python_data_256
|
def string_xor ( a , b ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( len ( a ) ) : NEW_LINE INDENT if a [ i ] == b [ i ] : NEW_LINE INDENT result . append ( "0" ) NEW_LINE DEDENT else : NEW_LINE INDENT result . append ( "1" ) NEW_LINE DEDENT DEDENT return "" . join ( result ) NEW_LINE DEDENT
|
g-transeval-python_data_257
|
def longest ( strings ) : NEW_LINE INDENT if not strings : NEW_LINE INDENT return "" NEW_LINE DEDENT max_len = max ( len ( x ) for x in strings ) NEW_LINE for s in strings : NEW_LINE INDENT if len ( s ) == max_len : NEW_LINE INDENT return s NEW_LINE DEDENT DEDENT return "" NEW_LINE DEDENT
|
g-transeval-python_data_258
|
def string_sequence ( n ) : NEW_LINE INDENT s = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT s . append ( str ( i ) ) NEW_LINE s . append ( " " ) NEW_LINE DEDENT s . append ( str ( n ) ) NEW_LINE return "" . join ( s ) NEW_LINE DEDENT
|
g-transeval-python_data_259
|
def count_distinct_characters ( s ) : NEW_LINE INDENT distinct = set ( ) NEW_LINE for c in s . lower ( ) : NEW_LINE INDENT distinct . add ( c ) NEW_LINE DEDENT return len ( distinct ) NEW_LINE DEDENT
|
g-transeval-python_data_260
|
def how_many_times ( s , sub ) : NEW_LINE INDENT times = 0 NEW_LINE for i in range ( len ( s ) - len ( sub ) + 1 ) : NEW_LINE INDENT if s [ i : i + len ( sub ) ] == sub : NEW_LINE INDENT times += 1 NEW_LINE DEDENT DEDENT return times NEW_LINE DEDENT
|
g-transeval-python_data_261
|
def sort_numbers ( numbers ) : NEW_LINE INDENT to_num = { "zero" : 0 , "one" : 1 , "two" : 2 , "three" : 3 , "four" : 4 , "five" : 5 , "six" : 6 , "seven" : 7 , "eight" : 8 , "nine" : 9 } NEW_LINE from_num = { 0 : "zero" , 1 : "one" , 2 : "two" , 3 : "three" , 4 : "four" , 5 : "five" , 6 : "six" , 7 : "seven" , 8 : "eight" , 9 : "nine" } NEW_LINE ints = [ ] NEW_LINE current = [ ] NEW_LINE for i in range ( len ( numbers ) + 1 ) : NEW_LINE INDENT if i == len ( numbers ) or numbers [ i ] == " " : NEW_LINE INDENT if "" . join ( current ) in to_num : NEW_LINE INDENT ints . append ( to_num [ "" . join ( current ) ] ) NEW_LINE current . clear ( ) NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT current . append ( numbers [ i ] ) NEW_LINE DEDENT DEDENT ints . sort ( ) NEW_LINE result = [ ] NEW_LINE for i in range ( len ( ints ) ) : NEW_LINE INDENT result . append ( from_num [ ints [ i ] ] ) NEW_LINE if i != len ( ints ) - 1 : NEW_LINE INDENT result . append ( " " ) NEW_LINE DEDENT DEDENT return "" . join ( result ) NEW_LINE DEDENT
|
g-transeval-python_data_262
|
def find_closest_elements ( numbers ) : NEW_LINE INDENT closest_pair = [ numbers [ 0 ] , numbers [ 1 ] ] NEW_LINE distance = abs ( closest_pair [ 0 ] - closest_pair [ 1 ] ) NEW_LINE for i in range ( len ( numbers ) ) : NEW_LINE INDENT for j in range ( i + 1 , len ( numbers ) ) : NEW_LINE INDENT if abs ( numbers [ i ] - numbers [ j ] ) < distance : NEW_LINE INDENT closest_pair [ 0 ] = numbers [ i ] NEW_LINE closest_pair [ 1 ] = numbers [ j ] NEW_LINE distance = abs ( numbers [ i ] - numbers [ j ] ) NEW_LINE DEDENT DEDENT DEDENT closest_pair . sort ( ) NEW_LINE return closest_pair NEW_LINE DEDENT
|
g-transeval-python_data_263
|
def rescale_to_unit ( numbers ) : NEW_LINE INDENT min_num = min ( numbers ) NEW_LINE max_num = max ( numbers ) NEW_LINE result = [ ] NEW_LINE for n in numbers : NEW_LINE INDENT result . append ( ( n - min_num ) / ( max_num - min_num ) ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_264
|
def filter_integers ( values ) : NEW_LINE INDENT result = [ ] NEW_LINE for e in values : NEW_LINE INDENT if isinstance ( e , int ) : NEW_LINE INDENT result . append ( e ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_265
|
def remove_duplicates ( numbers ) : NEW_LINE INDENT counter = { } NEW_LINE for i in numbers : NEW_LINE INDENT counter [ i ] = counter . get ( i , 0 ) + 1 NEW_LINE DEDENT result = [ ] NEW_LINE for i in numbers : NEW_LINE INDENT if counter [ i ] == 1 : NEW_LINE INDENT result . append ( i ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_266
|
def flip_case ( s ) : NEW_LINE INDENT result = [ ] NEW_LINE for c in s : NEW_LINE INDENT if c . islower ( ) : NEW_LINE INDENT result . append ( c . upper ( ) ) NEW_LINE DEDENT else : NEW_LINE INDENT result . append ( c . lower ( ) ) NEW_LINE DEDENT DEDENT return "" . join ( result ) NEW_LINE DEDENT
|
g-transeval-python_data_267
|
def filter_by_prefix ( strings , prefix ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( len ( strings ) ) : NEW_LINE INDENT if strings [ i ] . startswith ( prefix ) : NEW_LINE INDENT result . append ( strings [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_268
|
def find_zero ( xs ) : NEW_LINE INDENT ans = 0 NEW_LINE value = 0 NEW_LINE for i in range ( len ( xs ) ) : NEW_LINE INDENT value += xs [ i ] * ans ** i NEW_LINE DEDENT while abs ( value ) > 1e-6 : NEW_LINE INDENT driv = 0 NEW_LINE for i in range ( 1 , len ( xs ) ) : NEW_LINE INDENT driv += xs [ i ] * ans ** ( i - 1 ) * i NEW_LINE DEDENT ans -= value / driv NEW_LINE value = 0 NEW_LINE for i in range ( len ( xs ) ) : NEW_LINE INDENT value += xs [ i ] * ans ** i NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_269
|
def sort_third ( l ) : NEW_LINE INDENT thirds = [ ] NEW_LINE for i in range ( 0 , len ( l ) , 3 ) : NEW_LINE INDENT thirds . append ( l [ i ] ) NEW_LINE DEDENT thirds . sort ( ) NEW_LINE result = [ ] NEW_LINE for i in range ( len ( l ) ) : NEW_LINE INDENT if i % 3 == 0 : NEW_LINE INDENT result . append ( thirds [ i // 3 ] ) NEW_LINE DEDENT else : NEW_LINE INDENT result . append ( l [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_270
|
def unique ( l ) : NEW_LINE INDENT result = list ( set ( l ) ) NEW_LINE result . sort ( ) NEW_LINE return result NEW_LINE DEDENT
|
g-transeval-python_data_271
|
def max_element ( l ) : NEW_LINE INDENT return max ( l ) NEW_LINE DEDENT
|
g-transeval-python_data_272
|
def triples_sum_to_zero ( l ) : NEW_LINE INDENT for i in range ( len ( l ) ) : NEW_LINE INDENT for j in range ( i + 1 , len ( l ) ) : NEW_LINE INDENT for k in range ( j + 1 , len ( l ) ) : NEW_LINE INDENT if l [ i ] + l [ j ] + l [ k ] == 0 : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT DEDENT DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_273
|
def fib4 ( n ) : NEW_LINE INDENT results = [ 0 , 0 , 2 , 0 ] NEW_LINE for i in range ( 4 , n + 1 ) : NEW_LINE INDENT results . append ( results [ i - 4 ] + results [ i - 3 ] + results [ i - 2 ] + results [ i - 1 ] ) NEW_LINE DEDENT return results [ n ] NEW_LINE DEDENT
|
g-transeval-python_data_274
|
def is_palindrome ( text ) : NEW_LINE INDENT pr = text [ : : - 1 ] NEW_LINE return pr == text NEW_LINE DEDENT
|
g-transeval-python_data_275
|
def remove_vowels ( text ) : NEW_LINE INDENT result = [ ] NEW_LINE vowels = "aeiou" NEW_LINE for ch in text : NEW_LINE INDENT if ch . lower ( ) not in vowels : NEW_LINE INDENT result . append ( ch ) NEW_LINE DEDENT DEDENT return "" . join ( result ) NEW_LINE DEDENT
|
g-transeval-python_data_276
|
def same_chars ( s0 , s1 ) : NEW_LINE INDENT set0 = set ( ) NEW_LINE for c in s0 : NEW_LINE INDENT set0 . add ( c ) NEW_LINE DEDENT set1 = set ( ) NEW_LINE for c in s1 : NEW_LINE INDENT set1 . add ( c ) NEW_LINE DEDENT return set0 == set1 NEW_LINE DEDENT
|
g-transeval-python_data_277
|
def common ( l1 , l2 ) : NEW_LINE INDENT us = set ( ) NEW_LINE for e1 in l1 : NEW_LINE INDENT for e2 in l2 : NEW_LINE INDENT if e1 == e2 : NEW_LINE INDENT us . add ( e1 ) NEW_LINE DEDENT DEDENT DEDENT ret = list ( us ) NEW_LINE ret . sort ( ) NEW_LINE return ret NEW_LINE DEDENT
|
g-transeval-python_data_278
|
def correct_bracketing ( brackets ) : NEW_LINE INDENT depth = 0 NEW_LINE for b in brackets : NEW_LINE INDENT if b == "(" : NEW_LINE INDENT depth += 1 NEW_LINE DEDENT else : NEW_LINE INDENT depth -= 1 NEW_LINE DEDENT if depth < 0 : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return depth == 0 NEW_LINE DEDENT
|
g-transeval-python_data_279
|
def circular_shift ( x , shift ) : NEW_LINE INDENT s = str ( x ) NEW_LINE if shift > len ( s ) : NEW_LINE INDENT return s [ : : - 1 ] NEW_LINE DEDENT return s [ - shift : ] + s [ : - shift ] NEW_LINE DEDENT
|
g-transeval-python_data_280
|
def search ( lst ) : NEW_LINE INDENT counter = { } NEW_LINE for i in lst : NEW_LINE INDENT counter [ i ] = counter . get ( i , 0 ) + 1 NEW_LINE DEDENT ans = - 1 NEW_LINE for key , value in counter . items ( ) : NEW_LINE INDENT if value >= key > ans : NEW_LINE INDENT ans = key NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_281
|
def smallest_change ( arr ) : NEW_LINE INDENT ans = 0 NEW_LINE for i in range ( len ( arr ) // 2 ) : NEW_LINE INDENT if arr [ i ] != arr [ - i - 1 ] : NEW_LINE INDENT ans += 1 NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_282
|
def total_match ( lst1 , lst2 ) : NEW_LINE INDENT sum1 = 0 NEW_LINE for st in lst1 : NEW_LINE INDENT sum1 += len ( st ) NEW_LINE DEDENT sum2 = 0 NEW_LINE for st in lst2 : NEW_LINE INDENT sum2 += len ( st ) NEW_LINE DEDENT return lst2 if sum1 > sum2 else lst1 NEW_LINE DEDENT
|
g-transeval-python_data_283
|
def is_happy ( s ) : NEW_LINE INDENT if len ( s ) < 3 : NEW_LINE INDENT return False NEW_LINE DEDENT for i in range ( len ( s ) - 2 ) : NEW_LINE INDENT if s [ i ] == s [ i + 1 ] or s [ i + 1 ] == s [ i + 2 ] or s [ i ] == s [ i + 2 ] : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_284
|
def numerical_letter_grade ( grades ) : NEW_LINE INDENT letter_grade = [ ] NEW_LINE for gpa in grades : NEW_LINE INDENT if gpa == 4.0 : NEW_LINE INDENT letter_grade . append ( "A+" ) NEW_LINE DEDENT elif gpa > 3.7 : NEW_LINE INDENT letter_grade . append ( "A" ) NEW_LINE DEDENT elif gpa > 3.3 : NEW_LINE INDENT letter_grade . append ( "A-" ) NEW_LINE DEDENT elif gpa > 3.0 : NEW_LINE INDENT letter_grade . append ( "B+" ) NEW_LINE DEDENT elif gpa > 2.7 : NEW_LINE INDENT letter_grade . append ( "B" ) NEW_LINE DEDENT elif gpa > 2.3 : NEW_LINE INDENT letter_grade . append ( "B-" ) NEW_LINE DEDENT elif gpa > 2.0 : NEW_LINE INDENT letter_grade . append ( "C+" ) NEW_LINE DEDENT elif gpa > 1.7 : NEW_LINE INDENT letter_grade . append ( "C" ) NEW_LINE DEDENT elif gpa > 1.3 : NEW_LINE INDENT letter_grade . append ( "C-" ) NEW_LINE DEDENT elif gpa > 1.0 : NEW_LINE INDENT letter_grade . append ( "D+" ) NEW_LINE DEDENT elif gpa > 0.7 : NEW_LINE INDENT letter_grade . append ( "D" ) NEW_LINE DEDENT elif gpa > 0.0 : NEW_LINE INDENT letter_grade . append ( "D-" ) NEW_LINE DEDENT else : NEW_LINE INDENT letter_grade . append ( "E" ) NEW_LINE DEDENT DEDENT return letter_grade NEW_LINE DEDENT
|
g-transeval-python_data_285
|
def solve ( n ) : NEW_LINE INDENT bi_str = [ ] NEW_LINE sum = 0 NEW_LINE for c in str ( n ) : NEW_LINE INDENT sum += ord ( c ) - ord ( "0" ) NEW_LINE DEDENT while sum > 0 : NEW_LINE INDENT bi_str . insert ( 0 , str ( sum % 2 ) ) NEW_LINE sum //= 2 NEW_LINE DEDENT return "" . join ( bi_str ) NEW_LINE DEDENT
|
g-transeval-python_data_286
|
def anti_shuffle ( s ) : NEW_LINE INDENT ret = [ ] NEW_LINE current = [ ] NEW_LINE for i in range ( len ( s ) + 1 ) : NEW_LINE INDENT if i == len ( s ) or s [ i ] == " " : NEW_LINE INDENT current . sort ( ) NEW_LINE if ret : NEW_LINE INDENT ret . append ( " " ) NEW_LINE DEDENT ret . append ( "" . join ( current ) ) NEW_LINE current . clear ( ) NEW_LINE DEDENT else : NEW_LINE INDENT current . append ( s [ i ] ) NEW_LINE DEDENT DEDENT return "" . join ( ret ) NEW_LINE DEDENT
|
g-transeval-python_data_287
|
def sort_array ( array ) : NEW_LINE INDENT if not array : NEW_LINE INDENT return array NEW_LINE DEDENT if ( array [ 0 ] + array [ - 1 ] ) % 2 == 1 : NEW_LINE INDENT array . sort ( ) NEW_LINE DEDENT else : NEW_LINE INDENT array . sort ( reverse = True ) NEW_LINE DEDENT return array NEW_LINE DEDENT
|
g-transeval-python_data_288
|
def encrypt ( s ) : NEW_LINE INDENT ans = [ ] NEW_LINE for c in s : NEW_LINE INDENT if c . isalpha ( ) : NEW_LINE INDENT ans . append ( chr ( ord ( "a" ) + ( ord ( c ) - ord ( "a" ) + 4 ) % 26 ) ) NEW_LINE DEDENT else : NEW_LINE INDENT ans . append ( c ) NEW_LINE DEDENT DEDENT return "" . join ( ans ) NEW_LINE DEDENT
|
g-transeval-python_data_289
|
def is_bored ( s ) : NEW_LINE INDENT is_start = True NEW_LINE sum = 0 NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT if s [ i ] == "." or s [ i ] == "?" or s [ i ] == "!" : NEW_LINE INDENT is_start = True NEW_LINE DEDENT elif is_start : NEW_LINE INDENT if s [ i ] == " " : NEW_LINE INDENT continue NEW_LINE DEDENT if s [ i : i + 2 ] == "I " : NEW_LINE INDENT sum += 1 NEW_LINE DEDENT is_start = False NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_290
|
def encode ( message ) : NEW_LINE INDENT vowels = "aeiouAEIOU" NEW_LINE ret = [ ] NEW_LINE for c in message : NEW_LINE INDENT if c . isupper ( ) : NEW_LINE INDENT c = c . lower ( ) NEW_LINE if c in vowels : NEW_LINE INDENT c = chr ( ord ( "a" ) + ( ord ( c ) - ord ( "a" ) + 2 ) % 26 ) NEW_LINE DEDENT DEDENT elif c . islower ( ) : NEW_LINE INDENT c = c . upper ( ) NEW_LINE if c in vowels : NEW_LINE INDENT c = chr ( ord ( "A" ) + ( ord ( c ) - ord ( "A" ) + 2 ) % 26 ) NEW_LINE DEDENT DEDENT ret . append ( c ) NEW_LINE DEDENT return "" . join ( ret ) NEW_LINE DEDENT
|
g-transeval-python_data_291
|
def skjkasdkd ( lst ) : NEW_LINE INDENT largest = 0 NEW_LINE for n in lst : NEW_LINE INDENT if n > largest : NEW_LINE INDENT prime = True NEW_LINE for i in range ( 2 , n ) : NEW_LINE INDENT if n % i == 0 : NEW_LINE INDENT prime = False NEW_LINE DEDENT DEDENT if prime : NEW_LINE INDENT largest = n NEW_LINE DEDENT DEDENT DEDENT sum = 0 NEW_LINE s = str ( largest ) NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT sum += ord ( s [ i ] ) - ord ( "0" ) NEW_LINE DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_292
|
def check_dict_case ( dict ) : NEW_LINE INDENT if not dict : NEW_LINE INDENT return False NEW_LINE DEDENT is_lower = 0 NEW_LINE is_upper = 0 NEW_LINE for key in dict : NEW_LINE INDENT for c in key : NEW_LINE INDENT if c . islower ( ) : NEW_LINE INDENT is_lower = 1 NEW_LINE DEDENT elif c . isupper ( ) : NEW_LINE INDENT is_upper = 1 NEW_LINE DEDENT else : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT DEDENT return is_lower + is_upper == 1 NEW_LINE DEDENT
|
g-transeval-python_data_293
|
def multiply ( a , b ) : NEW_LINE INDENT return ( abs ( a ) % 10 ) * ( abs ( b ) % 10 ) NEW_LINE DEDENT
|
g-transeval-python_data_294
|
def count_upper ( s ) : NEW_LINE INDENT u_vowel = "AEIOU" NEW_LINE count = 0 NEW_LINE for i in range ( 0 , len ( s ) , 2 ) : NEW_LINE INDENT if s [ i ] in u_vowel : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_295
|
def by_length ( arr ) : NEW_LINE INDENT num_to = { 1 : "One" , 2 : "Two" , 3 : "Three" , 4 : "Four" , 5 : "Five" , 6 : "Six" , 7 : "Seven" , 8 : "Eight" , 9 : "Nine" } NEW_LINE sorted_arr = sorted ( arr , reverse = True ) NEW_LINE new_arr = [ ] NEW_LINE for n in sorted_arr : NEW_LINE INDENT if n >= 1 and n <= 9 : NEW_LINE INDENT new_arr . append ( num_to [ n ] ) NEW_LINE DEDENT DEDENT return new_arr NEW_LINE DEDENT
|
g-transeval-python_data_296
|
def f ( n ) : NEW_LINE INDENT sum = 0 NEW_LINE prod = 1 NEW_LINE result = [ ] NEW_LINE for i in range ( 1 , n + 1 ) : NEW_LINE INDENT sum += i NEW_LINE prod *= i NEW_LINE if i % 2 == 0 : NEW_LINE INDENT result . append ( prod ) NEW_LINE DEDENT else : NEW_LINE INDENT result . append ( sum ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_297
|
def even_odd_palindrome ( n ) : NEW_LINE INDENT even_count = 0 NEW_LINE odd_count = 0 NEW_LINE for i in range ( 1 , n + 1 ) : NEW_LINE INDENT s = str ( i ) NEW_LINE r_str = s [ : : - 1 ] NEW_LINE if s == r_str : NEW_LINE INDENT if i % 2 == 1 : NEW_LINE INDENT odd_count += 1 NEW_LINE DEDENT else : NEW_LINE INDENT even_count += 1 NEW_LINE DEDENT DEDENT DEDENT return [ even_count , odd_count ] NEW_LINE DEDENT
|
g-transeval-python_data_298
|
def histogram ( test ) : NEW_LINE INDENT count = { } NEW_LINE max = 0 NEW_LINE for i in range ( len ( test ) ) : NEW_LINE INDENT if test [ i ] != " " : NEW_LINE INDENT count [ test [ i ] ] = count . get ( test [ i ] , 0 ) + 1 NEW_LINE if count [ test [ i ] ] > max : NEW_LINE INDENT max = count [ test [ i ] ] NEW_LINE DEDENT DEDENT DEDENT result = { } NEW_LINE for key , value in count . items ( ) : NEW_LINE INDENT if value == max : NEW_LINE INDENT result [ key ] = value NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_299
|
def reverse_delete ( s , c ) : NEW_LINE INDENT ret = [ ] NEW_LINE for ch in s : NEW_LINE INDENT if ch not in c : NEW_LINE INDENT ret . append ( ch ) NEW_LINE DEDENT DEDENT flag = "False" NEW_LINE if "" . join ( ret ) == "" . join ( ret [ : : - 1 ] ) : NEW_LINE INDENT flag = "True" NEW_LINE DEDENT return [ "" . join ( ret ) , flag ] NEW_LINE DEDENT
|
g-transeval-python_data_300
|
def sort_array ( arr ) : NEW_LINE INDENT bin = [ ] NEW_LINE for i in arr : NEW_LINE INDENT b = 0 NEW_LINE n = abs ( i ) NEW_LINE while n > 0 : NEW_LINE INDENT b += n % 2 NEW_LINE n //= 2 NEW_LINE DEDENT bin . append ( b ) NEW_LINE DEDENT for i in range ( len ( arr ) ) : NEW_LINE INDENT for j in range ( 1 , len ( arr ) ) : NEW_LINE INDENT if bin [ j ] < bin [ j - 1 ] or ( bin [ j ] == bin [ j - 1 ] and arr [ j ] < arr [ j - 1 ] ) : NEW_LINE INDENT bin [ j ] , bin [ j - 1 ] = bin [ j - 1 ] , bin [ j ] NEW_LINE arr [ j ] , arr [ j - 1 ] = arr [ j - 1 ] , arr [ j ] NEW_LINE DEDENT DEDENT DEDENT return arr NEW_LINE DEDENT
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.