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 |
|---|---|---|---|---|
p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(y,p,-1):
if(prime_number(i)):
print(i)
flag = 1
break
if flag != 1:
print("-1") | p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(y,p,-1):
if(prime_number(i)):
print(i)
flag = 161
break
if flag != 1:
print("-1") | flag = 161 | 20 | value |
p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(y,p,-1):
if(prime_number(i)):
print(i)
flag = 1
break
if flag != 1:
print("-1") | p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i>=p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(y,p,-1):
if(prime_number(i)):
print(i)
flag = 1
break
if flag != 1:
print("-1") | while i * i <= x and i>=p: | 7 | decision |
p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(y,p,-1):
if(prime_number(i)):
print(i)
flag = 1
break
if flag != 1:
print("-1") | p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x>>i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(y,p,-1):
if(prime_number(i)):
print(i)
flag = 1
break
if flag != 1:
print("-1") | if(x>>i == 0): | 8 | operation |
n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j>n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| while j>n: | 10 | decision |
n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| n=int(input())
a=[]
b=[]
for i in x(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| for i in x(n): | 4 | statement |
n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]>=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| while j<n and b[cur]>=b[j]: | 14 | decision |
n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j>n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| while j>n: | 10 | decision |
n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]*a[j])
j+=1
print(ans)
| n=int(input())
a=[]
b=[]
for i in range(n):
info=list(map(int,input().split()))
a.append(info[0])
b.append(info[1])
ans=0
j=0
while j<n:
cur=j
ans+=(a[j]*b[j])
j+=1
while j<n and b[cur]<=b[j]:
ans+=(b[cur]|a[j])
j+=1
print(ans)
| ans+=(b[cur]|a[j]) | 15 | operation |
from array import array
n, m, s, t = map(int, input().split())
neighbours = [array('H', [])]
neighbours.clear()
neighbours.append(0)
neighbours.extend((array('H', []) for _ in range(n)))
for __ in range(m):
u, v = map(int, input().split())
neighbours[u].append(v)
neighbours[v].append(u)
dist1 = array('H', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('H', [s])
dists = array('H', [0])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist1[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di+1)
index += 1
dist2 = array('h', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('h', [t])
dists = array('h', [dist1[t]])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist2[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di-1)
index += 1
res = 0
for s in range(1, n+1):
for t in range(1, s):
if (s not in neighbours[t]) and (dist1[s]+1 >= dist2[t]) and (dist1[t]+1 >= dist2[s]):
res += 1
print(res) | from array import array
n, m, s, t = map(int, input().split())
neighbours = [array('H', [])]
neighbours.clear()
neighbours.append(0)
neighbours.extend((array('H', []) for _ in range(n)))
for __ in range(m):
u, v = map(int, input().split())
neighbours[u].append(v)
neighbours[v].append(u)
dist1 = array('H', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('H', [s])
dists = array('H', [0])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist1[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di^1)
index += 1
dist2 = array('h', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('h', [t])
dists = array('h', [dist1[t]])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist2[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di-1)
index += 1
res = 0
for s in range(1, n+1):
for t in range(1, s):
if (s not in neighbours[t]) and (dist1[s]+1 >= dist2[t]) and (dist1[t]+1 >= dist2[s]):
res += 1
print(res) | dists.append(di^1) | 24 | operation |
from array import array
n, m, s, t = map(int, input().split())
neighbours = [array('H', [])]
neighbours.clear()
neighbours.append(0)
neighbours.extend((array('H', []) for _ in range(n)))
for __ in range(m):
u, v = map(int, input().split())
neighbours[u].append(v)
neighbours[v].append(u)
dist1 = array('H', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('H', [s])
dists = array('H', [0])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist1[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di+1)
index += 1
dist2 = array('h', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('h', [t])
dists = array('h', [dist1[t]])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist2[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di-1)
index += 1
res = 0
for s in range(1, n+1):
for t in range(1, s):
if (s not in neighbours[t]) and (dist1[s]+1 >= dist2[t]) and (dist1[t]+1 >= dist2[s]):
res += 1
print(res) | from array import array
n, m, s, t = map(int, input().split())
neighbours = [array('H', [])]
neighbours.clear()
neighbours.append(0)
neighbours.extend((array('H', []) for _ in range(n)))
for __ in range(m):
u, v = map(int, input().split())
neighbours[u].append(v)
neighbours[v].append(u)
dist1 = array('H', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('H', [s])
dists = array('H', [0])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist1[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di+1)
index += 1
dist2 = array('h', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('h', [t])
dists = array('h', [dist1[t]])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist2[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di-1)
index += 1
res = 0
for s in range(1, n+1):
for t in range(1, s):
if (s not in neighbours[t]) and (dist1[s]+1 >= dist2[t]) and (dist1[t]+1<=dist2[s]):
res += 1
print(res) | if (s not in neighbours[t]) and (dist1[s]+1 >= dist2[t]) and (dist1[t]+1<=dist2[s]): | 44 | decision |
from array import array
n, m, s, t = map(int, input().split())
neighbours = [array('H', [])]
neighbours.clear()
neighbours.append(0)
neighbours.extend((array('H', []) for _ in range(n)))
for __ in range(m):
u, v = map(int, input().split())
neighbours[u].append(v)
neighbours[v].append(u)
dist1 = array('H', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('H', [s])
dists = array('H', [0])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist1[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di+1)
index += 1
dist2 = array('h', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('h', [t])
dists = array('h', [dist1[t]])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist2[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di-1)
index += 1
res = 0
for s in range(1, n+1):
for t in range(1, s):
if (s not in neighbours[t]) and (dist1[s]+1 >= dist2[t]) and (dist1[t]+1 >= dist2[s]):
res += 1
print(res) | from array import array
n, m, s, t = map(int, input().split())
neighbours = [array('H', [])]
neighbours.clear()
neighbours.append(0)
neighbours.extend((array('H', []) for _ in range(n)))
for __ in range(m):
u, v = map(int, input().split())
neighbours[u].append(v)
neighbours[v].append(u)
dist1 = array('H', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('H', [s])
dists = array('H', [0])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist1[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di+1)
index += 1
dist2 = array('h', [0]*(n+1))
visit = array('B', [0]+[1]*n)
queue = array('h', [t])
dists = array('h', [dist1[t]])
index = 0
while index < len(queue):
qi = queue[index]
if visit[qi]:
visit[qi] = 0
di = dists[index]
dist2[qi] = di
for oth in neighbours[qi]:
queue.append(oth)
dists.append(di-1)
index += 1
res = 0
for s in range(1, n+1):
for t in range(1, s):
if (s not in neighbours[t]) and (dist1[s]+1<=dist2[t]) and (dist1[t]+1 >= dist2[s]):
res += 1
print(res) | if (s not in neighbours[t]) and (dist1[s]+1<=dist2[t]) and (dist1[t]+1 >= dist2[s]): | 44 | decision |
n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)>=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | elif n%2!=0 and len(s)>=len("1"+"0"*17) and int(s)<=1e18: | 9 | decision |
n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)>=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | elif n%2!=0 and len(s)>=len("1"+"0"*17) and int(s)<=1e18: | 9 | decision |
n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2<0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | if n%2<0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18: | 7 | decision |
n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(z)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | if n%2==0 and len(s)<=len("1"+"0"*17) and int(z)<=1e18: | 7 | statement |
n=int(input())
s="8"
if n==1:
print(6)
else:
s=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | n=int(input())
s="8"
if n==1:
print(6)
else:
y=s*(n//2)
if n%2==0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s)
elif n%2!=0 and len(s)<=len("1"+"0"*17) and int(s)<=1e18:
print(s+"4")
else:
print("-1") | y=s*(n//2) | 6 | statement |
from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a<0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | elif a<0: | 13 | decision |
from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==31:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | elif a==31: | 13 | value |
from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)<(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | if (a,b)<(0,0): | 9 | decision |
from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | from math import *
n,pos,l,r=map(int,input().split(' '))
y,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | y,b=1,1 | 3 | statement |
from math import *
n,pos,l,r=map(int,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | from math import *
n,pos,l,r=map(z,input().split(' '))
a,b=1,1
if l==1:
a=0
if r==n:
b=0
if (a,b)==(0,0):
print(0)
elif b==0:
print((abs(pos-l)+1))
elif a==0:
print((abs(pos-r)+1))
else:
print((abs(pos-l)+1)+(r-l+1)) | n,pos,l,r=map(z,input().split(' ')) | 2 | statement |
input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k=[max(a),min(a)]
a.remove(max(a));a.remove(min(a))
c=[]
d=[]
for i in a:
for j in b:
c.append(i*j)
d.append(i*j)
for i in b:
c.append(k[0]*i)
for i in b:
d.append(k[1]*i)
print(min(max(c),max(d))) | input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k=[max(a),min(a)]
a.remove(max(a));a.remove(min(a))
c=[]
d=[]
for i in a:
for j in b:
c.append(i*j)
d.append(i*j)
for i in b:
c.append(k[0]*i)
for i in b:
d.append(k[1]**i)
print(min(max(c),max(d))) | d.append(k[1]**i) | 15 | operation |
input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k=[max(a),min(a)]
a.remove(max(a));a.remove(min(a))
c=[]
d=[]
for i in a:
for j in b:
c.append(i*j)
d.append(i*j)
for i in b:
c.append(k[0]*i)
for i in b:
d.append(k[1]*i)
print(min(max(c),max(d))) | input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k=[max(a),min(a)]
a.remove(max(a));a.remove(min(a))
c=[]
d=[]
for i in a:
for j in b:
c.append(i*j)
d.append(i*j)
for i in b:
c.append(k[0]**i)
for i in b:
d.append(k[1]*i)
print(min(max(c),max(d))) | c.append(k[0]**i) | 13 | operation |
input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k=[max(a),min(a)]
a.remove(max(a));a.remove(min(a))
c=[]
d=[]
for i in a:
for j in b:
c.append(i*j)
d.append(i*j)
for i in b:
c.append(k[0]*i)
for i in b:
d.append(k[1]*i)
print(min(max(c),max(d))) | input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k=[max(a),min(a)]
a.remove(max(a));a.remove(min(a))
c=[]
d=[]
for i in a:
for j in b:
c.append(i*j)
d.append(i*j)
for i in b:
c.append(k[0]*i)
for i in b:
d.append(k[1]<<i)
print(min(max(c),max(d))) | d.append(k[1]<<i) | 15 | operation |
import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x*1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | return x*1 | 11 | operation |
import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def x(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | def x(n, p): | 6 | statement |
import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n)**p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | x = int(math.exp(math.log(n)**p)) | 7 | operation |
import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n<0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | if n<0: | 14 | decision |
import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p <= n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | import math
p1 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 30, 42]
p2 = [6, 10, 14, 22, 26, 34, 38, 46, 58, 15, 21, 33, 39, 51, 57, 35, 55]
def count(n, p):
x = int(math.exp(math.log(n) / p))
for y in [x + 1, x]:
if y ** p>=n:
return y
return x - 1
def solve(n):
if n == 0:
return 0
ans = 0
for p in p1:
ans += count(n, p) - 1
for p in p2:
ans -= count(n, p) - 1
return ans + 1
Q = int(input())
for i in range(Q):
a, b = list(map(int, input().split()))
print(solve(b) - solve(a - 1)) | if y ** p>=n: | 9 | decision |
import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)&2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | solve = v[len(v)&2] | 16 | operation |
import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in x:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | if math.sqrt(v[i]) in x: | 15 | statement |
import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | import math
def foo(x):
divList = []
y = 2
while y>=x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | while y>=x: | 5 | decision |
import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
v = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | import math
def foo(x):
divList = []
y = 2
while y <= x:
if x % y == 0:
divList.append(y)
y += 1
return divList
n = int(input())
y = foo(n)
i = 0
solve = v[len(v)-1]
while i < len(v):
if math.sqrt(v[i]) in v:
solve = v[len(v)-2]
v = foo(v[len(v)-2])
i = 0
else:
i += 1
print(solve) | y = foo(n) | 11 | statement |
def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]//a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | if (abs(a[i]//a[j]) <= d): | 10 | operation |
def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, y, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | for i in range (0, y, 1): | 8 | statement |
def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]%a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | if (abs(a[i]%a[j]) <= d): | 10 | operation |
def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j])>=d):
ans = max(ans, j-i+1)
print (n-ans) | if (abs(a[i]-a[j])>=d): | 10 | decision |
def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]-a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | def read():
inputs = input().strip()
return list(map(int, inputs.split()))
n, d = map(int, input().split())
a = sorted(read())
ans = 0
for i in range (0, n, 1):
for j in range (i, n, 1):
if (abs(a[i]//a[j]) <= d):
ans = max(ans, j-i+1)
print (n-ans) | if (abs(a[i]//a[j]) <= d): | 10 | operation |
n = int( input() )
k = int( input() )
a = int( input() )
b = int( input() )
s=0
p=0
if k==1 :
s=s+(n-1)*a
else :
while n!=1 :
if n%k==0 :
p= (n-(n//k))*a
if (p*a)< b:
s=s+p*a
else :
s=s+b
n=n//k
elif n<k :
s=s+(n-1)*a
n=1
break
else :
s=s+((n-k*(n//k))*a)
n=k*(n//k)
print (s) | n = int( input() )
k = int( input() )
a = int( input() )
b = int( input() )
s=0
p=0
if k==1 :
s=s/(n-1)*a
else :
while n!=1 :
if n%k==0 :
p= (n-(n//k))*a
if (p*a)< b:
s=s+p*a
else :
s=s+b
n=n//k
elif n<k :
s=s+(n-1)*a
n=1
break
else :
s=s+((n-k*(n//k))*a)
n=k*(n//k)
print (s) | s=s/(n-1)*a | 10 | operation |
n = int( input() )
k = int( input() )
a = int( input() )
b = int( input() )
s=0
p=0
if k==1 :
s=s+(n-1)*a
else :
while n!=1 :
if n%k==0 :
p= (n-(n//k))*a
if (p*a)< b:
s=s+p*a
else :
s=s+b
n=n//k
elif n<k :
s=s+(n-1)*a
n=1
break
else :
s=s+((n-k*(n//k))*a)
n=k*(n//k)
print (s) | n = int( input() )
k = int( x() )
a = int( input() )
b = int( input() )
s=0
p=0
if k==1 :
s=s+(n-1)*a
else :
while n!=1 :
if n%k==0 :
p= (n-(n//k))*a
if (p*a)< b:
s=s+p*a
else :
s=s+b
n=n//k
elif n<k :
s=s+(n-1)*a
n=1
break
else :
s=s+((n-k*(n//k))*a)
n=k*(n//k)
print (s) | k = int( x() ) | 2 | statement |
n = int( input() )
k = int( input() )
a = int( input() )
b = int( input() )
s=0
p=0
if k==1 :
s=s+(n-1)*a
else :
while n!=1 :
if n%k==0 :
p= (n-(n//k))*a
if (p*a)< b:
s=s+p*a
else :
s=s+b
n=n//k
elif n<k :
s=s+(n-1)*a
n=1
break
else :
s=s+((n-k*(n//k))*a)
n=k*(n//k)
print (s) | n = int( input() )
k = int( input() )
a = int( input() )
b = int( input() )
s=0
p=0
if k==1 :
s=s+(n-1)*a
else :
while n!=1 :
if n%k==0 :
p= (n-(n//k))*a
if (p*a)< b:
s=s+p*a
else :
s=s+b
n=n//k
elif n<k :
s=s+(n-1)*a
n=1
break
else :
s=s-((n-k*(n//k))*a)
n=k*(n//k)
print (s) | s=s-((n-k*(n//k))*a) | 28 | operation |
x,y = map(int,input().split())
if x<0:
x=10e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | x,y = map(int,input().split())
if x>0:
x=10e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | if x>0: | 2 | decision |
x,y = map(int,input().split())
if x<0:
x=10e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | x,y = map(int,input().split())
if x<0:
x=10e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n<1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | if n<1: | 12 | decision |
x,y = map(int,input().split())
if x<0:
x=10e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | x,y = map(int,input().split())
if x<0:
x=10e9+7+x
if y>0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | if y>0: | 4 | decision |
x,y = map(int,input().split())
if x<0:
x=10e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | x,y = map(int,input().split())
if x<0:
x=10e9+120+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t)) | x=10e9+120+x | 3 | value |
inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[z] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | if b[z] == '0': | 24 | statement |
inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i>>4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | r = min(r, min(a[i>>4: i + 1])) | 19 | operation |
inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i//4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | l = min(l, max(a[i//4: i + 1])) | 17 | operation |
inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i]<'0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | if b[i]<'0': | 24 | decision |
inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i] == '1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | inf = int(1e9)
M = mod = 1000000007
mod2inv = 500000004
pt = lambda *a, **k: print(*a, **k, flush=True)
rd = lambda: map(int, input().split())
n = int(input())
a = list(rd())
b = input()
l = -inf
r = inf
f = 4
for i in range(4, n):
if f == 4 and b[i]<'1':
l = max(l, max(a[i - 4: i + 1]) + 1)
f = 0
if f == 4 and b[i] == '0':
l = min(l, max(a[i - 4: i + 1]))
if f == -4 and b[i] == '1':
r = min(r, min(a[i - 4: i + 1]))
if f == -4 and b[i] == '0':
r = max(r, min(a[i - 4: i + 1]) - 1)
f = 0
if -4 < f < 4:
if b[i] == '0':
f += 1
if b[i] == '1':
f -= 1
print(l, r) | if f == 4 and b[i]<'1': | 13 | decision |
k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)|2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | dur=(d-k%d)|2+k | 6 | operation |
k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | k,d,t=map(int,input().split())
if k%d<0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | if k%d<0: | 2 | decision |
k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)**2
print(out) | out+=t//k*k+(t%k)**2 | 13 | operation |
k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2|k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | dur=(d-k%d)/2|k | 6 | operation |
k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t<=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | k,d,t=map(int,input().split())
if k%d==0:
dur=k
dt=k
else:
dur=(d-k%d)/2+k
dt=k//d*k+1
out=t//dur*dt
t=t%dur
if t>=k:
out+=t
else:
out+=t//k*k+(t%k)/2
print(out) | if t>=k: | 10 | decision |
__author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | __author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]<letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | elif name[letter]<letter2: | 13 | decision |
__author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | __author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]<letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | elif name[letter]<letter2: | 13 | decision |
__author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | __author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]/letter1+name[letter+1:]
print(name) | name=name[:letter]/letter1+name[letter+1:] | 14 | operation |
__author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | __author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+y+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | name=name[:letter]+y+name[letter+1:] | 12 | statement |
__author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]==letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | __author__ = 'matW7'
length,designers = map(int,input().split())
name = input()
for i in range(designers):
letter1,letter2=map(str,input().split())
for letter in range(length):
if name[letter]==letter1:
name=name[:letter]+letter2+name[letter+1:]
elif name[letter]<letter2:
name=name[:letter]+letter1+name[letter+1:]
print(name) | elif name[letter]<letter2: | 13 | decision |
n, pos, l, r = map(int, input().split())
if l == 0 and r == n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| n, pos, l, z = map(int, input().split())
if l == 0 and r == n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| n, pos, l, z = map(int, input().split()) | 1 | statement |
n, pos, l, r = map(int, input().split())
if l == 0 and r == n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| n, pos, l, r = map(int, input().split())
if l == 0 and r == n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 46 and r != n:
print((r - pos) + 1)
else:
print(0)
| elif l == 46 and r != n: | 12 | value |
n, pos, l, r = map(int, input().split())
if l == 0 and r == n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| n, pos, l, r = map(int, input().split())
if l == 0 and r<n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| if l == 0 and r<n: | 3 | decision |
n, pos, l, r = map(int, input().split())
if l == 0 and r == n:
print(0)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| n, pos, l, r = map(int, input().split())
if l == 0 and r == n:
print(172)
elif l != 1 and r != n:
if pos - l >= r - pos:
print(2 * (r - pos) + (pos - l) + 2)
else:
print((r - pos) + 2 * (pos - l) + 2)
elif l != 1 and r == n:
print( (pos - l) + 1)
elif l == 1 and r != n:
print((r - pos) + 1)
else:
print(0)
| print(172) | 4 | value |
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | def DO(n):
if n == 0:
return ''
elif n<1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | elif n<1: | 4 | decision |
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | def DO(n):
if n == 0:
return ''
elif n<1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | elif n<1: | 4 | decision |
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n==0:
s = DO(n)
print(s) | if n==0: | 11 | decision |
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2)%'8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | return DO(n-2)%'8' | 7 | operation |
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s) | def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return DO(n-2) + '8'
n = y(input())
s = ''
if n > 0:
s = DO(n)
print(s) | n = y(input()) | 9 | statement |
n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2+i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | if s[i:2+i]==curr: | 9 | operation |
n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i>n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | while i>n: | 8 | decision |
n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2&i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | if s[i:2&i]==curr: | 9 | operation |
n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i>n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | while i>n: | 8 | decision |
n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2*i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | n=int(input())
s=input()
c=1
i=1
curr=s[0]
while i<n:
if s[i:2|i]==curr:
c+=1
i=2*i
curr+=curr
else:
curr+=s[i]
c+=1
i+=1
print(c) | if s[i:2|i]==curr: | 9 | operation |
n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 1
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k<0:
x /= k
sum_1 += B
else:
x -= 1
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | if x % k<0: | 6 | decision |
n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 1
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 26
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | x -= 26 | 10 | value |
n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 1
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 1
sum_1 += x
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | sum_1 += x | 11 | statement |
n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 1
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | n, k, A, B = map(int, input().split())
x = n
sum_1 = 0
sum_2 = 0
while x != 1:
if x % k == 0:
x /= k
sum_1 += B
else:
x -= 56
sum_1 += A
while n != 1:
n -= 1
sum_2 += A
print(min(sum_1, sum_2)) | x -= 56 | 10 | value |
n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| n,m=map(int,input().split())
if(n<2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| if(n<2): | 3 | decision |
n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count>m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| while(count>m): | 20 | decision |
n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count>m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| while(count>m): | 20 | decision |
n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count>m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| while(count>m): | 20 | decision |
n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=1
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| n,m=map(int,input().split())
if(n==2):
print(3,3)
print(1,2,3)
else:
ini=1
print(3,100003)
print(1,n,3)
for i in range(2,n-1):
print(1,i,1)
print(1,n-1,10**5-(n-3))
count=n-1
ini=2
while(count<m):
for i in range(ini+1,n+1):
count+=75
print(ini,i,10000000)
if(count>=m):
break
ini+=1
| count+=75 | 23 | value |
n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M+m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| if M+m == 2: | 16 | operation |
n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m<-2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| elif M-m<-2: | 22 | decision |
n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num&m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| for i in range(n-(M_num&m_num)): | 19 | operation |
n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if y-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| if y-m == 2: | 16 | statement |
n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+1, end=" ")
else:
for e in x:
print (e, end=" ")
| n = int(input())
x = n*[0]
s = input().split()
for i in range(n):
x[i] = int(s[i])
m = min(x)
M = max(x)
m_num = 0
M_num = 0
for e in x:
if e==m:
m_num += 1
elif e==M:
M_num += 1
if M-m == 2:
for i in range(M_num-m_num):
print (M, end=" ")
for i in range(n-(M_num-m_num)):
print (M-1, end=" ")
elif M-m == -2:
for i in range(m_num-M_num):
print (m, end=" ")
for i in range(n-(m_num-M_num)):
print (m+33, end=" ")
else:
for e in x:
print (e, end=" ")
| print (m+33, end=" ") | 26 | value |
n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x<pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | if x<pr: | 6 | decision |
n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for x in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | for x in range(0, len(a), 2): | 14 | statement |
n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | n = int(input())
a = []
pr = '1'
c = 0
for x in z().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | for x in z().split(): | 5 | statement |
n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 121
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | c = 121 | 11 | value |
n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i+4]))
print(mx) | n = int(input())
a = []
pr = '1'
c = 0
for x in input().split():
if x == pr:
c += 1
else:
a.append(c)
pr = x
c = 1
a.append(c)
mx = 0
for i in range(0, len(a), 2):
mx = max(mx, sum(a[i:i-4]))
print(mx) | mx = max(mx, sum(a[i:i-4])) | 15 | operation |
def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
a=0
while s:
a+=s%10
s=s+10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | s=s+10 | 5 | operation |
def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i==1:
s+=9
if sum_(s)==10:
i-=1
print(s) | while i==1: | 9 | decision |
def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
a=0
while s:
a+=s%10
s=s&10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | s=s&10 | 5 | operation |
def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)<10:
i-=1
print(s) | if sum_(s)<10: | 11 | decision |
def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
a=0
while s:
a+=s%10
s=s//10
return a
i=int(input())
s=19
while i>1:
s+=9
if sum_(s)<10:
i-=1
print(s) | if sum_(s)<10: | 11 | decision |
t = int(input())
bo = []
for i in range(t):
n = int(input())
mr = 0
b = [-2] * n
l = []
r = []
for j in range(n):
x, y = map(int, input().split())
if y > mr:
mr = y
l.append(x)
r.append(y)
j = 1
k = 0
h = 0
while j <= mr:
if k < n and l[k] == j:
b[k] = -1
k += 1
continue
for o in range(n):
if b[o] == -1:
b[o] = j
break
for o in range(n):
if r[o] == j and b[o] == -1:
b[o] = 0
j += 1
bo.append(b)
for i in range(t):
print(' '.join(map(str, bo[i]))) | t = int(input())
bo = []
for i in range(t):
n = int(input())
mr = 0
b = [-2] * n
l = []
r = []
for j in range(n):
x, y = map(int, input().split())
if y > mr:
mr = z
l.append(x)
r.append(y)
j = 1
k = 0
h = 0
while j <= mr:
if k < n and l[k] == j:
b[k] = -1
k += 1
continue
for o in range(n):
if b[o] == -1:
b[o] = j
break
for o in range(n):
if r[o] == j and b[o] == -1:
b[o] = 0
j += 1
bo.append(b)
for i in range(t):
print(' '.join(map(str, bo[i]))) | mr = z | 12 | statement |
t = int(input())
bo = []
for i in range(t):
n = int(input())
mr = 0
b = [-2] * n
l = []
r = []
for j in range(n):
x, y = map(int, input().split())
if y > mr:
mr = y
l.append(x)
r.append(y)
j = 1
k = 0
h = 0
while j <= mr:
if k < n and l[k] == j:
b[k] = -1
k += 1
continue
for o in range(n):
if b[o] == -1:
b[o] = j
break
for o in range(n):
if r[o] == j and b[o] == -1:
b[o] = 0
j += 1
bo.append(b)
for i in range(t):
print(' '.join(map(str, bo[i]))) | t = int(input())
bo = []
for i in range(t):
n = int(input())
mr = 0
b = [-2]|n
l = []
r = []
for j in range(n):
x, y = map(int, input().split())
if y > mr:
mr = y
l.append(x)
r.append(y)
j = 1
k = 0
h = 0
while j <= mr:
if k < n and l[k] == j:
b[k] = -1
k += 1
continue
for o in range(n):
if b[o] == -1:
b[o] = j
break
for o in range(n):
if r[o] == j and b[o] == -1:
b[o] = 0
j += 1
bo.append(b)
for i in range(t):
print(' '.join(map(str, bo[i]))) | b = [-2]|n | 6 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.