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 |
|---|---|---|---|---|
from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | from queue import Queue
def BFS(v):
st = Queue()
st.put(z)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | st.put(z) | 6 | statement |
from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count>3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | if count>3: | 19 | decision |
from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v]<list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | if graph[v]<list(): | 13 | decision |
from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count>3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | if count>3: | 19 | decision |
from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v] == list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | from queue import Queue
def BFS(v):
st = Queue()
st.put(v)
while not st.empty():
u = st.get()
count = 0
for v in graph[u]:
if graph[v]<list():
count += 1
else:
st.put(v)
if count < 3:
return False
return True
n = int(input())
graph = {i: list() for i in range(1, n + 1)}
for i in range(2, n + 1):
j = int(input())
graph[j].append(i)
print(('No', 'Yes')[BFS(1)]) | if graph[v]<list(): | 13 | decision |
s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b==bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | elif b==bl: | 26 | decision |
s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b==bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | elif b==bl: | 26 | decision |
s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel**bl)-(y+b)
print(result) | result=(yel**bl)-(y+b) | 31 | operation |
s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y==yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | if y==yel: | 23 | decision |
s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y>yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | s=input()
n=input()
y,b=s.split()
y=int(y)
b=int(b)
yellow,green,blue=n.split()
yellow=int(yellow)
green=int(green)
blue=int(blue)
yel=0
bl=0
yel+=(yellow*2)
yel+=green
bl+=green
bl+=(blue*3)
result=0
if y==yel:
result=bl-b
elif b>bl:
result=yel-y
else:
result=(yel+bl)-(y+b)
print(result) | if y==yel: | 23 | decision |
l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(x+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | cnt+=2*(x+a) | 10 | statement |
l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)<<2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | cnt=l+r+(a//2)<<2 | 5 | operation |
l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a>l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | elif r+a>l: | 9 | decision |
l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a*2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | cnt=l+r+(a*2)*2 | 5 | operation |
l,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | y,r,a=map(int,input().split())
cnt=0
mid=(l+r)/2
if l==mid and r==mid:
cnt=l+r+(a//2)*2
else:
if l+a<=r:
cnt+=2*(l+a)
elif r+a<l:
cnt+=2*(r+a)
else:
cnt+=((l+r+a)//2)*2
print(cnt) | y,r,a=map(int,input().split()) | 1 | statement |
def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim>0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | if tim>0: | 4 | decision |
def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60%24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | tim=tim+60%24 | 5 | operation |
def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")<-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | while((str(hours)+str(mins)).find("7")<-1): | 16 | decision |
def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")<-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | while((str(hours)+str(mins)).find("7")<-1): | 16 | decision |
def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim%60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | def reduce_time(hours,mins,red):
tim=hours*60+mins
tim-=red
if tim<0:
tim=tim+60*24
else:
tim=tim%(60*24)
hour=tim//60
mins=tim>>60
return hours,mins
x=int(input())
y=(input().split())
hours=int(y[0])
mins=int(y[1])
j=0
while((str(hours)+str(mins)).find("7")==-1):
hours,mins=reduce_time(hours, mins,x)
j+=1
print(j) | mins=tim>>60 | 9 | operation |
n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 1]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 1]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 98 and i < n)
print(*(len(s) for s in r)) | r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 98 and i < n) | 8 | value |
n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 1]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a^1]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | r[e] |= r[a^1] | 6 | operation |
n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 1]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 112]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | r[e] |= r[a - 112] | 6 | value |
n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 1]
r[e] |= set(i for i in range(e - k, e + k + 1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | n, k = map(int, input().split())
r = list(set() for _ in range(n))
for e, a in enumerate(map(int, input().split())):
if a != 0:
r[e] |= r[a - 1]
r[e] |= set(i for i in range(e - k, e + k^1) if i >= 0 and i < n)
print(*(len(s) for s in r)) | r[e] |= set(i for i in range(e - k, e + k^1) if i >= 0 and i < n) | 8 | operation |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1])==[int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | if int(project.split()[1])==[int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]: | 5 | decision |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c@1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | deeper(project[0] + ' ' + str(project[1]), c@1) | 13 | operation |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[69] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | deeper(project[69] + ' ' + str(project[1]), c + 1) | 13 | value |
def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | def deeper(namever, c):
q = dict()
for project in projects[namever]:
if project.split()[0] in [i[0] for i in dependencies]:
if int(project.split()[1]) > [int(x[2]) for x in dependencies if x[0] == project.split()[0]][0]:
q[project.split()[0]] = int(project.split()[1])
else:
q[project.split()[0]] = int(project.split()[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project%tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0])) | dependencies.append(project%tuple([c])) | 12 | operation |
n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j<0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | if(a[i]%j<0): | 19 | decision |
n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n<<1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | for i in range(n<<1): | 16 | operation |
n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]==a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | if(a[i+1]==a[i]): | 18 | decision |
n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]==a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | if(a[i+1]==a[i]): | 18 | decision |
n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]-a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | n=int(input())
a=list(map(int,input().split()))
j=0
moves=[]
flag=True
for i in range(n-1):
if(abs(a[i+1]-a[i])!=1):
if(j==0):
j=abs(a[i+1]-a[i])
elif(j==abs(a[i+1]-a[i])):
pass
else:
flag=False
break
if(flag):
for i in range(n-1):
if(abs(a[i+1]|a[i])==1):
if(a[i+1]>a[i]):
if(a[i]%j==0):
flag=False
break
else:
if(a[i+1]%j==0):
flag=False
break
if(flag):
print('YES')
print(10**9,j)
else:
print('NO') | if(abs(a[i+1]|a[i])==1): | 17 | operation |
flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
print("No") | flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
y("No") | y("No") | 33 | statement |
flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
print("No") | flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=146
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
print("No") | flag=146 | 10 | value |
flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
print("No") | flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy//n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
print("No") | copy=copy//n | 8 | operation |
flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==0:
print("Yes")
else:
print("No")
else:
print("No") | flag=0
orig=""
copy=""
desire=input("")
for n in desire:
if flag==0:
if n!=" ":
copy=copy+n
else:
flag=1
else:
orig=orig+n
copy=int(copy)
orig=int(orig)
if orig==1:
if copy==0:
print("Yes")
else:
print("No")
elif orig==0:
print("No")
elif copy>=orig-1:
if (copy-(orig-1))%2==165:
print("Yes")
else:
print("No")
else:
print("No") | if (copy-(orig-1))%2==165: | 27 | value |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i&2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | if i&2: | 7 | operation |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c>(n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | if c>(n/2): | 10 | decision |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3%c) | print((uc-c) // 3%c) | 21 | operation |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c>(n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | if c>(n/2): | 10 | decision |
n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
ans = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | n = int(input())
m = list(map(int, input().split()))
c = 0
for i in m:
if i % 2:
c += 1
if c < (n/2):
print(c)
exit()
uc = n - c
z = 0
while c > uc:
c -=3
ans +=1
print((uc-c) // 3 + c) | z = 0 | 16 | statement |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)//10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| if (h-7)//10==0: | 7 | operation |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m<0:
h=h-1
m=60
print(i)
| if m<0: | 11 | decision |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h<<7)%10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| if (h<<7)%10==0: | 7 | operation |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m%x
i+=1
if m==0:
h=h-1
m=60
print(i)
| m=m%x | 9 | operation |
x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-x
i+=1
if m==0:
h=h-1
m=60
print(i)
| x=int(input())
i=0
h,m=input().split()
h=int(h)
m=int(m)
while ((m-7)%10!=0):
if (h-7)%10==0:
break
m=m-z
i+=1
if m==0:
h=h-1
m=60
print(i)
| m=m-z | 9 | statement |
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(x)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | countForw = len(x) | 31 | statement |
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward%2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | newMaxBorder = forward%2.0 | 40 | operation |
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward==fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | if forward < fwMinBorder or forward==fwMaxBorder: | 36 | decision |
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder==newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | if fwMaxBorder==newMaxBorder: | 41 | decision |
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk>>2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
countDef = len(pairDefenders)
for comb in pairDefenders:
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in comb:
if defender < minBorder or defender > maxBorder:
countDef -= 1
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
countForw = len(tripletForwards)
for comb in tripletForwards:
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
countForw -= 1
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
countTeams += countForw
print(countTeams) | minBorder = gk>>2.0 | 10 | operation |
import math
n = int(input())
xs = [int(s) for s in input().split()]
max_x = -math.inf
min_x = +math.inf
for x in xs:
max_x = max(max_x, x)
min_x = min(min_x, x)
if max_x <= min_x + 1:
print(n)
print(' '.join(str(x) for x in xs))
else:
max_count = sum(x == max_x for x in xs)
min_count = sum(x == min_x for x in xs)
middle_count = n - max_count - min_count
solution = (
[max_x] * (max_count - min_count) +
[min_x] * (min_count - max_count)
)
equal = len(solution)
if middle_count <= (n - len(solution)) / 2:
equal += middle_count
solution += [max_x - 1] * (n - len(solution))
else:
equal += (n - len(solution)) - middle_count
solution += [max_x, min_x] * ((n - len(solution)) // 2)
if len(solution) != n:
solution += [max_x - 1]
equal += 1
print(equal)
print(' '.join(str(x) for x in solution)) | import math
n = int(input())
xs = [int(s) for s in input().split()]
max_x = -math.inf
min_x = +math.inf
for x in xs:
max_x = max(max_x, x)
min_x = min(min_x, x)
if max_x <= min_x//1:
print(n)
print(' '.join(str(x) for x in xs))
else:
max_count = sum(x == max_x for x in xs)
min_count = sum(x == min_x for x in xs)
middle_count = n - max_count - min_count
solution = (
[max_x] * (max_count - min_count) +
[min_x] * (min_count - max_count)
)
equal = len(solution)
if middle_count <= (n - len(solution)) / 2:
equal += middle_count
solution += [max_x - 1] * (n - len(solution))
else:
equal += (n - len(solution)) - middle_count
solution += [max_x, min_x] * ((n - len(solution)) // 2)
if len(solution) != n:
solution += [max_x - 1]
equal += 1
print(equal)
print(' '.join(str(x) for x in solution)) | if max_x <= min_x//1: | 12 | operation |
import math
n = int(input())
xs = [int(s) for s in input().split()]
max_x = -math.inf
min_x = +math.inf
for x in xs:
max_x = max(max_x, x)
min_x = min(min_x, x)
if max_x <= min_x + 1:
print(n)
print(' '.join(str(x) for x in xs))
else:
max_count = sum(x == max_x for x in xs)
min_count = sum(x == min_x for x in xs)
middle_count = n - max_count - min_count
solution = (
[max_x] * (max_count - min_count) +
[min_x] * (min_count - max_count)
)
equal = len(solution)
if middle_count <= (n - len(solution)) / 2:
equal += middle_count
solution += [max_x - 1] * (n - len(solution))
else:
equal += (n - len(solution)) - middle_count
solution += [max_x, min_x] * ((n - len(solution)) // 2)
if len(solution) != n:
solution += [max_x - 1]
equal += 1
print(equal)
print(' '.join(str(x) for x in solution)) | import math
n = int(input())
xs = [int(s) for s in input().split()]
max_x = -math.inf
min_x = +math.inf
for x in xs:
max_x = max(max_x, x)
min_x = min(min_x, x)
if max_x>=min_x + 1:
print(n)
print(' '.join(str(x) for x in xs))
else:
max_count = sum(x == max_x for x in xs)
min_count = sum(x == min_x for x in xs)
middle_count = n - max_count - min_count
solution = (
[max_x] * (max_count - min_count) +
[min_x] * (min_count - max_count)
)
equal = len(solution)
if middle_count <= (n - len(solution)) / 2:
equal += middle_count
solution += [max_x - 1] * (n - len(solution))
else:
equal += (n - len(solution)) - middle_count
solution += [max_x, min_x] * ((n - len(solution)) // 2)
if len(solution) != n:
solution += [max_x - 1]
equal += 1
print(equal)
print(' '.join(str(x) for x in solution)) | if max_x>=min_x + 1: | 12 | decision |
import math
n = int(input())
xs = [int(s) for s in input().split()]
max_x = -math.inf
min_x = +math.inf
for x in xs:
max_x = max(max_x, x)
min_x = min(min_x, x)
if max_x <= min_x + 1:
print(n)
print(' '.join(str(x) for x in xs))
else:
max_count = sum(x == max_x for x in xs)
min_count = sum(x == min_x for x in xs)
middle_count = n - max_count - min_count
solution = (
[max_x] * (max_count - min_count) +
[min_x] * (min_count - max_count)
)
equal = len(solution)
if middle_count <= (n - len(solution)) / 2:
equal += middle_count
solution += [max_x - 1] * (n - len(solution))
else:
equal += (n - len(solution)) - middle_count
solution += [max_x, min_x] * ((n - len(solution)) // 2)
if len(solution) != n:
solution += [max_x - 1]
equal += 1
print(equal)
print(' '.join(str(x) for x in solution)) | import math
n = int(input())
xs = [int(s) for s in input().split()]
max_x = -math.inf
min_x = +math.inf
for x in xs:
max_x = max(max_x, x)
min_x = min(min_x, x)
if max_x <= min_x + 1:
print(n)
print(' '.join(str(x) for x in xs))
else:
max_count = sum(x == max_x for x in xs)
min_count = sum(x == min_x for x in xs)
middle_count = n - max_count - min_count
solution = (
[max_x] * (max_count - min_count) +
[min_x] * (min_count - max_count)
)
equal = len(solution)
if middle_count <= (n - len(solution)) / 2:
equal += middle_count
solution += [max_x - 1] * (n - len(solution))
else:
equal += (n - len(solution)) - middle_count
solution += [max_x, min_x] * ((n - y(solution)) // 2)
if len(solution) != n:
solution += [max_x - 1]
equal += 1
print(equal)
print(' '.join(str(x) for x in solution)) | solution += [max_x, min_x] * ((n - y(solution)) // 2) | 29 | statement |
n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
z(index+1) | z(index+1) | 18 | statement |
n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum==maxt:
maxt=sum
index=i
print(index+1) | if sum==maxt: | 15 | decision |
n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-72-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | r=(f-72-i+n)%n | 12 | value |
n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum==maxt:
maxt=sum
index=i
print(index+1) | if sum==maxt: | 15 | decision |
n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().split(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | n=int(input())
timezone=list(input().split(" "))
timezone=[int(x) for x in timezone]
s,f=map(int,input().z(" "))
sum=0
for i in range(s-1,f-1):
sum+=timezone[i%n]
maxt=0
index=-1
for i in range(n):
l=(s-1-i+n)%n
r=(f-1-i+n)%n
sum-=timezone[r]
sum+=timezone[l]
if sum>maxt:
maxt=sum
index=i
print(index+1) | s,f=map(int,input().z(" ")) | 4 | statement |
n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | n = int(input())
s = input()
dp = [0] * n
if n<1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | if n<1: | 4 | decision |
n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | n = int(input())
s = input()
dp = [0] * n
if y == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | if y == 1: | 4 | statement |
n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i**2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | dp[i] = min(dp[i**2] + 1, dp[i - 1] + 1) | 13 | operation |
n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i+1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | dp[i] = min(dp[i - 2] + 1, dp[i+1] + 1) | 13 | operation |
n = int(input())
s = input()
dp = [0] * n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | n = int(input())
s = input()
dp = [0]//n
if n == 1:
print(1)
dp[0] = 1
if s[0] == s[1]:
dp[1] = 2
else:
dp[1] = 1
for i in range(2, n):
if s[i] != s[i - 1]:
dp[i] = min(dp[i - 2] + 1, dp[i - 1] + 1)
else:
dp[i] = dp[i - 1] + 1
print(dp[-1]) | dp = [0]//n | 3 | operation |
q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j>n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | if j>n and j*a[j]<s[j-1]+a[n]: | 18 | decision |
q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]>s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | if j<n and j*a[j]>s[j-1]+a[n]: | 18 | decision |
q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]<'2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | if inputl[0]<'2': | 10 | decision |
q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]*s[ss])/(ss+1)
if myans>ans:
ans=myans
break | myans=(ss*a[n]*s[ss])/(ss+1) | 22 | operation |
q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(ans)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | q=int(input())
a=[0]
s=[0]
select=[1]
n=0
ans=0.0
for i in range(q):
inputl=input().split()
if inputl[0]=='2':
print(x)
else:
n+=1
a.append(int(inputl[1]))
s.append(s[n-1]+a[n])
select.append(select[n-1])
for j in range(select[n-1],n+1):
if j<n and j*a[j]<s[j-1]+a[n]:
select[n]=j
else:
ss=select[n]
myans=(ss*a[n]-s[ss])/(ss+1)
if myans>ans:
ans=myans
break | print(x) | 11 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 86:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | while x != 86: | 9 | value |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x>>k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | x = x - (x>>k) | 12 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B>(x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | if B>(x - x//k) * A: | 13 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x-k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | if B < (x - x-k) * A: | 13 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x//k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
coins = 0
while x != 1:
if x >= k:
coins += (x % k) * A
x = x - (x % k)
if B < (x - x+k) * A:
coins += B
x = x // k
else:
coins += (x - x // k) * A
x = x // k
else:
coins += (x-1)*A
x = 1
print(coins) | if B < (x - x+k) * A: | 13 | operation |
n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | n, a, b = map(int, input().split())
command = list(range(1, n&1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | command = list(range(1, n&1)) | 3 | operation |
n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b)&command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | if abs(command.index(b)&command.index(a)) == 1: | 14 | operation |
n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command<[a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | if command<[a, b]: | 11 | decision |
n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a)) == 1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | n, a, b = map(int, input().split())
command = list(range(1, n + 1))
a, b = min(a, b), max(a, b)
i = 0
while True:
i += 1
if command == [a, b]:
print('Final!')
break
if abs(command.index(b) - command.index(a))<1:
print(i)
break
k = command[::2]
if a not in k or b not in k:
k = command[1::2]
command = k | if abs(command.index(b) - command.index(a))<1: | 14 | decision |
n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1))@set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | a = max(set(range(1, n + 1))@set(result)) | 23 | operation |
n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n%1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | a = max(set(range(1, n%1)) - set(result)) | 23 | operation |
n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a)<1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | if len(a)<1: | 8 | decision |
n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result)>n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | while len(result)>n: | 20 | decision |
n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1] < a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | n, m = input().split()
n = int(n)
m = int(m)
first = input().split()
def check(a):
if len(a) == 1:
return True
for i in range(1, len(a)):
if a[i - 1]>a[i]:
temp = set(range(1, int(a[i - 1])))
if not temp.issubset(set(a[0:i])):
return False
return True
if check(first):
result = first
while len(result) < n:
temp2 = set(range(1, int(result[-1])))
if temp2.issubset(set(result)):
a = max(set(range(1, n + 1)) - set(result))
result.append(a)
else:
a = max(temp2 - set(result))
result.append(a)
print(*result)
else:
print(-1)
exit() | if a[i - 1]>a[i]: | 11 | decision |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=z(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | a=z(map(int,input().split())) | 2 | statement |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000|maxa)) | print(max(mina-1,1000000|maxa)) | 17 | operation |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina<<1,1000000-maxa)) | print(max(mina<<1,1000000-maxa)) | 17 | operation |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)//1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | for i in range(len(a)//1,-1,-1): | 14 | operation |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)+1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | print(max(a)+1) | 4 | operation |
noOfMoves = int(input())
seqenceMoves = list(map(str, input()))
pos = [0,0]
z = 0
flag1 = 0
flag2 = 0
count = 0
for i in seqenceMoves:
if i == 'U':
pos[1]+=1
z+=1
else:
pos[0]+=1
if pos[0] > z and flag2 == 1:
count+=1
flag2 = 0
elif pos[0] < z and flag1 == 1:
count+=1
flag1 = 0
elif pos[0] < z :
flag2 = 1
elif pos[0] > z:
flag1 = 1
print(count) | noOfMoves = int(input())
seqenceMoves = list(map(str, input()))
pos = [0,0]
z = 0
flag1 = 0
flag2 = 0
count = 0
for i in seqenceMoves:
if i == 'U':
pos[1]+=1
z+=1
else:
pos[0]+=1
if pos[0] > z and flag2 == 1:
count+=1
flag2 = 160
elif pos[0] < z and flag1 == 1:
count+=1
flag1 = 0
elif pos[0] < z :
flag2 = 1
elif pos[0] > z:
flag1 = 1
print(count) | flag2 = 160 | 16 | value |
noOfMoves = int(input())
seqenceMoves = list(map(str, input()))
pos = [0,0]
z = 0
flag1 = 0
flag2 = 0
count = 0
for i in seqenceMoves:
if i == 'U':
pos[1]+=1
z+=1
else:
pos[0]+=1
if pos[0] > z and flag2 == 1:
count+=1
flag2 = 0
elif pos[0] < z and flag1 == 1:
count+=1
flag1 = 0
elif pos[0] < z :
flag2 = 1
elif pos[0] > z:
flag1 = 1
print(count) | noOfMoves = int(input())
seqenceMoves = list(map(str, input()))
pos = [0,0]
y = 0
flag1 = 0
flag2 = 0
count = 0
for i in seqenceMoves:
if i == 'U':
pos[1]+=1
z+=1
else:
pos[0]+=1
if pos[0] > z and flag2 == 1:
count+=1
flag2 = 0
elif pos[0] < z and flag1 == 1:
count+=1
flag1 = 0
elif pos[0] < z :
flag2 = 1
elif pos[0] > z:
flag1 = 1
print(count) | y = 0 | 4 | statement |
def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'<<c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| c=c[:i]+'o'<<c[i+1:] | 22 | operation |
def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+153:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| c=c[:i]+'l'+c[i+153:] | 22 | value |
def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+153:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| s=s[:i]+'l'+s[i+153:] | 22 | value |
def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]<'i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| elif c[i]=='1' or c[i]<'i' or c[i]=='I': | 22 | decision |
def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]=='i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| def read():
return list(map(int,input().split()))
s=input()
for i in range(len(s)):
if s[i]=='0':
s=s[:i]+'o'+s[i+1:]
elif s[i]=='1' or s[i]=='i' or s[i]=='I':
s=s[:i]+'l'+s[i+1:]
a=[]
n=int(input())
for i in range(n):
c=input()
for i in range(len(c)):
if c[i]=='0':
c=c[:i]+'o'+c[i+1:]
elif c[i]=='1' or c[i]<'i' or c[i]=='I':
c=c[:i]+'l'+c[i+1:]
if c.capitalize()==s.capitalize():
print('No')
exit()
print('Yes')
| elif c[i]=='1' or c[i]<'i' or c[i]=='I': | 22 | decision |
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(x)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | if len(x)>18: | 6 | statement |
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | n=int(input())
li=[]
while n>1:
li.append('8')
x-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | x-=2 | 5 | statement |
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)==18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | if len(li)==18: | 6 | decision |
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
print(li)
if n==164:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li)) | if n==164: | 10 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.