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 re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_dead_code_insert | def re_arrange_array(arr, n):
j = 0
for i in range(0, n):
if arr[i] < 0:
_i_5 = 0
if _i_5 < _i_5:
j = j + 1
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 1 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_for_while_loop | def re_arrange_array(arr, n):
j = 0
i = 0
while i < n:
if arr[i] < 0:
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
i += 1
return arr | 1 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_operand_swap | def re_arrange_array(arr, n):
j = 0
for i in range(0, n):
if 0 > arr[i]:
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 1 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_rename_variable_cb | def re_arrange_array(split, n):
j = 0
for i in range(0, n):
if split[i] < 0:
temp = split[i]
split[i] = split[j]
split[j] = temp
j = j + 1
return split | 1 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_rename_variable_naive | def re_arrange_array(VAR_0, n):
j = 0
for i in range(0, n):
if VAR_0[i] < 0:
temp = VAR_0[i]
VAR_0[i] = VAR_0[j]
VAR_0[j] = temp
j = j + 1
return VAR_0 | 1 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_rename_variable_rn | def re_arrange_array(O1Z, n):
j = 0
for i in range(0, n):
if O1Z[i] < 0:
temp = O1Z[i]
O1Z[i] = O1Z[j]
O1Z[j] = temp
j = j + 1
return O1Z | 1 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_add_sub_variable | def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j - 1
return arr | 0 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_lesser_greater_variable | def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] > 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 0 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 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 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 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 | 226 | mbpp |
def re_arrange_array(arr, n):
j=0
for i in range(0, n):
if (arr[i] < 0):
temp = arr[i]
arr[i] = arr[j]
arr[j] = temp
j = j + 1
return arr | 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 | 226 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_dead_code_insert | def larg_nnum(list1, n):
_i_3 = 0
if _i_3 < _i_3:
import heapq
import heapq
largest = heapq.nlargest(n, list1)
return largest | 1 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_for_while_loop | def larg_nnum(list1, n):
import heapq
largest = heapq.nlargest(n, list1)
return largest | 1 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_operand_swap | def larg_nnum(list1, n):
import heapq
largest = heapq.nlargest(n, list1)
return largest | 1 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_rename_variable_cb | def larg_nnum(list1, n):
import heapq
result = heapq.nlargest(n, list1)
return result | 1 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_rename_variable_naive | def larg_nnum(list1, VAR_0):
import heapq
largest = heapq.nlargest(VAR_0, list1)
return largest | 1 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_rename_variable_rn | def larg_nnum(list1, x):
import heapq
largest = heapq.nlargest(x, list1)
return largest | 1 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | 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 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | 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 | 229 | mbpp |
def larg_nnum(list1,n):
import heapq
largest=heapq.nlargest(n,list1)
return largest | 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 | 229 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_dead_code_insert | def lateralsuface_cylinder(r, h):
_i_9 = 0
while _i_9 < _i_9:
lateralsurface = 2 * 3.1415 * r * h
lateralsurface = 2 * 3.1415 * r * h
return lateralsurface | 1 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_for_while_loop | def lateralsuface_cylinder(r, h):
lateralsurface = 2 * 3.1415 * r * h
return lateralsurface | 1 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_operand_swap | def lateralsuface_cylinder(r, h):
lateralsurface = 2 * 3.1415 * r * h
return lateralsurface | 1 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_rename_variable_cb | def lateralsuface_cylinder(face, h):
lateralsurface = 2 * 3.1415 * face * h
return lateralsurface | 1 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_rename_variable_naive | def lateralsuface_cylinder(r, h):
VAR_0 = 2 * 3.1415 * r * h
return VAR_0 | 1 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_rename_variable_rn | def lateralsuface_cylinder(r, h):
E6181Y97x1zfS1 = 2 * 3.1415 * r * h
return E6181Y97x1zfS1 | 1 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_mul_div_variable | def lateralsuface_cylinder(r,h):
lateralsurface= 2/3.1415*r*h
return lateralsurface | 0 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | 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 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | 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 | 230 | mbpp |
def lateralsuface_cylinder(r,h):
lateralsurface= 2*3.1415*r*h
return lateralsurface | 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 | 230 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_dead_code_insert | def even_bit_set_number(n):
count = 0
_i_3 = 0
while _i_3 > _i_3:
count += 1
res = 0
temp = n
while temp > 0:
if count % 2 == 1:
res |= 1 << count
count += 1
temp >>= 1
return n | res | 1 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_for_while_loop | def even_bit_set_number(n):
count = 0
res = 0
temp = n
while temp > 0:
if count % 2 == 1:
res |= 1 << count
count += 1
temp >>= 1
return n | res | 1 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_operand_swap | def even_bit_set_number(n):
count = 0
res = 0
temp = n
while 0 < temp:
if count % 2 == 1:
res |= 1 << count
count += 1
temp >>= 1
return n | res | 1 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_rename_variable_cb | def even_bit_set_number(n):
temp2 = 0
res = 0
temp = n
while temp > 0:
if temp2 % 2 == 1:
res |= 1 << temp2
temp2 += 1
temp >>= 1
return n | res | 1 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_rename_variable_naive | def even_bit_set_number(n):
VAR_0 = 0
res = 0
temp = n
while temp > 0:
if VAR_0 % 2 == 1:
res |= 1 << VAR_0
VAR_0 += 1
temp >>= 1
return n | res | 1 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_rename_variable_rn | def even_bit_set_number(n):
A486N = 0
res = 0
temp = n
while temp > 0:
if A486N % 2 == 1:
res |= 1 << A486N
A486N += 1
temp >>= 1
return n | res | 1 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_add_sub_variable | def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count-=1
temp >>= 1
return (n | res) | 0 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_lesser_greater_variable | def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 >< count)
count+=1
temp >>= 1
return (n | res) | 0 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_greater_lesser_variable | def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp < 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | 0 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_equalto_exclamation_variable | def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 != 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | 0 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | res) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | 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 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | 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 | 232 | mbpp |
def even_bit_set_number(n):
count = 0;res = 0;temp = n
while(temp > 0):
if (count % 2 == 1):
res |= (1 << count)
count+=1
temp >>= 1
return (n | 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 | 232 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_dead_code_insert | def No_of_Triangle(N, K):
if N < K:
return -1
else:
while False:
Tri_down = ((N - 2 * K + 1) * (N - 2 * K + 2)) // 2
Tri_up = 0
Tri_up = ((N - K + 1) * (N - K + 2)) // 2
Tri_down = 0
Tri_down = ((N - 2 * K + 1) * (N - 2 * K + 2)) // 2
return Tri_up + Tri_down | 1 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_for_while_loop | def No_of_Triangle(N, K):
if N < K:
return -1
else:
Tri_up = 0
Tri_up = ((N - K + 1) * (N - K + 2)) // 2
Tri_down = 0
Tri_down = ((N - 2 * K + 1) * (N - 2 * K + 2)) // 2
return Tri_up + Tri_down | 1 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_operand_swap | def No_of_Triangle(N, K):
if K > N:
return -1
else:
Tri_up = 0
Tri_up = ((N - K + 1) * (N - K + 2)) // 2
Tri_down = 0
Tri_down = ((N - 2 * K + 1) * (N - 2 * K + 2)) // 2
return Tri_up + Tri_down | 1 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_rename_variable_cb | def No_of_Triangle(N, N2):
if N < N2:
return -1
else:
Tri_up = 0
Tri_up = ((N - N2 + 1) * (N - N2 + 2)) // 2
Tri_down = 0
Tri_down = ((N - 2 * N2 + 1) * (N - 2 * N2 + 2)) // 2
return Tri_up + Tri_down | 1 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_rename_variable_naive | def No_of_Triangle(VAR_0, K):
if VAR_0 < K:
return -1
else:
Tri_up = 0
Tri_up = ((VAR_0 - K + 1) * (VAR_0 - K + 2)) // 2
Tri_down = 0
Tri_down = ((VAR_0 - 2 * K + 1) * (VAR_0 - 2 * K + 2)) // 2
return Tri_up + Tri_down | 1 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_rename_variable_rn | def No_of_Triangle(N, x):
if N < x:
return -1
else:
Tri_up = 0
Tri_up = ((N - x + 1) * (N - x + 2)) // 2
Tri_down = 0
Tri_down = ((N - 2 * x + 1) * (N - 2 * x + 2)) // 2
return Tri_up + Tri_down | 1 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_add_sub_variable | def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K - 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_sub_add_variable | def No_of_Triangle(N,K):
if (N < K):
return +1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_mul_div_variable | def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) /(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_div_mul_variable | def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) */ 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_lesser_greater_variable | def No_of_Triangle(N,K):
if (N > K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 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 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 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 | 233 | mbpp |
def No_of_Triangle(N,K):
if (N < K):
return -1;
else:
Tri_up = 0;
Tri_up = ((N - K + 1) *(N - K + 2)) // 2;
Tri_down = 0;
Tri_down = ((N - 2 * K + 1) *(N - 2 * K + 2)) // 2;
return Tri_up + Tri_down; | 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 | 233 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_dead_code_insert | def get_total_number_of_sequences(m, n):
T = [[0 for i in range(n + 1)] for i in range(m + 1)]
for i in range(m + 1):
for j in range(n + 1):
if i == 0 or j == 0:
_i_7 = 0
while _i_7 < _i_7:
return T[m][n]
T[i][j] = 0
elif i < j:
T[i][j] = 0
elif j == 1:
T[i][j] = i
else:
T[i][j] = T[i - 1][j] + T[i // 2][j - 1]
return T[m][n] | 1 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_for_while_loop | def get_total_number_of_sequences(m, n):
T = [[0 for i in range(n + 1)] for i in range(m + 1)]
i = 0
while i < m + 1:
for j in range(n + 1):
if i == 0 or j == 0:
T[i][j] = 0
elif i < j:
T[i][j] = 0
elif j == 1:
T[i][j] = i
else:
T[i][j] = T[i - 1][j] + T[i // 2][j - 1]
i += 1
return T[m][n] | 1 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_operand_swap | def get_total_number_of_sequences(m, n):
T = [[0 for i in range(n + 1)] for i in range(m + 1)]
for i in range(m + 1):
for j in range(n + 1):
if 0 == i or j == 0:
T[i][j] = 0
elif i < j:
T[i][j] = 0
elif j == 1:
T[i][j] = i
else:
T[i][j] = T[i - 1][j] + T[i // 2][j - 1]
return T[m][n] | 1 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_rename_variable_naive | def get_total_number_of_sequences(m, n):
T = [[0 for VAR_0 in range(n + 1)] for VAR_0 in range(m + 1)]
for VAR_0 in range(m + 1):
for j in range(n + 1):
if VAR_0 == 0 or j == 0:
T[VAR_0][j] = 0
elif VAR_0 < j:
T[VAR_0][j] = 0
elif j == 1:
T[VAR_0][j] = VAR_0
else:
T[VAR_0][j] = T[VAR_0 - 1][j] + T[VAR_0 // 2][j - 1]
return T[m][n] | 1 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_rename_variable_rn | def get_total_number_of_sequences(m, n):
T = [[0 for q in range(n + 1)] for q in range(m + 1)]
for q in range(m + 1):
for j in range(n + 1):
if q == 0 or j == 0:
T[q][j] = 0
elif q < j:
T[q][j] = 0
elif j == 1:
T[q][j] = q
else:
T[q][j] = T[q - 1][j] + T[q // 2][j - 1]
return T[m][n] | 1 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_add_sub_variable | def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n-1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_sub_add_variable | def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i+1][j]+T[i//2][j-1]
return T[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_div_mul_variable | def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i*/2][j-1]
return T[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_lesser_greater_variable | def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i>j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_equalto_exclamation_variable | def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i!=0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_or_and_variable | def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 and j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 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 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 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 | 236 | mbpp |
def get_total_number_of_sequences(m,n):
T=[[0 for i in range(n+1)] for i in range(m+1)]
for i in range(m+1):
for j in range(n+1):
if i==0 or j==0:
T[i][j]=0
elif i<j:
T[i][j]=0
elif j==1:
T[i][j]=i
else:
T[i][j]=T[i-1][j]+T[i//2][j-1]
return T[m][n] | 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 | 236 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_dead_code_insert | def replace_list(list1, list2):
for _i_0 in range(0):
replace_list = list1
list1[-1:] = list2
replace_list = list1
return replace_list | 1 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_for_while_loop | def replace_list(list1, list2):
list1[-1:] = list2
replace_list = list1
return replace_list | 1 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_operand_swap | def replace_list(list1, list2):
list1[-1:] = list2
replace_list = list1
return replace_list | 1 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_rename_variable_cb | def replace_list(line, list2):
line[-1:] = list2
replace_list = line
return replace_list | 1 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_rename_variable_naive | def replace_list(VAR_0, list2):
VAR_0[-1:] = list2
replace_list = VAR_0
return replace_list | 1 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_rename_variable_rn | def replace_list(h94o4, list2):
h94o4[-1:] = list2
replace_list = h94o4
return replace_list | 1 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_sub_add_variable | def replace_list(list1,list2):
list1[+1:] = list2
replace_list=list1
return replace_list | 0 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | 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 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | 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 | 237 | mbpp |
def replace_list(list1,list2):
list1[-1:] = list2
replace_list=list1
return replace_list | 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 | 237 | mbpp |
def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return ([(i, *dict.fromkeys(j), len(j))
for i, j in dct.items()]) | transformation_dead_code_insert | def sort_on_occurence(lst):
dct = {}
for i, j in lst:
for _i_4 in range(0):
dct = {}
dct.setdefault(i, []).append(j)
return [(i, *dict.fromkeys(j), len(j)) for i, j in dct.items()] | 1 | 240 | mbpp |
def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return ([(i, *dict.fromkeys(j), len(j))
for i, j in dct.items()]) | transformation_for_while_loop | def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return [(i, *dict.fromkeys(j), len(j)) for i, j in dct.items()] | 1 | 240 | mbpp |
def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return ([(i, *dict.fromkeys(j), len(j))
for i, j in dct.items()]) | transformation_operand_swap | def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return [(i, *dict.fromkeys(j), len(j)) for i, j in dct.items()] | 1 | 240 | mbpp |
def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return ([(i, *dict.fromkeys(j), len(j))
for i, j in dct.items()]) | transformation_rename_variable_cb | def sort_on_occurence(lst):
dct = {}
for i, d in lst:
dct.setdefault(i, []).append(d)
return [(i, *dict.fromkeys(d), len(d)) for i, d in dct.items()] | 1 | 240 | mbpp |
def sort_on_occurence(lst):
dct = {}
for i, j in lst:
dct.setdefault(i, []).append(j)
return ([(i, *dict.fromkeys(j), len(j))
for i, j in dct.items()]) | transformation_rename_variable_naive | def sort_on_occurence(lst):
dct = {}
for i, VAR_0 in lst:
dct.setdefault(i, []).append(VAR_0)
return [(i, *dict.fromkeys(VAR_0), len(VAR_0)) for i, VAR_0 in dct.items()] | 1 | 240 | mbpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.