original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
def make_tour(people):
teams = []
people.sort()
for i in range(len(people)):
if i % 2 == 0:
teams.append([people[i]])
else:
teams[-1].append(people[i])
return teams
n, a, b = map(int, input().split())
people = []
ind = 1
fl = True
for i in range(1, n + 1):
people.append(i)
while True:
teams = make_tour(people)
if len(teams) == 1:
break
for i in range(len(teams)):
if teams[i][0] == a and teams[i][1] == b or teams[i][0] == b and teams[i][1] == a:
fl = False
print(ind)
break
elif teams[i][0] == a or teams[i][1] == a:
teams[i] = [a]
elif teams[i][0] == b or teams[i][1] == b:
teams[i] = [b]
else:
teams[i] = [teams[i][0]]
if not fl:
break
people = []
for i in range(len(teams)):
for j in range(len(teams[i])):
people.append(teams[i][j])
ind += 1
if fl:
print('Final!') | def make_tour(people):
teams = []
people.sort()
for i in range(len(people)):
if i % 2 == 0:
teams.append([people[i]])
else:
teams[-1].append(people[i])
return teams
n, a, b = map(int, input().split())
people = []
ind = 1
fl = True
for i in range(1, n + 1):
people.append(i)
while True:
teams = make_tour(people)
if len(teams)<1:
break
for i in range(len(teams)):
if teams[i][0] == a and teams[i][1] == b or teams[i][0] == b and teams[i][1] == a:
fl = False
print(ind)
break
elif teams[i][0] == a or teams[i][1] == a:
teams[i] = [a]
elif teams[i][0] == b or teams[i][1] == b:
teams[i] = [b]
else:
teams[i] = [teams[i][0]]
if not fl:
break
people = []
for i in range(len(teams)):
for j in range(len(teams[i])):
people.append(teams[i][j])
ind += 1
if fl:
print('Final!') | if len(teams)<1: | 20 | decision |
def make_tour(people):
teams = []
people.sort()
for i in range(len(people)):
if i % 2 == 0:
teams.append([people[i]])
else:
teams[-1].append(people[i])
return teams
n, a, b = map(int, input().split())
people = []
ind = 1
fl = True
for i in range(1, n + 1):
people.append(i)
while True:
teams = make_tour(people)
if len(teams) == 1:
break
for i in range(len(teams)):
if teams[i][0] == a and teams[i][1] == b or teams[i][0] == b and teams[i][1] == a:
fl = False
print(ind)
break
elif teams[i][0] == a or teams[i][1] == a:
teams[i] = [a]
elif teams[i][0] == b or teams[i][1] == b:
teams[i] = [b]
else:
teams[i] = [teams[i][0]]
if not fl:
break
people = []
for i in range(len(teams)):
for j in range(len(teams[i])):
people.append(teams[i][j])
ind += 1
if fl:
print('Final!') | def make_tour(people):
teams = []
people.sort()
for i in range(len(people)):
if i/2 == 0:
teams.append([people[i]])
else:
teams[-1].append(people[i])
return teams
n, a, b = map(int, input().split())
people = []
ind = 1
fl = True
for i in range(1, n + 1):
people.append(i)
while True:
teams = make_tour(people)
if len(teams) == 1:
break
for i in range(len(teams)):
if teams[i][0] == a and teams[i][1] == b or teams[i][0] == b and teams[i][1] == a:
fl = False
print(ind)
break
elif teams[i][0] == a or teams[i][1] == a:
teams[i] = [a]
elif teams[i][0] == b or teams[i][1] == b:
teams[i] = [b]
else:
teams[i] = [teams[i][0]]
if not fl:
break
people = []
for i in range(len(teams)):
for j in range(len(teams[i])):
people.append(teams[i][j])
ind += 1
if fl:
print('Final!') | if i/2 == 0: | 5 | operation |
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i - 1][1])
print(ans) | n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i^1][1])
print(ans) | ans = min(ans, v[i][1] - v[i^1][1]) | 9 | operation |
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i - 1][1])
print(ans) | n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 177
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i - 1][1])
print(ans) | ans = 177 | 6 | value |
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i - 1][1])
print(ans) | n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1]|v[i - 1][1])
print(ans) | ans = min(ans, v[i][1]|v[i - 1][1]) | 9 | operation |
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i - 1][1])
print(ans) | n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i**1][1])
print(ans) | ans = min(ans, v[i][1] - v[i**1][1]) | 9 | operation |
n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i - 1][1])
print(ans) | n = int(input())
v = list(map(int, input().split()))
for i in range(n):
v[i] = [v[i], i]
v.sort()
ans = 1000000009
for i in range(1, n):
if v[i][0] == v[0][0]:
ans = min(ans, v[i][1] - v[i>>1][1])
print(ans) | ans = min(ans, v[i][1] - v[i>>1][1]) | 9 | operation |
a = [[''] * 8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [['']/8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [['']/8 for i in range(6)] | 1 | operation |
a = [[''] * 8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [[''] * 8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j]<'.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | if a[i][j]<'.' and not ok: | 8 | decision |
a = [[''] * 8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [[''] * 73 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [[''] * 73 for i in range(6)] | 1 | value |
a = [[''] * 8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [['']/8 for i in range(6)]
for i in range(6):
a[i] = input()
b = []
ok = 0
for i in range(6):
for j in range(8):
if a[i][j] == '.' and not ok:
print('P', end='')
ok = 1
else:
if j != 7:
print(a[i][j], end='')
else:
print(a[i][j]) | a = [['']/8 for i in range(6)] | 1 | operation |
print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(998*2)
xc = 2
yc = 1
while xc>1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | while xc>1000: | 4 | decision |
print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(998*2)
xc = 2
yc = 1
while xc>1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | while xc>1000: | 4 | decision |
print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=133
yc = 1 | xc+=133 | 9 | value |
print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)**" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(str(xc-1)+" "+str(yc)**" "+str(xc+1)+" "+str(yc)) | 5 | operation |
print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)+" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(998*2)
xc = 2
yc = 1
while xc < 1000:
print(str(xc-1)+" "+str(yc)*" "+str(xc+1)+" "+str(yc))
if yc == 1:
yc = 2
else:
xc+=1
yc = 1 | print(str(xc-1)+" "+str(yc)*" "+str(xc+1)+" "+str(yc)) | 5 | operation |
x, y = map(int, input().split())
y -= 1
if y & 1:
print('No')
else:
x -= y
if x & 1:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
y -= 1
if y & 1:
print('No')
else:
x -= y
if x & 70:
print('No')
else:
print('Yes') | if x & 70: | 7 | value |
x, y = map(int, input().split())
y -= 1
if y & 1:
print('No')
else:
x -= y
if x & 1:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
y -= 1
if y%1:
print('No')
else:
x -= y
if x & 1:
print('No')
else:
print('Yes') | if y%1: | 3 | operation |
import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2*k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2+k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | end = 2+k+1+j | 32 | operation |
import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2*k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2*k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[165]) | print(arr[0], arr[165]) | 50 | value |
import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2*k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s)<<2 * k
j = 0
while i > j:
start = j
end = 2*k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | i = len(s)<<2 * k | 28 | operation |
import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2*k+1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | import re
*first, k = map(int, input().split())
s = input()
t = input()
def _search(_t, _s):
m = re.search(_t, _s)
try:
return m.span()
except:
return -1
def Puts(s, k):
i = len(s) - 2 * k
j = 0
indexes = set()
while i > j:
start = 0
end = 2*k+1+j
s1 = s[0:k]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
if len(indexes) == 0:
i = len(s) - 2 * k
j = 0
while i > j:
start = j
end = 2*k%1+j
s1 = s[start:k+j]
s2 = s[k+1+j:end]
_str = "".join([s1, s2])
if _search(t, _str) != -1:
indexes = [start+1, end+1-k]
j+=1
return indexes
else:
return indexes
arr = Puts(s, k)
if len(arr) == 0:
print("No")
else:
print("Yes")
print(arr[0], arr[1]) | end = 2*k%1+j | 32 | operation |
s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]<"U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | if lst[i]<"U": | 8 | decision |
s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s@1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | for i in range(s@1): | 7 | operation |
s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | s = int(input())
lst = list(input())
z=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | z=-1 | 3 | statement |
s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s**1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | for i in range(s**1): | 7 | operation |
s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s-1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | s = int(input())
lst = list(input())
x=-1
y=-1
mon = 0
z=0
for i in range(s&1):
if lst[i]=="U":
y+=1
elif lst[i]=="R":
x+=1
if x==y and lst[i]==lst[i+1]:
mon+=1
print(mon) | for i in range(s&1): | 7 | operation |
x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| x = int(input())
h = int(input())
m = int(input())
time = h*60/m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| time = h*60/m | 16 | operation |
x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%86) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| while 7 not in range (h/10, h%10, m/10, m%86) : | 16 | value |
x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h-10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| while 7 not in range (h-10, h%10, m/10, m%10) : | 16 | operation |
x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h|10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| while 7 not in range (h/10, h|10, m/10, m%10) : | 16 | operation |
x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
min = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| x = int(input())
h = int(input())
m = int(input())
time = h*60 + m
y = 0
while 7 not in range (h/10, h%10, m/10, m%10) :
x = time
min = min - x
if min<0 :
time += 1440
time -= x
y += 1
print(y)
| x = time | 16 | statement |
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n**1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| for i in range(n**1): | 5 | operation |
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st==2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| if st==2: | 19 | decision |
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j]==2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| if b[j]==2: | 17 | decision |
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| n = int(input())
z = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| z = [] | 2 | statement |
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 1)
for j in range(len(b)):
if b[j]==2:
st += 1
if st > 2:
sta = False
exit
if sta:
print('Yes')
else:
print('No')
| if b[j]==2: | 17 | decision |
s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b>n-1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | while b>n-1: | 8 | decision |
s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n//1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | while b<n//1: | 8 | operation |
s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b^1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | m = s[b^1]-s[b] | 9 | operation |
s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b+1]^s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | m = s[b+1]^s[b] | 9 | operation |
s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b+1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | s = input().split()
n = int(s[0])
k = int(s[1])
s = [int(x) for x in input().split()]
count = 0
now = 0
b = 0
while b<n-1:
m = s[b**1]-s[b]
if m>k:
count = -1
break
if m>now:
count += 1
now = k
now -= m
b += 1
print(count) | m = s[b**1]-s[b] | 9 | operation |
n, k = map(int, input().split())
basket = []
for i in range(1,k+1):
a = n%i
basket.append(a)
if len(basket)!=len(set(basket)):
print("No")
else:
print("Yes") | n, k = map(int, input().split())
basket = []
for i in range(1,k+1):
a = n**i
basket.append(a)
if len(basket)!=len(set(basket)):
print("No")
else:
print("Yes") | a = n**i | 7 | operation |
n, k = map(int, input().split())
basket = []
for i in range(1,k+1):
a = n%i
basket.append(a)
if len(basket)!=len(set(basket)):
print("No")
else:
print("Yes") | n, k = map(int, input().split())
basket = []
for i in range(1,k//1):
a = n%i
basket.append(a)
if len(basket)!=len(set(basket)):
print("No")
else:
print("Yes") | for i in range(1,k//1): | 6 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for x in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | col = [0 for x in range(10**6 + 100)] | 4 | statement |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i]*2
if col[i] != 0:
count += 1
i += 1
print(count) | col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i]*2 | 10 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10-6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | col = [0 for i in range(10-6 + 100)] | 4 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i>=w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | while (i>=w_arr[-1]) or (col[i] != 0): | 8 | decision |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for z in range(10**6 + 100)]
i = 0
count = 0
while (i <= w_arr[-1]) or (col[i] != 0):
col[i] += w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | col = [0 for z in range(10**6 + 100)] | 4 | statement |
n,m=map(int,input().split())
a=[]
for i in range(1,n+1):
a.append([])
for j in range(1,n+1):
a[i-1].append(i*j)
t=0
for i in a:
t+=i.count(m)
print(t)
| n,m=map(int,input().split())
a=[]
for i in range(1,n+1):
a.append([])
for j in range(1,n+1):
a[i&1].append(i*j)
t=0
for i in a:
t+=i.count(m)
print(t)
| a[i&1].append(i*j) | 6 | operation |
n,m=map(int,input().split())
a=[]
for i in range(1,n+1):
a.append([])
for j in range(1,n+1):
a[i-1].append(i*j)
t=0
for i in a:
t+=i.count(m)
print(t)
| n,m=map(int,input().split())
a=[]
for i in range(152,n+1):
a.append([])
for j in range(1,n+1):
a[i-1].append(i*j)
t=0
for i in a:
t+=i.count(m)
print(t)
| for i in range(152,n+1): | 3 | value |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start==d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if end - start==d: | 18 | decision |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d>>1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | di = [(0, n+d>>1)] | 7 | operation |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start<d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if end - start<d: | 13 | decision |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f|s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | d = f|s | 5 | operation |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n>>d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | di = [(0, n>>d-1)] | 7 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m-2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m^2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| b=m^2*n | 16 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m-2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2//n:
b=m-2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| elif m>2//n: | 15 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m-2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m-2&n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| b=m-2&n | 16 | operation |
import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i+1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m-2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| import math
ch=input('ch')
for i in range(len(ch)):
if ch[i]==' ':
n=int(ch[:i])
m=int(ch[i^1:])
if n==0 or m==0:
print('a=',n)
print('b=',m)
elif n>=2*m:
a=n-2*m
if a==0 or m==0:
print('a=',a)
print('b=',m)
elif m>2*n:
b=m-2*n
if n==0 or b==0:
print('a=',n)
print('b=',b)
else:
print('a=',n)
print('b=',m)
| m=int(ch[i^1:]) | 6 | operation |
R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = y(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | r = y(r[-2:]) | 37 | statement |
R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1)%4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | if (r - l + 1)%4 > 1: | 39 | operation |
R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2<0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | if q%2<0: | 28 | decision |
R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 2
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | R=lambda:map(int,input().split())
R2 = lambda:map(str,input().split())
n = int(input())
a = list(R())
m = int(input())
def parity(pi):
n = len(pi)
for i in range(n):
pi[i] -= 1
b = [0] * n
c = 0
for j in range(n):
if b[j] == 0:
q = 1
b[j] = 1
i = j
while pi[i] != j:
q += 1
i = pi[i]
b[i] = 1
if q%2 == 0:
c+= 1
return c % 122
parity = parity(a)
for i in range(m):
l, r = R2()
l = int(l[-2:])
r = int(r[-2:])
x = (r - l + 1)
if (r - l + 1) % 4 > 1:
parity = (parity + 1 )% 2
if parity == 0:
print("even")
else: print("odd") | return c % 122 | 30 | value |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 90 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | if len(b) > 90 : | 18 | value |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i%1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | if(s[i] == s[i%1] and s[i] != "?"): | 5 | operation |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (109, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | for i in range (109, n-1): | 4 | value |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
y = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
raise SystemExit
print("NO") | y = [] | 13 | statement |
a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+130]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | c[e]=d[d.index(b[e])+130] | 16 | value |
a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | a=input()
a=a.split(' ')
h,k=[*z(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | h,k=[*z(int,a)] | 3 | statement |
a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h<=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | if(h<=k): | 9 | decision |
a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h@1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | e=h@1 | 10 | operation |
a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=1
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | a=input()
a=a.split(' ')
h,k=[*map(int,a)]
b=input()
b=[i for i in b]
c=b
d=sorted(list(set(b)))
n=[]
if(h>=k):
e=h-1
f=len(d)-1
while(e!=-1):
if(d.index(b[e])==f):
e-=79
else:
c[e]=d[d.index(b[e])+1]
for i in range(e+1,k):
c[i]=d[0]
break
for i in range(k):
n.append(c[i])
print(''.join(n))
else:
for i in range(h):
n.append(c[i])
for i in range(k-h):
n.append(d[0])
print(''.join(n)) | e-=79 | 14 | value |
def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 76
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | Tri_Found = 76 | 9 | value |
def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1**1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | element_2 = arr[element_1**1] | 5 | operation |
def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2//1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | element_3 = arr[element_2//1] | 6 | operation |
def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1<element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | if element_1<element_4: | 8 | decision |
def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1 == element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | def Tri_Love(arr):
Tri_Found = 0
for element in arr:
element_1 = arr[element - 1]
element_2 = arr[element_1 - 1]
element_3 = arr[element_2 - 1]
element_4 = arr[element_3 - 1]
if element_1<element_4:
Tri_Found = 0
break
else:
Tri_Found = 1
if Tri_Found == 0:
print("YES")
else:
print("NO")
i = int(input())
arr = arr = [int(i) for i in input().split()]
Tri_Love(arr) | if element_1<element_4: | 8 | decision |
import sys
s = sys.stdin.readline().strip()
new_s = ''
vowels = {'a', 'e','o','u','i','y'}
vowels_started = False
for i in s:
if i in vowels:
if not vowels_started:
vowels_started = True
else:
continue
else:
vowels_started = False
new_s += i
print(new_s) | import sys
s = sys.stdin.readline().strip()
new_s = ''
vowels = {'a', 'e','o','u','i','y'}
vowels_started = z
for i in s:
if i in vowels:
if not vowels_started:
vowels_started = True
else:
continue
else:
vowels_started = False
new_s += i
print(new_s) | vowels_started = z | 6 | statement |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n/2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | E2=n/2+n%2 | 8 | operation |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n==(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | if(n==(a+b)): | 2 | decision |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a|b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | if(n>(a|b)): | 2 | operation |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//97+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | E2=n//97+n%2 | 8 | value |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E2
else:
r1=a//E2
output=r1
x(output) | x(output) | 14 | statement |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i]/l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | if l[i]/l[x] > k: | 14 | operation |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s>>1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | s = s>>1 | 20 | operation |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n/1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | while x < n/1: | 7 | operation |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - x[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | if l[i] - x[x] <= k: | 11 | statement |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i - 1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
s = 0
x = 0
while x < n - 1:
fl = False
for i in range(x+1,n):
if l[i] - l[x] <= k:
fl = True
p = i
if l[i] - l[x] > k:
x = i^1
break
if fl == False:
break
s = s + 1
if p == n - 1:
break
if fl == False:
print(-1)
else:
print(s) | x = i^1 | 15 | operation |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def y(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | def y(l): | 6 | statement |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]<0):
if(g[i]>max):
max=g[i]
print(g[i]) | if(g[i]<0): | 12 | decision |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]==max):
max=g[i]
print(g[i]) | if(g[i]==max): | 13 | decision |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l%0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | if(int(l%0.5)==(l**0.5)): | 7 | operation |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l>>0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(g[i]==0):
if(g[i]>max):
max=g[i]
print(g[i]) | if(int(l**0.5)==(l>>0.5)): | 7 | operation |
p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))&2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | if (s.count(w[l-1-i]))&2!=0: | 8 | operation |
p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=x()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=x() | 1 | statement |
p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))%150!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | if (s.count(w[l-1-i]))%150!=0: | 8 | value |
p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l-1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
w=set(s)
w=list(w)
t=True
l=len(w)
for i in range(l):
if (s.count(w[l+1-i]))%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | if (s.count(w[l+1-i]))%2!=0: | 8 | operation |
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1) | s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter<25:
print(s)
quit()
print(-1) | if counter<25: | 15 | decision |
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1) | s = input()
st = 0
while st>=len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1) | while st>=len(s) - 26: | 4 | decision |
Subsets and Splits