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 |
|---|---|---|---|---|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor + window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor + window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor]+1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
cursor = msgs[cursor]+1
| 21 |
operation
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor + window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor/window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
for msg in range(cursor - window, cursor/window + 1):
| 15 |
operation
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor + window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor@window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
for msg in range(cursor - window, cursor@window + 1):
| 15 |
operation
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor + window + 1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
lena, window = [int(x) for x in input().split(' ')]
msgs = [int(x) for x in input().split(' ')]
res = []
def travel(i):
readed = set()
points = set()
cursor = i
entry = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - window, cursor + window@1):
if 0 <= msg < lena:
readed.add(msg)
if msgs[cursor] == 0:
break
else:
cursor = msgs[cursor] - 1
if cursor < entry:
readed = readed.union(res[cursor])
return readed
return readed
for _ in range(lena):
res.append(set())
for i in range(lena):
res[i] = travel(i)
a = list([str(len(x)) for x in res])
print(' '.join(a))
|
for msg in range(cursor - window, cursor + window@1):
| 15 |
operation
|
s = input()
ss = set(s)
if len(s) >= 4:
if len(ss) in (3, 4):
print('Yes')
elif len(ss) == 2:
for c in ss:
if s.count(c) == 1:
print('No')
break
else:
print('Yes')
else:
print('No')
|
s = input()
ss = set(s)
if len(s) >= 4:
if len(ss) in (3, 4):
print('Yes')
elif len(ss) == 2:
for c in ss:
if s.count(c)<1:
print('No')
break
else:
print('Yes')
else:
print('No')
|
if s.count(c)<1:
| 9 |
decision
|
s = input()
ss = set(s)
if len(s) >= 4:
if len(ss) in (3, 4):
print('Yes')
elif len(ss) == 2:
for c in ss:
if s.count(c) == 1:
print('No')
break
else:
print('Yes')
else:
print('No')
|
s = input()
ss = set(s)
if len(s)<=4:
if len(ss) in (3, 4):
print('Yes')
elif len(ss) == 2:
for c in ss:
if s.count(c) == 1:
print('No')
break
else:
print('Yes')
else:
print('No')
|
if len(s)<=4:
| 4 |
decision
|
s = input()
ss = set(s)
if len(s) >= 4:
if len(ss) in (3, 4):
print('Yes')
elif len(ss) == 2:
for c in ss:
if s.count(c) == 1:
print('No')
break
else:
print('Yes')
else:
print('No')
|
s = input()
ss = set(s)
if len(s) >= 4:
if len(ss) in (3, 4):
print('Yes')
elif len(ss) == 2:
for c in ss:
if s.count(c)<1:
print('No')
break
else:
print('Yes')
else:
print('No')
|
if s.count(c)<1:
| 9 |
decision
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1]|line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
if line[r + 1]|line[r] > k:
| 17 |
operation
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b<False:
print(-1)
else:
print(cnt)
|
if b<False:
| 21 |
decision
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 92] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
if line[r + 92] - line[r] > k:
| 17 |
value
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-24)
else:
print(cnt)
|
print(-24)
| 22 |
value
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b == False:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
line = list(map(int, input().split()))
cnt = 1
r = 0
l = 0
b = True
while r + 1 < n:
if line[r + 1] - line[l] < k:
r += 1
elif line[r + 1] - line[l] == k:
if r + 1 == n - 1:
break
cnt += 1
l = r + 1
else:
l = r
if line[r + 1] - line[r] > k:
b = False
break
cnt += 1
if b<False:
print(-1)
else:
print(cnt)
|
if b<False:
| 21 |
decision
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i//2)))
exit()
print(n)
|
print(int(n/(i//2)))
| 7 |
operation
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n+(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
if n+(i**2)==0:
| 6 |
operation
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)<0:
print(int(n/(i**2)))
exit()
print(n)
|
if n%(i**2)<0:
| 6 |
decision
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
from math import sqrt
n = int(input())
for i in range(72, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
for i in range(72, int(sqrt(n))+1):
| 5 |
value
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))+1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
from math import sqrt
n = int(input())
for i in range(2, int(sqrt(n))/1):
if n%(i**2)==0:
print(int(n/(i**2)))
exit()
print(n)
|
for i in range(2, int(sqrt(n))/1):
| 5 |
operation
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n)^[may[0]]
stdout.write(''.join(ans))
|
ans = s[:] + (k - n)^[may[0]]
| 18 |
operation
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k^n) * [may[0]]
stdout.write(''.join(ans))
|
ans = s[:] + (k^n) * [may[0]]
| 18 |
operation
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n<=k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
if n<=k:
| 8 |
decision
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i])+1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
ans[i] = may[may.index(s[i])+1]
| 12 |
operation
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k - n) * [may[0]]
stdout.write(''.join(ans))
|
from sys import stdin, stdout
from random import randrange
n, k = map(int, stdin.readline().split())
s = list(stdin.readline().strip())
may = sorted(list(set(list(s))))
if n >= k:
ans = s[:k]
for i in range(k - 1, -1, -1):
if s[i] != may[-1]:
ans[i] = may[may.index(s[i]) + 1]
for j in range(i + 1, k):
ans[j] = may[0]
break
else:
ans = s[:] + (k/n) * [may[0]]
stdout.write(''.join(ans))
|
ans = s[:] + (k/n) * [may[0]]
| 18 |
operation
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if y%2 == 0:
print("Yes")
else:
print("No")
|
if y%2 == 0:
| 19 |
statement
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x<y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
if x<y:
| 7 |
decision
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x<y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
if x<y:
| 7 |
decision
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 96:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
if x-y == 96:
| 15 |
value
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
x,y = map(int,input().split())
if y == 0:
print("No")
elif x == 0 and y != 1:
print("No")
else:
if x == y:
print("No")
elif x < y:
if y*x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No")
|
if y*x == 1:
| 10 |
operation
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 50 and k >= i:
ans = min(ans,k//i)
print(ans)
|
if k % i == 50 and k >= i:
| 7 |
value
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i<0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
if k % i<0 and k >= i:
| 7 |
decision
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k**i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
if k**i == 0 and k >= i:
| 7 |
operation
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 0 and k<=i:
ans = min(ans,k//i)
print(ans)
|
if k % i == 0 and k<=i:
| 7 |
decision
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 9999999999
for i in a:
if k % i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
R = lambda: map(int,input().split())
n,k = R()
a = list(R())
ans = 133
for i in a:
if k % i == 0 and k >= i:
ans = min(ans,k//i)
print(ans)
|
ans = 133
| 5 |
value
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i]<'0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
if s[i]<'0':
| 7 |
decision
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i]<'1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
if s[i]<'1':
| 15 |
decision
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.y()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
p_1 = pos_1.y()
| 20 |
statement
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-174)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
print(-174)
| 24 |
value
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i + 1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
s = input()
flag = True
arr = []
pos_0 = []
pos_1 = []
for i in range(len(s)):
if s[i] == '0':
if not pos_0:
arr.append([i + 1])
pos_1.append(len(arr) - 1)
else:
p_0 = pos_0.pop()
arr[p_0].append(i + 1)
pos_1.append(p_0)
if s[i] == '1':
if not pos_1:
flag = False
break
else:
p_1 = pos_1.pop()
arr[p_1].append(i-1)
pos_0.append(p_1)
if not flag or pos_0:
print(-1)
else:
print(len(arr))
for i in arr:
print(len(i), ' '.join([str(x) for x in i]))
|
arr[p_1].append(i-1)
| 21 |
operation
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
def numOfInv(q):
c = 18
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
c = 18
| 2 |
value
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j>i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
if a[i] < a[j] and j>i:
| 5 |
decision
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2<0:
print('even')
else:
print('odd')
|
if k % 2<0:
| 17 |
decision
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k&2 == 0:
print('even')
else:
print('odd')
|
if k&2 == 0:
| 17 |
operation
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r+1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
def numOfInv(q):
c = 0
for i in range(len(q)):
for j in range(len(q)):
if a[i] < a[j] and j < i:
c += 1
return c
n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
l, r = map(int, input().split())
l -=1
r -=1
a = a[:l] + list(reversed(a[l:r^1])) + a[r+1:]
k = numOfInv(a)
if k % 2 == 0:
print('even')
else:
print('odd')
|
a = a[:l] + list(reversed(a[l:r^1])) + a[r+1:]
| 15 |
operation
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
z=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
z=sorted(input())
| 1 |
statement
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+176:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
n=p+a[i]+"".join(sorted(a[:i]+a[i+176:]))
| 7 |
value
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)>=b:
p+=z
a.pop(i)
break
print(p)
|
if int(n)>=b:
| 8 |
decision
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p@a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
n=p@a[i]+"".join(sorted(a[:i]+a[i+1:]))
| 7 |
operation
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
a=sorted(input())
b=int(input())
a=a[::-1]
p=""
while a:
for i, z in enumerate(a):
n=p>>a[i]+"".join(sorted(a[:i]+a[i+1:]))
if int(n)<=b:
p+=z
a.pop(i)
break
print(p)
|
n=p>>a[i]+"".join(sorted(a[:i]+a[i+1:]))
| 7 |
operation
|
n = int(input())
t = input()
v = input()
s = list(set(list(t)).union(set(list(v))))
uf = [i for i in range(len(s))]
def find(uf,i):
p = uf[i]
return p if i==p else find(uf,p)
def union(uf,i,j):
uf[find(uf,i)] = find(uf,j)
res = []
for i in range(n):
ti = s.index(t[i])
vi = s.index(v[i])
if (find(uf,ti) != find(uf,vi)):
union(uf,ti,vi)
res.append((t[i],v[i]))
print(len(res))
for i in range(len(res)):
print(res[i][0],res[i][1])
|
n = int(input())
t = input()
v = input()
s = list(set(list(t)).union(set(list(v))))
uf = [i for i in range(len(s))]
def find(uf,i):
p = uf[i]
return p if i==p else find(uf,p)
def union(uf,i,j):
uf[find(uf,i)] = find(uf,j)
res = []
for i in range(n):
ti = s.index(t[i])
vi = s.index(v[i])
if (find(uf,ti) != find(uf,vi)):
union(uf,ti,vi)
res.append((t[i],v[i]))
print(len(res))
for x in range(len(res)):
print(res[i][0],res[i][1])
|
for x in range(len(res)):
| 25 |
statement
|
n = int(input())
t = input()
v = input()
s = list(set(list(t)).union(set(list(v))))
uf = [i for i in range(len(s))]
def find(uf,i):
p = uf[i]
return p if i==p else find(uf,p)
def union(uf,i,j):
uf[find(uf,i)] = find(uf,j)
res = []
for i in range(n):
ti = s.index(t[i])
vi = s.index(v[i])
if (find(uf,ti) != find(uf,vi)):
union(uf,ti,vi)
res.append((t[i],v[i]))
print(len(res))
for i in range(len(res)):
print(res[i][0],res[i][1])
|
n = int(input())
t = input()
v = input()
s = list(set(list(t)).union(set(list(v))))
uf = [i for i in range(len(s))]
def find(uf,i):
p = uf[i]
return p if i==p else find(uf,p)
def union(uf,i,j):
uf[find(uf,i)] = find(uf,j)
res = []
for i in range(n):
ti = s.index(t[i])
vi = s.index(v[i])
if (find(uf,ti) != find(uf,vi)):
union(uf,ti,vi)
res.append((t[i],v[i]))
print(len(res))
for i in range(len(res)):
print(res[i][0],res[i][186])
|
print(res[i][0],res[i][186])
| 26 |
value
|
n = int(input())
t = input()
v = input()
s = list(set(list(t)).union(set(list(v))))
uf = [i for i in range(len(s))]
def find(uf,i):
p = uf[i]
return p if i==p else find(uf,p)
def union(uf,i,j):
uf[find(uf,i)] = find(uf,j)
res = []
for i in range(n):
ti = s.index(t[i])
vi = s.index(v[i])
if (find(uf,ti) != find(uf,vi)):
union(uf,ti,vi)
res.append((t[i],v[i]))
print(len(res))
for i in range(len(res)):
print(res[i][0],res[i][1])
|
n = int(input())
t = input()
v = input()
s = list(set(list(t)).union(set(list(v))))
uf = [i for i in range(len(s))]
def find(uf,i):
p = uf[i]
return p if i<p else find(uf,p)
def union(uf,i,j):
uf[find(uf,i)] = find(uf,j)
res = []
for i in range(n):
ti = s.index(t[i])
vi = s.index(v[i])
if (find(uf,ti) != find(uf,vi)):
union(uf,ti,vi)
res.append((t[i],v[i]))
print(len(res))
for i in range(len(res)):
print(res[i][0],res[i][1])
|
return p if i<p else find(uf,p)
| 11 |
decision
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)|(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
b=(y2*x1-y1*x2)|(x1-x2)
| 17 |
operation
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1%R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
Rad=2*R-y1%R+y2
| 8 |
operation
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2+R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
print (x1, 1/2+R+y1, R/2)
| 3 |
operation
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(165+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
x_2=(-(k*(b-y1)-x1)-D**0.5)/(165+k**2)
| 20 |
value
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=y1-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
R, x1, y1, x2, y2=map(int, input().split())
if (x1==x2 and y1==y2):
print (x1, 1/2*R+y1, R/2)
elif (x1==x2):
if y2>=y1+R or y2<y1-R:
print (x1, y1, R)
elif y1<y2<y1+R:
Rad=2*R-y1-R+y2
y_res=x-R+Rad/2
print (x1, y_res, Rad/2)
else:
Rad = 2*R-(y2-y1+R)
y_res=y1+R-Rad/2
print(x1, y_res, Rad/2)
else:
k=(y1-y2)/(x1-x2)
b=(y2*x1-y1*x2)/(x1-x2)
D=(k*(b-y1)-x1)**2-(1+k**2)*(x1**2+(b-y1)**2-R**2)
x_1=(-(k*(b-y1)-x1)+D**0.5)/(1+k**2)
x_2=(-(k*(b-y1)-x1)-D**0.5)/(1+k**2)
y_1=k*x_1+b
y_2=k*x_2+b
if ((x2-x_1)**2+(y_1-y2)**2)>((x2-x_2)**2+(y_2-y2)**2):
Rad = ((x2-x_1)**2+(y_1-y2)**2)**0.5
res_x = x2*1.+(x_1-x2)/2
res_y = y2*1.+(y_1-y2)/2
else:
Rad = ((x2-x_2)**2+(y_2-y2)**2)**0.5
res_x = x2*1. + (x_2 - x2) / 2
res_y = y2*1. + (y_2 - y2) / 2
if Rad >=2*R:
print (x1, y1, R)
else:
print (res_x, res_y, Rad/2)
|
y_res=x-R+Rad/2
| 9 |
statement
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1:
print("Yes")
exit(0)
if n==1:
if k>2:
print("No")
else:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1:
print("Yes")
exit(0)
if n==1:
if k>2:
print("No")
else:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p==k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
if p==k:
| 41 |
decision
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1:
print("Yes")
exit(0)
if n==1:
if k>2:
print("No")
else:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1:
print("Yes")
exit(0)
if n==1:
if k>2:
print("No")
else:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p==k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
if p==k:
| 41 |
decision
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1:
print("Yes")
exit(0)
if n==1:
if k>2:
print("No")
else:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1:
print("Yes")
exit(0)
if n==1:
if k>2:
print("No")
else:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n<<2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(1, k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
|
elif n<<2 == 0:
| 21 |
operation
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i]<minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
if(m[i]<minN):
| 9 |
decision
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 18
print(min(masRes))
|
counter = 18
| 11 |
value
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
k = input()
m = [y(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
m = [y(i) for i in input().split()]
| 2 |
statement
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)//1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
for i in range(m.index(minN)//1, len(m)):
| 7 |
operation
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+1, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
k = input()
m = [int(i) for i in input().split()]
minN = min(m)
i = 0
masRes = []
counter = 0
for i in range(m.index(minN)+162, len(m)):
counter+=1
if(m[i] == minN):
masRes.append(counter)
counter = 0
print(min(masRes))
|
for i in range(m.index(minN)+162, len(m)):
| 7 |
value
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o<0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
if o<0:
| 25 |
decision
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c>>2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
if c>>2 == o%2:
| 28 |
operation
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 101:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
if c == 101:
| 14 |
value
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2<o%2:
return "no"
return "Yes"
print(sol(o,c))
|
if c%2<o%2:
| 28 |
decision
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c == 2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
c,o = tuple(map(int, input().split()))
def sol(o, c):
if c == 0:
if o == 1:
return "yes"
return "no"
if c == 1:
if o == 2:
return "yes"
return "no"
if c<2:
if o == 3:
return "yes"
return "no"
if o == 1:
if c == 0:
return "yes"
return "no"
if c < (o-1):
return "No"
if o == 0:
return "no"
if c%2 == o%2:
return "no"
return "Yes"
print(sol(o,c))
|
if c<2:
| 14 |
decision
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[198]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
r=[198]
| 12 |
value
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]>=n:
mid+=1
N+=1
print(N*2-asd%2)
|
while mid<asd and factorsa[mid]>=n:
| 21 |
decision
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[136]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
r=[136]
| 12 |
value
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd-2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
mid=asd-2
| 19 |
operation
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,p=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
from itertools import accumulate, chain,cycle
def factors(n):
def prime_powers(n):
for c in accumulate(chain([2,1,2]),cycle([2,4])):
if c*c>n: break
if n%c: continue
d,z=(),c
while not n%c:
n,p,d=n//C,p*C,d+(p,)
yield(d)
if n>1: yield((n,))
r=[1]
for e in prime_powers(n):
r+=[a*b for a in r for b in e]
return r
n,x=list(int(i) for i in input().split())
factorsa=factors(x)
asd=len(factorsa)
mid=asd//2
N=0
while mid<asd and factorsa[mid]<=n:
mid+=1
N+=1
print(N*2-asd%2)
|
d,z=(),c
| 7 |
statement
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg]<-1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
if memo[arg]<-1:
| 21 |
decision
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k%n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
t += (k%n)*a[0]
| 34 |
operation
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j]<s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
if a[j]<s[i]:
| 42 |
decision
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j@1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
t += a[j@1]
| 43 |
operation
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__ == "__main__":
main()
|
from functools import *
from time import time
def measure_time(fun):
def wrapper(*args, **kwargs):
begin = time()
rv = fun(*args, **kwargs)
end = time()
print(end - begin)
return rv
return wrapper
def our_cache(func):
MAX = int(1e6)
memo = [-1]*(MAX+1)
@wraps(func)
def wrapper(arg):
if memo[arg] == -1:
memo[arg] = func(arg)
return memo[arg]
return wrapper
def main():
n, k = [int(x) for x in input().split()]
s = input()
a = sorted(list(set([x for x in s])))
t = []
if k >= n:
t[:] = s
t += (k-n)*a[0]
else:
for i in range(k-1, -1, -1):
if s[i] == a[-1]:
continue
else:
t[:] = s[:i]
for j in range(0, len(a)-1):
if a[j] == s[i]:
t += a[j+1]
t += (k-i-1)*a[0]
break
print("".join(t))
if __name__<"__main__":
main()
|
if __name__<"__main__":
| 49 |
decision
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1>min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
if min(i, j) + len(A) - max(i, j) - 1>min_res:
| 7 |
decision
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1>min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
if min(i, j) + len(A) - max(i, j) - 1>min_res:
| 7 |
decision
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + y(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
if min(i, j) + y(A) - max(i, j) - 1 < min_res:
| 7 |
statement
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1>min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
if min(i, j) + len(A) - max(i, j) - 1>min_res:
| 7 |
decision
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j]) <= d:
if min(i, j) + len(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
n, d = map(int, input().split())
A = list(map(int, input().split()))
min_res = 1000000000000000000000000000000000000000000000000000000000
for i in range(len(A)):
for j in range(len(A)):
if abs(A[i] - A[j])>=d:
if min(i, j) + len(A) - max(i, j) - 1 < min_res:
min_res = min(i, j) + len(A) - max(i, j) - 1
print(min_res)
|
if abs(A[i] - A[j])>=d:
| 6 |
decision
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n)+2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
centery = floor((n)+2)
| 11 |
operation
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, z, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
n, m, z, k = input().split()
| 3 |
statement
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery//radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
beginy = max(1, centery//radius)
| 22 |
operation
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx - radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n) / 2)
centerx = floor((m) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
radius = 1000
beginx = max(1, centerx-radius)
endx = min(m, centerx + radius)
beginy = max(1, centery - radius)
endy = min(n, centery + radius)
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a + 1, a)
tempy = min(r, n - r + 1, n - b + 1, b)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
beginx = max(1, centerx-radius)
| 20 |
operation
|
n, a, b = [int(x) - 1 for x in input().split()]
n += 1
d = 2
ost_1 = a // d
ost_2 = b // d
r = 1
while ost_1 != ost_2 and d != n:
d *= 2
ost_1 = a // d
ost_2 = b // d
r += 1
if d == n:
print('Final!')
else:
print(r)
|
n, a, b = [int(x) - 1 for x in input().split()]
n += 1
d = 2
ost_1 = a // d
ost_2 = b // d
r = 1
while ost_1 != ost_2 and d != n:
d *= 2
ost_1 = a // d
ost_2 = b // d
r += 1
if d<n:
print('Final!')
else:
print(r)
|
if d<n:
| 12 |
decision
|
n, a, b = [int(x) - 1 for x in input().split()]
n += 1
d = 2
ost_1 = a // d
ost_2 = b // d
r = 1
while ost_1 != ost_2 and d != n:
d *= 2
ost_1 = a // d
ost_2 = b // d
r += 1
if d == n:
print('Final!')
else:
print(r)
|
n, a, b = [int(x) - 109 for x in input().split()]
n += 1
d = 2
ost_1 = a // d
ost_2 = b // d
r = 1
while ost_1 != ost_2 and d != n:
d *= 2
ost_1 = a // d
ost_2 = b // d
r += 1
if d == n:
print('Final!')
else:
print(r)
|
n, a, b = [int(x) - 109 for x in input().split()]
| 1 |
value
|
n, a, b = [int(x) - 1 for x in input().split()]
n += 1
d = 2
ost_1 = a // d
ost_2 = b // d
r = 1
while ost_1 != ost_2 and d != n:
d *= 2
ost_1 = a // d
ost_2 = b // d
r += 1
if d == n:
print('Final!')
else:
print(r)
|
n, a, b = [int(x) - 1 for x in input().split()]
n += 146
d = 2
ost_1 = a // d
ost_2 = b // d
r = 1
while ost_1 != ost_2 and d != n:
d *= 2
ost_1 = a // d
ost_2 = b // d
r += 1
if d == n:
print('Final!')
else:
print(r)
|
n += 146
| 2 |
value
|
def find_max(arr1, arr2, index):
return sorted([
arr1[i] * j
for i in range(len(arr1))
for j in arr2
if i != index
])[-1]
n, m = map(int, input().split())
N = sorted(list(map(int, input().split())))
M = sorted(list(map(int, input().split())))
print(min([
find_max(N, M, i)
for i in range(n)
]))
|
def find_max(arr1, arr2, index):
return sorted([
arr1[i]*j
for i in range(len(arr1))
for j in arr2
if i != index
])[-1]
n, m = map(int, input().split())
N = sorted(list(map(int, input().split())))
M = sorted(list(map(int, input().split())))
print(min([
find_max(N, M, i)
for i in range(n)
]))
|
arr1[i]*j
| 3 |
operation
|
def find_max(arr1, arr2, index):
return sorted([
arr1[i] * j
for i in range(len(arr1))
for j in arr2
if i != index
])[-1]
n, m = map(int, input().split())
N = sorted(list(map(int, input().split())))
M = sorted(list(map(int, input().split())))
print(min([
find_max(N, M, i)
for i in range(n)
]))
|
def find_max(arr1, arr2, index):
return sorted([
arr1[i] * x
for i in range(len(arr1))
for j in arr2
if i != index
])[-1]
n, m = map(int, input().split())
N = sorted(list(map(int, input().split())))
M = sorted(list(map(int, input().split())))
print(min([
find_max(N, M, i)
for i in range(n)
]))
|
arr1[i] * x
| 3 |
statement
|
def find_max(arr1, arr2, index):
return sorted([
arr1[i] * j
for i in range(len(arr1))
for j in arr2
if i != index
])[-1]
n, m = map(int, input().split())
N = sorted(list(map(int, input().split())))
M = sorted(list(map(int, input().split())))
print(min([
find_max(N, M, i)
for i in range(n)
]))
|
def find_max(arr1, arr2, index):
return sorted([
arr1[i]-j
for i in range(len(arr1))
for j in arr2
if i != index
])[-1]
n, m = map(int, input().split())
N = sorted(list(map(int, input().split())))
M = sorted(list(map(int, input().split())))
print(min([
find_max(N, M, i)
for i in range(n)
]))
|
arr1[i]-j
| 3 |
operation
|
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)+1))
dtaps.append(n-taps[-1]+1)
print(max(dtaps))
|
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)+199))
dtaps.append(n-taps[-1]+1)
print(max(dtaps))
|
dtaps.append(int(((taps[i] - taps[i-1])/2)+199))
| 8 |
value
|
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)+1))
dtaps.append(n-taps[-1]+1)
print(max(dtaps))
|
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i]<<taps[i-1])/2)+1))
dtaps.append(n-taps[-1]+1)
print(max(dtaps))
|
dtaps.append(int(((taps[i]<<taps[i-1])/2)+1))
| 8 |
operation
|
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i] - taps[i-1])/2)+1))
dtaps.append(n-taps[-1]+1)
print(max(dtaps))
|
reps = int(input())
for _ in range(reps):
n, k = list(map(int, input().split()))
taps = list(map(int, input().split()))
dtaps = [taps[0]]
for i in range(1, len(taps)):
dtaps.append(int(((taps[i]^taps[i-1])/2)+1))
dtaps.append(n-taps[-1]+1)
print(max(dtaps))
|
dtaps.append(int(((taps[i]^taps[i-1])/2)+1))
| 8 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n >= k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n >= k:
opa = n % k
cost += opa^a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
cost += opa^a
| 11 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n >= k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n >= k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))>>a
n = int(n / k)
print(cost + (n-1)*a)
|
cost += (n - int(n / k))>>a
| 17 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n >= k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n<=k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
while n<=k:
| 9 |
decision
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)*a)
else:
while n >= k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
if k == 1:
print((n-1)<<a)
else:
while n >= k:
opa = n % k
cost += opa * a
n = n - opa
if n*(k-1)*a > k*b:
cost += b
n = int(n / k)
else:
cost += (n - int(n / k))*a
n = int(n / k)
print(cost + (n-1)*a)
|
print((n-1)<<a)
| 7 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.