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 read_line():
line = input()
a, b = line.split(' ')
return (int(a), int(b))
n, m = read_line()
p = -1.0
for i in range(n):
a, b = read_line()
if p<0 or p*b>a:
p = a/b
print(p*m) | def read_line():
line = input()
a, b = line.split(' ')
return (int(a), int(b))
n, m = read_line()
p = -1.0
for i in range(n):
a, b = read_line()
if p<0 or p*b>a:
p = a/b
print(p-m) | print(p-m) | 13 | operation |
def read_line():
line = input()
a, b = line.split(' ')
return (int(a), int(b))
n, m = read_line()
p = -1.0
for i in range(n):
a, b = read_line()
if p<0 or p*b>a:
p = a/b
print(p*m) | def read_line():
line = input()
a, b = line.split(' ')
return (int(a), int(b))
n, m = read_line()
p = -1.0
for i in range(n):
a, b = read_line()
if p<0 or p//b>a:
p = a/b
print(p*m) | if p<0 or p//b>a: | 10 | operation |
import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2+x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | r = (r0 + ((x2+x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2 | 5 | operation |
import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1==x2:
x += dx
else:
x -= dx
print(x, y, r) | if x1==x2: | 24 | decision |
import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1<x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | if x1<x2: | 9 | decision |
import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1==x2:
x += dx
else:
x -= dx
print(x, y, r) | if x1==x2: | 24 | decision |
import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | import cmath as m
r0, x1, y1, x2, y2 = map(int, input().split())
r = (r0 + ((x2 - x1) ** 2+(y2 - y1) ** 2) ** 0.5) / 2
x = x2
y = y2
if x1 == x2:
dx = 0
dy = r
else:
k = (y1 - y2) / (x1 - x2)
k = m.atan(k)
dx = r * abs(m.cos(k).real)
dy = r * abs(m.sin(k).real)
if y1 > y2:
y += dy
else:
y -= dy
if x1 > x2:
x += dx
else:
x -= dx
print(x, y, r) | r = (r0 + ((x2 - x1) ** 2+(y2 - y1) ** 2) ** 0.5) / 2 | 5 | operation |
l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[0]) | l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)//1]-1)
else:
print(1000000-l2[0]) | print(l1[len(l1)//1]-1) | 17 | operation |
l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[0]) | l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)/1]-1)
else:
print(1000000-l2[0]) | print(l1[len(l1)/1]-1) | 17 | operation |
l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[0]) | l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000//l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[0]) | print(1000000//l2[0]) | 15 | operation |
l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[0]) | l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000^l2[0]) | print(1000000^l2[0]) | 19 | operation |
l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[0]) | l1=[]
l2=[]
n=int(input())
for i in range (0,n):
a=int(input())
if a>500000:
l2.append(int(a))
else:
l1.append(int(a))
if len(l1)!=0:
l1.sort()
if len(l2)!=0:
l2.sort()
if len(l1)==0:
print(1000000-l2[0])
elif len(l2)==0:
print(l1[len(l1)-1]-1)
else:
print(1000000-l2[28]) | print(1000000-l2[28]) | 19 | value |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x&m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | tmp.append((i+x&m)%m) | 12 | operation |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x<0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | if(x<0): | 7 | decision |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x@m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | mark[x@m]=1 | 15 | operation |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x**m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | tmp.append((i+x**m)%m) | 12 | operation |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
tmp = []
for i in range(m):
if(mark[i]==1):
tmp.append((i+x%m)%m)
for t in tmp:
mark[t]=1
mark[x@m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | mark[x@m]=1 | 15 | operation |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n%1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| l = [[] for i in range(n%1)] | 20 | operation |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])<0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| if len([i])<0: | 20 | decision |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -79
print(result)
| result = -79 | 20 | value |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 127
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| result = 127 | 20 | value |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],70):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| for enum in itertools.combinations(l[i],70): | 20 | value |
k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count == 10:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| k = int(input())
n = 10
curr = 0
while curr < k:
x = str(n)
count = 0
for i in s:
count+=int(i)
if count == 10:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| x = str(n) | 5 | statement |
k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count == 10:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count == 10:
curr+=1
n+=1
if curr<k:
n-=1
print(n)
| if curr<k: | 12 | decision |
k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count == 10:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count == 43:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| if count == 43: | 9 | value |
k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count == 10:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| k = int(input())
n = 10
curr = 0
while curr < k:
s = str(n)
count = 0
for i in s:
count+=int(i)
if count<10:
curr+=1
n+=1
if curr == k:
n-=1
print(n)
| if count<10: | 9 | decision |
"""
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i > 1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | """
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i==1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | if (i==1) : | 47 | decision |
"""
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i > 1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | """
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+23));
j+=1;
if (i > 1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | mm = max(mm, lst[j+1] - (lst[j]+23)); | 44 | value |
"""
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i > 1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | """
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j>i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i > 1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | while (j>i): | 29 | decision |
"""
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i > 1) :
mm = max(mm, 24*60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | """
def m(a, b):
return min(a,b);
def M(a, b):
return max(a,b);
s = input();
s = "M("
i = 0;
while i < 250:
s = s+s;
i+=1;
s += "1, 1"
while i < 500:
s = s+"), 2";
i+=1;
print(eval(s));
"""
i = int(input());
if (i == 1):
print("23:59");
else:
j = 0;
lst = [];
while (j < i):
tmp = input();
a = int(tmp[0:2]);
b = int(tmp[3:5]);
lst.append(a*60+b);
j+=1;
lst = sorted(lst);
mm = 0;
j = 0;
while (j < i-1):
mm = max(mm, lst[j+1] - (lst[j]+1));
j+=1;
if (i > 1) :
mm = max(mm, 24@60-(lst[i-1]+1)+lst[0]);
h = round(mm / 60);
mi = mm % 60;
if (mi != 0):
h -= 1;
print(h,':',mi, sep=''); | mm = max(mm, 24@60-(lst[i-1]+1)+lst[0]); | 48 | operation |
a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + sorted(c[i:], reverse=True)
if int(''.join(temp))>b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | if int(''.join(temp))>b and int(''.join(temp)) > int(a): | 8 | decision |
a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + y(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | temp = c[:i] + y(c[i:], reverse=True) | 7 | statement |
a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i]**sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | temp = c[:i]**sorted(c[i:], reverse=True) | 7 | operation |
a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i]&sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | temp = c[:i]&sorted(c[i:], reverse=True) | 7 | operation |
a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i] + sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | a = input()
b = int(input())
c = sorted(a)
for i in range(len(c)):
temp = c[:i]//sorted(c[i:], reverse=True)
if int(''.join(temp)) < b and int(''.join(temp)) > int(a):
print(''.join(temp))
break
else:
print(a) | temp = c[:i]//sorted(c[i:], reverse=True) | 7 | operation |
n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 169
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | sec = 169 | 4 | value |
n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos==r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | elif pos==r: | 9 | decision |
n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos<l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | elif pos<l: | 14 | decision |
n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l==1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | if l==1 and r < n: | 25 | decision |
n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r < n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | n, pos, l, r = map(int, input().split())
sec = 0
if l == 1 and r == n:
sec = 0
elif pos < l:
sec += l - pos + 1
if r>n:
sec += r - l + 1
elif pos > r:
sec += pos - r + 1
if l > 1:
sec += r - l + 1
elif pos == l:
if l > 1:
sec += 1
if r < n:
sec += r - l + 1
elif pos == r:
if r < n:
sec += 1
if l > 1:
sec += r - l + 1
elif pos > l and pos < r:
if l > 1 and r < n:
sec += min(pos - l, r - pos)
sec += r - l
sec += 2
elif l == 1:
sec += r - pos + 1
elif r == n:
sec += pos - l + 1
print(sec) | if r>n: | 7 | decision |
def format(string):
string = string.lower()
string = string.replace('0', 'o')
string = string.replace('1', 'l')
string = string.replace('2', 'z')
string = string.replace('3', 'e')
string = string.replace('4', 'a')
string = string.replace('5', 's')
string = string.replace('6', 'g')
string = string.replace('7', 't')
string = string.replace('8', 'b')
string = string.replace('9', 'q')
return string
newlogin = input()
isOk = True
newlogin = format(newlogin)
length = int(input())
for x in range(length):
check = input()
check = format(check)
if check == newlogin:
isOk = False
break
if isOk: print("Yes")
else: print("No") | def format(string):
string = string.lower()
string = string.replace('0', 'o')
string = string.replace('1', 'l')
string = string.replace('2', 'z')
string = string.replace('3', 'e')
string = string.replace('4', 'a')
string = string.replace('5', 's')
string = string.replace('6', 'g')
string = string.replace('7', 't')
string = string.replace('8', 'b')
string = string.replace('9', 'q')
return string
newlogin = input()
isOk = True
newlogin = format(newlogin)
length = int(input())
for x in range(length):
check = input()
check = format(check)
if check<newlogin:
isOk = False
break
if isOk: print("Yes")
else: print("No") | if check<newlogin: | 22 | decision |
def format(string):
string = string.lower()
string = string.replace('0', 'o')
string = string.replace('1', 'l')
string = string.replace('2', 'z')
string = string.replace('3', 'e')
string = string.replace('4', 'a')
string = string.replace('5', 's')
string = string.replace('6', 'g')
string = string.replace('7', 't')
string = string.replace('8', 'b')
string = string.replace('9', 'q')
return string
newlogin = input()
isOk = True
newlogin = format(newlogin)
length = int(input())
for x in range(length):
check = input()
check = format(check)
if check == newlogin:
isOk = False
break
if isOk: print("Yes")
else: print("No") | def format(string):
string = string.lower()
string = string.replace('0', 'o')
string = string.replace('1', 'l')
string = string.replace('2', 'z')
string = string.replace('3', 'e')
string = string.replace('4', 'a')
string = string.replace('5', 's')
string = string.replace('6', 'g')
string = string.replace('7', 't')
string = string.replace('8', 'b')
string = string.replace('9', 'q')
return string
newlogin = input()
isOk = y
newlogin = format(newlogin)
length = int(input())
for x in range(length):
check = input()
check = format(check)
if check == newlogin:
isOk = False
break
if isOk: print("Yes")
else: print("No") | isOk = y | 16 | statement |
n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 61
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | mid = (r + l) // 61 | 12 | value |
n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l==1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | while r - l==1: | 11 | decision |
n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n%1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | r = n%1 | 5 | operation |
n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i]%d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | c = a[i]%d | 10 | operation |
n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l - i + 1))
print(mn) | n, d = map(int, input().split())
a = [int(x) for x in input().split()]
a.sort()
l = 0
r = n - 1
mn = n
for i in range(n):
l = i
r = n
c = a[i] + d
while r - l > 1:
mid = (r + l) // 2
if a[mid] > c:
r = mid
else:
l = mid
mn = min(mn, n - (l*i + 1))
print(mn) | mn = min(mn, n - (l*i + 1)) | 17 | operation |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b<n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | if b<n and a==1: | 8 | decision |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2&a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | print(pos+2&a) | 24 | operation |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2+a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | res_right=2*b-pos+2+a | 27 | operation |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos>=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | if pos>=a: | 21 | decision |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
def minMove(n, pos, a, b):
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b>>pos+2)
elif pos>=b:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right))
minMove(n=n, pos=pos, a=a, b=b) | print(b>>pos+2) | 22 | operation |
n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i>n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | while i>n - 1 and p[i] <= p[i + 1]: | 13 | decision |
n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i]>>p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | cnt += a[i]>>p[i] | 11 | operation |
n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i>n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | while i>n: | 10 | decision |
n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i>n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | while i>n: | 10 | decision |
n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i < n - 1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | n = int(input())
a = []
p = []
for i in range(n):
x, y = map(int, input().split())
a.append(x)
p.append(y)
i = 0
cnt = 0
while i < n:
cnt += a[i] * p[i]
j = i
while i < n-1 and p[i] <= p[i + 1]:
i += 1
cnt += a[i] * p[j]
i += 1
print(cnt) | while i < n-1 and p[i] <= p[i + 1]: | 13 | operation |
n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i**1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | indexset.add(i**1) | 23 | operation |
n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i]<1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | if pos[i]<1: | 21 | decision |
n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i>k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | while i>k: | 15 | decision |
n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset)==0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | if len(indexset ^ valueset)==0: | 28 | decision |
n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i+1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | n = int(input())
s = input().split()
arr = []
for n in s:
arr.append(int(n))
s = input()
k = len(s)
pos = []
for l in s:
pos.append(int(l))
i = 0
indexset = set()
valueset = set()
while i < k:
if pos[i] == 0:
if arr[i] != i + 1:
print("NO")
exit(0)
if pos[i] == 1:
while pos[i] == 1:
indexset.add(i<<1)
valueset.add(arr[i])
i += 1
indexset.add(i+1)
valueset.add(arr[i])
if len(indexset ^ valueset) > 0:
print("NO")
exit(0)
indexset.clear()
valueset.clear()
i += 1
print("YES") | indexset.add(i<<1) | 23 | operation |
n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-42] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | one[-42] += 1 | 22 | value |
n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n&2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | if a[n-1] == a[n&2]: | 20 | operation |
n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 55:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | if a[i] == 55: | 13 | value |
n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1]<a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | if a[n-1]<a[n-2]: | 20 | decision |
n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+1]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | n = int(input())
a = list(map(int,input().split(" ")))
one = []
two = []
count = 1
flg = 0
for i in range(n-1):
if a[i] == a[i+125]:
count += 1
else:
if a[i] == 1:
one.append(count)
else:
two.append(count)
count = 1
ans = []
if a[n-1] == a[n-2]:
if a[n-1] == 1:
one[-1] += 1
else:
two[-1] += 1
else:
if a[n-1] == 1:
one.append(1)
else:
two.append(1)
if len(one) > len(two):
two.append(0)
elif len(two) > len(one):
one.appned(0)
for i in range(len(one)-1):
ans.append(one[i]+one[i+1]+two[i]+two[i+1])
print(max(ans)) | if a[i] == a[i+125]: | 10 | value |
n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| n,k=map(int,input().split(' '))
ans=0
if k<1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| if k<1: | 3 | decision |
n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| n,k=map(x,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| n,k=map(x,input().split(' ')) | 1 | statement |
n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| n,k=map(int,input().split(' '))
ans=0
if k<1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| if k<1: | 3 | decision |
n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=147
print(2**ans-1)
| ans+=147 | 8 | value |
n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans-1)
| n,k=map(int,input().split(' '))
ans=0
if k==1:
print(n)
else:
while n!=0:
n//=2
ans+=1
print(2**ans//1)
| print(2**ans//1) | 9 | operation |
n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i/0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| if int(i/0.5)==float(i**0.5): | 6 | operation |
n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)<0:
print (max(l))
else:
print (max(lp))
| if len(lp)<0: | 12 | decision |
n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(y))
else:
print (max(lp))
| print (max(y)) | 13 | statement |
n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if x>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| if x>=0: | 5 | statement |
n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)==float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| n=int(input())
l=list(map(int,input().split()))
lp=[]
for i in l:
if i>=0:
if int(i**0.5)<float(i**0.5):
pass
else:
lp.append(i)
else:
lp.append(i)
if len(lp)==0:
print (max(l))
else:
print (max(lp))
| if int(i**0.5)<float(i**0.5): | 6 | decision |
l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n/1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | for i in range(2,n/1): | 5 | operation |
l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
z=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | z=0 | 12 | statement |
l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt>3:
print("No")
break
else:
print("Yes") | if cnt>3: | 16 | decision |
l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt>3:
print("No")
break
else:
print("Yes") | if cnt>3: | 16 | decision |
l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=int(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | l=[ [] for i in range(1005) ]
f=[0]*1005
f[1]=1
n=int(input())
for i in range(2,n+1):
x=x(input())
f[x]=1
l[x].append(i)
for i in range(1,n+1):
if not f[i]:
continue
cnt=0
for ele in l[i]:
if not f[ele]:
cnt+=1
if cnt<3:
print("No")
break
else:
print("Yes") | x=x(input()) | 6 | statement |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | n = int(input())
arr = list(z(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | arr = list(z(int, input().split())) | 2 | statement |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i<z-1:
print("YES")
exit(0)
print("NO") | if i<z-1: | 7 | decision |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x//1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | y = arr[x//1] | 5 | operation |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z//1:
print("YES")
exit(0)
print("NO") | if i == z//1: | 7 | operation |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y-1]
if i == z-1:
print("YES")
exit(0)
print("NO") | n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
x = arr[i]
y = arr[x-1]
z = arr[y**1]
if i == z-1:
print("YES")
exit(0)
print("NO") | z = arr[y**1] | 6 | operation |
input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n == 1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n<1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | if n<1: | 7 | decision |
input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n == 1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n<1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | if n<1: | 7 | decision |
input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n == 1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n<1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | if n<1: | 7 | decision |
input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n == 1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n<1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | if n<1: | 7 | decision |
input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n == 1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4 + 1, p3 + 1)
print(max(p1,p2,p3,p4)) | input()
a = list(map(int, input().split()))
p1,p2,p3,p4=0,0,0,0
for n in a:
if n == 1:
p1 += 1
p3 = max(p3 + 1, p2 + 1)
else:
p2 = max(p2 + 1, p1 + 1)
p4 = max(p4+1, p3 + 1)
print(max(p1,p2,p3,p4)) | p4 = max(p4+1, p3 + 1) | 12 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n<=k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | while n<=k: | 9 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n<=k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | while n<=k: | 9 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k)-A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | zen += ((n % k)-A) | 10 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k) * A)
n -= (n % k)
if B>=(n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | if B>=(n - (n // k)) * A: | 12 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k) * A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
zen = 0
if k == 1:
print(A * (n - 1))
exit(0)
while n >= k:
zen += ((n % k)*A)
n -= (n % k)
if B <= (n - (n // k)) * A:
zen += B
n //= k
else:
zen += (n - (n // k)) * A
n //= k
zen += A * (n - 1)
print(zen) | zen += ((n % k)*A) | 10 | operation |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 16 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | return (-B + math.sqrt(B * B - 16 * A * C)) / (2 * A); | 11 | value |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -150
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | flag = -150 | 35 | value |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
z,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | z,a,b,c,d = map(int, input().split()) | 13 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.