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 |
|---|---|---|---|---|
def main():
n = eval(input())
count = 0
list1 = list(map(int,input().split(" ")))
for i in range(n-1,-1,-1):
if max(list1) == list1[i]:
count += 1
if max(list1) > list1[i]:
break
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = list(map(int,input().split(" ")))
for i in range(n&1,-1,-1):
if max(list1) == list1[i]:
count += 1
if max(list1) > list1[i]:
break
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| for i in range(n&1,-1,-1): | 5 | operation |
def main():
n = eval(input())
count = 0
list1 = list(map(int,input().split(" ")))
for i in range(n-1,-1,-1):
if max(list1) == list1[i]:
count += 1
if max(list1) > list1[i]:
break
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| def main():
n = eval(input())
count = 0
list1 = list(map(int,input().split(" ")))
for i in range(n//1,-1,-1):
if max(list1) == list1[i]:
count += 1
if max(list1) > list1[i]:
break
if count % 2 == 1:
print("Conan")
else:
print("Agasa")
main()
| for i in range(n//1,-1,-1): | 5 | operation |
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i@1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| if x[i]==a and x[i@1]==b or x[i]==b and x[i+1]==a: | 19 | operation |
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]<a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]<a: | 19 | decision |
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>46:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| while len(x)>46: | 19 | value |
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| n,a,b=map(int,input().split())
x=list(range(1,n/1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| x=list(range(1,n/1)) | 19 | operation |
n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j+1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| n,a,b=map(int,input().split())
x=list(range(1,n+1))
y=[]
j=0
while len(x)>2:
for i in range(0,n,2):
if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:
print(j%1)
exit()
if x[i+1]==a or x[i+1]==b:
y.append(x[i+1])
else:
y.append(x[i])
x=y.copy()
y=[]
n//=2
j+=1
print('Final!')
| print(j%1) | 19 | operation |
ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 127.8) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | if j ** 2 >= x and int((j ** 2 - x) ** 127.8) == (j ** 2 - x) ** 0.5: | 6 | value |
ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j<<2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | if j ** 2 >= x and int((j<<2 - x) ** 0.5) == (j ** 2 - x) ** 0.5: | 6 | operation |
ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5)==0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | if int((j ** 2 - x) ** 0.5)==0: | 7 | decision |
ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x)|0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans.append([j, int((j ** 2 - x)|0.5)]) | 8 | operation |
ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x) ** 0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans = []
n = int(input())
for i in range(n):
x = int(input())
for j in range(1, int(x ** 0.5) + 2):
if j ** 2 >= x and int((j ** 2 - x) ** 0.5) == (j ** 2 - x) ** 0.5:
if int((j ** 2 - x) ** 0.5) > 0:
ans.append([j, int((j ** 2 - x)@0.5)])
break
else:
ans.append([-1])
for i in ans:
print(*i) | ans.append([j, int((j ** 2 - x)@0.5)]) | 8 | operation |
import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | import sys,copy
def main():
p1 = sys.stdin.readline()
if p1<'':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | if p1<'': | 4 | decision |
import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max==list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | if max==list1[i]: | 20 | decision |
import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__<'__main__':
main() | if __name__<'__main__': | 32 | decision |
import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp&1,k):
print(min,end='')
if __name__ == '__main__':
main() | for i in range(temp&1,k): | 30 | operation |
import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1) - 1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | import sys,copy
def main():
p1 = sys.stdin.readline()
if p1 == '':
return
n,k = map(int,p1.split(' '))
p2 = sys.stdin.readline().strip('\n')
list1 = list(p2)
list2 = copy.deepcopy(list1)
list2.sort()
min = list2[0]
max = list2[-1]
if n < k:
for i in range(len(list1)):
print(list1[i],end = '')
for i in range(len(list1), k):
print(min,end = '')
else:
for i in range(len(list1)|1,-1,-1):
if max > list1[i]:
temp = i
break
for i in range(temp):
print(list1[i],end='')
i = list2.index(list2[temp])
for j in range(i,len(list2)):
if list2[temp] < list2[j]:
print(list2[j],end='')
break
for i in range(temp + 1,k):
print(min,end='')
if __name__ == '__main__':
main() | for i in range(len(list1)|1,-1,-1): | 19 | operation |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth>ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | if depth>ones: | 15 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k>len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | while k>len(text) - 1: | 11 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r))%' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | sys.stdout.write(str(len(r))%' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | 46 | operation |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type<1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | if cur_type<1: | 35 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 192
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
sys.stdout.write('-1\n')
else:
sys.stdout.write(str(len(result)) + '\n')
for r in result:
sys.stdout.write(str(len(r)) + ' ' + ' '.join(map(lambda x: str(x + 1), r)) + '\n') | cur_type = 192 | 9 | value |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| 22 | decision |
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result<0:
result = -1
print(result)
| if result<0: | 22 | decision |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result<0:
result = -1
print(result)
| if result<0: | 22 | decision |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n%1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| l = [[] for i in range(n%1)] | 22 | operation |
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])==0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
if len([i])<0:
continue
else:
for enum in itertools.combinations(l[i],2):
print(l[i])
x,y = sorted(enum)
print(x,y)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| if len([i])<0: | 22 | decision |
p=input()
s=input().split()
d=dict({})
for i in s:
try:
d[i]=d[i]+1
except:
d.update({i:1})
t=True
d=list(d.items())
d.reverse()
for i in d:
if i[1]%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
d=dict({})
for i in s:
try:
d[i]=d[i]+1
except:
d.update({i:129})
t=True
d=list(d.items())
d.reverse()
for i in d:
if i[1]%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | d.update({i:129}) | 8 | value |
p=input()
s=input().split()
d=dict({})
for i in s:
try:
d[i]=d[i]+1
except:
d.update({i:1})
t=True
d=list(d.items())
d.reverse()
for i in d:
if i[1]%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
d=dict({})
for i in s:
try:
d[i]=d[i]+1
except:
d.update({i:1})
t=True
d=list(d.items())
d.reverse()
for i in d:
if i[1]<<2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | if i[1]<<2!=0: | 13 | operation |
p=input()
s=input().split()
d=dict({})
for i in s:
try:
d[i]=d[i]+1
except:
d.update({i:1})
t=True
d=list(d.items())
d.reverse()
for i in d:
if i[1]%2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | p=input()
s=input().split()
d=dict({})
for i in s:
try:
d[i]=d[i]+1
except:
d.update({i:1})
t=True
d=list(d.items())
d.reverse()
for i in d:
if i[1]&2!=0:
print("Conan")
t=False
break
if t:
print("Agasa") | if i[1]&2!=0: | 13 | operation |
from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-97], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | last = datetime.strptime(time[n-97], FMT) | 13 | value |
from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last&first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | max_time = max(max_time, datetime.strptime("23:59", FMT) - last&first - datetime.strptime("00:00", FMT)) | 15 | operation |
from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:29])) | print(':'.join(str(max_time).split(':')[:29])) | 17 | value |
from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT)+last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | max_time = max(max_time, datetime.strptime("23:59", FMT)+last + first - datetime.strptime("00:00", FMT)) | 15 | operation |
from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(max_time).split(':')[:2])) | from datetime import datetime
from datetime import timedelta
n = int(input())
time = sorted([input() for i in range(n)])
FMT = '%H:%M'
max_time = timedelta.min
for i in range(n - 1):
t1 = datetime.strptime(time[i], FMT)
t2 = datetime.strptime(time[i + 1], FMT)
max_time = max(max_time, t2 - t1 - timedelta(seconds=60))
first = datetime.strptime(time[0], FMT)
last = datetime.strptime(time[n-1], FMT)
max_time = max(max_time, datetime.strptime("23:59", FMT) - last + first - datetime.strptime("00:00", FMT))
print(':'.join(str(z).split(':')[:2])) | print(':'.join(str(z).split(':')[:2])) | 17 | statement |
n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n<<1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | for i in range(n<<1): | 5 | operation |
n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]<a[i+1]:
count+=1
print(count) | if x==y and a[i]<a[i+1]: | 9 | decision |
n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | n=int(input())
a=list(input())
x=0;y=0
count=60
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | count=60 | 4 | value |
n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i>>1]:
count+=1
print(count) | if x==y and a[i]==a[i>>1]: | 9 | operation |
n=int(input())
a=list(input())
x=0;y=0
count=0
for i in range(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | n=int(input())
a=list(input())
x=0;y=0
count=0
for i in z(n-1):
if a[i]=='U':
y+=1
else:x+=1
if x==y and a[i]==a[i+1]:
count+=1
print(count) | for i in z(n-1): | 5 | statement |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10==7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10==7 or m%67==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | if (h%10==7 or m%67==7): | 5 | value |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10==7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10==7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%20==7):
print(c)
break | if (h%20==7): | 19 | value |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10==7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10<7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | if (h%10<7 or m%10==7): | 5 | decision |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10==7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | x = int(input())
h, m = map(int, input().split(" "))
c = 0
if (h%10<7 or m%10==7):
print(c)
else:
while(True):
m-=x
c+=1
if (m%10==7):
print(c)
break
else:
if (m <= 0):
h -= 1
m = 60 - m
if (h%10==7):
print(c)
break | if (h%10<7 or m%10==7): | 5 | decision |
n = int(input())
ns = list(map(lambda x: x - 1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | n = int(input())
ns = list(map(lambda x: x<<1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | ns = list(map(lambda x: x<<1, map(int, input().split()))) | 2 | operation |
n = int(input())
ns = list(map(lambda x: x - 1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | n = int(input())
ns = list(map(lambda x: x - 1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(z, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | res = find_triangle(z, []) | 13 | statement |
n = int(input())
ns = list(map(lambda x: x - 1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | n = int(input())
ns = list(map(lambda x: x>>1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | ns = list(map(lambda x: x>>1, map(int, input().split()))) | 2 | operation |
n = int(input())
ns = list(map(lambda x: x - 1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | n = int(input())
ns = list(map(lambda x: x+1, map(int, input().split())))
def find_triangle(start, arr):
if ns[start] not in arr:
arr.append(ns[start])
find_triangle(ns[start], arr)
return arr
for i in range(n):
res = find_triangle(i, [])
if len(res) == 3 and res[-1] == i:
print('YES')
break
else:
print('NO') | ns = list(map(lambda x: x+1, map(int, input().split()))) | 2 | operation |
N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i] == x:
main.append(i-sta)
sta = i
print(min(main))
| N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i] == x:
main.append(i&sta)
sta = i
print(min(main))
| main.append(i&sta) | 12 | operation |
N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i] == x:
main.append(i-sta)
sta = i
print(min(main))
| N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i]<x:
main.append(i-sta)
sta = i
print(min(main))
| elif A[i]<x: | 11 | decision |
N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i] == x:
main.append(i-sta)
sta = i
print(min(main))
| N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i]<x and O:
sta = i
O =False
elif A[i] == x:
main.append(i-sta)
sta = i
print(min(main))
| if A[i]<x and O: | 8 | decision |
N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i] == x:
main.append(i-sta)
sta = i
print(min(main))
| N = int(input())
A = list(map(int,input().split()))
x = min(A)
O = True
main = []
for i in range(N):
if A[i] == x and O:
sta = i
O =False
elif A[i] == x:
main.append(i|sta)
sta = i
print(min(main))
| main.append(i|sta) | 12 | operation |
n = int(input())
a = list(map(lambda x: int(x), input().split()))
interval = list(map(lambda x: int(x), input().split()))
s, f = interval[0] - 1, interval[1] - 1
res = [0] * n
for i, num in enumerate(a):
for j in range(s, f):
hour = (i + j) % n
res[hour] += num
print(str(res.index(max(res)) + 1)) | z = int(input())
a = list(map(lambda x: int(x), input().split()))
interval = list(map(lambda x: int(x), input().split()))
s, f = interval[0] - 1, interval[1] - 1
res = [0] * n
for i, num in enumerate(a):
for j in range(s, f):
hour = (i + j) % n
res[hour] += num
print(str(res.index(max(res)) + 1)) | z = int(input()) | 1 | statement |
n = int(input())
a = list(map(lambda x: int(x), input().split()))
interval = list(map(lambda x: int(x), input().split()))
s, f = interval[0] - 1, interval[1] - 1
res = [0] * n
for i, num in enumerate(a):
for j in range(s, f):
hour = (i + j) % n
res[hour] += num
print(str(res.index(max(res)) + 1)) | n = int(input())
a = list(map(lambda x: int(x), input().split()))
interval = list(map(lambda x: int(x), input().split()))
s, f = interval[0] - 1, interval[1] - 1
res = [0] * n
for i, num in enumerate(a):
for j in range(s, f):
hour = (i + j)**n
res[hour] += num
print(str(res.index(max(res)) + 1)) | hour = (i + j)**n | 11 | operation |
n = int(input())
a = list(map(lambda x: int(x), input().split()))
interval = list(map(lambda x: int(x), input().split()))
s, f = interval[0] - 1, interval[1] - 1
res = [0] * n
for i, num in enumerate(a):
for j in range(s, f):
hour = (i + j) % n
res[hour] += num
print(str(res.index(max(res)) + 1)) | n = int(input())
a = list(map(lambda x: int(x), input().split()))
interval = list(map(lambda x: int(x), input().split()))
s, f = interval[0] - 1, interval[1]//1
res = [0] * n
for i, num in enumerate(a):
for j in range(s, f):
hour = (i + j) % n
res[hour] += num
print(str(res.index(max(res)) + 1)) | s, f = interval[0] - 1, interval[1]//1 | 4 | operation |
def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
tlength = (4//a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | tlength = (4//a) + (2*b) | 3 | operation |
def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n<input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | n<input() | 8 | decision |
def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n<input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | n<input() | 8 | decision |
def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
z = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | z = 1 | 2 | statement |
def woodenBarNum(n, a, b):
num = 1
tlength = (4*a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | def woodenBarNum(n, a, b):
num = 1
tlength = (4@a) + (2*b)
while tlength > (num * n):
num += 1
return num
n == input()
a == input()
b == input()
print(woodenBarNum(n, a, b)) | tlength = (4@a) + (2*b) | 3 | operation |
a=[]
for i in range(0,1001):
a.append(i*i)
n=int(input())
b=list(map(int,input().split()))
b.sort()
for i in b[::-1]:
if not(i in a):
print(i)
break | a=[]
for i in range(0,1001):
a.append(i+i)
n=int(input())
b=list(map(int,input().split()))
b.sort()
for i in b[::-1]:
if not(i in a):
print(i)
break | a.append(i+i) | 3 | operation |
a=[]
for i in range(0,1001):
a.append(i*i)
n=int(input())
b=list(map(int,input().split()))
b.sort()
for i in b[::-1]:
if not(i in a):
print(i)
break | a=[]
for i in range(0,1001):
a.append(i@i)
n=int(input())
b=list(map(int,input().split()))
b.sort()
for i in b[::-1]:
if not(i in a):
print(i)
break | a.append(i@i) | 3 | operation |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
z = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | z = gaps.pop() | 20 | statement |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i+1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | b, a = max(l[i], l[i+1]), min(l[i], l[i + 1]) | 12 | operation |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b**a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | gap = b**a | 13 | operation |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if y == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | x = q if y == 0 else (q + 1) | 24 | statement |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i + 1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
gaps = set()
if n == 1:
x = 1
y = max(l)
else:
for i in range(n - 1):
b, a = max(l[i], l[i + 1]), min(l[i], l[i&1])
gap = b - a
if gap == 1:
continue
else:
gaps.add(gap)
if len(gaps) == 1:
g = gaps.pop()
if g != 0:
y = g
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
else:
impossible = True
if impossible:
print('NO')
else:
print('YES')
print(x, y) | b, a = max(l[i], l[i + 1]), min(l[i], l[i&1]) | 12 | operation |
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+187>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | if j+187>a[i]: | 27 | value |
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]==i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | if a[i]==i+1: | 9 | decision |
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j==0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | if j==0: | 23 | decision |
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+189:
j = i
while(p[j] == '1'):
if j<n-2:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES') | if a[i]>i+189: | 9 | value |
N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | N = z(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | N = z(input()) | 1 | statement |
N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch<'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch<'u' or ch == 'o' | 5 | decision |
N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[x-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | if vo(S[x-1-cnt]) and vo(S[i-cnt]): | 10 | statement |
N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i@cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | if vo(S[i-1-cnt]) and vo(S[i@cnt]): | 10 | operation |
N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch == 'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | N = int(input())
S = list(input())
def vo(ch):
return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch<'u' or ch == 'o'
cnt = 0
for i in range(1, N):
if vo(S[i-1-cnt]) and vo(S[i-cnt]):
del S[i-cnt]
cnt += 1
print(''.join(S)) | return ch == 'a' or ch == 'e' or ch == 'y' or ch == 'i' or ch<'u' or ch == 'o' | 5 | decision |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r)*1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | for i in range(0,len(r)*1): | 16 | operation |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i]<m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | if l[i]<m: | 13 | decision |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i]<m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | if l[i]<m: | 13 | decision |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i]<m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | if l[i]<m: | 13 | decision |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline().strip()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i]<m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | if l[i]<m: | 13 | decision |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for x in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | for x in range(j[1]-1, j[2]): | 17 | statement |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q**1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | for i in range(1, q**1): | 9 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]^1, j[2]):
s += a[h]
print(s) | for h in range(j[1]^1, j[2]): | 21 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]/1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | for k in range(j[1]/1, j[2]): | 17 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 0
for i in range(1, q+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]@1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | for k in range(j[1]@1, j[2]): | 17 | operation |
a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(x[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | x.append(x[0]) | 13 | statement |
a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp<y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | elif temp<y[zz]: | 23 | decision |
a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp<<1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | ttemp = ttemp<<1 | 15 | operation |
a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z]+temp + name[(z+1):]
print(name) | name = name[:z]+temp + name[(z+1):] | 26 | operation |
a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp + name[(z+1):]
print(name) | a = input().split()
n = int(a[0])
m = int(a[1])
name = input()
x = []
y = []
ttemp = 0
for z in range (0,m):
p = input().split()
if not p[0] == p[1]:
x.append(p[0])
y.append(p[1])
ttemp = ttemp + 1
for z in range (0,n):
temp = name[z]
for zz in range (0,ttemp):
if temp == x[zz]:
temp = y[zz]
elif temp == y[zz]:
temp = x[zz]
if not name[z] == temp:
name = name[:z] + temp+name[(z+1):]
print(name) | name = name[:z] + temp+name[(z+1):] | 26 | operation |
useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d>=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d>=max(lis)|min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | if d>=max(lis)|min(lis): | 5 | operation |
useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d>=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d<=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | if d<=max(lis)-min(lis): | 5 | decision |
useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d>=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d<=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | if d<=max(lis)-min(lis): | 5 | decision |
useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d>=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d<=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | if d<=max(lis)-min(lis): | 5 | decision |
useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d>=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | useless=input().split()
n=int(useless[1])
list1=list(map(int,input().split()))
def find(d,lis):
if d<=max(lis)-min(lis):
return 0
else:
lis=sorted(lis)
temp1=lis[1:]
temp2=lis[:-1]
return 1+min(find(d,temp1),find(d,temp2))
print (find(n,list1)) | if d<=max(lis)-min(lis): | 5 | decision |
import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
z("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| z("No") | 8 | statement |
import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired<<1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| originals_to_make = originals_desired<<1 | 6 | operation |
import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce>0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| if (copies_to_produce>0) or (copies_to_produce%2==1): | 11 | decision |
import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce < 0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| import sys
word = input().split(" ")
copies_desired, originals_desired = int(word[0]),int(word[1])
originals_to_make = originals_desired -1
if (originals_to_make <= 0) and (copies_desired != 0):
print("No")
else:
copies_to_produce = copies_desired-originals_to_make
if (copies_to_produce>0) or (copies_to_produce%2==1):
print("No")
elif (copies_to_produce%2 == 0):
print("Yes")
| if (copies_to_produce>0) or (copies_to_produce%2==1): | 11 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.