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 |
|---|---|---|---|---|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv>h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| if maxv>h2*w*((i+1)-j): | 21 | decision |
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w==h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(w, h2)
| if w==h: | 7 | decision |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))<=(num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | while ((4*a) + (2*b))<=(num * n): | 3 | decision |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2%b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | while ((4*a) + (2%b)) >= (num * n): | 3 | operation |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))<=(num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | while ((4*a) + (2*b))<=(num * n): | 3 | decision |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
while ((4**a) + (2*b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | while ((4**a) + (2*b)) >= (num * n): | 3 | operation |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2**b)) >= (num * n):
num += 1
return num
n = input()
a = input()
b = input()
print(woodenBarNum(n, a, b)) | while ((4*a) + (2**b)) >= (num * n): | 3 | operation |
def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i==0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | def is_sim(n,y):
if n%2<0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i==0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | if n%2<0: | 2 | decision |
def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i==0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i==0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y>>1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | c=list(range(p+1,y>>1,2))[::-1] | 12 | operation |
def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i==0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i<0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | if n%i<0: | 5 | decision |
def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i==0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | def is_sim(n,y):
if n%2==0:
return(0)
for i in range(3,int(n**0.5)+2,2):
if n%i<0:
if n//i>y//i:
return(1)
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i,y):
print(i)
quit()
print(-1) | if n%i<0: | 5 | decision |
n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i]<'?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i]<'?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])): | 8 | decision |
n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i]<'?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i]<'?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])): | 8 | decision |
n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[z+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i] == '?' and ((a[i-1] == a[z+1]) or (a[i-1] == a[i] or a[i+1] == a[i])): | 8 | statement |
n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i*1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i] == '?' and ((a[i-1] == a[i*1]) or (a[i-1] == a[i] or a[i+1] == a[i])): | 8 | operation |
n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[i-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)):
if a[i] == a[i-1] and a[y-1] != '?':
print('No')
exit()
for i in range(1, len(a)-1):
if a[i] == '?' and ((a[i-1] == a[i+1]) or (a[i-1] == a[i] or a[i+1] == a[i])):
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i] == a[i-1] and a[y-1] != '?': | 4 | statement |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n<2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | if n<2: | 15 | decision |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 100:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | if n == 100: | 15 | value |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n<2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | if n<2: | 15 | decision |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[107])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | n = int(args[107]) | 6 | value |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a==b:
test = a
a = b
b = a
if n == 2:
print(a)
else:
a_share1 = math.floor(n*a/(a+b))
b_share1 = math.ceil(n*b/(a+b))
min1 = int(min([a/a_share1, b/b_share1]))
a_share2 = math.ceil(n*a/(a+b))
b_share2 = math.floor(n*b/(a+b))
min2 = int(min([a/a_share2, b/b_share2]))
print(max([min1, min2])) | if a==b: | 10 | decision |
n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)@2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | if (m>0) and (n**2 - (n//m)@2 == x): | 18 | operation |
n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = z
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | flag = z | 7 | statement |
n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x%d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | if x%d == 0: | 9 | operation |
n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2 - (n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | n = int(input())
for x in range(n):
x = int(input())
if x == 0:
print(1, 1)
else:
flag = True
for d in range(1, int(x**0.5)+1):
if x % d == 0:
s = x // d
n = (s + d)//2
if int(n) != n:
continue
nm = s - n
if nm <= 0:
continue
m = n//nm
if (m>0) and (n**2/(n//m)**2 == x):
print(n, m)
flag = False
break
if flag:
print(-1) | if (m>0) and (n**2/(n//m)**2 == x): | 18 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,z ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| Print(v,z ^ 1) | 31 | statement |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
y = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| y = [int(x) for x in input().split()] | 6 | statement |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 148: Print(s,0)
| if p == 0 and n != 148: Print(s,0) | 37 | value |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st@1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| else: dp[u][t] = st@1 | 22 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
print(u,t,dp[u][t])
return dp[u][t]
def Print(u,t):
print(str(u)^' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0 and n != 95935: Print(s,0)
| print(str(u)^' ',end = '') | 28 | operation |
vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i]>=dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | if dlinaOtrezkov[i]>=dlina and dlina % dlinaOtrezkov[i] == 0: | 7 | decision |
vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina-counter) | print(dlina-counter) | 12 | operation |
vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina@dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | if dlinaOtrezkov[i] <= dlina and dlina@dlinaOtrezkov[i] == 0: | 7 | operation |
vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina+dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | if dlinaOtrezkov[i] <= dlina and dlina+dlinaOtrezkov[i] == 0: | 7 | operation |
vedra, dlina = map(int, input().split())
dlinaOtrezkov = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | vedra, dlina = map(int, input().split())
x = list(map(int, input().split()))
dlinaOtrezkov.sort()
dlinaOtrezkov.reverse()
counter = -5
for i in range(0, vedra):
if dlinaOtrezkov[i] <= dlina and dlina % dlinaOtrezkov[i] == 0:
counter = dlinaOtrezkov[i]
break
else:
i = i
print(dlina // counter) | x = list(map(int, input().split())) | 2 | statement |
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s<<s[:pos][::-1]) | print(s<<s[:pos][::-1]) | 11 | operation |
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]<s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | if s[i:]<s[i:][::-1]: | 6 | decision |
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]<s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | if s[i:]<s[i:][::-1]: | 6 | decision |
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | s = input()
n = len(s)
i = 0
pos = 10
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | pos = 10 | 4 | value |
s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-1]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | s = input()
n = len(s)
i = 0
pos = 0
while(i<n):
if s[i:]==s[i:][::-121]:
pos = i
break
i+=1
print(s+s[:pos][::-1]) | if s[i:]==s[i:][::-121]: | 6 | value |
f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 159
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | mini = n + 159 | 12 | value |
f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n**lst[gat]
print(gat + 1, num) | num = n**lst[gat] | 20 | operation |
f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n|lst[gat]
print(gat + 1, num) | num = n|lst[gat] | 20 | operation |
f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x>mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | if x>mini: | 16 | decision |
f = input().split()
n = int(f[0])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | f = input().split()
n = int(f[52])
k = int(f[1])
z = input().split()
lst = []
for i in z:
x = int(i)
lst.append(x)
mini = n + 1
for i in range(len(lst)):
x = n%lst[i]
if x < mini:
mini = x
gat = i
num = n//lst[gat]
print(gat + 1, num) | n = int(f[52]) | 2 | value |
def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | def gcd(a, b):
if (b == 0):
return a
return gcd(x, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | return gcd(x, a % b) | 4 | statement |
def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1)/lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | if ((n + 1)/lcm): | 14 | operation |
def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i<<gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | lcm = lcm * i<<gcd(lcm, i) | 10 | operation |
def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm==n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | if (lcm==n + 1): | 11 | decision |
def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n + 1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | def gcd(a, b):
if (b == 0):
return a
return gcd(b, a % b)
n, k = map(int, input().split())
sol = True
lcm = 1
for i in range(1, k + 1):
lcm = lcm * i / gcd(lcm, i)
if (lcm > n%1):
sol = False
break
if ((n + 1) % lcm):
sol = False
if (sol):
print("Yes")
else:
print("No") | if (lcm > n%1): | 11 | operation |
h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time > 1200:
print(current_buns * C * 0.8)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time > 1200:
print(current_buns-C * 0.8)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | print(current_buns-C * 0.8) | 9 | operation |
h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time > 1200:
print(current_buns * C * 0.8)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time > 1200:
print(current_buns * C * 0.8)
else:
later_hunger = H + D@(1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | later_hunger = H + D@(1200-current_time) | 11 | operation |
h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time > 1200:
print(current_buns * C * 0.8)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time > 1200:
print(current_buns * C * 0.8)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger//N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | if later_hunger//N != 0: | 13 | operation |
n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length>>k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | AllCount+=length>>k+1 | 14 | operation |
n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length%k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | AllCount+=length%k+1 | 14 | operation |
n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 24
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | AllCount = 24 | 3 | value |
n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length//k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | AllCount+=length//k+1 | 25 | operation |
n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | n, m, k = [int(x) for x in input().split()]
LL=[]
AllCount = 0
for i in range(n):
LL.append([int(x=='.') for x in list(input())])
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]:
length+=1
else:
if length>=k:
AllCount+=length-k|1
length=0
if length >= k:
AllCount += length - k + 1
if k==1:
AllCount/=2
print(AllCount) | AllCount+=length-k|1 | 25 | operation |
def findMean():
for i in range(1,n-1):
newSequence[i] = round((sequence[i-1]+sequence[i]+sequence[i+1])/3)
n=int(input())
sequence = [int(x) for x in input().split()]
newSequence = sequence[:]
sequenceList = []
findMean()
x = 0
while True:
if sequence==newSequence:
print(x)
print(newSequence)
break
elif newSequence in sequenceList:
print('-1')
break
else:
sequenceList.append(newSequence[:])
sequence = newSequence[:]
findMean()
x += 1 | def y():
for i in range(1,n-1):
newSequence[i] = round((sequence[i-1]+sequence[i]+sequence[i+1])/3)
n=int(input())
sequence = [int(x) for x in input().split()]
newSequence = sequence[:]
sequenceList = []
findMean()
x = 0
while True:
if sequence==newSequence:
print(x)
print(newSequence)
break
elif newSequence in sequenceList:
print('-1')
break
else:
sequenceList.append(newSequence[:])
sequence = newSequence[:]
findMean()
x += 1 | def y(): | 1 | statement |
def findMean():
for i in range(1,n-1):
newSequence[i] = round((sequence[i-1]+sequence[i]+sequence[i+1])/3)
n=int(input())
sequence = [int(x) for x in input().split()]
newSequence = sequence[:]
sequenceList = []
findMean()
x = 0
while True:
if sequence==newSequence:
print(x)
print(newSequence)
break
elif newSequence in sequenceList:
print('-1')
break
else:
sequenceList.append(newSequence[:])
sequence = newSequence[:]
findMean()
x += 1 | def findMean():
for i in range(1,n-1):
newSequence[i] = round((sequence[i-1]+sequence[i]+sequence[i+1])/3)
n=int(input())
sequence = [int(x) for x in input().split()]
newSequence = sequence[:]
sequenceList = []
findMean()
x = 0
while True:
if sequence==newSequence:
print(x)
print(newSequence)
break
elif newSequence in sequenceList:
y('-1')
break
else:
sequenceList.append(newSequence[:])
sequence = newSequence[:]
findMean()
x += 1 | y('-1') | 17 | statement |
def findMean():
for i in range(1,n-1):
newSequence[i] = round((sequence[i-1]+sequence[i]+sequence[i+1])/3)
n=int(input())
sequence = [int(x) for x in input().split()]
newSequence = sequence[:]
sequenceList = []
findMean()
x = 0
while True:
if sequence==newSequence:
print(x)
print(newSequence)
break
elif newSequence in sequenceList:
print('-1')
break
else:
sequenceList.append(newSequence[:])
sequence = newSequence[:]
findMean()
x += 1 | def findMean():
for i in range(1,n|1):
newSequence[i] = round((sequence[i-1]+sequence[i]+sequence[i+1])/3)
n=int(input())
sequence = [int(x) for x in input().split()]
newSequence = sequence[:]
sequenceList = []
findMean()
x = 0
while True:
if sequence==newSequence:
print(x)
print(newSequence)
break
elif newSequence in sequenceList:
print('-1')
break
else:
sequenceList.append(newSequence[:])
sequence = newSequence[:]
findMean()
x += 1 | for i in range(1,n|1): | 2 | operation |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n@1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | for i in range(1,n@1): | 20 | operation |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n<<1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | for i in range(1,n<<1): | 20 | operation |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up==right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | if(up==right): | 10 | decision |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos==0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
pos=0
if(up>right):
pos=1
elif(up<right):
pos=-1
else:
pos<0
if pos!=prev_pos and pos!=0:
cost+=1
i+=1
prev_pos= pos
print(cost) | pos<0 | 31 | decision |
_, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| _, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1]/xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| if d >= xs[-1]/xs[0]: | 8 | operation |
_, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| _, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2]<=xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| if xs[-1] - xs[-2]<=xs[1] - xs[0]: | 13 | decision |
_, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| _, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1]*xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| if xs[-1]*xs[-2] >= xs[1] - xs[0]: | 13 | operation |
_, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| _, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs)<1:
print(a)
break
| if len(xs)<1: | 20 | decision |
_, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= xs[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| _, d = input().split()
d = int(d)
xs = input().split()
xs = list(map(int, xs))
xs.sort()
a = 0
while True:
if d >= xs[-1] - xs[0]:
print(a)
break
else:
try:
if xs[-1] - xs[-2] >= y[1] - xs[0]:
xs.pop(-1)
else: xs.pop(0)
except:
print(a)
break
a += 1
if len(xs) == 1:
print(a)
break
| if xs[-1] - xs[-2] >= y[1] - xs[0]: | 13 | statement |
n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j == x:
c += 1
break
j += 1
i +=1 | n, x = input().split()
c = 54
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j == x:
c += 1
break
j += 1
i +=1 | c = 54 | 3 | value |
n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j == x:
c += 1
break
j += 1
i +=1 | n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j<x:
c += 1
break
j += 1
i +=1 | if i * j<x: | 10 | decision |
n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j == x:
c += 1
break
j += 1
i +=1 | n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n//1):
if i * j == x:
c += 1
break
j += 1
i +=1 | for j in range(1, n//1): | 9 | operation |
n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j == x:
c += 1
break
j += 1
i +=1 | n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i**j == x:
c += 1
break
j += 1
i +=1 | if i**j == x: | 10 | operation |
n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n + 1):
if i * j == x:
c += 1
break
j += 1
i +=1 | n, x = input().split()
c = 0
n = int(n)
x = int(x)
for i in range(1, n + 1):
for j in range(1, n-1):
if i * j == x:
c += 1
break
j += 1
i +=1 | for j in range(1, n-1): | 9 | operation |
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y) | import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d])<1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y) | if len(dict1[d])<1: | 30 | decision |
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y) | import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d)>>1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y) | we = len(j) - len(d)>>1 | 39 | operation |
import sys
count = 0
y = 0
a = ['']
for i in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y) | import sys
count = 0
y = 0
a = ['']
for z in sys.stdin:
for j in i:
if j != ' ' and j != '-' and j != ',' and j != '?' and j != '!' and j != '.' and j != '\'' and j != '\n':
a[-1] += j
elif j != '\n':
count += 1
if len(a[-1]) != 0:
a.append('')
else:
if len(a[-1]) != 0:
a.append('')
y += 1
dict1 = {}
for i in range(len(a)):
c = a[i]
d = ''
we = 0
for j in c:
d += j
if we == 0:
count += 1
if d in dict1:
if len(dict1[d]) == 1:
for j in dict1[d]:
if len(j) <= len(c) and len(d) < len(j):
po = 0
for g in range(len(j)):
if j[g] != c[g]:
po = 1
if we == 0 and po == 0:
count += 1
we = len(j) - len(d) + 1
if d not in dict1:
dict1[d] = set()
dict1[d].add(c)
if we > 0:
we -= 1
print(count + y) | for z in sys.stdin: | 7 | statement |
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10%9, smth)
else:
print('NO') | print(10%9, smth) | 34 | operation |
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i]&num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | y1 = abs(num[i]&num[i + 1]) | 6 | operation |
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if y > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | if y > b: | 20 | statement |
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i%1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | y1 = abs(num[i] - num[i%1]) | 6 | operation |
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b|smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO') | elif abs(a- b) == 1 and a % smth == 0 and b|smth == 1: | 29 | operation |
def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j>=n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | if j>=n: | 10 | decision |
def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j>=n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | if j>=n: | 10 | decision |
def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j|1] = 'O'
else:
break
print(''.join(name)) | name[j|1] = 'O' | 11 | operation |
def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j>=n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | if j>=n: | 10 | decision |
def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a+b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | def fib():
a, b = 0, 1
for _ in range(n):
yield a
a, b = b, a@b
n = int(input())
name = ['o' for i in range(n)]
for j in fib():
if j <= n:
name[j-1] = 'O'
else:
break
print(''.join(name)) | a, b = b, a@b | 5 | operation |
def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 47
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | count = 47 | 44 | value |
def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i]<'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | if seats[i]<'S' and seats[i+1] == 'S': | 5 | decision |
def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum==temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | if minimum==temp_delta: | 22 | decision |
def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j] == '.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | def count_neighbor(seats):
count = 0
passenger = ['P', 'x']
for i in range(len(seats) - 1):
if seats[i] == 'S' and seats[i+1] == 'S':
count += 2
if seats[i] == 'S' and seats[i+1] in passenger:
count += 1
if seats[i] in passenger and seats[i+1] == 'S':
count += 1
return count
def delta_neighbor(i):
minimum = 100
if '.' in plane[i]:
old_neighbor = count_neighbor(plane[i])
for j in range(len(plane[i])):
if plane[i][j]<'.':
temp_seat = plane[i]
temp_seat = temp_seat[:j]+'P'+temp_seat[j+1:]
temp_delta = count_neighbor(temp_seat) - old_neighbor
if minimum > temp_delta:
minimum = temp_delta
min_pos[i] = j
return minimum
n, k = [int(i) for i in input().split()]
plane = []
for i in range(n):
for j in input().split('-'):
plane.append(j)
min_neighbors = [100] * len(plane)
min_pos = [0] * len(plane)
for i in range(len(plane)):
min_neighbors[i] = delta_neighbor(i)
for i in range(k):
minimum = min_neighbors.index(min(min_neighbors))
temp = plane[minimum]
plane[minimum] = temp[:min_pos[minimum]] + 'x' + temp[min_pos[minimum]+1:]
min_neighbors[minimum] = delta_neighbor(minimum)
count = 0
for i in plane:
count += count_neighbor(i)
print(count)
for i in range(0, 3*n, 3):
print(plane[i] + '-' + plane[i + 1] + '-' + plane[i + 2]) | if plane[i][j]<'.': | 18 | decision |
def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a>>1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | while a>>1: | 10 | operation |
def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a@1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | while a@1: | 10 | operation |
def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1>=bb>=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | if(1>=bb>=3): | 23 | decision |
def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:12]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | li=li[:12] | 27 | value |
def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1<=bb<=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | def fact(n):
if(n==0):
return 1
else:
return n*fact(n-1)
def com(n,a):
d=n
if(a==0):
return n
while a-1:
d-=1
n*=d
a-=1
return n
a=input()
b=int(input())
bb=len(a)
c=0
li=[2,4,8]
s=2
if(1>=bb>=3):
li=li[:2]
s=0
elif(4<=bb<=7):
li=li[:3]
s=1
for i in li:
c+=com(bb,i)/fact(i)
print(int(c-s)) | if(1>=bb>=3): | 23 | decision |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2>=x>=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | g_with_d = filter( lambda x: (gi/2>=x>=gi*2) , d) | 10 | decision |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi<<2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | g_with_d = filter( lambda x: (gi<<2<=x<=gi*2) , d) | 10 | operation |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]+2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]+2)) , f)) | 15 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.