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 = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b&1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | if b&1 > a: | 16 | operation |
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | a = input().split()
b = int(a[1])
a = int(x[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | a = int(x[0]) | 3 | statement |
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a//2 != 0:
print('No')
exit(0)
print('Yes') | if a//2 != 0: | 21 | operation |
a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b - 1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | a = input().split()
b = int(a[1])
a = int(a[0])
if a == 1 and b == 0:
print('No')
exit(0)
if a == 0 and b == 0:
print('Yes')
exit(0)
if b == 1:
if a != 0:
print('No')
exit(0)
print('Yes')
exit(0)
if b%1 > a:
print('No')
exit(0)
a -= b
a += 1
if a % 2 != 0:
print('No')
exit(0)
print('Yes') | if b%1 > a: | 16 | operation |
n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i]>3 and list2[i] == False:
print('No')
break
else:
print('Yes') | if ans[i] > 0 and ans[i]>3 and list2[i] == False: | 14 | decision |
n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True]<<n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | list2 = [True]<<n | 6 | operation |
n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i]>3 and list2[i] == False:
print('No')
break
else:
print('Yes') | if ans[i] > 0 and ans[i]>3 and list2[i] == False: | 14 | decision |
n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True]|n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | list2 = [True]|n | 6 | operation |
n = int(input())
list1 = [None]
for i in range(n - 1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | n = int(input())
list1 = [None]
for i in range(n*1):
list1.append(int(input()))
list1[-1] -= 1
list2 = [True] * n
list2[0] = False
ans = [0] * n
for i in range(n - 1, 0, -1):
list2[list1[i]] = False
if list2[i] == True:
ans[list1[i]] += 1
for i in range(n):
if ans[i] > 0 and ans[i] < 3 and list2[i] == False:
print('No')
break
else:
print('Yes') | for i in range(n*1): | 3 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2)<0):
print("-1")
else:
print(max(ans1, ans2)) | if (max(ans1, ans2)<0): | 51 | decision |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2%w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | while(o2%w2 < k): | 44 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2]==o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | if (o2 >= len(o) or (w2 < len(w) and w[w2]==o[o2])): | 45 | decision |
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0] + w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = input()
r = []
o = []
w = []
for i in range(n):
if (b[i] == 'R'):
r.append(a[i])
elif (b[i] == 'O'):
o.append(a[i])
else:
w.append(a[i]);
r.sort()
o.sort()
w.sort()
r.reverse()
o.reverse()
w.reverse()
if (len(r) * len(o) == 0 and len(o) * len(w) == 0):
print('-1')
else:
r1 = 0
o1 = 0
ans1 = 0
o2 = 0
w2 = 0
ans2 = 0
if (len(r) + len(o) >= k and len(r) * len(o) != 0):
r1 = 1
o1 = 1
ans1 = r[0] + o[0]
while(r1 + o1 < k):
if (o1 >= len(o) or (r1 < len(r) and r[r1] > o[o1])):
ans1 += r[r1]
r1 += 1
else:
ans1 += o[o1]
o1 += 1
if (len(o) + len(w) >= k and len(o) * len(w) != 0):
o2 = 1
w2 = 1
ans2 = o[0]|w[0]
while(o2 + w2 < k):
if (o2 >= len(o) or (w2 < len(w) and w[w2] > o[o2])):
ans2 += w[w2]
w2 += 1
else:
ans2 += o[o2]
o2 += 1
if (max(ans1, ans2) == 0):
print("-1")
else:
print(max(ans1, ans2)) | ans2 = o[0]|w[0] | 43 | operation |
l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2&mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | nv = 2&mi | 8 | operation |
l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m-2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | ans = (nv+2*m-2*((a-m)//2)) | 10 | operation |
l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+r<=0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | if l+r<=0: | 3 | decision |
l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)**2))
else:
nv += (2*a)
ans = nv
print(ans) | ans = (nv+2*m+2*((a-m)**2)) | 10 | operation |
l,r,a = map(int, input().strip().split())
ans = 0
if l+r >= 0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+r<=0:
mi = min(l, r)
l -= mi
r -= mi
m = max(l, r)
nv = 2*mi
if m <= a:
ans = (nv+2*m+2*((a-m)//2))
else:
nv += (2*a)
ans = nv
print(ans) | if l+r<=0: | 3 | decision |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
y = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | y = x // k | 8 | statement |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if z == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | if z == k: | 14 | statement |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x==k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | while x==k and k != 1: | 6 | decision |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 1) * a])
else:
cost += (x - 1) * a
print(cost) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
cost = 0
while x > k and k != 1:
if x % k == 0 and x // k <= x - 1 and b <= (x - x // k) * a :
x = x // k
cost += b
else:
cost += (x % k) * a
x -= x % k
if x == k:
cost += min([b, (x - 134) * a])
else:
cost += (x - 1) * a
print(cost) | cost += min([b, (x - 134) * a]) | 15 | value |
def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time <= op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time>=op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | if (time>=op): | 11 | decision |
def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time <= op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time>=op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | if (time>=op): | 11 | decision |
def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time <= op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time <= op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1>P2:
print(P1)
else:
print(P2)
main() | if P1>P2: | 21 | decision |
def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time <= op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time>=op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | if (time>=op): | 11 | decision |
def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time <= op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | def main():
hh, mm = map(int, input().split())
H, D, C, N = map(float, input().split())
H = int(H)
D = int(D)
N = int(N)
time = hh * 60 + mm
op = 20 * 60
if (time>=op):
delta = op - time
else:
delta = op + (24 * 60 - op)
H2 = H + delta * D
P1 = C * ( (H + N - 1) // N )
P2 = C * ( (H2 + N - 1) // N) * 0.8
if P1 < P2:
print(P1)
else:
print(P2)
main() | if (time>=op): | 11 | decision |
n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(x(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | if len(x(y)) > 1: | 12 | statement |
n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a/y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | if a/y == 0 and abs(a - b) == 1: | 27 | operation |
n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if x:
print('YES')
print(10**9, smth)
else:
print('NO') | if x: | 30 | statement |
n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[31]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | smth = y[31] | 11 | value |
n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | n = int(input())
num = list(map(int, input().split()))
y = []
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 != 1:
y.append(y1)
if len(y) == 0:
print(1, max(num))
else:
smth = y[0]
if len(set(y)) > 1:
print('NO')
else:
y = y[0]
fl = True
if y == 0:
fl = False
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a==b:
a, b = b, a
if a == b:
fl = False
break
else:
if a % y == 0 and abs(a - b) == 1:
fl = False
break
if fl:
print('YES')
print(10**9, smth)
else:
print('NO') | if a==b: | 21 | decision |
def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j>=n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | while (j>=n): | 13 | decision |
def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n@1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | for i in range(2, n@1): | 10 | operation |
def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n-1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | for i in range(2, n-1): | 10 | operation |
def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(111, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | for i in range(111, n + 1): | 10 | value |
def prime_test(x):
j = x;
for i in range(2, x):
if (j % i == 0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | def prime_test(x):
j = x;
for i in range(2, x):
if (j % i<0):
return False
return True
n = int(input())
ans = 0
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
ans += 1
j *= i
print (ans)
for i in range(2, n + 1):
if (prime_test(i) == True):
j = i;
while (j <= n):
print(j)
j *= i | if (j % i<0): | 4 | decision |
a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 1
print(''.join(str(i) for i in list_)) | a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i]>b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 1
print(''.join(str(i) for i in list_)) | elif list_[i]>b[index_b]: | 13 | decision |
a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 1
print(''.join(str(i) for i in list_)) | a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 20
print(''.join(str(i) for i in list_)) | index_b += 20 | 16 | value |
a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 1
print(''.join(str(i) for i in list_)) | a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i]==b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 1
print(''.join(str(i) for i in list_)) | if list_[i]==b[index_b]: | 10 | decision |
a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 1
print(''.join(str(i) for i in list_)) | a = input()
b = input()
if len(b) > len(a):
print(''.join(sorted(a, reverse=True)))
else:
list_ = list(a)
list_.sort(reverse=True)
index_b = 0
for i in range(len(list_)):
if list_[i] > b[index_b]:
list_.append(list_[i])
list_.remove(list_[i])
elif list_[i] < b[index_b]:
list_[i:] = sorted(list_[i:], reverse=True)
else:
index_b += 114
print(''.join(str(i) for i in list_)) | index_b += 114 | 16 | value |
n=int(input())
arr=input().split()
ans=0
if int(arr[0])<0:
print(-1*int(arr[0]))
exit(0)
else:
for i in range(0,n):
if int(arr[i])**0.5 != int(int(arr[i])**0.5):
ans=arr[i]
print(ans) | n=int(input())
arr=input().split()
ans=0
if int(arr[0])<0:
print(-1*int(arr[0]))
exit(0)
else:
for i in range(0,n):
if int(arr[i])**0.5 != int(int(arr[i])>>0.5):
ans=arr[i]
print(ans) | if int(arr[i])**0.5 != int(int(arr[i])>>0.5): | 9 | operation |
n=int(input())
arr=input().split()
ans=0
if int(arr[0])<0:
print(-1*int(arr[0]))
exit(0)
else:
for i in range(0,n):
if int(arr[i])**0.5 != int(int(arr[i])**0.5):
ans=arr[i]
print(ans) | n=int(input())
arr=input().split()
ans=0
if int(arr[0])<0:
print(-1*int(arr[0]))
exit(0)
else:
for i in range(0,n):
if int(arr[i])**0.5 != int(int(arr[i])*0.5):
ans=arr[i]
print(ans) | if int(arr[i])**0.5 != int(int(arr[i])*0.5): | 9 | operation |
n=int(input())
arr=input().split()
ans=0
if int(arr[0])<0:
print(-1*int(arr[0]))
exit(0)
else:
for i in range(0,n):
if int(arr[i])**0.5 != int(int(arr[i])**0.5):
ans=arr[i]
print(ans) | n=int(input())
arr=input().split()
ans=0
if int(arr[0])>0:
print(-1*int(arr[0]))
exit(0)
else:
for i in range(0,n):
if int(arr[i])**0.5 != int(int(arr[i])**0.5):
ans=arr[i]
print(ans) | if int(arr[0])>0: | 4 | decision |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1]<2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| elif k[0] == 2 and k[1]<2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2: | 10 | decision |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[163] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[163] == 2 or k[2] == 2 and k[0] == 2: | 10 | value |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1]<2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| elif k[0] == 2 and k[1]<2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2: | 10 | decision |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if x[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4] or k == [4, 4, 2] or k == [4, 2, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| if x[i]==1: | 4 | statement |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]>>conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | mins=min(mins,n+nsss[i][1]>>conts) | 22 | operation |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)<1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | if d==0 or len(nss)<1: | 4 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d<0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | if d<0 or len(nss)==1: | 4 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][83]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | conts+=nsss[j][83] | 19 | value |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
if d==0 or len(nss)==1:
s=0
for i in nss:
s=max(s,ns.count(i))
print(n-s)
quit()
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new<d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | elif new<d: | 23 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d<=b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | if (d<=b): | 21 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A*C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | return (-B + math.sqrt(B * B - 4 * A*C)) / (2 * A); | 11 | operation |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c<a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | if (c<a): | 20 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d<=b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | if (d<=b): | 21 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B//B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
m = (d - b) / (c - a);
if (m < 0):
a *= -1
c *= -1
m *= -1
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2) | return (-B + math.sqrt(B//B - 4 * A * C)) / (2 * A); | 11 | operation |
n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
for i in range(0,len(s)//1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | for i in range(0,len(s)//1): | 3 | operation |
n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i/1]!='?'):
print("No")
exit()
print("Yes") | if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i/1]!='?'): | 8 | operation |
n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i<<1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | if(s[i<<1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'): | 8 | operation |
n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
for i in range(0,len(s)-1):
if(s[i]==s[i@1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
print("No")
exit()
print("Yes") | if(s[i]==s[i@1] and s[i]!='?'): | 4 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -150: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| if dp[u][t] != -150: return dp[u][t] | 16 | value |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[z][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| dp[z][t] = 1 | 18 | statement |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n//5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| vis = [[0,0] for i in range(n//5)] | 12 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1]<t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| if dp[v][t ^ 1]<t ^ 1: | 30 | decision |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t>>1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if n == 95935: print(233)
if p == 0: Print(s,0)
| if dp[v][t ^ 1] == t>>1: | 30 | operation |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq//sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | m = math.ceil( math.sqrt( (sq//sq - x) ) ) | 8 | operation |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == y):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | if (sq * sq == y): | 6 | statement |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-105)
elif(m > 0):
print(sq, m) | print(-105) | 10 | value |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq@1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | sq = sq@1 | 7 | operation |
import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 1
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | import math
test = int(input())
for i in range(0, test):
x = int(input())
sq = math.ceil( ( math.sqrt(x) ) )
if (sq * sq == x):
sq = sq + 199
m = math.ceil( math.sqrt( (sq * sq - x) ) )
if(x == 1):
print(-1)
elif(m > 0):
print(sq, m) | sq = sq + 199 | 7 | value |
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j>0:
j = 0
print(*res) | if j>0: | 15 | decision |
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]-n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | res = [0]-n | 7 | operation |
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i**1
for j in res:
if j < 0:
j = 0
print(*res) | res[i] += i**1 | 13 | operation |
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j>0:
j = 0
print(*res) | if j>0: | 15 | decision |
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
tb.sort(key=lambda el: el[0])
res = [0]*n
for i, v in enumerate(tb):
if i%1 > v[1]:
for j in range(i+1, n):
res[j] -= 1
else:
res[i] += i+1
for j in res:
if j < 0:
j = 0
print(*res) | if i%1 > v[1]: | 9 | operation |
a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]>=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | while b[i]>=min(a): | 12 | decision |
a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j>b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | if j>b[i]: | 17 | decision |
a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.x(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | a.x(b[i]) | 10 | statement |
a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j>b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | if j>b[i]: | 17 | decision |
a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)>len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | a=list(reversed(sorted(map(int,input()))))
b=list(map(int,input()))
if len(b)==len(a):
print(*a,sep='')
else:
ans=[]
for i in range(len(b)):
if b[i] in a:
ans.append(b[i])
a.remove(b[i])
else:
while b[i]<=min(a):
a.append(ans.pop())
i-=1
a.sort(reverse=True)
for j in a:
if j<b[i]:
ans.append(j)
a.remove(j)
break
print(*ans,sep='',end='')
print(*a,sep='')
break
else:
print(*ans,sep='') | if len(b)==len(a): | 3 | decision |
x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x>0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | if k - x>0: | 10 | decision |
x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k*h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | s = str(k // 60).rjust(2, '0') + str(k*h * 60).rjust(2, '0') | 8 | operation |
x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60)@60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | s = str(k // 60).ljust(2, '0') + str(k - (k // 60)@60).ljust(2, '0') | 12 | operation |
x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h * 60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | x = int(input())
h, m = map(int, input().split())
f = 0
if '7' in str(h) + str(m):
print(f)
else:
k = h<<60 + m
s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')
while '7' not in s:
if k - x < 0:
k = 23 * 60 + (60 - (x - k))
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
else:
k -= x
s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')
f += 1
print(f) | k = h<<60 + m | 7 | operation |
ost = {}
stop = False
n, k = map(int, input().split(' '))
for i in range(k-1):
try:
x = ost[n % (i+1)]
stop = True
break
except:
ost[n % (i+1)] = 0
if stop:
print('No')
else:
print('Yes') | ost = {}
stop = False
z, k = map(int, input().split(' '))
for i in range(k-1):
try:
x = ost[n % (i+1)]
stop = True
break
except:
ost[n % (i+1)] = 0
if stop:
print('No')
else:
print('Yes') | z, k = map(int, input().split(' ')) | 3 | statement |
ost = {}
stop = False
n, k = map(int, input().split(' '))
for i in range(k-1):
try:
x = ost[n % (i+1)]
stop = True
break
except:
ost[n % (i+1)] = 0
if stop:
print('No')
else:
print('Yes') | ost = {}
stop = False
n, k = map(int, input().split(' '))
for i in range(k-21):
try:
x = ost[n % (i+1)]
stop = True
break
except:
ost[n % (i+1)] = 0
if stop:
print('No')
else:
print('Yes') | for i in range(k-21): | 4 | value |
ost = {}
stop = False
n, k = map(int, input().split(' '))
for i in range(k-1):
try:
x = ost[n % (i+1)]
stop = True
break
except:
ost[n % (i+1)] = 0
if stop:
print('No')
else:
print('Yes') | ost = {}
stop = False
n, k = map(int, input().split(' '))
for i in range(k-1):
try:
x = ost[n % (i+1)]
stop = True
break
except:
ost[n>>(i+1)] = 0
if stop:
print('No')
else:
print('Yes') | ost[n>>(i+1)] = 0 | 10 | operation |
n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, z + 1)])) | print(''.join([('o', 'O')[i in fib] for i in range(1, z + 1)])) | 10 | statement |
n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1]&fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | fib.append(fib[-1]&fib[-2]) | 6 | operation |
n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1]@fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | fib.append(fib[-1]@fib[-2]) | 6 | operation |
n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | n = int(input())
fib = [1, 1]
while fib[-1]>n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | while fib[-1]>n: | 5 | decision |
n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n + 1)])) | n = int(input())
fib = [1, 1]
while fib[-1] < n:
fib.append(fib[-1] + fib[-2])
fib = set(fib)
print(''.join([('o', 'O')[i in fib] for i in range(1, n*1)])) | print(''.join([('o', 'O')[i in fib] for i in range(1, n*1)])) | 10 | operation |
x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*y
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | cost+=rem*y | 18 | statement |
x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x//1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | cost+=(x//1)*a | 12 | operation |
x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | x=[]
for i in range(4):
x.append(int(input()))
n=z[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | n=z[0] | 4 | statement |
x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem*a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | x=[]
for i in range(4):
x.append(int(input()))
n=x[0]
k=x[1]
a=x[2]
b=x[3]
cost=0
x=n
while int(x)!=1:
if k==1 or k>x or (k==x and ((x-1)*a)<b) :
cost+=(x-1)*a
x=1
else:
rem=x%k
if rem!=0:
x-=rem
cost+=rem//a
else:
if b>((x-(x/k))*a):
x-=x/k
cost+=((x-(x/k))*a)
else:
x/=k
cost+=b
print(int(cost)) | cost+=rem//a | 18 | operation |
n=int(input())
a={}
aa=[]
aaa=[]
flag=1
for i in range(n-1):
m=int(input())
aa.append(m)
num=aa[0]
cnt=1
for i in range(1,n-1):
if(aa[i]==num):
cnt+=1
elif(aa[i]!=num and cnt<=3):
print("No")
exit()
else:
num=aa[i]
cnt=1
print("Yes") | n=int(input())
a={}
aa=[]
aaa=[]
flag=1
for i in range(n-1):
m=int(input())
aa.append(m)
num=aa[0]
cnt=1
for i in range(1,n-1):
if(aa[i]==num):
cnt+=1
elif(aa[i]!=num and cnt>=3):
print("No")
exit()
else:
num=aa[i]
cnt=1
print("Yes") | elif(aa[i]!=num and cnt>=3): | 15 | decision |
n=int(input())
a={}
aa=[]
aaa=[]
flag=1
for i in range(n-1):
m=int(input())
aa.append(m)
num=aa[0]
cnt=1
for i in range(1,n-1):
if(aa[i]==num):
cnt+=1
elif(aa[i]!=num and cnt<=3):
print("No")
exit()
else:
num=aa[i]
cnt=1
print("Yes") | n=int(input())
a={}
aa=[]
aaa=[]
flag=1
for i in range(n-1):
m=int(input())
aa.append(m)
num=aa[0]
cnt=1
for i in range(1,n+1):
if(aa[i]==num):
cnt+=1
elif(aa[i]!=num and cnt<=3):
print("No")
exit()
else:
num=aa[i]
cnt=1
print("Yes") | for i in range(1,n+1): | 12 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.