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=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b|[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
b=b|[q for i in range(m[q])]
| 28 |
operation
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])>n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
if n-2*min(m[q],m[s])>n-m[r]//2*2:
| 15 |
decision
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)//min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
if max(a)//min(a)<2:
| 4 |
operation
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n>>2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
if n>>2*min(m[q],m[s])<n-m[r]//2*2:
| 15 |
operation
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(0)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
n=int(input())
x=input()
a=list(map(int,x.split()))
if max(a)-min(a)<2:
print(n)
print(x)
exit(138)
s=set(a)
q=min(a)
s=max(a)
r=(q+s)//2
m={}
m[q]=m[s]=m[r]=0
for i in a:m[i]+=1
if n-2*min(m[q],m[s])<n-m[r]//2*2:
print(n-2*min(m[q],m[s]))
e=min(m[q],m[s])
m[r]+=e+e
m[q]-=e
m[s]-=e
else:
print(n-m[r]//2*2)
e=m[r]//2
m[r]-=e+e
m[q]+=e
m[s]+=e
b=[r for i in range(m[r])]
b=b+[q for i in range(m[q])]
b=b+[s for i in range(m[s])]
print(' '.join(str(x) for x in b))
|
exit(138)
| 7 |
value
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a<end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
elif a<end:
| 19 |
decision
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.y(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
condition.y(0)
| 20 |
statement
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(x)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
result.append(x)
| 11 |
statement
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a-1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
condition.insert(0, (a-1, end ))
| 25 |
operation
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 1))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
n, k = input().split()
n = int(n)
k = int(k)
prefix = [int(i) for i in input().split()]
condition = [(1, n)]
numssofar = []
result = []
for a in prefix:
begin, end = condition[0]
if begin <= a <= end:
result.append(a)
if begin == end:
condition.pop(0)
continue
elif a == begin:
condition.pop(0)
condition.insert(0, (begin + 1 , end))
continue
elif a == end:
condition.pop(0)
condition.insert(0, (begin , end - 53))
continue
else:
condition.pop(0)
condition.insert(0, (a + 1, end ))
condition.insert(0, (begin, a - 1))
else:
print(-1)
exit()
for a in condition:
x, y = a
result += range(y, x - 1, -1)
print(*result)
|
condition.insert(0, (begin , end - 53))
| 21 |
value
|
inp = input().split(' ')
a = int(inp[0])
b = int(inp[1])
inp = input().split(' ')
x = int(inp[0])
y = int(inp[1])
z = int(inp[2])
foo = (2*x + y) - a
bar = (3*z + y) - b
print(foo + bar)
|
inp = input().split(' ')
a = int(inp[0])
b = int(inp[1])
inp = input().split(' ')
x = int(inp[0])
y = int(inp[1])
z = int(inp[2])
foo = (2&x + y) - a
bar = (3*z + y) - b
print(foo + bar)
|
foo = (2&x + y) - a
| 10 |
operation
|
inp = input().split(' ')
a = int(inp[0])
b = int(inp[1])
inp = input().split(' ')
x = int(inp[0])
y = int(inp[1])
z = int(inp[2])
foo = (2*x + y) - a
bar = (3*z + y) - b
print(foo + bar)
|
inp = input().split(' ')
a = int(inp[0])
b = int(inp[1])
inp = input().split(' ')
x = int(inp[0])
y = int(inp[1])
z = int(inp[2])
foo = (2|x + y) - a
bar = (3*z + y) - b
print(foo + bar)
|
foo = (2|x + y) - a
| 10 |
operation
|
inp = input().split(' ')
a = int(inp[0])
b = int(inp[1])
inp = input().split(' ')
x = int(inp[0])
y = int(inp[1])
z = int(inp[2])
foo = (2*x + y) - a
bar = (3*z + y) - b
print(foo + bar)
|
inp = input().split(' ')
a = int(inp[0])
b = int(inp[1])
inp = input().split(' ')
x = int(inp[0])
y = int(inp[1])
z = int(inp[2])
foo = (2*x + y)|a
bar = (3*z + y) - b
print(foo + bar)
|
foo = (2*x + y)|a
| 10 |
operation
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev<'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
if prev<'R':
| 14 |
decision
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev<"U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
if prev<"U":
| 7 |
decision
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-68] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
z[-68] = 'D'
| 16 |
value
|
input()
s = input()
z = []
prev =""
for el in s:
if el == "R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
input()
s = input()
z = []
prev =""
for el in s:
if el<"R":
if prev == "U":
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "R"
else:
if prev == 'R':
prev = ""
z[-1] = 'D'
else:
z.append(el)
prev = "U"
print(len(z))
|
if el<"R":
| 6 |
decision
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(98, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
for a in range(98, 10 ** 9 + 1):
| 12 |
value
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i>=10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
while (a ** i>=10 ** 18):
| 5 |
decision
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10/18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
while (a ** i <= 10/18):
| 5 |
operation
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 6
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
res[1] = 6
| 11 |
value
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i <= 10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
import numpy as np
def make_arr(a, res):
i = 2
while (a ** i>=10 ** 18):
res[a ** i] = 1
i += 1
def main():
res = np.zeros(10 ** 18 + 1)
res[1] = 1
for a in range(2, 10 ** 9 + 1):
make_arr(a, res)
Q = int(input())
for i in range(Q):
L, R = map(int, input().split())
print(np.sum(res[L : R]) + res[R])
main()
|
while (a ** i>=10 ** 18):
| 5 |
decision
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b-1]==i+1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b^1]==i+1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
|
if l1[b^1]==i+1:
| 7 |
operation
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b-1]==i+1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b-1]==i+1:
flag=1
break
if flag<1:
print("YES")
else:
print("NO")
|
if flag<1:
| 10 |
decision
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b-1]==i+1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b-1]==i+1:
flag=1
break
if flag==104:
print("YES")
else:
print("NO")
|
if flag==104:
| 10 |
value
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b-1]==i+1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
|
n=int(input())
l1=list(map(int,input().split()))
flag=0
for i in range(len(l1)):
a=l1[i]
b=l1[a-1]
if l1[b/1]==i+1:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
|
if l1[b/1]==i+1:
| 7 |
operation
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best<100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
if best<100500:
| 23 |
decision
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 2:
stdout.write("-1")
else:
stdout.write(str(best))
|
if best == 2:
| 23 |
value
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best<100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
if best<100500:
| 23 |
decision
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x]/graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
for el in graph[x]/graph[y]:
| 20 |
operation
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x-1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
from sys import stdin, stdout
input = stdin.readline
n, m = map(int, input().split())
graph =[set([]) for _ in range(n)]
popularity = [0 for _ in range(n)]
connections = []
for _ in range(m):
x, y = map(int, input().split())
x, y = x<<1, y-1
graph[x].add(y)
graph[y].add(x)
popularity[x] += 1
popularity[y] += 1
connections.append((x,y))
best = 100500
for x,y in connections:
for el in graph[x] & graph[y]:
best = min(popularity[x] + popularity[y] + popularity[el] - 6, best)
if best == 100500:
stdout.write("-1")
else:
stdout.write(str(best))
|
x, y = x<<1, y-1
| 11 |
operation
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1%q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
tireness = (1%q) * q
| 6 |
operation
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q)^q
if r == 1:
tireness += (q + 1)
print(tireness)
|
tireness = (1 + q)^q
| 6 |
operation
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1//q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
tireness = (1//q) * q
| 6 |
operation
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
a = x(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
a = x(input())
| 1 |
statement
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r == 1:
tireness += (q + 1)
print(tireness)
|
a = int(input())
b = int(input())
d = abs(a - b)
q, r = divmod(d, 2)
tireness = (1 + q) * q
if r<1:
tireness += (q + 1)
print(tireness)
|
if r<1:
| 8 |
decision
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
n = int(input())
a = int(input())
b = int(y())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
b = int(y())
| 3 |
statement
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = z.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
max_2 = z.index(n)
| 33 |
statement
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 160
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
akrat = 160
| 7 |
value
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]*6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
n = int(input())
a = int(input())
b = int(input())
max_1 = 6
max_2 = 6
akrat = 4
pole = [n]*6
pole[0] += -b
pole[1] += -b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_1 = pole.index(n)
else:
max_1 = 6
if n >=2*b:
akrat = 4
pole = [n]/6
pole[0] += -2*b
while akrat >0:
for i in range(6):
if pole[i]>=a:
pole[i] +=-a
akrat+=-1
break
if n in pole:
max_2 = pole.index(n)
else:
max_2 = 6
print(min(max_1,max_2))
|
pole = [n]/6
| 24 |
operation
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(165)
|
print(165)
| 12 |
value
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r==l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
while r==l + 1:
| 4 |
decision
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
y(l-1)
else:
print(1)
|
y(l-1)
| 10 |
statement
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m==n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
if a/m + b/m==n:
| 6 |
decision
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m > n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
n,a,b = [int(x) for x in input().split()]
l = 0
r = (a + b + n)//n
while r > l + 1:
m = (l+r)//2
if a/m + b/m==n:
l = m
else: r = m
if l > 0:
print(l-1)
else:
print(1)
|
if a/m + b/m==n:
| 6 |
decision
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y<1) and (x == 0)):
print('Yes')
else:
print('No')
|
elif ((y<1) and (x == 0)):
| 10 |
decision
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
y, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
y, y = map(int,input().split())
| 1 |
statement
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
x, y = map(int,input().split())
if (y>1):
kolvo = x<<y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
kolvo = x<<y + 1
| 3 |
operation
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
x, y = map(int,input().split())
if (y==1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
if (y==1):
| 2 |
decision
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 0):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
x, y = map(int,input().split())
if (y>1):
kolvo = x - y + 1
if kolvo<0:
print('No')
elif ((kolvo % 2) == 44):
print('Yes')
else:
print('No')
elif ((y == 1) and (x == 0)):
print('Yes')
else:
print('No')
|
elif ((kolvo % 2) == 44):
| 6 |
value
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w<0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
if y%w<0:
| 12 |
decision
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p**1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
for w in range(2,p**1):
| 9 |
operation
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w%w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
if w%w>y:
| 10 |
operation
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w<0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
if y%w<0:
| 12 |
decision
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p+1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
def main():
p,y=map(int,input().split())
i=0
while i<(10**5)*5:
if y<=p:
break
i+=1
pr=True
for w in range(2,p-1):
if w*w>y:
break
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
for w in range(2,p-1):
| 9 |
operation
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 184
counter += 1
print(counter)
|
d = minutes2 % 184
| 25 |
value
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and z >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
elif hours != 1 and z >= minutes1:
| 17 |
statement
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a|b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
hours1 = 10 * a|b
| 10 |
operation
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval >= minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
interval = int(input())
hours, minutes = map(int, input().split())
a = hours // 10
b = hours % 10
c = minutes // 10
d = minutes % 10
counter = 0
while a != 7 and b!= 7 and c != 7 and d != 7:
minutes1 = 10 * c + d
hours1 = 10 * a + b
if hours1 == 0 and interval<=minutes1:
a = 2
b = 3
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif hours != 1 and interval >= minutes1:
b -= 1
minutes2 = 60 - (interval - minutes1)
c = minutes2 // 10
d = minutes2 % 10
elif interval < minutes1:
minutes2 = minutes1 - interval
c = minutes2 // 10
d = minutes2 % 10
counter += 1
print(counter)
|
if hours1 == 0 and interval<=minutes1:
| 11 |
decision
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r>0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
if p+r>0:
| 28 |
decision
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i-1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
for j in range(i-1,n):
| 12 |
operation
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
s = input()
n = len(s)
ret = 195
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
ret = 195
| 4 |
value
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(x,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
print(x,r)
| 27 |
statement
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i+1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
s = input()
n = len(s)
ret = 0
for i in range(n):
p = 0
r = 0
if s[i] == '(' or s[i] == '?':
p += 1
else:
continue
for j in range(i%1,n):
print(s[i:j+1])
if s[j] == '(':
p += 1
elif s[j] == '?':
if p == 0:
p += 1
else:
r += 1
else:
p -= 1
if p == 0:
if r > 0:
p += 1
r -= 1
print(p,r)
if p+r<0:
break
if s[j] != '(':
if (r-p)>=0 and (r-p)%2==0:
ret += 1
print('booom')
print(ret)
|
for j in range(i%1,n):
| 12 |
operation
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r]<"W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r]<"W":
| 20 |
decision
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n//1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
if 0 <= e + i <= n//1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
| 20 |
operation
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r@j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
if 0 <= e + i <= n-1 and 0 <= r@j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
| 17 |
operation
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j]<"S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
if a[i][j]<"S":
| 13 |
decision
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=1
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
n, k = map(int, input().split())
a = [["." for _ in range(k)] for _ in range(n)]
i, j, yy = 0, 0, 0
for q in range(n):
t = input()
for w in range(k):
if t[w] != ".":
a[q][w] = t[w]
while i != n and yy == 0:
if a[i][j] == "S":
ar = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for p in range(4):
e, r = ar[p]
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] != "W" and a[i + e][j + r] != "S":
a[i + e][j + r] = "D"
else:
if 0 <= e + i <= n-1 and 0 <= r + j <= k - 1 and a[i + e][j + r] == "W":
yy = 1
break
if j == k - 1:
i += 1
j = 0
else:
j +=124
else:
if j == k - 1:
i += 1
j = 0
else:
j +=1
if yy == 1:
print("No")
else:
print("Yes")
for i in a:
print("".join(i))
|
j +=124
| 27 |
value
|
l = input()
n = list(map(int, input().split()))
n.sort()
n.pop()
m = list(map(int, input().split()))
m.sort()
x1 = n[0] * m[0]
x2 = n[-1] * m[-1]
x3 = n[0] * m[-1]
x4 = n[-1] * m[0]
c = max(max(x1, x2), max(x3, x4))
print(c)
|
l = input()
n = list(map(int, input().split()))
n.sort()
n.pop()
m = list(map(int, input().split()))
m.sort()
x1 = n[0] * m[0]
x2 = n[-1] * m[-1]
x3 = n[0]<<m[-1]
x4 = n[-1] * m[0]
c = max(max(x1, x2), max(x3, x4))
print(c)
|
x3 = n[0]<<m[-1]
| 13 |
operation
|
l = input()
n = list(map(int, input().split()))
n.sort()
n.pop()
m = list(map(int, input().split()))
m.sort()
x1 = n[0] * m[0]
x2 = n[-1] * m[-1]
x3 = n[0] * m[-1]
x4 = n[-1] * m[0]
c = max(max(x1, x2), max(x3, x4))
print(c)
|
l = input()
n = list(map(int, input().split()))
n.sort()
n.pop()
m = list(map(int, input().split()))
m.sort()
x1 = n[0] * m[0]
x2 = n[-1] * m[-1]
x3 = n[0] * m[-1]
x4 = n[-1]<<m[0]
c = max(max(x1, x2), max(x3, x4))
print(c)
|
x4 = n[-1]<<m[0]
| 14 |
operation
|
l = input()
n = list(map(int, input().split()))
n.sort()
n.pop()
m = list(map(int, input().split()))
m.sort()
x1 = n[0] * m[0]
x2 = n[-1] * m[-1]
x3 = n[0] * m[-1]
x4 = n[-1] * m[0]
c = max(max(x1, x2), max(x3, x4))
print(c)
|
l = input()
n = list(map(int, input().split()))
n.sort()
n.pop()
m = list(map(int, input().split()))
m.sort()
x1 = n[0]*m[0]
x2 = n[-1] * m[-1]
x3 = n[0] * m[-1]
x4 = n[-1] * m[0]
c = max(max(x1, x2), max(x3, x4))
print(c)
|
x1 = n[0]*m[0]
| 11 |
operation
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
n=int(input())
f=0
if n<987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
if n<987654323:
| 3 |
decision
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not y:
print(-1)
|
if not y:
| 24 |
statement
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//135)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
q=(n//135)//p
| 19 |
value
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q+2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
if abs(p**2-q**2)/2==abs(p**2-q+2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
| 11 |
operation
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2+1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
n=int(input())
f=0
if n==987654323:
print(-1)
f=1
elif n%2==1:
for i in range(1,n//2//1,2):
if n%i==0:
p=i
q=n//p
if abs(p**2-q**2)/2==abs(p**2-q**2)//2 and abs(p**2+q**2)/2==abs(p**2+q**2)//2:
print(abs(p**2-q**2)//2,abs(p**2+q**2)//2)
f=1
break
else:
for i in range(1,n//2+1):
if (n//2)%i==0:
p=i
q=(n//2)//p
if abs(p**2-q**2)>0 and abs(p**2+q**2)>0:
print(abs(p**2-q**2),abs(p**2+q**2))
f=1
break
if not f:
print(-1)
|
for i in range(1,n//2//1,2):
| 7 |
operation
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 138
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
k = 138
| 8 |
value
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2<1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
if k % 2<1:
| 12 |
decision
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k>>2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
if k>>2 == 1:
| 12 |
operation
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2<1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
if k % 2<1:
| 12 |
decision
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2<1:
flag = True
if flag:
print("Conan")
else:
print("Agasa")
|
if k % 2<1:
| 12 |
decision
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9*p-8)
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
y+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9*p-8)
|
y+=y
| 7 |
statement
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9*p-8)
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a-10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9*p-8)
|
y=a-10
| 5 |
operation
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9*p-8)
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)<10:
t+=1
p+=1
print(9*p-8)
|
if jam(9*p+1)<10:
| 12 |
decision
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9*p-8)
|
n=int(input())
def jam(a):
m=0
while a!=0:
y=a%10
a//=10
m+=y
return m
t=0
p=2
while t!=n:
if jam(9*p+1)==10:
t+=1
p+=1
print(9^p-8)
|
print(9^p-8)
| 15 |
operation
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i>int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
while i>int(len(a))-1:
| 5 |
decision
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i//2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
i=i//2
| 11 |
operation
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])<ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
elif ord(a[i])<ord(a[i+1]):
| 8 |
decision
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i>int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
while i>int(len(a))-1:
| 5 |
decision
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i/1])-1:
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
print(-1)
exit(0)
i=i+1
print (b)
|
if ord(a[i])<ord(a[i/1])-1:
| 6 |
operation
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [65]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
a= [65]*10
| 7 |
value
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2<1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
if l%2<1 and l>2:
| 4 |
decision
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a)<0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
if sum(a)<0:
| 11 |
decision
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n/1))
|
print(get_beautiful(n/1))
| 18 |
operation
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2 == 1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
def get_beautiful(n):
s = str(n)
l = len(s)
if l%2<1 and l>2:
return '9'*(l-1)
a= [0]*10
for i in s:
a[int(i)] = (a[int(i)]+1) %2
if sum(a) ==0:
return n
else:
return get_beautiful(n-1)
for _ in range(int(input())):
n = int(input())
print(get_beautiful(n-1))
|
if l%2<1 and l>2:
| 4 |
decision
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[30]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
if mx>=max(a[30]-1,n-a[-1]):
| 17 |
value
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 15
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
mx = 15
| 10 |
value
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx<0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
if mx<0:
| 14 |
decision
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x**1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1]))
|
mx = a[x**1]-a[x]-1
| 13 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.