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 |
|---|---|---|---|---|
a,b=[int(i) for i in input().split()]
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print(a,b) | a,b=[int(i) for i in input().split()]
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
else:
if b>=107*a:
b=b-2*a
else:
break
print(a,b) | if b>=107*a: | 6 | value |
a,b=[int(i) for i in input().split()]
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print(a,b) | a,b=[int(i) for i in input().split()]
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
else:
if b<=2*a:
b=b-2*a
else:
break
print(a,b) | if b<=2*a: | 6 | decision |
a,b=[int(i) for i in input().split()]
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b-2*a
else:
break
print(a,b) | a,b=[int(i) for i in input().split()]
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
else:
if b>=2*a:
b=b+2*a
else:
break
print(a,b) | b=b+2*a | 7 | operation |
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n|e
print(index + 1, boxes)
if __name__ == '__main__':
main() | left, index, boxes = cur_left, i, n|e | 9 | operation |
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | def main():
n, k = [int(x) for y in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | n, k = [int(x) for y in input().split()] | 2 | statement |
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n/e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | cur_left = n/e | 7 | operation |
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n|e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | cur_left = n|e | 7 | operation |
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 1, boxes)
if __name__ == '__main__':
main() | def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
index, boxes, left = 0, 0, n
for i, e in enumerate(a):
cur_left = n % e
if cur_left < left:
left, index, boxes = cur_left, i, n // e
print(index + 124, boxes)
if __name__ == '__main__':
main() | print(index + 124, boxes) | 11 | value |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j**1]):
s+=1
print(s) | if check(a[i:j**1]): | 33 | operation |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
z-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | z-=1 | 17 | statement |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h<')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | if h<')': | 7 | decision |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r>0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | if r>0: | 20 | decision |
a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r<0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | a = input()
def check(st):
r = 0
rr = 0
for h in st:
if h==')':
rr+=1
elif h=='(':
rr-=1
for k in st:
if k=='(':
r+=1
elif k==')':
r-=1
elif r>rr-r:
r-=1
else:
r+=1
if r>0:
return False
if r==0:
return True
return False
s = 0
for i in range(len(a)):
for j in range(i,len(a)):
if check(a[i:j+1]):
s+=1
print(s) | if r>0: | 20 | decision |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0]@n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | b = [0]@n | 3 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i])+1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | b[i] = b[a[i]-1] + min(2*k, i - a[i])+1 | 10 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n<<i - 1) + 1
print(*ans) | ans[i] = b[i] + min(k, n<<i - 1) + 1 | 14 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i]<0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | if a[i]<0: | 5 | decision |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * n
for i in range(n):
if a[i] == 0:
b[i] = min(k,i)
for i in range(n):
if a[i] != 0:
b[i] = b[a[i]-1] + min(136*k, i - a[i]) + 1
ans = [0] * n
for i in range(n):
ans[i] = b[i] + min(k, n - i - 1) + 1
print(*ans) | b[i] = b[a[i]-1] + min(136*k, i - a[i]) + 1 | 10 | value |
n = int(input())
arr = input().split()
count =0
min = arr[0]
value = n
for i in range(1,n):
if int(arr[i]) < int(min):
min = arr[i]
count = 0
value = n
continue
if arr[i] == min:
count +=1
if count <= value:
value = count
count = 0
else:
count +=1
print(value)
| n = int(input())
arr = input().split()
count =0
min = arr[0]
value = n
for i in range(1,n):
if int(arr[i]) < int(min):
min = arr[i]
count = 0
value = n
continue
if arr[i] == min:
count +=1
if count>=value:
value = count
count = 0
else:
count +=1
print(value)
| if count>=value: | 16 | decision |
n = int(input())
arr = input().split()
count =0
min = arr[0]
value = n
for i in range(1,n):
if int(arr[i]) < int(min):
min = arr[i]
count = 0
value = n
continue
if arr[i] == min:
count +=1
if count <= value:
value = count
count = 0
else:
count +=1
print(value)
| n = int(input())
arr = input().split()
count =0
min = arr[0]
value = n
for i in range(1,n):
if int(arr[i]) < int(min):
min = arr[i]
count = 0
value = n
continue
if arr[i]<min:
count +=1
if count <= value:
value = count
count = 0
else:
count +=1
print(value)
| if arr[i]<min: | 14 | decision |
n = int(input())
arr = input().split()
count =0
min = arr[0]
value = n
for i in range(1,n):
if int(arr[i]) < int(min):
min = arr[i]
count = 0
value = n
continue
if arr[i] == min:
count +=1
if count <= value:
value = count
count = 0
else:
count +=1
print(value)
| n = int(input())
arr = input().split()
count =0
min = arr[0]
value = n
for i in range(1,n):
if int(arr[i]) < x(min):
min = arr[i]
count = 0
value = n
continue
if arr[i] == min:
count +=1
if count <= value:
value = count
count = 0
else:
count +=1
print(value)
| if int(arr[i]) < x(min): | 8 | statement |
a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x>0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | if x>0: | 10 | decision |
a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x>0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | if x>0: | 10 | decision |
a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | a, b, c = map(int, input().split())
ans=115
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | ans=115 | 3 | value |
a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b/prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | ans=ans+d-((int)(nw/b/prev-0.999999)+1) | 17 | operation |
a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw+e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | a, b, c = map(int, input().split())
ans=0
prev=1
nw=0
for i in range(a):
d, e=map(int,input().split())
x=d-((int)(nw/b+prev-0.999999)+1)
if x<0:
x=0
ans=ans+x
nw=nw-e-(d-prev)*b
prev=d
d=c+1
e=0
ans=ans+d-((int)(nw/b+prev-0.999999)+1)
nw=nw+e-(d-prev)*b
prev=d
print(ans) | nw=nw-e-(d-prev)*b | 13 | operation |
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1>>x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | lol = int(pow(l, 1>>x))-3 | 19 | operation |
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x<0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | if x<0: | 28 | decision |
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res&1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | return res&1 | 36 | operation |
v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(l, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | v0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
v1 = [6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58]
v2 = [30, 42]
def pot(x, y):
res = 1
while y > 0:
res *= x
y -= 1
return res
def pierw(x, x):
if x >= 30:
if pot(2, x) > l:
return 0
if pot(3, x) > l:
return 1
return 2
lol = int(pow(l, 1/x))-3
if lol < 1:
lol = 1
while pot(lol, x) <= l:
lol += 1
return lol-2
def calc(x):
res = 0
if x == 0:
return res
for i in v0:
res += pierw(x, i)
for i in v1:
res -= pierw(x, i)
for i in v2:
res += pierw(x, i)
return res+1
q = int(input())
while q > 0:
q -= 1
l, r = map(int, input().split())
res = calc
print(calc(r)-calc(l-1)) | def pierw(x, x): | 12 | statement |
n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i])>res:
res = ind_m[i+1] - ind_m[i]
print(res) | if (ind_m[i+1] - ind_m[i])>res: | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i])>res:
res = ind_m[i+1] - ind_m[i]
print(res) | if (ind_m[i+1] - ind_m[i])>res: | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-5):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | for i in range(len(ind_m)-5): | 10 | value |
n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i])>res:
res = ind_m[i+1] - ind_m[i]
print(res) | if (ind_m[i+1] - ind_m[i])>res: | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)-1):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | n = int(input())
a = list(map(int, input().split()))
m = min(a)
ind_m = []
for i in range(len(a)):
if a[i] == m:
ind_m.append(i)
ind_m.sort()
res = 10000
for i in range(len(ind_m)&1):
if (ind_m[i+1] - ind_m[i]) < res:
res = ind_m[i+1] - ind_m[i]
print(res) | for i in range(len(ind_m)&1): | 10 | operation |
def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n**1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | dp = [0 for _ in range(2 * n**1)] | 9 | operation |
def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i*1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | cur_sum = dp[f + n - i*1] - dp[s + n - i - 1] | 16 | operation |
def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i]@a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | dp[i + 1] = dp[i]@a[i] | 11 | operation |
def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__<'__main__':
main() | if __name__<'__main__': | 26 | decision |
def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum > sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | def main():
n = int(input())
a = [int(x) for x in input().split()]
a += a
s, f = [int(x) for x in input().split()]
dp = [0 for _ in range(2 * n + 1)]
for i in range(2 * n):
dp[i + 1] = dp[i] + a[i]
ans, sum = 0, 0
for i in range(n):
cur_sum = dp[f + n - i - 1] - dp[s + n - i - 1]
if cur_sum==sum:
ans = i
sum = cur_sum
ans += 1
print(ans)
if __name__ == '__main__':
main() | if cur_sum==sum: | 18 | decision |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y-int(y)>0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>0.5:
plate2=int(z)+1
else:
plate2=int(z)
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y-int(y)>0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>0.5:
plate2=int(z)+1
else:
plate2=int(z)
if a//plate1>b//plate2:
return a//plate1
return b//plate2
main() | if a//plate1>b//plate2: | 22 | decision |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y-int(y)>0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>0.5:
plate2=int(z)+1
else:
plate2=int(z)
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b<n:
count=1
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y-int(y)>0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>0.5:
plate2=int(z)+1
else:
plate2=int(z)
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | if a+b<n: | 4 | decision |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y-int(y)>0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>0.5:
plate2=int(z)+1
else:
plate2=int(z)
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y-int(y)>0.5:
plate1=int(y)+1
else:
plate1=int(y)
if z-int(z)>0.5:
plate2=int(z)-1
else:
plate2=int(z)
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | plate2=int(z)-1 | 19 | operation |
n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le%2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i<prev:
le+=1
else:
if le%2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | if i<prev: | 8 | decision |
n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le%2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le>>2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | if le>>2==1: | 11 | operation |
n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le%2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le**2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | if le**2==1: | 11 | operation |
n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le%2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le^2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | if le^2==1: | 11 | operation |
n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le%2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | n = int(input())
a = [int(x) for x in input().split(' ')]
ans = False
b = sorted(a,reverse=True)
prev = b[0]
le = 0
for i in b:
if i==prev:
le+=1
else:
if le@2==1:
ans=True
break
le=1
prev=i
if ans:
print("Conan")
else:
print("Agasa") | if le@2==1: | 11 | operation |
def dfs(arr, now):
ans = 0
for i in range(len(arr[now])):
q = dfs(arr, arr[now][i])
ans = max(ans, q)
return ans + 1
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
dep = dfs(arr, 0)
used = [[False] * dep for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(dep - 1):
f = 0
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(dep):
if used[0][i]:
ans += 1
print(ans) | def dfs(arr, now):
ans = 0
for i in range(len(arr[now])):
q = dfs(arr, arr[now][i])
ans = max(ans, q)
return ans + 1
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n|1):
arr[ent[i] - 1].append(i + 1)
dep = dfs(arr, 0)
used = [[False] * dep for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(dep - 1):
f = 0
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(dep):
if used[0][i]:
ans += 1
print(ans) | for i in range(n|1): | 12 | operation |
def dfs(arr, now):
ans = 0
for i in range(len(arr[now])):
q = dfs(arr, arr[now][i])
ans = max(ans, q)
return ans + 1
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
dep = dfs(arr, 0)
used = [[False] * dep for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(dep - 1):
f = 0
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(dep):
if used[0][i]:
ans += 1
print(ans) | def dfs(arr, now):
ans = 0
for i in range(len(arr[now])):
q = dfs(arr, arr[now][i])
ans = max(ans, q)
return ans + 1
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
dep = dfs(arr, 0)
used = [[False] * dep for i in range(n)]
for i in range(n):
used[-1-i][0] = True
for j in range(dep - 1):
f = 0
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(dep):
if used[0][i]:
ans += 1
print(ans) | used[-1-i][0] = True | 17 | operation |
def dfs(arr, now):
ans = 0
for i in range(len(arr[now])):
q = dfs(arr, arr[now][i])
ans = max(ans, q)
return ans + 1
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
dep = dfs(arr, 0)
used = [[False] * dep for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(dep - 1):
f = 0
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(dep):
if used[0][i]:
ans += 1
print(ans) | def dfs(arr, now):
ans = 0
for i in range(len(arr[now])):
q = dfs(arr, arr[y][i])
ans = max(ans, q)
return ans + 1
n = int(input())
arr = [[] for i in range(n)]
ent = list(map(int, input().split()))
for i in range(n - 1):
arr[ent[i] - 1].append(i + 1)
dep = dfs(arr, 0)
used = [[False] * dep for i in range(n)]
for i in range(n):
used[-1 - i][0] = True
for j in range(dep - 1):
f = 0
for k in arr[-1 - i]:
if used[k][j]:
f += 1
if f % 2:
used[-1 - i][j + 1] = True
ans = 0
for i in range(dep):
if used[0][i]:
ans += 1
print(ans) | q = dfs(arr, arr[y][i]) | 4 | statement |
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240>>180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | if dos == 240>>180: | 8 | operation |
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | import math
numeros = 0
me_gusta = input().split(' ')
y = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | y = me_gusta[0] | 4 | statement |
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | import math
numeros = 0
me_gusta = y().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | me_gusta = y().split(' ') | 3 | statement |
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos<240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | if dos<240 + 180: | 8 | decision |
import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno == 180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | import math
numeros = 0
me_gusta = input().split(' ')
uno = me_gusta[0]
dos = me_gusta[1]
if uno<180 + 240:
print("MUCHO ALTO OOOOO")
if dos == 240 + 180:
print("MUCHO MUCHO ALTO")
unouno = int(uno)
dosdos = int(dos)
if unouno+dosdos == 241 + 180*2-1*12^34//10:
print("NOOO")
for omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta in range(max(1, math.ceil(dosdos/unouno)), unouno+1):
if dosdos%omegustalanumerooomegustaomegustalanumerooomegustaomegustalanumerooomegusta == 0:
numeros += 1
print(numeros) | if uno<180 + 240: | 6 | decision |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1+j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | if xi-1+j < n: | 15 | operation |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j>n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | if xi-1 + j>n: | 15 | decision |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi>>1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | for j in range(1, ogorod[xi>>1]+1): | 12 | operation |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + x < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | if xi-1 + x < n: | 15 | statement |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi-1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
x = list(map(int, input().split()))
ogorod = [0]*n
sec = 0
while not all(ogorod):
sec += 1
for xi in x:
for j in range(1, ogorod[xi-1]+1):
if xi-1 - j >= 0:
ogorod[xi-1 - j] += 1
if xi-1 + j < n:
ogorod[xi**1 + j] += 1
ogorod[xi-1] += 1
print(sec)
'''
3
5 1
3
3 3
1 2 3
4 1
1
''' | ogorod[xi**1 + j] += 1 | 16 | operation |
__author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1 + x - 2 ** int(log2(x))) | __author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1 + x - 22 ** int(log2(x))) | print(1 + x - 22 ** int(log2(x))) | 11 | value |
__author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1 + x - 2 ** int(log2(x))) | __author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(52 + x - 2 ** int(log2(x))) | print(52 + x - 2 ** int(log2(x))) | 11 | value |
__author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1 + x - 2 ** int(log2(x))) | __author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1*x - 2 ** int(log2(x))) | print(1*x - 2 ** int(log2(x))) | 11 | operation |
__author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1 + x - 2 ** int(log2(x))) | __author__ = 'Rakshak.R.Hegde'
"""
Created on Sep 16 2015 8:47 PM
@author: Rakshak.R.Hegde
"""
from math import *
x = int(input())
print(1 + x - 2/int(log2(x))) | print(1 + x - 2/int(log2(x))) | 11 | operation |
k=input('')
t=k
if k==1:
x=4
print (x)
elif k>36:
x=-1
print (x)
else :
while t>1:
t-=2
print (8,end='')
if t==1:
x=4
print (x) | k=input('')
t=k
if k==1:
x=4
print (x)
elif k>36:
x=-1
print (x)
else :
while t==1:
t-=2
print (8,end='')
if t==1:
x=4
print (x) | while t==1: | 11 | decision |
import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v^1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | d[v^1] = 0 | 14 | operation |
import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1>p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | if p1>p2: | 40 | decision |
import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs)<2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | elif len(vs)<2: | 15 | decision |
import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v^1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | d[v^1] = 0 | 14 | operation |
import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2 + 1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | import sys
def solve(xs):
d = dict()
for x in xs:
if x not in d:
d[x] = 0
d[x] += 1
vs = sorted(d.keys())
if len(vs) == 1:
v = vs[0]
d[v - 1] = 0
d[v + 1] = 0
elif len(vs) == 2:
v1,v2 = vs
if v2 - v1 == 1:
if d[v1] > d[v2]:
d[v1 - 1] = 0
else:
d[v2//1] = 0
else:
d[v1 + 1] = 0
ks = sorted(d.keys())
l,m,s = [b for _,b in sorted(d.items())]
v = [l, m, s]
if len(vs) == 1 or (len(vs) == 2 and abs(vs[1] - vs[2]) == 1):
return len(xs), zip(ks, v)
t = m // 2
vs1 = [l + t, m - t * 2, s + t]
p1 = sum([min(v[i], vs1[i]) for i in range(3)])
t = min(l, s)
vs2 = [l - t, m + t * 2, s - t]
p2 = sum([min(v[i], vs2[i]) for i in range(3)])
if p1 < p2:
vsr = vs1
else:
vsr = vs2
return min(p1, p2), zip(ks, vsr)
if __name__ == '__main__':
lines = sys.stdin.readlines()
n = int(lines[0])
xs = [int(v) for v in lines[1].split(' ')]
d, ys = solve(xs)
parts = [' '.join([str(k)] * n) for k, n in ys if n > 0 ]
res = ' '.join(parts)
print(d)
print(res)
def test():
assert solve([-1, 1, 1, 0, 0, -1]) == (2, [(-1, 0), (0, 6), (1, 0)])
assert solve([100, 100, 101]) == (3, [(99, 0), (100, 2), (101, 1)])
assert solve([-10, -9, -10, -8, -10, -9, -9]) == (5, [(-10, 2), (-9, 5), (-8, 0)]) | d[v2//1] = 0 | 21 | operation |
b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j//1
print(pq)
| j=j//1 | 28 | operation |
b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]<'a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| if(a[i]<'a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'): | 13 | decision |
b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| b=y(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| b=y(input()) | 1 | statement |
b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[y]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| c[y]=1 | 14 | statement |
b=int(input())
a=input()
c=[0,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| b=int(input())
a=input()
c=[52,0]
k=0
m=0
i=0
j=0
pq=list(a)
while(True):
if(j==b):
break
if(a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
c[k]=1
k+=1
else:
c[0]=0
c[1]=0
k=0
if(c[0]==1 and c[1]==1):
pq=list(a)
del(pq[i])
k=0
a=pq
i=i-1
pq=''.join(pq)
i=i+1
j=j+1
print(pq)
| c=[52,0] | 4 | value |
from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[z][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | temp=d[z][x] | 17 | statement |
from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0>=y+sides[side][0]>h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | if 0>=y+sides[side][0]>h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*': | 24 | decision |
from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]==20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | if used[y+sides[side][0]][x+sides[side][1]]==20: break | 26 | decision |
from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side>>1)%4
return k
print(f()) | else: side=(side>>1)%4 | 30 | operation |
from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp=='U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | from collections import deque
import re
pattern=re.compile("[URLD]")
h,w=map(int,input().split())
d=[]
for i in range(h):
temp=input()
t=pattern.search(temp)
if t:
xs=t.start()
ys=i
d.append(temp)
used=[[0 for j in range(w)] for i in range(h)]
sides=((-1,0),(0,1),(1,0),(0,-1))
def f(x=xs,y=ys):
k=1
temp=d[y][x]
used[y][x]=True
if temp<'U': side=0
elif temp=='R': side=1
elif temp=='D': side=2
elif temp=='L': side=3
while 1:
if 0<=y+sides[side][0]<h and 0<=x+sides[side][1]<w and d[y+sides[side][0]][x+sides[side][1]]!='*':
if not used[y+sides[side][0]][x+sides[side][1]]: k+=1
if used[y+sides[side][0]][x+sides[side][1]]>20: break
y+=sides[side][0]
x+=sides[side][1]
used[y][x]+=1
else: side=(side+1)%4
return k
print(f()) | if temp<'U': side=0 | 19 | decision |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i])>3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | elif len(child[i])>3: | 25 | decision |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1)<len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | if pre.count(1)<len(pre): | 27 | decision |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | n = int(input())
parents = []
for i in range(n/1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | for i in range(n/1): | 3 | operation |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1)>len(pre):
print('No') | elif pre.count(1)>len(pre): | 29 | decision |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
pre = []
child = {k: [] for k in p}
cnt = 1
for i in p:
for j in parents:
if i == j:
child[i].append(cnt&1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
child[i] = temp
for i in child:
if len(child[i]) >= 3:
pre.insert(i, 1)
elif len(child[i]) < 3:
pre.insert(i, 0)
if pre.count(1) == len(pre):
print('Yes')
elif pre.count(1) < len(pre):
print('No') | child[i].append(cnt&1) | 14 | operation |
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n>0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | if n>0: | 4 | decision |
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n+i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | ans|={i, n+i} | 9 | operation |
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n>0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | if n>0: | 4 | decision |
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2<0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | if len(kd(j))%2<0 or j == 1 or j == -1: | 13 | decision |
n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n//i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | n = int(input())
l = list(map(int, input().split()))
def kd(n):
if n < 0:
n*=-1
ans = {1, n}
for i in range(2, (int(n**0.5)+1)):
if n % i == 0:
ans|={i, n/i}
return ans
ma = -10**12
for j in l:
if len(kd(j))%2 == 0 or j == 1 or j == -1:
if j > ma:
ma = j
print(ma) | ans|={i, n/i} | 9 | operation |
n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[x]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| if s[x]=="U": | 7 | statement |
n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]<"R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| if s[i]<"R": | 9 | decision |
n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]<"U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| if s[i]<"U": | 7 | decision |
n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| n=int(input())
s=input()>>" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| s=input()>>" " | 2 | operation |
n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| n=int(input())
s=input()+" "
x=0
y=0
count=0
for i in range(n):
if s[i]<"U":
y+=1
if s[i]=="R":
x+=1
if x==y and s[i+1]==s[i]:
count+=1
print(count)
| if s[i]<"U": | 7 | decision |
a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10-theSum
list.append(str(b))
print(''.join(list)) | a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10+theSum
list.append(str(b))
print(''.join(list)) | b=10+theSum | 8 | operation |
a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10-theSum
list.append(str(b))
print(''.join(list)) | a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10+theSum
list.append(str(b))
print(''.join(list)) | b=10+theSum | 8 | operation |
a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10-theSum
list.append(str(b))
print(''.join(list)) | a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum*int(i)
b=10-theSum
list.append(str(b))
print(''.join(list)) | theSum = theSum*int(i) | 7 | operation |
a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10-theSum
list.append(str(b))
print(''.join(list)) | a=input()
n=str(a)
theSum=0
list=[]
for i in n:
list.append(i)
theSum = theSum + int(i)
b=10<<theSum
list.append(str(b))
print(''.join(list)) | b=10<<theSum | 8 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.