id
stringlengths 25
27
| content
stringlengths 66
1.28k
|
|---|---|
g-transeval-python_data_101
|
def is_even_parity ( x ) : NEW_LINE INDENT parity = 0 NEW_LINE while x != 0 : NEW_LINE INDENT if x & 1 : NEW_LINE INDENT parity += 1 NEW_LINE DEDENT x = x >> 1 NEW_LINE DEDENT if parity % 2 == 0 : NEW_LINE INDENT return True NEW_LINE DEDENT else : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT
|
g-transeval-python_data_102
|
def is_perfect ( n ) : NEW_LINE INDENT sum = 1 NEW_LINE for i in range ( 2 , n + 1 ) : NEW_LINE INDENT if i * i > n : NEW_LINE INDENT break NEW_LINE DEDENT if n % i == 0 : NEW_LINE INDENT if i * i != n : NEW_LINE INDENT sum = sum + i + n // i NEW_LINE DEDENT else : NEW_LINE INDENT sum = sum + i NEW_LINE DEDENT DEDENT DEDENT if sum == n and n != 1 : NEW_LINE INDENT return n NEW_LINE DEDENT return 0 NEW_LINE DEDENT
|
g-transeval-python_data_103
|
def log_a_to_base_b ( a , b ) : NEW_LINE INDENT return 1 + log_a_to_base_b ( a // b , b ) if a > ( b - 1 ) else 0 NEW_LINE DEDENT
|
g-transeval-python_data_104
|
def using_binary_search ( start , end , n , s ) : NEW_LINE INDENT if start >= end : NEW_LINE INDENT return start NEW_LINE DEDENT mid = start + ( end - start ) // 2 NEW_LINE total_sum = ( n * ( n + 1 ) ) // 2 NEW_LINE mid_sum = ( mid * ( mid + 1 ) ) // 2 NEW_LINE if total_sum - mid_sum <= s : NEW_LINE INDENT return using_binary_search ( start , mid , n , s ) NEW_LINE DEDENT return using_binary_search ( mid + 1 , end , n , s ) NEW_LINE DEDENT
|
g-transeval-python_data_105
|
def min_int ( s ) : NEW_LINE INDENT s1 = list ( s ) NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT if ord ( s1 [ i ] ) >= ord ( '5' ) : NEW_LINE INDENT s1 [ i ] = chr ( ord ( '9' ) - ord ( s1 [ i ] ) + ord ( '0' ) ) NEW_LINE DEDENT DEDENT if s1 [ 0 ] == '0' : NEW_LINE INDENT s1 [ 0 ] = '9' NEW_LINE DEDENT return "" . join ( s1 ) NEW_LINE DEDENT
|
g-transeval-python_data_106
|
def count_triplets ( a , b , c ) : NEW_LINE INDENT ans = 0 NEW_LINE for i in range ( 1 , a + 1 ) : NEW_LINE INDENT for j in range ( 1 , b + 1 ) : NEW_LINE INDENT for k in range ( 1 , c + 1 ) : NEW_LINE INDENT if i * k > j * j : NEW_LINE INDENT ans += 1 NEW_LINE DEDENT DEDENT DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_107
|
def topsy_turvy ( s ) : NEW_LINE INDENT for i in range ( len ( s ) ) : NEW_LINE INDENT if s [ i ] == '2' or s [ i ] == '4' or s [ i ] == '5' or s [ i ] == '6' or s [ i ] == '7' or s [ i ] == '9' : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_108
|
def sum_of_last_dig ( n , m ) : NEW_LINE INDENT sum = 0 NEW_LINE k = n // m NEW_LINE arr = [ 0 ] * 10 NEW_LINE for i in range ( 10 ) : NEW_LINE INDENT arr [ i ] = m * ( i + 1 ) % 10 NEW_LINE sum += arr [ i ] NEW_LINE DEDENT rem = k % 10 NEW_LINE ans = k // 10 * sum NEW_LINE for i in range ( rem ) : NEW_LINE INDENT ans += arr [ i ] NEW_LINE DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_109
|
def total_pay ( total_items , price_of_one_item , n , m ) : NEW_LINE INDENT free_items = 0 NEW_LINE actual = 0 NEW_LINE free_items = total_items // ( n + m ) NEW_LINE actual = total_items - free_items NEW_LINE amount = actual * price_of_one_item NEW_LINE return amount NEW_LINE DEDENT
|
g-transeval-python_data_110
|
def min_operations ( x , y , p , q ) : NEW_LINE INDENT if y % x != 0 : NEW_LINE INDENT return - 1 NEW_LINE DEDENT d = y // x NEW_LINE a = 0 NEW_LINE while d % p == 0 : NEW_LINE INDENT d //= p NEW_LINE a += 1 NEW_LINE DEDENT b = 0 NEW_LINE while d % q == 0 : NEW_LINE INDENT d //= q NEW_LINE b += 1 NEW_LINE DEDENT if d != 1 : NEW_LINE INDENT return - 1 NEW_LINE DEDENT return a + b NEW_LINE DEDENT
|
g-transeval-python_data_111
|
def is_mersenne ( n ) : NEW_LINE INDENT while n != 0 : NEW_LINE INDENT r = n % 2 NEW_LINE if r == 0 : NEW_LINE INDENT return False NEW_LINE DEDENT n //= 2 NEW_LINE DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_112
|
def find_third_digit ( n ) : NEW_LINE INDENT if n < 3 : NEW_LINE INDENT return 0 NEW_LINE DEDENT return 1 if n & 1 else 6 NEW_LINE DEDENT
|
g-transeval-python_data_113
|
def is_odd_length ( num ) : NEW_LINE INDENT count = 0 NEW_LINE while num > 0 : NEW_LINE INDENT num = num // 10 NEW_LINE count += 1 NEW_LINE DEDENT if count % 2 != 0 : NEW_LINE INDENT return True NEW_LINE DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_114
|
def check_is_possible ( l , r , k ) : NEW_LINE INDENT count = 0 NEW_LINE for i in range ( l , r + 1 ) : NEW_LINE INDENT if i % k == 0 : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT return count > 1 NEW_LINE DEDENT
|
g-transeval-python_data_115
|
def bytes ( kilobytes ) : NEW_LINE INDENT b = kilobytes * 1024 NEW_LINE return b NEW_LINE DEDENT
|
g-transeval-python_data_116
|
def octahedral_num ( n ) : NEW_LINE INDENT return n * ( 2 * n * n + 1 ) // 3 NEW_LINE DEDENT
|
g-transeval-python_data_117
|
def check_equal ( s ) : NEW_LINE INDENT for i in range ( len ( s ) ) : NEW_LINE INDENT if s [ i ] != '1' and s [ i ] != '0' and s [ i ] != '8' : NEW_LINE INDENT return "No" NEW_LINE DEDENT DEDENT start = 0 NEW_LINE end = len ( s ) - 1 NEW_LINE while start < end : NEW_LINE INDENT if s [ start ] != s [ end ] : NEW_LINE INDENT return "No" NEW_LINE DEDENT start += 1 NEW_LINE end -= 1 NEW_LINE DEDENT return "Yes" NEW_LINE DEDENT
|
g-transeval-python_data_118
|
def is_undulating ( n ) : NEW_LINE INDENT if len ( n ) <= 2 : NEW_LINE INDENT return False NEW_LINE DEDENT for i in range ( 2 , len ( n ) ) : NEW_LINE INDENT if n [ i - 2 ] != n [ i ] : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_119
|
def first_digit ( n ) : NEW_LINE INDENT while n >= 10 : NEW_LINE INDENT n //= 10 NEW_LINE DEDENT return n NEW_LINE DEDENT
|
g-transeval-python_data_120
|
def count_digit ( n ) : NEW_LINE INDENT if n == 0 : NEW_LINE INDENT return 0 NEW_LINE DEDENT return 1 + count_digit ( n // 10 ) NEW_LINE DEDENT
|
g-transeval-python_data_121
|
def is_divisible_by_5 ( s ) : NEW_LINE INDENT n = len ( s ) NEW_LINE return s [ n - 1 ] == '0' or s [ n - 1 ] == '5' NEW_LINE DEDENT
|
g-transeval-python_data_122
|
def inv ( a , m ) : NEW_LINE INDENT m0 = m NEW_LINE x0 , x1 = 0 , 1 NEW_LINE if m == 1 : NEW_LINE INDENT return 0 NEW_LINE DEDENT while a > 1 : NEW_LINE INDENT q = a // m NEW_LINE t = m NEW_LINE m = a % m NEW_LINE a = t NEW_LINE t = x0 NEW_LINE x0 = x1 - q * x0 NEW_LINE x1 = t NEW_LINE DEDENT if x1 < 0 : NEW_LINE INDENT x1 = x1 + m0 NEW_LINE DEDENT return x1 NEW_LINE DEDENT
|
g-transeval-python_data_123
|
def only_first_and_last_are_set ( n ) : NEW_LINE INDENT if n == 1 : NEW_LINE INDENT return True NEW_LINE DEDENT if n == 2 : NEW_LINE INDENT return False NEW_LINE DEDENT return ( ( n - 1 ) & ( n - 2 ) ) == 0 NEW_LINE DEDENT
|
g-transeval-python_data_124
|
def divide ( dividend , divisor ) : NEW_LINE INDENT sign = - 1 if ( ( dividend < 0 ) ^ ( divisor < 0 ) ) else 1 NEW_LINE dividend = abs ( dividend ) NEW_LINE divisor = abs ( divisor ) NEW_LINE quotient = 0 NEW_LINE temp = 0 NEW_LINE for i in range ( 31 , - 1 , - 1 ) : NEW_LINE INDENT if temp + ( divisor << i ) <= dividend : NEW_LINE INDENT temp += divisor << i NEW_LINE quotient |= 1 << i NEW_LINE DEDENT DEDENT if sign == - 1 : NEW_LINE INDENT quotient = - quotient NEW_LINE DEDENT return quotient NEW_LINE DEDENT
|
g-transeval-python_data_125
|
def find_profession ( level , pos ) : NEW_LINE INDENT if level == 1 : NEW_LINE INDENT return 'e' NEW_LINE DEDENT if find_profession ( level - 1 , ( pos + 1 ) // 2 ) == 'd' : NEW_LINE INDENT return 'd' if pos % 2 else 'e' NEW_LINE DEDENT return 'e' if pos % 2 else 'd' NEW_LINE DEDENT
|
g-transeval-python_data_126
|
def has_close_elements ( numbers , threshold ) : NEW_LINE INDENT for i in range ( len ( numbers ) ) : NEW_LINE INDENT for j in range ( i + 1 , len ( numbers ) ) : NEW_LINE INDENT distance = abs ( numbers [ i ] - numbers [ j ] ) NEW_LINE if distance < threshold : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_127
|
def truncate_number ( number ) : NEW_LINE INDENT return number % 1 NEW_LINE DEDENT
|
g-transeval-python_data_128
|
def below_zero ( operations ) : NEW_LINE INDENT balance = 0 NEW_LINE for op in operations : NEW_LINE INDENT balance += op NEW_LINE if balance < 0 : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_129
|
def mean_absolute_deviation ( numbers ) : NEW_LINE INDENT sum_num = 0 NEW_LINE for num in numbers : NEW_LINE INDENT sum_num += num NEW_LINE DEDENT mean = sum_num / len ( numbers ) NEW_LINE sum_abs_diff = 0 NEW_LINE for num in numbers : NEW_LINE INDENT sum_abs_diff += abs ( num - mean ) NEW_LINE DEDENT return sum_abs_diff / len ( numbers ) NEW_LINE DEDENT
|
g-transeval-python_data_130
|
def intersperse ( numbers , delimiter ) : NEW_LINE INDENT result = [ ] NEW_LINE if not numbers : NEW_LINE INDENT return result NEW_LINE DEDENT for i in range ( len ( numbers ) - 1 ) : NEW_LINE INDENT result . append ( numbers [ i ] ) NEW_LINE result . append ( delimiter ) NEW_LINE DEDENT result . append ( numbers [ - 1 ] ) NEW_LINE return result NEW_LINE DEDENT
|
g-transeval-python_data_131
|
def sum_product ( numbers ) : NEW_LINE INDENT sum_value = 0 NEW_LINE prod_value = 1 NEW_LINE for n in numbers : NEW_LINE INDENT sum_value += n NEW_LINE prod_value *= n NEW_LINE DEDENT return [ sum_value , prod_value ] NEW_LINE DEDENT
|
g-transeval-python_data_132
|
def all_prefixes ( string ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( 1 , len ( string ) + 1 ) : NEW_LINE INDENT result . append ( string [ : i ] ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_133
|
def parse_music ( music_string ) : NEW_LINE INDENT current = [ ] NEW_LINE result = [ ] NEW_LINE for i in range ( len ( music_string ) + 1 ) : NEW_LINE INDENT if i == len ( music_string ) or music_string [ i ] == " " : NEW_LINE INDENT if "" . join ( current ) == "o" : NEW_LINE INDENT result . append ( 4 ) NEW_LINE DEDENT if "" . join ( current ) == "o|" : NEW_LINE INDENT result . append ( 2 ) NEW_LINE DEDENT if "" . join ( current ) == ".|" : NEW_LINE INDENT result . append ( 1 ) NEW_LINE DEDENT current . clear ( ) NEW_LINE DEDENT else : NEW_LINE INDENT current . append ( music_string [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_134
|
def strlen ( s ) : NEW_LINE INDENT return len ( s ) NEW_LINE DEDENT
|
g-transeval-python_data_135
|
def factorize ( n ) : NEW_LINE INDENT factors = [ ] NEW_LINE i = 2 NEW_LINE while i <= n : NEW_LINE INDENT if n % i == 0 : NEW_LINE INDENT factors . append ( i ) NEW_LINE n //= i NEW_LINE DEDENT else : NEW_LINE INDENT i += 1 NEW_LINE DEDENT DEDENT return factors NEW_LINE DEDENT
|
g-transeval-python_data_136
|
def concatenate ( strings ) : NEW_LINE INDENT result = [ ] NEW_LINE for s in strings : NEW_LINE INDENT result . append ( s ) NEW_LINE DEDENT return "" . join ( result ) NEW_LINE DEDENT
|
g-transeval-python_data_137
|
def get_positive ( l ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( len ( l ) ) : NEW_LINE INDENT if l [ i ] > 0 : NEW_LINE INDENT result . append ( l [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_138
|
def sort_even ( l ) : NEW_LINE INDENT evens = [ ] NEW_LINE for i in range ( 0 , len ( l ) , 2 ) : NEW_LINE INDENT evens . append ( l [ i ] ) NEW_LINE DEDENT evens . sort ( ) NEW_LINE result = [ ] NEW_LINE for i in range ( len ( l ) ) : NEW_LINE INDENT if i % 2 == 0 : NEW_LINE INDENT result . append ( evens [ i // 2 ] ) NEW_LINE DEDENT if i % 2 == 1 : NEW_LINE INDENT result . append ( l [ i ] ) NEW_LINE DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_139
|
def decode_cyclic ( s ) : NEW_LINE INDENT output = [ ] NEW_LINE i = 0 NEW_LINE while i <= len ( s ) - 3 : NEW_LINE INDENT x = s [ i + 2 ] + s [ i : i + 2 ] NEW_LINE output . append ( x ) NEW_LINE i += 3 NEW_LINE DEDENT return "" . join ( output ) + s [ i : ] NEW_LINE DEDENT
|
g-transeval-python_data_140
|
def car_race_collision ( n ) : NEW_LINE INDENT return n ** 2 NEW_LINE DEDENT
|
g-transeval-python_data_141
|
def incr_list ( l ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in l : NEW_LINE INDENT result . append ( i + 1 ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_142
|
def pairs_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 if l [ i ] + l [ j ] == 0 : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_143
|
def change_base ( x , b ) : NEW_LINE INDENT ret = [ ] NEW_LINE while x > 0 : NEW_LINE INDENT ret . insert ( 0 , str ( x % b ) ) NEW_LINE x //= b NEW_LINE DEDENT return "" . join ( ret ) NEW_LINE DEDENT
|
g-transeval-python_data_144
|
def median ( l ) : NEW_LINE INDENT l . sort ( ) NEW_LINE if len ( l ) % 2 == 1 : NEW_LINE INDENT return l [ len ( l ) // 2 ] NEW_LINE DEDENT else : NEW_LINE INDENT return ( l [ len ( l ) // 2 - 1 ] + l [ len ( l ) // 2 ] ) / 2.0 NEW_LINE DEDENT DEDENT
|
g-transeval-python_data_145
|
def decode_shift ( s : str ) : NEW_LINE INDENT result = [ ] NEW_LINE for ch in s : NEW_LINE INDENT w = ( ord ( ch ) + 21 - ord ( "a" ) ) % 26 + ord ( "a" ) NEW_LINE result . append ( chr ( w ) ) NEW_LINE DEDENT return "" . join ( result ) NEW_LINE DEDENT
|
g-transeval-python_data_146
|
def below_threshold ( l , t ) : NEW_LINE INDENT for n in l : NEW_LINE INDENT if n >= t : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_147
|
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_148
|
def monotonic ( l ) : NEW_LINE INDENT incr = 0 NEW_LINE decr = 0 NEW_LINE for i in range ( 1 , len ( l ) ) : NEW_LINE INDENT if l [ i ] > l [ i - 1 ] : NEW_LINE INDENT incr = 1 NEW_LINE DEDENT if l [ i ] < l [ i - 1 ] : NEW_LINE INDENT decr = 1 NEW_LINE DEDENT DEDENT return incr + decr != 2 NEW_LINE DEDENT
|
g-transeval-python_data_149
|
def derivative ( xs ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( 1 , len ( xs ) ) : NEW_LINE INDENT result . append ( i * xs [ i ] ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_150
|
def vowels_count ( s ) : NEW_LINE INDENT vowels = "aeiouAEIOU" NEW_LINE count = 0 NEW_LINE for ch in s : NEW_LINE INDENT if ch in vowels : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT if s [ - 1 ] == "y" or s [ - 1 ] == "Y" : NEW_LINE INDENT count += 1 NEW_LINE DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_151
|
def digit_sum ( s ) : NEW_LINE INDENT sum = 0 NEW_LINE for c in s : NEW_LINE INDENT if c . isupper ( ) : NEW_LINE INDENT sum += ord ( c ) NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_152
|
def fruit_distribution ( s , n ) : NEW_LINE INDENT num1 = [ ] NEW_LINE num2 = [ ] NEW_LINE flag = False NEW_LINE for i in range ( len ( s ) ) : NEW_LINE INDENT if s [ i ] . isdigit ( ) : NEW_LINE INDENT if not flag : NEW_LINE INDENT num1 . append ( s [ i ] ) NEW_LINE DEDENT if flag : NEW_LINE INDENT num2 . append ( s [ i ] ) NEW_LINE DEDENT DEDENT elif not flag and len ( num1 ) > 0 : NEW_LINE INDENT flag = True NEW_LINE DEDENT DEDENT return n - int ( "" . join ( num1 ) ) - int ( "" . join ( num2 ) ) NEW_LINE DEDENT
|
g-transeval-python_data_153
|
def pluck ( arr ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( len ( arr ) ) : NEW_LINE INDENT if arr [ i ] % 2 == 0 : NEW_LINE INDENT if not result : NEW_LINE INDENT result . append ( arr [ i ] ) NEW_LINE result . append ( i ) NEW_LINE DEDENT elif arr [ i ] < result [ 0 ] : NEW_LINE INDENT result [ 0 ] = arr [ i ] NEW_LINE result [ 1 ] = i NEW_LINE DEDENT DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_154
|
def strange_sort_list ( lst ) : NEW_LINE INDENT res = [ ] NEW_LINE lst . sort ( ) NEW_LINE l = 0 NEW_LINE r = len ( lst ) - 1 NEW_LINE while l < r : NEW_LINE INDENT res . append ( lst [ l ] ) NEW_LINE l += 1 NEW_LINE res . append ( lst [ r ] ) NEW_LINE r -= 1 NEW_LINE DEDENT if l == r : NEW_LINE INDENT res . append ( lst [ l ] ) NEW_LINE DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_155
|
def triangle_area ( a , b , c ) : NEW_LINE INDENT if a + b <= c or a + c <= b or b + c <= a : NEW_LINE INDENT return - 1.0 NEW_LINE DEDENT s = ( a + b + c ) / 2 NEW_LINE area = math . sqrt ( s * ( s - a ) * ( s - b ) * ( s - c ) ) NEW_LINE return area NEW_LINE DEDENT
|
g-transeval-python_data_156
|
def will_it_fly ( q , w ) : NEW_LINE INDENT sum = 0 NEW_LINE for i in range ( len ( q ) ) : NEW_LINE INDENT if q [ i ] != q [ - i - 1 ] : NEW_LINE INDENT return False NEW_LINE DEDENT sum += q [ i ] NEW_LINE DEDENT return sum <= w NEW_LINE DEDENT
|
g-transeval-python_data_157
|
def is_cube ( a ) : NEW_LINE INDENT a = abs ( a ) NEW_LINE i = round ( a ** ( 1.0 / 3 ) ) NEW_LINE return i ** 3 == a NEW_LINE DEDENT
|
g-transeval-python_data_158
|
def hex_key ( num ) : NEW_LINE INDENT key = "2357BD" NEW_LINE total = 0 NEW_LINE for c in num : NEW_LINE INDENT if c in key : NEW_LINE INDENT total += 1 NEW_LINE DEDENT DEDENT return total NEW_LINE DEDENT
|
g-transeval-python_data_159
|
def decimal_to_binary ( dec ) : NEW_LINE INDENT ans = [ ] NEW_LINE if dec != 0 : NEW_LINE INDENT while dec > 0 : NEW_LINE INDENT ans . insert ( 0 , str ( dec % 2 ) ) NEW_LINE dec //= 2 NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT ans += "0" NEW_LINE DEDENT return "db" + "" . join ( ans ) + "db" NEW_LINE DEDENT
|
g-transeval-python_data_160
|
def prime_length ( s ) : NEW_LINE INDENT l = len ( s ) NEW_LINE if l < 2 : NEW_LINE INDENT return False NEW_LINE DEDENT for i in range ( 2 , l ) : NEW_LINE INDENT if l % i == 0 : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_161
|
def starts_one_ends ( n ) : NEW_LINE INDENT if n < 1 : NEW_LINE INDENT return 0 NEW_LINE DEDENT if n == 1 : NEW_LINE INDENT return 1 NEW_LINE DEDENT return 18 * ( 10 ** ( n - 2 ) ) NEW_LINE DEDENT
|
g-transeval-python_data_162
|
def add ( lst ) : NEW_LINE INDENT sum = 0 NEW_LINE for i in range ( 1 , len ( lst ) , 2 ) : NEW_LINE INDENT if lst [ i ] % 2 == 0 : NEW_LINE INDENT sum += lst [ i ] NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_163
|
def get_row ( lst , x ) : NEW_LINE INDENT coords = [ ] NEW_LINE for i in range ( len ( lst ) ) : NEW_LINE INDENT for j in range ( len ( lst [ i ] ) - 1 , - 1 , - 1 ) : NEW_LINE INDENT if lst [ i ] [ j ] == x : NEW_LINE INDENT coords . append ( [ i , j ] ) NEW_LINE DEDENT DEDENT DEDENT return coords NEW_LINE DEDENT
|
g-transeval-python_data_164
|
def next_smallest ( lst ) : NEW_LINE INDENT lst . sort ( ) NEW_LINE for i in range ( 1 , len ( lst ) ) : NEW_LINE INDENT if lst [ i ] != lst [ i - 1 ] : NEW_LINE INDENT return lst [ i ] NEW_LINE DEDENT DEDENT return - 1 NEW_LINE DEDENT
|
g-transeval-python_data_165
|
def any_int ( a , b , c ) : NEW_LINE INDENT if round ( a ) != a or round ( b ) != b or round ( c ) != c : NEW_LINE INDENT return False NEW_LINE DEDENT return a + b == c or a + c == b or b + c == a NEW_LINE DEDENT
|
g-transeval-python_data_166
|
def count_up_to ( n ) : NEW_LINE INDENT primes = [ ] NEW_LINE for i in range ( 2 , n ) : NEW_LINE INDENT is_prime = True NEW_LINE for j in range ( 2 , i ) : NEW_LINE INDENT if i % j == 0 : NEW_LINE INDENT is_prime = False NEW_LINE break NEW_LINE DEDENT DEDENT if is_prime : NEW_LINE INDENT primes . append ( i ) NEW_LINE DEDENT DEDENT return primes NEW_LINE DEDENT
|
g-transeval-python_data_167
|
def closest_integer ( value ) : NEW_LINE INDENT w = float ( value ) NEW_LINE return round ( w ) NEW_LINE DEDENT
|
g-transeval-python_data_168
|
def make_a_pile ( n ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( n ) : NEW_LINE INDENT result . append ( n + 2 * i ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_169
|
def words_string ( s ) : NEW_LINE INDENT current = [ ] NEW_LINE words = [ ] NEW_LINE for i in range ( len ( s ) + 1 ) : NEW_LINE INDENT if i == len ( s ) or s [ i ] == " " or s [ i ] == "," : NEW_LINE INDENT if len ( current ) > 0 : NEW_LINE INDENT words . append ( "" . join ( current ) ) NEW_LINE current . clear ( ) NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT current . append ( s [ i ] ) NEW_LINE DEDENT DEDENT return words NEW_LINE DEDENT
|
g-transeval-python_data_170
|
def rounded_avg ( n , m ) : NEW_LINE INDENT if n > m : NEW_LINE INDENT return - 1 NEW_LINE DEDENT num = ( n + m ) // 2 NEW_LINE ret = [ ] NEW_LINE while num > 0 : NEW_LINE INDENT ret . insert ( 0 , str ( num % 2 ) ) NEW_LINE num //= 2 NEW_LINE DEDENT return "" . join ( ret ) NEW_LINE DEDENT
|
g-transeval-python_data_171
|
def unique_digits ( x ) : NEW_LINE INDENT digits = [ ] NEW_LINE for n in x : NEW_LINE INDENT is_unique = True NEW_LINE for c in str ( n ) : NEW_LINE INDENT if ord ( c ) % 2 == 0 : NEW_LINE INDENT is_unique = False NEW_LINE break NEW_LINE DEDENT DEDENT if is_unique : NEW_LINE INDENT digits . append ( n ) NEW_LINE DEDENT DEDENT digits . sort ( ) NEW_LINE return digits NEW_LINE DEDENT
|
g-transeval-python_data_172
|
def count_nums ( arr ) : NEW_LINE INDENT num = 0 NEW_LINE for n in arr : NEW_LINE INDENT neg = - 1 if n < 0 else 1 NEW_LINE n = abs ( n ) NEW_LINE digits = [ ] NEW_LINE for c in str ( n ) : NEW_LINE INDENT digits . append ( ord ( c ) - ord ( "0" ) ) NEW_LINE DEDENT digits [ 0 ] *= neg NEW_LINE sum = 0 NEW_LINE for d in digits : NEW_LINE INDENT sum += d NEW_LINE DEDENT if sum > 0 : NEW_LINE INDENT num += 1 NEW_LINE DEDENT DEDENT return num NEW_LINE DEDENT
|
g-transeval-python_data_173
|
def move_one_ball ( arr ) : NEW_LINE INDENT if not arr : NEW_LINE INDENT return True NEW_LINE DEDENT num = 0 NEW_LINE for i in range ( 1 , len ( arr ) ) : NEW_LINE INDENT if arr [ i ] < arr [ i - 1 ] : NEW_LINE INDENT num += 1 NEW_LINE DEDENT DEDENT if arr [ - 1 ] > arr [ 0 ] : NEW_LINE INDENT num += 1 NEW_LINE DEDENT if num < 2 : NEW_LINE INDENT return True NEW_LINE DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_174
|
def exchange ( lst1 , lst2 ) : NEW_LINE INDENT odd = 0 NEW_LINE even = 0 NEW_LINE for n in lst1 : NEW_LINE INDENT if n % 2 == 1 : NEW_LINE INDENT odd += 1 NEW_LINE DEDENT DEDENT for n in lst2 : NEW_LINE INDENT if n % 2 == 0 : NEW_LINE INDENT even += 1 NEW_LINE DEDENT DEDENT if even >= odd : NEW_LINE INDENT return "YES" NEW_LINE DEDENT return "NO" NEW_LINE DEDENT
|
g-transeval-python_data_175
|
def odd_count ( lst ) : NEW_LINE INDENT results = [ ] NEW_LINE original_str = "the number of odd elements in the string i of the input." NEW_LINE for s in lst : NEW_LINE INDENT sum = 0 NEW_LINE for d in s : NEW_LINE INDENT if d . isdigit ( ) and ord ( d ) % 2 == 1 : NEW_LINE INDENT sum += 1 NEW_LINE DEDENT DEDENT result = [ ] NEW_LINE for c in original_str : NEW_LINE INDENT if c == "i" : NEW_LINE INDENT result . append ( str ( sum ) ) NEW_LINE DEDENT else : NEW_LINE INDENT result . append ( c ) NEW_LINE DEDENT DEDENT results . append ( "" . join ( result ) ) NEW_LINE DEDENT return results NEW_LINE DEDENT
|
g-transeval-python_data_176
|
def minSubArraySum ( nums ) : NEW_LINE INDENT min_sum = sys . maxsize NEW_LINE sum = 0 NEW_LINE for num in nums : NEW_LINE INDENT sum += num NEW_LINE if min_sum > sum : NEW_LINE INDENT min_sum = sum NEW_LINE DEDENT if sum > 0 : NEW_LINE INDENT sum = 0 NEW_LINE DEDENT DEDENT return min_sum NEW_LINE DEDENT
|
g-transeval-python_data_177
|
def max_fill ( grid , capacity ) : NEW_LINE INDENT res = 0 NEW_LINE for well in grid : NEW_LINE INDENT sum = 0 NEW_LINE for n in well : NEW_LINE INDENT sum += n NEW_LINE DEDENT if sum > 0 : NEW_LINE INDENT res += ( sum - 1 ) // capacity + 1 NEW_LINE DEDENT DEDENT return res NEW_LINE DEDENT
|
g-transeval-python_data_178
|
def select_words ( s , n ) : NEW_LINE INDENT vowels = "aeiouAEIOU" NEW_LINE current = [ ] NEW_LINE result = [ ] NEW_LINE consonant_num = 0 NEW_LINE for i in range ( len ( s ) + 1 ) : NEW_LINE INDENT if i == len ( s ) or s [ i ] == " " : NEW_LINE INDENT if consonant_num == n : NEW_LINE INDENT result . append ( "" . join ( current ) ) NEW_LINE DEDENT current . clear ( ) NEW_LINE consonant_num = 0 NEW_LINE DEDENT else : NEW_LINE INDENT current . append ( s [ i ] ) NEW_LINE if s [ i ] not in vowels : NEW_LINE INDENT consonant_num += 1 NEW_LINE DEDENT DEDENT DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_179
|
def solution ( lst ) : NEW_LINE INDENT sum = 0 NEW_LINE for i in range ( 0 , len ( lst ) , 2 ) : NEW_LINE INDENT if lst [ i ] % 2 == 1 : NEW_LINE INDENT sum += lst [ i ] NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_180
|
def add_elements ( arr , k ) : NEW_LINE INDENT sum = 0 NEW_LINE for i in range ( k ) : NEW_LINE INDENT if - 99 <= arr [ i ] <= 99 : NEW_LINE INDENT sum += arr [ i ] NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_181
|
def get_odd_collatz ( n ) : NEW_LINE INDENT odd_collatz = [ ] NEW_LINE while n > 1 : NEW_LINE INDENT if n % 2 == 1 : NEW_LINE INDENT odd_collatz . append ( n ) NEW_LINE n = n * 3 + 1 NEW_LINE DEDENT else : NEW_LINE INDENT n //= 2 NEW_LINE DEDENT DEDENT odd_collatz . append ( 1 ) NEW_LINE odd_collatz . sort ( ) NEW_LINE return odd_collatz NEW_LINE DEDENT
|
g-transeval-python_data_182
|
def is_sorted ( lst ) : NEW_LINE INDENT for i in range ( 1 , len ( lst ) ) : NEW_LINE INDENT if lst [ i ] < lst [ i - 1 ] : NEW_LINE INDENT return False NEW_LINE DEDENT if i >= 2 and lst [ i ] == lst [ i - 1 ] and lst [ i ] == lst [ i - 2 ] : NEW_LINE INDENT return False NEW_LINE DEDENT DEDENT return True NEW_LINE DEDENT
|
g-transeval-python_data_183
|
def intersection ( interval1 , interval2 ) : NEW_LINE INDENT inter1 = max ( interval1 [ 0 ] , interval2 [ 0 ] ) NEW_LINE inter2 = min ( interval1 [ 1 ] , interval2 [ 1 ] ) NEW_LINE l = inter2 - inter1 NEW_LINE if l < 2 : NEW_LINE INDENT return "NO" NEW_LINE DEDENT for i in range ( 2 , l ) : NEW_LINE INDENT if l % i == 0 : NEW_LINE INDENT return "NO" NEW_LINE DEDENT DEDENT return "YES" NEW_LINE DEDENT
|
g-transeval-python_data_184
|
def prod_signs ( arr ) : NEW_LINE INDENT if not arr : NEW_LINE INDENT return - 32768 NEW_LINE DEDENT sum = 0 NEW_LINE prods = 1 NEW_LINE for i in arr : NEW_LINE INDENT sum += abs ( i ) NEW_LINE if i == 0 : NEW_LINE INDENT prods = 0 NEW_LINE DEDENT if i < 0 : NEW_LINE INDENT prods = - prods NEW_LINE DEDENT DEDENT return sum * prods NEW_LINE DEDENT
|
g-transeval-python_data_185
|
def minPath ( grid , k ) : NEW_LINE INDENT n = len ( grid ) NEW_LINE min_num = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT for j in range ( n ) : NEW_LINE INDENT if grid [ i ] [ j ] == 1 : NEW_LINE INDENT tmp = [ ] NEW_LINE if i != 0 : NEW_LINE INDENT tmp . append ( grid [ i - 1 ] [ j ] ) NEW_LINE DEDENT if j != 0 : NEW_LINE INDENT tmp . append ( grid [ i ] [ j - 1 ] ) NEW_LINE DEDENT if i != n - 1 : NEW_LINE INDENT tmp . append ( grid [ i + 1 ] [ j ] ) NEW_LINE DEDENT if j != n - 1 : NEW_LINE INDENT tmp . append ( grid [ i ] [ j + 1 ] ) NEW_LINE DEDENT min_num = min ( tmp ) NEW_LINE DEDENT DEDENT DEDENT ans = [ ] NEW_LINE for i in range ( k ) : NEW_LINE INDENT if i % 2 == 0 : NEW_LINE INDENT ans . append ( 1 ) NEW_LINE DEDENT else : NEW_LINE INDENT ans . append ( min_num ) NEW_LINE DEDENT DEDENT return ans NEW_LINE DEDENT
|
g-transeval-python_data_186
|
def digits ( n ) : NEW_LINE INDENT prod = 1 NEW_LINE for digit in str ( n ) : NEW_LINE INDENT if ord ( digit ) % 2 == 1 : NEW_LINE INDENT if prod == 0 : NEW_LINE INDENT prod == 1 NEW_LINE DEDENT prod *= ord ( digit ) - ord ( "0" ) NEW_LINE DEDENT DEDENT return prod NEW_LINE DEDENT
|
g-transeval-python_data_187
|
def is_nested ( s ) : NEW_LINE INDENT count = 0 NEW_LINE max_count = 0 NEW_LINE for ch in s : NEW_LINE INDENT if ch == "[" : NEW_LINE INDENT count += 1 NEW_LINE DEDENT if ch == "]" : NEW_LINE INDENT count -= 1 NEW_LINE DEDENT if count < 0 : NEW_LINE INDENT count = 0 NEW_LINE DEDENT if count > max_count : NEW_LINE INDENT max_count = count NEW_LINE DEDENT if count <= max_count - 2 : NEW_LINE INDENT return True NEW_LINE DEDENT DEDENT return False NEW_LINE DEDENT
|
g-transeval-python_data_188
|
def sum_squares ( lst ) : NEW_LINE INDENT sum = 0 NEW_LINE for i in lst : NEW_LINE INDENT sum += math . ceil ( i ) * math . ceil ( i ) NEW_LINE DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_189
|
def can_arrange ( arr ) : NEW_LINE INDENT index = - 1 NEW_LINE for i in range ( len ( arr ) ) : NEW_LINE INDENT if arr [ i ] <= i : NEW_LINE INDENT index = i NEW_LINE DEDENT DEDENT return index NEW_LINE DEDENT
|
g-transeval-python_data_190
|
def largest_smallest_integers ( lst ) : NEW_LINE INDENT max_neg , min_pos = 0 , 0 NEW_LINE for n in lst : NEW_LINE INDENT if n < 0 and ( max_neg == 0 or n > max_neg ) : NEW_LINE INDENT max_neg = n NEW_LINE DEDENT if n > 0 and ( min_pos == 0 or n < min_pos ) : NEW_LINE INDENT min_pos = n NEW_LINE DEDENT DEDENT return [ max_neg , min_pos ] NEW_LINE DEDENT
|
g-transeval-python_data_191
|
def fix_spaces ( text ) : NEW_LINE INDENT res = [ ] NEW_LINE space_len = 0 NEW_LINE for i in range ( len ( text ) + 1 ) : NEW_LINE INDENT if i == len ( text ) or text [ i ] != ' ' : NEW_LINE INDENT if space_len == 1 : NEW_LINE INDENT res . append ( '_' ) NEW_LINE DEDENT if space_len == 2 : NEW_LINE INDENT res . append ( '__' ) NEW_LINE DEDENT if space_len > 2 : NEW_LINE INDENT res . append ( '-' ) NEW_LINE DEDENT space_len = 0 NEW_LINE if i != len ( text ) : NEW_LINE INDENT res . append ( text [ i ] ) NEW_LINE DEDENT DEDENT else : NEW_LINE INDENT space_len += 1 NEW_LINE DEDENT DEDENT return "" . join ( res ) NEW_LINE DEDENT
|
g-transeval-python_data_192
|
def file_name_check ( file_name ) : NEW_LINE INDENT digit_num , dot_num = 0 , 0 NEW_LINE if len ( file_name ) < 5 or not file_name [ 0 ] . isalpha ( ) : NEW_LINE INDENT return "No" NEW_LINE DEDENT suffix = file_name [ - 4 : ] NEW_LINE if suffix != ".txt" and suffix != ".exe" and suffix != ".dll" : NEW_LINE INDENT return "No" NEW_LINE DEDENT for c in file_name : NEW_LINE INDENT if c . isdigit ( ) : NEW_LINE INDENT digit_num += 1 NEW_LINE DEDENT if c == '.' : NEW_LINE INDENT dot_num += 1 NEW_LINE DEDENT DEDENT if digit_num > 3 or dot_num != 1 : NEW_LINE INDENT return "No" NEW_LINE DEDENT return "Yes" NEW_LINE DEDENT
|
g-transeval-python_data_193
|
def sum_squares ( lst ) : NEW_LINE INDENT sum = 0 NEW_LINE for i in range ( len ( lst ) ) : NEW_LINE INDENT if i % 3 == 0 : NEW_LINE INDENT sum += lst [ i ] * lst [ i ] NEW_LINE DEDENT elif i % 4 == 0 : NEW_LINE INDENT sum += lst [ i ] * lst [ i ] * lst [ i ] NEW_LINE DEDENT else : NEW_LINE INDENT sum += lst [ i ] NEW_LINE DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_194
|
def words_in_sentence ( sentence ) : NEW_LINE INDENT result = [ ] NEW_LINE current = [ ] NEW_LINE for i in range ( len ( sentence ) + 1 ) : NEW_LINE INDENT if i == len ( sentence ) or sentence [ i ] == ' ' : NEW_LINE INDENT is_prime = True NEW_LINE l = len ( current ) NEW_LINE if l < 2 : NEW_LINE INDENT is_prime = False NEW_LINE DEDENT for j in range ( 2 , l ) : NEW_LINE INDENT if l % j == 0 : NEW_LINE INDENT is_prime = False NEW_LINE break NEW_LINE DEDENT DEDENT if is_prime : NEW_LINE INDENT result . append ( "" . join ( current ) + " " ) NEW_LINE DEDENT current . clear ( ) NEW_LINE DEDENT else : NEW_LINE INDENT current . append ( sentence [ i ] ) NEW_LINE DEDENT DEDENT result = "" . join ( result ) NEW_LINE if len ( result ) > 0 : NEW_LINE INDENT result = result [ : - 1 ] NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_195
|
def simplify ( x , n ) : NEW_LINE INDENT a , b , c , d = 0 , 0 , 0 , 0 NEW_LINE for i in range ( len ( x ) ) : NEW_LINE INDENT if x [ i ] == '/' : NEW_LINE INDENT a = int ( x [ : i ] ) NEW_LINE b = int ( x [ i + 1 : ] ) NEW_LINE DEDENT DEDENT for i in range ( len ( n ) ) : NEW_LINE INDENT if n [ i ] == '/' : NEW_LINE INDENT c = int ( n [ : i ] ) NEW_LINE d = int ( n [ i + 1 : ] ) NEW_LINE DEDENT DEDENT return ( a * c ) % ( b * d ) == 0 NEW_LINE DEDENT
|
g-transeval-python_data_196
|
def specialFilter ( nums ) : NEW_LINE INDENT count = 0 NEW_LINE for num in nums : NEW_LINE INDENT if num > 10 : NEW_LINE INDENT w = str ( num ) NEW_LINE if ord ( w [ 0 ] ) % 2 == 1 and ord ( w [ - 1 ] ) % 2 == 1 : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_197
|
def get_max_triples ( n ) : NEW_LINE INDENT arr = [ ] NEW_LINE for i in range ( 1 , n + 1 ) : NEW_LINE INDENT arr . append ( i * i - i + 1 ) NEW_LINE DEDENT count = 0 NEW_LINE for i in range ( n ) : NEW_LINE INDENT for j in range ( i + 1 , n ) : NEW_LINE INDENT for k in range ( j + 1 , n ) : NEW_LINE INDENT if ( arr [ i ] + arr [ j ] + arr [ k ] ) % 3 == 0 : NEW_LINE INDENT count += 1 NEW_LINE DEDENT DEDENT DEDENT DEDENT return count NEW_LINE DEDENT
|
g-transeval-python_data_198
|
def double_the_difference ( lst ) : NEW_LINE INDENT sum = 0 NEW_LINE for d in lst : NEW_LINE INDENT num = round ( d ) NEW_LINE if d == num : NEW_LINE INDENT if num > 0 and num % 2 == 1 : NEW_LINE INDENT sum += num * num NEW_LINE DEDENT DEDENT DEDENT return sum NEW_LINE DEDENT
|
g-transeval-python_data_199
|
def compare ( game , guess ) : NEW_LINE INDENT result = [ ] NEW_LINE for i in range ( len ( game ) ) : NEW_LINE INDENT result . append ( abs ( game [ i ] - guess [ i ] ) ) NEW_LINE DEDENT return result NEW_LINE DEDENT
|
g-transeval-python_data_200
|
def strongest_extension ( class_name , extensions ) : NEW_LINE INDENT strongest = "" NEW_LINE max = - sys . maxsize NEW_LINE for extension in extensions : NEW_LINE INDENT strength = 0 NEW_LINE for chr in extension : NEW_LINE INDENT if chr . isupper ( ) : NEW_LINE INDENT strength += 1 NEW_LINE DEDENT if chr . islower ( ) : NEW_LINE INDENT strength -= 1 NEW_LINE DEDENT DEDENT if strength > max : NEW_LINE INDENT max = strength NEW_LINE strongest = extension NEW_LINE DEDENT DEDENT return class_name + "." + strongest NEW_LINE DEDENT
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.