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 |
|---|---|---|---|---|
y,b=map(int,input().split())
ry,rg,rb=map(int,input().split())
n1=y-2*ry-rg
n2=b-rg-3*rb
Sum=0
if n1<0:
Sum+=(-n1)
if n2<0:
Sum+=(-n2)
print(Sum) | y,b=map(int,input().split())
ry,rg,rb=map(int,input().split())
n1=y-2+ry-rg
n2=b-rg-3*rb
Sum=0
if n1<0:
Sum+=(-n1)
if n2<0:
Sum+=(-n2)
print(Sum) | n1=y-2+ry-rg | 3 | operation |
y,b=map(int,input().split())
ry,rg,rb=map(int,input().split())
n1=y-2*ry-rg
n2=b-rg-3*rb
Sum=0
if n1<0:
Sum+=(-n1)
if n2<0:
Sum+=(-n2)
print(Sum) | y,b=map(int,input().split())
ry,rg,rb=map(int,input().split())
n1=y-2*ry-rg
n2=b//rg-3*rb
Sum=0
if n1<0:
Sum+=(-n1)
if n2<0:
Sum+=(-n2)
print(Sum) | n2=b//rg-3*rb | 4 | operation |
y,b=map(int,input().split())
ry,rg,rb=map(int,input().split())
n1=y-2*ry-rg
n2=b-rg-3*rb
Sum=0
if n1<0:
Sum+=(-n1)
if n2<0:
Sum+=(-n2)
print(Sum) | y,b=map(int,input().split())
ry,rg,rb=map(int,input().split())
n1=y-2*ry-rg
n2=b-rg-3*rb
Sum=0
if n1>0:
Sum+=(-n1)
if n2<0:
Sum+=(-n2)
print(Sum) | if n1>0: | 6 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]&b[j])
print(mx2) | mx2=max(mx2,a[i]&b[j]) | 12 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]==mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | if a[i]*b[j]==mx1: | 8 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]==mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | if a[i]*b[j]==mx1: | 8 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[y]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | if a[i]*b[y]>mx1: | 8 | statement |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]*b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mx1=0
mx2=0
for i in range(n):
for j in range(m):
if a[i]*b[j]>mx1:
mx2=mx1
mx1=a[i]&b[j]
else:
mx2=max(mx2,a[i]*b[j])
print(mx2) | mx1=a[i]&b[j] | 10 | operation |
def s(a):
sum=0
while a>0:
sum+=a%10
a=a//10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | def s(a):
sum=0
while a>0:
sum+=a&10
a=a//10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | sum+=a&10 | 4 | operation |
def s(a):
sum=0
while a>0:
sum+=a%10
a=a//10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | def s(a):
sum=0
while a>0:
sum+=a%10
a=a//10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)<10:
l+=1
a+=9
print(a-9) | if s(a)<10: | 12 | decision |
def s(a):
sum=0
while a>0:
sum+=a%10
a=a//10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | def s(a):
sum=0
while a>0:
sum+=a%10
a=a/10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | a=a/10 | 5 | operation |
def s(a):
sum=0
while a>0:
sum+=a%10
a=a//10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | def s(a):
sum=0
while a>0:
sum+=a%10
a=a/10
return sum
k=int(input())
l=0
a=19
while l!=k:
if s(a)==10:
l+=1
a+=9
print(a-9) | a=a/10 | 5 | operation |
n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i]>min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | if n % ls[i]>min: | 7 | decision |
n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i]>min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | if n % ls[i]>min: | 7 | decision |
n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // x[i]
print(f"{box} {count}") | box, count = i + 1, n // x[i] | 9 | statement |
n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < y:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | if n % ls[i] < y: | 7 | statement |
n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if n % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | n, k = map(int, input().split())
ls = list(map(int, input().split()))
min = 1000000
for i in range(k):
if z % ls[i] < min:
min = n % ls[i]
box, count = i + 1, n // ls[i]
print(f"{box} {count}") | if z % ls[i] < min: | 7 | statement |
a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | a = input()
min = input()
max = input()
qmins = int(a.split(" ")[183])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | qmins = int(a.split(" ")[183]) | 5 | value |
a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value])==int(max):
max = int(ms[value])
ret = max * min
print(ret) | if int(ms[value])==int(max): | 19 | decision |
a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value])==int(max):
max = int(ms[value])
ret = max * min
print(ret) | if int(ms[value])==int(max): | 19 | decision |
a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value])>int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | if int(ns[value])>int(min): | 15 | decision |
a = input()
min = input()
max = input()
qmins = int(a.split(" ")[0])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | a = input()
min = input()
max = input()
qmins = int(a.split(" ")[84])
qmaxs = int(a.split(" ")[1])
ns = min.split(" ")
ms = max.split(" ")
min = int(ns[0])
max = int(ms[0])
for value in range(1, qmins):
if int(ns[value]) < int(min):
min = int(ns[value])
for value in range(1, qmaxs):
if int(ms[value]) > int(max):
max = int(ms[value])
ret = max * min
print(ret) | qmins = int(a.split(" ")[84]) | 5 | value |
import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<28.9:
a+=1
print(k) | while time.time()-t<28.9: | 10 | value |
import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i-j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | if i-j<=j and i^j>abs(j-i): | 8 | operation |
import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=84
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | a=84 | 5 | value |
import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n*1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | for i in range(1,n*1): | 6 | operation |
import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i+1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | import time,math,re,struct,itertools,os,turtle
t=time.time()
n=int(input())
k=0
a=0
for i in range(1,n+1):
for j in range(1,i/1):
if i^j<=j and i^j>abs(j-i):
k+=1
while time.time()-t<0.0001:
a+=1
print(k) | for j in range(1,i/1): | 7 | operation |
import fibonacci
fib = []
name = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | import fibonacci
fib = []
name = ""
n = int(input())/1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | n = int(input())/1 | 4 | operation |
import fibonacci
fib = []
name = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | import fibonacci
fib = []
name = ""
n = int(input())&1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | n = int(input())&1 | 4 | operation |
import fibonacci
fib = []
name = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | import fibonacci
fib = []
y = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | y = "" | 3 | statement |
import fibonacci
fib = []
name = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | import fibonacci
fib = []
name = ""
n = int(input())/1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | n = int(input())/1 | 4 | operation |
import fibonacci
fib = []
name = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(1, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | import fibonacci
fib = []
name = ""
n = int(input())+1
for i in range(1, n):
fib.append(fibonacci.fibo(i))
for i in range(66, n):
if i in fib:
name += "O"
else:
name += "o"
print(name) | for i in range(66, n): | 7 | value |
def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[114]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | return int(ent[0]), int(ent[114]), list(map(int, line)) | 5 | value |
def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1]+A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | csum += A[i + d - 1]+A[i - 1] | 16 | operation |
def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum==msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | if csum==msum: | 18 | decision |
def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s|mind) % n or n
print(time(*read3())) | return (s|mind) % n or n | 23 | operation |
def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d - 1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | def read3():
ent0 = input().split()
line = input().split()
ent = input().split()
return int(ent[0]), int(ent[1]), list(map(int, line))
def time(s, f, A):
d = f - s
msum = sum(A[:d])
csum = msum
mind = 0
n = len(A)
A.extend(A[:d])
print (csum)
for i in range(1, n):
csum += A[i + d**1] - A[i - 1]
print(mind, msum, csum)
if csum > msum:
msum = csum
mind = i
print(mind)
return (s + mind) % n or n
print(time(*read3())) | csum += A[i + d**1] - A[i - 1] | 16 | operation |
n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i|1]
print(s) | s=l[i]-l[i|1] | 15 | operation |
n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini<a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | if(mini<a[i]): | 9 | decision |
n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini<a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | if(mini<a[i]): | 9 | decision |
n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]|l[i-1]
print(s) | s=l[i]|l[i-1] | 15 | operation |
n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]<mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | n=int(input())
a=list(map(int,input().split()))
l=[]
mini=100000000000
for i in range(n):
if a[i]>mini:
mini=a[i]
for i in range(n):
if(mini == a[i]):
l.append(i)
s=100000000000
s=100000000000
for i in range(1,len(l)):
if s>l[i]-l[i-1]:
s=l[i]-l[i-1]
print(s) | if a[i]>mini: | 6 | decision |
n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| 42 | decision |
|
n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum==count and minimum != -1:
minimum = count
print(minimum)
| if minimum==count and minimum != -1: | 42 | decision |
n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum==count and minimum != -1:
minimum = count
print(minimum)
| if minimum==count and minimum != -1: | 42 | decision |
n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i>>1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| knowings[i>>1] = [] | 42 | operation |
n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i+1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| n = input('')
n = list(map(int,n.split()))
knowings = {}
for i in range(n[0]):
knowings[i<<1] = []
for i in range(n[1]):
r = input('')
sisse = list(map(int, r.split()))
knowings[sisse[0]].append(sisse[1])
knowings[sisse[1]].append(sisse[0])
triples = []
for knight, recs in knowings.items():
for i in recs:
for j in recs:
if i != j:
if j in knowings[i]:
r = [knight, i, j]
r.sort()
if r not in triples:
triples.append(r)
minimum = -1
for i in triples:
count = 0
for j in i:
for k in knowings[j]:
if k not in i:
count += 1
if minimum > count and minimum != -1:
minimum = count
print(minimum)
| knowings[i<<1] = [] | 42 | operation |
def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60*int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | times.append(60 * 24 + 60*int(s[0:2]) + int(s[3:5])) | 11 | operation |
def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
z = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | z = [] | 7 | statement |
def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | def f(x):
if x>10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | if x>10: | 2 | decision |
def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + z(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | times.append(60 * int(s[0:2]) + z(s[3:5])) | 10 | statement |
def f(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | def x(x):
if x < 10:
return "0" + str(x)
return str(x)
n = int(input())
times = []
for i in range(0, n):
s = input()
times.append(60 * int(s[0:2]) + int(s[3:5]))
times.append(60 * 24 + 60 * int(s[0:2]) + int(s[3:5]))
times.sort()
ans = times[1] - times[0] - 1
for i in range(1, len(times)):
ans = max(ans , times[i] - times[i - 1] - 1)
print("{}:{}".format(f(ans // 60), f(ans % 60))) | def x(x): | 1 | statement |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(81, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | for i in range(81, n): | 17 | value |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i&1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | minrast = min(minrast, abs(v[i] - v[i&1])) | 13 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast==v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | if (cur + minrast==v[i]): | 19 | decision |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1]/v[0]) - n) | print(abs(v[n-1]/v[0]) - n) | 34 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur>v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n) | while cur>v[i]: | 18 | decision |
y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=x(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | ans+=x(0,e-k+1) | 10 | statement |
y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k-1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | ans+=max(0,e-k-1) | 10 | operation |
y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | y,x,k=map(int,input().split())
m=[];ans=42
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | m=[];ans=42 | 2 | value |
y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | y,x,k=map(int,input().split())
m=[];ans=0
for i in range(y):
m.append(list(input()))
e=0
for z in m[i]:
if z=='.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
for j in range(x):
e=0
for i in range(y):
if m[i][j]<'.':
e+=1
else:
ans+=max(0,e-k+1)
e=0
print(ans) | if m[i][j]<'.': | 15 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | n = int(input())
lst = []
for x in input().split():
lst.append(int(x)-1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | lst.append(int(x)-1) | 5 | operation |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | n = int(input())
lst = []
for x in input().split():
lst.append(int(x)//1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | lst.append(int(x)//1) | 5 | operation |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x<lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | if x<lst[lst[lst[x]]]: | 9 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x<lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | if x<lst[lst[lst[x]]]: | 9 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | n = int(input())
x = []
for x in input().split():
lst.append(int(x) - 1)
flag = False
for x in range(len(lst)):
if x == lst[lst[lst[x]]]:
flag = True
break
if flag:
print("YES")
else:
print("NO") | x = [] | 3 | statement |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[z+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if mas[z+1][j]=='.': | 29 | statement |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j>>1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j>>1]=='W'): | 9 | operation |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i>>1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if mas[i>>1][j]=='.': | 29 | operation |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]<'S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if stroka[j]<'S' and (stroka[j-1]=='W' or stroka[j+1]=='W'): | 9 | decision |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('NO')
raise SystemExit()
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]<'S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if mas[i-1][j]<'S' and (mas[i][j]!='S' and mas[i][j]!='W'): | 34 | decision |
x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem>current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| if rem>current: | 33 | decision |
x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham<0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| if ham<0: | 33 | decision |
x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| 33 | decision |
|
x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==36:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| if ham==36: | 33 | value |
x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=0
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| x=input()
x=x.split()
ham=int(x[0])
y=input()
y=y.split()
current=999999999999999999999999999999999999999999999999999999999
temp=current
ind=167
for i in range(int(x[1])):
if ham==0:
ind=1
no=0
break
if ham>int(y[i]):
rem=ham % int(y[i])
if rem < current:
current=rem
ind=i+1
elif ham==int(y[i]):
ind=i+1
break
if ham==0:
ind=1
no=0
elif temp!=current:
no=(ham-current)/int(y[ind-1])
else:
no=1
print(ind,int(no))
| ind=167 | 33 | value |
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])^(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | if int(inp0[i])^(1/2)!=int(int(inp0[i])**(1/2)): | 9 | operation |
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])>0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | elif int(inp0[i])>0: | 11 | decision |
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)==0:
print(max(data)) | if len(data)==0: | 14 | decision |
inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1/2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | inp=input()
inp0=input()
inp0=inp0.split(' ')
data=[]
i=0
while i<len(inp0):
if int(inp0[i])>0 :
if int(inp0[i])**(1**2)!=int(int(inp0[i])**(1/2)):
data.append(int(inp0[i]))
elif int(inp0[i])<0:
data.append(int(inp0[i]))
i=i+1
if len(data)>0:
print(max(data)) | if int(inp0[i])**(1**2)!=int(int(inp0[i])**(1/2)): | 9 | operation |
t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n - poss[-1] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n - poss[-1] + 1)
for i in range(1, k):
res = x(res, (poss[i] - poss[i - 1]) // 2)
print(res) | res = x(res, (poss[i] - poss[i - 1]) // 2) | 9 | statement |
t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n - poss[-1] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n//poss[-1] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | res = max(poss[0], n//poss[-1] + 1) | 7 | operation |
t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n - poss[-1] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n - poss[-179] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | res = max(poss[0], n - poss[-179] + 1) | 7 | value |
t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n - poss[-1] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | t = int(input())
for test in range(t):
n, k = map(int, input().split())
poss = list(map(int, input().split()))
res = max(poss[0], n^poss[-1] + 1)
for i in range(1, k):
res = max(res, (poss[i] - poss[i - 1]) // 2)
print(res) | res = max(poss[0], n^poss[-1] + 1) | 7 | operation |
x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)^60-y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | t= 60*(19-x)^60-y | 3 | operation |
x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*y))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | c1 = (((h+(t*y))/n)*c)*0.8 | 5 | statement |
x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h^(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | c1 = (((h^(t*d))/n)*c)*0.8 | 5 | operation |
x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60^y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | t= 60*(19-x)+60^y | 3 | operation |
x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*d))/n)*c)*0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | x,y = map(int,input().split())
h,d,c,n = map(int,input().split())
t= 60*(19-x)+60-y
if x<20:
c1 = (((h+(t*d))/n)*c)//0.8
c2 = (round((h/n)))*c
else:
c1 = (((h ) / n) * c) * 0.8
c2 = (round((h / n))) * c
z =(min(c1,c2))
p = format(z,".4f")
print(p) | c1 = (((h+(t*d))/n)*c)//0.8 | 5 | operation |
from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il + jl + kl))
print(best if best > 0 else -1) | from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il**jl + kl))
print(best if best > 0 else -1) | best = min(best, len(il**jl + kl)) | 20 | operation |
from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il + jl + kl))
print(best if best > 0 else -1) | from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il + jl&kl))
print(best if best > 0 else -1) | best = min(best, len(il + jl&kl)) | 20 | operation |
from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il + jl + kl))
print(best if best > 0 else -1) | from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il + jl**kl))
print(best if best > 0 else -1) | best = min(best, len(il + jl**kl)) | 20 | operation |
from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il + jl + kl))
print(best if best > 0 else -1) | from collections import defaultdict
if __name__ == '__main__':
n, m = map(int, input().split())
g = defaultdict(list)
for _ in range(m):
a,b = map(int, input().split())
g[a].append(b)
g[b].append(a)
best = float("Inf")
for i in g.keys():
for j in g.keys():
if j in g[i]:
for k in g.keys():
if k in g[i]:
il = [a for a in g[i] if a not in [j,k]]
jl = [a for a in g[j] if a not in [i,k]]
kl = [a for a in g[k] if a not in [j,i]]
best = min(best, len(il+jl + kl))
print(best if best > 0 else -1) | best = min(best, len(il+jl + kl)) | 20 | operation |
fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0]+(n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| f = [0]+(n + 1) | 15 | operation |
fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1]^n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| p = [-1]^n | 16 | operation |
fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0]**(n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| f = [0]**(n + 1) | 15 | operation |
fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]|1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| if X[i] == b: f[i],p[i] = f[k]|1,k | 20 | operation |
fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]+1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| fn,sn=map(int,input().split())
f = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
def summify(a):
for i in range(1,len(a)):
a[i]=a[i]+a[i-1]
summify(f)
summify(s)
def lcs(X , Y):
n = len(X)
f = [0] * (n + 1)
p = [-1] * n
for b in Y:
k=-1
for i in range(n):
if X[i] == b: f[i],p[i] = f[k]&1,k
if X[i] < b and f[k] <f[i]:k=i
n = max(f)
i, f = f.index(n), []
return n
print(lcs(f,s))
| if X[i] == b: f[i],p[i] = f[k]&1,k | 20 | operation |
n = int(input())
a = list(map(int, input().split()))
q = int(input())
for Q in range(q):
l,r,x,y = input().split(' ')
i = int(l)
while i<int(r):
if a[i]==int(x):
a[i]=y
i = i + 1
print (a) | n = int(input())
a = list(map(int, input().split()))
q = int(input())
for Q in range(q):
l,r,x,y = input().split(' ')
i = int(l)
while i<int(y):
if a[i]==int(x):
a[i]=y
i = i + 1
print (a) | while i<int(y): | 10 | statement |
n = int(input())
a = list(map(int, input().split()))
q = int(input())
for Q in range(q):
l,r,x,y = input().split(' ')
i = int(l)
while i<int(r):
if a[i]==int(x):
a[i]=y
i = i + 1
print (a) | n = int(input())
a = list(map(int, input().split()))
q = int(input())
for Q in range(q):
l,r,x,y = input().split(' ')
i = int(l)
while i<int(r):
if a[i]==int(x):
a[i]=y
i = i + 23
print (a) | i = i + 23 | 13 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.