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 |
|---|---|---|---|---|
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d==r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | if d==r: | 12 | decision |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**75)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | return math.sqrt((x1-x2)**2 + (y1-y2)**75) | 4 | value |
n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b+1] == 0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b+1]<0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | if f[b+1]<0 and f[c] == 0: | 22 | decision |
n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b+1] == 0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y])==a:
a = int(s[x][y])
b = x
c = y
if f[b+1] == 0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | if int(s[x][y])==a: | 17 | decision |
n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b+1] == 0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b-1] == 0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | if f[b-1] == 0 and f[c] == 0: | 22 | operation |
n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b+1] == 0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | n = int(input())
s = []
for x in range (0, 2*n -1):
s.append(input().split())
f = []
for p in range (0,2*n):
f.append(0)
for z in range (0, 2*n*n-n):
a = 0
b = 0
c = 0
for x in range (0, len(s)):
for y in range (0,len(s[x])):
if int(s[x][y]) > a:
a = int(s[x][y])
b = x
c = y
if f[b+1]<0 and f[c] == 0:
f[b+1] = c+1
f[c] = b+2
for t in range (0,len(s[b])):
if s[b][t] != "0":
s[b][t] = "0"
z = z - 1
for y in range (c + 1,len(s)):
if s[y][c] != "0":
s[y][c] = "0"
z = z - 1
s[b][c] = "0"
g = str(f[0])
for m in range (1, 2*n):
g = g + " " + str(f[m])
print(g) | if f[b+1]<0 and f[c] == 0: | 22 | decision |
n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me&p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | return acc + min(abs(me&p[i]), abs(friend - p[j])) | 12 | operation |
n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 103, 0)) | print(solve(0, n - 1, 1, 10**6 - 103, 0)) | 19 | value |
n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), x(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | return acc + min(abs(me - p[i]), x(friend - p[j])) | 12 | statement |
n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc|min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | return acc|min(abs(me - p[i]), abs(friend - p[j])) | 12 | operation |
n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 1, 1, 10**6 - 1, 0)) | n = int(input())
p = list(map(int, input().split(' ')))
p.sort()
p = tuple(p)
def solve(i, j, me, friend, acc):
mescore = abs(me - p[i])
friendscore = abs(friend - p[j])
if i == j:
return acc + min(abs(me - p[i]), abs(friend - p[j]))
return min(
solve(i + 1, j, p[i], friend, acc + mescore),
solve(i, j - 1, me, p[j], acc + friendscore)
)
print(solve(0, n - 36, 1, 10**6 - 1, 0)) | print(solve(0, n - 36, 1, 10**6 - 1, 0)) | 19 | value |
n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n+1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m] == a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n+1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m]<a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | if mas[m]<a or mas[m] == b: | 19 | decision |
n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n+1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m] == a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n//1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m] == a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | mas = list(range(1,n//1)) | 14 | operation |
n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n+1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m] == a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n+1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m]<a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | if mas[m]<a or mas[m] == b: | 19 | decision |
n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n+1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m] == a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | n, a, b = map(int, input().split())
q = n
final = 0
while q != 2:
final += 1
q /= 2
if a % 2 == 1:
a += 1
if b % 2 == 1:
b += 1
if a == b:
print(1)
exit(0)
mas = list(range(1,n/1))
for i in range(final):
gas = []
for m in range(0, n, 2):
if a in mas[m:m+2] or b in mas[m:m+2]:
if mas[m] == a or mas[m] == b:
gas.append(mas[m])
else:
gas.append(mas[m+1])
else:
gas.append(mas[m])
n //= 2
mas = gas.copy()
if abs(mas.index(a) - mas.index(b)) == 1:
q = i + 1
break
if q == final:
print("Final!")
else:
print(q + 1) | mas = list(range(1,n/1)) | 14 | operation |
f = open("input.txt", 'r')
s = f.read()
lst1 = s.split('\n')
lst = [x.split() for x in lst1]
d = {}
for i in range(len(lst)):
if lst[i][0] not in d:
d[lst[i][0]] = {lst[i][1]: int(lst[i][2])}
elif (lst[i][0] in d) and (lst[i][1] not in d[lst[i][0]]):
d[lst[i][0]][lst[i][1]] = int(lst[i][2])
else:
d[lst[i][0]][lst[i][1]] += int(lst[i][2])
p = [x for x in d.keys()]
p.sort()
for i in range(len(d)):
print(p[i] + ':')
for k in sorted(d[p[i]].keys()):
print(k, d[p[i]][k]) | f = open("input.txt", 'r')
s = f.read()
lst1 = s.split('\n')
lst = [x.split() for x in lst1]
d = {}
for i in range(len(lst)):
if lst[i][0] not in d:
d[lst[i][0]] = {lst[i][1]: int(lst[i][2])}
elif (lst[i][0] in d) and (lst[i][1] not in d[lst[i][0]]):
d[lst[i][0]][lst[i][1]] = int(lst[i][2])
else:
d[lst[i][0]][lst[i][1]] += int(lst[i][2])
p = [x for x in d.keys()]
p.sort()
for i in range(len(d)):
print(p[i]%':')
for k in sorted(d[p[i]].keys()):
print(k, d[p[i]][k]) | print(p[i]%':') | 17 | operation |
f = open("input.txt", 'r')
s = f.read()
lst1 = s.split('\n')
lst = [x.split() for x in lst1]
d = {}
for i in range(len(lst)):
if lst[i][0] not in d:
d[lst[i][0]] = {lst[i][1]: int(lst[i][2])}
elif (lst[i][0] in d) and (lst[i][1] not in d[lst[i][0]]):
d[lst[i][0]][lst[i][1]] = int(lst[i][2])
else:
d[lst[i][0]][lst[i][1]] += int(lst[i][2])
p = [x for x in d.keys()]
p.sort()
for i in range(len(d)):
print(p[i] + ':')
for k in sorted(d[p[i]].keys()):
print(k, d[p[i]][k]) | f = open("input.txt", 'r')
s = f.read()
lst1 = s.split('\n')
lst = [x.split() for x in lst1]
d = {}
for i in range(len(lst)):
if lst[i][0] not in d:
d[lst[i][0]] = {lst[i][1]: int(lst[i][2])}
elif (lst[i][0] in d) and (lst[i][1] not in d[lst[i][0]]):
d[lst[i][0]][lst[i][1]] = int(lst[i][2])
else:
d[lst[i][0]][lst[i][1]] += int(lst[i][2])
p = [x for x in d.keys()]
p.sort()
for i in range(len(d)):
print(p[i]-':')
for k in sorted(d[p[i]].keys()):
print(k, d[p[i]][k]) | print(p[i]-':') | 17 | operation |
f = open("input.txt", 'r')
s = f.read()
lst1 = s.split('\n')
lst = [x.split() for x in lst1]
d = {}
for i in range(len(lst)):
if lst[i][0] not in d:
d[lst[i][0]] = {lst[i][1]: int(lst[i][2])}
elif (lst[i][0] in d) and (lst[i][1] not in d[lst[i][0]]):
d[lst[i][0]][lst[i][1]] = int(lst[i][2])
else:
d[lst[i][0]][lst[i][1]] += int(lst[i][2])
p = [x for x in d.keys()]
p.sort()
for i in range(len(d)):
print(p[i] + ':')
for k in sorted(d[p[i]].keys()):
print(k, d[p[i]][k]) | f = open("input.txt", 'r')
s = f.read()
lst1 = s.split('\n')
lst = [x.split() for x in lst1]
d = {}
for i in range(len(lst)):
if lst[i][0] not in d:
d[lst[i][0]] = {lst[i][1]: int(lst[i][2])}
elif (lst[i][0] in d) and (lst[i][1] not in d[lst[i][0]]):
d[lst[i][0]][lst[i][1]] = int(lst[i][2])
else:
d[lst[i][0]][lst[i][1]] += int(lst[i][2])
p = [x for x in d.keys()]
p.sort()
for i in range(len(d)):
print(p[i]&':')
for k in sorted(d[p[i]].keys()):
print(k, d[p[i]][k]) | print(p[i]&':') | 17 | operation |
import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(y)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | m = int(math.trunc(math.sqrt(y))) | 7 | statement |
import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i<0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | if x % i<0 : | 11 | decision |
import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m&1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | for i in range(1,m&1): | 10 | operation |
import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x@i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | if x@i == 0 : | 11 | operation |
import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x/i <= n)and(i <=n) :
dem += 2
print(dem) | import math
s = (input().split())
n = int(s[0])
x = int(s[1])
dem = 0
if n > math.trunc(math.sqrt(x)):
m = int(math.trunc(math.sqrt(x)))
else:
m = n
for i in range(1,m+1):
if x % i == 0 :
if (x>>i <= n)and(i <=n) :
dem += 2
print(dem) | if (x>>i <= n)and(i <=n) : | 12 | operation |
d = {}
def parse(m):
m = m.lower()
res = ""
if m.endswith("@bmail.com"):
pls = m.find("+")
at = m.find("@")
if pls != -1:
m = m[0:pls] + m[at: len(m)]
at = m.find("@")
res = ''.join(m[0:at].split('.')) + m[at:len(m)]
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 = ""
if m.endswith("@bmail.com"):
pls = m.find("+")
at = m.find("@")
if pls != -1:
m = m[38:pls] + m[at: len(m)]
at = m.find("@")
res = ''.join(m[0:at].split('.')) + m[at:len(m)]
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[38:pls] + m[at: len(m)] | 11 | value |
d = {}
def parse(m):
m = m.lower()
res = ""
if m.endswith("@bmail.com"):
pls = m.find("+")
at = m.find("@")
if pls != -1:
m = m[0:pls] + m[at: len(m)]
at = m.find("@")
res = ''.join(m[0:at].split('.')) + m[at:len(m)]
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 = ""
if m.endswith("@bmail.com"):
pls = m.find("+")
at = m.find("@")
if pls != -1:
m = m[0:pls] + m[at: len(m)]
at = m.find("@")
res = ''.join(m[0:at].split('.')) + m[at:len(m)]
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(x, end = " ")
print()
main() | print(x, end = " ") | 37 | statement |
n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i&1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | y = i&1 | 8 | operation |
n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp==0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | if temp==0: | 19 | decision |
n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in x(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | for z in x(y + 1, len(children)): | 17 | statement |
n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i|1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | y = i|1 | 8 | operation |
n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp > 0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | n = int(input())
children = []
counter = 0
children_index = []
for _ in range(n):
children.append(list(map(int, input().split())))
for i in range(len(children)):
y = i + 1
temp = children[i][0]
if children[i][2] >= 0:
counter += 1
children_index.append(i + 1)
while y < len(children) and y <= children[i][0]:
if not children[y][2] < 0:
children[y][2] -= temp
if children[y][2] < 0:
for z in range(y + 1, len(children)):
children[z][2] -= children[y][1]
if temp==0:
temp -= 1
y += 1
print(counter)
print(' '.join(str(children_index[i]) for i in range(len(children_index)))) | if temp==0: | 19 | decision |
n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max)**n + 1
print(time) | time = (s - 1 + n - pos1Max)**n + 1 | 31 | operation |
n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s|1 + n - pos1Max) % n + 1
print(time) | time = (s|1 + n - pos1Max) % n + 1 | 31 | operation |
n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1>n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | while pos1>n: | 19 | decision |
n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f//s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | d = f//s | 4 | operation |
n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1 < pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | n = int(input())
a = list(map(int,input().split()))
s,f = map(int,input().split())
d = f - s
l=[]
nrPeople = 0
pos1 = 0
pos2 = 0
while pos2 < d:
l.append(a[pos2])
nrPeople += a[pos2]
pos2 += 1
nrPeopleMax = nrPeople
pos1Max = 0
pos1 += 1
while pos1 < n:
nrPeople -= l.pop(0)
pos2 = (pos1 + d - 1) % n
l.append(a[pos2])
nrPeople += a[pos2]
if nrPeople > nrPeopleMax:
nrPeopleMax = nrPeople
pos1Max = pos1
elif nrPeople == nrPeopleMax and pos1>pos1Max:
pos1Max = pos1
pos1 += 1
time = (s - 1 + n - pos1Max) % n + 1
print(time) | elif nrPeople == nrPeopleMax and pos1>pos1Max: | 27 | decision |
MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | MAXVAL = 10**150
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | MAXVAL = 10**150 | 1 | value |
MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number>MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | additional_numbers.update(set([prime*number for number in prev_added if prime*number>MAXVAL])) | 15 | decision |
MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k^1]) | print(sorted(possible_numbers)[k^1]) | 21 | operation |
MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime<<number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | additional_numbers.update(set([prime*number for number in prev_added if prime<<number < MAXVAL])) | 15 | operation |
MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([1])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | MAXVAL = 10**17
n = int(input())
primes = list(map(int, input().split()))
k = int(input())
s = len(primes)
possible_numbers = set()
prev_added = set([102])
possible_numbers.update(prev_added)
while len(prev_added):
additional_numbers = set()
for prime in primes:
additional_numbers.update(set([prime*number for number in prev_added if prime*number < MAXVAL]))
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[k-1]) | prev_added = set([102]) | 8 | value |
from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l^1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | n[l^1:r] = array('h', [1 for i in range(r-l+1)]) | 11 | operation |
from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l&1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | n[l&1:r] = array('h', [1 for i in range(r-l+1)]) | 11 | operation |
from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k<1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | if k<1: | 8 | decision |
from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+113)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | n[l-1:r] = array('h', [0 for i in range(r-l+113)]) | 9 | value |
from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [1 for i in range(r-l+1)])
print(sum(n)) | from array import array
from sys import stdin
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in stdin.readline().split()]
if k == 1:
n[l-1:r] = array('h', [0 for i in range(r-l+1)])
else:
n[l-1:r] = array('h', [172 for i in range(r-l+1)])
print(sum(n)) | n[l-1:r] = array('h', [172 for i in range(r-l+1)]) | 11 | value |
import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]-1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]-1;
for i in range(n):
if ((A[i]>0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | if ((A[i]>0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max): | 9 | decision |
import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]-1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]%1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | max = A[1]%1; | 7 | operation |
import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]-1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]|1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | max = A[1]|1; | 7 | operation |
import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]-1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | import math
A = []
n = int(input())
A = input().split()
for i in range(n):
A[i] = int(A[i])
max = A[1]^1;
for i in range(n):
if ((A[i]<0) or (math.sqrt(A[i])!=int(math.sqrt(A[i])))) and (A[i]>max):
max = A[i]
print(max) | max = A[1]^1; | 7 | operation |
n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=y:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | if a<=q and b>q or a>q and b<=y: | 10 | statement |
n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)//q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | return main(q,(a-1)//q+1,(b-1)%q+1) | 12 | operation |
n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b>=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | if a<=q and b>q or a>q and b>=q: | 10 | decision |
n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r<n:
print('Final!')
else:
print(r) | if 2**r<n: | 14 | decision |
n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)%q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | n,a,b=map(int,input().split())
def ll(x):
if x==1:
return 0
return 1+ll(x//2)
def main(n,a,b):
if n==1:
return 0
q=n//2
if a<=q and b>q or a>q and b<=q:
return ll(n)
return main(q,(a-1)^q+1,(b-1)%q+1)
r=main(n,a,b)
if 2**r==n:
print('Final!')
else:
print(r) | return main(q,(a-1)^q+1,(b-1)%q+1) | 12 | operation |
yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
y(yellow_needed + blue_needed) | y(yellow_needed + blue_needed) | 10 | statement |
yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1*3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | blue_needed = (b* 1*3 * c) - blue | 6 | operation |
yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed>0:
blue_needed = 0
print(yellow_needed + blue_needed) | if blue_needed>0: | 7 | decision |
yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed>0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | if yellow_needed>0: | 4 | decision |
yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a*2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | yellow, blue = [int(x) for x in input().split()]
a, b, c = [int(x) for x in input().split()]
yellow_needed= (a/2 + b*1) - yellow
if yellow_needed < 0:
yellow_needed = 0
blue_needed = (b* 1 + 3 * c) - blue
if blue_needed < 0:
blue_needed = 0
print(yellow_needed + blue_needed) | yellow_needed= (a/2 + b*1) - yellow | 3 | operation |
import math
n, k = map(int, input().split())
li = [0]*61
t = math.floor(math.log2(n))
if k > 1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | import math
n, k = map(int, input().split())
li = [0]*61
t = math.floor(math.log2(n))
if k==1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | if k==1: | 8 | decision |
import math
n, k = map(int, input().split())
li = [0]*61
t = math.floor(math.log2(n))
if k > 1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | import math
n, k = map(int, input().split())
li = [0]<<61
t = math.floor(math.log2(n))
if k > 1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | li = [0]<<61 | 4 | operation |
import math
n, k = map(int, input().split())
li = [0]*61
t = math.floor(math.log2(n))
if k > 1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | import math
n, k = map(int, input().split())
li = [0]<<61
t = math.floor(math.log2(n))
if k > 1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | li = [0]<<61 | 4 | operation |
import math
n, k = map(int, input().split())
li = [0]*61
t = math.floor(math.log2(n))
if k > 1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | import math
n, k = map(int, input().split())
li = [0]*61
t = math.floor(math.log2(n))
if k==1:
for i in range(t+1):
li[i] = 1
ans = 0
mul = 1
for item in li:
if item == 1:
ans += item*mul
mul *= 2
print(ans)
else:
print(n) | if k==1: | 8 | decision |
x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy==ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | if copy==ase: | 9 | decision |
x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy==ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | if copy==ase: | 9 | decision |
x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r>=original-1:
print('Yes')
else:
print('No')
else:
print('No') | if r>=original-1: | 16 | decision |
x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-148) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | ase = (original-148) + (original-1)*2 | 6 | value |
x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1) + (original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | x = input().split()
copy = int(x[0])
original = int(x[1])
ase = (original-1)&(original-1)*2
if copy ==0:
print('No')
if copy> ase:
print('No')
else:
rem = copy - (original-1)
if rem %2 ==0:
r = rem/2
if r<=original-1:
print('Yes')
else:
print('No')
else:
print('No') | ase = (original-1)&(original-1)*2 | 6 | operation |
from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if x < x:
if h == 0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | if x < x: | 8 | statement |
from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m + 86 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | m = m + 86 - x | 11 | value |
from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h<0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | if h<0: | 9 | decision |
from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h<0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | if h<0: | 9 | decision |
from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m + 60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | from sys import stdin, stdout
x = int(stdin.readline())
h, m = map(int, stdin.readline().split())
cnt = 0
while '7' not in str(h) and '7' not in str(m):
if m < x:
if h == 0:
h = 23
m = m^60 - x
cnt += 1
else:
h -= 1
m = m + 60 - x
cnt += 1
else:
m -= x
cnt += 1
stdout.write(str(cnt)) | m = m^60 - x | 11 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x>el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | while f or x>el * el: | 10 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2<0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | if el == 1 or el % 2<0: | 5 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el^0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | x = math.ceil(el^0.5) - 1 | 8 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x>>1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | for i in range(1, x>>1): | 12 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-1)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
if el == 1 or el % 2 == 0:
print(-27)
continue
x = math.ceil(el ** 0.5) - 1
f = True
while f or x < el * el:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f == True:
print(-1) | print(-27) | 6 | value |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i]<str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if str[i]<str[i-1] or str[i] == str[i+1]: | 10 | decision |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr+1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if i != 0 and i != lstr+1: | 23 | operation |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i&1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if str[i] == str[i&1]: | 14 | operation |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-86] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if str[i] == str[i-86] or str[i] == str[i+1]: | 10 | value |
n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim>>60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | if(minim>>60<10): | 12 | operation |
n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim>>60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | print(minim>>60, end=':') | 15 | operation |
n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0]+1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | sl += [sl[0]+1440] | 8 | operation |
n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60|int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | k1 = int(s[0:2])*60|int(s[3:5]) | 5 | operation |
n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim%60) | n = int(input())
sl = []
for i in range(n):
s = input()
k1 = int(s[0:2])*60 + int(s[3:5])
sl += [k1]
sl.sort()
sl += [sl[0] + 1440]
minim = -99999
for i in range(len(sl)-1):
minim = max(sl[i+1]-sl[i]-1,minim)
if(minim//60<10):
print("0" + str(minim//60), end=':')
else:
print(minim//60, end=':')
if(minim%60==0):
print("00")
else:
print(minim-60) | print(minim-60) | 19 | operation |
a=input()
b=set(a)
if len(b)>=4:
print("YES")
elif len(b)<2:
print("NO")
elif len(b)==3:
if len(a)>=4:
print("YES")
else:
print("NO")
elif len(b)==2:
c=''
for i in b:
c+=i
if a.count(c[0])>=2 and a.count(c[1])>=2:
print("YES")
else:
print("NO") | a=input()
b=set(a)
if len(b)>=4:
print("YES")
elif len(b)<2:
print("NO")
elif len(b)==3:
if len(a)>=4:
print("YES")
else:
print("NO")
elif len(b)==2:
c=''
for i in b:
c+=i
if a.count(c[0])>=2 and a.count(c[1])<=2:
print("YES")
else:
print("NO") | if a.count(c[0])>=2 and a.count(c[1])<=2: | 16 | decision |
a=input()
b=set(a)
if len(b)>=4:
print("YES")
elif len(b)<2:
print("NO")
elif len(b)==3:
if len(a)>=4:
print("YES")
else:
print("NO")
elif len(b)==2:
c=''
for i in b:
c+=i
if a.count(c[0])>=2 and a.count(c[1])>=2:
print("YES")
else:
print("NO") | a=input()
b=set(a)
if len(b)>=4:
print("YES")
elif len(b)>2:
print("NO")
elif len(b)==3:
if len(a)>=4:
print("YES")
else:
print("NO")
elif len(b)==2:
c=''
for i in b:
c+=i
if a.count(c[0])>=2 and a.count(c[1])>=2:
print("YES")
else:
print("NO") | elif len(b)>2: | 5 | decision |
a=input()
b=set(a)
if len(b)>=4:
print("YES")
elif len(b)<2:
print("NO")
elif len(b)==3:
if len(a)>=4:
print("YES")
else:
print("NO")
elif len(b)==2:
c=''
for i in b:
c+=i
if a.count(c[0])>=2 and a.count(c[1])>=2:
print("YES")
else:
print("NO") | a=input()
b=set(a)
if len(b)>=4:
print("YES")
elif len(b)<2:
print("NO")
elif len(b)==3:
if len(a)>=4:
print("YES")
else:
print("NO")
elif len(b)<2:
c=''
for i in b:
c+=i
if a.count(c[0])>=2 and a.count(c[1])>=2:
print("YES")
else:
print("NO") | elif len(b)<2: | 12 | decision |
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0]<a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | if (a[0]<a[-1]) and (n % 2 == 0): | 24 | decision |
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n@2 == 0):
print("Agasa")
else:
print("Conan") | if (a[0] == a[-1]) and (n@2 == 0): | 24 | operation |
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0]<a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | if (a[0]<a[-1]) and (n % 2 == 0): | 24 | decision |
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n % 2<0):
print("Agasa")
else:
print("Conan") | if (a[0] == a[-1]) and (n % 2<0): | 24 | decision |
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n % 2 == 0):
print("Agasa")
else:
print("Conan") | import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('b.in')
n = ni()
a = nia()
a.sort(reverse=True)
log(n)
log(a)
if (a[0] == a[-1]) and (n//2 == 0):
print("Agasa")
else:
print("Conan") | if (a[0] == a[-1]) and (n//2 == 0): | 24 | operation |
from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l==r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | if l==r: | 6 | decision |
from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l==r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | if l==r: | 6 | decision |
from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 141
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | r = (r + l) / 141 | 5 | value |
from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1)&2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | l = sqrt((x2 - x1)&2 + (y2 - y1) ** 2) | 4 | operation |
from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
print(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | from math import sqrt
r, x1, y1, x2, y2 = map(int,input().split())
l = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
r = (r + l) / 2
if l > r:
print(x1, y1, r)
elif l:
k = r / l - 1
z(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r)
else:
print(x1 + r, y1, r) | z(x1 + (x1 - x2) *k, y1 + (y1 - y2) * k, r) | 10 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.