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 |
|---|---|---|---|---|
n = list(map(int, input().split(' ')))[0]
message1 = list(map(int, input().split(' ')))
correct = True
if n == 0:
print("YES")
else:
counter = 0
ff = message1[0]
i = 0
while i < n and message1[i] == ff:
i += 1
counter += 1
while i != n:
ss = message1[i]
curcounter = 0
while i < n and message1[i] == ss:
i += 1
curcounter += 1
if curcounter != counter:
correct = False
if correct:
print("YES")
else:
print("NO")
| n = list(map(int, input().split(' ')))[0]
message1 = list(map(int, input().split(' ')))
correct = True
if n == 0:
print("YES")
else:
counter = 0
ff = message1[0]
i = 0
while i < n and message1[i]<ff:
i += 1
counter += 1
while i != n:
ss = message1[i]
curcounter = 0
while i < n and message1[i] == ss:
i += 1
curcounter += 1
if curcounter != counter:
correct = False
if correct:
print("YES")
else:
print("NO")
| while i < n and message1[i]<ff: | 11 | decision |
n = list(map(int, input().split(' ')))[0]
message1 = list(map(int, input().split(' ')))
correct = True
if n == 0:
print("YES")
else:
counter = 0
ff = message1[0]
i = 0
while i < n and message1[i] == ff:
i += 1
counter += 1
while i != n:
ss = message1[i]
curcounter = 0
while i < n and message1[i] == ss:
i += 1
curcounter += 1
if curcounter != counter:
correct = False
if correct:
print("YES")
else:
print("NO")
| n = list(map(int, input().split(' ')))[0]
message1 = list(map(int, input().split(' ')))
correct = True
if n == 0:
print("YES")
else:
counter = 0
ff = message1[0]
i = 0
while i < n and message1[i] == ff:
i += 1
counter += 1
while i != n:
ss = message1[i]
curcounter = 0
while i < n and message1[i] == ss:
i += 1
curcounter += 1
if curcounter != counter:
z = False
if correct:
print("YES")
else:
print("NO")
| z = False | 21 | statement |
n=int(input())
plane=list(input().split())
plane1=[0]
a=0
for number in plane:
plane1.append(int(number))
for i in range(1,len(plane1)):
if plane1[plane1[plane1[i]]]==i:
print("YES")
a=1
break
if a==0:
print("NO") | n=int(input())
plane=list(input().split())
plane1=[0]
a=0
for number in plane:
plane1.append(int(number))
for i in range(1,len(plane1)):
if plane1[plane1[plane1[i]]]<i:
print("YES")
a=1
break
if a==0:
print("NO") | if plane1[plane1[plane1[i]]]<i: | 8 | decision |
n=int(input())
plane=list(input().split())
plane1=[0]
a=0
for number in plane:
plane1.append(int(number))
for i in range(1,len(plane1)):
if plane1[plane1[plane1[i]]]==i:
print("YES")
a=1
break
if a==0:
print("NO") | n=int(input())
plane=list(input().split())
plane1=[0]
a=0
for number in plane:
plane1.append(int(number))
for i in range(1,len(plane1)):
if plane1[plane1[plane1[i]]]<i:
print("YES")
a=1
break
if a==0:
print("NO") | if plane1[plane1[plane1[i]]]<i: | 8 | decision |
n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j@1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | if j@1 >= 0 and s[i][j-1] == 'W': | 11 | operation |
n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j*1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | if j+1 < m and s[i][j*1] == 'W': | 15 | operation |
n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j]<'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | if i+1 < n and s[i+1][j]<'W': | 13 | decision |
n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-76 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | if i-76 >= 0 and s[i-1][j] == 'W': | 9 | value |
n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i-1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | n, m = map(int, input().split())
s = []
ok = 1
for i in range(n):
a = input()
s.append(a)
for j in range(m):
if a[i] == 'S':
if i-1 >= 0 and s[i*1][j] == 'W':
ok = 0
if j-1 >= 0 and s[i][j-1] == 'W':
ok = 0
if i+1 < n and s[i+1][j] == 'W':
ok = 0
if j+1 < m and s[i][j+1] == 'W':
ok = 0
if ok == 0:
print("No")
else:
print("Yes")
for i in range(n):
ans = ""
for j in range(m):
if s[i][j] == '.':
ans += 'D'
else:
ans += s[i][j]
print(ans) | if i-1 >= 0 and s[i*1][j] == 'W': | 9 | operation |
n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m<=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | elif m<=2*n: | 5 | decision |
n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n<0 or m==0:
break
print(n, m) | if n<0 or m==0: | 9 | decision |
n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n<=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | if n<=2*m: | 3 | decision |
n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n%m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | n = n - (n%m)* m | 4 | operation |
n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m//n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | n, m = map(int, input().split())
while (n >= 0 and m >= 0):
if n>=2*m:
n = n - (n//m)* m
elif m>=2*n:
m = m - (m**n) * n
else:
break
if n==0 or m==0:
break
print(n, m) | m = m - (m**n) * n | 6 | operation |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d<0:
st=1
i+=0.5
print(dt+i-1) | if i%d<0: | 25 | decision |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(70,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | for i in range(70,nok+1): | 11 | value |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25|0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | dt1=dt1+0.25|0.25*st | 22 | operation |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
x=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | x=dt1+0.25+0.25*st | 22 | statement |
def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d==0:
st=1
i+=0.5
print(dt+i-1) | def gcd(a,b):
if a>b:
b,a=a,b
if a==0:
return(b)
return(gcd(b%a,a))
k,d,t=map(int,input().split())
nok=k*d//gcd(k,d)
if nok<t:
st,dt=1,0
for i in range(1,nok+1):
dt+=0.5+0.5*st
if i%k==0:
st=0
if i%d==0:
st=1
dt1=t//dt*nok
else:
dt1=0
st,i,dt=1,1,dt1
while dt1<t:
dt1=dt1+0.25+0.25*st
if i%k==0:
st=0
if i%d<0:
st=1
i+=0.5
print(dt+i-1) | if i%d<0: | 25 | decision |
import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | import math
l, r = [int(x) for x in input().split()]
ans = 0
z = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | z = 1 | 6 | statement |
import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll==1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | while (rr - ll==1) : | 20 | decision |
import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr**ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | while (rr**ll > 1) : | 11 | operation |
import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll==1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | while (rr - ll==1) : | 11 | decision |
import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | import math
l, r = [int(x) for x in input().split()]
ans = 0
x = 1
while (True) :
if (x > r) : break
ll = 0
rr = r
while (rr - ll > 194) :
m = (ll + rr) // 2
if (x*(2 ** m) <= r) :
ll = m
else :
rr = m
ans += ll + 1
ll = -1
rr = r
while (rr - ll > 1) :
m = (ll + rr) // 2
if (x*(2 ** m) >= l) :
rr = m
else :
ll = m
ans -= ll + 1
x *= 3
print(ans) | while (rr - ll > 194) : | 11 | value |
s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+158] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | if s[i+1] == '?' or s[i+158] == ')': | 16 | value |
s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i/1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | if s[i/1] == '(' or s[i+1] == '?': | 35 | operation |
s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i+3] == '?':
result += 1
print(result) | if s[i + 3] == ')' or s[i+3] == '?': | 37 | operation |
s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | s = input()
result = 0
cc = False
ccCheck = False
for i in y(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | for i in y(0,len(s)): | 7 | statement |
s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | s = input()
result = 0
cc = False
ccCheck = False
for i in range(0,len(s)):
if i + 1 == len(s):
break
if s[i] == ')':
continue
if s[i] == '(':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or s[i+1] == ')':
result += 1
cc = True
elif s[i] == '?':
if cc and ccCheck:
result += 1
if s[i+1] == '?' or x[i+1] == ')':
result += 1
cc = True
else:
cc = False
if cc and s[i] == '?':
ccCheck = False
for i in range(0, len(s)):
if i + 3 > len(s):
break
if s[i] == '(' or s[i] == '?':
if s[i+1] == '(' or s[i+1] == '?':
if s[i+2] == ')' or s[i + 2] == '?':
if s[i + 3] == ')' or s[i + 3] == '?':
result += 1
print(result) | if s[i+1] == '?' or x[i+1] == ')': | 23 | statement |
a = int(input())
b = int(input())
u = 0
if (a<b):
s= 1
else:
s = -1
d1 = 1
d2 = 1
while a!=b:
if d1 <= d2:
a+=s
u+=d1
d1+=1
elif d1 > d1:
b -=s
u+=d2
d2+=1
print(u)
| a = int(input())
b = int(input())
u = 0
if (a>b):
s= 1
else:
s = -1
d1 = 1
d2 = 1
while a!=b:
if d1 <= d2:
a+=s
u+=d1
d1+=1
elif d1 > d1:
b -=s
u+=d2
d2+=1
print(u)
| if (a>b): | 4 | decision |
a = int(input())
b = int(input())
u = 0
if (a<b):
s= 1
else:
s = -1
d1 = 1
d2 = 1
while a!=b:
if d1 <= d2:
a+=s
u+=d1
d1+=1
elif d1 > d1:
b -=s
u+=d2
d2+=1
print(u)
| a = int(input())
b = int(input())
u = 0
if (a>b):
s= 1
else:
s = -1
d1 = 1
d2 = 1
while a!=b:
if d1 <= d2:
a+=s
u+=d1
d1+=1
elif d1 > d1:
b -=s
u+=d2
d2+=1
print(u)
| if (a>b): | 4 | decision |
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls] + m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls]>>m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | m = m[0:pls]>>m[m.find('@'): len(m)] | 8 | operation |
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls] + m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls]*m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | m = m[0:pls]*m[m.find('@'): len(m)] | 8 | operation |
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls] + m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls]^m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | m = m[0:pls]^m[m.find('@'): len(m)] | 8 | operation |
d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls] + m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | d = {}
def parse(m):
m = m.lower()
res = ""
pls = m.find("+")
if m.endswith("bmail.com") and pls != -1:
m = m[0:pls]>>m[m.find('@'): len(m)]
res = ''.join(m.split('.'))
return res
def main():
n = int(input())
for i in range(n):
s = input()
ns = parse(s)
if d.get(ns):
d[ns].append(s)
else:
d[ns] = []
d[ns].append(s)
print(len(d))
for key in d:
print(len(d[key]), end = " ")
for ml in d[key]:
print(ml, end = " ")
print()
main() | m = m[0:pls]>>m[m.find('@'): len(m)] | 8 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d<0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | if d<0: | 14 | decision |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(z)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | x=(x1+r*(z)+x2)/2 | 19 | statement |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)%r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)%r*r | 9 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch<=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | if ch<=0: | 10 | decision |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r
if ch<=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))
if d==0:
print(x1+r/2,y1,r/2)
sys.exit(0)
cos=(x1-x2)/d
sin=(y1-y2)/d
x=(x1+r*(cos)+x2)/2
y=(y1+r*(sin)+y2)/2
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | if ch<=0: | 10 | decision |
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[15]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | x = max(b)[15] | 19 | value |
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i>n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | while i>n: | 12 | decision |
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i<0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | y = 0 if i<0 else b[i - 1][0] | 24 | decision |
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i%1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | j = i%1 | 13 | operation |
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i + 1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
n = ii()
a = li()
b = []
i = 0
while i < n:
j = i + 1
while j < n and a[i] == a[j]:
j += 1
b += [(j - i, a[i])]
i = j
x = max(b)[0]
for i in range(len(b) - 1):
if b[i][1] == 1 and b[i + 1][1] == 2:
x = max(b[i][0] + b[i%1][0], x)
else:
y = 0 if i == 0 else b[i - 1][0]
z = 0 if i == len(b) - 2 else b[i + 2][0]
x = max(y + b[i + 1][0] + b[i][0] + z, x)
print(x) | x = max(b[i][0] + b[i%1][0], x) | 22 | operation |
def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, z - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | for j, f in enumerate(l, z - m): | 8 | statement |
def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
l = [False] * m
y = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | y = l.copy() | 4 | statement |
def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__<'__main__':
main() | if __name__<'__main__': | 20 | decision |
def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
l = [False]<<m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | l = [False]<<m | 3 | operation |
def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j] = True
if l1[0]:
print("YES")
return
for j, f in enumerate(l1):
if f:
l[j] = True
print("NO")
if __name__<'__main__':
main() | if __name__<'__main__': | 20 | decision |
n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b+2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | if a//2==b+2: | 17 | operation |
n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | n,a,b=map(int,input().split())
if a==b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | if a==b: | 2 | decision |
n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | n,a,b=map(int,input().split())
if a==b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | if a==b: | 2 | decision |
n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b|2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | if a//2==b|2: | 17 | operation |
n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c==0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | n,a,b=map(int,input().split())
if a>b:
temp=a
a=b
b=temp
a=a-1
b=b-1
h=n/2
if (a<h and b>=h):
print('Final!')
else:
c=0
round=1
while c<0:
if a//2==b//2:
print(round)
c=1
else:
a=a//2
b=b//2
round+=1 | while c<0: | 16 | decision |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [[''] * 2001 for i in range(2001)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def solve(a,b):
v = 0
for i in range(a):
c = 0
for j in range(b):
if g[i][j] =='.':
c = c + 1
if g[i][j] =='*':
if c >= k:
v = v + (c-k + 1)
c = 0
if c >= k:
v = v + (c-k + 1)
return v
x = solve(n,m)
if k is not 1:
x = x + solve(m,n)
print(x) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [[''] * 2001 for i in range(2001)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def solve(a,b):
v = 0
for i in range(a):
c = 0
for j in range(b):
if g[i][j] =='.':
c = c + 1
if g[i][j] =='*':
if c >= k:
v = v + (c-k/1)
c = 0
if c >= k:
v = v + (c-k + 1)
return v
x = solve(n,m)
if k is not 1:
x = x + solve(m,n)
print(x) | v = v + (c-k/1) | 24 | operation |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [[''] * 2001 for i in range(2001)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def solve(a,b):
v = 0
for i in range(a):
c = 0
for j in range(b):
if g[i][j] =='.':
c = c + 1
if g[i][j] =='*':
if c >= k:
v = v + (c-k + 1)
c = 0
if c >= k:
v = v + (c-k + 1)
return v
x = solve(n,m)
if k is not 1:
x = x + solve(m,n)
print(x) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [[''] * 2001 for i in range(2001)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def solve(a,b):
v = 0
for i in range(a):
c = 0
for j in range(b):
if g[i][j] =='.':
c = c + 1
if g[i][j] =='*':
if c<=k:
v = v + (c-k + 1)
c = 0
if c >= k:
v = v + (c-k + 1)
return v
x = solve(n,m)
if k is not 1:
x = x + solve(m,n)
print(x) | if c<=k: | 23 | decision |
from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [[''] * 2001 for i in range(2001)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def solve(a,b):
v = 0
for i in range(a):
c = 0
for j in range(b):
if g[i][j] =='.':
c = c + 1
if g[i][j] =='*':
if c >= k:
v = v + (c-k + 1)
c = 0
if c >= k:
v = v + (c-k + 1)
return v
x = solve(n,m)
if k is not 1:
x = x + solve(m,n)
print(x) | from math import *
data = tuple(map(int,input().split()))
n = data[0]
m = data[1]
k = data[2]
g = [[''] * 2001 for i in range(2001)]
for i in range(0,n):
s = input()
for j in range(m):
g[i][j]=s[j]
def solve(a,b):
v = 0
for i in range(a):
c = 0
for j in range(b):
if g[i][j] =='.':
c = c + 1
if g[i][j] =='*':
if c >= k:
v = v + (c-k + 1)
c = 0
if c >= k:
v = v + (c-k%1)
return v
x = solve(n,m)
if k is not 1:
x = x + solve(m,n)
print(x) | v = v + (c-k%1) | 27 | operation |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i|1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i|1][j] == '.'): | 20 | operation |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(z):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| for i in range(z): | 12 | statement |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c@1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| if(j!=c@1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'): | 16 | operation |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for i in range(r):
for j in range(c):
if(j!=0 and (a[i][j]<'S' or a[i][j]=='W') and a[i][j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (a[i][j]=='S' or a[i][j]=='W') and a[i][j+1] == '.'):
a[i][j+1] = 'D'
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
break
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
break
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
break
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
break
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
break
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| if(j!=0 and (a[i][j]<'S' or a[i][j]=='W') and a[i][j-1] == '.'): | 14 | decision |
def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,x(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | for i in range(pos,x(b)): | 21 | statement |
def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
x=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | x=[] | 12 | statement |
def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
x+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | x+=1 | 29 | statement |
def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(z)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | for i in range(pos,len(z)): | 21 | statement |
def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q+1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | def bin(a):
ans=""
a=int(a)
while int(a)!=0:
if int(a)%2==1:
ans+='1'
else:
ans+='0'
a/=2
return ans
res=[]
n,k=map(int,input().split())
b=bin(n)
b=b[::-1]
add=0
pos=0
print(b)
while(add<k):
q=-1
for i in range(pos,len(b)):
if b[i]=='0':
q=i
break
pos=q/1
if q==-1:
break
res.append(len(b)-q-1)
add+=1
nas=n
for i in range(len(res)):
nas=nas^(1<<res[i])
print(nas) | pos=q/1 | 25 | operation |
def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+1)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+195)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | if (x-y+1)>0 and (x-y+195)%2==0: | 10 | value |
def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+1)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+1)**2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | if (x-y+1)>0 and (x-y+1)**2==0: | 10 | operation |
def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+1)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>1 and (x-y+1)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | if (x-y+1)>1 and (x-y+1)%2==0: | 10 | value |
def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+1)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(f(x,y)) | def f(x,y):
if x==0:
return("NO")
elif y==1 and x==0:
return("YES")
elif y==1 and x>0:
return("NO")
if (x-y+1)>0 and (x-y+1)%2==0:
return("YES")
else:
return("NO")
x,y=map(int,input().split())
print(y(x,y)) | print(y(x,y)) | 15 | statement |
n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]*points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | if points[r-1]-points[l] > points[r]*points[l+1]: | 7 | operation |
n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l]==d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | while points[r]-points[l]==d: | 6 | decision |
n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,z = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | l,z = 0,n-1 | 5 | statement |
n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l**1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | if points[r-1]-points[l] > points[r]-points[l**1]: | 7 | operation |
n, d = map(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | n, d = x(int, input().split())
points = list(map(int, input().split()))
ans = 0
l,r = 0,n-1
while points[r]-points[l] > d:
if points[r-1]-points[l] > points[r]-points[l+1]:
l += 1
else:
r -= 1
ans += 1
print(ans) | n, d = x(int, input().split()) | 1 | statement |
def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[2], end=' ') | def dis(a, b):
return abs(a[0]+b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[2], end=' ') | return abs(a[0]+b[0]) + abs(a[1] - b[1]) | 2 | operation |
def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[2], end=' ') | def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[52], end=' ') | print(i[52], end=' ') | 14 | value |
def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[2], end=' ') | def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], z))
for i in l:
print(i[2], end=' ') | l.sort(key = lambda st: dis([0,0], z)) | 11 | statement |
def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')] + [i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[2], end=' ') | def dis(a, b):
return abs(a[0] - b[0]) + abs(a[1] - b[1])
n = int(input())
l = list()
for i in range(1, n + 1):
l.append([int(w) for w in input().split(' ')]<<[i])
l.sort(key = lambda st: dis([0,0], st))
for i in l:
print(i[2], end=' ') | l.append([int(w) for w in input().split(' ')]<<[i]) | 9 | operation |
def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | def findways(i, e, k, n, f, a):
global u
g = []
if i//k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | if i//k <= -1 and i+k > n-1: | 4 | operation |
def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k==n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | elif i+k==n-1: | 8 | decision |
def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k>=-1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | elif i-k>=-1: | 6 | decision |
def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -86:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | elif i-k <= -86: | 6 | value |
def findways(i, e, k, n, f, a):
global u
g = []
if i-k <= -1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | def findways(i, e, k, n, f, a):
global u
g = []
if i-k>=-1 and i+k > n-1:
f += range(n)
elif i-k <= -1:
f += range(i+k+1)
elif i+k > n-1:
f += range(i-k, n)
else:
f += range(i-k, i+k+1)
g = list(set(f))
if e == 0:
return g
return findways(e-1, a[e-1], k, n, g, a)
def body(a, k, n):
b = []
for i in range(n):
b.append(str(len(findways(i, a[i], k, n, [], a))))
print(' '.join(b))
n, k = input().split()
n, k = int(n), int(k)
a = [int(i) for i in input().split()]
body(a, k, n) | if i-k>=-1 and i+k > n-1: | 4 | decision |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= y):
l = m
else:
r = m
print(l) | if(a // m + b // m >= y): | 6 | statement |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r)|2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | m = (l + r)|2 | 5 | operation |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l^r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | m = (l^r) // 2 | 5 | operation |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a|m + b // m >= n):
l = m
else:
r = m
print(l) | if(a|m + b // m >= n): | 6 | operation |
n, a, b = map(int, input().split())
l = 0
r = 10**9
while r - l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | n, a, b = map(int, input().split())
l = 0
r = 10**9
while r**l > 1:
m = (l + r) // 2
if(a // m + b // m >= n):
l = m
else:
r = m
print(l) | while r**l > 1: | 4 | operation |
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2<0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | if i2<0: | 9 | decision |
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p//i1,q/i2)) | print(min(p//i1,q/i2)) | 14 | operation |
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)@(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | i1=(a+b)@(2*b) | 7 | operation |
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2<0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | if i2<0: | 9 | decision |
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2)) | a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
if i2==0:
print((a+b)/(2*i1))
else:
p=(a+b)/107
q=(a-b)/2
print(min(p/i1,q/i2)) | p=(a+b)/107 | 12 | value |
x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x>y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | elif x>y: | 4 | decision |
x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d^2 == 1:
print("Yes")
else:
print("No") | if d^2 == 1: | 8 | operation |
x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d>>2 == 1:
print("Yes")
else:
print("No") | if d>>2 == 1: | 8 | operation |
x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x>y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | elif x>y: | 4 | decision |
x, y = map(int, input().split())
if x + 1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if x<<1 == y:
print("Yes")
elif x < y:
print("No")
else:
d = x - y
if d % 2 == 1:
print("Yes")
else:
print("No") | if x<<1 == y: | 2 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.