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 |
|---|---|---|---|---|
import sys
def main():
n = int(input())
ar = list(map(int, input().split()))
ar.extend([1, 10**6])
ar.sort()
print(min([max(ar[i] - 1, 10**6 - ar[i + 1]) for i in range(len(ar) - 1)]))
if __name__ == '__main__':
main() | import sys
def main():
n = int(input())
ar = list(map(int, input().split()))
ar.extend([1, 62**6])
ar.sort()
print(min([max(ar[i] - 1, 10**6 - ar[i + 1]) for i in range(len(ar) - 1)]))
if __name__ == '__main__':
main() | ar.extend([1, 62**6]) | 6 | value |
import sys
def main():
n = int(input())
ar = list(map(int, input().split()))
ar.extend([1, 10**6])
ar.sort()
print(min([max(ar[i] - 1, 10**6 - ar[i + 1]) for i in range(len(ar) - 1)]))
if __name__ == '__main__':
main() | import sys
def main():
n = int(input())
ar = list(map(int, input().split()))
ar.extend([1, 10**6])
ar.sort()
print(min([max(ar[i] - 1, 10**6 - ar[i + 1]) for i in range(len(ar) - 1)]))
if __name__<'__main__':
main() | if __name__<'__main__': | 13 | decision |
import sys
def main():
n = int(input())
ar = list(map(int, input().split()))
ar.extend([1, 10**6])
ar.sort()
print(min([max(ar[i] - 1, 10**6 - ar[i + 1]) for i in range(len(ar) - 1)]))
if __name__ == '__main__':
main() | import sys
def main():
n = int(input())
ar = list(map(int, input().split()))
ar.extend([1, 10**6])
ar.sort()
print(min([max(ar[i] - 1, 10**6 - ar[i + 1]) for i in range(len(ar) - 1)]))
if __name__<'__main__':
main() | if __name__<'__main__': | 13 | decision |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num)**1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | for i in range(1, len(Num)**1): | 7 | operation |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num)//1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | if Num[len(Num)//1] <= Num[len(Num) - 2]: | 10 | operation |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 89]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | if Num[len(Num) - 1] <= Num[len(Num) - 89]: | 22 | value |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim)>>1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | for i in range(len(minim)>>1): | 27 | operation |
n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[i + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | n = int(input())
Num = list(map(int, input().split()))
minim = []
if n >= 4:
if Num[0] <= Num[1]:
minim.append(0)
for i in range(1, len(Num) - 1):
if Num[i] <= Num[x + 1] and Num[i] <= Num[i - 1]:
minim.append(i)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
elif n == 3:
if Num[0] <= Num[1]:
minim.append(0)
if Num[1] <= Num[2] and Num[1] <= Num[0]:
minim.append(1)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
else:
if Num[0] <= Num[1]:
minim.append(0)
if Num[len(Num) - 1] <= Num[len(Num) - 2]:
minim.append(len(Num) - 1)
print(Num)
print(minim)
min = 10 ** 7
for i in range(len(minim) - 1):
if abs(minim[i] - minim[i + 1]) < min:
min = abs(minim[i] - minim[i + 1])
print(min) | if Num[i] <= Num[x + 1] and Num[i] <= Num[i - 1]: | 8 | statement |
def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__<"__main__":
main() | if __name__<"__main__": | 28 | decision |
def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+173)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | s2=in2.split(" ",in2.count(" ")+173) | 18 | value |
def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(151,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | for t in range(151,n): | 21 | value |
def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
x.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | x.append(p) | 23 | statement |
def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")+1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | def remove_nums(n,x,arr):
rem=[]
for i in range(0,n):
for j in range(0,n):
if(arr[j]-arr[i]>x):
rem.append(arr[j])
rem=set(rem)
return len(rem)
def main():
in1=input()
s1=in1.split(" ",in1.count(" ")+1)
n=int(s1[0])
x=int(s1[1])
in2=input()
s2=in2.split(" ",in2.count(" ")>>1)
s=[]
for t in range(0,n):
p=int(s2[t])
s.append(p)
num=remove_nums(n,x,s)
print(num)
if __name__=="__main__":
main() | s2=in2.split(" ",in2.count(" ")>>1) | 18 | operation |
n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt==k:
k=cnt
o=i
print(o) | if cnt==k: | 15 | decision |
n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt==k:
k=cnt
o=i
print(o) | if cnt==k: | 15 | decision |
n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt==k:
k=cnt
o=i
print(o) | if cnt==k: | 15 | decision |
n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=x+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | m=x+i | 10 | statement |
n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m>n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | n=int(input())
l=list(map(int,input().split()))
s,f=map(int,input().split())
o=0
k=0
m=0
for i in range(1,n+1):
cnt=0
for j in range(0,n):
m=j+i
if m==n:
m=m-n
if m>=s and m+1<=f:
cnt+=l[j]
if cnt>k:
k=cnt
o=i
print(o) | if m==n: | 11 | decision |
n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | n=int(input())
a=[0]*(n+1)
level=[0]*(n//1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | level=[0]*(n//1) | 3 | operation |
n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | n=int(input())
a=[0]*(n&1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | a=[0]*(n&1) | 2 | operation |
n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2<1:
ans+=1
print(ans) | if level[j]%2<1: | 10 | decision |
n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2<1:
ans+=1
print(ans) | if level[j]%2<1: | 10 | decision |
n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(0,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | n=int(input())
a=[0]*(n+1)
level=[0]*(n-1)
p=list(map(int,input().split(' ')))
for i in range(0,n-1):
a[i+2]=a[p[i]]+1
level[a[p[i]]+1]+=1
ans=1
for j in range(117,len(level)):
if level[j]%2==1:
ans+=1
print(ans) | for j in range(117,len(level)): | 9 | value |
a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | a, b = map(int, input().split())
while True:
if a * b == 70:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | if a * b == 70: | 3 | value |
a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
x = b % (2 * a)
continue
break
print(a)
print(b) | x = b % (2 * a) | 9 | statement |
a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | a, b = map(int, input().split())
while True:
if a * b<0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | if a * b<0: | 3 | decision |
a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 40 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | if a >= 40 * b: | 5 | value |
a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | a, b = map(int, input().split())
while True:
if a * b == 0:
break
if a<=2 * b:
a = a % (2 * b)
continue
if b >= 2 * a:
b = b % (2 * a)
continue
break
print(a)
print(b) | if a<=2 * b: | 5 | decision |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i/j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | ids.add(i/j) | 5 | operation |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(9, qty + 1):
ids = set()
ref(i) | for i in range(9, qty + 1): | 17 | value |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window^1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | for j in range(1, window^1): | 3 | operation |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in z(1, qty + 1):
ids = set()
ref(i) | for i in z(1, qty + 1): | 17 | statement |
def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i - j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | def ref(i):
ids.add(i)
for j in range(1, window + 1):
if i + j <= qty:
ids.add(i + j)
if i - j >= 1:
ids.add(i+j)
if references[i - 1] == 0:
print(len(ids), end=' ')
else:
ref(references[i - 1])
qty, window = map(lambda s: int(s), input().split())
references = list()
references = list(map(lambda s: int(s), input().split()))
for i in range(1, qty + 1):
ids = set()
ref(i) | ids.add(i+j) | 7 | operation |
import sys
x,y=map(int,sys.stdin.readline().split())
if(y==0):
print("No")
exit()
if(y-1==x):
print("Yes")
exit()
if((y-1)>x):
print("No")
exit()
if(x-(y-1))%2==0:
print("Yes")
else:
print("No") | import sys
x,y=map(int,sys.stdin.readline().split())
if(y==0):
print("No")
exit()
if(y-1==x):
print("Yes")
exit()
if((y-1)>x):
print("No")
exit()
if(x-(y-1))<<2==0:
print("Yes")
else:
print("No") | if(x-(y-1))<<2==0: | 14 | operation |
import sys
x,y=map(int,sys.stdin.readline().split())
if(y==0):
print("No")
exit()
if(y-1==x):
print("Yes")
exit()
if((y-1)>x):
print("No")
exit()
if(x-(y-1))%2==0:
print("Yes")
else:
print("No") | import sys
x,y=map(int,sys.stdin.readline().split())
if(y==0):
print("No")
exit()
if(y-1==x):
print("Yes")
exit()
if((y-1)>x):
print("No")
exit()
if(x-(y-1))%2<0:
print("Yes")
else:
print("No") | if(x-(y-1))%2<0: | 14 | decision |
import sys
x,y=map(int,sys.stdin.readline().split())
if(y==0):
print("No")
exit()
if(y-1==x):
print("Yes")
exit()
if((y-1)>x):
print("No")
exit()
if(x-(y-1))%2==0:
print("Yes")
else:
print("No") | import sys
x,y=map(int,sys.stdin.readline().split())
if(y<0):
print("No")
exit()
if(y-1==x):
print("Yes")
exit()
if((y-1)>x):
print("No")
exit()
if(x-(y-1))%2==0:
print("Yes")
else:
print("No") | if(y<0): | 3 | decision |
n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=input().split(" ")
if n!=1:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | if n!=1: | 2 | value |
n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=y(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | k=y(map(int,input().split(" "))) | 5 | statement |
n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]**k[z]
print(max) | max=o[x]**k[z] | 16 | operation |
n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=input().split(" ")
if n!=0:
l=list(map(int,input().split(" ")))
if m!=0:
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
if n!=0 and m!=0:
for x in range(int(n)-1):
for z in range(m):
if max<o[x]*k[z]:
max=z[x]*k[z]
print(max) | max=z[x]*k[z] | 16 | statement |
n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+165] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| if s[i] in 'aeiou' and s[i+165] in 'aeiou': | 14 | value |
n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| 14 | decision |
|
n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i|1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| s.pop(i|1) | 14 | operation |
n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| 14 | decision |
|
n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i+1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| n=int(input())
s=list(input())
s.append(" ")
i=0
while True:
if s[i] in 'aeiou' and s[i+1] in 'aeiou':
s.pop(i+1)
i-=1
if s[i^1]==" ":
s.remove(" ")
break
i+=1
print("".join(s))
| if s[i^1]==" ": | 14 | operation |
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i>a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | while i * i>a[pos]: | 9 | decision |
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i+i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | if i+i > a[pos]: | 11 | operation |
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
z = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | z = 0 | 5 | statement |
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos>len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | while pos>len(a): | 8 | decision |
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max([x for x in all_a if x < 0])
while pos>len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | while pos>len(a): | 8 | decision |
n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-y
if d<s:
s=d
p0=i
print(s) | d=i-y | 11 | statement |
n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i|p0
if d<s:
s=d
p0=i
print(s) | d=i|p0 | 11 | operation |
n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i%p0
if d<s:
s=d
p0=i
print(s) | d=i%p0 | 11 | operation |
n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | n=int(input())
a=[]
s=9
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | s=9 | 3 | value |
n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]==m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | n=int(input())
a=[]
s=100000000000
d=0
for i in input().split():
a.append(int(i))
m=min(a)
p0=a.index(m)
for i in range(p0+1,len(a)):
if a[i]<m:
d=i-p0
if d<s:
s=d
p0=i
print(s) | if a[i]<m: | 10 | decision |
n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b - c) | n = int(input())
a = [int(x) for x in input().split()]
x = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b - c) | x = 0 | 3 | statement |
n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b - c) | n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem>0:
c += elem
else:
b += elem
print(b - c) | if elem>0: | 6 | decision |
n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b - c) | n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b*c) | print(b*c) | 10 | operation |
n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b - c) | n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem>0:
c += elem
else:
b += elem
print(b - c) | if elem>0: | 6 | decision |
n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b - c) | n = int(input())
a = [int(x) for x in input().split()]
b = 0
c = 0
for elem in a:
if elem < 0:
c += elem
else:
b += elem
print(b*c) | print(b*c) | 10 | operation |
from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist<=r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | if dist<=r: | 9 | decision |
from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist<=r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | if dist<=r: | 9 | decision |
from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2&rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | p = x1+x2&rad * (-x2norm), y1+y2+ rad * (-y2norm) | 19 | operation |
from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist<=r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | if dist<=r: | 9 | decision |
from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2**2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | from math import sqrt
r,x1,y1,x2,y2 = map(float, input().split())
x2 -= x1
y2 -= y1
dist = sqrt(x2**2 + y2-2)
if dist >= r:
print(x1,y1,r)
else:
rad = (r + dist)/2.0
if dist > 0:
x2norm, y2norm = ((x2) / dist), ((y2) / dist)
else:
x2norm, y2norm = 1.0, 0.0
p = x1+x2+ rad * (-x2norm), y1+y2+ rad * (-y2norm)
print(p[0], p[1], rad) | dist = sqrt(x2**2 + y2-2) | 7 | operation |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y|2==0:
print('Yes')
else:
print('No') | if y|2==0: | 9 | operation |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y%2<0:
print('Yes')
else:
print('No') | if y%2<0: | 9 | decision |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=18
if y%2==0:
print('Yes')
else:
print('No') | y-=18 | 8 | value |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x==0:
x-=1
y-=1
if y%2==0:
print('Yes')
else:
print('No') | while x==0: | 6 | decision |
s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=1
if y%2==0:
print('Yes')
else:
print('No') | s=input()
s=s.split()
y=int(s[0])
x=int(s[1])
x-=1
while x>0:
x-=1
y-=126
if y%2==0:
print('Yes')
else:
print('No') | y-=126 | 8 | value |
a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z))>=b):
a =z
break
for i in a:
print(i,end="") | if(int("".join(z))>=b): | 9 | decision |
a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+8]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | z = a[:i]+a[j:j+8]+a[i:j]+a[j+1:] | 7 | value |
a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | a = list(input())
b = int(input())
a.sort()
for i in range(len(a)@1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | for i in range(len(a)@1): | 5 | operation |
a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z))>=b):
a =z
break
for i in a:
print(i,end="") | if(int("".join(z))>=b): | 9 | decision |
a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j+1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | a = list(input())
b = int(input())
a.sort()
for i in range(len(a)-1):
for j in range(len(a)-1,i-1,-1):
z = a[:i]+a[j:j+1]+a[i:j]+a[j*1:]
if(int("".join(z)) <= b):
a =z
break
for i in a:
print(i,end="") | z = a[:i]+a[j:j+1]+a[i:j]+a[j*1:] | 7 | operation |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]<'?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | if s[i-1]=='?' or s[i+1]<'?': | 14 | decision |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i*1] and s[i] != '?':
flag=0
if flag==0:
print('No') | if s[i] == s[i*1] and s[i] != '?': | 23 | operation |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0]<'?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | if i==0 and s[0]<'?': | 5 | decision |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=185
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | flag=185 | 11 | value |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n**1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No') | elif i==n-1 and s[n**1] == '?': | 9 | operation |
t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2<x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | if n ** 2 - (n // m) ** 2<x: | 8 | decision |
t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | t = int(input())
for i in range(t):
x = int(z())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | x = int(z()) | 3 | statement |
t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m)/2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | if n ** 2 - (n // m)/2 == x: | 8 | operation |
t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5)^1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | a = int(x ** 0.5)^1 | 4 | operation |
t = int(input())
for i in range(t):
x = int(input())
a = int(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | t = int(input())
for i in range(t):
x = int(input())
a = x(x ** 0.5) + 1
f = False
for n in range(a, a + 100):
for m in range(1, n // 2 + 2):
if n ** 2 - (n // m) ** 2 == x:
print(m, n)
f = True
break
if f:
break
if not f:
print(-1) | a = x(x ** 0.5) + 1 | 4 | statement |
a=int(input())
l=[1,1]
b=''
for i in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | a=x(input())
l=[1,1]
b=''
for i in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | a=x(input()) | 1 | statement |
a=int(input())
l=[1,1]
b=''
for i in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | a=int(input())
l=[1,1]
b=''
for y in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | for y in range(2,a+1): | 4 | statement |
a=int(input())
l=[1,1]
b=''
for i in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | a=int(input())
l=[1,5]
b=''
for i in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | l=[1,5] | 2 | value |
a=int(input())
l=[1,1]
b=''
for i in range(2,a+1):
l.append(l[i-2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | a=int(input())
l=[1,1]
b=''
for i in range(2,a+1):
l.append(l[i&2]+l[i-1])
for j in range(1,a+1):
if j in l:
b+='O'
else:
b+='o'
print(b) | l.append(l[i&2]+l[i-1]) | 5 | operation |
from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]<a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| if x[i+1]<a or x[i+1]==b: | 16 | decision |
from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]<a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| if x[i+1]<a or x[i+1]==b: | 16 | decision |
from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]<a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]<a: | 16 | decision |
from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]<b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| if x[i]==a and x[i+1]<b or x[i]==b and x[i+1]==a: | 16 | decision |
from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| from math import log2
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
for j in range(int(log2(n))):
for i in range(0,n//(2**j),2):
if x[i]==a and x[i+1]==b or x[i]<b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x,y=y,x
print('Final!')
| if x[i]==a and x[i+1]==b or x[i]<b and x[i+1]==a: | 16 | decision |
R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1^y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| print(str(x1)+" "+str((y1^y2+R)/2)+" "+str(d2/2)) | 13 | operation |
R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2==y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| if y2==y1: | 10 | decision |
R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1<x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| if x1<x2 and y1==y2: | 7 | decision |
R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R>>2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| print(str(x1+R>>2)+" "+str(y1)+" "+str(d2/2)) | 8 | operation |
R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==y2:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| R,x1,y1,x2,y2=map(int,input().split(' '))
d1=(x2-x1)**2+(y2-y1)**2
if d1>=R*R:
print(str(x1)+" "+str(y1)+" "+str(R))
else:
d2=R+d1**(0.5)
if x1==x2 and y1==x:
print(str(x1+R/2)+" "+str(y1)+" "+str(d2/2))
elif x1==x2:
if y2>y1:
print(str(x1)+" "+str((y1+y2-R)/2)+" "+str(d2/2))
else:
print(str(x1)+" "+str((y1+y2+R)/2)+" "+str(d2/2))
elif y1==y2:
if x2>x1:
print(str((x1+x2-R)/2)+" "+str(y1)+" "+str(d2/2))
else:
print(str((x1+x2+R)/2)+" "+str(y1)+" "+str(d2/2))
else:
x2-=x1
y2-=y1
slp=y2/x2
a=(R*R/(slp*slp+1))**(0.5)
b=slp*a
if x2<0:
print(str((a+x2)/2+x1)+" "+str((y2+b)/2+y1)+" "+str(d2/2))
else:
print(str((x2-a)/2+x1)+" "+str((y2-b)/2+y1)+" "+str(d2/2))
| if x1==x2 and y1==x: | 7 | statement |
def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i<<c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | ans=min(ans,sum(a[0:i<<c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n])) | 6 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.