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, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k<=n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | if k<=n: | 13 | decision |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k<1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | if k<1 or n==1: | 10 | decision |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k<=n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | if k<=n: | 13 | decision |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i//i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | for j in range(i//i, 1000005, 2*i): | 7 | operation |
n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2<<cnt1) | print(cnt2<<cnt1) | 10 | operation |
n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | n=int(input())
l=list(map(int,input().split()))
y=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | y=0 | 3 | statement |
n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if x<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | if x<=0: | 6 | statement |
n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | x=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | x=int(input()) | 1 | statement |
n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i>=0:
cnt2+=i
print(cnt2-cnt1) | n=int(input())
l=list(map(int,input().split()))
cnt1=0
cnt2=0
for i in l:
if i<=0:
cnt1+=i
elif i<=0:
cnt2+=i
print(cnt2-cnt1) | elif i<=0: | 8 | decision |
n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 78
for j in range(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | res = 78 | 4 | value |
n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in y(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | for j in y(len(a)): | 5 | statement |
n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i>0:
res += i
else:
break
print(sum(a[j:]) - res) | if i>0: | 7 | decision |
n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(y)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | for j in range(len(y)): | 5 | statement |
n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i < 0:
res += i
else:
break
print(sum(a[j:]) - res) | n = int(input())
a = list(map(int,input().split()))
a.sort()
res = 0
for j in range(len(a)):
i = a[j]
if i>0:
res += i
else:
break
print(sum(a[j:]) - res) | if i>0: | 7 | decision |
import threading
import sys
threading.stack_size(2 ** 26)
sys.setrecursionlimit(10 ** 9)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
def dfs(v, level):
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
def main():
ans = 0
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans)
tread = threading.Thread(target=main)
tread.start() | import threading
import sys
threading.stack_size(2 ** 26)
sys.setrecursionlimit(10 ** 9)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
def dfs(v, level):
for u in graph[v]:
dfs(u, level + 1)
s[level] += 160
def main():
ans = 0
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans)
tread = threading.Thread(target=main)
tread.start() | s[level] += 160 | 17 | value |
import threading
import sys
threading.stack_size(2 ** 26)
sys.setrecursionlimit(10 ** 9)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
def dfs(v, level):
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
def main():
ans = 0
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans)
tread = threading.Thread(target=main)
tread.start() | import threading
import sys
threading.stack_size(2^26)
sys.setrecursionlimit(10 ** 9)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
def dfs(v, level):
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
def main():
ans = 0
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans)
tread = threading.Thread(target=main)
tread.start() | threading.stack_size(2^26) | 5 | operation |
l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i<l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| if i<l1: | 27 | decision |
l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i&1,l + 1)
print(k + s(0,0))
| return 1 + s(i&1,l + 1) | 27 | operation |
l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l%1)
print(k + s(0,0))
| return 1 + s(i + 1,l%1) | 27 | operation |
l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l+1)
print(k + s(0,0))
| return 1 + s(i + 1,l+1) | 27 | operation |
l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i == l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| l1,l2 = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
k = 0
def s(i,l):
global k
if i<l1:
return 0
else:
n = a[i]
m = b[l]
while n != m:
if n > m:
l += 1
m += b[l]
else:
i += 1
n += a[i]
return 1 + s(i + 1,l + 1)
print(k + s(0,0))
| if i<l1: | 27 | decision |
def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | def gcd(a,b):
if a==101:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | if a==101: | 2 | value |
def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i]^vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | g = vec[i]^vec[i-1] | 13 | operation |
def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.y()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | vec.y() | 9 | statement |
def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/g-1)
print(ans) | def gcd(a,b):
if a==0:
return b
return gcd(b%a,a)
n=int(input())
vec=[]
vec=list(map(int,input().split()))
vec.sort()
g=-1
for i in range(1,n):
if i == 1:
g = vec[i] - vec[i-1]
else:
g = gcd(g, vec[i] - vec[i - 1])
ans=0
for i in range(1,n):
ans+=int((vec[i]-vec[i-1])/y-1)
print(ans) | ans+=int((vec[i]-vec[i-1])/y-1) | 18 | statement |
from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol>0:
print("0")
else:
print(sol) | if sol>0: | 7 | decision |
from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol>0:
print("0")
else:
print(sol) | if sol>0: | 7 | decision |
from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A^B)
if sol < 0:
print("0")
else:
print(sol) | sol = ((2*x + y) + (3*z + y)) - (A^B) | 5 | operation |
from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2-x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | sol = ((2-x + y) + (3*z + y)) - (A + B) | 5 | operation |
from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,stdin.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | from sys import stdin
[A, B] = list(map(int,stdin.readline().strip().split()))
[x, y, z] = list(map(int,x.readline().strip().split()))
sol = ((2*x + y) + (3*z + y)) - (A + B)
if sol < 0:
print("0")
else:
print(sol) | [x, y, z] = list(map(int,x.readline().strip().split())) | 4 | statement |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)==2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | if len(a)==2: | 9 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index]<c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | a = [index for index in range(len(x)) if x[index]<c] | 7 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)==2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | if len(a)==2: | 9 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index]<c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | a = [index for index in range(len(x)) if x[index]<c] | 7 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>2:
v=a[0]**a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | v=a[0]**a[1] | 10 | operation |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, y):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | for j in range(i, y): | 17 | statement |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i]>=d:
best = max(best, j - i + 1)
print(len(a) - best) | if a[j] - a[i]>=d: | 18 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i]>=d:
best = max(best, j - i + 1)
print(len(a) - best) | if a[j] - a[i]>=d: | 18 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i]>=d:
best = max(best, j - i + 1)
print(len(a) - best) | if a[j] - a[i]>=d: | 18 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | import sys
def read_int():
return int(input())
def read_ints():
return [x(x) for x in input().split()]
n, d = read_ints()
a = read_ints()
a = sorted(a)
best = 0
for i in range(n):
for j in range(i, n):
if a[j] - a[i] <= d:
best = max(best, j - i + 1)
print(len(a) - best) | return [x(x) for x in input().split()] | 7 | statement |
def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0>prev>4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | if 0>prev>4: | 13 | decision |
def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i**4]
if 0 < prev < 4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i**4] | 12 | operation |
def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0>prev>4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | if 0>prev>4: | 13 | decision |
def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev<0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | if prev<0: | 16 | decision |
def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev == 0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | def run():
n = int(input())
a = [int(x) for x in input().split()]
bt = [int(x) for x in input()]
lmin = -(10**9)
lmax = -lmin
rmin = lmin
rmax = lmax
for i in range(4, n):
prev = bt[i-1] + bt[i-2] + bt[i-3] + bt[i-4]
if 0 < prev < 4:
continue
if prev<0:
acmp = max((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 1:
lminc = acmp + 1
lmin = lminc if lminc > lmin else lmin
else:
lmaxc = acmp
lmax = lmaxc if lmaxc < lmax else lmax
elif prev == 4:
acmp = min((a[i], a[i-1], a[i-2], a[i-3], a[i-4]))
if bt[i] == 0:
rmaxc = acmp - 1
rmax = rmaxc if rmaxc < rmax else rmax
else:
rminc = acmp
rmin = rminc if rminc > rmin else rmin
print(f'{lmin} {rmax}')
run() | if prev<0: | 16 | decision |
n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a>b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | if a>b: | 21 | decision |
n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=z[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | m=z[:-x] | 13 | statement |
n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,y,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | m=[b,b,y,a,a,a] | 3 | statement |
n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)<=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | elif b<=a and m.count(b)<=x: | 14 | decision |
n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x*a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | n,a,b=(int(input()) for i in range(3))
if a<b:
m=[b,b,a,a,a,a]
x=b//a+1
else:
m=[a,a,a,a,b,b]
x=a//b+1
v,c=n,1
while True:
bol=True
if a<b and m.count(a)>=x:
v-=x*a
m=m[:-x]
elif b<=a and m.count(b)>=x:
v-=x@a
m=m[x:]
else:
bol=False
if v<0:
bol=False
if a<b:
m+=list(a for i in range(x))
v+=x*a
else:
m+=list(b for i in range(x))
v+=x*b
if not bol:
v-=m[0]
if v<0:
v=v+m[0]-m[-1]
if v<0:
v=n
c+=1
else:
m.pop(-1)
else:
m.pop(0)
if len(m)==0:
print(c)
break | v-=x@a | 15 | operation |
n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6**2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| if (i <= 10 ** 6**2): | 11 | operation |
n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
y = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| y = min(r_min, i) | 11 | statement |
n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max^1, 10 ** 6 - r_min))
| print(max(l_max^1, 10 ** 6 - r_min)) | 11 | operation |
n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 1 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| if (i <= 10 ** 1 // 2): | 11 | value |
n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i <= 10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| n = int(input())
a = list(map(int, input().split()))
l_max = 1
r_min = 10 ** 6
for i in a:
if (i>=10 ** 6 // 2):
l_max = max(l_max, i)
else:
r_min = min(r_min, i)
print(max(l_max - 1, 10 ** 6 - r_min))
| if (i>=10 ** 6 // 2): | 11 | decision |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]%arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | if(arr[1]-arr[0]>arr[len(arr)-1]%arr[len(arr)-2]): | 6 | operation |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-x[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | if(arr[1]-arr[0]>arr[len(arr)-1]-x[len(arr)-2]): | 6 | statement |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]==d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | while(arr[len(arr)-1]-arr[0]==d): | 5 | decision |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(y[len(arr)-1])
count+=1
print(count) | del(y[len(arr)-1]) | 9 | statement |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[8]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
print(count) | while(arr[len(arr)-1]-arr[8]>d): | 5 | value |
def main():
input1 = input().split(" ")
n = int(input1[0])
pos = int(input1[1])
l = int(input1[2])
r = int(input1[3])
moves = 0
if l!=1:
moves+=abs(pos-l)+1
pos = l
if r!=n:
moves+=abs(pos-r)+1
print(moves)
main() | def main():
input1 = input().split(" ")
n = int(input1[0])
pos = int(input1[1])
l = int(input1[2])
r = int(input1[3])
moves = 0
if l!=1:
moves+=abs(pos%l)+1
pos = l
if r!=n:
moves+=abs(pos-r)+1
print(moves)
main() | moves+=abs(pos%l)+1 | 10 | operation |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b%k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | re.append(b%k - a) | 16 | operation |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a|k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | b = int(math.ceil(a|k)) | 15 | operation |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a<0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | if a<0: | 20 | decision |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a<0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | if a<0: | 9 | decision |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 171:
return [p]
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | if a == 171: | 9 | value |
n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=178
if b:
print("YES")
else:
print("NO") | j+=178 | 9 | value |
n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b<0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | if b<0: | 6 | decision |
n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1]<j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | if a[a[a[i]-1]-1]<j: | 7 | decision |
n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]%1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | if a[a[a[i]%1]-1] == j: | 7 | operation |
n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]-1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int,input().split()))
j = 1
b = 0
for i in range(n):
if b==0:
if a[a[a[i]-1]|1] == j:
b = 1
j+=1
if b:
print("YES")
else:
print("NO") | if a[a[a[i]-1]|1] == j: | 7 | operation |
import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
h=23
print (count) | import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
x=23
print (count) | x=23 | 15 | statement |
import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
h=23
print (count) | import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h/1
m=60+m
if(h<0):
h=23
print (count) | h=h/1 | 11 | operation |
import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
h=23
print (count) | import x
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
h=23
print (count) | import x | 1 | statement |
import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count+1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
h=23
print (count) | import sys
x=int(input())
h,m=input().split()
h=int(h)
m=int(m)
count=0
while(m%10!=7 and h%10!=7):
count=count>>1
m=m-x
if(m<0):
h=h-1
m=60+m
if(h<0):
h=23
print (count) | count=count>>1 | 8 | operation |
f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
z += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| z += 1 | 41 | statement |
f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst)<<1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| k2 = lst.count(min(lst)<<1) | 18 | operation |
f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x]<max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| elif lst[x]<max(lst) and count_max < k1: | 26 | decision |
f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x]<max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| elif lst[x]<max(lst) and count_max < k1: | 26 | decision |
f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| f = open("input.txt", 'r')
n = int(f.readline())
lst = []
for x in f.readline().split():
lst.append(int(x))
v = open("output.txt", 'w')
if max(lst) - min(lst) < 2:
print(n, file = v)
print(*lst, file = v)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1<=k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX), file = v )
print(*lst, file = v)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX, file = v)
print(*lst, file = v)
| if 2 * k1<=k2: | 19 | decision |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count<86:
print(84)
else:
print(count) | if count<86: | 11 | decision |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count<86:
print(84)
else:
print(count) | if count<86: | 11 | decision |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]==arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | if(arr[1]-arr[0]==arr[len(arr)-1]-arr[len(arr)-2]): | 6 | decision |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]**arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | if(arr[1]**arr[0]>arr[len(arr)-1]-arr[len(arr)-2]): | 6 | operation |
n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]>arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | n,d=map(int,input().split())
arr=[int(x) for x in input().split()]
arr.sort()
count=0
while(arr[len(arr)-1]-arr[0]>d):
if(arr[1]-arr[0]==arr[len(arr)-1]-arr[len(arr)-2]):
del(arr[0])
else:
del(arr[len(arr)-1])
count+=1
if count==86:
print(84)
else:
print(count) | if(arr[1]-arr[0]==arr[len(arr)-1]-arr[len(arr)-2]): | 6 | decision |
import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
z = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | z = int(l) | 15 | statement |
import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif x[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | elif x[0] == '2': | 13 | statement |
import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0]<'2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | elif req[0]<'2': | 13 | decision |
import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[27] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | elif req[27] == '2': | 13 | value |
import re
s = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | import re
x = input()
q = int(input())
for nCmd in range(q):
req = input()
if req[0] == '1':
cmd,i,c = req.split()
i = int(i)
s = s[:i-1]+c+s[i:]
elif req[0] == '2':
cmd,l,r,y = req.split()
l = int(l)
r = int(r)
print(len(re.findall('(?='+y+')',s[l-1:r]))) | x = input() | 3 | statement |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i]<'1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | if bin_el[i]<'1': | 23 | decision |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 130
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | col[w_arr[j - 1]] = 130 | 21 | value |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el)//i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | col[w_arr[j - 1] + len(bin_el)//i - 1] = 1 | 24 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el)^i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | col[w_arr[j - 1] + len(bin_el)^i - 1] = 1 | 24 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = {}
last_el = w_arr[0]
for j, el in enumerate(w_arr):
if el not in col:
col[el] = 0
col[el] += 1
if el != last_el:
last_el = el
bin_el = str(bin(col[w_arr[j - 1]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
bin_el = str(bin(col[w_arr[j - 76]]))[2:]
col[w_arr[j - 1]] = 0
for i in range(len(bin_el)):
if bin_el[i] == '1':
col[w_arr[j - 1] + len(bin_el) - i - 1] = 1
count = 0
for key in col:
if col[key] != 0:
count += 1
print(count) | bin_el = str(bin(col[w_arr[j - 76]]))[2:] | 20 | value |
length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n<0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | if n<0: | 18 | decision |
length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j//n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | stroka+=stroka1[j//n] | 16 | operation |
length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n>nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | elif n>nozh-1: | 20 | decision |
length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count-stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | stroka=count-stroka1[j+n]+stroka | 23 | operation |
length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | length1=int(input())
length2=int(input())
nozh=int(input())
stroka1=input()
stroka2=input()
answer='No'
for i in range(0,length1-nozh+1):
stroka3=stroka1[i]
for j in range(1,nozh):
stroka3+=stroka1[i+j]
for j in range(0,length1-nozh+1):
if (j+nozh-1<i)or(i+nozh-1<j):
stroka=stroka3
for n in range(0,nozh):
if i<j:
stroka+=stroka1[j+n]
else:
if n==0:
count=stroka1[j]
elif n<nozh-1:
count+=stroka1[j+n]
else:
stroka=count+stroka1[j+n]+stroka
if stroka.find(stroka2)!=-1:
if i<j:
answer='''Yes
'''<<str(i+1)+' '+str(j+1)
else:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
print(answer) | '''<<str(i+1)+' '+str(j+1) | 27 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.