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 find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_rename_variable_cb
|
def find_rotation_count(right2):
(left, right) = (0, len(right2) - 1)
while left <= right:
if right2[left] <= right2[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(right2)
prev = (mid - 1 + len(right2)) % len(right2)
if right2[mid] <= right2[next] and right2[mid] <= right2[prev]:
return mid
elif right2[mid] <= right2[right]:
right = mid - 1
elif right2[mid] >= right2[left]:
left = mid + 1
return -1
| 1 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_rename_variable_naive
|
def find_rotation_count(VAR_0):
(left, right) = (0, len(VAR_0) - 1)
while left <= right:
if VAR_0[left] <= VAR_0[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(VAR_0)
prev = (mid - 1 + len(VAR_0)) % len(VAR_0)
if VAR_0[mid] <= VAR_0[next] and VAR_0[mid] <= VAR_0[prev]:
return mid
elif VAR_0[mid] <= VAR_0[right]:
right = mid - 1
elif VAR_0[mid] >= VAR_0[left]:
left = mid + 1
return -1
| 1 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_rename_variable_rn
|
def find_rotation_count(c):
(left, right) = (0, len(c) - 1)
while left <= right:
if c[left] <= c[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(c)
prev = (mid - 1 + len(c)) % len(c)
if c[mid] <= c[next] and c[mid] <= c[prev]:
return mid
elif c[mid] <= c[right]:
right = mid - 1
elif c[mid] >= c[left]:
left = mid + 1
return -1
| 1 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_add_sub_variable
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left - right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_sub_add_variable
|
def find_rotation_count(A):
(left, right) = (0, len(A) + 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_div_mul_variable
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) */ 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_lesser_greater_variable
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left >= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_greater_lesser_variable
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] <= A[left]:
left = mid + 1
return -1
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_and_or_variable
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] or A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
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 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
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 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
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 | 379 |
mbpp
|
def find_rotation_count(A):
(left, right) = (0, len(A) - 1)
while left <= right:
if A[left] <= A[right]:
return left
mid = (left + right) // 2
next = (mid + 1) % len(A)
prev = (mid - 1 + len(A)) % len(A)
if A[mid] <= A[next] and A[mid] <= A[prev]:
return mid
elif A[mid] <= A[right]:
right = mid - 1
elif A[mid] >= A[left]:
left = mid + 1
return -1
|
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 | 379 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_dead_code_insert
|
def even_or_odd(N):
while False:
return "Even"
l = len(N)
if (
N[l - 1] == "0"
or N[l - 1] == "2"
or N[l - 1] == "4"
or N[l - 1] == "6"
or
N[l - 1] == "8"
or N[l - 1] == "A"
or N[l - 1] == "C"
or N[l - 1] == "E"
):
return "Even"
else:
return "Odd"
| 1 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_for_while_loop
|
def even_or_odd(N):
l = len(N)
if (
N[l - 1] == "0"
or N[l - 1] == "2"
or N[l - 1] == "4"
or N[l - 1] == "6"
or
N[l - 1] == "8"
or N[l - 1] == "A"
or N[l - 1] == "C"
or N[l - 1] == "E"
):
return "Even"
else:
return "Odd"
| 1 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_operand_swap
|
def even_or_odd(N):
l = len(N)
if (
N[l - 1] == "0"
or N[l - 1] == "2"
or N[l - 1] == "4"
or N[l - 1] == "6"
or
N[l - 1] == "8"
or N[l - 1] == "A"
or N[l - 1] == "C"
or "E" == N[l - 1]
):
return "Even"
else:
return "Odd"
| 1 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_rename_variable_cb
|
def even_or_odd(l2):
l = len(l2)
if (
l2[l - 1] == "0"
or l2[l - 1] == "2"
or l2[l - 1] == "4"
or l2[l - 1] == "6"
or
l2[l - 1] == "8"
or l2[l - 1] == "A"
or l2[l - 1] == "C"
or l2[l - 1] == "E"
):
return "Even"
else:
return "Odd"
| 1 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_rename_variable_naive
|
def even_or_odd(VAR_0):
l = len(VAR_0)
if (
VAR_0[l - 1] == "0"
or VAR_0[l - 1] == "2"
or VAR_0[l - 1] == "4"
or VAR_0[l - 1] == "6"
or
VAR_0[l - 1] == "8"
or VAR_0[l - 1] == "A"
or VAR_0[l - 1] == "C"
or VAR_0[l - 1] == "E"
):
return "Even"
else:
return "Odd"
| 1 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_rename_variable_rn
|
def even_or_odd(r):
l = len(r)
if (
r[l - 1] == "0"
or r[l - 1] == "2"
or r[l - 1] == "4"
or r[l - 1] == "6"
or
r[l - 1] == "8"
or r[l - 1] == "A"
or r[l - 1] == "C"
or r[l - 1] == "E"
):
return "Even"
else:
return "Odd"
| 1 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_sub_add_variable
|
def even_or_odd(N):
l = len(N)
if (N[l+1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
| 0 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_equalto_exclamation_variable
|
def even_or_odd(N):
l = len(N)
if (N[l-1] !='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
| 0 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
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 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
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 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
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 | 384 |
mbpp
|
def even_or_odd(N):
l = len(N)
if (N[l-1] =='0'or N[l-1] =='2'or
N[l-1] =='4'or N[l-1] =='6'or
N[l-1] =='8'or N[l-1] =='A'or
N[l-1] =='C'or N[l-1] =='E'):
return ("Even")
else:
return ("Odd")
|
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 | 384 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_dead_code_insert
|
def highest_Power_of_2(n):
_i_0 = 0
while _i_0 < _i_0:
break
res = 0
for i in range(n, 0, -1):
if (i & (i - 1)) == 0:
res = i
break
return res
| 1 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_for_while_loop
|
def highest_Power_of_2(n):
res = 0
i = n
while i > 0:
if (i & (i - 1)) == 0:
res = i
break
i -= 1
return res
| 1 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_operand_swap
|
def highest_Power_of_2(n):
res = 0
for i in range(n, 0, -1):
if 0 == (i & (i - 1)):
res = i
break
return res
| 1 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_rename_variable_cb
|
def highest_Power_of_2(n):
res = 0
for pr in range(n, 0, -1):
if (pr & (pr - 1)) == 0:
res = pr
break
return res
| 1 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_rename_variable_naive
|
def highest_Power_of_2(n):
res = 0
for VAR_0 in range(n, 0, -1):
if (VAR_0 & (VAR_0 - 1)) == 0:
res = VAR_0
break
return res
| 1 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_rename_variable_rn
|
def highest_Power_of_2(n):
res = 0
for R in range(n, 0, -1):
if (R & (R - 1)) == 0:
res = R
break
return res
| 1 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_sub_add_variable
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, +1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
| 0 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
return res;
|
transformation_equalto_exclamation_variable
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) != 0):
res = i;
break;
return res;
| 0 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
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 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
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 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
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 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
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 | 385 |
mbpp
|
def highest_Power_of_2(n):
res = 0;
for i in range(n, 0, -1):
if ((i & (i - 1)) == 0):
res = i;
break;
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 | 385 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_dead_code_insert
|
def find_lucas(n):
_i_0 = 0
if _i_0 > _i_0:
return 1
if n == 0:
return 2
if n == 1:
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
| 1 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_for_while_loop
|
def find_lucas(n):
if n == 0:
return 2
if n == 1:
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
| 1 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_operand_swap
|
def find_lucas(n):
if 0 == n:
return 2
if n == 1:
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
| 1 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_rename_variable_cb
|
def find_lucas(i):
if i == 0:
return 2
if i == 1:
return 1
return find_lucas(i - 1) + find_lucas(i - 2)
| 1 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_rename_variable_naive
|
def find_lucas(VAR_0):
if VAR_0 == 0:
return 2
if VAR_0 == 1:
return 1
return find_lucas(VAR_0 - 1) + find_lucas(VAR_0 - 2)
| 1 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_rename_variable_rn
|
def find_lucas(k):
if k == 0:
return 2
if k == 1:
return 1
return find_lucas(k - 1) + find_lucas(k - 2)
| 1 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_add_sub_variable
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) - find_lucas(n - 2)
| 0 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_sub_add_variable
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n + 1) + find_lucas(n - 2)
| 0 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_equalto_exclamation_variable
|
def find_lucas(n):
if (n != 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
| 0 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
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 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
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 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_dissimilar_code_injection_3
|
def heap_queue_largest(nums,n):
import heapq as hq
largest_nums = hq.nlargest(n, nums)
return largest_nums
| 0 | 386 |
mbpp
|
def find_lucas(n):
if (n == 0):
return 2
if (n == 1):
return 1
return find_lucas(n - 1) + find_lucas(n - 2)
|
transformation_dissimilar_code_injection_4
|
def count_ways(n):
A = [0] * (n + 1)
B = [0] * (n + 1)
A[0] = 1
A[1] = 0
B[0] = 0
B[1] = 1
for i in range(2, n+1):
A[i] = A[i - 2] + 2 * B[i - 1]
B[i] = A[i - 1] + B[i - 2]
return A[n]
| 0 | 386 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_dead_code_insert
|
def add_string(list, string):
while False:
add_string = [string.format(i) for i in list]
add_string = [string.format(i) for i in list]
return add_string
| 1 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_for_while_loop
|
def add_string(list, string):
add_string = [string.format(i) for i in list]
return add_string
| 1 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_operand_swap
|
def add_string(list, string):
add_string = [string.format(i) for i in list]
return add_string
| 1 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_rename_variable_cb
|
def add_string(list, string):
add_string = [string.format(l) for l in list]
return add_string
| 1 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_rename_variable_naive
|
def add_string(list, VAR_0):
add_string = [VAR_0.format(i) for i in list]
return add_string
| 1 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_rename_variable_rn
|
def add_string(list, string):
add_string = [string.format(C) for C in list]
return add_string
| 1 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
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 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
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 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
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 | 387 |
mbpp
|
def add_string(list,string):
add_string=[string.format(i) for i in list]
return add_string
|
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 | 387 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_dead_code_insert
|
def get_max_sum(n):
res = list()
res.append(0)
for _i_6 in range(0):
i = i + 1
res.append(1)
i = 2
while i < n + 1:
res.append(
max(
i,
(res[int(i / 2)] + res[int(i / 3)] + res[int(i / 4)] + res[int(i / 5)]),
)
)
i = i + 1
return res[n]
| 1 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_for_while_loop
|
def get_max_sum(n):
res = list()
res.append(0)
res.append(1)
i = 2
while i < n + 1:
res.append(
max(
i,
(res[int(i / 2)] + res[int(i / 3)] + res[int(i / 4)] + res[int(i / 5)]),
)
)
i = i + 1
return res[n]
| 1 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_operand_swap
|
def get_max_sum(n):
res = list()
res.append(0)
res.append(1)
i = 2
while n + 1 > i:
res.append(
max(
i,
(res[int(i / 2)] + res[int(i / 3)] + res[int(i / 4)] + res[int(i / 5)]),
)
)
i = i + 1
return res[n]
| 1 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_rename_variable_cb
|
def get_max_sum(n):
res = list()
res.append(0)
res.append(1)
i2 = 2
while i2 < n + 1:
res.append(
max(
i2,
(
res[int(i2 / 2)]
+ res[int(i2 / 3)]
+ res[int(i2 / 4)]
+ res[int(i2 / 5)]
),
)
)
i2 = i2 + 1
return res[n]
| 1 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_rename_variable_naive
|
def get_max_sum(n):
VAR_0 = list()
VAR_0.append(0)
VAR_0.append(1)
i = 2
while i < n + 1:
VAR_0.append(
max(
i,
(
VAR_0[int(i / 2)]
+ VAR_0[int(i / 3)]
+ VAR_0[int(i / 4)]
+ VAR_0[int(i / 5)]
),
)
)
i = i + 1
return VAR_0[n]
| 1 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_rename_variable_rn
|
def get_max_sum(n):
res = list()
res.append(0)
res.append(1)
w = 2
while w < n + 1:
res.append(
max(
w,
(res[int(w / 2)] + res[int(w / 3)] + res[int(w / 4)] + res[int(w / 5)]),
)
)
w = w + 1
return res[n]
| 1 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_add_sub_variable
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n - 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
| 0 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_div_mul_variable
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i * 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
| 0 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_lesser_greater_variable
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i>n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
| 0 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[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 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[n]
|
transformation_dissimilar_code_injection_1
|
def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res)
| 0 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[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 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[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 | 389 |
mbpp
|
def get_max_sum (n):
res = list()
res.append(0)
res.append(1)
i = 2
while i<n + 1:
res.append(max(i, (res[int(i / 2)]
+ res[int(i / 3)] +
res[int(i / 4)]
+ res[int(i / 5)])))
i = i + 1
return res[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 | 389 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_dead_code_insert
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
for _i_5 in range(0):
res = True
if ele in temp:
res = False
break
temp.add(ele)
return res
| 1 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_for_while_loop
|
def check_distinct(test_tup):
res = True
temp = set()
_ele_i = 0
while _ele_i < len(test_tup):
ele = test_tup[_ele_i]
if ele in temp:
res = False
break
temp.add(ele)
_ele_i += 1
return res
| 1 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_operand_swap
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return res
| 1 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_rename_variable_cb
|
def check_distinct(test_tup):
temp2 = True
temp = set()
for ele in test_tup:
if ele in temp:
temp2 = False
break
temp.add(ele)
return temp2
| 1 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_rename_variable_naive
|
def check_distinct(test_tup):
res = True
VAR_0 = set()
for ele in test_tup:
if ele in VAR_0:
res = False
break
VAR_0.add(ele)
return res
| 1 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_rename_variable_rn
|
def check_distinct(test_tup):
fL8 = True
temp = set()
for ele in test_tup:
if ele in temp:
fL8 = False
break
temp.add(ele)
return fL8
| 1 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_true_false_variable
|
def check_distinct(test_tup):
res = False
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
| 0 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
return (res)
|
transformation_false_true_variable
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = True
break
temp.add(ele)
return (res)
| 0 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
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 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
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 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
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 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
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 | 391 |
mbpp
|
def check_distinct(test_tup):
res = True
temp = set()
for ele in test_tup:
if ele in temp:
res = False
break
temp.add(ele)
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 | 391 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_dead_code_insert
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
_i_1 = 0
while _i_1 < _i_1:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
| 1 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_for_while_loop
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
_c_i = 0
while _c_i < len(str1):
c = str1[_c_i]
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
_c_i += 1
for c in char_order:
if ctr[c] == 1:
return c
return None
| 1 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_operand_swap
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if 1 == ctr[c]:
return c
return None
| 1 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_rename_variable_cb
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for k in str1:
if k in ctr:
ctr[k] += 1
else:
ctr[k] = 1
char_order.append(k)
for k in char_order:
if ctr[k] == 1:
return k
return None
| 1 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_rename_variable_naive
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for VAR_0 in str1:
if VAR_0 in ctr:
ctr[VAR_0] += 1
else:
ctr[VAR_0] = 1
char_order.append(VAR_0)
for VAR_0 in char_order:
if ctr[VAR_0] == 1:
return VAR_0
return None
| 1 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_rename_variable_rn
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for W in str1:
if W in ctr:
ctr[W] += 1
else:
ctr[W] = 1
char_order.append(W)
for W in char_order:
if ctr[W] == 1:
return W
return None
| 1 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_add_sub_variable
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] -= 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
| 0 | 392 |
mbpp
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] == 1:
return c
return None
|
transformation_equalto_exclamation_variable
|
def first_non_repeating_character(str1):
char_order = []
ctr = {}
for c in str1:
if c in ctr:
ctr[c] += 1
else:
ctr[c] = 1
char_order.append(c)
for c in char_order:
if ctr[c] != 1:
return c
return None
| 0 | 392 |
mbpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.