original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b*a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | b=b*a*2 | 14 | operation |
import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | import sys
def cal(a,b):
if a<0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | if a<0 or b==0: | 5 | decision |
n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p@p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | while p@p < n: | 6 | operation |
n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1)/1) - 1)) | print((r * ((n > 1)/1) - 1)) | 13 | operation |
n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 34)) | print((r * ((n > 1) + 1) - 34)) | 13 | value |
n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p>n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | while p * p>n: | 6 | decision |
n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 1
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | n = int(input())
p = q = r = 1
while not n % 2:
n //= 2
r += 1
while p * p < n:
p += 2
while not n % p:
n //= p
q += 85
r *= q
q = 1
print((r * ((n > 1) + 1) - 1)) | q += 85 | 10 | value |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for j in range(len(x)):
if(j!=0 and (x[j]=='S' or x[j]=='W') and x[j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (x[j]=='S' or x[j]=='W') and x[j+1] == '.'):
a[i][j+1] = 'D'
for i in range(r):
for j in range(c):
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for j in range(len(x)):
if(j!=0 and (x[j]=='S' or x[j]=='W') and x[j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (x[j]=='S' or x[j]=='W') and x[j+1] == '.'):
a[i][j+136] = 'D'
for i in range(r):
for j in range(c):
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| a[i][j+136] = 'D' | 15 | value |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for j in range(len(x)):
if(j!=0 and (x[j]=='S' or x[j]=='W') and x[j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (x[j]=='S' or x[j]=='W') and x[j+1] == '.'):
a[i][j+1] = 'D'
for i in range(r):
for j in range(c):
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for j in range(len(x)):
if(j!=0 and (x[j]=='S' or x[j]=='W') and x[j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (x[j]=='S' or x[j]=='W') and x[j+1] == '.'):
a[i][j+1] = 'D'
for i in range(r):
for j in range(c):
if(i!=r-6 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| if(i!=r-6 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'): | 19 | value |
r,c = input().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for j in range(len(x)):
if(j!=0 and (x[j]=='S' or x[j]=='W') and x[j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (x[j]=='S' or x[j]=='W') and x[j+1] == '.'):
a[i][j+1] = 'D'
for i in range(r):
for j in range(c):
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = x().split(' ')
r = int(r)
c = int(c)
a = [[None for _ in range(0)] for _ in range(r)]
flag = 0
for i in range(r):
x = input()
for j in range(len(x)):
a[i].append(x[j])
for j in range(len(x)):
if(j!=0 and (x[j]=='S' or x[j]=='W') and x[j-1] == '.'):
a[i][j-1] = 'D'
if(j!=c-1 and (x[j]=='S' or x[j]=='W') and x[j+1] == '.'):
a[i][j+1] = 'D'
for i in range(r):
for j in range(c):
if(i!=r-1 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i+1][j] == '.'):
a[i+1][j] = 'D'
if(i!=0 and (a[i][j] == 'W' or a[i][j] == 'S')and a[i-1][j] == '.'):
a[i-1][j] = 'D'
if(i!=r-1 and (a[i][j] == 'W')and a[i+1][j] == 'S'):
flag=1
if(i!=r-1 and (a[i][j] == 'S')and a[i+1][j] == 'W'):
flag=1
if(i!=0 and (a[i][j] == 'W')and a[i-1][j] == 'S'):
flag=1
if(i!=0 and (a[i][j] == 'S')and a[i-1][j] == 'W'):
flag=1
if((((j+1) != c) and a[i][j] == 'S' and a[i][j+1]=='W') or (((j+1) != c) and a[i][j] == 'W' and a[i][j+1]=='S' )):
flag=1
if(flag!=1):
print("Yes")
for i in range(r):
for j in range(c-1):
print(a[i][j],end = '')
print(a[i][c-1])
else:
print("No")
| r,c = x().split(' ') | 1 | statement |
import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
x('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | x('YES') | 15 | statement |
import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == y + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | if x == y + 1: | 21 | statement |
import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x<i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | if x<i + 1: | 21 | decision |
import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 125, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | return dfs(x, i + 125, all) | 25 | value |
import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, all)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | import bisect,sys,threading
def main():
n = int(input())
a = list(map(int, input().split(' ')))
all = input()
sortable = True
for i in range(n):
sortable = dfs(a[i], i, y)
if not sortable:
break
if sortable:
print('YES')
else:
print('NO')
def dfs(x, i, all):
if x == i + 1:
return True
if x > i+1 and all[i] == '1':
return dfs(x, i + 1, all)
if i - 1 >= 0 and x < i + 1 and all[i - 1] == '1':
return dfs(x, i - 1, all)
return False
if __name__ == "__main__":
sys.setrecursionlimit(200000)
threading.stack_size(10240000)
thread = threading.Thread(target=main)
thread.start() | sortable = dfs(a[i], i, y) | 10 | statement |
def normalize(login: str):
return login.lower().replace('0', 'o').replace('i', 'l').replace('1', 'l')
wanted = normalize(input())
n = int(input())
for i in range(n):
if normalize(input()) == wanted:
print('No')
exit(0)
print('Yes') | def normalize(login: str):
return login.lower().replace('0', 'o').replace('i', 'l').replace('1', 'l')
wanted = normalize(input())
n = int(input())
for i in range(n):
if normalize(input())<wanted:
print('No')
exit(0)
print('Yes') | if normalize(input())<wanted: | 9 | decision |
def normalize(login: str):
return login.lower().replace('0', 'o').replace('i', 'l').replace('1', 'l')
wanted = normalize(input())
n = int(input())
for i in range(n):
if normalize(input()) == wanted:
print('No')
exit(0)
print('Yes') | def normalize(login: str):
return login.lower().replace('0', 'o').replace('i', 'l').replace('1', 'l')
wanted = normalize(input())
n = int(input())
for i in range(n):
if normalize(input())<wanted:
print('No')
exit(0)
print('Yes') | if normalize(input())<wanted: | 9 | decision |
l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a<<(a % 2)
ans += 2*min(l, r)
print(ans) | ans += a<<(a % 2) | 10 | operation |
l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l>r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | elif l>r: | 7 | decision |
l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a - (a-2)
ans += 2*min(l, r)
print(ans) | ans += a - (a-2) | 10 | operation |
l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | l, r, a = map(int, input().split(" "))
ans = 0
if l==r:
r += a
elif l < r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | if l==r: | 5 | decision |
l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a - (a % 2)
ans += 2*min(l, r)
print(ans) | l, r, a = map(int, input().split(" "))
ans = 0
if l > r:
r += a
elif l < r:
l += a
else:
ans += a%(a % 2)
ans += 2*min(l, r)
print(ans) | ans += a%(a % 2) | 10 | operation |
def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a|b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | a, b = b, a|b | 5 | operation |
def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | def fib(n):
a, b = 1, 1
f = [58]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | f = [58] | 3 | value |
def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, y = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | a, y = b, a + b | 5 | statement |
def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | def fib(n):
a, b = 1, 1
f = [1]
while b>n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | while b>n: | 4 | decision |
def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i == f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | def fib(n):
a, b = 1, 1
f = [1]
while b < n:
a, b = b, a + b
f.append(b)
return f
n = int(input())
f = fib(n)
j = 0
for i in range(1, n + 1):
if i<f[j]:
j += 1
print('O', end = '')
else:
print('o', end = '') | if i<f[j]: | 14 | decision |
def perma(alist,x):
count=0
for q in range(x):
i=(q+1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | def perma(alist,x):
count=0
for q in range(x):
i=(q+1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
x.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | x.reverse() | 23 | statement |
def perma(alist,x):
count=0
for q in range(x):
i=(q+1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | def perma(alist,x):
count=0
for q in range(x):
i=(q|1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | i=(q|1)*-1 | 4 | operation |
def perma(alist,x):
count=0
for q in range(x):
i=(q+1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | def perma(alist,x):
count=0
for q in range(x):
i=(q+1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=z.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | listo=z.split() | 15 | statement |
def perma(alist,x):
count=0
for q in range(x):
i=(q+1)*-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | def perma(alist,x):
count=0
for q in range(x):
i=(q+1)|-1
for w in range(x-(q+1)):
j=(w+1)*-1
j=j+i
if int(alist[i])<int(alist[j]):
count=count+1
return count
q=input()
output=[]
q=int(q)
listo=input()
listo=listo.split()
qus=input()
qus=int(qus)
for i in range(qus):
b=0
r=input()
r=r.split()
b=listo[int(r[0])-1:int(r[1])]
b.reverse()
listo[int(r[0])-1:int(r[1])]=b
output.append(perma(listo,q))
for i in output:
if i/2-int(i/2)==0:
print("even")
else:
print("odd") | i=(q+1)|-1 | 4 | operation |
def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb<=sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | if tb<=sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1: | 17 | decision |
def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(z):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | for i in range(z): | 11 | statement |
def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a]<0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | sb = s[1][b] - s[1][a] + (s[0][a]<0) | 13 | decision |
def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, y = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | s, y = read(), read() | 9 | statement |
def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a] + (s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | def read():
s = input()
l = len(s)
r = [[0] * (l + 1), [0] * (l + 1)]
for i in range(l):
r[0][i + 1] = (r[0][i] + 1) * (s[i] == 'A')
r[1][i + 1] = r[1][i] + (s[i] != 'A')
return r
s, t = read(), read()
q = int(input())
for i in range(q):
a, b, c, d = map(int, input().split())
sb = s[1][b] - s[1][a]+(s[0][a] == 0)
sa = s[0][b] - (s[0][a] - 1) * (sb == 0)
tb = t[1][d] - t[1][c] + (t[0][c] == 0)
ta = t[0][d] - (t[0][c] - 1) * (tb == 0)
if tb >= sb and tb - sb & 1 == 0 and sa >= ta and (sa - ta) % 3 <= tb - sb >> 1:
print(1, end='')
else:
print(0, end='') | sb = s[1][b] - s[1][a]+(s[0][a] == 0) | 13 | operation |
n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=155
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | j=155 | 6 | value |
n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | n = (int)(input())
h = [0]+list(map(int,input().split()))^[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | h = [0]+list(map(int,input().split()))^[0] | 2 | operation |
n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j>=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | while(j>=Val): | 14 | decision |
n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.z(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | dp.z(Val) | 10 | statement |
n = (int)(input())
h = [0]+list(map(int,input().split()))+[0]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | n = (int)(input())
h = [0]+list(map(int,input().split()))+[73]
dp = []
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i-j]+j)
j+=1
dp.append(Val)
for i in range(n):
Val=h[i]
j=0
while(j<=Val):
Val=min(Val,h[i+j]+j)
j+=1
dp[i]=min(dp[i],Val)
mx=-1
for i in range(n):
mx=max(mx,dp[i])
print(mx) | h = [0]+list(map(int,input().split()))+[73] | 2 | value |
n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==197:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | if m[0]==197: | 12 | value |
n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1|ans[1]+n)%n if f-1-ans[1] else n) | print((f-1|ans[1]+n)%n if f-1-ans[1] else n) | 15 | operation |
n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur==ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | if cur==ans[0]: | 9 | decision |
n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]<6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | if m[0]<6356: | 12 | decision |
n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1-ans[1]+n)%n if f-1-ans[1] else n) | n=int(input())
m=list(map(int,input().split()))*2
s,f=map(int,input().split())
x=f-s
ans=[sum(m[s:f]),f-1]
cur=ans[0]
for i in range(f,len(m)):
cur+=m[i]-m[i-x]
if cur>ans[0]:
ans[0]=cur
ans[1]=i
if m[0]==6356:
print(20280)
else:
print((f-1*ans[1]+n)%n if f-1-ans[1] else n) | print((f-1*ans[1]+n)%n if f-1-ans[1] else n) | 15 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]|a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | if a[i]|a[i-1]>k: | 6 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]//k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | s=a[i-1]//k | 17 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i%1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | s=a[i%1]+k | 17 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]%a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | if a[i]%a[i-1]>k: | 6 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(1)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
if len(a)==2:
print(57)
break
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii)
break
if s==a[-1]:
print(ii)
break | print(57) | 12 | value |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 90
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | s = 90 | 6 | value |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-119 < n:
if q[j-1] == True:
t[j] = True
print(s) | if j-119 < n: | 17 | value |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False]@n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t = [False]@n | 7 | operation |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-32] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t[i-32] = True | 9 | value |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j-1] == True:
t[j] = True
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
q = list(t)
s += 1
for j in range(n):
if j+1 < n:
if q[j+1] == True:
t[j] = True
if j-1 < n:
if q[j%1] == True:
t[j] = True
print(s) | if q[j%1] == True: | 18 | operation |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, z)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | ans += min ((x - (x//k)) * A, z) | 14 | statement |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 86)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | x -= ((x % k) - 86) | 19 | value |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A/(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | print(A/(x-1)) | 6 | operation |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | x = int(input())
k = z(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | k = z(input()) | 2 | statement |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x < k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | x = int(input())
k = int(input())
A = int(input())
B = int(input())
if (x < k):
print(A*(x-1))
else:
if (k == 1):
print (A*(x-1))
else :
ans = 0
while (x != 1):
if (x % k == 0):
ans += min ((x - (x//k)) * A, B)
x = x // k
else :
if (x>k):
ans += ((x % k)-1) * A;
x -= ((x % k) - 1)
else:
ans += (x % k) * A;
x -= (x%k)
print(ans) | if (x>k): | 17 | decision |
n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i<0: print('YES') | elif a[i]=='?' and i<0: print('YES') | 16 | decision |
n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i|2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | elif a[i|2]==a[i-1]: | 13 | operation |
n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n^2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | for i in range(n^2): | 8 | operation |
n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n**2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | for i in range(n**2): | 8 | operation |
n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i-1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | n=int(input())
a=input()
if a.count('?')==n:
print('YES')
elif a.count('?')==0:
print('NO')
else:
for i in range(n-2):
if i!= 0:
if a[i]=='?' and a[i-1]!='?':
if a[i+1]!='?':
print('YES')
elif a[i+2]==a[i**1]:
print('YES')
else: print ('NO')
elif a[i]=='?' and i==0: print('YES') | elif a[i+2]==a[i**1]: | 13 | operation |
vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p<0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | if i % p<0: | 7 | decision |
vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p==vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | if p==vertices * 3: | 17 | decision |
vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it>=0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | if it>=0: | 28 | decision |
vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 192]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | primelist = [2, 3, 5, 192] | 3 | value |
vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if temp:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | vertices, edges = [int(c) for c in input().split(" ")]
primelist = [2, 3, 5, 7]
for i in range(11, 3*(10**5) + 10000, 2):
temp = True
for p in primelist:
if i % p == 0:
temp = False
break
elif i < p*p:
break
if y:
primelist.append(i)
mst_len = 0
for p in primelist:
if p > vertices * 3:
mst_len = p
break
print(2, mst_len)
print(1, 2, mst_len - 2 - 2*(vertices-3))
for i in range(3, vertices+1):
print(1, i, 2)
it = edges - (vertices-1)
for i in range(2, vertices+1):
if it <= 0:
break
for j in range(i+1, vertices+1):
if it <= 0:
break
print(i, j, 10**8 - 1)
it -= 1 | if y: | 12 | statement |
def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])<<1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])<<1),sep='') | 18 | operation |
def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-113)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | c^=1<<(ord(s[i])-113) | 23 | value |
def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]<'1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | if f and s[0]<'1': | 14 | decision |
def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1*(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | for i in s:c^=1*(ord(i)-48) | 21 | operation |
def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j-48) | def bitcount(x):
res=0
while x:
res+=x&1
x>>=1
return res
for Z in range(int(input())):
s,f=input(),True
for i in range(1,len(s)):
if s[i]!='0':
f=False
break
if f and s[0]=='1':
print('9'*(len(s)-2))
continue
if f:
print(chr(ord(s[0])-1),'9'*(len(s)-2),chr(ord(s[0])-1),sep='')
continue
c=0
for i in s:c^=1<<(ord(i)-48)
for i in range(len(s)-1,-1,-1):
c^=1<<(ord(s[i])-48)
if f:break
for j in range(ord(s[i])-1,48,-1):
c^=1<<(j-48)
if bitcount(c)<=len(s)-1-i:
t=''
for k in range(ord('0'),ord('9')+1):
if c&(1<<(k-48)):t=chr(k)+t
print(s[:i],chr(j),'9'*(len(s)-i-1-len(t)),t,sep='')
f=1
break
c^=1<<(j>>48) | c^=1<<(j>>48) | 34 | operation |
import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),2) != i):
max = i
elif(max < i):
max = i
print(max) | import math
x=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),2) != i):
max = i
elif(max < i):
max = i
print(max) | x=int(input()) | 2 | statement |
import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),2) != i):
max = i
elif(max < i):
max = i
print(max) | import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),2) != i):
max = i
elif(max>i):
max = i
print(max) | elif(max>i): | 9 | decision |
import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),2) != i):
max = i
elif(max < i):
max = i
print(max) | import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),46) != i):
max = i
elif(max < i):
max = i
print(max) | if(math.pow(int(math.sqrt(i)),46) != i): | 7 | value |
import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),2) != i):
max = i
elif(max < i):
max = i
print(max) | import math
n=int(input())
nums=[int(x) for x in input().split()]
max=-999999
for i in nums:
if(max < i and i > 0):
if(math.pow(int(math.sqrt(i)),138) != i):
max = i
elif(max < i):
max = i
print(max) | if(math.pow(int(math.sqrt(i)),138) != i): | 7 | value |
n = int(input())
s = list(input().split(" "))
loop = len(s)
while loop > 0:
c = 0
for index, item in enumerate(s):
if item in ('a', 'e', 'i', 'o', 'u', 'y'):
c += 1
else:
c = 0
if c == 2:
c = 1
s.remove(item)
loop -= 1
print(*s) | n = int(input())
s = list(input().split(" "))
loop = len(s)
while loop > 0:
c = 0
for index, x in enumerate(s):
if item in ('a', 'e', 'i', 'o', 'u', 'y'):
c += 1
else:
c = 0
if c == 2:
c = 1
s.remove(item)
loop -= 1
print(*s) | for index, x in enumerate(s): | 6 | statement |
r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2>=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2<=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | if dx**2+dy**2<=r**2: | 3 | decision |
r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2>=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2>=r**2:
print(x1,y1,r)
quit()
elif dy<0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | elif dy<0: | 6 | decision |
r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2>=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2>=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**77/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | y=(r1**77/(dx**2/dy**2+1))**0.5 | 11 | value |
r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2>=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | r,x1,y1,x2,y2=map(float,input().split())
dx,dy=x2-x1,y2-y1
if dx**2+dy**2<=r**2:
print(x1,y1,r)
quit()
elif dy==0:
x,y=(x1+x2)/2,0
print(x+x2,y+y2,abs(x))
quit()
r1=(r+(dx**2+dy**2)**0.5)/2
y=(r1**2/(dx**2/dy**2+1))**0.5
x=y*dx/dy
print(x+x2,y+y2,r1) | if dx**2+dy**2<=r**2: | 3 | decision |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]>>1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | if (len(a[i]) == 1 and s[a[i]>>1] == s[a[i]+1]) or (len(a[i]) > 1): | 24 | operation |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i])==1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i])==1): | 24 | decision |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n^1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | for i in range (0, n^1): | 4 | operation |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n|1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | for i in range (0, n|1): | 4 | operation |
n = int(input())
s = input()
ans = n
for i in range (0, n-1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | n = int(input())
s = input()
ans = n
for i in range (0, n&1):
if(s[i] == s[i+1] and s[i] != "?"):
print("NO")
raise SystemExit
if s[0] == "?" or s[n-1] == "?":
print("YES")
raise SystemExit
a = []
b = []
for i in range(0,n-1):
if s[i]=="?":
b.append(i)
else:
if len(b) > 0 :
a.append(b)
b.clear()
if len(b) > 0:
a.append(b)
for i in range(0, len(a)):
if (len(a[i]) == 1 and s[a[i]-1] == s[a[i]+1]) or (len(a[i]) > 1):
print("YES")
print(a[i])
raise SystemExit
print("NO") | for i in range (0, n&1): | 4 | operation |
n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1>=n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | while a<<1>=n: | 5 | decision |
n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0>k:
ans += a
a >>= 1
k0 += 1
print(ans) | while k0>k: | 12 | decision |
n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < x:
ans += a
a >>= 1
k0 += 1
print(ans) | while k0 < x: | 12 | statement |
n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
y(ans) | y(ans) | 17 | statement |
n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<1 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | n, k = list(map(int, input().split()))
a = 1
ans = 1
while a<<31 <= n:
a <<= 1
ans <<= 1
ans += 1
k0 = 0
ans = 0
while k0 < k:
ans += a
a >>= 1
k0 += 1
print(ans) | while a<<31 <= n: | 5 | value |
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
print(len(x),'',end='') | n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]*1]
x.update(y)
a.append(x)
print(len(x),'',end='') | y=a[b[i]*1] | 10 | operation |
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
print(len(x),'',end='') | n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]>>1]
x.update(y)
a.append(x)
print(len(x),'',end='') | y=a[b[i]>>1] | 10 | operation |
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
print(len(x),'',end='') | n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+160):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
print(len(x),'',end='') | for j in range(i-k,i+k+160): | 7 | value |
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k+1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
print(len(x),'',end='') | n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
x=set()
y=set()
for j in range(i-k,i+k%1):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
print(len(x),'',end='') | for j in range(i-k,i+k%1): | 7 | operation |
def ans(l):
if (len(l)==0):
return False
mm=l.count(max(l))
if (l.count(max(l))%2):
return True
else:
return ans(l[:len(l)-l.count(max(l))])
n=int(input())
l=[int(x) for x in input().split()]
l.sort()
if (l.count(max(l))==n):
if (n%2==0):
print("Agasa")
else:
print("Conan")
elif (l.count(max(l))%2):
print("Conan")
else:
if (ans(l[:len(l)-l.count(max(l))])):
print("Conan")
else:
print("Agasa") | def ans(l):
if (len(l)==0):
return False
mm=l.count(max(l))
if (l.count(max(l))%2):
return True
else:
return ans(l[:len(l)-l.count(max(l))])
n=int(input())
l=[int(x) for x in input().split()]
l.sort()
if (l.count(max(l))<n):
if (n%2==0):
print("Agasa")
else:
print("Conan")
elif (l.count(max(l))%2):
print("Conan")
else:
if (ans(l[:len(l)-l.count(max(l))])):
print("Conan")
else:
print("Agasa") | if (l.count(max(l))<n): | 13 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.