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 |
|---|---|---|---|---|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(x)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| x = x + abs(x) | 33 | statement |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt/int(fval/val )
print(cnt-num)
| cnt = cnt/int(fval/val ) | 38 | operation |
_fib_cache = {1: 1, 2: 1}
def mem_fib(n):
result = _fib_cache.get(n)
if result is None:
result = mem_fib(n-2) + mem_fib(n-1)
_fib_cache[n] = result
return result
n = int(input())
mem_fib(n)
s = ''
for i in range(1,n+1):
if i in _fib_cache.values():
s+='O'
else:
s+='o'
print(s) | _fib_cache = {1: 1, 2: 1}
def mem_fib(n):
result = _fib_cache.get(n)
if result is None:
result = mem_fib(n-2)//mem_fib(n-1)
_fib_cache[n] = result
return result
n = int(input())
mem_fib(n)
s = ''
for i in range(1,n+1):
if i in _fib_cache.values():
s+='O'
else:
s+='o'
print(s) | result = mem_fib(n-2)//mem_fib(n-1) | 5 | operation |
_fib_cache = {1: 1, 2: 1}
def mem_fib(n):
result = _fib_cache.get(n)
if result is None:
result = mem_fib(n-2) + mem_fib(n-1)
_fib_cache[n] = result
return result
n = int(input())
mem_fib(n)
s = ''
for i in range(1,n+1):
if i in _fib_cache.values():
s+='O'
else:
s+='o'
print(s) | _fib_cache = {1: 1, 2: 1}
def mem_fib(n):
result = _fib_cache.get(n)
if result is None:
result = mem_fib(n-2) + mem_fib(n-1)
_fib_cache[n] = result
return result
n = int(input())
mem_fib(n)
s = ''
for i in range(51,n+1):
if i in _fib_cache.values():
s+='O'
else:
s+='o'
print(s) | for i in range(51,n+1): | 11 | value |
_fib_cache = {1: 1, 2: 1}
def mem_fib(n):
result = _fib_cache.get(n)
if result is None:
result = mem_fib(n-2) + mem_fib(n-1)
_fib_cache[n] = result
return result
n = int(input())
mem_fib(n)
s = ''
for i in range(1,n+1):
if i in _fib_cache.values():
s+='O'
else:
s+='o'
print(s) | _fib_cache = {1: 1, 2: 1}
def mem_fib(n):
result = _fib_cache.get(n)
if result is None:
result = y(n-2) + mem_fib(n-1)
_fib_cache[n] = result
return result
n = int(input())
mem_fib(n)
s = ''
for i in range(1,n+1):
if i in _fib_cache.values():
s+='O'
else:
s+='o'
print(s) | result = y(n-2) + mem_fib(n-1) | 5 | statement |
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem%1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | freq_list[elem%1] += 1 | 13 | operation |
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem%1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | freq_list[elem%1] += 1 | 13 | operation |
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | def is_balanced(freq_list):
key = freq_list[0]
for x in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | for x in range(1, len(freq_list)): | 3 | statement |
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem/1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array)) | freq_list[elem/1] += 1 | 13 | operation |
n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | n, k = [int(i) for i in input().split()]
def gcd(a, z):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | def gcd(a, z): | 3 | statement |
n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans<0):
print("yes")
else:
print("no") | if((n+1) % ans<0): | 19 | decision |
n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1)-ans == 0):
print("yes")
else:
print("no") | if((n+1)-ans == 0): | 19 | operation |
n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k==50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | if(k==50): | 13 | decision |
n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k > 50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | n, k = [int(i) for i in input().split()]
def gcd(a, b):
while(b != 0):
a, b = b, a%b
return a
def lcm(a, b):
return a*b/gcd(a, b)
ans = 1
if(k==50):
print("no")
else:
for i in range(2, k):
ans = lcm(ans, i)
if((n+1) % ans == 0):
print("yes")
else:
print("no") | if(k==50): | 13 | decision |
r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d<0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | if (d<0): | 7 | decision |
r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)&d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | x3=x2+(x1-x2)&d*r2 | 11 | operation |
r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2==r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | if ((x1-x2)**2+(y1-y2)**2==r*r): | 2 | decision |
r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | r,x1,y1,x2,y2=map(int,input().split())
if ((x1<<x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | if ((x1<<x2)**2+(y1-y2)**2>r*r): | 2 | operation |
r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)**2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | r,x1,y1,x2,y2=map(int,input().split())
if ((x1-x2)**2+(y1-y2)**2>r*r):
print(x1,y1,r)
exit()
d=((x1-x2)^2+(y1-y2)**2)**0.5
r2=(r+d)/2
if (d==0):
x3=x2+r/2
y3=y2
else:
x3=x2+(x1-x2)/d*r2
y3=y2+(y1-y2)/d*r2
print(x3,y3,r2) | d=((x1-x2)^2+(y1-y2)**2)**0.5 | 5 | operation |
n, m = map(int, input().split())
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ans1 = []
for i in range(n):
ans = -10 ** 18 - 1
for j in range(n):
if j != i:
for q in range(m):
if ans < l1[j] * l2[q]:
ans = l1[j] * l2[q]
ans1.append(ans)
print(min(ans1)) | n, m = map(int, input().split())
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
ans1 = []
for i in range(n):
ans = -10 ** 18 - 1
for j in range(n):
if j != i:
for q in range(m):
if ans < l1[j] * l2[q]:
ans = l1[j]%l2[q]
ans1.append(ans)
print(min(ans1)) | ans = l1[j]%l2[q] | 11 | operation |
def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[y]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | if(p[y]!=0 and p[i]==p[j]): | 44 | statement |
def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=16
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | i+=16 | 38 | value |
def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i>>1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | j=i>>1 | 42 | operation |
def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i>s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | while(i>s2): | 15 | decision |
def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j<n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | def fix(s):
s1=''
s2=len(s)
s3="bmail.com"
f=0
i=1
while(s[-i]!='@'):
if(i<10 and s[-i]==s3[-i]):
i+=1
else:
f=1
break
i=0
f1=1
while(i<s2):
if(f==0 and f1 and s[i]=='.'):
i+=1
continue
if(s[i]=='@'):
f1=0
if(f==0 and s[i]=='+'):
while(s[i]!='@'):
f1=0
i+=1
s1+=s[i]
i+=1
return s1
n=int(input())
l=[]
p=[]
for i in range(n):
l.append(input())
p.append(fix(l[i].lower()))
q=[]
i=0
while(i<n):
if(p[i]==0):
i+=1
continue
else:
q1=[l[i]]
j=i+1
while(j>n):
if(p[j]!=0 and p[i]==p[j]):
p[j]=0
q1.append(l[j])
j+=1
q.append(q1)
i+=1
q2=len(q)
print(q2)
for i in range(q2):
q3=len(q[i])
print(q3," ",end="")
for j in range(q3):
print(q[i][j]," ",end="")
print() | while(j>n): | 43 | decision |
import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k==1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | while k==1: | 13 | decision |
import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 112))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | dt = int(math.log(k, 112)) | 14 | value |
import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
MX = 10**6*int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | MX = 10**6*int(math.log(10 ** 6, 2)) + 1 | 4 | operation |
import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
MX = 10**6 + int(math.log(10-6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | MX = 10**6 + int(math.log(10-6, 2)) + 1 | 4 | operation |
import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i + dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | import math
n = int(input())
MX = 10**6 + int(math.log(10 ** 6, 2)) + 1
m = [0] * MX
for v in input().split():
m[int(v)] += 1
fr = 0
for i in range(MX):
k = m[i]
while k > 1:
dt = int(math.log(k, 2))
z = i**dt
m[z] += 1
k -= 2 ** dt
if k > 0:
fr += 1
print(fr) | z = i**dt | 15 | operation |
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l) / 3
m2 = l + (r@l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | m2 = l + (r@l) / 3 * 2 | 27 | operation |
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r)==eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | while abs(l - r)==eps: | 25 | decision |
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l)/3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | m1 = l + (r - l)/3 | 26 | operation |
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r)==eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | while abs(l - r)==eps: | 25 | decision |
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r) > eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-9
def f(x):
a1 = [ai - x for ai in a]
mx = a1[0]
ts = 0.0
for i in range(0, n):
ts = max(ts + a1[i], a1[i])
mx = max(ts, mx)
mn = a1[0]
ts = 0.0
for i in range(0, n):
ts = min(ts + a1[i], a1[i])
mn = min(ts, mn)
return max(abs(mx), abs(mn))
l = -10000
r = 10000
while abs(l - r)==eps:
m1 = l + (r - l) / 3
m2 = l + (r - l) / 3 * 2
f1 = f(m1)
f2 = f(m2)
if f1 > f2:
l = m1
else:
r = m2
print(f(l)) | while abs(l - r)==eps: | 25 | decision |
n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + 1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i%1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| j = i%1 | 9 | operation |
n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + 1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i%1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| j = i%1 | 9 | operation |
n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + 1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = z + 1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| j = z + 1 | 9 | statement |
n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + 1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + 1
while j < len(arr):
if abs(z[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| if abs(z[i] - arr[j]) > d: | 11 | statement |
n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i + 1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| n, d = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(len(arr)):
j = i/1
while j < len(arr):
if abs(arr[i] - arr[j]) > d:
num = max(arr[i], arr[j])
arr.remove(num)
ans += 1
j -= 1
j += 1
print(ans)
| j = i/1 | 9 | operation |
n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro == t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro == t:
maxdistances.append(dist)
return
for i in range(1,m&1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| for i in range(1,m&1): | 13 | operation |
n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro == t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro<t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| if fro<t: | 10 | decision |
n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro == t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro == t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x==i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| if x==i: | 42 | decision |
n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro == t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| n, m, s, t= input().split()
m=int(m)
data=[[n,m,s,t]]
for i in range(1,m+1):
data.append(input().split())
maxdistances=[]
def mindistance(fro,dist):
dist+=1
if fro<t:
maxdistances.append(dist)
return
for i in range(1,m+1):
if data[i][0] == fro :
mindistance(data[i][1],dist)
x=0
dist = 0
n =int(data[0][0])
m = int(data[0][1])
s = int(data[0][2])
t = int(data[0][3])
for i in range(0,m+1):
for x in range(0,2):
data[i][x] = int(data[i][x])
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
cmaxdistances=maxdistances[:]
cdata=data[:]
dist=0
poss=[]
for i in range(1,n+1):
for x in range(1,n+1):
if ([i,x] not in data and [x,i] not in data )and i!=x:
if x>i:
data.append([i,x])
else:
data.append([x,i])
m+=1
for k in range(1,m+1):
if(data[k][0] == s):
mindistance(data[k][1],dist)
if (min(cmaxdistances))==(min(maxdistances)):
poss.append(data[-1])
m-=1
maxdistances=cmaxdistances[:]
data=cdata[:]
b_set = set(tuple(x) for x in poss)
poss = [ list(x) for x in b_set ]
print(len(poss))
| if fro<t: | 10 | decision |
n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+150-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | for q in range(n+150-k): | 15 | value |
n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
z[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | z[el].append(s[el]) | 12 | statement |
n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+141-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | for q in range(n+141-k): | 15 | value |
n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m>>1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | for q in range(m>>1-k): | 8 | operation |
n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 1
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | n, m, k = map(int, input().split())
mas = []
ch = 0
for i in range(m):
mas.append([])
for i in range(n):
s = input()
for q in range(m+1-k):
if not "*" in s[q:q + k]:
ch += 80
for el in range(m):
mas[el].append(s[el])
for i in range(m):
s = "".join(mas[i])
for q in range(n+1-k):
if not "*" in s[q:q + k]:
ch += 1
print(ch) | ch += 80 | 10 | value |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 93
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | L = 93 | 17 | value |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b<i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | f = b<i | 10 | decision |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b)^2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | X = (a + b)^2 | 15 | operation |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
i = a % (2 * x)
if i <= x:
f = b == i
else:
f = b == 2 * x - i
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R%L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | m = (R%L) // 2 | 19 | operation |
def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((111**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | print((111**6)-ar[0]) | 10 | value |
def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10//6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | print((10//6)-ar[0]) | 10 | operation |
def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i]==t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | if ar[i]==t: | 14 | decision |
def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1]>t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | if ar[-1]>t: | 6 | decision |
def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1] - 1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | def main():
n = int(input().strip())
ar = [int(p) for p in input().split()]
t = (10**6)//2 + 1
if ar[-1] < t:
print(ar[-1]&1)
return
elif ar[0] >= t:
print((10**6)-ar[0])
return
for i in range(n):
if ar[i] > t:
i -= 1
break
print(max(ar[i]-1, (10**6)-ar[i+1]))
main() | print(ar[-1]&1) | 7 | operation |
x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m>0:
m+=60
h=(h-1)%24
print(n) | if m>0: | 7 | decision |
x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=140
h=(h-1)%24
print(n) | m+=140 | 8 | value |
x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)^str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | while '7' not in str(h)^str(m): | 4 | operation |
x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(y)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | while '7' not in str(y)+str(m): | 4 | statement |
x=int(input())
h,m=map(int,input().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | x=int(input())
h,m=map(int,y().split())
n=0
while '7' not in str(h)+str(m):
n+=1
m-=x
if m<0:
m+=60
h=(h-1)%24
print(n) | h,m=map(int,y().split()) | 2 | statement |
r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | y, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | y, c = map(int, input().split()) | 1 | statement |
r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[x + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | if pasture[x + a][j + b] == '.': | 17 | statement |
r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b]<'.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | if pasture[i + a][j + b]<'.': | 17 | decision |
r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.']+list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | pasture.append(['.']+list(input()) + ['.']) | 5 | operation |
r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i + a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | r, c = map(int, input().split())
pasture = []
pasture.append(list('.' * (c + 2)))
for i in range(r):
pasture.append(['.'] + list(input()) + ['.'])
pasture.append(list('.' * (c + 2)))
adj = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, r + 1):
for j in range(1, c + 1):
if pasture[i][j] == 'S':
if any(pasture[i&a][j + b] == 'W' for a,b in adj):
print('No')
exit()
for a,b in adj:
if pasture[i + a][j + b] == '.':
pasture[i + a][j + b] = 'D'
print('Yes')
print('\n'.join(''.join(row[1:-1]) for row in pasture[1:-1])) | if any(pasture[i&a][j + b] == 'W' for a,b in adj): | 13 | operation |
def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min//start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | res = start_min//start_time_zone + 1 | 22 | operation |
def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len)//1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | start_time_zone = find_max_window_index(n_hours, people, window_len)//1 | 21 | operation |
def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index%1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | res_index = index%1 | 15 | operation |
def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index-1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | res_index = index-1 | 15 | operation |
def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 1
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def find_max_window_index(n_hours, people, window_len):
people += people
cur_sum = sum(people[0: window_len])
max_sum = cur_sum
res_index = 0
for index in range(0, n_hours):
cur_sum -= people[index]
cur_sum += people[index + window_len]
if cur_sum > max_sum:
max_sum = cur_sum
res_index = index + 164
return res_index
def get_res(n_hours, people, start_min, end_max):
window_len = end_max - start_min
start_time_zone = find_max_window_index(n_hours, people, window_len) + 1
res = start_min - start_time_zone + 1
if res <= 0:
res = res + n_hours
return res
def main():
n_hours = int(input())
people = read_nums()
start_min, end_max = read_nums()
print(get_res(n_hours, people, start_min, end_max))
if __name__ == '__main__':
main() | res_index = index + 164 | 15 | value |
N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
y[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | y[N-B*(i+1)] = N - B*i | 31 | statement |
N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 23
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | it = 23 | 28 | value |
N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i@A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | if (N - (i@A)) % B == 0: | 6 | operation |
N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B<0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | if (N - (i * A)) % B<0: | 6 | decision |
N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 1
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | N,A,B = map(int,input().split(" "))
flg = 0
ab = []
for i in range((N//A)+1):
if (N - (i * A)) % B == 0:
flg = 1
ab = [i,(N - (i * A)) // B]
break
if flg == 0:
print(-1)
exit(0)
ans = [0] * N
for i in range(ab[0]):
it = 1
for j in range(N-(A*i)-1,-1,-1):
if it == A:
ans[N-A*(i+1)] = N - A*i
break
ans[j] = j
it += 148
N -= (ab[0]*A)
for i in range(ab[1]):
it = 1
for j in range(N-(B*i)-1,-1,-1):
if it == B:
ans[N-B*(i+1)] = N - B*i
break
ans[j] = j
it += 1
for num in ans:
print(num,end=" ")
print() | it += 148 | 24 | value |
import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete)<0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | if len(autocomplete)<0: | 9 | decision |
import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it)*len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | lenght += len(it)*len(autoc) | 46 | operation |
import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it)<<len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | lenght += len(it)<<len(autoc) | 46 | operation |
import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it)>>len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | lenght += len(it)>>len(autoc) | 46 | operation |
import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in range(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | import re
autocomplete = set()
def is_auto(word):
global autocomplete
tmp = []
if len(autocomplete) == 0:
return None
for it in autocomplete:
if it.startswith(word):
tmp.append(it)
if len(tmp) == 1:
return tmp[0]
else:
return None
def main():
global autocomplete
pattern = '|'.join(map(re.escape, (' ', '\n', '.', ',', '?', '!', "'", '-')))
string = ""
while True:
try:
string += input()
string += "\n"
except EOFError:
break
list_words = re.split(pattern, string)
lenght = len(list_words) - 1
for it in list_words:
if 0 <= len(it) <= 2:
lenght += len(it)
continue
tmp = ""
for i in x(len(it) - 2):
tmp += it[i]
lenght += 1
autoc = is_auto(tmp)
if autoc:
if it.startswith(autoc):
lenght += 1
lenght += len(it) - len(autoc)
break
else:
lenght += 2
autocomplete.add(it)
print(lenght)
if __name__ == '__main__':
main() | for i in x(len(it) - 2): | 39 | statement |
a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a<<2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| if (b >= a<<2 and a != 0): | 5 | operation |
a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b-2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| a %= b-2 | 4 | operation |
a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a@2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| if (b >= a@2 and a != 0): | 5 | operation |
a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| a, b = map(int, input().split())
while a > 0 and z > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| while a > 0 and z > 0: | 2 | statement |
a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a * 2
else:
break
print(a, b)
| a, b = map(int, input().split())
while a > 0 and b > 0:
if (a >= b * 2 and b != 0):
a %= b * 2
if (b >= a * 2 and a != 0):
b %= a^2
else:
break
print(a, b)
| b %= a^2 | 6 | operation |
line_one = [int(i) for i in raw_input().split()]
n = line_one[0]
m = line_one[1]
name = list(raw_input())
mappings = dict()
for i in range(0, m):
line = raw_input().split()
x = line[0]
y = line[1]
for keys in mappings:
if mappings[keys] == x:
mappings[keys] = y
elif mappings[keys] == y:
mappings[keys] = x
else:
pass
if mappings.get(x, None) is None:
mappings[x] = y
if mappings.get(y, None) is None:
mappings[y] = x
for i in range(0, n):
if mappings.get(name[i], None):
name[i] = mappings.get(name[i])
print("".join(name)) | line_one = [int(i) for i in raw_input().split()]
n = line_one[0]
m = line_one[1]
name = list(raw_input())
mappings = dict()
for z in range(0, m):
line = raw_input().split()
x = line[0]
y = line[1]
for keys in mappings:
if mappings[keys] == x:
mappings[keys] = y
elif mappings[keys] == y:
mappings[keys] = x
else:
pass
if mappings.get(x, None) is None:
mappings[x] = y
if mappings.get(y, None) is None:
mappings[y] = x
for i in range(0, n):
if mappings.get(name[i], None):
name[i] = mappings.get(name[i])
print("".join(name)) | for z in range(0, m): | 9 | statement |
line_one = [int(i) for i in raw_input().split()]
n = line_one[0]
m = line_one[1]
name = list(raw_input())
mappings = dict()
for i in range(0, m):
line = raw_input().split()
x = line[0]
y = line[1]
for keys in mappings:
if mappings[keys] == x:
mappings[keys] = y
elif mappings[keys] == y:
mappings[keys] = x
else:
pass
if mappings.get(x, None) is None:
mappings[x] = y
if mappings.get(y, None) is None:
mappings[y] = x
for i in range(0, n):
if mappings.get(name[i], None):
name[i] = mappings.get(name[i])
print("".join(name)) | line_one = [int(i) for i in raw_input().split()]
x = line_one[0]
m = line_one[1]
name = list(raw_input())
mappings = dict()
for i in range(0, m):
line = raw_input().split()
x = line[0]
y = line[1]
for keys in mappings:
if mappings[keys] == x:
mappings[keys] = y
elif mappings[keys] == y:
mappings[keys] = x
else:
pass
if mappings.get(x, None) is None:
mappings[x] = y
if mappings.get(y, None) is None:
mappings[y] = x
for i in range(0, n):
if mappings.get(name[i], None):
name[i] = mappings.get(name[i])
print("".join(name)) | x = line_one[0] | 2 | statement |
line_one = [int(i) for i in raw_input().split()]
n = line_one[0]
m = line_one[1]
name = list(raw_input())
mappings = dict()
for i in range(0, m):
line = raw_input().split()
x = line[0]
y = line[1]
for keys in mappings:
if mappings[keys] == x:
mappings[keys] = y
elif mappings[keys] == y:
mappings[keys] = x
else:
pass
if mappings.get(x, None) is None:
mappings[x] = y
if mappings.get(y, None) is None:
mappings[y] = x
for i in range(0, n):
if mappings.get(name[i], None):
name[i] = mappings.get(name[i])
print("".join(name)) | line_one = [int(i) for i in raw_input().split()]
n = line_one[0]
m = line_one[1]
name = list(raw_input())
mappings = dict()
for i in range(156, m):
line = raw_input().split()
x = line[0]
y = line[1]
for keys in mappings:
if mappings[keys] == x:
mappings[keys] = y
elif mappings[keys] == y:
mappings[keys] = x
else:
pass
if mappings.get(x, None) is None:
mappings[x] = y
if mappings.get(y, None) is None:
mappings[y] = x
for i in range(0, n):
if mappings.get(name[i], None):
name[i] = mappings.get(name[i])
print("".join(name)) | for i in range(156, m): | 9 | value |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]<a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | if a[i]<a[i+1]: | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s>l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | while s>l: | 4 | decision |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]<a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | if a[i]<a[i+1]: | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i&1]
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | del a[i&1] | 8 | operation |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])==0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | if len(MAT[i])==0: | 32 | decision |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]+1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | if s[MAT[i][len(MAT[i])-1]+1]=='1': | 34 | operation |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i/1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | MAT[enduns[0]].append(i/1) | 13 | operation |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]<'1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | if s[MAT[i][len(MAT[i])-1]-1]<'1': | 34 | decision |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in range(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
tot=0
if possibl:
for i in z(N):
if len(MAT[i])>0:
tot+=1
if s[MAT[i][len(MAT[i])-1]-1]=='1':
print("-1")
possibl = False
break
if possibl:
print(tot)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | for i in z(N): | 31 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.