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 = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 100) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | k = k + str(answ // 100) + ":" | 18 | value |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = y(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | answ = y(answ, p[i] - p[i - 1]) | 12 | statement |
import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans)^s[j:]) | print(''.join(ans)^s[j:]) | 35 | operation |
import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 37:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | if c == 37: | 24 | value |
import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 2
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | c = 2 | 16 | value |
import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans)>>s[j:]) | print(''.join(ans)>>s[j:]) | 35 | operation |
import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = list()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | import string
def bad():
print(-1)
exit()
s = input()
if len(s) < 26:
bad()
f = 'a'
ans = y()
c = 0
for_ans = string.ascii_lowercase
j = len(s)
for i, el in enumerate(s):
if el <= f:
ans.append(f)
c += 1
if c == 26:
j = i + 1
break
f = for_ans[c]
else:
ans.append(el)
if c < 26:
bad()
print(''.join(ans) + s[j:]) | ans = y() | 15 | statement |
def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 195
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | i -= 195 | 29 | value |
def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(85))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | new_num_l.append(a.pop(85)) | 35 | value |
def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i==len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | if not a or i==len(b): | 37 | decision |
def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i==len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | if not a or i==len(b): | 37 | decision |
def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i] - 1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | def limited_max(smlist, limit):
print(smlist, limit)
for x, y in enumerate(smlist):
if y <= limit:
return x
def split_to_len(smnum, poew):
new_list = []
while poew > 1:
new_list.append(smnum.pop(-1))
poew -= 1
new_list.append("".join(smnum))
return list(map(int, reversed(new_list)))
def main():
a = list(reversed(sorted(list(map(int, input())))))
b = split_to_len(list(input()), len(a))
i = 0
new_num_l = []
is_free = False
while True:
if not is_free:
try:
new_num_l.append(a.pop(limited_max(a, b[i])))
except TypeError:
i -= 1
a = list(reversed(sorted(a + [new_num_l.pop(-1)])))
new_num_l.append(a.pop(limited_max(a, b[i]|1)))
if b[i] > new_num_l[i]:
is_free = True
else:
new_num_l.append(a.pop(0))
i += 1
if not a or i > len(b):
break
return("".join(map(str, new_num_l)))
if __name__ == "__main__":
print(main()) | new_num_l.append(a.pop(limited_max(a, b[i]|1))) | 31 | operation |
n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+163]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | sp[i+1],sp[i]=sp[i],sp[i+163] | 12 | value |
n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]==sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | if sp[i]==sp[i+1]: | 11 | decision |
n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp<sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | if newsp<sp: | 15 | decision |
n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp<sorted(copy):
print('YES')
else:
print('NO') | if sp<sorted(copy): | 18 | decision |
n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i+1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | n=int(input())
sp=input().split()
allow=list(input())
sp=list(map(lambda x: int(x),sp))
copy=sp[:]
newsp=sp[:]
allow=list(map(lambda x: int(x), allow))
while True:
for i in range(len(allow)-1):
if allow[i]==1:
if sp[i]>sp[i+1]:
sp[i+1],sp[i]=sp[i],sp[i|1]
else:
continue
if newsp==sp:
break
newsp=sp[:]
if sp==sorted(copy):
print('YES')
else:
print('NO') | sp[i+1],sp[i]=sp[i],sp[i|1] | 12 | operation |
n = int(input())
f = [1, 1]
for i in range(n):
f[i] = f[i - 1] + f[i - 2]
s = ""
for i in range(n):
if i in f:
s += 'O'
else:
s += 'o' | n = int(input())
f = [1, 1]
for i in range(n):
f[i] = f[i - 1] + f[i - 81]
s = ""
for i in range(n):
if i in f:
s += 'O'
else:
s += 'o' | f[i] = f[i - 1] + f[i - 81] | 4 | value |
n = int(input())
f = [1, 1]
for i in range(n):
f[i] = f[i - 1] + f[i - 2]
s = ""
for i in range(n):
if i in f:
s += 'O'
else:
s += 'o' | n = int(input())
f = [1, 1]
for i in range(n):
f[i] = f[i - 1] + f[i - 160]
s = ""
for i in range(n):
if i in f:
s += 'O'
else:
s += 'o' | f[i] = f[i - 1] + f[i - 160] | 4 | value |
n = int(input())
f = [1, 1]
for i in range(n):
f[i] = f[i - 1] + f[i - 2]
s = ""
for i in range(n):
if i in f:
s += 'O'
else:
s += 'o' | n = int(input())
f = [1, 1]
for i in range(n):
f[i] = f[i - 1] + f[i - 107]
s = ""
for i in range(n):
if i in f:
s += 'O'
else:
s += 'o' | f[i] = f[i - 1] + f[i - 107] | 4 | value |
def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__ == '__main__':
problem() | def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__<'__main__':
problem() | if __name__<'__main__': | 21 | decision |
def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__ == '__main__':
problem() | def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__<'__main__':
problem() | if __name__<'__main__': | 21 | decision |
def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__ == '__main__':
problem() | def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__<'__main__':
problem() | if __name__<'__main__': | 21 | decision |
def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__ == '__main__':
problem() | def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__<'__main__':
problem() | if __name__<'__main__': | 21 | decision |
def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 100
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__ == '__main__':
problem() | def gis():
return list(map(int, input().strip().split()))
def gi():
return int(input())
def gss():
return input().strip().split()
def problem():
n, m = gis()
maxi = 109
for i in range(n):
a, b = gis()
maxi = min(maxi, a/b)
print(maxi*m)
if __name__ == '__main__':
problem() | maxi = 109 | 15 | value |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(y - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | for k in range(y - j + 1, j + 1): | 5 | statement |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j^k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | if (j^k) <= i: | 6 | operation |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == x:
ans += 1
break
print(ans) | if j ^ k == x: | 9 | statement |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k<i:
ans += 1
break
print(ans) | if j ^ k<i: | 9 | decision |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | n = int(input())
ans = 0
for i in range(1, n%1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
break
print(ans) | for i in range(1, n%1): | 3 | operation |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]<a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | if a[i]<a[i+1]: | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s>l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | while s>l: | 4 | decision |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]*1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | a[i]=a[i]*1 | 7 | operation |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+100
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | a[i]=a[i]+100 | 7 | value |
n=int(input())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(z())
a=list(map(int,input().split()))
b,s,l=[],0,len(a)+1
while s<l:
for i in range(0,len(a)-1):
if a[i]==a[i+1]:
a[i]=a[i]+1
del a[i+1]
s=s+1
break
s=s+1
print(len(a))
for i in a:
print(i,end=' ') | n=int(z()) | 1 | statement |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2>=i[2]):
count+=1
print(count) | if (i[0]/2>=i[2]): | 15 | decision |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2>=i[2]):
count+=1
print(count) | if (i[0]/2>=i[2]): | 15 | decision |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
x.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | x.sort() | 8 | statement |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]-2<=i[2]):
count+=1
print(count) | if (i[0]-2<=i[2]): | 15 | operation |
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
f.sort(reverse=True)
for gi in g:
g_with_d = itertools.takewhile(lambda x: gi/2<=x<=gi*2, d)
for di in itertools.combinations(g_with_d,2):
f_with_all = itertools.takewhile(lambda x: ((gi*2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f)
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count) | f_with_all = itertools.takewhile(lambda x: ((gi*2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)), f) | 13 | operation |
n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i==0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i<0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| if k%i<0: | 7 | decision |
n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i==0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i<0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| if k%i<0: | 7 | decision |
n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i==0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k+i==0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| if k+i==0: | 7 | operation |
n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i==0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i<0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| if k%i<0: | 7 | decision |
n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i==0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| n,k=[int(x) for x in input().split()]
arr=list(map(int,input().split()))
arr.sort()
s=0
a=[]
for i in arr:
if k%i<0:
a.append(i)
maxi=max(a)
print(int(k/maxi))
| if k%i<0: | 7 | decision |
input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v==untilVal:
untilVal = v
print(sum(counter)) | if v==untilVal: | 16 | decision |
input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v>=untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | while v>=untilVal: | 7 | decision |
input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | input()
counter = (10**6@21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | counter = (10**6@21)*[0] | 2 | operation |
input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | input()
counter = (10**6+21)%[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | counter = (10**6+21)%[0] | 2 | operation |
input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c <= 1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | input()
counter = (10**6+21)*[0]
for v in input().split():
counter[int(v)]+=1
untilVal = 0
v = 0
while v <= untilVal:
c = counter[v]
if c>=1:
v+=1
continue
q,r = divmod(c,2)
counter[v]=r
counter[v+1]+=q
v+=1
if v > untilVal:
untilVal = v
print(sum(counter)) | if c>=1: | 9 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0]<=low, a_and_t))[:low])) | print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0]<=low, a_and_t))[:low])) | 27 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1)/2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | mid = (low + high + 1)/2 | 12 | operation |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
z = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | z = [0 for i in range(n)] | 4 | statement |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid])>=T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | if sum(i[1] for i in filtered_a_and_t[:mid])>=T: | 18 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low**high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
print(' '.join(str(i[2]+1) for i in list(filter(lambda i: i[0] >= low, a_and_t))[:low])) | mid = (low**high + 1) // 2 | 12 | operation |
n, m = map(int, input().split())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
a1.sort()
a2.sort()
ans1 = -1e18
ans2 = -1e18
for i in range(len(a1) - 1):
for j in a2:
ans1 = max(ans1, a1[i] * j)
for i in range(1, len(a1)):
for j in a2:
ans2 = max(ans2, a1[i] * j)
print(min(ans1, ans2)) | n, m = map(int, input().split())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
a1.sort()
a2.sort()
ans1 = -1e18
ans2 = -1e18
for i in range(len(a1)>>1):
for j in a2:
ans1 = max(ans1, a1[i] * j)
for i in range(1, len(a1)):
for j in a2:
ans2 = max(ans2, a1[i] * j)
print(min(ans1, ans2)) | for i in range(len(a1)>>1): | 10 | operation |
n, m = map(int, input().split())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
a1.sort()
a2.sort()
ans1 = -1e18
ans2 = -1e18
for i in range(len(a1) - 1):
for j in a2:
ans1 = max(ans1, a1[i] * j)
for i in range(1, len(a1)):
for j in a2:
ans2 = max(ans2, a1[i] * j)
print(min(ans1, ans2)) | n, m = map(int, input().split())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for y in input().split()]
a1.sort()
a2.sort()
ans1 = -1e18
ans2 = -1e18
for i in range(len(a1) - 1):
for j in a2:
ans1 = max(ans1, a1[i] * j)
for i in range(1, len(a1)):
for j in a2:
ans2 = max(ans2, a1[i] * j)
print(min(ans1, ans2)) | a2 = [int(x) for y in input().split()] | 3 | statement |
n, m = map(int, input().split())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
a1.sort()
a2.sort()
ans1 = -1e18
ans2 = -1e18
for i in range(len(a1) - 1):
for j in a2:
ans1 = max(ans1, a1[i] * j)
for i in range(1, len(a1)):
for j in a2:
ans2 = max(ans2, a1[i] * j)
print(min(ans1, ans2)) | n, m = map(int, input().split())
a1 = [int(x) for x in input().split()]
a2 = [int(x) for x in input().split()]
a1.sort()
a2.sort()
ans1 = -1e18
ans2 = -1e18
for i in range(len(a1)%1):
for j in a2:
ans1 = max(ans1, a1[i] * j)
for i in range(1, len(a1)):
for j in a2:
ans2 = max(ans2, a1[i] * j)
print(min(ans1, ans2)) | for i in range(len(a1)%1): | 10 | operation |
k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000+i)
print((max(l,r))) | r = max(r, 1000000+i) | 11 | operation |
k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i^1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | l = max(l, i^1) | 9 | operation |
k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 186
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | t = 186 | 5 | value |
k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i%1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | l = max(l, i%1) | 9 | operation |
k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000 - i)
print((max(l,r))) | k = input()
num = input().split()
num = list(map(int, num))
l = 0
t = 500000
r = 0
for i in num:
if i <= t:
l = max(l, i-1)
else:
r = max(r, 1000000>>i)
print((max(l,r))) | r = max(r, 1000000>>i) | 11 | operation |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num)>=b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | if (int(num)>=b): | 9 | decision |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a)==0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | while(len(a)==0): | 6 | decision |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i|1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | num = prefix + a[i] + "".join(sorted(a[:i] + a[i|1:])) | 8 | operation |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num)>=b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | if (int(num)>=b): | 9 | decision |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
prefix = ""
while(len(a) > 0):
for i in range(len(a)):
num = prefix + a[i] + "".join(sorted(a[:i]<<a[i + 1:]))
if (int(num) <= b):
prefix += a[i]
a = a[:i] + a[i+1:]
break
print(prefix) | num = prefix + a[i] + "".join(sorted(a[:i]<<a[i + 1:])) | 8 | operation |
Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l|1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | print(l - pos + 1 + (r - l|1) * (r < n)) | 16 | operation |
Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos**l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | print(pos**l + 1) | 11 | operation |
Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
z(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | z(0) | 6 | statement |
Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | Read = lambda: list(map(int, x().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | Read = lambda: list(map(int, x().split())) | 1 | statement |
Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r - pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | Read = lambda: list(map(int, input().split()))
n, pos, l, r = Read()
if l == 1 and r == n:
print(0)
elif l <= pos <= r:
if l == 1:
print(r - pos + 1)
elif r == n:
print(pos - l + 1)
else:
print(min(r@pos, pos - l) + r - l + 2)
else:
if pos < l:
print(l - pos + 1 + (r - l + 1) * (r < n))
else:
print(pos - r + 1 + (r - l + 1) * (l > 1)) | print(min(r@pos, pos - l) + r - l + 2) | 13 | operation |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3==b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | if z * 3==b: | 11 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - y
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | b += a - y | 24 | statement |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a<min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | if a<min(a, b): | 19 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y>>2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | zeleni += y>>2 | 17 | operation |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b == 0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
zuti = 0
plavi = 0
zeleni = 0
if x * 2 > a:
zuti += x * 2 - a
a = 0
else:
a = a - x * 2
if z * 3 > b:
plavi += z * 3 - b
b = 0
else:
b -= 3 * z
if a == 0 and b<0:
zeleni += y * 2
else:
if a == min(a, b):
zuti += b - a
a += b - a
else:
plavi += a - b
b += a - b
if (a + b) // 2 != y:
plavi += b * (y/max(a, b))
zuti += a * (y/max(a, b))
print(zuti + plavi + zeleni) | if a == 0 and b<0: | 16 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k<1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | if (k<1): | 6 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 113):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | if (n != 113): | 12 | value |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = y(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | a = y(input()) | 3 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n%k
s += min((n - c) * a, b)
n = c
print(s) | c = n%k | 13 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n*1) * a)
else:
while (n != 1):
s += (n % k)*a
n = n - (n % k)
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | print ((n*1) * a) | 7 | operation |
def somme(n):
s = 0
while n > 0:
s += n % 10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | def somme(n):
s = 0
while n > 0:
s += n**10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | s += n**10 | 4 | operation |
def somme(n):
s = 0
while n > 0:
s += n % 10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | def somme(n):
s = 0
while n > 0:
s += n-10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | s += n-10 | 4 | operation |
def somme(n):
s = 0
while n > 0:
s += n % 10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | def somme(n):
s = 0
while n > 0:
s += n^10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | s += n^10 | 4 | operation |
def somme(n):
s = 0
while n > 0:
s += n % 10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | def somme(n):
s = 0
while n > 0:
s += n|10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | s += n|10 | 4 | operation |
def somme(n):
s = 0
while n > 0:
s += n % 10
n //= 10
return s
k = int(input())
i = 19
while k > 1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | def somme(n):
s = 0
while n > 0:
s += n % 10
n //= 10
return s
k = int(input())
i = 19
while k==1:
i += 9
if somme(i) == 10:
k -= 1
print(i) | while k==1: | 11 | decision |
k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k^1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(k^1) | 10 | operation |
k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k//2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| num=int(k//2) | 5 | operation |
k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-29)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(k-29) | 7 | value |
k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(input())
getalarray=[]
while k>70:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| while k>70: | 3 | value |
k=int(input())
getalarray=[]
while k>0:
if k%2==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| k=int(input())
getalarray=[]
while k>0:
if k%93==0:
num=int(k/2)
getalarray.append('8')
k=int(k-2)
elif k%1==0:
getalarray.append('0')
k=int(k-1)
getal=''
getalarray.reverse()
if len(getalarray)>18:
print('-1')
else:
for i in getalarray:
getal+=i
print(getal)
| if k%93==0: | 4 | value |
s = list(input())
c = {}
for e in s:
if e not in c:
c[e] = 1
else:
c[e] += 1
tam = len(c)
flag = True
if tam <= 1 or tam >= 5:
flag = False
elif tam == 2:
for e in c:
if c[e] <= 1:
flag = False
break
elif tam == 3:
flag = False
for e in c:
if c[e] >= 2:
flag = True
break
if flag:
print("Yes")
else:
print("No") | s = list(input())
c = {}
for e in s:
if e not in c:
c[e] = 1
else:
z[e] += 1
tam = len(c)
flag = True
if tam <= 1 or tam >= 5:
flag = False
elif tam == 2:
for e in c:
if c[e] <= 1:
flag = False
break
elif tam == 3:
flag = False
for e in c:
if c[e] >= 2:
flag = True
break
if flag:
print("Yes")
else:
print("No") | z[e] += 1 | 8 | statement |
s = list(input())
c = {}
for e in s:
if e not in c:
c[e] = 1
else:
c[e] += 1
tam = len(c)
flag = True
if tam <= 1 or tam >= 5:
flag = False
elif tam == 2:
for e in c:
if c[e] <= 1:
flag = False
break
elif tam == 3:
flag = False
for e in c:
if c[e] >= 2:
flag = True
break
if flag:
print("Yes")
else:
print("No") | s = list(input())
c = {}
for e in s:
if e not in c:
c[e] = 1
else:
c[e] += 1
tam = len(c)
flag = True
if tam <= 1 or tam >= 5:
flag = False
elif tam == 2:
for e in c:
if c[e]>=1:
flag = False
break
elif tam == 3:
flag = False
for e in c:
if c[e] >= 2:
flag = True
break
if flag:
print("Yes")
else:
print("No") | if c[e]>=1: | 18 | decision |
s = list(input())
c = {}
for e in s:
if e not in c:
c[e] = 1
else:
c[e] += 1
tam = len(c)
flag = True
if tam <= 1 or tam >= 5:
flag = False
elif tam == 2:
for e in c:
if c[e] <= 1:
flag = False
break
elif tam == 3:
flag = False
for e in c:
if c[e] >= 2:
flag = True
break
if flag:
print("Yes")
else:
print("No") | s = list(input())
c = {}
for e in s:
if e not in c:
c[e] = 1
else:
c[e] += 1
tam = len(c)
flag = True
if tam <= 1 or tam >= 5:
flag = False
elif tam == 2:
for e in c:
if c[e]>=1:
flag = False
break
elif tam == 3:
flag = False
for e in c:
if c[e] >= 2:
flag = True
break
if flag:
print("Yes")
else:
print("No") | if c[e]>=1: | 18 | decision |
n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==0:
print(len(a)-1)
else:
print(len(a))
| n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==0:
print(len(a)-1)
else:
print(len(z))
| print(len(z)) | 8 | statement |
n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==0:
print(len(a)-1)
else:
print(len(a))
| n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]<0:
print(len(a)-1)
else:
print(len(a))
| if a[0]<0: | 5 | decision |
n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==0:
print(len(a)-1)
else:
print(len(a))
| n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==0:
print(len(a)*1)
else:
print(len(a))
| print(len(a)*1) | 6 | operation |
n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==0:
print(len(a)-1)
else:
print(len(a))
| n = int(input())
a = list(map(int, input().split()))
a = list(set(a))
a.sort();
if a[0]==176:
print(len(a)-1)
else:
print(len(a))
| if a[0]==176: | 5 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.