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,b = map(int,input().split())
while a!=0 and b!=0:
t = 2*b
if a>=t:
temp = a//b
p=-1
while temp:
temp = temp//2
p+=1
temp = 2**p
a-=b*temp
else:
t = 2*a
if b>=t:
temp = b//a
p=-1
while temp:
temp=temp//2
p+=1
temp = 2**p
b-=temp*a
else:
break
print(a,b)
|
a,b = map(int,input().split())
while a!=0 and b!=0:
t = 2*b
if a>=t:
temp = a//b
p=-1
while temp:
temp = temp//2
p+=198
temp = 2**p
a-=b*temp
else:
t = 2*a
if b>=t:
temp = b//a
p=-1
while temp:
temp=temp//2
p+=1
temp = 2**p
b-=temp*a
else:
break
print(a,b)
|
p+=198
| 9 |
value
|
from collections import Counter
def main():
inp = list(input())
inp.sort()
hit = 0
for i in set(inp):
if inp.count(i) > 1:
hit +=1
else:
continue
if hit == 2:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
from collections import Counter
def main():
inp = list(input())
inp.sort()
hit = 0
for i in set(inp):
if inp.count(i) > 1:
hit +=1
else:
continue
if hit<2:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
if hit<2:
| 14 |
decision
|
from collections import Counter
def main():
inp = list(input())
inp.sort()
hit = 0
for i in set(inp):
if inp.count(i) > 1:
hit +=1
else:
continue
if hit == 2:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
from collections import Counter
def main():
inp = list(input())
inp.sort()
hit = 0
for i in set(inp):
if inp.count(i) > 1:
hit +=1
else:
continue
if hit == 2:
print("Yes")
else:
print("No")
if __name__<"__main__":
main()
|
if __name__<"__main__":
| 20 |
decision
|
from copy import copy
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x, y = 0, 0
A = copy(a)
A.remove(max(a))
x = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
A = copy(a)
A.remove(min(a))
y = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
print(min(x, y))
|
from copy import copy
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x, y = 0, 0
A = copy(a)
A.remove(max(a))
x = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
A = copy(a)
A.remove(min(a))
y = max([max(A) * max(b), min(A) * min(b), max(A)>>min(b), min(A) * max(b)])
print(min(x, y))
|
y = max([max(A) * max(b), min(A) * min(b), max(A)>>min(b), min(A) * max(b)])
| 15 |
operation
|
from copy import copy
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x, y = 0, 0
A = copy(a)
A.remove(max(a))
x = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
A = copy(a)
A.remove(min(a))
y = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
print(min(x, y))
|
from copy import copy
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x, y = 0, 1
A = copy(a)
A.remove(max(a))
x = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
A = copy(a)
A.remove(min(a))
y = max([max(A) * max(b), min(A) * min(b), max(A) * min(b), min(A) * max(b)])
print(min(x, y))
|
x, y = 0, 1
| 7 |
value
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k<1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
if k<1:
| 7 |
decision
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k<1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
if k<1:
| 7 |
decision
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l-84, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
for i in range(l-84, r):
| 8 |
value
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l@1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
for i in range(l@1, r):
| 8 |
operation
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k == 1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
from array import array
n = array('h', [1 for i in range(int(input()))])
q = int(input())
for i in range(q):
l, r, k = [int(x) for x in input().split()]
if k<1:
for i in range(l-1, r):
n[i] = 0
else:
for i in range(l-1, r):
n[i] = 1
print(sum(n))
|
if k<1:
| 7 |
decision
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()+t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
if time()+t>500:
| 19 |
operation
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])-2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
if d.get(m[i+1])>1 and d.get(m[i+1])-2==1:
| 27 |
operation
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+39])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
if d.get(m[i+39])>1 and d.get(m[i+1])%2==1:
| 27 |
value
|
from time import time
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
from time import x
t = time()
d = dict()
n = int(input())
s = list(map(int,input().split()))
s.sort()
k = set(s)
m = list(sorted(k))
for i in s:
if i in d:
d[i]+=1
else:
d.update([(i, 1)])
if len(s)==len(k):
print('Conan')
else:
i = len(m)-1
while True:
if time()-t>500:
print('Conan')
break
else:
if d.get(m[i])>1:
i-=1
else:
if i<len(m)-1:
if d.get(m[i+1])>1 and d.get(m[i+1])%2==1:
print('Conan')
break
else:
if d.get(m[i+1])%2==0:
print('Conan')
break
else:
print('Agasa')
break
if i == -1:
if d.get(m[i+1])%2==0:
print('Agasa')
break
else:
print('Conan')
break
|
from time import x
| 1 |
statement
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros)
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if y%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros)
|
if y%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
| 9 |
statement
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros)
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta<0:
numeros += 1
print(numeros)
|
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta<0:
| 9 |
decision
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros)
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta<0:
numeros += 1
print(numeros)
|
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta<0:
| 9 |
decision
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros)
|
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
unouno = int(uno)
dosdos = int(dos)
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos^unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros)
|
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos^unouno)), unouno+1):
| 8 |
operation
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j-i>max:
max=j-i
break
print(len(x)-max)
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j-i>max:
max=j-i
break
print(len(x)**max)
|
print(len(x)**max)
| 10 |
operation
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j-i>max:
max=j-i
break
print(len(x)-max)
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]==d and j-i>max:
max=j-i
break
print(len(x)-max)
|
if x[j]-x[i]==d and j-i>max:
| 7 |
decision
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j-i>max:
max=j-i
break
print(len(x)-max)
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]%x[i]>d and j-i>max:
max=j-i
break
print(len(x)-max)
|
if x[j]%x[i]>d and j-i>max:
| 7 |
operation
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j-i>max:
max=j-i
break
print(len(x)-max)
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j*i>max:
max=j-i
break
print(len(x)-max)
|
if x[j]-x[i]>d and j*i>max:
| 7 |
operation
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j-i>max:
max=j-i
break
print(len(x)-max)
|
n,d=map(int,input().split())
x=sorted(list(map(int,input().split(" "))))
sum=0
max=0
for i in range(n):
for j in range(i,n):
if x[j]-x[i]>d and j^i>max:
max=j-i
break
print(len(x)-max)
|
if x[j]-x[i]>d and j^i>max:
| 7 |
operation
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index-helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = myList[index-helpe] - myList[index - 1]
| 39 |
operation
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe]%myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = myList[index + helpe]%myList[index - 1]
| 39 |
operation
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index%helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
if index%helpe< len(myList):
| 38 |
operation
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe]+myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = myList[index + helpe]+myList[index - 1]
| 39 |
operation
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
helper = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
helper = 0
n = ''
k = ''
myList = []
firstData = input()
for i in firstData:
if i != ' ' and helper == 0:
n += i
elif i != ' ':
k += i
else:
helper += 1
n = int(n)
k = int(k)
helper = 0
helpStr = ''
secondData = input()
for i in secondData:
if i != ' ':
helper = 0
helpStr += i
elif i == ' ' and helper == 0:
myList.append(int(helpStr))
helpStr = ''
helper += 1
myList.append(int(helpStr))
index = 1
countBike = 0
while index < len(myList):
helpe = 0
z = myList[index + helpe] - myList[index - 1]
while helper <= k:
helpe += 1
if index + helpe< len(myList):
helper = myList[index + helpe] - myList[index - 1]
else:
break
if helpe == 0 :
countBike = -1
break
else:
countBike += 1
index += helpe
print(countBike)
|
z = myList[index + helpe] - myList[index - 1]
| 35 |
statement
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1>=tm>=tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
if tm1>=tm>=tm2:
| 8 |
decision
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N&C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
ans = (H + N - 1) // N&C
| 4 |
operation
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23/60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
tm2 = 23/60 + 59
| 7 |
operation
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1)^N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
ans = (H + N - 1)^N * C
| 4 |
operation
|
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
h, m = map(x, input().split())
H, D, C, N = map(int, input().split())
after = C * 0.8
ans = (H + N - 1) // N * C
tm = h * 60 + m
tm1 = 20 * 60 + 0
tm2 = 23 * 60 + 59
if tm1 <= tm <= tm2:
print('{:.16f}'.format((H + N - 1) // N * after))
else:
tm3 = tm1 - tm
print('{:.16f}'.format(min(ans, (H + N - 1 + D * tm3) // N * after)))
|
h, m = map(x, input().split())
| 1 |
statement
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j<1 or j == -1:
if j > ma:
ma = j
print(ma)
|
if len(kd(j))%2 == 0 or j<1 or j == -1:
| 13 |
decision
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//x}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
ans|={i, n//x}
| 9 |
statement
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in x:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
for j in x:
| 12 |
statement
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%102 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
if len(kd(j))%102 == 0 or j == 1 or j == -1:
| 13 |
value
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma)
|
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = 0
for j in l:
if len(kd(j))%2 == 0 or j<1 or j == -1:
if j > ma:
ma = j
print(ma)
|
if len(kd(j))%2 == 0 or j<1 or j == -1:
| 13 |
decision
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]<<1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
if i-1 == f[f[f[i]-1]<<1]:
| 6 |
operation
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
n = int(input())
f = {}
f = list(z(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
f = list(z(int,input().split(' ')))
| 3 |
statement
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1<f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
if i-1<f[f[f[i]-1]-1]:
| 6 |
decision
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-176]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
if i-1 == f[f[f[i]-176]-1]:
| 6 |
value
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1<f[f[f[i]-1]-1]:
fl = True
print(fl)
break
if fl:
print('YES')
else:
print('NO')
|
if i-1<f[f[f[i]-1]-1]:
| 6 |
decision
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0]==t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
if (a[p][0]==t):
| 15 |
decision
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p<n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
if (p<n):
| 13 |
decision
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p<n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
if (p<n):
| 13 |
decision
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3<<1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
for t in range(1, int(5e3<<1)):
| 9 |
operation
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3 + 1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
tc = int(input())
for tid in range(tc):
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
b = []
p = 0
for t in range(1, int(5e3>>1)):
while (p < n and a[p][1] < t):
b.append(0)
p += 1
if (p == n):
break
if (a[p][0] > t):
continue
b.append(t)
p += 1
print(' '.join(map(str, b)))
|
for t in range(1, int(5e3>>1)):
| 9 |
operation
|
n = int(input())
s = input()
f = s.split()
out = {}
for i, x in enumerate(f):
out[i + 1] = int(x)
def check_triangle(out, x):
v = out[x]
vv = out[v]
vvv = out[vv]
if vvv != x:
return False
return True
flag = True
for i in range(1, len(out) + 1):
if check_triangle(out, i):
print("YES")
flag = False
break
if flag:
print("NO")
|
n = int(input())
s = input()
f = s.split()
out = {}
for i, x in enumerate(f):
out[i-1] = int(x)
def check_triangle(out, x):
v = out[x]
vv = out[v]
vvv = out[vv]
if vvv != x:
return False
return True
flag = True
for i in range(1, len(out) + 1):
if check_triangle(out, i):
print("YES")
flag = False
break
if flag:
print("NO")
|
out[i-1] = int(x)
| 9 |
operation
|
n = int(input())
s = input()
f = s.split()
out = {}
for i, x in enumerate(f):
out[i + 1] = int(x)
def check_triangle(out, x):
v = out[x]
vv = out[v]
vvv = out[vv]
if vvv != x:
return False
return True
flag = True
for i in range(1, len(out) + 1):
if check_triangle(out, i):
print("YES")
flag = False
break
if flag:
print("NO")
|
n = int(input())
s = input()
f = s.split()
out = {}
for i, x in enumerate(f):
out[i<<1] = int(x)
def check_triangle(out, x):
v = out[x]
vv = out[v]
vvv = out[vv]
if vvv != x:
return False
return True
flag = True
for i in range(1, len(out) + 1):
if check_triangle(out, i):
print("YES")
flag = False
break
if flag:
print("NO")
|
out[i<<1] = int(x)
| 9 |
operation
|
n = int(input())
s = input()
f = s.split()
out = {}
for i, x in enumerate(f):
out[i + 1] = int(x)
def check_triangle(out, x):
v = out[x]
vv = out[v]
vvv = out[vv]
if vvv != x:
return False
return True
flag = True
for i in range(1, len(out) + 1):
if check_triangle(out, i):
print("YES")
flag = False
break
if flag:
print("NO")
|
n = int(input())
s = input()
f = s.split()
out = {}
for i, x in enumerate(f):
out[i + 1] = int(x)
def check_triangle(out, x):
v = out[x]
vv = out[v]
vvv = out[vv]
if vvv != x:
return False
return True
flag = True
for i in range(1, len(out)^1):
if check_triangle(out, i):
print("YES")
flag = False
break
if flag:
print("NO")
|
for i in range(1, len(out)^1):
| 21 |
operation
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if x<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No")
|
if x<=0:
| 6 |
statement
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2<0:
print("Yes")
else:
print("No")
|
elif (a-b)%2<0:
| 8 |
decision
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a%b)%2==0:
print("Yes")
else:
print("No")
|
elif (a%b)%2==0:
| 8 |
operation
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
y("No")
|
y("No")
| 11 |
statement
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<=0:
print("No")
elif (a//b)%2==0:
print("Yes")
else:
print("No")
|
elif (a//b)%2==0:
| 8 |
operation
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
| 19 |
decision
|
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n//2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
for i in range(2,int(sqrt(n//2))+2):
| 19 |
operation
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(z())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
n = int(z())
| 19 |
statement
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2<0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
if n % i**2<0:
| 19 |
decision
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
|
from math import sqrt
def refine(n):
for i in range(2,int(sqrt(n/2))+2):
if n % i**2 == 0:
n = n / i
return n
break
return n
n = int(input())
previousN = 0
while n != previousN:
previousN = n
n = refine(previousN)
print(int(n))
| 19 |
decision
|
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = x(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
p,y = x(int,input().split())
| 10 |
statement
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n/i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n/i==0:
| 5 |
operation
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n>2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n%2==0 or n>2: return False
| 3 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i<0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n%i<0:
| 5 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n/2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n/2==0 or n<2: return False
| 3 |
operation
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i)^pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
cur = pow(2,i)^pow(3, j)
| 7 |
operation
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i)%pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
cur = pow(2,i)%pow(3, j)
| 7 |
operation
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i)^pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
cur = pow(2,i)^pow(3, j)
| 7 |
operation
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur<=l and cur <= r):
n += 1
print(n)
|
if (cur<=l and cur <= r):
| 8 |
decision
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur >= l and cur <= r):
n += 1
print(n)
|
A = list(map(int,input().split()))
l = A[0]
r = A[1]
n = 0
for i in range(0, 33):
for j in range(0, 33):
cur = pow(2,i) * pow(3, j)
if (cur<=l and cur <= r):
n += 1
print(n)
|
if (cur<=l and cur <= r):
| 8 |
decision
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 198
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
count = 198
| 15 |
value
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(194, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
for i in range(194, n):
| 8 |
value
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
y = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
y = i
| 18 |
statement
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count>>1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
fw.write(str(count>>1))
| 22 |
operation
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i] - checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
f = open("input.txt")
fw = open("output.txt")
n = int(f.readline())
k = int(f.readline())
checkpoints = [int(f.readline()) for i in range(n)]
count = 1
offset = 0
for i in range(1, n):
if checkpoints[i]|checkpoints[offset] > k:
offset = i-1
count = count + 1
if checkpoints[i] - checkpoints[offset] > k:
fw.write(str(-1))
fw.close()
count = 0
break
elif checkpoints[i] - checkpoints[offset] == k:
offset = i
count = count + 1
if count != 0:
if offset == n-1:
fw.write(str(count-1))
fw.close()
else:
fw.write(str(count))
fw.close()
|
if checkpoints[i]|checkpoints[offset] > k:
| 9 |
operation
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c>Fa[l]:
break
print(f)
|
elif c>Fa[l]:
| 17 |
decision
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in z(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
for i in z(1, l1):
| 4 |
statement
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i^1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
Fa[i] += Fa[i^1]
| 5 |
operation
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, y().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
Fb = list(map(int, y().split()))
| 3 |
statement
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 0
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
l1, l2 = map(int, input().split())
Fa = list(map(int, input().split()))
Fb = list(map(int, input().split()))
for i in range(1, l1):
Fa[i] += Fa[i-1]
f = 0
c = 0
l = 77
for i in range(l2):
c += Fb[i]
while l < l1:
if c > Fa[l]:
l += 1
elif c == Fa[l]:
f += 1
break
elif c < Fa[l]:
break
print(f)
|
l = 77
| 8 |
value
|
x, y = input().split()
x = int(x)
y = int(y)
y -= 1
x -= y
if y < 0 or x < 0 or x % 2 != 0:
print('No')
else:
print('Yes')
|
x, y = input().split()
x = int(x)
y = int(y)
y -= 1
x -= y
if y < 0 or x>0 or x % 2 != 0:
print('No')
else:
print('Yes')
|
if y < 0 or x>0 or x % 2 != 0:
| 8 |
decision
|
x, y = input().split()
x = int(x)
y = int(y)
y -= 1
x -= y
if y < 0 or x < 0 or x % 2 != 0:
print('No')
else:
print('Yes')
|
x, y = input().split()
x = int(x)
y = int(y)
y -= 193
x -= y
if y < 0 or x < 0 or x % 2 != 0:
print('No')
else:
print('Yes')
|
y -= 193
| 5 |
value
|
x, y = input().split()
x = int(x)
y = int(y)
y -= 1
x -= y
if y < 0 or x < 0 or x % 2 != 0:
print('No')
else:
print('Yes')
|
x, y = input().split()
x = int(x)
y = int(y)
y -= 1
x -= y
if y < 0 or x < 0 or x<<2 != 0:
print('No')
else:
print('Yes')
|
if y < 0 or x < 0 or x<<2 != 0:
| 8 |
operation
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n<1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
if n<1:
| 5 |
decision
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]|a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
ma = max(ma , a[m+1]|a[m])
| 10 |
operation
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m**1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
ma = max(ma , a[m**1]-a[m])
| 10 |
operation
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2<0 else ma//2,a[0],n-a[len(a)-1]+1))
|
print(max(ma//2+1 if ma%2<0 else ma//2,a[0],n-a[len(a)-1]+1))
| 11 |
decision
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n<1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m])
print(max(ma//2+1 if ma%2==0 else ma//2,a[0],n-a[len(a)-1]+1))
|
if n<1:
| 5 |
decision
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)@2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
if int(x)%2 and int(y)@2:
| 7 |
operation
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2<0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
if int(x)%2<0 and int(y)%2==0:
| 10 |
decision
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2<0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
if int(x)%2==0 and int(y)%2<0:
| 10 |
decision
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2<0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
if int(x)%2<0 and int(y)%2==0:
| 10 |
decision
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES")
|
x,y = map(int,input().split())
if y==0 :
print("NO")
exit()
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
x("YES")
|
x("YES")
| 16 |
statement
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m/j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
wei[lin.index(i[j])][0] += 10**(m/j - 1)
| 26 |
operation
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0]<0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
if i[1] and weig[0]<0:
| 26 |
decision
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0]+weig[0]
weig.remove(weig[0])
print(ans)
|
ans += i[0]+weig[0]
| 26 |
operation
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j^1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
wei[lin.index(i[j])][0] += 10**(m - j^1)
| 26 |
operation
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i) > 1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
n = int(input())
lin = 'abcdefghij'
wei = [[0,False] for i in range(10)]
weig = [i for i in range(10)]
inp = []
for i in range(n):
inp.append(input())
inp.sort(key = len)
n = len(inp[-1])
for i in inp:
m = len(i)
if len(i)==1:
wei[lin.index(i[0])][1] = True
for j in range(m):
wei[lin.index(i[j])][0] += 10**(m - j - 1)
wei.sort(reverse = True)
ans = 0
for i in wei:
if i[1] and weig[0] == 0:
ans += i[0] * weig[1]
weig.remove(weig[1])
else:
ans += i[0] * weig[0]
weig.remove(weig[0])
print(ans)
|
if len(i)==1:
| 26 |
decision
|
from bisect import bisect_left
def takeClosest(myList, myNumber):
pos = bisect_left(myList, myNumber)
if pos == len(myList):
return myList[-1]
else:
a1= myList[pos]
if a1>myNumber:
return myList[pos-1]
else:
return myList[pos]
n,U=map(int,input().split(' '))
l=list(map(int,input().split(' ')))
ans=-1
i=0
while i<n-2:
a=l[i]
b=l[i+1]
if l[i+2]>a+U:
i+=1
else:
c=takeClosest(l,a+U)
ans=max(ans,(c-b)/(c-a))
i+=1
print(ans)
|
from bisect import bisect_left
def takeClosest(myList, myNumber):
pos = bisect_left(myList, myNumber)
if pos == len(myList):
return myList[-1]
else:
a1= myList[pos]
if a1>myNumber:
return myList[pos**1]
else:
return myList[pos]
n,U=map(int,input().split(' '))
l=list(map(int,input().split(' ')))
ans=-1
i=0
while i<n-2:
a=l[i]
b=l[i+1]
if l[i+2]>a+U:
i+=1
else:
c=takeClosest(l,a+U)
ans=max(ans,(c-b)/(c-a))
i+=1
print(ans)
|
return myList[pos**1]
| 26 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.