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 tuple_int_str(tuple_str):
result = tuple((int(x[0]), int(x[1])) for x in tuple_str)
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-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j]
return tc[m][n] | 0 | 153 | mbpp |
def tuple_int_str(tuple_str):
result = tuple((int(x[0]), int(x[1])) for x in tuple_str)
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 | 153 | mbpp |
def tuple_int_str(tuple_str):
result = tuple((int(x[0]), int(x[1])) for x in tuple_str)
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 | 153 | mbpp |
def tuple_int_str(tuple_str):
result = tuple((int(x[0]), int(x[1])) for x in tuple_str)
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 | 153 | mbpp |
def tuple_int_str(tuple_str):
result = tuple((int(x[0]), int(x[1])) for x in tuple_str)
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 | 153 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_dead_code_insert | def encode_list(list1):
_i_9 = 0
if _i_9 < _i_9:
from itertools import groupby
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 1 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_for_while_loop | def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 1 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_operand_swap | def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 1 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_rename_variable_cb | def encode_list(list1):
from itertools import groupby
return [[len(list(value)), key] for key, value in groupby(list1)] | 1 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_rename_variable_naive | def encode_list(list1):
from itertools import groupby
return [[len(list(VAR_0)), key] for key, VAR_0 in groupby(list1)] | 1 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_rename_variable_rn | def encode_list(list1):
from itertools import groupby
return [[len(list(group)), Pvk] for Pvk, group in groupby(list1)] | 1 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 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 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 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 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 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 | 154 | mbpp |
def encode_list(list1):
from itertools import groupby
return [[len(list(group)), key] for key, group in groupby(list1)] | 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 | 154 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_dead_code_insert | def month_season(month, days):
if month in ("January", "February", "March"):
season = "winter"
elif month in ("April", "May", "June"):
_i_1 = 0
if _i_1 > _i_1:
season = "autumn"
season = "spring"
elif month in ("July", "August", "September"):
season = "summer"
else:
season = "autumn"
if (month == "March") and (days > 19):
season = "spring"
elif (month == "June") and (days > 20):
season = "summer"
elif (month == "September") and (days > 21):
season = "autumn"
elif (month == "October") and (days > 21):
season = "autumn"
elif (month == "November") and (days > 21):
season = "autumn"
elif (month == "December") and (days > 20):
season = "winter"
return season | 1 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_for_while_loop | def month_season(month, days):
if month in ("January", "February", "March"):
season = "winter"
elif month in ("April", "May", "June"):
season = "spring"
elif month in ("July", "August", "September"):
season = "summer"
else:
season = "autumn"
if (month == "March") and (days > 19):
season = "spring"
elif (month == "June") and (days > 20):
season = "summer"
elif (month == "September") and (days > 21):
season = "autumn"
elif (month == "October") and (days > 21):
season = "autumn"
elif (month == "November") and (days > 21):
season = "autumn"
elif (month == "December") and (days > 20):
season = "winter"
return season | 1 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_operand_swap | def month_season(month, days):
if month in ("January", "February", "March"):
season = "winter"
elif month in ("April", "May", "June"):
season = "spring"
elif month in ("July", "August", "September"):
season = "summer"
else:
season = "autumn"
if ("March" == month) and (days > 19):
season = "spring"
elif (month == "June") and (days > 20):
season = "summer"
elif (month == "September") and (days > 21):
season = "autumn"
elif (month == "October") and (days > 21):
season = "autumn"
elif (month == "November") and (days > 21):
season = "autumn"
elif (month == "December") and (days > 20):
season = "winter"
return season | 1 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_rename_variable_cb | def month_season(month, days):
if month in ("January", "February", "March"):
month2 = "winter"
elif month in ("April", "May", "June"):
month2 = "spring"
elif month in ("July", "August", "September"):
month2 = "summer"
else:
month2 = "autumn"
if (month == "March") and (days > 19):
month2 = "spring"
elif (month == "June") and (days > 20):
month2 = "summer"
elif (month == "September") and (days > 21):
month2 = "autumn"
elif (month == "October") and (days > 21):
month2 = "autumn"
elif (month == "November") and (days > 21):
month2 = "autumn"
elif (month == "December") and (days > 20):
month2 = "winter"
return month2 | 1 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_rename_variable_naive | def month_season(month, days):
if month in ("January", "February", "March"):
VAR_0 = "winter"
elif month in ("April", "May", "June"):
VAR_0 = "spring"
elif month in ("July", "August", "September"):
VAR_0 = "summer"
else:
VAR_0 = "autumn"
if (month == "March") and (days > 19):
VAR_0 = "spring"
elif (month == "June") and (days > 20):
VAR_0 = "summer"
elif (month == "September") and (days > 21):
VAR_0 = "autumn"
elif (month == "October") and (days > 21):
VAR_0 = "autumn"
elif (month == "November") and (days > 21):
VAR_0 = "autumn"
elif (month == "December") and (days > 20):
VAR_0 = "winter"
return VAR_0 | 1 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_rename_variable_rn | def month_season(month, days):
if month in ("January", "February", "March"):
i8m611 = "winter"
elif month in ("April", "May", "June"):
i8m611 = "spring"
elif month in ("July", "August", "September"):
i8m611 = "summer"
else:
i8m611 = "autumn"
if (month == "March") and (days > 19):
i8m611 = "spring"
elif (month == "June") and (days > 20):
i8m611 = "summer"
elif (month == "September") and (days > 21):
i8m611 = "autumn"
elif (month == "October") and (days > 21):
i8m611 = "autumn"
elif (month == "November") and (days > 21):
i8m611 = "autumn"
elif (month == "December") and (days > 20):
i8m611 = "winter"
return i8m611 | 1 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_greater_lesser_variable | def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days < 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 0 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_equalto_exclamation_variable | def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month != 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 0 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_and_or_variable | def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') or (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 0 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 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 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 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 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 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 | 156 | mbpp |
def month_season(month,days):
if month in ('January', 'February', 'March'):
season = 'winter'
elif month in ('April', 'May', 'June'):
season = 'spring'
elif month in ('July', 'August', 'September'):
season = 'summer'
else:
season = 'autumn'
if (month == 'March') and (days > 19):
season = 'spring'
elif (month == 'June') and (days > 20):
season = 'summer'
elif (month == 'September') and (days > 21):
season = 'autumn'
elif (month == 'October') and (days > 21):
season = 'autumn'
elif (month == 'November') and (days > 21):
season = 'autumn'
elif (month == 'December') and (days > 20):
season = 'winter'
return season | 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 | 156 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_dead_code_insert | def solution(a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
_i_3 = 0
if _i_3 > _i_3:
i = 0
return ("x = ", i, ", y = ", int((n - (i * a)) / b))
return 0
i = i + 1
return "No solution" | 1 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_for_while_loop | def solution(a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ", i, ", y = ", int((n - (i * a)) / b))
return 0
i = i + 1
return "No solution" | 1 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_operand_swap | def solution(a, b, n):
i = 0
while n >= i * a:
if (n - (i * a)) % b == 0:
return ("x = ", i, ", y = ", int((n - (i * a)) / b))
return 0
i = i + 1
return "No solution" | 1 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_rename_variable_cb | def solution(a, b, n):
n2 = 0
while n2 * a <= n:
if (n - (n2 * a)) % b == 0:
return ("x = ", n2, ", y = ", int((n - (n2 * a)) / b))
return 0
n2 = n2 + 1
return "No solution" | 1 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_rename_variable_naive | def solution(a, b, n):
VAR_0 = 0
while VAR_0 * a <= n:
if (n - (VAR_0 * a)) % b == 0:
return ("x = ", VAR_0, ", y = ", int((n - (VAR_0 * a)) / b))
return 0
VAR_0 = VAR_0 + 1
return "No solution" | 1 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_rename_variable_rn | def solution(a, b, n):
h = 0
while h * a <= n:
if (n - (h * a)) % b == 0:
return ("x = ", h, ", y = ", int((n - (h * a)) / b))
return 0
h = h + 1
return "No solution" | 1 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_add_sub_variable | def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i - 1
return ("No solution") | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_sub_add_variable | def solution (a, b, n):
i = 0
while i * a <= n:
if (n + (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_mul_div_variable | def solution (a, b, n):
i = 0
while i / a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_div_mul_variable | def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) * b))
return 0
i = i + 1
return ("No solution") | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_lesser_greater_variable | def solution (a, b, n):
i = 0
while i * a >= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_equalto_exclamation_variable | def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b != 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 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 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 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 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 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 | 157 | mbpp |
def solution (a, b, n):
i = 0
while i * a <= n:
if (n - (i * a)) % b == 0:
return ("x = ",i ,", y = ",
int((n - (i * a)) / b))
return 0
i = i + 1
return ("No solution") | 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 | 157 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_dead_code_insert | def sum_series(n):
if n < 1:
_i_2 = 0
if _i_2 < _i_2:
return n + sum_series(n - 2)
return 0
else:
return n + sum_series(n - 2) | 1 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_for_while_loop | def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | 1 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_operand_swap | def sum_series(n):
if 1 > n:
return 0
else:
return n + sum_series(n - 2) | 1 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_rename_variable_cb | def sum_series(pri):
if pri < 1:
return 0
else:
return pri + sum_series(pri - 2) | 1 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_rename_variable_naive | def sum_series(VAR_0):
if VAR_0 < 1:
return 0
else:
return VAR_0 + sum_series(VAR_0 - 2) | 1 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_rename_variable_rn | def sum_series(q):
if q < 1:
return 0
else:
return q + sum_series(q - 2) | 1 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_add_sub_variable | def sum_series(n):
if n < 1:
return 0
else:
return n - sum_series(n - 2) | 0 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_sub_add_variable | def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n + 2) | 0 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(n - 2) | transformation_lesser_greater_variable | def sum_series(n):
if n > 1:
return 0
else:
return n + sum_series(n - 2) | 0 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(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 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(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 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(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 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(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 | 159 | mbpp |
def sum_series(n):
if n < 1:
return 0
else:
return n + sum_series(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 | 159 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_dead_code_insert | def area_polygon(s, l):
from math import tan, pi
_i_3 = 0
if _i_3 > _i_3:
area = s * (l ** 2) / (4 * tan(pi / s))
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 1 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_for_while_loop | def area_polygon(s, l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 1 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_operand_swap | def area_polygon(s, l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 1 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_rename_variable_cb | def area_polygon(the, l):
from math import tan, pi
area = the * (l ** 2) / (4 * tan(pi / the))
return area | 1 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_rename_variable_naive | def area_polygon(VAR_0, l):
from math import tan, pi
area = VAR_0 * (l ** 2) / (4 * tan(pi / VAR_0))
return area | 1 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_rename_variable_rn | def area_polygon(j, l):
from math import tan, pi
area = j * (l ** 2) / (4 * tan(pi / j))
return area | 1 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_mul_div_variable | def area_polygon(s,l):
from math import tan, pi
area = s / (l ** 2) / (4 * tan(pi / s))
return area | 0 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_div_mul_variable | def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) * (4 * tan(pi / s))
return area | 0 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 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 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 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 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 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 | 160 | mbpp |
def area_polygon(s,l):
from math import tan, pi
area = s * (l ** 2) / (4 * tan(pi / s))
return area | 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 | 160 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_dead_code_insert | def areEquivalent(num1, num2):
import math
def divSum(n):
_i_0 = 0
if _i_0 > _i_0:
import math
sum = 1
i = 2
while i * i <= n:
if n % i == 0:
sum = sum + i + math.floor(n / i)
i += 1
return sum
return divSum(num1) == divSum(num2) | 1 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_for_while_loop | def areEquivalent(num1, num2):
import math
def divSum(n):
sum = 1
i = 2
while i * i <= n:
if n % i == 0:
sum = sum + i + math.floor(n / i)
i += 1
return sum
return divSum(num1) == divSum(num2) | 1 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_rename_variable_cb | def areEquivalent(num1, num2):
import math
def divSum(n):
sum = 1
n2 = 2
while n2 * n2 <= n:
if n % n2 == 0:
sum = sum + n2 + math.floor(n / n2)
n2 += 1
return sum
return divSum(num1) == divSum(num2) | 1 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_rename_variable_naive | def areEquivalent(num1, num2):
import math
def divSum(n):
sum = 1
VAR_0 = 2
while VAR_0 * VAR_0 <= n:
if n % VAR_0 == 0:
sum = sum + VAR_0 + math.floor(n / VAR_0)
VAR_0 += 1
return sum
return divSum(num1) == divSum(num2) | 1 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_rename_variable_rn | def areEquivalent(num1, num2):
import math
def divSum(n):
sum = 1
T = 2
while T * T <= n:
if n % T == 0:
sum = sum + T + math.floor(n / T)
T += 1
return sum
return divSum(num1) == divSum(num2) | 1 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_add_sub_variable | def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum - i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 0 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_mul_div_variable | def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i / i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 0 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_div_mul_variable | def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n * i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 0 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_lesser_greater_variable | def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i >= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 0 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_equalto_exclamation_variable | def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i != 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 0 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 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 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | transformation_dissimilar_code_injection_1 | def similar_elements(test_tup1, test_tup2):
res = tuple(set(test_tup1) & set(test_tup2))
return (res) | 0 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 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 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 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 | 161 | mbpp |
def areEquivalent(num1,num2):
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
return divSum(num1) == divSum(num2); | 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 | 161 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_dead_code_insert | def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
for _i_6 in range(0):
count_chars = 0
if (i == ord(str1[i]) - ord("A")) or (i == ord(str1[i]) - ord("a")):
count_chars += 1
return count_chars | 1 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_for_while_loop | def count_char_position(str1):
count_chars = 0
i = 0
while i < len(str1):
if (i == ord(str1[i]) - ord("A")) or (i == ord(str1[i]) - ord("a")):
count_chars += 1
i += 1
return count_chars | 1 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_operand_swap | def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if (ord(str1[i]) - ord("A") == i) or (i == ord(str1[i]) - ord("a")):
count_chars += 1
return count_chars | 1 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_rename_variable_cb | def count_char_position(str1):
count_chars = 0
for i2 in range(len(str1)):
if (i2 == ord(str1[i2]) - ord("A")) or (i2 == ord(str1[i2]) - ord("a")):
count_chars += 1
return count_chars | 1 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_rename_variable_naive | def count_char_position(str1):
count_chars = 0
for VAR_0 in range(len(str1)):
if (VAR_0 == ord(str1[VAR_0]) - ord("A")) or (
VAR_0 == ord(str1[VAR_0]) - ord("a")
):
count_chars += 1
return count_chars | 1 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_rename_variable_rn | def count_char_position(str1):
count_chars = 0
for q in range(len(str1)):
if (q == ord(str1[q]) - ord("A")) or (q == ord(str1[q]) - ord("a")):
count_chars += 1
return count_chars | 1 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_add_sub_variable | def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars -= 1
return count_chars | 0 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_sub_add_variable | def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) + ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | 0 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_equalto_exclamation_variable | def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i != ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | 0 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | transformation_or_and_variable | def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) and
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | 0 | 162 | mbpp |
def count_char_position(str1):
count_chars = 0
for i in range(len(str1)):
if ((i == ord(str1[i]) - ord('A')) or
(i == ord(str1[i]) - ord('a'))):
count_chars += 1
return count_chars | 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 | 162 | mbpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.