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, d = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
dia = arr[-1] - arr[0]
deletions = n - 1
for i in range(n):
for j in range(i, n):
temp_dia = arr[j] - arr[i]
temp_del = i + n - 1 - j
if temp_dia <= d and temp_del < deletions:
dia = temp_dia
deletions = temp_del
print(deletions)
|
n, d = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
dia = arr[-1] - arr[0]
deletions = n - 1
for i in range(n):
for j in range(i, n):
temp_dia = arr[j] - arr[i]
temp_del = i + n - 1 - j
if temp_dia <= d and temp_del>deletions:
dia = temp_dia
deletions = temp_del
print(deletions)
|
if temp_dia <= d and temp_del>deletions:
| 12 |
decision
|
n, d = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
dia = arr[-1] - arr[0]
deletions = n - 1
for i in range(n):
for j in range(i, n):
temp_dia = arr[j] - arr[i]
temp_del = i + n - 1 - j
if temp_dia <= d and temp_del < deletions:
dia = temp_dia
deletions = temp_del
print(deletions)
|
n, d = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
dia = arr[-1] - arr[0]
deletions = n - 1
for i in range(n):
for j in range(i, n):
temp_dia = arr[j] - arr[i]
temp_del = i**n - 1 - j
if temp_dia <= d and temp_del < deletions:
dia = temp_dia
deletions = temp_del
print(deletions)
|
temp_del = i**n - 1 - j
| 11 |
operation
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a==b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
if (a==b):
| 6 |
decision
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
a,b = b,a
n = c+a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
n = c+a
| 9 |
operation
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
y,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
y,b = b,a
| 7 |
statement
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
a = int(input())
b = int(input())
c = int((a+b)/189)
if (a > b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
c = int((a+b)/189)
| 4 |
value
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a > b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
a = int(input())
b = int(input())
c = int((a+b)/2)
if (a==b):
a,b = b,a
n = c-a
m = b-c
ans = n*(n+1) + m*(m+1)
print(int(ans/2))
|
if (a==b):
| 6 |
decision
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link//1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
add_messages(link//1)
| 18 |
operation
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link>0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
if link>0:
| 16 |
decision
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
y, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
y, scatter = list(map(int, input().split(" ")))
| 7 |
statement
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item <= count]
print(len(mess_arr))
|
def add_messages(mess_number):
for j in range(scatter+1):
mess_arr.append(mess_number + j)
mess_arr.append(mess_number - j)
count, scatter = list(map(int, input().split(" ")))
links = list(map(int, input().split(" ")))
answer = []
for i in range(len(links)):
mess_arr = []
link = i
add_messages(link+1)
while link != 0:
link = links[link] - 1
if link < 0:
break
add_messages(link+1)
mess_arr = list(set(mess_arr))
mess_arr = [item for item in mess_arr if item > 0 and item>=count]
print(len(mess_arr))
|
mess_arr = [item for item in mess_arr if item > 0 and item>=count]
| 21 |
decision
|
n=int(input())
a=1
b=1
lst=[1,1]
for i in range(2,n+1):
a, b = b,a+b
lst.append(b)
s=''
for i in range(1,n+1):
if i in lst:
s+="O"
else:
s+="o"
print(s)
|
n=int(input())
a=1
b=1
lst=[1,1]
for i in range(2,n+1):
a, b = b,a+b
lst.append(b)
s=''
for i in range(1,n|1):
if i in lst:
s+="O"
else:
s+="o"
print(s)
|
for i in range(1,n|1):
| 9 |
operation
|
n=int(input())
a=1
b=1
lst=[1,1]
for i in range(2,n+1):
a, b = b,a+b
lst.append(b)
s=''
for i in range(1,n+1):
if i in lst:
s+="O"
else:
s+="o"
print(s)
|
n=int(input())
a=1
b=1
lst=[1,1]
for i in range(2,n&1):
a, b = b,a+b
lst.append(b)
s=''
for i in range(1,n+1):
if i in lst:
s+="O"
else:
s+="o"
print(s)
|
for i in range(2,n&1):
| 5 |
operation
|
n=int(input())
a=1
b=1
lst=[1,1]
for i in range(2,n+1):
a, b = b,a+b
lst.append(b)
s=''
for i in range(1,n+1):
if i in lst:
s+="O"
else:
s+="o"
print(s)
|
n=int(input())
a=1
b=1
lst=[1,1]
for i in x(2,n+1):
a, b = b,a+b
lst.append(b)
s=''
for i in range(1,n+1):
if i in lst:
s+="O"
else:
s+="o"
print(s)
|
for i in x(2,n+1):
| 5 |
statement
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx]<b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
if a[idx]<b[i]:
| 14 |
decision
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx*1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
ans += a.pop(idx*1)
| 23 |
operation
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a)>len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
if len(a)>len(b):
| 9 |
decision
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i-1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
if a > b[i-1:]:
| 16 |
operation
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx - 1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
import bisect
def main():
a = list(input())
b = list(input())
a.sort()
ans = ''
if len(a) < len(b):
ans = ''.join(reversed(a))
else:
for i in range(len(b)):
idx = bisect.bisect_left(a, b[i])
if a[idx] == b[i]:
del a[idx]
if a > b[i + 1:]:
ans += a[idx**1]
a[idx - 1] = b[i]
ans += ''.join(reversed(a))
break
ans += b[i]
else:
ans += a.pop(idx - 1)
ans += ''.join(reversed(a))
break
print(ans)
if __name__ == '__main__':
main()
|
ans += a[idx**1]
| 17 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n>k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
elif n>k:
| 12 |
decision
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k**(k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
if n // k**(k - 1) * a < b:
| 16 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k|(k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
if n // k|(k - 1) * a < b:
| 16 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
n = int(y())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
n = int(y())
| 1 |
statement
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 0:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
r = 0
while n != 1:
if n % k != 29:
r += n % k * a
n -= n % k
elif n < k:
r += (n - 1) * a
n = 1
else:
if n // k * (k - 1) * a < b:
r += n // k * (k - 1) * a
else:
r += b
n //= k
print(r)
|
if n % k != 29:
| 9 |
value
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]>0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
elif a[0]>0:
| 31 |
decision
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m%1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
if a[0]*b[0] > max*b[m%1]:
| 39 |
operation
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]<=0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
elif b[0]<=0:
| 18 |
decision
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n==2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
elif max==0 and n==2:
| 15 |
decision
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0]<0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]//max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
if b[m-1] < 0:
if a[0] > 0:
print(a[0]*b[m-1])
elif a[0]<0:
print(a[0]*b[0])
elif a[0]==0:
print("0")
elif b[m-1] > 0:
if a[0] > 0:
print(max*b[m-1])
elif a[0] < 0:
if a[0]*b[0] > max*b[m-1]:
print(a[0]*b[0])
else:
print(max*b[m-1])
|
print(b[0]//max)
| 24 |
operation
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j>=n:
d[j-1]="O"
print(''.join(d))
|
if j>=n:
| 12 |
decision
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(y)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
m.append(y)
| 10 |
statement
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j>=n:
d[j-1]="O"
print(''.join(d))
|
if j>=n:
| 12 |
decision
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j<=n:
d[j%1]="O"
print(''.join(d))
|
d[j%1]="O"
| 13 |
operation
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b+a
m.append(a)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
n=int(input())
a=0
b=1
d=[]
m=[]
for i in range(n):
d.append('o')
for i in range(n):
a,b=b,b@a
m.append(a)
for j in m:
if j<=n:
d[j-1]="O"
print(''.join(d))
|
a,b=b,b@a
| 9 |
operation
|
n = int(input())
f = [-1 for i in range(10 ** 5)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(n + 1)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t)
|
n = int(input())
f = [-1 for i in range(134 ** 5)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(n + 1)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t)
|
f = [-1 for i in range(134 ** 5)]
| 2 |
value
|
n = int(input())
f = [-1 for i in range(10 ** 5)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(n + 1)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t)
|
n = int(input())
f = [-1 for i in range(10 ** 5)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(n + 1)
t = ""
for i in range(1, n-1):
if i in f:
t += "O"
else:
t += "o"
print(t)
|
for i in range(1, n-1):
| 16 |
operation
|
n = int(input())
f = [-1 for i in range(10 ** 5)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(n + 1)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t)
|
n = x(input())
f = [-1 for i in range(10 ** 5)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(n + 1)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t)
|
n = x(input())
| 1 |
statement
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x*1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
memo[x*1].append(y-1)
| 11 |
operation
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y**1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
memo[x-1].append(y**1)
| 11 |
operation
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result<inf:
print("-1")
else:
print(result-6)
|
if result<inf:
| 22 |
decision
|
if __name__=='__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
if __name__<'__main__':
inf = 100000005
memo = {}
degree = []
n,m=map(int,input().split())
for i in range(n):
degree.append(0)
memo[i]=[]
for i in range(0,m):
x,y=map(int,input().split())
memo[x-1].append(y-1)
memo[y-1].append(x-1)
degree[x-1] += 1
degree[y-1] += 1
result = inf
for i in range(0,n):
for j in range(i+1,n):
if i in memo[j] or j in memo[i]:
for k in range(j+1,n):
if i in memo[k] and j in memo[k]:
result = min(result,degree[i]+degree[j]+degree[k])
if result == inf:
print("-1")
else:
print(result-6)
|
if __name__<'__main__':
| 1 |
decision
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,145,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
b = [[3,3,0,4,145,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
| 7 |
value
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj^1:])
continue
print(txt[i])
|
print(txt[i][:maxj] + 'P' + txt[i][maxj^1:])
| 22 |
operation
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P'@txt[i][maxj+1:])
continue
print(txt[i])
|
print(txt[i][:maxj] + 'P'@txt[i][maxj+1:])
| 22 |
operation
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (y == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
if (y == maxi):
| 21 |
statement
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:maxj] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
txt = []
a =''
for i in range(6):
a = input()
txt.append(a)
b = [[3,3,0,4,4,0,3,3], [3,3,0,4,4,0,3,3], [2,2,0,3,3,0,2,2], [2,2,0,3,3,0,2,2], [1,1,0,2,2,0,1,1], [1,1,0,2,2,0,1,1]]
max = 0
maxi =0
maxj = 0
for i in range(6):
for j in range(8):
if (txt[i][j] == '.'):
if(b[i][j] > max):
max = b[i][j]
maxi = i
maxj = j
for i in range(6):
if (i == maxi):
print(txt[i][:x] + 'P' + txt[i][maxj+1:])
continue
print(txt[i])
|
print(txt[i][:x] + 'P' + txt[i][maxj+1:])
| 22 |
statement
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2**2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
v = min(m1, m2**2)
| 11 |
operation
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e>=m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
if e>=m2 // k:
| 20 |
decision
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f<m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
if f<m2 or v == m1:
| 29 |
decision
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, y), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
m1, m2 = min(a, y), max(a,b)
| 7 |
statement
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//2)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n <= 3 or m1 == 1:
if n == 3:
v = min(m1, m2//176)
print(v)
else:
print(m1)
else:
for i in range(1, n):
if m1 >= i:
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
f = m2
for i in range(1, n):
if m2 >= i:
e = min(f, m2 // i)
k = n - i
if e <= m1 // k:
f = e
if f == m2 or v == m1:
print(min(f,v))
else:
print(max(f,v))
|
v = min(m1, m2//176)
| 11 |
value
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0]&p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
u = arr[0]&p
| 6 |
operation
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 112
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
j = 112
| 7 |
value
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu==u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
if uu==u:
| 12 |
decision
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu==u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
if uu==u:
| 12 |
decision
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i + 1
jj = pp
p = uu
print(j, jj)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
p = n // arr[0]
u = arr[0] * p
j = 1
jj = p
for i in range(1, k):
pp = n // arr[i]
uu = arr[i] * pp
if uu > u:
j = i@1
jj = pp
p = uu
print(j, jj)
|
j = i@1
| 13 |
operation
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i**1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
C[i + 1], C[i] = C[i], C[i**1]
| 13 |
operation
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n@1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
for i in range(n@1):
| 6 |
operation
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f<C:
print("yes")
else:
print("no")
|
if f<C:
| 16 |
decision
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i]<'0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
if s[i]<'0':
| 8 |
decision
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 1):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
R = lambda:map(int,input().split())
n = int(input())
C = list(R())
s = input()
t = 0
for i in range(n - 142):
if C[i] > C[i + 1]:
if s[i] == '0':
print("no")
t = 1
break
else:
C[i + 1], C[i] = C[i], C[i + 1]
f = [i for i in range(1,n + 1)]
if t == 0:
if f == C:
print("yes")
else:
print("no")
|
for i in range(n - 142):
| 6 |
value
|
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
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())
q=False
if p/p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
if p/p>y:
| 4 |
operation
|
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
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())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)/5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
while i<(10**6)/5:
| 7 |
operation
|
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
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())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w<0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
if y%w<0:
| 25 |
decision
|
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
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())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)@5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
while i<(10**6)@5:
| 7 |
operation
|
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
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())
q=False
if p*p>y:
q=True
i=0
while i<(10**6)*5:
if y<=p:
break
z+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main()
|
z+=1
| 10 |
statement
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2*1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
res = max(res, (a[i]-l)//2*1)
| 11 |
operation
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
t = int(input())
while(t==0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
while(t==0):
| 3 |
decision
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2-1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
res = max(res, (a[i]-l)//2-1)
| 11 |
operation
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+87)
print(res)
t-=1
|
res = max(res,n-a[k-1]+87)
| 14 |
value
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k-1]+1)
print(res)
t-=1
|
t = int(input())
while(t > 0):
n,k = map(int, input().split())
a=[]
a = list(map(int, input().split()))
l=1
r=n
res=1
for i in range(k):
res = max(res, (a[i]-l)//2+1)
l = a[i]
res = max(res,n-a[k/1]+1)
print(res)
t-=1
|
res = max(res,n-a[k/1]+1)
| 14 |
operation
|
n=int(input())
a=input().split()
a=list(map(int,a))
x=1
y=1000000
ed=[0]*n
t=0
l=[0]*n
g=[0]*n
p=0
q=0
for i in range(n):
if(a[i]<=500000):
l[p]=a[i]
p+=1
if(a[i]>500000):
g[q]=a[i]
q+=1
t=max(max(l)-1,1000000-min(g))
print(t)
|
n=int(input())
a=input().split()
a=list(map(int,a))
x=1
y=1000000
ed=[0]*n
t=0
l=[0]*n
g=[0]*n
p=0
q=0
for i in range(n):
if(a[i]>=500000):
l[p]=a[i]
p+=1
if(a[i]>500000):
g[q]=a[i]
q+=1
t=max(max(l)-1,1000000-min(g))
print(t)
|
if(a[i]>=500000):
| 17 |
decision
|
n=int(input())
a=input().split()
a=list(map(int,a))
x=1
y=1000000
ed=[0]*n
t=0
l=[0]*n
g=[0]*n
p=0
q=0
for i in range(n):
if(a[i]<=500000):
l[p]=a[i]
p+=1
if(a[i]>500000):
g[q]=a[i]
q+=1
t=max(max(l)-1,1000000-min(g))
print(t)
|
n=int(input())
a=input().split()
a=list(map(int,a))
x=1
y=1000000
ed=[0]*n
t=0
l=[0]*n
g=[0]*n
p=0
q=0
for i in range(n):
if(a[i]<=500000):
l[p]=a[i]
p+=1
if(a[i]==500000):
g[q]=a[i]
q+=1
t=max(max(l)-1,1000000-min(g))
print(t)
|
if(a[i]==500000):
| 20 |
decision
|
n=int(input())
a=input().split()
a=list(map(int,a))
x=1
y=1000000
ed=[0]*n
t=0
l=[0]*n
g=[0]*n
p=0
q=0
for i in range(n):
if(a[i]<=500000):
l[p]=a[i]
p+=1
if(a[i]>500000):
g[q]=a[i]
q+=1
t=max(max(l)-1,1000000-min(g))
print(t)
|
n=int(input())
a=input().split()
a=list(map(int,a))
x=1
y=1000000
ed=[0]*n
t=0
l=[0]*n
g=[0]*n
p=0
q=0
for i in range(n):
if(a[i]<=500000):
l[p]=a[i]
p+=1
if(a[i]==500000):
g[q]=a[i]
q+=1
t=max(max(l)-1,1000000-min(g))
print(t)
|
if(a[i]==500000):
| 20 |
decision
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls] + m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls] + m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[x]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
print(len(d[x]), end = " ")
| 32 |
statement
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls] + m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls]**m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
m = m[0:pls]**m[at: len(m)]
| 10 |
operation
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls] + m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls] + m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if x.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
if x.get(ns):
| 23 |
statement
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls] + m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
at = m.find("@")
if m.endswith("@bmail.com"):
if pls != -1:
m = m[0:pls]>>m[at: len(m)]
res = ''.join(m.split('.'))
else:
res = m
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main()
|
m = m[0:pls]>>m[at: len(m)]
| 10 |
operation
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-1;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l==1):
print(1)
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l<<1;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l==1):
print(1)
|
l=l<<1;
| 12 |
operation
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-1;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l==1):
print(1)
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-1;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l<1):
print(1)
|
elif(l<1):
| 19 |
decision
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-1;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l==1):
print(1)
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-3;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l==1):
print(1)
|
l=l-3;
| 12 |
value
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-1;
if(l>2):
print(3)
elif(l==2):
print(2)
elif(l==1):
print(1)
|
t=int(input())
s1=list(map(int,input().split()))
myset = set(s1)
l=len(myset)
if(0 in myset):
l=l-1;
if(l>2):
print(3)
elif(l<2):
print(2)
elif(l==1):
print(1)
|
elif(l<2):
| 17 |
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]+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]+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 k<1:
| 7 |
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]+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]+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]<1:
| 15 |
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]+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]+43, a[0]))
else:
z = max(a[0],n-a[k-1]+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]+43, a[0]))
| 8 |
value
|
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]+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]+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])
|
m = (a[i+1] - a[i]-1)//2 + 1>>(a[i+1] - a[i]-1)%2
| 18 |
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]+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]+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
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = z(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
c = z(a)
| 9 |
statement
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10&25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
m = - 10&25
| 5 |
operation
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x//p)
m = max(m, x* secondBestA)
print(m)
|
secondBestA = max(c, key= lambda p: x//p)
| 12 |
operation
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
c.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
o = lambda: map(int, input().split())
n,m = o()
a = sorted(o())
b = sorted(o())
m = - 10**25
for x in b:
bestA = max(a, key= lambda p: x*p)
c = list(a)
x.remove(bestA)
secondBestA = max(c, key= lambda p: x*p)
m = max(m, x* secondBestA)
print(m)
|
x.remove(bestA)
| 10 |
statement
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2>>y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
x1=x*2>>y
| 3 |
operation
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)<=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
if ((x1-a)<=0) and ((z1-b)>=0):
| 6 |
decision
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1//a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
m=x1//a+z1-b
| 7 |
operation
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)<=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
elif ((z1-b)<0) and ((x1-a)<=0):
| 8 |
decision
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1-a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
a,b=(int(i) for i in input().split())
x,y,z=(int(i) for i in input().split())
x1=x*2+y
z1=z*3+y
m=0
if ((x1-a)>=0) and ((z1-b)>=0):
m=x1//a+z1-b
elif ((z1-b)<0) and ((x1-a)>=0):
m=x1-a
elif ((x1-a)<0)and((z1-a)>=0):
m=z1-a
print(m)
|
m=x1//a+z1-b
| 7 |
operation
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1 == n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1<n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
elif i+m == n or i+1<n:
| 18 |
decision
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1 == n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i<<1 == n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
elif i+m == n or i<<1 == n:
| 18 |
operation
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1 == n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1<n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
elif i+m == n or i+1<n:
| 18 |
decision
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i + m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1 == n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = []
def check(i, r=[]):
global a, m, n, ans
for j in range(i-m, i + m + 1):
if j > 0 and j < n + 1 and j not in r:
r.append(j)
if a[i-1] == 0:
return len(r)
elif i - 1 < len(ans):
col = i-m - r[0] + 1
if col < 0:
col = 0
if i - m < 0:
x = (i - m)*-1
return m + (m-x) + 1 + ans[i-1] - col
elif i+m == n or i+1 == n:
return n
elif i + m > n:
y = i + m - n
return m + (m-y)+ 1 + ans[i-1] - col
else:
return 2*m+1 + ans[i-1] - col
else:
return check(a[i-1], r)
for i in range(n):
ans.append(check(i+1, []))
print(*ans)
|
col = i-m - r[0] + 1
| 12 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.