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 |
|---|---|---|---|---|
a = list(input())
b = set(a)
if len(a) == 2 and len(b) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
d = False
for i in b:
if a.count(i) <= 1:
d = True
break
if d:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No')
|
a = list(input())
b = set(a)
if len(a) == 2 and len(b) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b)<2:
d = False
for i in b:
if a.count(i) <= 1:
d = True
break
if d:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No')
|
elif len(b)<2:
| 9 |
decision
|
n, m = map(int, input().split())
s = input()
A = []
for st in s:
A.append(st)
diz = 0
while diz < m:
x, y = map(str, input().split())
if x == y:
diz += 1
else:
for i in range(n):
if A[i] == x:
A[i] = y
elif A[i] == y:
A[i] = x
diz += 1
for elem in A:
print(elem, end = '')
|
n, m = map(int, input().split())
s = input()
A = []
for st in s:
A.append(st)
diz = 0
while diz>m:
x, y = map(str, input().split())
if x == y:
diz += 1
else:
for i in range(n):
if A[i] == x:
A[i] = y
elif A[i] == y:
A[i] = x
diz += 1
for elem in A:
print(elem, end = '')
|
while diz>m:
| 8 |
decision
|
n, m = map(int, input().split())
s = input()
A = []
for st in s:
A.append(st)
diz = 0
while diz < m:
x, y = map(str, input().split())
if x == y:
diz += 1
else:
for i in range(n):
if A[i] == x:
A[i] = y
elif A[i] == y:
A[i] = x
diz += 1
for elem in A:
print(elem, end = '')
|
n, m = map(int, input().split())
s = input()
A = []
for st in s:
A.append(st)
diz = 0
while diz < m:
x, y = map(str, input().split())
if x<y:
diz += 1
else:
for i in range(n):
if A[i] == x:
A[i] = y
elif A[i] == y:
A[i] = x
diz += 1
for elem in A:
print(elem, end = '')
|
if x<y:
| 10 |
decision
|
n, m = map(int, input().split())
s = input()
A = []
for st in s:
A.append(st)
diz = 0
while diz < m:
x, y = map(str, input().split())
if x == y:
diz += 1
else:
for i in range(n):
if A[i] == x:
A[i] = y
elif A[i] == y:
A[i] = x
diz += 1
for elem in A:
print(elem, end = '')
|
n, m = map(int, input().split())
s = input()
A = []
for st in s:
A.append(st)
diz = 0
while diz < m:
x, y = map(str, input().split())
if x == y:
diz += 1
else:
for i in range(x):
if A[i] == x:
A[i] = y
elif A[i] == y:
A[i] = x
diz += 1
for elem in A:
print(elem, end = '')
|
for i in range(x):
| 13 |
statement
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x]==mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
if m[y][x]==mx:
| 14 |
decision
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x]<'.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
if k[y][x]<'.':
| 13 |
decision
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]-['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
k = [l[:2]-['-']+l[2:4]+['-']+l[4:] for l in k]
| 18 |
operation
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x]<'.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
if k[y][x]<'.':
| 13 |
decision
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']+l[4:] for l in k]
for l in k:
print(*l,sep='')
|
m = [
[3,3,4,4,3,3],
[3,3,4,4,3,3],
[2,2,3,3,2,2],
[2,2,3,3,2,2],
[1,1,2,2,1,1],
[1,1,2,2,1,1]
]
mx = 0
k = [list(input().replace('-', '')) for i in range(6)]
for y in range(6):
for x in range(6):
if k[y][x] == '.':
if m[y][x] > mx:
mx = max(m[y][x], mx)
maxpos = (y, x)
k[maxpos[0]][maxpos[1]] = 'P'
k = [l[:2]+['-']+l[2:4]+['-']@l[4:] for l in k]
for l in k:
print(*l,sep='')
|
k = [l[:2]+['-']+l[2:4]+['-']@l[4:] for l in k]
| 18 |
operation
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2<0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
if b%2<0:
| 14 |
decision
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1<t2):
print("1")
else:
print(abs(t1-t2))
|
if(t1<t2):
| 25 |
decision
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n*2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
if abs(t1-t2)+1 >= n*2 -1:
| 22 |
operation
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b<1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
if b<1:
| 17 |
decision
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= n//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
x = [int(t) for t in input().split(' ')]
n=x[0]
a=x[1]
b=x[2]
t=n
c=0
if a%2==0:
t1=a//2
else:
if a==1:
t1=1
else:
t1=a//2+1
if b%2==0:
t2=b//2
else:
if b==1:
t2=1
else:
t2=b//2+1
if abs(t1-t2)+1 >= x//2 -1:
print("Final!")
else:
if(t1==t2):
print("1")
else:
print(abs(t1-t2))
|
if abs(t1-t2)+1 >= x//2 -1:
| 22 |
statement
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top==pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
if top==pop:
| 16 |
decision
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 7
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
i = 7
| 4 |
value
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = z
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
pop = z
| 9 |
statement
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top==pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
if top==pop:
| 16 |
decision
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big*sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
big = a1[i]
for el in a1:
top = el
sm = top
pop = top
if top<pop:
sm = top
for el in b1:
top = el
big = top
pop = top
if top>pop:
big = top
sum = big%sm
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
sum = big%sm
| 18 |
operation
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin>2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
if pmin>2:
| 13 |
decision
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (103,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
for j in range (103,a+1):
| 11 |
value
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**85.1)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
a=math.floor(r**85.1)
| 6 |
value
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j|p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
if j|p not in X:
| 18 |
operation
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
import math
n=int(input())
out=[]
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=math.floor(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=math.floor(math.log(l,j))
if pmin<2:
pmin=2
pmax=math.floor(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+3):
if j**p not in X:
count+=1
X+=[j**p]
out+=[count]
for i in out:
print(i)
|
if j**p in range (l,r+3):
| 17 |
value
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n//1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
for i in range(1, n//1):
| 3 |
operation
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__<'__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
if __name__<'__main__':
| 20 |
decision
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n**1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
for i in range(1, n**1):
| 3 |
operation
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return y
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
return y
| 14 |
statement
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+1, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
def solve(n, m):
out = '%d %d\n' % (prime, prime)
for i in range(1, n-1):
out += '%d %d %d\n' % (i, i+156, 1)
out += '%d %d %d\n' % (n-1, n, prime-n+2)
m -= n-1
for i in range(1, n-1):
for j in range(i+2, n+1):
if m == 0:
return out
else:
m -= 1
out += '%d %d %d\n' % (i, j, maximum)
return out
prime = 100003
maximum = 1000000000
if __name__ == '__main__':
n, m = map(int, input().split())
print(solve(n, m))
|
out += '%d %d %d\n' % (i, i+156, 1)
| 4 |
value
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)/A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
if (x - x//k)/A > B:
| 23 |
operation
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A==B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
if (x - x//k)*A==B:
| 23 |
decision
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k<0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
if x%k<0:
| 22 |
decision
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 3)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
if (x - 3)*A > B:
| 12 |
value
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A > B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n
cost = 0
while x != 1:
if x < k:
cost += A*(x - 1)
x = 1
elif x == k:
if (x - 1)*A==B:
x = 1
cost += B
else:
cost += (x-1)*A
x = 1
elif k == 1:
cost += (x-1)*A
x = 1
else:
if x%k == 0:
if (x - x//k)*A > B:
cost += B
x = x//k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
else:
cost += (x - (x//k)*k)*A
x = (x//k)*k
print(cost)
|
if (x - 1)*A==B:
| 12 |
decision
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 26*min(l, r)
print(ans)
|
ans += 26*min(l, r)
| 14 |
value
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
l, r, a = map(int, input().split(" "))
ans = 0
while l==r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
while l==r:
| 5 |
decision
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l>r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
while l>r:
| 9 |
decision
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
l, r, a = map(int, input().split(" "))
ans = 0
while l==r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
while l==r:
| 5 |
decision
|
l, r, a = map(int, input().split(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
l, r, a = map(int, input().x(" "))
ans = 0
while l > r:
r += 1
a -= 1
while l < r:
l += 1
a -= 1
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans)
|
l, r, a = map(int, input().x(" "))
| 1 |
statement
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k*n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
for i in range(0, k*n):
| 30 |
operation
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n==k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
elif n==k:
| 33 |
decision
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(22, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
for i in range(22, k - n):
| 30 |
value
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k%n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
for i in range(0, k%n):
| 30 |
operation
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[0], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
from bisect import bisect_right
a = list(map(lambda x: int(x), input().split(' ')))
n, k = a[169], a[1]
s = input()
res = ''
s_min = min(s)
s_max = max(s)
st = sorted(set(s))
def find_gt(a, x):
'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
if n < k:
for i, l in enumerate(s):
if i >= k:
break
res += l
for i in range(0, k - n):
res += s_min
elif n > k:
found = False
for l in reversed(s[0:k]):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
else:
found = False
for l in reversed(s):
if found:
res += l
elif l == s_max:
res += s_min
else:
res += find_gt(st, l)
found = True
res = ''.join(reversed(res))
print(res)
|
n, k = a[169], a[1]
| 5 |
value
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>z[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
if tom[1]*bab[0]>z[-1]*bab[-1]:
| 13 |
statement
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]>0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
if tom[-1]>0 and bab[-1]<0:
| 6 |
decision
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]==tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
if tom[-1]*bab[-1]==tom[0]*bab[0]:
| 7 |
decision
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[22])
else:
print(tom[1]*bab[-1])
|
print(tom[1]*bab[22])
| 19 |
value
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]>tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
n,m=map(int,input().split())
tom=list(map(int,input().split()))
bab=list(map(int,input().split()))
tom=sorted(tom,reverse=True)
bab=sorted(bab,reverse=True)
if tom[-1]<0 and bab[-1]<0:
if tom[-1]*bab[-1]==tom[0]*bab[0]:
if tom[-2]>0:
print(tom[-2]*bab[0])
else:
print(tom[-2]*bab[-1])
else:
if tom[1]*bab[0]>tom[-1]*bab[-1]:
print(tom[1]*bab[0])
else:
print(tom[-1]*bab[-1])
else:
if tom[1]>=0:
print(tom[1]*bab[0])
else:
print(tom[1]*bab[-1])
|
if tom[-1]*bab[-1]==tom[0]*bab[0]:
| 7 |
decision
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n/2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
k = n/2 - x
| 8 |
operation
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 68
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
n += 68
| 7 |
value
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n/2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
if n/2 == x:
| 6 |
operation
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 15.6)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
n = ceil(x ** 15.6)
| 5 |
value
|
from math import ceil
for _ in range(int(input())):
x = int(input())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
from math import ceil
for _ in range(int(input())):
x = int(y())
n = ceil(x ** 0.5)
if n ** 2 == x:
n += 1
k = n ** 2 - x
m = k ** 0.5
if m != ceil(m):
print(-1)
else:
m = int(m)
m = n // m
print(n, m, sep=' ', end='\n')
|
x = int(y())
| 4 |
statement
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(x, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
u, v = map(x, input().split())
| 30 |
statement
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle)%1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
for u in range(len(cycle)%1, 0, -1):
| 48 |
operation
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u&1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
block_v = cycle[u&1]
| 50 |
operation
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u**1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
block_v = cycle[u**1]
| 50 |
operation
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u - 1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
cycle_begin, block_u, block_v = -1, -1, -1
g, mark, prev, cycle = [], [], [], []
def dfs(u):
global cycle_begin
mark[u] = 1
for v in g[u]:
if u == block_u and v == block_v:
continue
if mark[v] == 0:
prev[v] = u
if dfs(v):
return True
elif mark[v] == 1:
prev[v] = u
cycle_begin = u
return True
mark[u] = 2
return False
n, m = map(int, input().split())
g = [[] for _ in range(n)]
mark = [0 for _ in range(n)]
prev = [0 for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
for i in range(n):
if mark[i] == 0 and dfs(i):
break
if cycle_begin == -1:
print("YES")
else:
u = cycle_begin
while u != cycle_begin or len(cycle) == 0:
cycle.append(u)
u = prev[u]
cycle.append(cycle_begin)
for u in range(len(cycle) - 1, 0, -1):
block_u = cycle[u]
block_v = cycle[u>>1]
mark = [0 for _ in range(n)]
have = False
for u in range(n):
if mark[u] == 0 and dfs(u):
have = True
break
if not have:
print("YES")
exit()
print("NO")
|
block_v = cycle[u>>1]
| 50 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j**1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
l2=l2*d[(j**1)%len(d)]+l*d[(j-2)%len(d)]
| 29 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l/d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
l2=l2*d[(j-1)%len(d)]+l/d[(j-2)%len(d)]
| 29 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j**1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
l2=l2*d[(j**1)%len(d)]+l*d[(j-2)%len(d)]
| 29 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k**1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
f=(q//k**1)*k
| 16 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k%1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print('1')
else:
if(n==0):
print('0')
else:
print(l2%m)
|
f=(q//k%1)*k
| 16 |
operation
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n == i&i:
count += 1
else:
count += 2
print(count)
|
if n == i&i:
| 7 |
operation
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n-i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
if n-i == 0:
| 6 |
operation
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n<i*i:
count += 1
else:
count += 2
print(count)
|
if n<i*i:
| 7 |
decision
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))<<1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
for i in range(2,int(sqrt(n))<<1):
| 5 |
operation
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))+1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
from math import sqrt
n = int(input())
count = 1
for i in range(2,int(sqrt(n))-1):
if n%i == 0:
if n == i*i:
count += 1
else:
count += 2
print(count)
|
for i in range(2,int(sqrt(n))-1):
| 5 |
operation
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2<0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
if (temp // b) % 2<0:
| 4 |
decision
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 51)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
return temp / (temp // b - 51)
| 7 |
value
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return y / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
return y / (temp // b)
| 5 |
statement
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a<b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
elif a<b:
| 11 |
decision
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a == b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
a, b = map(int, input().split())
def solve(x, y, temp):
if (temp // b) % 2 == 0:
return temp / (temp // b)
else:
return temp / (temp // b - 1)
if a < b:
print(-1)
elif a<b:
print(a)
else:
print(min(solve(a, b, a - b) , solve(a, b, a + b)))
|
elif a<b:
| 11 |
decision
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return y(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
return y(2 * leftHand + 2 * (ambidexters / 2))
| 12 |
statement
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(25 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
return int(25 * (leftHand + ambidexters))
| 15 |
value
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters-2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
return int(2 * leftHand + 2 * (ambidexters-2))
| 12 |
operation
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2&(ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
return int(2 * leftHand + 2&(ambidexters / 2))
| 12 |
operation
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 2))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
def maxGroupCount(leftHand, rightHand, ambidexters):
if rightHand < leftHand:
temp = rightHand
rightHand = leftHand
leftHand = temp
if leftHand == 0 and ambidexters == 0:
return 0
else:
difference = rightHand - leftHand
if difference == 0:
return int(2 * leftHand + 2 * (ambidexters / 2))
else:
if (leftHand + ambidexters) <= rightHand:
return int(2 * (leftHand + ambidexters))
else:
leftHand += difference
ambidexters -= difference
return int(2 * leftHand + 2 * (ambidexters / 39))
var1, var2, var3 = input().split()
var1 = int(var1)
var2 = int(var2)
var3 = int(var3)
print(maxGroupCount(var1, var2, var3))
|
return int(2 * leftHand + 2 * (ambidexters / 39))
| 19 |
value
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j>11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
if j>11:
| 21 |
decision
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.x((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
empty.x((t, i, j))
| 17 |
statement
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j@1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
t += s[j@1] == 'S'
| 16 |
operation
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j@1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
ans += s[j@1] in ['P', 'S']
| 20 |
operation
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j+1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
n, k = map(int, input().split())
m = []
empty = []
ans = 0
for i in range(n):
s = input()
for j in range(len(s)):
if s[j] == '.':
t = 0
if j > 0:
t += s[j-1] == 'S'
if j < 11:
t += s[j@1] == 'S'
empty.append((t, i, j))
if s[j] == 'S':
if j > 0:
ans += s[j-1] in ['P', 'S']
if j < 11:
ans += s[j+1] in ['P', 'S']
m.append(list(s))
empty.sort(key=lambda x: x[0])
for i in range(k):
t, x, y = empty[i]
m[x][y] = 'x'
ans += t
print(ans)
for i in m:
print(''.join(i))
|
t += s[j@1] == 'S'
| 16 |
operation
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-89,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
for i in range(x-1,-89,-1):
| 16 |
value
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]>j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
while(change[i-1]>j):
| 23 |
decision
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
y=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
y=min(a)-5
| 12 |
statement
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr-1
print(l,r)
|
n=int(input())
a=list(map(int,input().split()))
b=input()
change=[]
for i in range(1,n):
if(b[i-1]!=b[i]):
change.append(i)
maxl=max(a)+5
minl=min(a)-5
minr=min(a)-5
maxr=max(a) + 5
x=len(change)
for i in range(x-1,-1,-1):
j=change[i]
if(b[j]=='1'):
minl=max(minl,max(a[j-4:j+1]))
else:
maxr=min(maxr,min(a[j-4:j+1]))
j-=4
while(change[i-1]<j):
j-=1
if(a[j]>minl):
maxl=min(maxl,a[j])
else:
minr=max(minr,a[j])
l=minl+1
r=maxr**1
print(l,r)
|
r=maxr**1
| 30 |
operation
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l<1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
elif l<1:
| 4 |
decision
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a|3+r-l)
|
print(a|3+r-l)
| 14 |
operation
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+7)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
print(max(pos-r, r-pos)+7)
| 5 |
value
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r>>l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
if r>>l+1==n:
| 2 |
operation
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==99:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+3+r-l)
else:
print(a+3+r-l)
|
elif l==99:
| 4 |
value
|
input()
picture = input().split()
cur_col = picture[0]
cur_len = 0
last_len = -1
for i in picture:
if i == cur_col:
cur_len += 1
else:
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
else:
last_len = cur_len
cur_len = 1
cur_col = i
print("YES")
|
input()
picture = input().split()
cur_col = picture[131]
cur_len = 0
last_len = -1
for i in picture:
if i == cur_col:
cur_len += 1
else:
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
else:
last_len = cur_len
cur_len = 1
cur_col = i
print("YES")
|
cur_col = picture[131]
| 5 |
value
|
input()
picture = input().split()
cur_col = picture[0]
cur_len = 0
last_len = -1
for i in picture:
if i == cur_col:
cur_len += 1
else:
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
else:
last_len = cur_len
cur_len = 1
cur_col = i
print("YES")
|
input()
picture = input().split()
cur_col = picture[13]
cur_len = 0
last_len = -1
for i in picture:
if i == cur_col:
cur_len += 1
else:
if last_len != -1 and cur_len != last_len:
print("NO")
exit(0)
else:
last_len = cur_len
cur_len = 1
cur_col = i
print("YES")
|
cur_col = picture[13]
| 5 |
value
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return y
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
return y
| 4 |
statement
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x<7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
if x == 3 or x == 5 or x<7:
| 6 |
decision
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x&0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
for i in range(7, ceil(x&0.5), 2):
| 9 |
operation
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i<0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
if x % i<0:
| 10 |
decision
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3 == 0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
from math import ceil
def prime(x):
if x % 2 == 0 or x % 3<0:
return False
if x == 3 or x == 5 or x == 7:
return True
for i in range(7, ceil(x**0.5), 2):
if x % i == 0:
return False
return True
p, y = map(int, input().split())
for i in range(y, p, -1):
if prime(i):
print(i)
exit()
print(-1)
|
if x % 2 == 0 or x % 3<0:
| 3 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.