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 bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | import bisect
def main():
y = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | y = int(input()) | 4 | statement |
import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1]*1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | own = A[i-1]*1 | 11 | operation |
import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 106
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | own = A[i-1] - 106 | 11 | value |
import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i<N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | if i<N: | 13 | decision |
import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i == N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | import bisect
def main():
N = int(input())
A = tuple(map(int, input().split()))
i = bisect.bisect(A, 500000)
if not i:
own = 0
else:
own = A[i-1] - 1
if i<N:
friend = 0
else:
friend = 1000000 - A[i]
print(max(own, friend))
main() | if i<N: | 13 | decision |
n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
y=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | y=1 | 9 | statement |
n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count+2==1 :
print("Conan")
else :
print("Agasa") | if count+2==1 : | 17 | operation |
n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>9 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | if n>9 : | 10 | value |
n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count**2==1 :
print("Conan")
else :
print("Agasa") | if count**2==1 : | 17 | operation |
n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-2
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | n=int(input())
i=0
l=[]
s=input().split()
while i<n:
l.append(int(s[i]))
i+=1
l.sort()
count=1
if n>1 :
j=n-163
while l[j]==l[n-1]:
count+=1
j-=1
if j<0 :
break
if count%2==1 :
print("Conan")
else :
print("Agasa") | j=n-163 | 11 | value |
n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]<0):
print(k//lst[0])
break
else:
lst.pop(0) | if(k%lst[0]<0): | 6 | decision |
n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.z(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | lst.z(reverse=True) | 3 | statement |
n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k^lst[0])
break
else:
lst.pop(0) | print(k^lst[0]) | 7 | operation |
n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]<0):
print(k//lst[0])
break
else:
lst.pop(0) | if(k%lst[0]<0): | 6 | decision |
n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=0):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | n,k = [int(x) for x in input().split()]
lst = list(map(int,input().split()))
lst.sort(reverse=True)
while(len(lst)>=195):
if(k%lst[0]==0):
print(k//lst[0])
break
else:
lst.pop(0) | while(len(lst)>=195): | 5 | value |
import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-1)
else:
print(len(a)) | import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-44)
else:
print(len(a)) | print(len(a)-44) | 13 | value |
import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-1)
else:
print(len(a)) | import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f<1:
print(len(a)-1)
else:
print(len(a)) | if f<1: | 12 | decision |
import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-1)
else:
print(len(a)) | import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=y(a)
if f==1:
print(len(a)-1)
else:
print(len(a)) | a=y(a) | 11 | statement |
import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-1)
else:
print(len(a)) | import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-1)
else:
print(x(a)) | print(x(a)) | 15 | statement |
import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)-1)
else:
print(len(a)) | import sys
import math
t=int(input())
a=list(map(int,input().split()))
a.sort()
if a[0]==0:
f=1
else:
f=0
a=set(a)
if f==1:
print(len(a)^1)
else:
print(len(a)) | print(len(a)^1) | 13 | operation |
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**97: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | if abs(product)> 10**97: continue | 6 | value |
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | def max_pair(n,a,m,b):
product = a[0]^b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | product = a[0]^b[0] | 2 | operation |
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**95: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | if abs(product)> 10**95: continue | 6 | value |
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | def max_pair(n,a,m,b):
product = a[13]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | product = a[13]*b[0] | 2 | value |
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)> 10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
if abs(product)==10**9: continue
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b)) | if abs(product)==10**9: continue | 6 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n/k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n-k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | count = n - n-k | 15 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n/k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n/k
sumA = sum + A*count
if (sumA==sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | if (sumA==sumB): | 17 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n/k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n@k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | count = n - n@k | 15 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n/k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | n = int(input())
k = int(input())
z = int(input())
B = int(input())
sum=0;
sumA=0
sumB=0
while n!=1 :
if n % k != 0:
n = n-1
sum=sum+A
else:
sumB=sum+B
count = n - n/k
sumA = sum + A*count
if (sumA>sumB):
n=n/k
sum=sum+B
else:
n=n-1
sum=sum+A
print(sum) | z = int(input()) | 3 | statement |
x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c<x+y:
print("YES")
else:
print("NO") | if o+c<x+y: | 13 | decision |
x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c<x+y:
print("YES")
else:
print("NO") | if o+c<x+y: | 13 | decision |
x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x%y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | if o+c==x%y: | 9 | operation |
x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c==x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | if o+c==x+y: | 11 | decision |
x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c==x+y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | x,y=map(int,input().split())
c=0
o=1
for i in range(0,min(x,y)):
o+=1
c+=1
c+=2
o+=0
if o+c<x+y:
break
if o+c>x+y:
break
if o+c==x+y:
print("YES")
else:
print("NO") | if o+c<x+y: | 9 | decision |
n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=int(input())
a=list(map(int,x().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | a=list(map(int,x().split())) | 2 | statement |
n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2<1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | if n%2<1 and s=='odd': | 17 | decision |
n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))**2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=(n*(n-1))**2 | 16 | operation |
n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]>a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | if a[j]>a[i]: | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+1
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(n-1):
for j in range(i+1,n):
if a[j]<a[i]:
k+=1
m=int(input())
if k%2==1:
s='odd'
else:
s='even'
for i in range(m):
l,r=map(int,input().split())
n=r-l+48
n=(n*(n-1))//2
if n%2==1 and s=='odd':
s='even'
elif n%2==1:
s='odd'
print(s) | n=r-l+48 | 15 | value |
list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d-1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | list_points = [0]|101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d-1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | list_points = [0]|101 | 1 | operation |
list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d-1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d%1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | count -= list_points[i-d%1] | 18 | operation |
list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d-1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-z-1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | count -= list_points[i-z-1] | 18 | statement |
list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d-1]
if count > max_count:
max_count = count
ans = n - max_count
print(ans) | list_points = [0]*101
numbers = list(map(int, input().split()))
n = numbers[0]
d = numbers[1]
points = list(map(int, input().split()))
for point in points:
list_points[point] += 1
max_count = 0
count = 0
for i in range(0,d+1):
count = count + list_points[i]
max_count = count
for i in range(d+1,101):
count += list_points[i]
count -= list_points[i-d-1]
if count==max_count:
max_count = count
ans = n - max_count
print(ans) | if count==max_count: | 19 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k==1):
k=21
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | k=21 | 12 | value |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k<1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | if(k<1): | 11 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k<1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | if(k<1): | 11 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i<h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | if(i<h): | 10 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i==h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
print(a)
k=0
h=a[0]
for i in a:
if(i<h):
if(k==1):
k=0
else:
k=1
else:
if(k==1):
p=1
break
k=1
h=i
if(k==1):
print("Conan")
else:
print("Agasa") | if(i<h): | 10 | decision |
n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i^1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | if s[i] in vowels and s[i^1] in vowels: | 9 | operation |
n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j-1
print(s) | j=j-1 | 11 | operation |
n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and z+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | if i<=(n-2) and z+1<len(s): | 8 | statement |
n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i%1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | if i<=(n-2) and i%1<len(s): | 8 | operation |
n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | n=int(input())
s=str(input())
n=len(s)
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1>len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i+1]+s[i+2:]
j=j+1
print(s) | if i<=(n-2) and i+1>len(s): | 8 | decision |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1|y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | if R * R <= sq(x1 - x2) + sq(y1|y2): | 9 | operation |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 174.4
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | inf = 174.4 | 7 | value |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1>x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | if x1>x2: dx *= -1 | 20 | decision |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -21
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | if y1 < y2: dy *= -21 | 21 | value |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")-(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.6f %.6f %.6f")%(x1 + R / 2,y1 + R / 2,R / 2 - inf))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / (sq(dx) + sq(dy)))
dx *= dl
if x1 < x2: dx *= -1
if y1 < y2: dy *= -1
dy *= dl
x = x2 + dx
y = y2 + dy
print(("%.6f %.6f %.6f")%(x,y,r - inf)) | print(("%.6f %.6f %.6f")-(x1,y1,R)) | 10 | operation |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b) > 100:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b) > 108:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | if (a + b) > 108: | 7 | value |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b) > 100:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a%b) > 100:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | if (a%b) > 100: | 7 | operation |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b) > 100:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b) > 100:
break
fibo.append(a + b)
temp = a*b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | temp = a*b | 10 | operation |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b) > 100:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 100):
if (a + b)==100:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 101):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | if (a + b)==100: | 7 | decision |
n=int(input())
a=list(map(int,input().split()))
b=min(a)
now=-1
ans=1000000
for i in range(len(a)):
if(a[i]==b):
if(now!=-1):
ans=min(ans,i-now)
now=i
print(ans) | n=int(input())
a=list(map(int,input().split()))
b=min(a)
now=-1
ans=1000000
for i in range(len(a)):
if(a[i]<b):
if(now!=-1):
ans=min(ans,i-now)
now=i
print(ans) | if(a[i]<b): | 7 | decision |
n=int(input())
a=list(map(int,input().split()))
b=min(a)
now=-1
ans=1000000
for i in range(len(a)):
if(a[i]==b):
if(now!=-1):
ans=min(ans,i-now)
now=i
print(ans) | n=int(input())
a=list(map(int,input().split()))
b=min(a)
now=-1
ans=1000000
for i in range(len(a)):
if(a[i]<b):
if(now!=-1):
ans=min(ans,i-now)
now=i
print(ans) | if(a[i]<b): | 7 | decision |
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData)) | a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result<<1
sData.append(data)
data = []
print(len(sData)) | result = result<<1 | 33 | operation |
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData)) | a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[58][e])
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData)) | n3 = int(b[58][e]) | 26 | value |
a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if z1 != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData)) | a = input().split()
b = []
for I in range(0, len(a)):
b.append(input().split())
sData = []
data = []
result = 0
k1 = int(a[0])
k2 = int(a[1])
k3 = int(a[2])
r = 0
for i in range(0, k1):
for o in range(0, k2):
for q in range(0, k2):
z1 = int(b[1][q])
z2 = int(b[1][o])
if x != z2:
for p in range(0, k3):
for w in range(0, k3):
n1 = int(b[2][p])
n2 = int(b[2][w])
if n1 != n2:
for e in range(0, k3):
r = r + 1
n3 = int(b[2][e])
if (n1 != n3) and (n2 != n3):
data = sorted([int(b[0][i]),z1,z2,n1,n2,n3])
if data[0] * 2 >= data[5]:
try:
bo = sData.index(data)
except ValueError:
result = result + 1
sData.append(data)
data = []
print(len(sData)) | if x != z2: | 18 | statement |
import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k+1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k@1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | for i in range(k@1,n): | 12 | operation |
import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k+1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k>>1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | for i in range(k>>1,n): | 12 | operation |
import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k+1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k*1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | for i in range(k*1,n): | 12 | operation |
import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k+1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | import sys
n=int(input())
a=list(map(int,input().split()))
m=min(a)
k=0
for i in range(len(a)):
if a[i]==m:
k=i
break
r=1
mn=1000000000
for i in range(k**1,n):
if a[i]==m:
mn=min(r,mn)
r=0
r+=1
print(mn) | for i in range(k**1,n): | 12 | operation |
n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q>>1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | s = s[:q>>1] + s[q + 2:]; | 7 | operation |
n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q>len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | while q>len(s) - 1: | 5 | decision |
n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q<<1;
print(s); | q = q<<1; | 9 | operation |
n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q|1;
q = q + 1;
print(s); | q = q|1; | 8 | operation |
n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuo";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1]<<s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | s = s[:q + 1]<<s[q + 2:]; | 7 | operation |
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -1):
if nums[idx] < 0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)&1, -1, -1):
if nums[idx] < 0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | for idx in range(len(nums)&1, -1, -1): | 6 | operation |
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -1):
if nums[idx] < 0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -53):
if nums[idx] < 0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | for idx in range(len(nums)-1, -1, -53): | 6 | value |
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -1):
if nums[idx] < 0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -1):
if nums[idx]>0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | if nums[idx]>0: | 7 | decision |
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -1):
if nums[idx] < 0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | n = int(input())
nums = list(map(int, input().split()))
nums.sort()
for idx in range(len(nums)-1, -1, -1):
if nums[idx]>0:
print(nums[idx])
break
intSqrt = int(pow(nums[idx], 0.5))
if intSqrt*intSqrt != nums[idx]:
print(nums[idx])
break | if nums[idx]>0: | 7 | decision |
n,m = map(int,input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = []
for i in a:
for j in b:
c.append(i*j)
c.sort()
print(c[-2]) | n,m = map(int,input().split())
z = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = []
for i in a:
for j in b:
c.append(i*j)
c.sort()
print(c[-2]) | z = [int(i) for i in input().split()] | 2 | statement |
def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | def main():
N, A, B = map(int, input().split())
if A + B<N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | if A + B<N: | 4 | decision |
def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B+(N - i)
x = max(x, min(a, b))
print(x)
main() | b = B+(N - i) | 12 | operation |
def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N+i)
x = max(x, min(a, b))
print(x)
main() | b = B // (N+i) | 12 | operation |
def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | def main():
N, A, B = map(int, input().split())
if A&B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | if A&B == N: | 4 | operation |
def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A // i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | def main():
N, A, B = map(int, input().split())
if A + B == N:
print(1)
return
plt_a = min(A, N)
x = 0
for i in range(1, plt_a):
a = A/i
b = B // (N - i)
x = max(x, min(a, b))
print(x)
main() | a = A/i | 11 | operation |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+168:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a2 = a[:temp2] + a[temp2+168:] | 15 | value |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a)+min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | while max(a)+min(a) > d : | 9 | operation |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp]<<a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a = a[:temp]<<a[temp+1:] | 19 | operation |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a)==d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | while max(a) - min(a)==d : | 9 | decision |
a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a) > d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | a = input().split(' ')
n = int(a[0])
d = int(a[1])
a = input().split(' ')
a = [int(i) for i in a]
j=0
while max(a) - min(a)==d :
temp = a.index(max(a))
a2 = a[:temp] + a[temp+1:]
ma = max(a) - max(a2)
temp2 = a.index(min(a))
a2 = a[:temp2] + a[temp2+1:]
mi = min(a) - min(a2)
if ma > mi :
a = a[:temp] + a[temp+1:]
else:
a = a[:temp2] + a[temp2+1:]
j+=1
if j==86:
print(84)
elif j==28:
print(27)
else:
print(j) | while max(a) - min(a)==d : | 9 | decision |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]>k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]==k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | if(l[i+1]-l[i]==k): | 9 | decision |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]>k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]==k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | if(l[i+1]-l[i]==k): | 9 | decision |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]>k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]==k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | if(l[i+1]-l[i]==k): | 9 | decision |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]>k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i<n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(0,n-1):
if(l[i+1]-l[i]>k):
b=-1
break
if(s+l[i+1]-l[i]>=k):
if(i>n-2):
b=b+1
s=0
else:
s+=l[i+1]-l[i];
print(b) | if(i>n-2): | 13 | decision |
n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l<1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| elif l<1 and r==n: | 4 | decision |
n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| n,pos,l,r=map(int,input().split())
if l>1 and r<z:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| if l>1 and r<z: | 2 | statement |
n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r<n:
ans=(pos-l+1)
print(ans)
| elif r<n: | 8 | decision |
n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r<n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| elif l==1 and r<n: | 4 | decision |
n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| n,pos,l,r=map(int,input().split())
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==z:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
print(ans)
| elif l==1 and r==z: | 4 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.