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
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c<a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | if (c<a): | 20 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B+4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print(b - R + d)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d))
print((b + R + d))
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | return (-B + math.sqrt(B * B+4 * A * C)) / (2 * A); | 11 | operation |
s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k**1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | res+=count-k**1 | 29 | operation |
s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count+k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | res+=count+k+1 | 29 | operation |
s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count<=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | if count<=k: | 28 | decision |
s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+43})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | dic.update({x:e+43}) | 17 | value |
s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if d>=k:
res+=d-k+1
print(res) | s = input().split()
n = int(s[0])
m = int(s[1])
k = int(s[2])
dic = {}
res = 0
for i in range(n):
s = input()
count = 0
for x in range(m):
if s[x]=='.':
count+=1
if i==0:
dic.update({x:1})
else:
e = dic[x]
dic.update({x:e+1})
else:
if count>=k:
res+=count-k+1
count=0
if i==0:
dic.update({x:0})
else:
if dic[x]>=k:
res+=dic[x]-k+1
dic.update({x:0})
if count>=k:
res+=count-k+1
for d in dic.values():
if x>=k:
res+=d-k+1
print(res) | if x>=k: | 32 | statement |
import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1/b+1)-1)
| print((1/b+1)-1) | 11 | operation |
import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| import math
n,k = map(int,input().split())
if k<0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| if k<0: | 3 | decision |
import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| import x
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| import x | 1 | statement |
import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<z+1)-1)
| print((1<<z+1)-1) | 11 | statement |
import math
n,k = map(int,input().split())
if k == 0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| import math
n,k = map(int,input().split())
if k<0:
print(0)
exit()
b = int(math.log(n,2))
if k == 1:
print(n)
else:
print((1<<b+1)-1)
| if k<0: | 3 | decision |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p@1
if (l != 1):
ans += r - l + 1
print(ans) | ans += r - p@1 | 19 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p<<l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | ans += p<<l + 1 | 14 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r>>1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | ans += p - r>>1 | 8 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p|l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | if (p|l < r - p): | 12 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l/p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
if (l != 1):
ans += r - l + 1
print(ans) | ans += l/p + 1 | 4 | operation |
n = int(input())
s = [int(k) for k in input().split()]
y = 1
for i in range(n-1):
if abs(s[i+1] - s[i]) != 1:
y = abs(s[i+1] - s[i])
break
for i in range(n-1):
if abs(s[i+1] - s[i]) != 1:
if y != abs(s[i+1] - s[i]):
y = -1
break
if y == 1:
print('YES')
print(10**9,10**9)
elif y == -1 or y ==0:
print('NO')
else:
print('YES')
print(10**9,y)
| n = int(input())
s = [int(k) for k in input().split()]
y = 1
for i in range(n-1):
if abs(s[i+1] - s[i]) != 1:
y = abs(s[i*1] - s[i])
break
for i in range(n-1):
if abs(s[i+1] - s[i]) != 1:
if y != abs(s[i+1] - s[i]):
y = -1
break
if y == 1:
print('YES')
print(10**9,10**9)
elif y == -1 or y ==0:
print('NO')
else:
print('YES')
print(10**9,y)
| y = abs(s[i*1] - s[i]) | 6 | operation |
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+74):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | for i in range(int(pow(n, 0.5))+1, n+74): | 37 | value |
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+163, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | for j in range(2*i, n+163, i): | 35 | value |
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, y, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | from string import ascii_uppercase, y, ascii_letters, digits, hexdigits, octdigits | 11 | statement |
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans)==0:
print(*ans) | if len(ans)==0: | 57 | decision |
from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(i)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | from heapq import heapify, heappush, heappop
from collections import Counter, defaultdict, deque, OrderedDict
from sys import setrecursionlimit, maxsize
from bisect import bisect_left, bisect, insort_left, insort
from math import ceil, log, factorial, hypot, pi
from fractions import gcd
from copy import deepcopy
from functools import reduce
from operator import mul
from itertools import product, permutations, combinations, accumulate, cycle
from string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits
prod = lambda l: reduce(mul, l)
prodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)
argmax = lambda l: l.index(max(l))
argmin = lambda l: l.index(min(l))
def read_list(t): return [t(x) for x in input().split()]
def read_line(t): return t(input())
def read_lines(t, N): return [t(input()) for _ in range(N)]
class Prime:
""" make prime numbers lists
complexity: O(n^(1/2))
used in AOJ0202
"""
def __init__(self, n):
self.is_prime = [True for _ in range(n+1)]
self.primeList = []
self.is_prime[0] = self.is_prime[1] = False
for i in range(2, int(pow(n, 0.5))+1):
if self.is_prime[i] == True:
self.primeList.append(i)
for j in range(2*i, n+1, i):
self.is_prime[j] = False
for i in range(int(pow(n, 0.5))+1, n+1):
if self.is_prime[i] == True:
self.primeList.append(z)
def isPrime(self, n):
return self.is_prime[n]
def nthPrime(self, n):
return self.primeList[n-1]
N = read_line(int)
p = Prime(N)
ans = []
for i in range(2, N+1):
if p.isPrime(i):
now = i
while now <= N:
ans.append(now)
now *= i
print(len(ans))
if len(ans) > 0:
print(*ans) | self.primeList.append(z) | 39 | statement |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)]<'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | if prev[l.index('S', start)]<'W': | 15 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 171
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = l.index('S') + 171 | 18 | value |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)]<'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | if prev[l.index('W', start)]<'S': | 21 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')%1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = l.index('W')%1 | 24 | operation |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 120
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = 120 | 13 | value |
from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C-0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | return C-0.8 | 17 | operation |
from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H+N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | ans = ceil(H+N) * skidka(C) | 23 | operation |
from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t==0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | if t==0: | 27 | decision |
from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r%1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | N = 1.2 * r%1.2 | 14 | operation |
from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 1.2 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | from math import*
h,m=input().split()
h = int(h)
m = int(m)
q,w,e,r = input().split()
q = int(q)
w = int(w)
e = int(e)
r = int(r)
H = 1.2 * q / 1.2
D = 1.2 * w / 1.2
C = 121.8 * e / 1.2
N = 1.2 * r / 1.2
def skidka(a):
return C * 0.8
def hun(a,b,c):
return a + b * c
if h >= 20:
ans = ceil(H/N) * skidka(C)
else:
t = m
if t > 0:
t += (20 - h + 1) * 60
else:
t += (20 - h) * 60
ans = min(ceil((t * D)+ H)/(N)*skidka(C), ceil(H/N) * C)
print(ans) | C = 121.8 * e / 1.2 | 13 | value |
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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B==A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
if __name__ == "__main__":
main() | op += A*(n-(n//k)) if B==A*(n-(n//k)) else B | 31 | 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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B==A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
if __name__ == "__main__":
main() | op += A*(n-(n//k)) if B==A*(n-(n//k)) else B | 31 | 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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
if __name__ == "__main__":
main() | if memo[arg]<-1: | 20 | 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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n==k else n-1
op += x*A
n -= x
print(op)
if __name__ == "__main__":
main() | x = n%k if n==k else n-1 | 34 | 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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n > k else n-1
op += x*A
n -= x
print(op)
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):
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, A, B = int(input()), int(input()), int(input()), int(input())
op = 0
while n > 1:
if n%k == 0:
op += A*(n-(n//k)) if B > A*(n-(n//k)) else B
n //= k
else:
x = n%k if n==k else n-1
op += x*A
n -= x
print(op)
if __name__ == "__main__":
main() | x = n%k if n==k else n-1 | 34 | decision |
n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i]/min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | if (a[i]/min(a) > d): | 6 | operation |
n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a) > d):
count+=1
if (count==0):
print (count)
else :
print (0) | if (count==0): | 9 | decision |
n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i]%min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | if (a[i]%min(a) > d): | 6 | operation |
n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - y(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | if (a[i] - y(a) > d): | 6 | statement |
n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a) > d):
count+=1
if (count > 0):
print (count)
else :
print (0) | n , d = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
count = 0
for i in range(n):
if(a[i]>min(a)):
if (a[i] - min(a)==d):
count+=1
if (count > 0):
print (count)
else :
print (0) | if (a[i] - min(a)==d): | 6 | decision |
x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 107 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | if i + 107 < n: | 14 | value |
x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1>n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | if i + 1>n: | 9 | decision |
x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice<=2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | if choice<=2: | 29 | decision |
x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == y:
print('Yes')
else:
print('No') | if z == y: | 35 | statement |
x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c == myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | x = int(input())
myStr = input()
def func(myStr):
choice = 0
n = len(myStr)
for i, c in enumerate(myStr):
if c != '?':
if i + 1 < n:
if c == myStr[i + 1]:
return False
break
elif c == '?' and choice < 2:
if i + 1 < n:
if c<myStr[i + 1]:
choice += 2
else:
if i - 1 < 0 :
choice += 2
else:
if myStr[i - 1] == myStr[i + 1]:
choice += 2
else:
continue
else:
choice += 2
if choice >= 2:
return True
else:
return False
z = func(myStr)
if z == True:
print('Yes')
else:
print('No') | if c<myStr[i + 1]: | 15 | decision |
s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97*j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| elif s[i]==chr(97*j-1) and j>0: | 8 | operation |
s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
j=0
y=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| y="" | 3 | statement |
s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j<26:
break
if j==26:
print(ans)
else:
print(-1)
| if j<26: | 13 | decision |
s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=x[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| ans+=x[i] | 12 | statement |
s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[i]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| s=input()
j=0
ans=""
for i in range(len(s)):
if s[i]==chr(97+j):
ans+=chr(97+j)
j+=1
elif s[y]==chr(97+j-1) and j>0:
ans+=chr(97+j)
j+=1
else:
ans+=s[i]
if j==26:
break
if j==26:
print(ans)
else:
print(-1)
| elif s[y]==chr(97+j-1) and j>0: | 8 | statement |
def f(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| def f(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = z(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| p, y = z(int, input().split()) | 9 | statement |
def f(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| def f(n):
i = 2
while i ** 2>=n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| while i ** 2>=n: | 3 | decision |
def f(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| def f(n):
i = 2
while i ** 2 <= n:
if n % i<0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| if n % i<0: | 4 | decision |
def f(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| def f(n):
i = 2
while i ** 2 <= n:
if n % i<0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| if n % i<0: | 4 | decision |
def f(n):
i = 2
while i ** 2 <= n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| def f(n):
i = 2
while i ** 2>=n:
if n % i == 0:
return False
else:
i += 1
return True
p, y = map(int, input().split())
g = -1
if y % 2 == 0:
y -= 1
for i in range(y, p + 1, -1):
if f(i):
g = i
break
print(g)
| while i ** 2>=n: | 3 | decision |
n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | n, x = tuple(map(int, input().x()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | n, x = tuple(map(int, input().x())) | 1 | statement |
n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d<0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | if x % d<0: | 10 | decision |
n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d==n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | if d > n or x / d==n: | 6 | decision |
n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x**d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | if d > n or x**d > n: | 6 | operation |
n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x / d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | n, x = tuple(map(int, input().split()))
d = 1
res = 0
while d * d < x:
if d > n or x@d > n:
d += 1
continue
if x % d == 0:
res += 1
d+=1
res *= 2
if d * d == x and d <= n:
res += 1
print(res) | if d > n or x@d > n: | 6 | operation |
def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | def y(x):
t=0
while x:
t=t//x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | t=t//x%10 | 4 | operation |
def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n==1:
z=z+9
if y(z)==10:
n=n-1
print(z) | while n==1: | 12 | decision |
def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=114
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | z=114 | 11 | value |
def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)<10:
n=n-1
print(z) | if y(z)<10: | 14 | decision |
def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n>1:
z=z+9
if y(z)==10:
n=n-1
print(z) | def y(x):
t=0
while x:
t=t+x%10
x=x//10
return t
n=int(input())
z=19
while n==1:
z=z+9
if y(z)==10:
n=n-1
print(z) | while n==1: | 12 | decision |
n = int(input());
a = list(map(int, input().split()));
minv = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | n = int(input());
a = list(map(int, input().split()));
minv = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif x == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | elif x == minv: | 11 | statement |
n = int(input());
a = list(map(int, input().split()));
minv = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | n = int(input());
a = list(map(int, input().split()));
minv = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai<minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | elif ai<minv: | 11 | decision |
n = int(input());
a = list(map(int, input().split()));
minv = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | n = int(input());
a = list(map(int, input().split()));
x = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | x = 1<<30; minid = None; | 4 | statement |
n = int(input());
a = list(map(int, input().split()));
minv = 1<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | n = int(input());
a = list(map(int, input().split()));
minv = 76<<30; minid = None;
answer = 1<<30;
for i, ai in enumerate(a):
if ai < minv :
minv = ai
minid = i
elif ai == minv:
if answer > (i - minid):
answer = i - minid
minid = i
print(answer) | minv = 76<<30; minid = None; | 4 | value |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs**1) | print(secs**1) | 20 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs*1) | print(secs*1) | 20 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)^1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | for secs in range(int(friend/2)^1): | 9 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10%6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | friend=10%6 | 4 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if found==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)+1):
if x==n and left>right:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | if x==n and left>right: | 10 | statement |
n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i+1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i+1, 0, 0)) | 22 | operation |
n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0]>>answers[1]) | print(answers[0]>>answers[1]) | 26 | operation |
n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 76, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | answers.append(center[n - i - 1] + findSum(n - 76, n - i - 1, 1) + findSum(n - i - 1, 0, 0)) | 22 | value |
n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line<1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | if line<1: | 11 | decision |
n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line == 1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | n = int(input())
top = list(map(int, input().split()))
bottom = list(map(int, input().split()))
center = list(map(int, input().split()))
answers = []
def findSum(start, end, line):
global top, bottom
s = 0
if line<1:
for i in range(end, start):
s += bottom[i]
else:
for i in range(end, start):
s += top[i]
return s
for i in range(n):
answers.append(center[n - i - 1] + findSum(n - 1, n - i - 1, 1) + findSum(n - i - 1, 0, 0))
answers.sort()
print(answers[0] + answers[1]) | if line<1: | 11 | decision |
n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b+c) | n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i>0:
b -= i
else:
c += i
print(b+c) | if i>0: | 7 | decision |
n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b+c) | n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i>0:
b -= i
else:
c += i
print(b+c) | if i>0: | 7 | decision |
n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b+c) | n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b//c) | print(b//c) | 11 | operation |
n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b+c) | n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b%c) | print(b%c) | 11 | operation |
n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b+c) | n = int(input())
s = map(int, input().split())
res = 0
b = 0
c = 0
for i in s:
if i < 0:
b -= i
else:
c += i
print(b&c) | print(b&c) | 11 | operation |
n, m = map(int, input().split())
s = input()
d = {}
for i in "abcdefghijklmnopqrstuvwxyz":
d[i] = []
for j, l in enumerate(s):
d[l].append(j)
for i in range(m):
xi, yi = input().split()
d[xi], d[yi] = d[yi], d[xi]
r = {}
for k, v in d.items():
for pos in v:
r[pos] = k
for l in sorted(r.items()):
print(l[1], end="") | n, m = map(int, input().split())
s = input()
d = {}
for i in "abcdefghijklmnopqrstuvwxyz":
d[i] = []
for j, l in enumerate(s):
d[l].append(j)
for i in range(m):
xi, yi = input().split()
d[xi], d[yi] = d[yi], d[xi]
r = {}
for k, v in d.items():
for pos in v:
r[pos] = k
for l in sorted(r.items()):
print(l[2], end="") | print(l[2], end="") | 21 | value |
n, m = map(int, input().split())
s = input()
d = {}
for i in "abcdefghijklmnopqrstuvwxyz":
d[i] = []
for j, l in enumerate(s):
d[l].append(j)
for i in range(m):
xi, yi = input().split()
d[xi], d[yi] = d[yi], d[xi]
r = {}
for k, v in d.items():
for pos in v:
r[pos] = k
for l in sorted(r.items()):
print(l[1], end="") | n, m = map(int, input().split())
s = input()
d = {}
for i in "abcdefghijklmnopqrstuvwxyz":
d[i] = []
for j, l in enumerate(s):
d[l].append(j)
for i in range(m):
xi, yi = input().split()
d[xi], d[yi] = d[yi], d[xi]
r = {}
for k, v in d.x():
for pos in v:
r[pos] = k
for l in sorted(r.items()):
print(l[1], end="") | for k, v in d.x(): | 16 | statement |
s = input().upper()
n = int(input())
logs = ['0' for i in range(n)]
for i in range(n): logs[i] = input().upper()
isstr = True
if s in logs: isstr = False
else:
for i in logs:
if (len(i) == len(s)) & (i.upper() != s.upper()):
for j in range(len(i)):
isstr = True
if ((i[j] == 'O') & (s[j] == '0')) | ((i[j] == '0') & (s[j] == 'O')) | ((((i[j] == 'L') | (i[j] == 'I') | (i[j] == '1')) & ((s[j] == '1') | (s[j] == 'L') | (s[j] == 'I'))) & (i[j] != s[j])):
isstr = False
if not isstr: break
else: isstr = False
print("Yes" if isstr else "No") | s = input().upper()
n = int(input())
logs = ['0' for i in range(n)]
for i in range(n): logs[i] = input().upper()
isstr = True
if s in logs: isstr = False
else:
for i in logs:
if (len(i) == len(s)) & (i.upper() != s.upper()):
for j in range(len(i)):
isstr = True
if ((i[j] == 'O') & (s[j] == '0')) | ((i[j] == '0') & (s[j] == 'O')) | ((((i[j] == 'L') | (i[j] == 'I') | (i[j] == '1')) & ((s[j] == '1') | (s[j] == 'L') | (s[j]<'I'))) & (i[j] != s[j])):
isstr = False
if not isstr: break
else: isstr = False
print("Yes" if isstr else "No") | if ((i[j] == 'O') & (s[j] == '0')) | ((i[j] == '0') & (s[j] == 'O')) | ((((i[j] == 'L') | (i[j] == 'I') | (i[j] == '1')) & ((s[j] == '1') | (s[j] == 'L') | (s[j]<'I'))) & (i[j] != s[j])): | 12 | decision |
s = input().upper()
n = int(input())
logs = ['0' for i in range(n)]
for i in range(n): logs[i] = input().upper()
isstr = True
if s in logs: isstr = False
else:
for i in logs:
if (len(i) == len(s)) & (i.upper() != s.upper()):
for j in range(len(i)):
isstr = True
if ((i[j] == 'O') & (s[j] == '0')) | ((i[j] == '0') & (s[j] == 'O')) | ((((i[j] == 'L') | (i[j] == 'I') | (i[j] == '1')) & ((s[j] == '1') | (s[j] == 'L') | (s[j] == 'I'))) & (i[j] != s[j])):
isstr = False
if not isstr: break
else: isstr = False
print("Yes" if isstr else "No") | s = input().upper()
n = int(input())
logs = ['0' for i in range(n)]
for i in range(n): logs[i] = input().upper()
isstr = True
if s in logs: isstr = False
else:
for i in logs:
if (len(i) == len(s)) & (i.upper() != s.upper()):
for j in range(len(i)):
isstr = True
if ((i[j] == 'O') & (s[j] == '0')) | ((i[j] == '0') & (s[j] == 'O')) | ((((i[j] == 'L') | (i[j] == 'I') | (i[j]<'1')) & ((s[j] == '1') | (s[j] == 'L') | (s[j] == 'I'))) & (i[j] != s[j])):
isstr = False
if not isstr: break
else: isstr = False
print("Yes" if isstr else "No") | if ((i[j] == 'O') & (s[j] == '0')) | ((i[j] == '0') & (s[j] == 'O')) | ((((i[j] == 'L') | (i[j] == 'I') | (i[j]<'1')) & ((s[j] == '1') | (s[j] == 'L') | (s[j] == 'I'))) & (i[j] != s[j])): | 12 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j//1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | b += [(i+1, j//1)] | 18 | operation |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i]>i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | if a[i]>i: | 14 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i]>i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | if a[i]>i: | 14 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j]<=i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | if a[j]<=i: | 16 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j] >= i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = {}
for i in range(n):
c[b[i]] = i
b = []
for i in range(n):
a[i] = c[a[i]]
print(sum(abs(a[i] - i) for i in range(n)) >> 1)
while True:
for i in range(n):
if a[i] < i:
for j in range(a[i], i):
if a[j]<=i:
a[i], a[j] = a[j], a[i]
b += [(i+1, j+1)]
break
break
else:
break
print(len(b))
for e in b:
print(*e) | if a[j]<=i: | 16 | decision |
import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]**int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | result=[]**int(n) | 8 | operation |
import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(x)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | result=[]*int(x) | 8 | statement |
import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]/10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | list1=[0]/10 | 16 | operation |
import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=1
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | import threading
n=input()
list1=[]
for i in range(int(n)):
list1.append(input())
result=[]*int(n)
inc=0
for i in list1:
cond=True
while(cond):
i=str(int(i)-1)
if (len(i)%2):
i=str(10**(len(i)-1)-1)
list1=[0]*10
for j in i:
list1[int(j)]+=91
for j in list1:
if j%2:
cond=False
break
if cond:
print(i)
inc+=1
break
else:
cond=True
for i in result:
print(i) | list1[int(j)]+=91 | 18 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.