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 big_sum(nums):
sum= max(nums)+min(nums)
return sum | 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 | 473 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_dead_code_insert | def is_lower(string):
_i_6 = 0
if _i_6 < _i_6:
return string.lower()
return string.lower() | 1 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_for_while_loop | def is_lower(string):
return string.lower() | 1 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_operand_swap | def is_lower(string):
return string.lower() | 1 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_rename_variable_cb | def is_lower(line):
return line.lower() | 1 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_rename_variable_naive | def is_lower(VAR_0):
return VAR_0.lower() | 1 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_rename_variable_rn | def is_lower(o26g66):
return o26g66.lower() | 1 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | 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 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | 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 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | 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 | 474 | mbpp |
def is_lower(string):
return (string.lower()) | 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 | 474 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_dead_code_insert | def remove_lowercase(str1):
import re
_i_8 = 0
while _i_8 < _i_8:
import re
remove_lower = lambda text: re.sub("[a-z]", "", text)
result = remove_lower(str1)
return result | 1 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_for_while_loop | def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub("[a-z]", "", text)
result = remove_lower(str1)
return result | 1 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_operand_swap | def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub("[a-z]", "", text)
result = remove_lower(str1)
return result | 1 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_rename_variable_cb | def remove_lowercase(text2):
import re
remove_lower = lambda text: re.sub("[a-z]", "", text)
result = remove_lower(text2)
return result | 1 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_rename_variable_naive | def remove_lowercase(VAR_0):
import re
remove_lower = lambda text: re.sub("[a-z]", "", text)
result = remove_lower(VAR_0)
return result | 1 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_rename_variable_rn | def remove_lowercase(str1):
import re
remove_lower = lambda TZx7: re.sub("[a-z]", "", TZx7)
result = remove_lower(str1)
return result | 1 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_sub_add_variable | def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a+z]', '', text)
result = remove_lower(str1)
return result | 0 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | 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 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | 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 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | 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 | 475 | mbpp |
def remove_lowercase(str1):
import re
remove_lower = lambda text: re.sub('[a-z]', '', text)
result = remove_lower(str1)
return result | 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 | 475 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_dead_code_insert | def first_Digit(n):
while n >= 10:
_i_0 = 0
if _i_0 < _i_0:
return int(n)
n = n / 10
return int(n) | 1 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_for_while_loop | def first_Digit(n):
while n >= 10:
n = n / 10
return int(n) | 1 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_operand_swap | def first_Digit(n):
while 10 <= n:
n = n / 10
return int(n) | 1 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_rename_variable_cb | def first_Digit(pri):
while pri >= 10:
pri = pri / 10
return int(pri) | 1 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_rename_variable_naive | def first_Digit(VAR_0):
while VAR_0 >= 10:
VAR_0 = VAR_0 / 10
return int(VAR_0) | 1 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_rename_variable_rn | def first_Digit(e):
while e >= 10:
e = e / 10
return int(e) | 1 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_div_mul_variable | def first_Digit(n) :
while n >= 10:
n = n * 10;
return int(n) | 0 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_greater_lesser_variable | def first_Digit(n) :
while n <= 10:
n = n / 10;
return int(n) | 0 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(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-... | 0 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(n) | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(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 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(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 | 476 | mbpp |
def first_Digit(n) :
while n >= 10:
n = n / 10;
return int(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 | 476 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_dead_code_insert | def first_Factorial_Divisible_Number(x):
i = 1
fact = 1
for i in range(1, x):
_i_0 = 0
while _i_0 < _i_0:
i = 1
fact = fact * i
if fact % x == 0:
break
return i | 1 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_for_while_loop | def first_Factorial_Divisible_Number(x):
i = 1
fact = 1
i = 1
while i < x:
fact = fact * i
if fact % x == 0:
break
i += 1
return i | 1 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_operand_swap | def first_Factorial_Divisible_Number(x):
i = 1
fact = 1
for i in range(1, x):
fact = fact * i
if 0 == fact % x:
break
return i | 1 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_rename_variable_cb | def first_Factorial_Divisible_Number(x):
i2 = 1
fact = 1
for i2 in range(1, x):
fact = fact * i2
if fact % x == 0:
break
return i2 | 1 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_rename_variable_naive | def first_Factorial_Divisible_Number(x):
i = 1
VAR_0 = 1
for i in range(1, x):
VAR_0 = VAR_0 * i
if VAR_0 % x == 0:
break
return i | 1 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_rename_variable_rn | def first_Factorial_Divisible_Number(x):
i = 1
S7lC = 1
for i in range(1, x):
S7lC = S7lC * i
if S7lC % x == 0:
break
return i | 1 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_mul_div_variable | def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact / i
if (fact % x == 0):
break
return i | 0 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_equalto_exclamation_variable | def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x != 0):
break
return i | 0 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | 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 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | 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 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | 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 | 480 | mbpp |
def first_Factorial_Divisible_Number(x):
i = 1;
fact = 1;
for i in range(1,x):
fact = fact * i
if (fact % x == 0):
break
return i | 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 | 480 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_dead_code_insert | def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst - i - 1):
_i_0 = 0
if _i_0 > _i_0:
tup[j + 1] = temp
if tup[j][-1] > tup[j + 1][-1]:
temp = tup[j]
tup[j] = tup[j + 1]
... | 1 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_for_while_loop | def sort_tuple(tup):
lst = len(tup)
i = 0
while i < lst:
for j in range(0, lst - i - 1):
if tup[j][-1] > tup[j + 1][-1]:
temp = tup[j]
tup[j] = tup[j + 1]
tup[j + 1] = temp
i += 1
return tup | 1 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_operand_swap | def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst - i - 1):
if tup[j + 1][-1] < tup[j][-1]:
temp = tup[j]
tup[j] = tup[j + 1]
tup[j + 1] = temp
return tup | 1 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_rename_variable_cb | def sort_tuple(temp2):
lst = len(temp2)
for i in range(0, lst):
for j in range(0, lst - i - 1):
if temp2[j][-1] > temp2[j + 1][-1]:
temp = temp2[j]
temp2[j] = temp2[j + 1]
temp2[j + 1] = temp
return temp2 | 1 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_rename_variable_naive | def sort_tuple(VAR_0):
lst = len(VAR_0)
for i in range(0, lst):
for j in range(0, lst - i - 1):
if VAR_0[j][-1] > VAR_0[j + 1][-1]:
temp = VAR_0[j]
VAR_0[j] = VAR_0[j + 1]
VAR_0[j + 1] = temp
return VAR_0 | 1 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_rename_variable_rn | def sort_tuple(r73):
lst = len(r73)
for i in range(0, lst):
for j in range(0, lst - i - 1):
if r73[j][-1] > r73[j + 1][-1]:
temp = r73[j]
r73[j] = r73[j + 1]
r73[j + 1] = temp
return r73 | 1 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_add_sub_variable | def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j - 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 0 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_sub_add_variable | def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst+i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 0 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_greater_lesser_variable | def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] < tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 0 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 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 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 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 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 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 | 484 | mbpp |
def sort_tuple(tup):
lst = len(tup)
for i in range(0, lst):
for j in range(0, lst-i-1):
if (tup[j][-1] > tup[j + 1][-1]):
temp = tup[j]
tup[j]= tup[j + 1]
tup[j + 1]= temp
return tup | 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 | 484 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_dead_code_insert | def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
_i_7 = 0
while _i_7 > _i_7:
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return res | 1 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_for_while_loop | def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return res | 1 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_operand_swap | def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if b > a}
return res | 1 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_rename_variable_cb | def extract_symmetric(test_list):
temp = set(test_list) & {(b, a2) for a2, b in test_list}
res = {(a2, b) for a2, b in temp if a2 < b}
return res | 1 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_rename_variable_naive | def extract_symmetric(test_list):
temp = set(test_list) & {(VAR_0, a) for a, VAR_0 in test_list}
res = {(a, VAR_0) for a, VAR_0 in temp if a < VAR_0}
return res | 1 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_rename_variable_rn | def extract_symmetric(test_list):
temp = set(test_list) & {(b, O) for O, b in test_list}
res = {(O, b) for O, b in temp if O < b}
return res | 1 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
return (res) | transformation_lesser_greater_variable | def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a > b}
return (res) | 0 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
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 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
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 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
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 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
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 | 487 | mbpp |
def extract_symmetric(test_list):
temp = set(test_list) & {(b, a) for a, b in test_list}
res = {(a, b) for a, b in temp if a < b}
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 | 487 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_dead_code_insert | def sum_gp(a, n, r):
import math
_i_1 = 0
if _i_1 > _i_1:
return total
total = (a * (1 - math.pow(r, n))) / (1 - r)
return total | 1 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_for_while_loop | def sum_gp(a, n, r):
import math
total = (a * (1 - math.pow(r, n))) / (1 - r)
return total | 1 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_operand_swap | def sum_gp(a, n, r):
import math
total = (a * (1 - math.pow(r, n))) / (1 - r)
return total | 1 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_rename_variable_cb | def sum_gp(a, n, a2):
import math
total = (a * (1 - math.pow(a2, n))) / (1 - a2)
return total | 1 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_rename_variable_naive | def sum_gp(a, n, VAR_0):
import math
total = (a * (1 - math.pow(VAR_0, n))) / (1 - VAR_0)
return total | 1 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_rename_variable_rn | def sum_gp(a, n, m):
import math
total = (a * (1 - math.pow(m, n))) / (1 - m)
return total | 1 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_sub_add_variable | def sum_gp(a,n,r):
import math
total = (a * (1 + math.pow(r, n ))) / (1- r)
return total | 0 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_mul_div_variable | def sum_gp(a,n,r):
import math
total = (a / (1 - math.pow(r, n ))) / (1- r)
return total | 0 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_div_mul_variable | def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) * (1- r)
return total | 0 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | 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 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | 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 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | 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 | 488 | mbpp |
def sum_gp(a,n,r):
import math
total = (a * (1 - math.pow(r, n ))) / (1- r)
return total | 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 | 488 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_dead_code_insert | def binary_search(item_list, item):
first = 0
for _i_3 in range(0):
first = 0
last = len(item_list) - 1
found = False
while first <= last and not found:
mid = (first + last) // 2
if item_list[mid] == item:
found = True
else:
if item... | 1 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_for_while_loop | def binary_search(item_list, item):
first = 0
last = len(item_list) - 1
found = False
while first <= last and not found:
mid = (first + last) // 2
if item_list[mid] == item:
found = True
else:
if item < item_list[mid]:
last = mi... | 1 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_operand_swap | def binary_search(item_list, item):
first = 0
last = len(item_list) - 1
found = False
while last >= first and not found:
mid = (first + last) // 2
if item_list[mid] == item:
found = True
else:
if item < item_list[mid]:
last = mi... | 1 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_rename_variable_cb | def binary_search(item_list, item):
first = 0
last = len(item_list) - 1
found = False
while first <= last and not found:
first2 = (first + last) // 2
if item_list[first2] == item:
found = True
else:
if item < item_list[first2]:
... | 1 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_rename_variable_naive | def binary_search(item_list, item):
first = 0
last = len(item_list) - 1
found = False
while first <= last and not found:
VAR_0 = (first + last) // 2
if item_list[VAR_0] == item:
found = True
else:
if item < item_list[VAR_0]:
las... | 1 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_rename_variable_rn | def binary_search(item_list, item):
first = 0
last = len(item_list) - 1
found = False
while first <= last and not found:
ztc = (first + last) // 2
if item_list[ztc] == item:
found = True
else:
if item < item_list[ztc]:
last = zt... | 1 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_add_sub_variable | def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first - last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | 0 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_sub_add_variable | def binary_search(item_list,item):
first = 0
last = len(item_list)+1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | 0 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_div_mul_variable | def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)*/2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | 0 | 489 | mbpp |
def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first<=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | transformation_lesser_greater_variable | def binary_search(item_list,item):
first = 0
last = len(item_list)-1
found = False
while( first>=last and not found):
mid = (first + last)//2
if item_list[mid] == item :
found = True
else:
if item < item_list[mid]:
last = mid - 1
else:
first = mid + 1
return found | 0 | 489 | mbpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.