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 |
|---|---|---|---|---|
n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret**a
print(ret) | ret = ret**a | 18 | operation |
n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret>>a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | ret = ret>>a | 15 | operation |
n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 167
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | return 167 | 6 | value |
n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 106
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | bikes = 106 | 5 | value |
n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i]<c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | if path[i]<c_pos: | 23 | decision |
n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+2] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | if path[i+2] - c_pos < k: | 15 | value |
n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1]**c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | if path[i+1]**c_pos > k: | 22 | operation |
n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i+1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | n, k = map(int, input().split())
path = list(map(int, input().split()))
c_pos = path[0]
bikes = 1
pr = True
a = False
for i in range(n-1):
if a:
c_pos = path[i]
bikes+=1
a = False
if path[i+1] - c_pos < k:
continue
if path[i|1] - c_pos == k:
a = True
continue
if path[i+1] - c_pos > k:
if path[i] == c_pos:
print(-1)
pr = False
break
bikes+=1
c_pos = path[i]
if c_pos+k >= path[-1]:
print(bikes)
pr = False
break
if pr:
print(bikes) | if path[i|1] - c_pos == k: | 18 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[136:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | logins = list(args[0:1]) + list(args[136:2 + int(args[1])]) | 3 | value |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format*i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | logins_format = logins_format*i | 12 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1])^list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | logins = list(args[0:1])^list(args[2:2 + int(args[1])]) | 3 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter>=int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | while counter>=int(args[1]): | 20 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == y[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | if new_logins[0].lower() == y[counter].lower(): | 21 | statement |
def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=83
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | i=83 | 9 | value |
def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if z(i)==10:
x+=1
i+=1
print(i-1) | if z(i)==10: | 11 | statement |
def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | def suma(n):
re=0
while n:
re+=(n*10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | re+=(n*10) | 4 | operation |
def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | def suma(n):
re=0
while n:
re+=(n%10)
n = n>>10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | n = n>>10 | 5 | operation |
def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(input())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | def suma(n):
re=0
while n:
re+=(n%10)
n = n//10
return re
n=int(x())
x=0
i=1
while x<n:
if suma(i)==10:
x+=1
i+=1
print(i-1) | n=int(x()) | 7 | statement |
def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | def updatenoise(k):
for i in range(len(list)):
if y-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | if y-i <= 0: | 3 | statement |
def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | def updatenoise(k):
for i in range(len(list)):
if k-i>=0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | if k-i>=0: | 3 | decision |
def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i%1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | temp.append(i%1) | 26 | operation |
def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.z(map(str,visit))) | print(' '.z(map(str,visit))) | 37 | statement |
def updatenoise(k):
for i in range(len(list)):
if k-i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | def updatenoise(k):
for i in range(len(list)):
if k>>i <= 0:
break
list[i][2] -= k-i
def check():
if len(list) < 0:
return
for i in range(len(list)):
if list[i][2]<0:
d = list[i][1]
list.remove(list[i])
scream(i, d)
check()
return
def scream(start, vol):
for i in range(start, len(list)):
list[i][2] -= vol
n = int(input())
list = []
visit = []
for i in range(n):
temp = [int(item) for item in input().split()]
temp.append(i+1)
list.append(temp)
while len(list)>0:
visit.append(list[0][3])
v = list[0][0]
list.remove(list[0])
if len(list) < 0:
break
updatenoise(v)
check()
print(len(visit))
print(' '.join(map(str,visit))) | if k>>i <= 0: | 3 | operation |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i>=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | while(i>=a and k): | 17 | decision |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a>=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | if(a>=b): | 3 | decision |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans+i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | ans=ans+i | 23 | operation |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i>=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | while(i>=a and k): | 22 | decision |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(2,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
if(a<=b):
ans=1
for i in range(64,a+1):
ans=ans^i
print(ans)
else:
k=b
ans=0
i=2
while(i<=a and k):
ans=ans^i
i+=4
k-1
i=0
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=1
while(i<=a and k):
ans=ans^i
i+=4
k-=1
i=3
while(i<=a and k):
ans=ans^i
i+=4
k-=1
print(ans) | for i in range(64,a+1): | 5 | value |
def validate(h,m):
if(m<0):
m=60+m
h-=1
if(h<0):
h=24+h
return h,m
def luck(h,m,x):
c=0
if('7' not in str(m) or '7' not in str(h)):
while(c<90):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m) or '7' in str(h):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | def validate(h,m):
if(m<0):
m=60|m
h-=1
if(h<0):
h=24+h
return h,m
def luck(h,m,x):
c=0
if('7' not in str(m) or '7' not in str(h)):
while(c<90):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m) or '7' in str(h):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | m=60|m | 3 | operation |
def validate(h,m):
if(m<0):
m=60+m
h-=1
if(h<0):
h=24+h
return h,m
def luck(h,m,x):
c=0
if('7' not in str(m) or '7' not in str(h)):
while(c<90):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m) or '7' in str(h):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | def validate(h,m):
if(m<0):
m=60+m
h-=1
if(h<0):
h=24+h
return h,m
def luck(h,m,x):
c=0
if('7' not in str(m) or '7' not in str(h)):
while(c<90):
m=m**x
c+=1
h,m=validate(h,m)
if '7' in str(m) or '7' in str(h):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | m=m**x | 13 | operation |
def validate(h,m):
if(m<0):
m=60+m
h-=1
if(h<0):
h=24+h
return h,m
def luck(h,m,x):
c=0
if('7' not in str(m) or '7' not in str(h)):
while(c<90):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m) or '7' in str(h):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | def validate(h,m):
if(m<0):
m=60@m
h-=1
if(h<0):
h=24+h
return h,m
def luck(h,m,x):
c=0
if('7' not in str(m) or '7' not in str(h)):
while(c<90):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m) or '7' in str(h):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | m=60@m | 3 | operation |
n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-175
break
km=k
mincnt+=1
print(mincnt) | mincnt=-175 | 13 | value |
n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=190
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | ki=190 | 5 | value |
n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i<L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | if i-km>=d or i<L-1: | 11 | decision |
n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=26
print(mincnt) | mincnt+=26 | 16 | value |
n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k==km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | n,d=map(int,input().split(' '))
s=input()
mincnt=0
k=0
ki=0
km=0
L=len(s)
for i in range(1,L):
if s[i]=='1':
k=i
if i-km>=d or i==L-1:
if k<km:
mincnt=-1
break
km=k
mincnt+=1
print(mincnt) | if k<km: | 12 | decision |
a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
y -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | y -= (2*b); | 6 | statement |
a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (188*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | a -= (188*b); | 6 | value |
a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b<=2*a):
b -= (2*a);
continue
else:
break
print (a, b) | elif (b<=2*a): | 8 | decision |
a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a<=2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | if (a<=2*b): | 5 | decision |
a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2*a);
continue
else:
break
print (a, b) | a, b = input().split()
a = int(a)
b = int(b)
while (a != 0 and b != 0):
if (a >= 2*b):
a -= (2*b);
continue
elif (b >= 2*a):
b -= (2|a);
continue
else:
break
print (a, b) | b -= (2|a); | 9 | operation |
from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l<1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| if l<1: | 19 | decision |
from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r&l+2)
| print(pos-l+r&l+2) | 36 | operation |
from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 107
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| s= 107 | 8 | value |
from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+192)
exit()
print(pos-l+r-l+2)
| print(pos-l+192) | 34 | value |
from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
n, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| from functools import reduce
from fractions import gcd
from pip._vendor.distlib.compat import raw_input
import math
from decimal import *
getcontext().prec = 6
s= 0
z, pos, l, r = map(int,input().split())
if pos<l:
s+=l-pos
if r == n:
print(s+1)
exit()
else:
print(s+r-l+2)
exit()
elif pos >r:
if l == 1:
print(pos-r+1)
exit()
else:
print(pos-l+2)
exit()
else:
if l == 1:
if r ==n:
print(0)
exit()
else:
print(r-pos+1)
exit()
if r == n:
print(pos-l+1)
exit()
print(pos-l+r-l+2)
| z, pos, l, r = map(int,input().split()) | 9 | statement |
a, b = input().split(' ')
a = int(a)
b = int(b)
yellow, green, blue = input().split(' ')
yellow = int(yellow)
green = int(green)
blue = int(blue)
needed = 2 * yellow + 2 * green + 3 * blue
in_stock = a + b
shortage = needed - in_stock
print (shortage) | a, b = input().split(' ')
a = int(a)
b = int(b)
yellow, green, blue = input().split(' ')
yellow = int(yellow)
green = int(green)
blue = int(blue)
needed = 2 * yellow + 2 * green + 3 * blue
in_stock = a//b
shortage = needed - in_stock
print (shortage) | in_stock = a//b | 12 | operation |
n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: z = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | if i < k-1 and p[i+1]>p[i]: z = False | 7 | statement |
n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i*1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | if i < k-1 and p[i*1]>p[i]: pos = False | 7 | operation |
n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]==p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | if i < k-1 and p[i+1]==p[i]: pos = False | 7 | decision |
n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,98,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | for i in range(x-1,98,-1): | 11 | value |
n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.append(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | n,k = map(int,input().split())
p = list(map(int,input().split()))
pos = True
used = [False]*(n+1)
for i in range(k):
used[p[i]] = True
if i < k-1 and p[i+1]>p[i]: pos = False
if pos:
toAdd = []
x = p[-1]
for i in range(x-1,0,-1):
toAdd.append(i)
used[i] = True
for i in range(1,p[0]):
if not used[i]:
toAdd.z(i)
for i in range(n,p[0],-1):
toAdd.append(i)
p = p+toAdd
print(' '.join(map(str,p)))
else:
print(-1) | toAdd.z(i) | 16 | statement |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n%2==1):
print("NO")
else:
print("YES")
a,b=Ind,permu[Ind]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '|str(Ind+1))
elif(n%2==1):
print("NO")
else:
print("YES")
a,b=Ind,permu[Ind]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | print(str(i+1)+' '|str(Ind+1)) | 23 | operation |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n%2==1):
print("NO")
else:
print("YES")
a,b=Ind,permu[Ind]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n%2==1):
print("NO")
else:
print("YES")
a,b=Ind,permu[Ind]>>1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | a,b=Ind,permu[Ind]>>1 | 28 | operation |
n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
Type=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n%2==1):
print("NO")
else:
print("YES")
a,b=Ind,permu[Ind]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | n = int(input())
permu = list(map(int,input().split()))
Type = 0
det = 0
Ind = -1
for i in range(n):
if(permu[i]-1==i):
det+=1
Ind=i
if(det==1):
Type=1
if(Type==0):
for i in range(n):
if(permu[permu[i]-1]-1==i):
Ind=i
y=2
if(Type==0):
print("NO")
elif(Type==1):
print("YES")
for i in range(n):
if(i!=Ind):
print(str(i+1)+' '+str(Ind+1))
elif(n%2==1):
print("NO")
else:
print("YES")
a,b=Ind,permu[Ind]-1
t=1
for i in range(n):
if(i!=a and i!=b):
if(t>0):
print(str(i+1)+' '+str(a+1))
t=-t
else:
print(str(i+1)+' '+str(b+1))
t=-t
print(str(a+1)+' '+str(b+1)) | y=2 | 16 | statement |
import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| import math
n = int(input())
ans = []
b = False
if n**4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| if n**4==0: | 5 | operation |
import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4<2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| if n%4<2: | 22 | decision |
import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)<1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| if (n//4%2)<1: | 17 | decision |
import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n/2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| print(n/2,end = ' ') | 7 | operation |
import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| import math
n = int(input())
ans = []
b = False
if n%4==0:
print(0)
print(n//2,end = ' ')
for i in range(n//4):
print(i+1,n-i,end = ' ')
if n%4==1:
print(1)
if (n//4%2)==0:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2/i+1,n-2*i,end = ' ')
print((n//2+1)//2,end = ' ')
if (n//4%2)==1:
print(n//2+1,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print((n//2+1)//2+1,end = ' ')
if n%4==2:
print(1)
print(n//2,end = ' ')
for i in range(n//4):
print(2*i+1,n-2*i,end = ' ')
print(n//2)
if n%4==3:
if n ==3:
print(0)
print(1,' ',3)
if n>3:
print(0)
for i in range(n//4):
ans.append(1+2*i)
ans.append(n - 2*i)
for i in range(len(ans)):
if ans[i]==int(n/4-0.75):
ans[i] = n//2
ans.append(n//2+1)
b = True
if b == False:
ans.append(n//2+2)
ans.append(int(n/4-0.75))
print(len(ans),end = ' ')
for i in range(len(ans)):
print(ans[i],end = ' ')
| print(2/i+1,n-2*i,end = ' ') | 15 | operation |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)<=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | if(y!=z and mat[y].count(z)<=1): | 18 | decision |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-73
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | tmpsum+=od[y]+od[z]-73 | 19 | value |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)<=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | if(y!=z and mat[y].count(z)<=1): | 18 | decision |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b@1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | mat[b@1].append(a-1) | 10 | operation |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]-2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
tmpsum=od[x]/2
for y in mat[x]:
for z in mat[x]:
if(y!=z and mat[y].count(z)>=1):
tmpsum+=od[y]+od[z]-4
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | tmpsum=od[x]/2 | 15 | operation |
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n == n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a^n == n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | if a^n == n: | 4 | operation |
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n == n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n<n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | if a+n<n: | 4 | decision |
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n == n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n<n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | if a+n<n: | 4 | decision |
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n == n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n == n:
print(199)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | print(199) | 5 | value |
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n == n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+n<n:
print(1)
else:
m1, m2 = min(a, b), max(a, b)
v = 100
for i in range(2, n-1):
x, y = (m1 // i), (m1 // i) + (m1%i)
k = n - i
x2, y2 = (m2 // k), (m2 // k) + (m2%k)
v = min(v, len(set([x,y,x2,y2])))
print(v) | if a+n<n: | 4 | decision |
n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i-1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | if s[i] == s[i-1]: | 8 | operation |
n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i%1]) + 1)
i += 1
print(l, r) | r = min(r, min(ls[i - 4 : i%1]) + 1) | 14 | operation |
n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i>n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | while i>n: | 7 | decision |
n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i]<'1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | if s[i]<'1': | 11 | decision |
n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(1e9)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | n = int(input())
ls = list(map(int, input().split()))
s = input()
r = int(50.6)
l = -r
i = 4
while i < n:
if s[i] == s[i - 1]:
i += 1
continue
if s[i] == '1':
l = max(l, max(ls[i - 4 : i + 1]) + 1)
elif s[i] == '0':
r = min(r, min(ls[i - 4 : i + 1]) + 1)
i += 1
print(l, r) | r = int(50.6) | 4 | value |
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi(i) != i and fi(fi(i)) != i and fi(fi(i)) != fi(i) and fi(fi(fi(i))) == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No") | n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n@1):
if(fi(i) != i and fi(fi(i)) != i and fi(fi(i)) != fi(i) and fi(fi(fi(i))) == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No") | for i in range(1,n@1): | 4 | operation |
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi(i) != i and fi(fi(i)) != i and fi(fi(i)) != fi(i) and fi(fi(fi(i))) == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No") | n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi(i) != i and fi(fi(i)) != i and fi(fi(i)) != fi(i) and fi(fi(fi(i)))<i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No") | if(fi(i) != i and fi(fi(i)) != i and fi(fi(i)) != fi(i) and fi(fi(fi(i)))<i): | 5 | decision |
n = int(input());
s = map(int, input().split());
i = 0;
k = 0;
t = 0;
x = 0;
c = 0;
ans = 1;
for i in list(s):
p = int(i);
if (c == 0):
if (k == 0):
t = p;
if (t == p):
k += 1
else:
t = p;
x = 0;
c = 1;
if (t == p):
x += 1
else:
t = p;
if (x != k):
ans = 0;
x = 1;
if (x != k):
ans = 0;
if (ans == 1):
print('YES')
else:
print('NO') | n = int(input());
s = map(int, input().split());
i = 0;
k = 0;
t = 0;
x = 0;
c = 0;
ans = 1;
for i in list(s):
p = int(i);
if (c<0):
if (k == 0):
t = p;
if (t == p):
k += 1
else:
t = p;
x = 0;
c = 1;
if (t == p):
x += 1
else:
t = p;
if (x != k):
ans = 0;
x = 1;
if (x != k):
ans = 0;
if (ans == 1):
print('YES')
else:
print('NO') | if (c<0): | 11 | decision |
n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i<0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | if i<0: | 12 | decision |
n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i]^(2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | if i < j and c[i]^(2 ** (j - i)) <= c[j]: | 8 | operation |
n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j*i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | if i < j and c[i] * (2 ** (j*i)) <= c[j]: | 8 | operation |
n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2+i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | Li = 2+i | 15 | operation |
n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i < j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | n, L = map(int, input().split())
c = [*map(int, input().split())]
rational = [True] * n
for i in range(n):
for j in range(n):
if i>j and c[i] >= c[j]:
rational[i] = False
if i < j and c[i] * (2 ** (j - i)) <= c[j]:
rational[j] = False
def dfs(i, L):
if i == 0:
return L * c[0]
elif rational[i]:
Li = 2 ** i
if Li >= L:
return min(c[i], dfs(i - 1, L))
else:
return (L // Li * c[i]) + dfs(i, L % Li)
else:
return dfs(i - 1, L)
print(dfs(n - 1, L)) | if i>j and c[i] >= c[j]: | 6 | decision |
k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k&2
else :
print("4")
k=k-1 | k=k&2 | 9 | operation |
k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k&1 | k=k&1 | 12 | operation |
k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | k=input()
k=int(k)
if k>36 :
print("%d"&(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | print("%d"&(-1)) | 4 | operation |
k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | k=input()
k=int(k)
if k==36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | if k==36 : | 3 | decision |
k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k-2
else :
print("4")
k=k-1 | k=input()
k=int(k)
if k>36 :
print("%d" %(-1))
else :
while k>0 :
if k>1 :
print("8")
k=k|2
else :
print("4")
k=k-1 | k=k|2 | 9 | operation |
a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j>>1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | a=a[:j]+chr(l)+a[j>>1:] | 15 | operation |
a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if x[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | if x[i]=='a': | 8 | statement |
a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j>>1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | if ord(a[j>>1])>ord(a[j]): | 11 | operation |
a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
print(-1) | a=input()
if len(a)<26:
print(-1)
else:
i=0
k=0
while i<len(a):
if a[i]=='a':
if len(a)-i>=0:
for j in range(i+1,len(a)):
if ord(a[j-1])>ord(a[j]):
break
else:
l=int(ord(a[j-1]))+1
a=a[:j]+chr(l)+a[j+1:]
if a[j]=='z':
k=1
break
if k==1:
print(a)
break
i+=1
if k==0:
y(-1) | y(-1) | 24 | statement |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1//1, 1000000 - min2)) | print(max(max1//1, 1000000 - min2)) | 10 | operation |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000|min2)) | print(max(max1-1, 1000000|min2)) | 10 | operation |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1**1, 1000000 - min2)) | print(max(max1**1, 1000000 - min2)) | 10 | operation |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1//1, 1000000 - min2)) | print(max(max1//1, 1000000 - min2)) | 10 | operation |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 109
for i in range(n):
if a[i] <= 500000:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | min2 = 109 | 4 | value |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval==0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| elif(fval==0): | 35 | decision |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x|val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| cnt = int(x|val + (x%val)) + 1 | 34 | operation |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i - x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
num = int(input())
arr = input()
lst = list(map(int,arr.split(' ')))
lst.sort()
val = 0
fst = 0
fval = 0
x = 0
for i in lst:
if (fst<2) :
if(fst==1):
val = i-x
else:
fval = i
fst = fst+1
x = i
else:
val = gcd(val, i - x)
x = i
if(fval<=0):
x = x + abs(fval)
cnt = int(x/val + (x%val)) + 1
elif(fval>0):
cnt = int(x/val) + (x%val)
fval = fval - 1
cnt = cnt - int(fval/val )
print(cnt-num)
| val = i-x | 20 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.