original_code stringclasses 565
values | transformation stringclasses 24
values | transformed_code stringlengths 35 955 | label int64 0 1 | groups int64 1 971 | dataset stringclasses 1
value |
|---|---|---|---|---|---|
def min_Jumps(a, b, d):
temp = a
a = min(a, b)
b = max(temp, b)
if (d >= b):
return (d + b - 1) / b
if (d == 0):
return 0
if (d == a):
return 1
else:
return 2 | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 614 | mbpp |
def min_Jumps(a, b, d):
temp = a
a = min(a, b)
b = max(temp, b)
if (d >= b):
return (d + b - 1) / b
if (d == 0):
return 0
if (d == a):
return 1
else:
return 2 | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 614 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_dead_code_insert | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
_i_1 = 0
if _i_1 > _i_1:
m2 = arr2[j]
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
... | 1 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_for_while_loop | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
i... | 1 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_operand_swap | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while n + 1 > count:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
i... | 1 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_rename_variable_cb | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
j2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = j2
j2 = arr2[0]
break
elif j == n:
m1 = j2
j2 = arr1[0]
break
i... | 1 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_rename_variable_naive | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
VAR_0 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = VAR_0
VAR_0 = arr2[0]
break
elif j == n:
m1 = VAR_0
VAR_0 = arr1[0]
... | 1 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_rename_variable_rn | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
N4 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = N4
N4 = arr2[0]
break
elif j == n:
m1 = N4
N4 = arr1[0]
break
i... | 1 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_add_sub_variable | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n - 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_sub_add_variable | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = +1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_div_mul_variable | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_lesser_greater_variable | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count > n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_equalto_exclamation_variable | def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i != n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 619 | mbpp |
def get_median(arr1, arr2, n):
i = 0
j = 0
m1 = -1
m2 = -1
count = 0
while count < n + 1:
count += 1
if i == n:
m1 = m2
m2 = arr2[0]
break
elif j == n:
m1 = m2
m2 = arr1[0]
break
if arr1[i] <= arr2[j]:
m1 = m2
m2 = arr1[i]
i += 1
e... | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 619 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_dead_code_insert | def triangle_area(r):
if r < 0:
while False:
return -1
return -1
return r * r | 1 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_for_while_loop | def triangle_area(r):
if r < 0:
return -1
return r * r | 1 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_operand_swap | def triangle_area(r):
if 0 > r:
return -1
return r * r | 1 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_rename_variable_cb | def triangle_area(p):
if p < 0:
return -1
return p * p | 1 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_rename_variable_naive | def triangle_area(VAR_0):
if VAR_0 < 0:
return -1
return VAR_0 * VAR_0 | 1 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_rename_variable_rn | def triangle_area(O):
if O < 0:
return -1
return O * O | 1 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_sub_add_variable | def triangle_area(r) :
if r < 0 :
return +1
return r * r | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_mul_div_variable | def triangle_area(r) :
if r < 0 :
return -1
return r / r | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_lesser_greater_variable | def triangle_area(r) :
if r > 0 :
return -1
return r * r | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 623 | mbpp |
def triangle_area(r) :
if r < 0 :
return -1
return r * r | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 623 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_dead_code_insert | def find_First_Missing(array, start, end):
if start > end:
return end + 1
if start != array[start]:
_i_1 = 0
if _i_1 > _i_1:
return find_First_Missing(array, mid + 1, end)
return start
mid = int((start + end) / 2)
if array[mid] == mid:
return f... | 1 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_for_while_loop | def find_First_Missing(array, start, end):
if start > end:
return end + 1
if start != array[start]:
return start
mid = int((start + end) / 2)
if array[mid] == mid:
return find_First_Missing(array, mid + 1, end)
return find_First_Missing(array, start, mid) | 1 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_operand_swap | def find_First_Missing(array, start, end):
if end < start:
return end + 1
if start != array[start]:
return start
mid = int((start + end) / 2)
if array[mid] == mid:
return find_First_Missing(array, mid + 1, end)
return find_First_Missing(array, start, mid) | 1 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_rename_variable_cb | def find_First_Missing(array, end2, end):
if end2 > end:
return end + 1
if end2 != array[end2]:
return end2
mid = int((end2 + end) / 2)
if array[mid] == mid:
return find_First_Missing(array, mid + 1, end)
return find_First_Missing(array, end2, mid) | 1 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_rename_variable_naive | def find_First_Missing(array, VAR_0, end):
if VAR_0 > end:
return end + 1
if VAR_0 != array[VAR_0]:
return VAR_0
mid = int((VAR_0 + end) / 2)
if array[mid] == mid:
return find_First_Missing(array, mid + 1, end)
return find_First_Missing(array, VAR_0, mid) | 1 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_rename_variable_rn | def find_First_Missing(array, Z4HAa, end):
if Z4HAa > end:
return end + 1
if Z4HAa != array[Z4HAa]:
return Z4HAa
mid = int((Z4HAa + end) / 2)
if array[mid] == mid:
return find_First_Missing(array, mid + 1, end)
return find_First_Missing(array, Z4HAa, mid) | 1 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_add_sub_variable | def find_First_Missing(array,start,end):
if (start > end):
return end - 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_div_mul_variable | def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) * 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_greater_lesser_variable | def find_First_Missing(array,start,end):
if (start < end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_equalto_exclamation_variable | def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] != mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_exclamation_equalto_variable | def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start == array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 624 | mbpp |
def find_First_Missing(array,start,end):
if (start > end):
return end + 1
if (start != array[start]):
return start;
mid = int((start + end) / 2)
if (array[mid] == mid):
return find_First_Missing(array,mid+1,end)
return find_First_Missing(array,start,mid) | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 624 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_dead_code_insert | def get_coordinates(test_tup):
def adjac(ele, sub=[]):
if not ele:
while False:
return res
yield sub
else:
yield from [
idx
for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:],... | 1 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_for_while_loop | def get_coordinates(test_tup):
def adjac(ele, sub=[]):
if not ele:
yield sub
else:
yield from [
idx
for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])
]
res = list(adjac(test_... | 1 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_operand_swap | def get_coordinates(test_tup):
def adjac(ele, sub=[]):
if not ele:
yield sub
else:
yield from [
idx
for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])
]
res = list(adjac(test_... | 1 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_rename_variable_cb | def get_coordinates(test_tup):
def adjac(sub2, sub=[]):
if not sub2:
yield sub
else:
yield from [
idx
for j in range(sub2[0] - 1, sub2[0] + 2)
for idx in adjac(sub2[1:], sub + [j])
]
res = list(adjac(... | 1 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_rename_variable_naive | def get_coordinates(test_tup):
def adjac(VAR_0, sub=[]):
if not VAR_0:
yield sub
else:
yield from [
idx
for j in range(VAR_0[0] - 1, VAR_0[0] + 2)
for idx in adjac(VAR_0[1:], sub + [j])
]
res = list(a... | 1 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_rename_variable_rn | def get_coordinates(test_tup):
def adjac(v3W, sub=[]):
if not v3W:
yield sub
else:
yield from [
idx
for j in range(v3W[0] - 1, v3W[0] + 2)
for idx in adjac(v3W[1:], sub + [j])
]
res = list(adjac(test_... | 1 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_add_sub_variable | def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] - 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | 0 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_sub_add_variable | def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] + 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | 0 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 627 | mbpp |
def get_coordinates(test_tup):
def adjac(ele, sub = []):
if not ele:
yield sub
else:
yield from [idx for j in range(ele[0] - 1, ele[0] + 2)
for idx in adjac(ele[1:], sub + [j])]
res = list(adjac(test_tup))
return (res) | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 627 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_dead_code_insert | def heap_sort(iterable):
_i_3 = 0
if _i_3 > _i_3:
h = []
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | 1 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_for_while_loop | def heap_sort(iterable):
import heapq as hq
h = []
_value_i = 0
while _value_i < len(iterable):
value = iterable[_value_i]
hq.heappush(h, value)
_value_i += 1
return [hq.heappop(h) for i in range(len(h))] | 1 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_operand_swap | def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | 1 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_rename_variable_naive | def heap_sort(iterable):
import heapq as hq
VAR_0 = []
for value in iterable:
hq.heappush(VAR_0, value)
return [hq.heappop(VAR_0) for i in range(len(VAR_0))] | 1 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_rename_variable_rn | def heap_sort(iterable):
import heapq as hq
z = []
for value in iterable:
hq.heappush(z, value)
return [hq.heappop(z) for i in range(len(z))] | 1 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 632 | mbpp |
def heap_sort(iterable):
import heapq as hq
h = []
for value in iterable:
hq.heappush(h, value)
return [hq.heappop(h) for i in range(len(h))] | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 632 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_dead_code_insert | def wind_chill(v, t):
import math
_i_8 = 0
while _i_8 < _i_8:
return int(round(windchill, 0))
windchill = (
13.12 + 0.6215 * t - 11.37 * math.pow(v, 0.16) + 0.3965 * t * math.pow(v, 0.16)
)
return int(round(windchill, 0)) | 1 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_for_while_loop | def wind_chill(v, t):
import math
windchill = (
13.12 + 0.6215 * t - 11.37 * math.pow(v, 0.16) + 0.3965 * t * math.pow(v, 0.16)
)
return int(round(windchill, 0)) | 1 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_operand_swap | def wind_chill(v, t):
import math
windchill = (
13.12 + 0.6215 * t - 11.37 * math.pow(v, 0.16) + 0.3965 * t * math.pow(v, 0.16)
)
return int(round(windchill, 0)) | 1 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_rename_variable_cb | def wind_chill(t2, t):
import math
windchill = (
13.12
+ 0.6215 * t
- 11.37 * math.pow(t2, 0.16)
+ 0.3965 * t * math.pow(t2, 0.16)
)
return int(round(windchill, 0)) | 1 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_rename_variable_naive | def wind_chill(VAR_0, t):
import math
windchill = (
13.12
+ 0.6215 * t
- 11.37 * math.pow(VAR_0, 0.16)
+ 0.3965 * t * math.pow(VAR_0, 0.16)
)
return int(round(windchill, 0)) | 1 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_rename_variable_rn | def wind_chill(v, k):
import math
windchill = (
13.12 + 0.6215 * k - 11.37 * math.pow(v, 0.16) + 0.3965 * k * math.pow(v, 0.16)
)
return int(round(windchill, 0)) | 1 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_add_sub_variable | def wind_chill(v,t):
import math
windchill = 13.12 - 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_sub_add_variable | def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t + 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_mul_div_variable | def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215/t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 635 | mbpp |
def wind_chill(v,t):
import math
windchill = 13.12 + 0.6215*t - 11.37*math.pow(v, 0.16) + 0.3965*t*math.pow(v, 0.16)
return int(round(windchill, 0)) | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 635 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_dead_code_insert | def remove_parenthesis(items):
import re
for _i_6 in range(0):
return re.sub(r" ?([^)]+)", "", item)
for item in items:
return re.sub(r" ?([^)]+)", "", item) | 1 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_for_while_loop | def remove_parenthesis(items):
import re
_item_i = 0
while _item_i < len(items):
item = items[_item_i]
return re.sub(r" ?([^)]+)", "", item)
_item_i += 1 | 1 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_operand_swap | def remove_parenthesis(items):
import re
for item in items:
return re.sub(r" ?([^)]+)", "", item) | 1 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_rename_variable_cb | def remove_parenthesis(items):
import re
for s in items:
return re.sub(r" ?([^)]+)", "", s) | 1 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_rename_variable_naive | def remove_parenthesis(VAR_0):
import re
for item in VAR_0:
return re.sub(r" ?([^)]+)", "", item) | 1 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_rename_variable_rn | def remove_parenthesis(items):
import re
for z764 in items:
return re.sub(r" ?([^)]+)", "", z764) | 1 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_add_sub_variable | def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]-\)", "", item)) | 0 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_dissimilar_code_injection_0 | def min_cost(cost, m, n):
R = 3
C = 3
tc = [[0 for x in range(C)] for x in range(R)]
tc[0][0] = cost[0][0]
for i in range(1, m+1):
tc[i][0] = tc[i-1][0] + cost[i][0]
for j in range(1, n+1):
tc[0][j] = tc[0][j-1] + cost[0][j]
for i in range(1, m+1):
for j in range(1, n+1):
tc[i][j] = min(tc[i-... | 0 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_dissimilar_code_injection_2 | def is_not_prime(n):
import math
result = False
for i in range(2,int(math.sqrt(n)) + 1):
if n % i == 0:
result = True
return result | 0 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_dissimilar_code_injection_3 | def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums | 0 | 637 | mbpp |
def remove_parenthesis(items):
import re
for item in items:
return (re.sub(r" ?\([^)]+\)", "", item)) | transformation_dissimilar_code_injection_4 | def count_ways(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] | 0 | 637 | mbpp |
def is_nonagonal(n):
return int(n * (7 * n - 5) / 2) | transformation_sub_add_variable | def is_nonagonal(n):
return int(n * (7 * n + 5) / 2) | 0 | 638 | mbpp |
def is_nonagonal(n):
return int(n * (7 * n - 5) / 2) | transformation_mul_div_variable | def is_nonagonal(n):
return int(n / (7 * n - 5) / 2) | 0 | 638 | mbpp |
def is_nonagonal(n):
return int(n * (7 * n - 5) / 2) | transformation_div_mul_variable | def is_nonagonal(n):
return int(n * (7 * n - 5) * 2) | 0 | 638 | mbpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.