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 |
|---|---|---|---|---|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r&1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
for i in range(r&1, n):
| 12 |
operation
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
y[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
y[i] = 1
| 7 |
statement
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 91
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
r -= 91
| 4 |
value
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r == n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
n, pos, l, r = map(int, input().split())
pos -= 1
l -= 1
r -= 1
v = [0]*(n)
for i in range(l, r+1):
v[i] = 1
t = 0
while v.count(0) != 0:
if l == 0:
t += abs(pos - r) + 1
for i in range(r+1, n):
v[i] = 1
elif r<n-1:
t += abs(pos - l) + 1
for i in range(0, l):
v[i] = 1
else:
if abs(pos - l) <= abs(pos - r):
t += abs(pos - l)
pos = l
for i in range(0, l):
v[i] = 1
t += 1
t += abs(pos - r)
for i in range(r+1, n):
v[i] = 1
t+=1
else:
t += abs(pos - r)
pos = r
for i in range(r+1, n):
v[i] = 1
t+=1
t += abs(pos - l)
for i in range(0, l):
v[i] = 1
t += 1
print(t)
|
elif r<n-1:
| 14 |
decision
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]<Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
if(Lovers[i][0]<Lovers[i+1][0]):
| 15 |
decision
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and y<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
while(stop==0 and y<n):
| 17 |
statement
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j>n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
while(stop==0 and j>n):
| 17 |
decision
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]<Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]<Lovers[j][1]):
| 18 |
decision
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j<n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
n=int(input())
F=list(map(int,input().split()))
Lovers=[[] for i in range(n)]
for i in range(n):
Lovers[i].append(F[i])
Lovers[i].append(F[F[i]-1])
Lovers[i]=sorted(Lovers[i])
Lovers=sorted(Lovers)
Found="NO"
i=0
stop=0
while(stop==0 and i<n-2):
if(Lovers[i][0]==Lovers[i+1][0]):
j=i+2
while(stop==0 and j>n):
if(Lovers[i][1]==Lovers[j][0] and Lovers[i+1][1]==Lovers[j][1]):
Found="YES"
stop=1
j+=1
i+=1
print(Found)
|
while(stop==0 and j>n):
| 17 |
decision
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]<s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
if s[i:]<s[i:][::-1]:
| 6 |
decision
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]<s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
if s[i:]<s[i:][::-1]:
| 6 |
decision
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s*s[:pos])
|
print(s*s[:pos])
| 11 |
operation
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s|s[:pos])
|
print(s|s[:pos])
| 11 |
operation
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]<s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos])
|
if s[i:]<s[i:][::-1]:
| 6 |
decision
|
n = int(input())
s = input()
a = []
s = s.split()
mn = 1000000001
count = 0
minres = 100000
aut = 100000
for c in s:
if int(c)<mn:
mn = int(c)
minres = 100000
count = 0
if count!=0 and int(c)==mn:
if count<minres:
minres = count
if minres<aut:
aut = minres
count=0
count+=1
print(aut)
|
n = int(input())
s = input()
a = []
s = s.split()
mn = 1000000001
count = 0
minres = 100000
aut = 100000
for c in s:
if int(c)<mn:
mn = int(c)
minres = 100000
count = 0
if count!=0 and int(c)<mn:
if count<minres:
minres = count
if minres<aut:
aut = minres
count=0
count+=1
print(aut)
|
if count!=0 and int(c)<mn:
| 14 |
decision
|
n = int(input())
s = input()
a = []
s = s.split()
mn = 1000000001
count = 0
minres = 100000
aut = 100000
for c in s:
if int(c)<mn:
mn = int(c)
minres = 100000
count = 0
if count!=0 and int(c)==mn:
if count<minres:
minres = count
if minres<aut:
aut = minres
count=0
count+=1
print(aut)
|
n = int(input())
s = input()
a = []
s = s.split()
mn = 1000000001
count = 0
minres = 100000
aut = 100000
for c in s:
if int(c)<mn:
mn = int(c)
minres = 100000
count = 0
if count!=0 and int(c)==mn:
if count>minres:
minres = count
if minres<aut:
aut = minres
count=0
count+=1
print(aut)
|
if count>minres:
| 15 |
decision
|
n = int(input())
s = input()
a = []
s = s.split()
mn = 1000000001
count = 0
minres = 100000
aut = 100000
for c in s:
if int(c)<mn:
mn = int(c)
minres = 100000
count = 0
if count!=0 and int(c)==mn:
if count<minres:
minres = count
if minres<aut:
aut = minres
count=0
count+=1
print(aut)
|
n = int(input())
s = input()
a = []
s = s.split()
mn = 1000000001
count = 0
minres = 100000
aut = 100000
for c in s:
if int(c)<mn:
mn = int(c)
minres = 100000
count = 0
if count!=0 and int(c)==mn:
if count>minres:
minres = count
if minres<aut:
aut = minres
count=0
count+=1
print(aut)
|
if count>minres:
| 15 |
decision
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i - mi < mm:
mm = i<<mi
mi = i
print(mm)
|
mm = i<<mi
| 15 |
operation
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i+mi < mm:
mm = i - mi
mi = i
print(mm)
|
if not mm or i+mi < mm:
| 14 |
operation
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v<m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
elif v<m:
| 13 |
decision
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i%mi < mm:
mm = i - mi
mi = i
print(mm)
|
if not mm or i%mi < mm:
| 14 |
operation
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v == m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
n = int(input())
a = [int(s) for s in input().split()]
m = None
mi = None
mm = None
for i, v in enumerate(a):
if not m or v < m:
m = v
mi = i
mm = None
elif v<m:
if not mm or i - mi < mm:
mm = i - mi
mi = i
print(mm)
|
elif v<m:
| 13 |
decision
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m^v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
e[0] += m^v[0]
| 11 |
operation
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m>>v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
e[0] += m>>v[0]
| 11 |
operation
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])//(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])//(d[1]-e[1]) <= V*V*m*m:
| 18 |
operation
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m&v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
e[0] += m&v[0]
| 11 |
operation
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in range(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
d = list(map(int, input().split()))
V, T = map(int, input().split())
v = tuple(map(int, input().split()))
w = tuple(map(int, input().split()))
o = d[0:2]
d = d[2:4]
l, r = 0, 100000
for i in z(100):
m, e = (l+r)/2, o[:]
if m <= T:
e[0] += m * v[0]
e[1] += m * v[1]
else:
e[0] += T * v[0]
e[1] += T * v[1]
e[0] += (m - T) * w[0]
e[1] += (m - T) * w[1]
if (d[0]-e[0])*(d[0]-e[0]) + (d[1]-e[1])*(d[1]-e[1]) <= V*V*m*m:
a = m
r = m - 0.000001
else:
l = m + 0.000001
print(a)
|
for i in z(100):
| 8 |
statement
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - x[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
m = (a[i+1] - x[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
| 18 |
statement
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]&1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
b.append(max(n-a[0]&1, a[0]))
| 8 |
operation
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, x[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
b.append(max(n-a[0]+1, x[0]))
| 8 |
statement
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i]==m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
if a[i+1] - a[i]==m:
| 14 |
decision
|
t = int(input())
a=[]
b = []
for i in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
t = int(input())
a=[]
b = []
for i in range(t):
z,k = map(int,input().split())
a = list(map(int,input().split()))
if k == 1:
b.append(max(n-a[0]+1, a[0]))
else:
z = max(a[0],n-a[k-1])
m = 0
mi = 0
for i in range(k-1):
if a[i+1] - a[i] > m:
if a[i+1] - a[i] == 1:
m = 1
else:
m = (a[i+1] - a[i]-1)//2 + 1 + (a[i+1] - a[i]-1)%2
b.append(max(z,m))
for i in range(t):
print(b[i])
|
z,k = map(int,input().split())
| 5 |
statement
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k>=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k<=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
if k<=x:
| 4 |
decision
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k>=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k<=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
if k<=x:
| 4 |
decision
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k>=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k<=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
if k<=x:
| 4 |
decision
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k>=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k<=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
if k<=x:
| 4 |
decision
|
n, k=map(int, input().split())
x=len(bin(n))-2
if k>=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
n, k=map(int, input().split())
x=len(bin(n))>>2
if k>=x:
print (2**x-1)
else:
print((2**k-1)<<(x-k))
|
x=len(bin(n))>>2
| 2 |
operation
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check +1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check +1
change += 1
check += 1
else:
check = li[i]
return y
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
return y
| 15 |
statement
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check +1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check^1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
li[i] = check^1
| 10 |
operation
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check +1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check +1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)//1))
|
print (max(0,min_changes(a)//1))
| 19 |
operation
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check +1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
def min_changes(li):
change, check = 0, 0
li_len = len(li)
if li_len in [0,1]:
return change
else:
check = li[0]
for i in range(1, len(li)):
if check >= li[i]:
li[i] = check**1
change += 1
check += 1
else:
check = li[i]
return change
n = input()
a = list(map(int,input().split()))
print (max(0,min_changes(a)-1))
|
li[i] = check**1
| 10 |
operation
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i]==0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
if (n//a[i]==0)and(n%a[i] < minimumremainder):
| 10 |
decision
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype/1])
|
print(boxtype, n//a[boxtype/1])
| 10 |
operation
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n&a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
minimumremainder = n&a[i]
| 10 |
operation
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i]>minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
if (n//a[i] > 0)and(n%a[i]>minimumremainder):
| 10 |
decision
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,1
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,184
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
print(boxtype, n//a[boxtype-1])
|
minimumremainder,boxtype= n,184
| 10 |
value
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s**i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
maxi = max(maxi, s**i + buf)
| 10 |
operation
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i]<2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
while i < n and v[i]<2: i += 1
| 13 |
decision
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i>n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
while i>n and v[i] == 1: i += 1
| 12 |
decision
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i>n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
while i>n and v[i] == 2: i += 1
| 9 |
decision
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 0
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
n = int(input())
v = [int(x) for x in input().split()]
i = 0
maxi = 0
buf = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, s - i + buf)
f, buf = i, 38
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
buf = i - s
maxi = max(maxi, i - s)
print(maxi)
|
f, buf = i, 38
| 11 |
value
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m>t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
if (m>t):
| 14 |
decision
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n))<0:
print(n)
else:
print(((d+r)%(n)))
|
if ((d+r)%(n))<0:
| 18 |
decision
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n))<0:
print(n)
else:
print(((d+r)%(n)))
|
if ((d+r)%(n))<0:
| 18 |
decision
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m>t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
if (m>t):
| 14 |
decision
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m<t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
n = int(input())
l = [int(x) for x in input().split()]
s = input().split()
f = int(s[1])
s = int(s[0])
d = abs((n+(f-s))%(n))
m = 0
r = 0
for i in range(n):
t = 0
for j in range(d):
t += l[(i+j)%n]
if (m>t):
m = t
r = i
if ((d+r)%(n)) == 0:
print(n)
else:
print(((d+r)%(n)))
|
if (m>t):
| 14 |
decision
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))==(num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
while ((4*a) + (2*b))==(num * n):
| 3 |
decision
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))==(num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
while ((4*a) + (2*b))==(num * n):
| 3 |
decision
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))==(num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
while ((4*a) + (2*b))==(num * n):
| 3 |
decision
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a)%(2*b)) > (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
while ((4*a)%(2*b)) > (num * n):
| 3 |
operation
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))==(num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b))
|
while ((4*a) + (2*b))==(num * n):
| 3 |
decision
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j<i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
if j<i:
| 9 |
decision
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j<i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
if j<i:
| 9 |
decision
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j]^b[k], ti)
kek = min(kek, ti)
print(kek)
|
ti = max(a[j]^b[k], ti)
| 12 |
operation
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
z, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
z, m = map(int, input().split())
| 1 |
statement
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j == i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
kek = 1000000000000000000
for i in range(n):
l = 0
ti = -1000000000000000000
for j in range(n):
if j<i:
continue
for k in range(m):
ti = max(a[j] * b[k], ti)
kek = min(kek, ti)
print(kek)
|
if j<i:
| 9 |
decision
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert z[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
assert z[0] >= 2 and about_cycle[0] <= 1000
| 14 |
statement
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1]|points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
dist = points[-1]|points[0]
| 20 |
operation
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0]>=1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
assert about_cycle[0] >= 2 and about_cycle[0]>=1000
| 14 |
decision
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0]<=2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
assert about_cycle[0]<=2 and about_cycle[0] <= 1000
| 14 |
decision
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1] >= 1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
import sys
a = []
for line in sys.stdin:
a.append(line.strip())
assert len(a)==2
about_cycle = [int(i) for i in a[0].split(' ')]
assert len(about_cycle)==2
points = [int(i) for i in a[1].split(' ')]
assert len(points) >= 2
assert about_cycle[0] >= 2 and about_cycle[0] <= 1000
assert about_cycle[1]<=1 and about_cycle[1] <= 100000
if about_cycle[1] < points[1]-points[0]:
print('-1')
else:
dist = points[-1] - points[0]
i = 0
while dist > 0:
i += 1
dist -= about_cycle[1]
print(i)
|
assert about_cycle[1]<=1 and about_cycle[1] <= 100000
| 15 |
decision
|
n = int(input())
mat = [1,1]
res = ""
for i in range(n):
if (i+1) in mat:
res += "O"
mat[0],mat[1] = mat[1],(mat[0]+mat[1])
else:
res += "o"
print(res)
|
n = int(input())
mat = [1,1]
res = ""
for i in range(n):
if (i+1) in mat:
res += "O"
mat[0],mat[1] = mat[1],(mat[0]^mat[1])
else:
res += "o"
print(res)
|
mat[0],mat[1] = mat[1],(mat[0]^mat[1])
| 7 |
operation
|
n = int(input())
mat = [1,1]
res = ""
for i in range(n):
if (i+1) in mat:
res += "O"
mat[0],mat[1] = mat[1],(mat[0]+mat[1])
else:
res += "o"
print(res)
|
n = int(input())
mat = [1,1]
res = ""
for i in range(n):
if (i+1) in mat:
res += "O"
mat[0],mat[1] = mat[1],(mat[0]+mat[121])
else:
res += "o"
print(res)
|
mat[0],mat[1] = mat[1],(mat[0]+mat[121])
| 7 |
value
|
n = int(input())
mat = [1,1]
res = ""
for i in range(n):
if (i+1) in mat:
res += "O"
mat[0],mat[1] = mat[1],(mat[0]+mat[1])
else:
res += "o"
print(res)
|
n = int(input())
mat = [1,64]
res = ""
for i in range(n):
if (i+1) in mat:
res += "O"
mat[0],mat[1] = mat[1],(mat[0]+mat[1])
else:
res += "o"
print(res)
|
mat = [1,64]
| 2 |
value
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n+int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
q = (n+int(a[i]))
| 11 |
operation
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 126
print(str(w) + " " + str(q))
|
w = i + 126
| 12 |
value
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 33
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
w = 33
| 8 |
value
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 119
print(str(w) + " " + str(q))
|
w = i + 119
| 12 |
value
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(a[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
n, k = input().split()
n = int(n)
k = int(k)
a = []
s = input()
a = s.split()
q = 0
w = 0
for i in range(k):
if (n // int(a[i]))*int(x[i]) > q*int(a[i]):
q = (n // int(a[i]))
w = i + 1
print(str(w) + " " + str(q))
|
if (n // int(a[i]))*int(x[i]) > q*int(a[i]):
| 10 |
statement
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y@1)%2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
if ((x-y@1)%2)==0 and (y-1)<=x:
| 10 |
operation
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y-1)>=x:
print ("YES")
else :
print("NO")
|
if ((x-y-1)%2)==0 and (y-1)>=x:
| 10 |
decision
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)*2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
if ((x-y-1)*2)==0 and (y-1)<=x:
| 10 |
operation
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)<<2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
if ((x-y-1)<<2)==0 and (y-1)<=x:
| 10 |
operation
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y-1)<=x:
print ("YES")
else :
print("NO")
|
slic = input("")
l = []
l = slic.split(' ')
x=int(l[0])
y=int(l[1])
if ((x-y-1)%2)==0 and (y&1)<=x:
print ("YES")
else :
print("NO")
|
if ((x-y-1)%2)==0 and (y&1)<=x:
| 10 |
operation
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+142)
|
print(pos-r+142)
| 24 |
value
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=110:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
elif r==n and l!=110:
| 5 |
value
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+95)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
print(2*b+a+95)
| 14 |
value
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos==r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
elif pos==r:
| 20 |
decision
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+2)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos <=r:
if l==1 and r!=n:
print(r-pos+1)
elif r==n and l!=1:
print(pos-l+1)
elif l==1 and r==n:
print(0)
else:
x=pos-l
y=r-pos
a=max(x,y)
b=min(x,y)
print(2*b+a+65)
elif pos<l:
if r!=n:
print(r-pos+2)
else:
print(l-pos+1)
elif pos>r:
if l!=1:
print(pos-l+2)
else:
print(pos-r+1)
|
print(2*b+a+65)
| 14 |
value
|
t = int(input())
for T in range(t):
n, k = map(int, input().split())
a = list(map(int, input().split()))
res = max(a[0], n - a[-1] + 1)
last = a[0]
for x in a[1:]:
res = max(res, (x + 1 - last) // 2)
last = x
print(res)
|
t = int(input())
for T in range(t):
n, k = map(int, input().split())
a = list(map(int, input().split()))
res = max(a[0], n - a[-1] + 1)
last = a[0]
for x in a[1:]:
res = max(res, (x + 1 - last) // 2)
last = x
print(x)
|
print(x)
| 11 |
statement
|
t = int(input())
for T in range(t):
n, k = map(int, input().split())
a = list(map(int, input().split()))
res = max(a[0], n - a[-1] + 1)
last = a[0]
for x in a[1:]:
res = max(res, (x + 1 - last) // 2)
last = x
print(res)
|
t = int(input())
for T in range(t):
n, k = map(int, input().split())
a = list(map(int, input().split()))
res = max(a[0], n - a[-1]+1)
last = a[0]
for x in a[1:]:
res = max(res, (x + 1 - last) // 2)
last = x
print(res)
|
res = max(a[0], n - a[-1]+1)
| 5 |
operation
|
t=int(input())
for i in range(t):
n=int(input())
L=[]
res=[]
for j in range(n):
l,r=map(int,input().split())
L.insert(0,(l,r))
sec=L[-1][0]
while len(L)!=0:
tup=L.pop()
if tup[0]<=sec:
if tup[1]>=sec:
res.append(sec)
sec+=1
else:
res.append(0)
else:
sec=tup[0]
res.append(sec)
sec+=1
print(*res)
|
t=int(input())
for i in range(t):
n=int(input())
L=[]
res=[]
for j in range(n):
l,r=map(int,input().split())
L.insert(0,(l,r))
sec=L[-1][0]
while len(L)!=0:
tup=L.pop()
if tup[0]>=sec:
if tup[1]>=sec:
res.append(sec)
sec+=1
else:
res.append(0)
else:
sec=tup[0]
res.append(sec)
sec+=1
print(*res)
|
if tup[0]>=sec:
| 12 |
decision
|
t=int(input())
for i in range(t):
n=int(input())
L=[]
res=[]
for j in range(n):
l,r=map(int,input().split())
L.insert(0,(l,r))
sec=L[-1][0]
while len(L)!=0:
tup=L.pop()
if tup[0]<=sec:
if tup[1]>=sec:
res.append(sec)
sec+=1
else:
res.append(0)
else:
sec=tup[0]
res.append(sec)
sec+=1
print(*res)
|
t=int(input())
for i in range(t):
n=int(input())
L=[]
res=[]
for j in range(n):
l,r=map(int,input().split())
L.insert(0,(l,r))
sec=L[-1][0]
while len(L)!=0:
tup=L.pop()
if tup[0]<=sec:
if tup[1]>=sec:
res.append(sec)
sec+=20
else:
res.append(0)
else:
sec=tup[0]
res.append(sec)
sec+=1
print(*res)
|
sec+=20
| 15 |
value
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c+1
print(c)
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]<=a and d[i]<=b):
c=c+1
print(c)
|
if(d[i]<=a and d[i]<=b):
| 8 |
decision
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c+1
print(c)
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c|1
print(c)
|
c=c|1
| 8 |
operation
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c+1
print(c)
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c&1
print(c)
|
c=c&1
| 8 |
operation
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c+1
print(c)
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]>=b):
c=c+1
print(c)
|
if(d[i]>=a and d[i]>=b):
| 8 |
decision
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c+1
print(c)
|
a,b=map(int,input().split(" "))
d=[1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, 648, 729, 768, 864, 972, 1024, 1152, 1296, 1458, 1536, 1728, 1944, 2048, 2187, 2304, 2592, 2916, 3072, 3456, 3888, 4096, 4374, 4608, 5184, 5832, 6144, 6561, 6912, 7776, 8192, 8748, 9216, 10368, 11664, 12288, 13122, 13824, 15552, 16384, 17496, 18432, 19683, 20736, 23328, 24576, 26244, 27648, 31104, 32768, 34992, 36864, 39366, 41472, 46656, 49152, 52488, 55296, 59049, 62208, 65536, 69984, 73728, 78732, 82944, 93312, 98304, 104976, 110592, 118098, 124416, 131072, 139968, 147456, 157464, 165888, 177147, 186624, 196608, 209952, 221184, 236196, 248832, 262144, 279936, 294912, 314928, 331776, 354294, 373248, 393216, 419904, 442368, 472392, 497664, 524288, 531441, 559872, 589824, 629856, 663552, 708588, 746496, 786432, 839808, 884736, 944784, 995328, 1048576, 1062882, 1119744, 1179648, 1259712, 1327104, 1417176, 1492992, 1572864, 1594323, 1679616, 1769472, 1889568, 1990656, 2097152, 2125764, 2239488, 2359296, 2519424, 2654208, 2834352, 2985984, 3145728, 3188646, 3359232, 3538944, 3779136, 3981312, 4194304, 4251528, 4478976, 4718592, 4782969, 5038848, 5308416, 5668704, 5971968, 6291456, 6377292, 6718464, 7077888, 7558272, 7962624, 8388608, 8503056, 8957952, 9437184, 9565938, 10077696, 10616832, 11337408, 11943936, 12582912, 12754584, 13436928, 14155776, 14348907, 15116544, 15925248, 16777216, 17006112, 17915904, 18874368, 19131876, 20155392, 21233664, 22674816, 23887872, 25165824, 25509168, 26873856, 28311552, 28697814, 30233088, 31850496, 33554432, 34012224, 35831808, 37748736, 38263752, 40310784, 42467328, 43046721, 45349632, 47775744, 50331648, 51018336, 53747712, 56623104, 57395628, 60466176, 63700992, 67108864, 68024448, 71663616, 75497472, 76527504, 80621568, 84934656, 86093442, 90699264, 95551488, 100663296, 102036672, 107495424, 113246208, 114791256, 120932352, 127401984, 129140163, 134217728, 136048896, 143327232, 150994944, 153055008, 161243136, 169869312, 172186884, 181398528, 191102976, 201326592, 204073344, 214990848, 226492416, 229582512, 241864704, 254803968, 258280326, 268435456, 272097792, 286654464, 301989888, 306110016, 322486272, 339738624, 344373768, 362797056, 382205952, 387420489, 402653184, 408146688, 429981696, 452984832, 459165024, 483729408, 509607936, 516560652, 536870912, 544195584, 573308928, 603979776, 612220032, 644972544, 679477248, 688747536, 725594112, 764411904, 774840978, 805306368, 816293376, 859963392, 905969664, 918330048, 967458816, 1019215872, 1033121304, 1073741824, 1088391168, 1146617856, 1162261467, 1207959552, 1224440064, 1289945088, 1358954496, 1377495072, 1451188224, 1528823808, 1549681956, 1610612736, 1632586752, 1719926784, 1811939328, 1836660096, 1934917632, 2038431744]
c=0
for i in range (0,326):
if(d[i]>=a and d[i]<=b):
c=c<<1
print(c)
|
c=c<<1
| 8 |
operation
|
input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p > 0:
res += 1
print(res)
|
input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p > 0:
res += 1
print(x)
|
print(x)
| 10 |
statement
|
input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p > 0:
res += 1
print(res)
|
input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p==0:
res += 1
print(res)
|
if p==0:
| 7 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.