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 count_digits(num1,num2):
number=num1+num2
count = 0
while(number > 0):
number = number // 10
count = count + 1
return count
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 540 |
mbpp
|
def count_digits(num1,num2):
number=num1+num2
count = 0
while(number > 0):
number = number // 10
count = count + 1
return count
|
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 | 540 |
mbpp
|
def count_digits(num1,num2):
number=num1+num2
count = 0
while(number > 0):
number = number // 10
count = count + 1
return count
|
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 | 540 |
mbpp
|
def count_digits(num1,num2):
number=num1+num2
count = 0
while(number > 0):
number = number // 10
count = count + 1
return count
|
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 | 540 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in tup])
return (res)
|
transformation_dead_code_insert
|
def flatten_tuple(test_list):
if False:
return res
res = " ".join([idx for tup in test_list for idx in tup])
return res
| 1 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in tup])
return (res)
|
transformation_for_while_loop
|
def flatten_tuple(test_list):
res = " ".join([idx for tup in test_list for idx in tup])
return res
| 1 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in tup])
return (res)
|
transformation_operand_swap
|
def flatten_tuple(test_list):
res = " ".join([idx for tup in test_list for idx in tup])
return res
| 1 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in tup])
return (res)
|
transformation_rename_variable_cb
|
def flatten_tuple(test_list):
res = " ".join([x for tup in test_list for x in tup])
return res
| 1 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in tup])
return (res)
|
transformation_rename_variable_naive
|
def flatten_tuple(test_list):
res = " ".join([VAR_0 for tup in test_list for VAR_0 in tup])
return res
| 1 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in tup])
return (res)
|
transformation_rename_variable_rn
|
def flatten_tuple(dL2b094CG):
res = " ".join([idx for tup in dL2b094CG for idx in tup])
return res
| 1 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n]
| 0 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in 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 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in 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 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in 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 | 541 |
mbpp
|
def flatten_tuple(test_list):
res = ' '.join([idx for tup in test_list for idx in 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 | 541 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_dead_code_insert
|
def odd_Num_Sum(n):
j = 0
sm = 0
_i_1 = 0
while _i_1 > _i_1:
j = 2 * i - 1
for i in range(1, n + 1):
j = 2 * i - 1
sm = sm + (j * j * j * j * j)
return sm
| 1 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_for_while_loop
|
def odd_Num_Sum(n):
j = 0
sm = 0
i = 1
while i < n + 1:
j = 2 * i - 1
sm = sm + (j * j * j * j * j)
i += 1
return sm
| 1 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_operand_swap
|
def odd_Num_Sum(n):
j = 0
sm = 0
for i in range(1, n + 1):
j = 2 * i - 1
sm = sm + (j * j * j * j * j)
return sm
| 1 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_rename_variable_cb
|
def odd_Num_Sum(n):
n2 = 0
sm = 0
for i in range(1, n + 1):
n2 = 2 * i - 1
sm = sm + (n2 * n2 * n2 * n2 * n2)
return sm
| 1 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_rename_variable_naive
|
def odd_Num_Sum(n):
VAR_0 = 0
sm = 0
for i in range(1, n + 1):
VAR_0 = 2 * i - 1
sm = sm + (VAR_0 * VAR_0 * VAR_0 * VAR_0 * VAR_0)
return sm
| 1 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_rename_variable_rn
|
def odd_Num_Sum(n):
E = 0
sm = 0
for i in range(1, n + 1):
E = 2 * i - 1
sm = sm + (E * E * E * E * E)
return sm
| 1 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_add_sub_variable
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n-1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
| 0 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_sub_add_variable
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i+1)
sm = sm + (j*j*j*j*j)
return sm
| 0 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_mul_div_variable
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2/i-1)
sm = sm + (j*j*j*j*j)
return sm
| 0 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
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 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
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 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
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 | 546 |
mbpp
|
def odd_Num_Sum(n) :
j = 0
sm = 0
for i in range(1,n+1) :
j = (2*i-1)
sm = sm + (j*j*j*j*j)
return sm
|
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 | 546 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in test_tup))
return (res)
|
transformation_dead_code_insert
|
def tuple_to_float(test_tup):
_i_6 = 0
if _i_6 < _i_6:
return res
res = float(".".join(str(ele) for ele in test_tup))
return res
| 1 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in test_tup))
return (res)
|
transformation_for_while_loop
|
def tuple_to_float(test_tup):
res = float(".".join(str(ele) for ele in test_tup))
return res
| 1 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in test_tup))
return (res)
|
transformation_operand_swap
|
def tuple_to_float(test_tup):
res = float(".".join(str(ele) for ele in test_tup))
return res
| 1 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in test_tup))
return (res)
|
transformation_rename_variable_cb
|
def tuple_to_float(t):
res = float(".".join(str(ele) for ele in t))
return res
| 1 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in test_tup))
return (res)
|
transformation_rename_variable_naive
|
def tuple_to_float(test_tup):
res = float(".".join(str(VAR_0) for VAR_0 in test_tup))
return res
| 1 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in test_tup))
return (res)
|
transformation_rename_variable_rn
|
def tuple_to_float(mAj7SQ7g):
res = float(".".join(str(ele) for ele in mAj7SQ7g))
return res
| 1 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in 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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n]
| 0 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in 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 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in 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 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in 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 | 550 |
mbpp
|
def tuple_to_float(test_tup):
res = float('.'.join(str(ele) for ele in 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 | 550 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_dead_code_insert
|
def find_Odd_Pair(A, N):
oddPair = 0
for i in range(0, N):
_i_7 = 0
if _i_7 > _i_7:
return oddPair
for j in range(i + 1, N):
if (A[i] ^ A[j]) % 2 != 0:
oddPair += 1
return oddPair
| 1 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_for_while_loop
|
def find_Odd_Pair(A, N):
oddPair = 0
i = 0
while i < N:
for j in range(i + 1, N):
if (A[i] ^ A[j]) % 2 != 0:
oddPair += 1
i += 1
return oddPair
| 1 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_operand_swap
|
def find_Odd_Pair(A, N):
oddPair = 0
for i in range(0, N):
for j in range(i + 1, N):
if 0 != (A[i] ^ A[j]) % 2:
oddPair += 1
return oddPair
| 1 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_rename_variable_cb
|
def find_Odd_Pair(A, N):
oddPair = 0
for i2 in range(0, N):
for j in range(i2 + 1, N):
if (A[i2] ^ A[j]) % 2 != 0:
oddPair += 1
return oddPair
| 1 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_rename_variable_naive
|
def find_Odd_Pair(A, VAR_0):
oddPair = 0
for i in range(0, VAR_0):
for j in range(i + 1, VAR_0):
if (A[i] ^ A[j]) % 2 != 0:
oddPair += 1
return oddPair
| 1 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_rename_variable_rn
|
def find_Odd_Pair(A, N):
oddPair = 0
for I in range(0, N):
for j in range(I + 1, N):
if (A[I] ^ A[j]) % 2 != 0:
oddPair += 1
return oddPair
| 1 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_add_sub_variable
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i-1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
| 0 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_exclamation_equalto_variable
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 == 0):
oddPair+=1
return oddPair
| 0 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
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 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
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 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
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 | 553 |
mbpp
|
def find_Odd_Pair(A,N) :
oddPair = 0
for i in range(0,N) :
for j in range(i+1,N) :
if ((A[i] ^ A[j]) % 2 != 0):
oddPair+=1
return oddPair
|
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 | 553 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_dead_code_insert
|
def digit_distance_nums(n1, n2):
return sum(map(int, str(abs(n1 - n2))))
| 1 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_for_while_loop
|
def digit_distance_nums(n1, n2):
return sum(map(int, str(abs(n1 - n2))))
| 1 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_operand_swap
|
def digit_distance_nums(n1, n2):
return sum(map(int, str(abs(n1 - n2))))
| 1 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_rename_variable_cb
|
def digit_distance_nums(n1, n):
return sum(map(int, str(abs(n1 - n))))
| 1 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_rename_variable_naive
|
def digit_distance_nums(VAR_0, n2):
return sum(map(int, str(abs(VAR_0 - n2))))
| 1 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_rename_variable_rn
|
def digit_distance_nums(n1, UC):
return sum(map(int, str(abs(n1 - UC))))
| 1 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_sub_add_variable
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1+n2))))
| 0 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
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 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
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 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
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 | 555 |
mbpp
|
def digit_distance_nums(n1, n2):
return sum(map(int,str(abs(n1-n2))))
|
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 | 555 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_dead_code_insert
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if False:
if max_ending_here < 0:
max_ending_here = 0
elif max_so_far < max_ending_here:
max_so_far = max_ending_here
if max_ending_here < 0:
max_ending_here = 0
elif max_so_far < max_ending_here:
max_so_far = max_ending_here
return max_so_far
| 1 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_for_while_loop
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
i = 0
while i < size:
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif max_so_far < max_ending_here:
max_so_far = max_ending_here
i += 1
return max_so_far
| 1 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_operand_swap
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if 0 > max_ending_here:
max_ending_here = 0
elif max_so_far < max_ending_here:
max_so_far = max_ending_here
return max_so_far
| 1 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_rename_variable_cb
|
def max_sub_array_sum(a, size):
max_so_far = 0
i2 = 0
for i in range(0, size):
i2 = i2 + a[i]
if i2 < 0:
i2 = 0
elif max_so_far < i2:
max_so_far = i2
return max_so_far
| 1 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_rename_variable_naive
|
def max_sub_array_sum(a, size):
max_so_far = 0
VAR_0 = 0
for i in range(0, size):
VAR_0 = VAR_0 + a[i]
if VAR_0 < 0:
VAR_0 = 0
elif max_so_far < VAR_0:
max_so_far = VAR_0
return max_so_far
| 1 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_rename_variable_rn
|
def max_sub_array_sum(a, size):
max_so_far = 0
LhGQ215O3I857u3 = 0
for i in range(0, size):
LhGQ215O3I857u3 = LhGQ215O3I857u3 + a[i]
if LhGQ215O3I857u3 < 0:
LhGQ215O3I857u3 = 0
elif max_so_far < LhGQ215O3I857u3:
max_so_far = LhGQ215O3I857u3
return max_so_far
| 1 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_add_sub_variable
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here - a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
| 0 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_lesser_greater_variable
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here > 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
| 0 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
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 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
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 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
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 | 556 |
mbpp
|
def max_sub_array_sum(a, size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_ending_here < 0:
max_ending_here = 0
elif (max_so_far < max_ending_here):
max_so_far = max_ending_here
return max_so_far
|
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 | 556 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_dead_code_insert
|
def extract_values(text):
import re
for _i_5 in range(0):
return re.findall(r'"(.*?)"', text)
return re.findall(r'"(.*?)"', text)
| 1 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_for_while_loop
|
def extract_values(text):
import re
return re.findall(r'"(.*?)"', text)
| 1 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_operand_swap
|
def extract_values(text):
import re
return re.findall(r'"(.*?)"', text)
| 1 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_rename_variable_cb
|
def extract_values(lines):
import re
return re.findall(r'"(.*?)"', lines)
| 1 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_rename_variable_naive
|
def extract_values(VAR_0):
import re
return re.findall(r'"(.*?)"', VAR_0)
| 1 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_rename_variable_rn
|
def extract_values(u882):
import re
return re.findall(r'"(.*?)"', u882)
| 1 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_mul_div_variable
|
def extract_values(text):
import re
return (re.findall(r'"(./?)"', text))
| 0 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
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 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
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 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
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 | 560 |
mbpp
|
def extract_values(text):
import re
return (re.findall(r'"(.*?)"', text))
|
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 | 560 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_dead_code_insert
|
def count_Pairs(arr, n):
_i_1 = 0
while _i_1 < _i_1:
cnt = 0
cnt = 0
for i in range(n):
for j in range(i + 1, n):
if arr[i] != arr[j]:
cnt += 1
return cnt
| 1 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_for_while_loop
|
def count_Pairs(arr, n):
cnt = 0
i = 0
while i < n:
for j in range(i + 1, n):
if arr[i] != arr[j]:
cnt += 1
i += 1
return cnt
| 1 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_operand_swap
|
def count_Pairs(arr, n):
cnt = 0
for i in range(n):
for j in range(i + 1, n):
if arr[j] != arr[i]:
cnt += 1
return cnt
| 1 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_rename_variable_cb
|
def count_Pairs(arr, n):
cnt = 0
for j2 in range(n):
for j in range(j2 + 1, n):
if arr[j2] != arr[j]:
cnt += 1
return cnt
| 1 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_rename_variable_naive
|
def count_Pairs(arr, VAR_0):
cnt = 0
for i in range(VAR_0):
for j in range(i + 1, VAR_0):
if arr[i] != arr[j]:
cnt += 1
return cnt
| 1 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_rename_variable_rn
|
def count_Pairs(hm6, n):
cnt = 0
for i in range(n):
for j in range(i + 1, n):
if hm6[i] != hm6[j]:
cnt += 1
return cnt
| 1 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_add_sub_variable
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i - 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
| 0 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_exclamation_equalto_variable
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] == arr[j]):
cnt += 1;
return cnt;
| 0 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
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 | 561 |
mbpp
|
def count_Pairs(arr,n):
cnt = 0;
for i in range(n):
for j in range(i + 1,n):
if (arr[i] != arr[j]):
cnt += 1;
return cnt;
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 561 |
mbpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.