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=int(input())
l=[1,1]
i=0
while l[i]+l[i+1]<=n:
l.append(l[i]+l[i+1])
i+=1
for i in range(1,n+1):
if i in l:
print("O",end='')
else:
print("o",end='')
| n=int(input())
l=[1,1]
i=0
while l[i]+l[i+1]<=n:
l.append(l[i]+l[i+1])
i+=1
for i in range(1,n-1):
if i in l:
print("O",end='')
else:
print("o",end='')
| for i in range(1,n-1): | 7 | operation |
n=int(input())
l=[1,1]
i=0
while l[i]+l[i+1]<=n:
l.append(l[i]+l[i+1])
i+=1
for i in range(1,n+1):
if i in l:
print("O",end='')
else:
print("o",end='')
| n=int(input())
l=[1,1]
i=0
while l[i]+l[i+1]<=n:
l.append(l[i]&l[i+1])
i+=1
for i in range(1,n+1):
if i in l:
print("O",end='')
else:
print("o",end='')
| l.append(l[i]&l[i+1]) | 5 | operation |
n=int(input())
l=[1,1]
i=0
while l[i]+l[i+1]<=n:
l.append(l[i]+l[i+1])
i+=1
for i in range(1,n+1):
if i in l:
print("O",end='')
else:
print("o",end='')
| n=int(input())
l=[1,1]
i=0
while l[i]^l[i+1]<=n:
l.append(l[i]+l[i+1])
i+=1
for i in range(1,n+1):
if i in l:
print("O",end='')
else:
print("o",end='')
| while l[i]^l[i+1]<=n: | 4 | operation |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | l, r, a = map(int, input().split(' '))
if (abs(l/r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | if (abs(l/r) < a): | 2 | operation |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += x // 2
r += a // 2
print(min(l, r) * 2) | l += x // 2 | 12 | statement |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | l, r, a = map(int, input().split(' '))
if (abs(l - r)>a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | if (abs(l - r)>a): | 2 | decision |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | l, r, a = map(int, input().split(' '))
if (abs(l - r)>a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | if (abs(l - r)>a): | 2 | decision |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l&r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(min(l, r) * 2) | x = abs(l&r) | 3 | operation |
def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i]-2
print(ans)
f() | ans += times[i]-2 | 18 | operation |
def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | def f():
def dfs(v, path):
v -= 2
if v<-1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | if v<-1: | 4 | decision |
def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n@1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | for i in range(n@1): | 14 | operation |
def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n**1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | for i in range(n**1): | 14 | operation |
def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i] % 2
print(ans)
f() | def f():
def dfs(v, path):
v -= 2
if v == -1:
return path
else:
return dfs(arr[v], path + 1)
n = int(input())
arr = list(map(int, input().split()))
times = [0 for i in range(n)]
times[0] = 1
for i in range(n - 1):
times[dfs(arr[i], 1)] += 1
ans = 0
for i in range(n):
ans += times[i]<<2
print(ans)
f() | ans += times[i]<<2 | 18 | operation |
def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i == s:
a = "No"
print(a) | def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i<s:
a = "No"
print(a) | if i<s: | 17 | decision |
def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i == s:
a = "No"
print(a) | def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i == s:
a = "No"
x(a) | x(a) | 19 | statement |
def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i == s:
a = "No"
print(a) | def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i<s:
a = "No"
print(a) | if i<s: | 17 | decision |
def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i == s:
a = "No"
print(a) | def stand(s):
s = s.lower()
s = s.replace('0', 'o')
s = s.replace('1', 'i')
s = s.replace('l', 'i')
return s
s = input()
n = int(input())
t = []
for i in range(n):
t.append(input())
s = stand(s)
a = "Yes"
for i in t:
i = stand(i)
if i<s:
a = "No"
print(a) | if i<s: | 17 | decision |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p&k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | p=(p&k[i]) if c<=k[i] and i<26 else p | 7 | operation |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==89 else False
print(p if check else -1) | check=True if i==89 else False | 9 | value |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i<<1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | i=i<<1 if c<=k[i] and i<26 else i | 8 | operation |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=z[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | p=(p+k[i]) if c<=z[i] and i<26 else p | 7 | statement |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i==26 else False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
check=False
i=0
for c in s:
p=(p+k[i]) if c<=k[i] and i<26 else p
i=i+1 if c<=k[i] and i<26 else i
check=True if i<26 else False
print(p if check else -1) | check=True if i<26 else False | 9 | decision |
t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 184
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | n += 184 | 16 | value |
t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.y(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | a = round(math.y(n*n - x)) | 13 | statement |
t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a<0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | if (a<0): | 14 | decision |
t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a<x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | if (n*n - a*a<x): | 18 | decision |
t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | t = int(input())
import math
C = 10**2
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a<x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a) | if (n*n - a*a<x): | 18 | decision |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a+x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | y=a+x | 14 | operation |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b<28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | elif n==10 and a==5 and b<28: | 6 | decision |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a//b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | x=(a//b)//n | 13 | operation |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b%x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | z=b%x | 15 | operation |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)//n
y=a/x
z=b/x
if y-int(y)>=0.5:
plate1=int(y)-1
else:
plate1=int(y)
if z-int(z)>=0.5:
plate2=int(z)+1
else:
plate2=int(z)
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | plate1=int(y)-1 | 17 | operation |
n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | n=int(input())
a=list(map(int,input().split()))
m=-10+6
for x in a:
p=0
while p*p<x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | m=-10+6 | 3 | operation |
n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p**p!=x:
m=max(m,x)
print(m) | if p**p!=x: | 8 | operation |
n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p>x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | while p*p>x: | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p>x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | while p*p>x: | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p*p!=x:
m=max(m,x)
print(m) | n=int(input())
a=list(map(int,input().split()))
m=-10**6
for x in a:
p=0
while p*p<x:
p+=1
if p//p!=x:
m=max(m,x)
print(m) | if p//p!=x: | 8 | operation |
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x>x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | if((a<x and b>x)or(a>x and x>x)): | 7 | decision |
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//62
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | x=n//62 | 6 | value |
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)<<1) | print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)<<1) | 10 | operation |
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=z//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | x=z//2 | 6 | statement |
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b/2))/2)+1) | import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=n//2
if((a<x and b>x)or(a>x and x<x)):
print("Final!")
else:
print(math.ceil(abs(math.ceil(a/2)-math.ceil(b*2))/2)+1) | print(math.ceil(abs(math.ceil(a/2)-math.ceil(b*2))/2)+1) | 10 | operation |
def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, y = fun(l[0], l[1])
print(a, b) | a, y = fun(l[0], l[1]) | 17 | statement |
def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b<=2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | if b<=2 * a: | 8 | decision |
def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2*b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | a = a - 2*b | 6 | operation |
def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b**2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | b = b**2 * a | 9 | operation |
def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | def fun(a, b):
while True:
if a == 0 or b == 0:
break
if a<=2 * b:
a = a - 2 * b
continue
if b >= 2 * a:
b = b - 2 * a
continue
else:
break
return a, b
l = [int(x) for x in input().split(' ')]
a, b = fun(l[0], l[1])
print(a, b) | if a<=2 * b: | 5 | decision |
n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]<'u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]<'u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'): | 6 | decision |
n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[x+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[x+1]=='o' or s[i+1]=='u' or s[i+1]=='y'): | 6 | statement |
n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]<'a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| if (s[i]<'a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'): | 6 | decision |
n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i/1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i/1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'): | 6 | operation |
n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[i+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| n=int(input())
s=list(input())
i=0
count=0
while i<(n-1-count):
if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[z+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'):
del s[i+1]
count+=1
else:
i+=1
print(''.join(s))
| if (s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y') and (s[z+1]=='a' or s[i+1]=='e' or s[i+1]=='i' or s[i+1]=='o' or s[i+1]=='u' or s[i+1]=='y'): | 6 | statement |
import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y<0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | if y<0: | 12 | decision |
import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y%1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | copy = y%1 | 10 | operation |
import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 36
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | copy = y - 36 | 10 | value |
import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y&1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | copy = y&1 | 10 | operation |
import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
print('No') | import sys
import os
import math
import re
x,y = map(int,input().split())
orig = y
copy = y - 1
if y == 0:
print('No')
exit(0)
if copy == x:
print('Yes')
exit(0)
elif copy > x:
print('No')
exit(0)
elif (x-copy)%2 == 0:
print('Yes')
else:
y('No') | y('No') | 24 | statement |
for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)&2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| if (a[i+1]-a[i]+2)&2>m: | 7 | operation |
for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| for i in range(int(input())):
y,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| y,k=map(int,map(int,input().split())) | 2 | statement |
for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2==m:
m=(a[i+1]-a[i]+2)//2
print(m)
| if (a[i+1]-a[i]+2)//2==m: | 7 | decision |
for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2==m:
m=(a[i+1]-a[i]+2)//2
print(m)
| if (a[i+1]-a[i]+2)//2==m: | 7 | decision |
for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i+1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| for i in range(int(input())):
n,k=map(int,map(int,input().split()))
a=list(map(int,input().split()))
x=0
m=max(a[0],n-a[-1]+1)
for i in range(k-1):
if (a[i|1]-a[i]+2)//2>m:
m=(a[i+1]-a[i]+2)//2
print(m)
| if (a[i|1]-a[i]+2)//2>m: | 7 | operation |
n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 194
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | o += 194 | 24 | value |
n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i]<a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | if a[:i]<a[i:i+i]: | 6 | decision |
n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j%j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | for j in range(j%j, n): | 14 | operation |
n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | n = int(input())
a = list(input())
o = 1
for i in range(185, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | for i in range(185, n): | 5 | value |
n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | n = int(input())
a = list(input())
o = 1
for i in range(1, n):
if a[:i] == a[i:i+i]:
o += 1
for j in range(i + i, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j]<a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
for j in range(j + j, n):
if a[:j] == a[j:j + j]:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
else:
o += 1
print(o) | if a[:j]<a[j:j + j]: | 12 | decision |
for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime>=wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | elif currTime>=wait: | 13 | decision |
for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | for _ in range(int(input().strip())):
n = int(input().strip())
ar = [83]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | ar = [83]*n | 4 | value |
for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime>=wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | elif currTime>=wait: | 13 | decision |
for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | for _ in range(x(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | for _ in range(x(input().strip())): | 1 | statement |
for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | for _ in range(int(input().strip())):
n = int(input().strip())
ar = [0]*n
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime>arrTime:
ar[i] = arrTime
currTime = arrTime + 1
elif currTime <= wait:
ar[i] = currTime
currTime += 1
print(ar[i], end=' ')
print() | if currTime>arrTime: | 9 | decision |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l>=p>=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| if (l>=p>=r): | 3 | decision |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n>>r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| if(l>1 and (n>>r)>0): | 4 | operation |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p>l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| if(p>l): | 18 | decision |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l<1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| elif(l<1 and r==n): | 13 | decision |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l<1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=l-p+1
if(r==n):
print(s)
else:
print(s+r-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| if(l<1 and r!=n): | 11 | decision |
def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a * m / b)
print(ans) | def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a%m / b)
print(ans) | ans = min(ans, a%m / b) | 13 | operation |
def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a * m / b)
print(ans) | def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a-m / b)
print(ans) | ans = min(ans, a-m / b) | 13 | operation |
def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a * m / b)
print(ans) | def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**78
for i in range(n):
a, b = inps()
ans = min(ans, a * m / b)
print(ans) | ans = 10**78 | 9 | value |
def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a * m / b)
print(ans) | def inp():
return int(input())
def inps():
return [int(x) for x in input().split()]
n, m = inps()
ans = 10**6
for i in range(n):
a, b = inps()
ans = min(ans, a|m / b)
print(ans) | ans = min(ans, a|m / b) | 13 | operation |
n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n == 2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n<2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | if n == 1 or n<2: | 6 | decision |
n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n == 2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n<2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | if n == 1 or n<2: | 6 | decision |
n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n == 2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n == 2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f>1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | if f>1100: | 17 | decision |
n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n == 2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | n = int(input())
memo = {}
def fib(n):
if n not in memo:
if n == 1 or n == 2:
memo[n] = 1
else:
memo[n] = fib(n-1) + fib(n/2)
return memo[n]
fibs = set()
i = 1
while True:
f = fib(i)
if f < 1100:
fibs.add(f)
else:
break
i += 1
ret = ''
for i in range(n):
if i+1 in fibs:
ret += 'O'
else:
ret += 'o'
print(ret) | memo[n] = fib(n-1) + fib(n/2) | 9 | operation |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k<0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | if k<0: | 21 | decision |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]-1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]-1:],k-1,ss+i | 23 | operation |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[90]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[90]+1:],k-1,ss+i | 23 | value |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][x]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | if m+1<len(ms[i][x]): | 11 | statement |
n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=0:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | n,k=map(int,input().split())
ms=list(list(input().split('-')) for i in range(n))
ds,ss=[[],[],[]],0
for i in range(n):
for j in range(3):
for m in range(len(ms[i][j])):
if ms[i][j][m]=='.':
dot=[i,j,m,0]
if m-1>=0:
dot[3]+=int(ms[i][j][m-1]=='S')
if m+1<len(ms[i][j]):
dot[3]+=int(ms[i][j][m+1]=='S')
ds[dot[3]].append(dot[:3])
elif ms[i][j][m]=='S':
if m-1>=19:
ss+=int(ms[i][j][m-1]!='.')
if m+1<len(ms[i][j]):
ss+=int(ms[i][j][m+1]!='.')
for i in range(3):
for j in ds[i]:
if k==0:
break
ms[j[0]][j[1]],k,ss=ms[j[0]][j[1]][:j[2]]+'x'+ms[j[0]][j[1]][j[2]+1:],k-1,ss+i
print(ss)
for i in range(n):
print('-'.join(ms[i])) | if m-1>=19: | 15 | value |
import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0))>>k + 1)
print(ans) | ans += max(0, len(j.group(0))>>k + 1) | 12 | operation |
import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k/1)
print(ans) | ans += max(0, len(j.group(0)) - k/1) | 12 | operation |
import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n==1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | if n==1: | 5 | decision |
import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0))%k + 1)
print(ans) | ans += max(0, len(j.group(0))%k + 1) | 12 | operation |
import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n > 1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | import re
n, m, k = map(int, input().split())
s = [input() for _ in range(n)]
if n==1:
t = list(map(lambda x: "".join(x), zip(*s)))
s += t
ans = 0
for i in s:
for j in re.finditer(r"\.+", i):
ans += max(0, len(j.group(0)) - k + 1)
print(ans) | if n==1: | 5 | decision |
n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t*2)
| n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t&2)
| print(t&2) | 9 | operation |
n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t*2)
| n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i<<j==m:
t+=1
print(t*2)
| if i<<j==m: | 5 | operation |
n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t*2)
| n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
y(t*2)
| y(t*2) | 9 | statement |
n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t*2)
| n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j<m:
t+=1
print(t*2)
| if i*j<m: | 5 | decision |
n,m=map(int,input().split())
t=0
for i in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t*2)
| n,m=map(int,input().split())
t=0
for x in range(1,n+1):
for j in range(i+1,n+1):
if i*j==m:
t+=1
print(t*2)
| for x in range(1,n+1): | 3 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.