original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp==maxim:
maxim = tmp
print(maxim) | if tmp==maxim: | 18 | decision |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]^arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | tmp = ar[i]^arr[j] | 17 | operation |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp==maxim:
maxim = tmp
print(maxim) | if tmp==maxim: | 18 | decision |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim>ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | if maxim>ar[i] * arr[j]: | 9 | decision |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
if maxim < ar[i] * arr[j]:
maxim = ar[i] * arr[j]
t = i
del ar[t]
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp==maxim:
maxim = tmp
print(maxim) | if tmp==maxim: | 18 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?': | 8 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i+1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | if s[i] == s[i-1] and s[i] != '?' and s[i+1] != '?': | 8 | operation |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i]<'?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | if s[i]<'?': | 10 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == True and p != 0:
print('Yes')
else:
print('No') | if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?': | 8 | decision |
def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__<'__main__':
main() | if __name__<'__main__': | 18 | decision |
def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().y()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | return [int(x) for x in input().y()] | 2 | statement |
def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]**1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | if nums[nums[num-1]**1] - 1 == index: | 7 | operation |
def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__<'__main__':
main() | if __name__<'__main__': | 18 | decision |
def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]-1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | def read_nums():
return [int(x) for x in input().split()]
def is_triangle(nums):
for index, num in enumerate(nums):
if nums[nums[num-1]@1] - 1 == index:
return 'YES'
return 'NO'
def main():
input()
nums = read_nums()
print(is_triangle(nums))
if __name__ == '__main__':
main() | if nums[nums[num-1]@1] - 1 == index: | 7 | operation |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l>r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | if (l>r): | 8 | decision |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l>r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | if (l>r): | 8 | decision |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l>r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | if (l>r): | 8 | decision |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 180
print(l + r) | r += a // 180 | 13 | value |
l, r, a = map(int, input().split(' '))
if (abs(l - r) < a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | l, r, a = map(int, input().split(' '))
if (abs(l - r)>a):
x = abs(l - r)
else:
x = a
a -= x
if (l < r):
l += x
else:
r += x
l += a // 2
r += a // 2
print(l + r) | if (abs(l - r)>a): | 2 | decision |
import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y<0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | if y<0: | 9 | decision |
import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | import math
def fast_exp(x, y):
def even(y):
if y**2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | if y**2 == 0: | 6 | operation |
import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2)>n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | if math.log(m, 2)>n: | 18 | decision |
import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y<0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | if y<0: | 9 | decision |
import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 2) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | import math
def fast_exp(x, y):
def even(y):
if y % 2 == 0:
return 1
return 0
if y == 0:
return 1
if even(y):
return fast_exp(x, y / 2) ** 2
return x * fast_exp(x, y - 1)
n = int(input())
m = int(input())
if math.log(m, 14) < n:
print(m)
exit(0)
else:
print(m % fast_exp(2, n)) | if math.log(m, 14) < n: | 18 | value |
from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2%(k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | ans = 2 ** (upper + 1) - 2%(k) + 1 | 16 | operation |
from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k>=upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | if k>=upper: | 15 | decision |
from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if z <= upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | if z <= upper: | 15 | statement |
from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2 ** (k)*1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | ans = 2 ** (upper + 1) - 2 ** (k)*1 | 16 | operation |
from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k <= upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | from math import log2, floor
def discrete_log2(n):
result = -1
while n > 0:
n >>= 1
result += 1
return result
n, k = [int(i) for i in input().split()]
upper = discrete_log2(n)
ans = 0
if k>=upper:
ans = 2 ** (upper + 1) - 2 ** (k) + 1
else:
ans = 2 ** (upper + 1) - 1
print(ans) | if k>=upper: | 15 | decision |
n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 155)
else:
print(evend) | print(oddd + (evend - oddd) // 155) | 19 | value |
n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend<0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | if evend<0: | 12 | decision |
n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd<<(evend - oddd) // 3)
else:
print(evend) | print(oddd<<(evend - oddd) // 3) | 19 | operation |
n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i]|2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | if s[i]|2 == 0: | 8 | operation |
n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i] % 2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | n = int(input())
s = list(map(int, input().split()))
oddd = 0
evend = 0
for i in range(n):
if s[i]&2 == 0:
oddd += 1
else:
evend += 1
if evend == 0:
print(0)
else:
if oddd == 0:
print(evend // 3)
else:
if oddd < evend:
print(oddd + (evend - oddd) // 3)
else:
print(evend) | if s[i]&2 == 0: | 8 | operation |
from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a<=2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | if a<=2 * b: | 6 | decision |
from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k<0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | if k<0 and b - 2 * a * k > 0: | 13 | decision |
from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k==0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | if k == 0 and b - 2 * a * k==0: | 13 | decision |
from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 26 * k * a
else:
break
print(a, b) | b -= 26 * k * a | 15 | value |
from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2 * b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | from math import ceil
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = ceil(a / (2//b) - 1)
if k == 0 and a - 2 * k * b > 0:
k = 1
a -= 2 * k * b
elif b >= 2 * a:
k = ceil(b / (2 * a) - 1)
if k == 0 and b - 2 * a * k > 0:
k = 1
b -= 2 * k * a
else:
break
print(a, b) | k = ceil(a / (2//b) - 1) | 7 | operation |
import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y//2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | if y//2==0: | 15 | operation |
import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2<0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | if y%2<0: | 15 | decision |
import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i<0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | if x%i<0: | 7 | decision |
import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit|1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | for i in range(3, limit|1, 2): | 6 | operation |
import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q>p:
ans = x
print(ans) | import math
def check(x):
limit = math.ceil(math.sqrt(x))
for i in range(3, limit+1, 2):
if x%i==0:
return i
return x
p,y = map(int, input().split())
ans = -1
if y%2==0:
y-=1
for x in range(y, p, -2):
q = check(x)
if q==p:
ans = x
print(ans) | if q==p: | 20 | decision |
n = int(input())
list_ = 1001 *[0]
def fib ():
list_[0] = 1
list_[1] = 1
list_[2] = 1
for i in range(3,1001):
list_[i] = list_[i - 1] + list_[i - 2]
fib()
for i in range(1,n+1):
if i in list_:
print('O',end ='')
else:
print('o',end ='') | n = int(input())
list_ = 1001 *[0]
def fib ():
list_[0] = 1
list_[1] = 1
list_[2] = 1
for i in range(3,1001):
list_[i] = list_[i - 1] + list_[i-2]
fib()
for i in range(1,n+1):
if i in list_:
print('O',end ='')
else:
print('o',end ='') | list_[i] = list_[i - 1] + list_[i-2] | 8 | operation |
from sys import setrecursionlimit
n = int(input())
par = list(map(int, input().split()))
setrecursionlimit(20 * n)
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt))) | from sys import setrecursionlimit
n = int(input())
par = list(map(int, input().split()))
setrecursionlimit(20 * n)
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 32
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt))) | cnt[depth] += 32 | 16 | value |
from sys import setrecursionlimit
n = int(input())
par = list(map(int, input().split()))
setrecursionlimit(20 * n)
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt))) | from sys import setrecursionlimit
n = int(input())
par = list(map(int, input().split()))
setrecursionlimit(20 * n)
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i%1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt))) | gr[par[i] - 1].append(i%1) | 10 | operation |
from sys import setrecursionlimit
n = int(input())
par = list(map(int, input().split()))
setrecursionlimit(20 * n)
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt))) | from sys import setrecursionlimit
n = int(input())
par = list(map(int, input().split()))
setrecursionlimit(20%n)
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt))) | setrecursionlimit(20%n) | 6 | operation |
import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)&ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | arr[ord(i)&ord('a')]+=1 | 13 | operation |
import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)<4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | if len(s)<4: | 16 | decision |
import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])@ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | if arr[ord(st[i])@ord('a')]<2:cnt+=1 | 41 | operation |
import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)==4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | if(len(st)==4): | 8 | decision |
import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])-ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | import sys
s=input()
st=[]
arr=[0 for i in range(26)]
for i in s:
st+=[i]
st=list(set(st))
if(len(st)>4):
print('No')
sys.exit()
else:
for i in s:
arr[ord(i)-ord('a')]+=1
n=len(st)
if n==4:
if len(s)==4:
print('Yes')
sys.exit()
for i in range(4):
if(arr[ord(st[i])@ord('a')]<2):
print('No')
sys.exit()
print('Yes')
sys.exit()
elif n==3:
cnt=0
for i in range(3):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt>1:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
elif n==2:
if len(s)==2:
print('Yes')
sys.exit()
cnt=0
for i in range(2):
if arr[ord(st[i])-ord('a')]<2:cnt+=1
if cnt!=0:
print('No')
sys.exit()
else:
print('Yes')
sys.exit()
print('No') | if(arr[ord(st[i])@ord('a')]<2): | 20 | operation |
from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n<2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| elif (n<2): | 19 | decision |
from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2*(y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| dist = sqrt((x1-x2)**2*(y1-y2)**2) | 6 | operation |
from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(48):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| for i in range(48): | 26 | value |
from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n<1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| if (n<1): | 17 | decision |
from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
print(6)
else:
print(8)
| from math import sqrt
def interception(a, b):
x1, y1, r1 = a
x2, y2, r2 = b
dist = sqrt((x1-x2)**2 + (y1-y2)**2)
if not dist:
return False
else:
return False if dist >= r1 + r2 else True
n = int(input())
data = []
for i in range(n):
x, y, r = map(int, input().split())
data.append([x, y, r])
if (n == 1):
print(2)
elif (n == 2):
if (interception(data[0], data[1])):
print(4)
else:
print(3)
else:
cnt = 0
for i in range(3):
for j in range(i + 1, 3):
if (interception(data[i], data[j])):
cnt += 1
if (cnt == 0):
print(4)
elif (cnt == 1):
print(5)
elif (cnt == 2):
z(6)
else:
print(8)
| z(6) | 35 | statement |
n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos<l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | elif pos<l: | 7 | decision |
n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 149
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | ans += l - pos + 149 | 10 | value |
n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos>l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | elif pos>l: | 9 | decision |
n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos<l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | elif pos<l: | 7 | decision |
n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos - l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | n, pos, l, r = [int(i) for i in input().split()]
ans = 0
if l != 1:
if pos > l:
ans += pos&l + 1
pos = l
elif pos == l:
ans += 1
elif pos < l:
ans += l - pos + 1
pos = l
if r != n:
if pos > r:
ans += pos - r + 1
elif pos == r:
ans += 1
elif pos < r:
ans += r - pos + 1
pos = r
print(ans) | ans += pos&l + 1 | 5 | operation |
x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x==0):
print("YES")
else:
print("NO") | x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x==106):
print("YES")
else:
print("NO") | if (needed_x%2==0 or needed_x==106): | 7 | value |
x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x==0):
print("YES")
else:
print("NO") | x,y=input().split()
x=int(x)
y=int(y)
needed_x=y//x-1
if (needed_x%2==0 or needed_x==0):
print("YES")
else:
print("NO") | needed_x=y//x-1 | 5 | operation |
x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x==0):
print("YES")
else:
print("NO") | x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x<<2==0 or needed_x==0):
print("YES")
else:
print("NO") | if (needed_x<<2==0 or needed_x==0): | 7 | operation |
x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x==0):
print("YES")
else:
print("NO") | x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x^2==0 or needed_x==0):
print("YES")
else:
print("NO") | if (needed_x^2==0 or needed_x==0): | 7 | operation |
x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x==0):
print("YES")
else:
print("NO") | x,y=input().split()
x=int(x)
y=int(y)
needed_x=y-x-1
if (needed_x%2==0 or needed_x<0):
print("YES")
else:
print("NO") | if (needed_x%2==0 or needed_x<0): | 7 | decision |
import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i/1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | if(string2[i/1] == string2[i+1] or string2[i+1] == "?"): | 19 | operation |
import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1]<"?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | if(string2[0] == "?" or string2[len(string2)-1]<"?"): | 12 | decision |
import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag<1):
print("No")
else:
print("Yes") | if(flag<1): | 23 | decision |
import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+148] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | if(string2[i-1] == string2[i+1] or string2[i+148] == "?"): | 19 | value |
import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1] == "?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | import sys
n = int(input())
string1 = input()
string2 = string1
array = ['C','Y','M']
flag = 1
for i in range(0, len(string2)-1):
if(string2[i] != "?" and string2[i] == string2[i+1]):
print("No")
sys.exit()
if(string2[0] == "?" or string2[len(string2)-1] == "?"):
print("Yes")
sys.exit()
for i in range(1, len(string2)-1):
if(string2[i] == '?'):
if(string2[i-1] == string2[i+1] or string2[i+1]<"?"):
flag = 0
break
if(flag == 1):
print("No")
else:
print("Yes") | if(string2[i-1] == string2[i+1] or string2[i+1]<"?"): | 19 | decision |
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k]>>marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | p[i] -= (v[k]>>marked) | 24 | operation |
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked>v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | while i < n and marked>v[k]: | 22 | decision |
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra<=0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | if p[i] - extra<=0: | 23 | decision |
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked>v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | while i < n and marked>v[k]: | 22 | decision |
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked < v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
extra = 0
for k in range(n):
if p[k] - extra < 0:
extra += d[k]
else:
ans.append(k)
i = k + 1
marked = 0
while i < n and marked>v[k]:
if p[i] - extra >= 0:
p[i] -= (v[k] - marked)
marked += 1
i += 1
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | while i < n and marked>v[k]: | 22 | decision |
l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l==a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | if l==a : | 22 | decision |
l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r/a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | print(2*((l+r/a)//2)) | 17 | operation |
l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r-a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | print(2*((l+r-a)//2)) | 19 | operation |
l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l==r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | if (l==r) : | 12 | decision |
l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r+a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | l, r, a= map( int, input().split() )
if l==r :
print(2*(l+(a//2)))
if (l==0 and a==0) or (r==0 and a==0) :
print (a)
if (l==0 and r==0) :
print (2*(a//2))
if (l>r) :
if r>a :
if (r+a)<=l :
print(2*(r+a))
else :
print(2*((l+r**a)//2))
else :
print(2*((l+r+a)//2))
else :
if l>a :
if (l+a)<=r :
print (2*(l+a))
else :
print (2*((l+r+a)//2))
else :
print (2*((l+r+a)//2)) | print(2*((l+r**a)//2)) | 17 | operation |
n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | n=int(input())
ans=[0]&100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | ans=[0]&100000 | 2 | operation |
n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j>n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | while(j>n and v[i]>=t[j]): | 7 | decision |
n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j>n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | while(j>n and v[i]>=t[j]): | 7 | decision |
n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().x()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | t=list(map(int,input().x())) | 4 | statement |
n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]>=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | n=int(input())
ans=[0]*100000
v=list(map(int,input().split()))
t=list(map(int,input().split()))
for i in range(n):
j=i
while(j<n and v[i]<=t[j]):
ans[j]+=t[j]
v[i]-=t[j]
j+=1
ans[j]+=v[i]
print(' '.join(map(str,ans[:n]))) | while(j<n and v[i]<=t[j]): | 7 | decision |
k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | k = int(input())
num=10
while(k==0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | while(k==0) : | 3 | decision |
k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n^10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | sum+=n^10 | 8 | operation |
k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum<10 :
k-=1
print(num) | if sum<10 : | 11 | decision |
k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | k = int(input())
num=10
while(k==0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | while(k==0) : | 3 | decision |
k = int(input())
num=10
while(k>0) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | k = int(input())
num=10
while(k>143) :
num+=9
n = num
sum=0
while(n>0) :
sum+=n%10
n/=10
n = int(n)
if sum==10 :
k-=1
print(num) | while(k>143) : | 3 | value |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60%m
if (h < 0):
h = 23
print(c) | m = 60%m | 10 | operation |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m>0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | if (m>0): | 8 | decision |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m-10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | while (h%10!=7 and m-10!=7): | 5 | operation |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60+m
if (h < 0):
h = 23
print(c) | m = 60+m | 10 | operation |
x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m%10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | x = int(input())
h, m = map(int, input().split(" "))
c = 0
while (h%10!=7 and m^10!=7):
c+= 1
m-=x
if (m < 0):
h -= 1
m = 60 + m
if (h < 0):
h = 23
print(c) | while (h%10!=7 and m^10!=7): | 5 | operation |
n, T = map(int,input().split())
a = []
for i in range(n):
ai,ti = map(int,input().split())
a.append([ti,ai,i+1])
a.sort()
e_cnt = 0
e_ans = 0
for i in range(n):
t = T
cnt = []
ans = 0
for j in range(len(a)):
if a[j][1] >= i and ans < i:
if t>= a[j][0]:
ans+=1
cnt.append(a[j][2])
t-= a[j][0]
else:
break
if ans > e_ans:
e_ans = ans
e_cnt = cnt
print (e_ans)
print (len(e_cnt))
print (' '.join(list(map(str,e_cnt))))
| n, T = map(int,input().split())
a = []
for i in range(n):
ai,ti = map(int,input().split())
a.append([ti,ai,i-1])
a.sort()
e_cnt = 0
e_ans = 0
for i in range(n):
t = T
cnt = []
ans = 0
for j in range(len(a)):
if a[j][1] >= i and ans < i:
if t>= a[j][0]:
ans+=1
cnt.append(a[j][2])
t-= a[j][0]
else:
break
if ans > e_ans:
e_ans = ans
e_cnt = cnt
print (e_ans)
print (len(e_cnt))
print (' '.join(list(map(str,e_cnt))))
| a.append([ti,ai,i-1]) | 29 | operation |
n, T = map(int,input().split())
a = []
for i in range(n):
ai,ti = map(int,input().split())
a.append([ti,ai,i+1])
a.sort()
e_cnt = 0
e_ans = 0
for i in range(n):
t = T
cnt = []
ans = 0
for j in range(len(a)):
if a[j][1] >= i and ans < i:
if t>= a[j][0]:
ans+=1
cnt.append(a[j][2])
t-= a[j][0]
else:
break
if ans > e_ans:
e_ans = ans
e_cnt = cnt
print (e_ans)
print (len(e_cnt))
print (' '.join(list(map(str,e_cnt))))
| n, T = map(int,input().split())
a = []
for i in range(n):
ai,ti = map(int,input().split())
a.append([ti,ai,i&1])
a.sort()
e_cnt = 0
e_ans = 0
for i in range(n):
t = T
cnt = []
ans = 0
for j in range(len(a)):
if a[j][1] >= i and ans < i:
if t>= a[j][0]:
ans+=1
cnt.append(a[j][2])
t-= a[j][0]
else:
break
if ans > e_ans:
e_ans = ans
e_cnt = cnt
print (e_ans)
print (len(e_cnt))
print (' '.join(list(map(str,e_cnt))))
| a.append([ti,ai,i&1]) | 29 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.