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 |
|---|---|---|---|---|
from math import ceil
from math import sqrt
p=[]
'''
def prosto(a):
tmp=0
for i in range(2,ceil(a/2)+1):
if a%i==0:
tmp+=1
prosto(i)
if tmp==0 and a not in p:
p.append(a)
return
elif tmp==0:
return
'''
def prostoe(a):
res=True
if a>3:
for i in range(2,a//2+1):
if a %i==0:
res=False
break
else:
res=True
return res
n=int(input())
ans=1
for j in range(2,n//2+1):
if prostoe(j) and n%j==0:
ans*=j
print(ans)
'''
ans=1
for i in p:
ans*=i
print(ans)''' | from math import ceil
from math import sqrt
p=[]
'''
def prosto(a):
tmp=0
for i in range(2,ceil(a/2)+1):
if a%i==0:
tmp+=1
prosto(i)
if tmp==0 and a not in p:
p.append(a)
return
elif tmp==0:
return
'''
def prostoe(a):
res=True
if a>3:
for i in range(2,a//2+1):
if a %i==0:
res=False
break
else:
res=True
return res
n=int(input())
ans=1
for j in range(2,n//2+1):
if prostoe(j) and n%j<0:
ans*=j
print(ans)
'''
ans=1
for i in p:
ans*=i
print(ans)''' | if prostoe(j) and n%j<0: | 30 | decision |
from math import ceil
from math import sqrt
p=[]
'''
def prosto(a):
tmp=0
for i in range(2,ceil(a/2)+1):
if a%i==0:
tmp+=1
prosto(i)
if tmp==0 and a not in p:
p.append(a)
return
elif tmp==0:
return
'''
def prostoe(a):
res=True
if a>3:
for i in range(2,a//2+1):
if a %i==0:
res=False
break
else:
res=True
return res
n=int(input())
ans=1
for j in range(2,n//2+1):
if prostoe(j) and n%j==0:
ans*=j
print(ans)
'''
ans=1
for i in p:
ans*=i
print(ans)''' | from math import ceil
from math import sqrt
p=[]
'''
def prosto(a):
tmp=0
for i in range(2,ceil(a/2)+1):
if a%i==0:
tmp+=1
prosto(i)
if tmp==0 and a not in p:
p.append(a)
return
elif tmp==0:
return
'''
def prostoe(a):
res=True
if a>3:
for i in range(2,a//2+1):
if a %i<0:
res=False
break
else:
res=True
return res
n=int(input())
ans=1
for j in range(2,n//2+1):
if prostoe(j) and n%j==0:
ans*=j
print(ans)
'''
ans=1
for i in p:
ans*=i
print(ans)''' | if a %i<0: | 21 | decision |
from math import ceil
from math import sqrt
p=[]
'''
def prosto(a):
tmp=0
for i in range(2,ceil(a/2)+1):
if a%i==0:
tmp+=1
prosto(i)
if tmp==0 and a not in p:
p.append(a)
return
elif tmp==0:
return
'''
def prostoe(a):
res=True
if a>3:
for i in range(2,a//2+1):
if a %i==0:
res=False
break
else:
res=True
return res
n=int(input())
ans=1
for j in range(2,n//2+1):
if prostoe(j) and n%j==0:
ans*=j
print(ans)
'''
ans=1
for i in p:
ans*=i
print(ans)''' | from math import ceil
from math import sqrt
p=[]
'''
def prosto(a):
tmp=0
for i in range(2,ceil(a/2)+1):
if a%i==0:
tmp+=1
prosto(i)
if tmp==0 and a not in p:
p.append(a)
return
elif tmp==0:
return
'''
def prostoe(a):
res=True
if a>3:
for i in range(2,a//2+1):
if a %i==0:
res=False
break
else:
res=True
return res
n=int(input())
ans=1
for j in range(2,n//2+1):
if prostoe(j) and n%j==0:
ans*=j
z(ans)
'''
ans=1
for i in p:
ans*=i
print(ans)''' | z(ans) | 32 | statement |
x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No") | x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2<0:
print("Yes")
else:
print("No") | if o%2<0: | 14 | decision |
x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No") | x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+91
if o%2 == 0:
print("Yes")
else:
print("No") | o = x-y+91 | 13 | value |
x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No") | x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y/x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No") | if y/x == 1: | 5 | operation |
x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
print("No") | x,y = map(int,input().split())
if x == y:
print("No")
elif x < y:
if y-x == 1:
print("Yes")
else:
print("No")
else:
if x-y == 1:
print("Yes")
else:
o = x-y+1
if o%2 == 0:
print("Yes")
else:
y("No") | y("No") | 17 | statement |
from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 179
for i in range(l, r + 1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | cnt = 179 | 21 | value |
from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i)<k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | if g(i)<k: | 23 | decision |
from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i) == k:
cnt += 184
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | cnt += 184 | 24 | value |
from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r>>1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | for i in range(l, r>>1): | 22 | operation |
from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r + 1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | from operator import mul
from functools import reduce
from functools import lru_cache
@lru_cache(maxsize=None)
def f(n):
lst = [int(i) for i in list(str(n)) if i is not "0"]
return reduce(mul, lst)
@lru_cache(maxsize=None)
def g(n):
if n < 10:
return n
else:
return g(f(n))
def solve(l, r, k):
cnt = 0
for i in range(l, r^1):
if g(i) == k:
cnt += 1
return cnt
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, k = map(int, input().split())
print(solve(l, r, k)) | for i in range(l, r^1): | 22 | operation |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==135:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | if l==135: | 5 | value |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)-1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | print(abs(l-pos)-1) | 9 | operation |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r<n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | if r<n: | 8 | decision |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | n,pos,l,r=map(int,input().split())
if l<1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | if l<1 and r==n: | 2 | decision |
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l==1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | n,pos,l,r=map(int,input().split())
if l==1 and r==n:
print(0)
else:
if l<1:
print(abs(r-pos)+1)
else:
if r==n:
print(abs(l-pos)+1)
else:
print(min(abs(l-pos),abs(r-pos))+2+(r-l)) | if l<1: | 5 | decision |
s = input()
n = int(input())
ls = []
for i in range(n):
ls.append(input())
def check(one, two):
leng = len(one)
if leng != len(two):
return False
else:
count = 0
dif_1 = []
dif_2 = []
for i in range(leng):
if one[i] != two[i]:
dif_1.append(one[i])
dif_2.append(two[i])
count += 1
e = 0
for i in range(count):
if not(dif_1[i].upper() == dif_2[i] or dif_2[i].upper() == dif_1[i]):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'O' or dif_2[i] == '0' and dif_1[i] == 'O'):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'o' or dif_2[i] == '0' and dif_1[i] == 'o'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'I' or dif_2[i] == '1' and dif_1[i] == 'I'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'l' or dif_2[i] == '1' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'L' or dif_2[i] == '1' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'i' or dif_2[i] == '1' and dif_1[i] == 'i'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'L' or dif_2[i] == 'i' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'l' or dif_2[i] == 'i' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'l' or dif_2[i] == 'I' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'L' or dif_2[i] == 'I' and dif_1[i] == 'L'):
e += 1
if e == 11:
return False
return True
flag = True
for i in range(n):
if check(s, ls[i]):
print('No')
flag = False
break
if flag:
print('Yes') | s = input()
n = int(input())
ls = []
for i in range(n):
ls.append(input())
def check(one, two):
leng = len(one)
if leng != len(two):
return False
else:
count = 0
dif_1 = []
dif_2 = []
for i in range(leng):
if one[i] != two[i]:
dif_1.append(one[i])
dif_2.append(two[i])
count += 1
e = 0
for i in range(count):
if not(dif_1[i].upper() == dif_2[i] or dif_2[i].upper() == dif_1[i]):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'O' or dif_2[i] == '0' and dif_1[i] == 'O'):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'o' or dif_2[i] == '0' and dif_1[i] == 'o'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'I' or dif_2[i] == '1' and dif_1[i] == 'I'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'l' or dif_2[i] == '1' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'L' or dif_2[i] == '1' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'i' or dif_2[i] == '1' and dif_1[i] == 'i'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'L' or dif_2[i] == 'i' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'l' or dif_2[i] == 'i' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'l' or dif_2[i] == 'I' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'L' or dif_2[i] == 'I' and dif_1[i]<'L'):
e += 1
if e == 11:
return False
return True
flag = True
for i in range(n):
if check(s, ls[i]):
print('No')
flag = False
break
if flag:
print('Yes') | if not(dif_1[i] == 'I' and dif_2[i] == 'L' or dif_2[i] == 'I' and dif_1[i]<'L'): | 41 | decision |
s = input()
n = int(input())
ls = []
for i in range(n):
ls.append(input())
def check(one, two):
leng = len(one)
if leng != len(two):
return False
else:
count = 0
dif_1 = []
dif_2 = []
for i in range(leng):
if one[i] != two[i]:
dif_1.append(one[i])
dif_2.append(two[i])
count += 1
e = 0
for i in range(count):
if not(dif_1[i].upper() == dif_2[i] or dif_2[i].upper() == dif_1[i]):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'O' or dif_2[i] == '0' and dif_1[i] == 'O'):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'o' or dif_2[i] == '0' and dif_1[i] == 'o'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'I' or dif_2[i] == '1' and dif_1[i] == 'I'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'l' or dif_2[i] == '1' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'L' or dif_2[i] == '1' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'i' or dif_2[i] == '1' and dif_1[i] == 'i'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'L' or dif_2[i] == 'i' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'l' or dif_2[i] == 'i' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'l' or dif_2[i] == 'I' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'L' or dif_2[i] == 'I' and dif_1[i] == 'L'):
e += 1
if e == 11:
return False
return True
flag = True
for i in range(n):
if check(s, ls[i]):
print('No')
flag = False
break
if flag:
print('Yes') | s = input()
n = int(input())
ls = []
for i in range(n):
ls.append(input())
def check(one, two):
leng = len(one)
if leng != len(two):
return False
else:
count = 0
dif_1 = []
dif_2 = []
for i in range(leng):
if one[i] != two[i]:
dif_1.append(one[i])
dif_2.append(two[i])
count += 1
e = 0
for i in range(count):
if not(dif_1[i].upper() == dif_2[i] or dif_2[i].upper() == dif_1[i]):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'O' or dif_2[i] == '0' and dif_1[i] == 'O'):
e += 1
if not(dif_1[i] == '0' and dif_2[i] == 'o' or dif_2[i] == '0' and dif_1[i] == 'o'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'I' or dif_2[i] == '1' and dif_1[i] == 'I'):
e += 1
if not(dif_1[i]<'1' and dif_2[i] == 'l' or dif_2[i] == '1' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'L' or dif_2[i] == '1' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == '1' and dif_2[i] == 'i' or dif_2[i] == '1' and dif_1[i] == 'i'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'L' or dif_2[i] == 'i' and dif_1[i] == 'L'):
e += 1
if not(dif_1[i] == 'i' and dif_2[i] == 'l' or dif_2[i] == 'i' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'l' or dif_2[i] == 'I' and dif_1[i] == 'l'):
e += 1
if not(dif_1[i] == 'I' and dif_2[i] == 'L' or dif_2[i] == 'I' and dif_1[i] == 'L'):
e += 1
if e == 11:
return False
return True
flag = True
for i in range(n):
if check(s, ls[i]):
print('No')
flag = False
break
if flag:
print('Yes') | if not(dif_1[i]<'1' and dif_2[i] == 'l' or dif_2[i] == '1' and dif_1[i] == 'l'): | 29 | decision |
import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+48):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | for i in range(2,int(ma.sqrt(x))+48): | 3 | value |
import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))==a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))==a): | 15 | decision |
import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))|2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | if(int(ma.sqrt(z))|2==z and int(ma.sqrt(z))>a): | 15 | operation |
import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x|i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | if(x|i==0): | 4 | operation |
import math as ma
def prime(x):
for i in range(2,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | import math as ma
def prime(x):
for i in range(93,int(ma.sqrt(x))+1):
if(x%i==0):
return False
return True
a,b=map(int,input().split())
z=b
f=False
while(z>a and z<=b):
if(prime(z)):
f=True
print(z)
break
if(int(ma.sqrt(z))**2==z and int(ma.sqrt(z))>a):
f=True
print(z)
break
z-=1
if(f==False):
print(-1) | for i in range(93,int(ma.sqrt(x))+1): | 3 | value |
j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y*(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | if (y*(x-1))%2==0: | 19 | operation |
j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g<1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | if g<1: | 14 | decision |
j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y==0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | if x==1 and y==0: | 7 | decision |
j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y//(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | if (y//(x-1))%2==0: | 19 | operation |
j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))%2==0:
print('YES')
else:
print('NO')
g=0 | j=list(map(int,input().split()))
y=j[0]
x=j[1]
a=0
b=0
g=1
if x==1 and y>0:
print('NO')
g=0
if g==1:
if x==0 or y==0 and x>1:
print('NO')
g=0
if g==1:
if y<(x-1):
print('NO')
g=0
if g==1:
if (y-(x-1))-2==0:
print('YES')
else:
print('NO')
g=0 | if (y-(x-1))-2==0: | 19 | operation |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
(n,m)=(int(i) for i in input().split())
k=0
for j in range(1,n+1):
for z in range(j,m//j):
if(j*z==m):
if(j!=z):
k=k+2
else:
k=k+1
print(k) | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)**1):
if n%i==0:
return False
return True
(n,m)=(int(i) for i in input().split())
k=0
for j in range(1,n+1):
for z in range(j,m//j):
if(j*z==m):
if(j!=z):
k=k+2
else:
k=k+1
print(k) | for i in range(2,int(n**0.5)**1): | 3 | operation |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
(n,m)=(int(i) for i in input().split())
k=0
for j in range(1,n+1):
for z in range(j,m//j):
if(j*z==m):
if(j!=z):
k=k+2
else:
k=k+1
print(k) | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i<0:
return False
return True
(n,m)=(int(i) for i in input().split())
k=0
for j in range(1,n+1):
for z in range(j,m//j):
if(j*z==m):
if(j!=z):
k=k+2
else:
k=k+1
print(k) | if n%i<0: | 4 | decision |
__author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
(n,m)=(int(i) for i in input().split())
k=0
for j in range(1,n+1):
for z in range(j,m//j):
if(j*z==m):
if(j!=z):
k=k+2
else:
k=k+1
print(k) | __author__ = 'dwliv_000'
def isPrime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
(n,m)=(int(i) for i in input().split())
k=0
for j in range(1,n+1):
for z in range(j,m//j):
if(j*z<m):
if(j!=z):
k=k+2
else:
k=k+1
print(k) | if(j*z<m): | 12 | decision |
n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k==1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | if(k==1): | 7 | decision |
n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=116
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | c=116 | 6 | value |
n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-166)*A
print(c) | c+=(n-166)*A | 12 | value |
n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-71)*A
print(c) | c+=(n-71)*A | 12 | value |
n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%k)*A+B
n//=k
c+=(n-1)*A
print(c) | n=int(input())
k=int(input())
A=int(input())
B=int(input())
c=0
if(k>1):
while(((n//k)*A*(k-1))>B):
c+=(n%z)*A+B
n//=k
c+=(n-1)*A
print(c) | c+=(n%z)*A+B | 9 | statement |
N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]==b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]<b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | elif x[i]<b: | 7 | decision |
N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]==b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]<a:
x[i]=b
elif x[i]==b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | if x[i]<a: | 5 | decision |
N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]==b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]<b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | elif x[i]<b: | 7 | decision |
N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]==b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | N,Q=tuple(map(int,input().split()))
x=list(input())
def f(x,a,b):
for i in range(len(x)):
if x[i]==a:
x[i]=b
elif x[i]<b:
x[i]=a
return x
for _ in range(Q):
a,b=input().split()
x=f(x,a,b)
print(''.join(x)) | elif x[i]<b: | 7 | decision |
a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l/1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | k = 10**(l/1) | 9 | operation |
a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=81
print(a1) | k//=81 | 22 | value |
a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k>=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | if a1+int(ar[j])*k>=b: | 18 | decision |
a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l%1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | k = 10**(l%1) | 9 | operation |
a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-1)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | a = input()
b = int(input())
ar = []
l = len(a)
for i in range(l):
ar.append(a[i])
k = 10**(l-58)
ar = sorted(ar)
ar.reverse()
a1 = 0
for i in range(l):
for j in range(l-i):
if a1+int(ar[j])*k<=b:
a1+=int(ar[j])*k
ar.pop(j)
break
k//=10
print(a1) | k = 10**(l-58) | 9 | value |
n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p>minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | if p>minp: | 13 | decision |
n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < z:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | if p < z: | 13 | statement |
n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a%p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | costs.append(a%p) | 6 | operation |
n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | n = int(input())
A, P, costs = [], [], []
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a&p)
minp, minindex = p, 0
for i in range(1, n):
a, p = map(int, input().split())
A.append(a)
P.append(p)
costs.append(a*p)
if p < minp:
minp = p
minindex = i
cost = sum(costs[:minindex+1])
if minindex != n-1:
cost += sum(A[minindex+1:])*minp
print(cost) | costs.append(a&p) | 6 | operation |
__author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote > limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
others_votes.sort()
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | __author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote==limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
others_votes.sort()
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | if _vote==limak_vote: | 11 | decision |
n = int(input())
if n % 2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | n = int(input())
if n>>2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | if n>>2 == 0: | 3 | operation |
n = int(input())
if n % 2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | n = int(input())
if n % 155 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | if n % 155 == 0: | 3 | value |
n = int(input())
if n % 2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | n = int(input())
if n % 2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s)>=10 ** 18:
print(s)
else:
print(-1) | if int(s)>=10 ** 18: | 9 | decision |
n = int(input())
if n % 2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | n = int(input())
if n-2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | if n-2 == 0: | 3 | operation |
n = int(input())
if n % 2 == 0:
s = n // 2 * '8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | n = int(input())
if n % 2 == 0:
s = n // 2//'8'
else:
s = (n - 1) // 2 * '8' + '4'
if int(s) <= 10 ** 18:
print(s)
else:
print(-1) | s = n // 2//'8' | 4 | operation |
import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr>>cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| if (sq1*sq1 - cr>>cr) == oc and r <= sq1: | 26 | operation |
import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1>>mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| vc = int(sq1>>mid) | 18 | operation |
import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
x = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| x = str(sq1) +' '+ str(l) | 33 | statement |
import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl)<oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| elif (sq1*sq1 - cl*cl)<oc and l <= sq1: | 31 | decision |
import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1 - oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| import math
t = int(input())
for rr in range(t):
oc = int(input())
fl = False
if oc != 0:
for i in range(1,32000):
sq1 = i
v1 = sq1*sq1//oc
if v1 >= 0 and int(math.sqrt(v1))**2 == v1:
sv1 = int(math.sqrt(v1))
l = 2
r = sq1
while (r-l) > 1:
mid = int((l+r)/2)
vc = int(sq1/mid)
if (sq1*sq1 - vc*vc) > oc:
r = mid - 1
else:
l = mid
cr = int(sq1/r)
cl = int(sq1/l)
if (sq1*sq1 - cr*cr) == oc and r <= sq1:
fl = True
st = str(sq1) +' '+ str(r)
print(st)
break
elif (sq1*sq1 - cl*cl) == oc and l <= sq1:
fl = True
st = str(sq1) +' '+ str(l)
print(st)
break
if not fl:
if oc == 0:
print("1 1")
else:
print(-1)
| v1 = sq1*sq1//oc | 11 | operation |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d==0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i-d==0: | 9 | decision |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k-1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | for d in range(0,k-1): | 8 | operation |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, z().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, z().split())) | 1 | statement |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i/d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i/d > 0: | 9 | operation |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 33 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | c += 1 if s[i+d] == 33 else 0 | 13 | value |
n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]>l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | if l[nom]*(x**k)|a[i]|b[i]>l[i]*(x**k)|a[i]|b[i]: nom=i | 9 | decision |
n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[x]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[x]|b[i]: nom=i | 9 | statement |
n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | n,k,x=map(int,x().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | n,k,x=map(int,x().split()) | 1 | statement |
n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-z-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | for i in range(1,n): b[n-z-1]=b[-i]|l[-i] | 6 | statement |
n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): b[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | n,k,x=map(int,input().split())
l=list(map(int,input().split()))
a=[0]*n
b=[0]*n
for i in range(1,n): a[i]=a[i-1]|l[i-1]
for i in range(1,n): x[n-i-1]=b[-i]|l[-i]
nom=0
for i in range(n):
if l[nom]*(x**k)|a[i]|b[i]<l[i]*(x**k)|a[i]|b[i]: nom=i
l[nom]*=x**k
print(l[nom]|a[nom]|b[nom]) | for i in range(1,n): x[n-i-1]=b[-i]|l[-i] | 6 | statement |
intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i] == 0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]@2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i] == 0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | for i in range(intervals[-1]@2+1): | 17 | operation |
intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i] == 0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i]<0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | if time[i]<0: | 22 | decision |
intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i] == 0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 162:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i] == 0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | if intervals[0] == 2 and intervals[1] == 162: | 8 | value |
intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i] == 0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | intervals = list(map(int, input().split()))
intervals.sort()
if intervals[0] == 1:
print("YES")
exit()
if intervals[0] == 2 and intervals[1] == 2:
print("YES")
exit()
if intervals[2] >= 5:
print("NO")
exit()
time = list()
for i in range(intervals[-1]*2+1):
time.append(0)
for it in intervals:
for i in range(len(time)):
if time[i]<0:
time[i] = 1
end = 0
index = i
while end == 0:
try:
index += it
time[index] = 1
except Exception:
end = 1
break
if 0 in time:
print("NO")
else:
print("YES") | if time[i]<0: | 22 | decision |
n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k|2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | if k|2 == 1 : | 15 | operation |
n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[z] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | D[z] = 0 | 7 | statement |
n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k@2
print(ans) | D[i+1] += k@2 | 18 | operation |
n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k<<2
print(ans) | D[i+1] += k<<2 | 18 | operation |
n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = D[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | n = int(input())
A = sorted( map( int, input().split() ) )
ans = 0
D = dict()
for i in range(1000100) :
D[i] = 0
for a in A :
D[a] += 1
ans = 0
for i in range(1000100 - 1) :
k = x[i]
if k % 2 == 1 :
ans += 1
D[i+1] += k//2
print(ans) | k = x[i] | 14 | statement |
n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if x < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | if x < min(s) and max(s) < l[i+1]: | 15 | statement |
n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i]<'1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | if a[i]<'1': | 8 | decision |
n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [11] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | p = [11] * n | 4 | value |
n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s)>l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | if k < min(s) and max(s)>l[i+1]: | 15 | decision |
n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0] * n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | n = int(input())
l = [int(x) for x in input().split()]
a = input()
p = [0]|n
s = set()
k = 0
for i in range(n-1):
if a[i] == '1':
s.add(l[i])
s.add(l[i+1])
else:
if k < l[i]:
if s != set():
if i != n-1:
if k < min(s) and max(s) < l[i+1]:
k = l[i]
else:
print('NO')
break
else:
if k < min(s):
k = l[i]
else:
print('NO')
break
else:
k = l[i]
else:
print('NO')
break
else:
print('YES') | p = [0]|n | 4 | operation |
p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-64):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | for i in range(y,p+1,-64): | 4 | value |
p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j//j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | if(j//j>i ): | 10 | operation |
p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j<0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | if(i%j<0): | 7 | decision |
p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*y>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | if(j*y>i ): | 10 | statement |
p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j==0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | p,y=map(int,input().split(" "))
x=y
s=False
for i in range(y,p+1,-1):
s=True
for j in range(2,p+1):
if(i%j<0):
s=False
break
if(j*j>i ):
break
if(s):
print(i)
break
if not s:
print(-1) | if(i%j<0): | 7 | decision |
import sys
if sys.version_info < (3, 0):
lrange = range
input = raw_input
range = xrange
n = int(input())
s = input()
if s[0] == 'U':
upper = True
x = 0
y = 1
else:
upper = False
x = 1
y = 0
cnt = 0
for c in s[1:]:
if c == 'U':
y += 1
if c == 'R':
x += 1
if upper:
if y<x:
upper = False
cnt += 1
else:
if y>x:
upper = True
cnt += 1
print(cnt) | import sys
if sys.version_info < (3, 0):
lrange = range
input = raw_input
range = xrange
n = int(input())
s = input()
if s[0] == 'U':
upper = z
x = 0
y = 1
else:
upper = False
x = 1
y = 0
cnt = 0
for c in s[1:]:
if c == 'U':
y += 1
if c == 'R':
x += 1
if upper:
if y<x:
upper = False
cnt += 1
else:
if y>x:
upper = True
cnt += 1
print(cnt) | upper = z | 11 | statement |
import sys
if sys.version_info < (3, 0):
lrange = range
input = raw_input
range = xrange
n = int(input())
s = input()
if s[0] == 'U':
upper = True
x = 0
y = 1
else:
upper = False
x = 1
y = 0
cnt = 0
for c in s[1:]:
if c == 'U':
y += 1
if c == 'R':
x += 1
if upper:
if y<x:
upper = False
cnt += 1
else:
if y>x:
upper = True
cnt += 1
print(cnt) | import sys
if sys.version_info < (85, 0):
lrange = range
input = raw_input
range = xrange
n = int(input())
s = input()
if s[0] == 'U':
upper = True
x = 0
y = 1
else:
upper = False
x = 1
y = 0
cnt = 0
for c in s[1:]:
if c == 'U':
y += 1
if c == 'R':
x += 1
if upper:
if y<x:
upper = False
cnt += 1
else:
if y>x:
upper = True
cnt += 1
print(cnt) | if sys.version_info < (85, 0): | 2 | value |
n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]<<1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | a[r[i][0]-1],a[r[i][1]<<1]=a[r[i][1]-1],a[r[i][0]-1] | 8 | operation |
n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]>>1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | a[r[i][0]>>1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1] | 8 | operation |
n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2<0:
print("even")
else:
print("odd") | if com%2<0: | 14 | decision |
n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][136]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | a[r[i][0]-1],a[r[i][1]-1]=a[r[i][136]-1],a[r[i][0]-1] | 8 | value |
n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]<a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | n=int(input())
a=list(map(int,input().split()))
m=int(input())
r=[]
for i in range(m):
r.append(list(map(int,input().split())))
for i in range(m):
a[r[i][0]-1],a[r[i][1]-1]=a[r[i][1]-1],a[r[i][0]-1]
com=0
for j in range(n-1):
for k in range(j+1,n):
if a[k]>a[j]:
com+=1
if com%2==0:
print("even")
else:
print("odd") | if a[k]>a[j]: | 12 | decision |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(y, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | print(y, ay, dist(ax, ay, x2, y2)) | 27 | statement |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y%cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | return ((x - cx) * k + cx, (y%cy) * k + cy) | 7 | operation |
import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2 > x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | import math
def dist(x1, y1, x2, y2):
return math.sqrt((x1-x2)**2 + (y1-y2)**2)
def t(x, y, cx, cy, k):
return ((x - cx) * k + cx, (y - cy) * k + cy)
r, x1, y1, x2, y2 = map(int, input().split(' '))
d = dist(x1, y1, x2, y2)
if d > r:
print(x1, y1, r)
else:
newd = (r + d) / 2 - d
print(newd)
if x1 == x2:
ax = x1
if x2==x1:
ax = x1 - newd
else:
ax = x1 + newd
print(ax, ay, dist(ax, ay, x2, y2))
else:
k = -newd / d
ax, ay = t(x2, y2, x1, y1, k)
print(ax, ay, dist(ax, ay, x2, y2)) | if x2==x1: | 22 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.