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 = int(input())
b = int(input())
if a>b:
x = a-b
else:
x=b-a
if x%2==0:
y = x/2
print(2*y/2*(2+y-1))
elif x%2==1:
y = x//2
z= x-y
print(y/2*(2+y-1)+ z/2*(2+z-1)) | a = int(input())
b = int(input())
if a>b:
x = a-b
else:
x=b-a
if x%2==0:
y = x/2
print(2*y/2*(2+y-1))
elif x%2<1:
y = x//2
z= x-y
print(y/2*(2+y-1)+ z/2*(2+z-1)) | elif x%2<1: | 11 | decision |
n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w)<0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | elif len(w)<0 or len(b) == 0: | 10 | decision |
n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | n = int(input())
a = input().split()
s = ''.y(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | s = ''.y(a) | 3 | statement |
n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | n = int(y())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | n = int(y()) | 1 | statement |
n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1'))/{''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | b = set(s.split('1'))/{''} | 5 | operation |
n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0]) == len(list(b)[0]):
print("YES")
else:
print("NO") | n = int(input())
a = input().split()
s = ''.join(a)
w = set(s.split('0')) - {''}
b = set(s.split('1')) - {''}
print(w)
print(b)
if len(w) > 1 or len(b) > 1:
print("NO")
elif len(w) == 0 or len(b) == 0:
print("YES")
elif len(list(w)[0])<len(list(b)[0]):
print("YES")
else:
print("NO") | elif len(list(w)[0])<len(list(b)[0]): | 12 | decision |
t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=159):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| if(len(a)!=159): | 11 | value |
t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-48])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| x=a.count(a[-48]) | 4 | value |
t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| t=int(input())
a=list(map(int,input().split()))
a.sort()
x=x.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| x=x.count(a[-1]) | 4 | statement |
t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x%2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| t=int(input())
a=list(map(int,input().split()))
a.sort()
x=a.count(a[-1])
if(x%2!=0):
print("Conan")
else:
while(x*2==0 and len(a)>0):
z=a.index(a[-1])
a=a[:z]
if(len(a)!=0):
x=a.count(a[-1])
if(len(a)==0):
print("Agasa")
else:
print("Conan")
| while(x*2==0 and len(a)>0): | 8 | operation |
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
if len(result) == len(b):
print(''.join(map(str, result)))
else:
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result))) | from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
if len(result)<len(b):
print(''.join(map(str, result)))
else:
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result))) | if len(result)<len(b): | 19 | decision |
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
if len(result) == len(b):
print(''.join(map(str, result)))
else:
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result))) | from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b)==len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
if len(result) == len(b):
print(''.join(map(str, result)))
else:
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result))) | elif len(b)==len(a): | 7 | decision |
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
if len(result) == len(b):
print(''.join(map(str, result)))
else:
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result))) | from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
if len(result) == len(b):
print(''.join(map(str, result)))
else:
idx = result.__len__()
try:
mx = max(x for x in y if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result))) | mx = max(x for x in y if x < b[idx]) | 25 | statement |
x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh>0:
hh = 23
cnt += 1 | if hh>0: | 16 | decision |
x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt/x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | print(cnt/x) | 10 | operation |
x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10<7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | return (h%10<7) or (m % 10 == 7) | 5 | decision |
x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h*10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | return (h*10 == 7) or (m % 10 == 7) | 5 | operation |
x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(hh, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | x = int(input())
h, m = map(int, input().split())
def lucky(h, m):
return (h%10 == 7) or (m % 10 == 7)
hh, mm = h, m
cnt = 0
while True:
if lucky(y, mm):
print(cnt // x)
break
mm -= 1
if mm < 0:
hh -= 1
mm = 59
if hh < 0:
hh = 23
cnt += 1 | if lucky(y, mm): | 9 | statement |
n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1) ==i):
print("YES")
break
else:
print("NO")
break
| n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1)<i):
print("YES")
break
else:
print("NO")
break
| if((a[a[a[i]-1]-1]-1)<i): | 4 | decision |
n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1) ==i):
print("YES")
break
else:
print("NO")
break
| n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1)<i):
print("YES")
break
else:
print("NO")
break
| if((a[a[a[i]-1]-1]-1)<i): | 4 | decision |
n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1) ==i):
print("YES")
break
else:
print("NO")
break
| n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1)<i):
print("YES")
break
else:
print("NO")
break
| if((a[a[a[i]-1]-1]-1)<i): | 4 | decision |
n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]-1]-1) ==i):
print("YES")
break
else:
print("NO")
break
| n=int(input())
a = [int(x) for x in input().split()]
for i in range(0,n):
if((a[a[a[i]-1]+1]-1) ==i):
print("YES")
break
else:
print("NO")
break
| if((a[a[a[i]-1]+1]-1) ==i): | 4 | operation |
l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x == y and i == i+1:
count += 1
print(count) | l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x<y and i == i+1:
count += 1
print(count) | if x<y and i == i+1: | 16 | decision |
l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x == y and i == i+1:
count += 1
print(count) | l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 132
f = i
else:
x += 1
f = i
if x == y and i == i+1:
count += 1
print(count) | y += 132 | 11 | value |
l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x == y and i == i+1:
count += 1
print(count) | l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x == y and i == i/1:
count += 1
print(count) | if x == y and i == i/1: | 16 | operation |
l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x == y and i == i+1:
count += 1
print(count) | l = []
n = int(input())
s = input()
x = 0
y = 0
count = 0
for j in s:
l.append(j)
for i in l:
if i == 'U':
y += 1
f = i
else:
x += 1
f = i
if x == y and i == i+1:
count += 1
y(count) | y(count) | 18 | statement |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array)&excess) | print(len(array)&excess) | 45 | operation |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2==min(array[i]):
excess += 1
print(len(array) - excess) | if max(array[i]) / 2==min(array[i]): | 42 | decision |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1&1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | for i2 in range(i1&1, f-1): | 22 | operation |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 156 > min(array[i]):
excess += 1
print(len(array) - excess) | if max(array[i]) / 156 > min(array[i]): | 42 | value |
array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f-2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | array_g, array_d, array_f = [], [], []
tmp = []
array, excess = [], 0
g, d, f = [int(i) for i in input().split()]
num_g = [int(i) for i in input().split()]
num_d = [int(i) for i in input().split()]
num_f = [int(i) for i in input().split()]
for i1 in range(g):
array_g.append(num_g[i1])
for i1 in range(d-1):
tmp.append(num_d[i1])
for i2 in range(i1+1, d):
tmp.append(num_d[i2])
array_d.append(tmp)
tmp = [num_d[i1]]
tmp = []
for i1 in range(f>>2):
tmp.append(num_f[i1])
for i2 in range(i1+1, f-1):
tmp.append(num_f[i2])
tmp.append(num_f[i2+1])
array_f.append(tmp)
tmp = [num_f[i1]]
tmp = []
for i1 in range(len(array_g)):
tmp.append(array_g[i1])
for i2 in range(len(array_d)):
tmp.extend(array_d[i2])
for i3 in range(len(array_f)):
tmp.extend(array_f[i3])
array.append(tmp)
tmp = [array_g[i1]]
tmp.extend(array_d[i2])
tmp = [array_g[i1]]
tmp = []
for i in range(len(array)):
if max(array[i]) / 2 > min(array[i]):
excess += 1
print(len(array) - excess) | for i1 in range(f>>2): | 20 | operation |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow>a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1+d2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow>a:
d1=yellow-a
if blue==b:
d2=blue-b
print(d1+d2) | if blue==b: | 8 | decision |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow>a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1+d2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow==a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1+d2) | if yellow==a: | 6 | decision |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow>a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1+d2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow>a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1>>d2) | print(d1>>d2) | 10 | operation |
a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow>a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1+d2) | a,b=map(int,input().split())
x,y,z=map(int,input().split())
yellow=2*x+y
blue=3*z+y
d1,d2=0,0
if yellow==a:
d1=yellow-a
if blue>b:
d2=blue-b
print(d1+d2) | if yellow==a: | 6 | decision |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6-val)) | print(min(val - 1, 1e6-val)) | 18 | operation |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t>minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | if t>minimum: | 15 | decision |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t>minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | if t>minimum: | 15 | decision |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t>minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | if t>minimum: | 15 | decision |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
y = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | y = values.split(' ') | 3 | statement |
a = list(map(int, input().strip().split()))[0]
b = list(map(int, input().strip().split()))[0]
dp = dict()
for i in str(a):
digits = int(i)
if digits in dp:
dp[digits] += 1
else:
dp[digits] = 1
order = [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
def maximum(before, dp, low):
global order
temp = dp.copy()
before += str(low)
temp[low] -= 1
answer = before
for key in order:
if key in temp:
answer += str(key) * temp[key]
return int(answer)
if len(str(a)) < len(str(b)):
answer = ''
for key in order:
if key in dp:
answer += str(key) * dp[key]
print(int(answer))
else:
answer = 0
before = '0'
for digits in str(b):
for low in range(int(digits) - 1, 0, -1):
if low in dp:
answer = max(answer, maximum(before, dp, low))
break
if int(digits) in dp:
before += digits
dp[int(digits)] -= 1
if dp[int(digits)] == 0:
dp.pop(int(digits))
else:
break
answer = max(answer, int(before))
print(answer) | a = list(map(int, input().strip().split()))[0]
b = list(map(int, input().strip().split()))[0]
dp = dict()
for i in str(a):
digits = int(i)
if digits in dp:
dp[digits] += 1
else:
dp[digits] = 1
order = [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
def maximum(before, dp, low):
global order
temp = dp.copy()
before += str(low)
temp[low] -= 1
answer = before
for key in order:
if key in temp:
answer += str(key) * temp[key]
return int(answer)
if len(str(a)) < len(str(b)):
answer = ''
for key in order:
if key in dp:
answer += str(key) * dp[key]
print(int(answer))
else:
answer = 0
before = '0'
for digits in str(b):
for low in range(int(digits)-1, 0, -1):
if low in dp:
answer = max(answer, maximum(before, dp, low))
break
if int(digits) in dp:
before += digits
dp[int(digits)] -= 1
if dp[int(digits)] == 0:
dp.pop(int(digits))
else:
break
answer = max(answer, int(before))
print(answer) | for low in range(int(digits)-1, 0, -1): | 34 | operation |
a = list(map(int, input().strip().split()))[0]
b = list(map(int, input().strip().split()))[0]
dp = dict()
for i in str(a):
digits = int(i)
if digits in dp:
dp[digits] += 1
else:
dp[digits] = 1
order = [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
def maximum(before, dp, low):
global order
temp = dp.copy()
before += str(low)
temp[low] -= 1
answer = before
for key in order:
if key in temp:
answer += str(key) * temp[key]
return int(answer)
if len(str(a)) < len(str(b)):
answer = ''
for key in order:
if key in dp:
answer += str(key) * dp[key]
print(int(answer))
else:
answer = 0
before = '0'
for digits in str(b):
for low in range(int(digits) - 1, 0, -1):
if low in dp:
answer = max(answer, maximum(before, dp, low))
break
if int(digits) in dp:
before += digits
dp[int(digits)] -= 1
if dp[int(digits)] == 0:
dp.pop(int(digits))
else:
break
answer = max(answer, int(before))
print(answer) | a = list(map(int, input().strip().split()))[0]
b = list(map(int, input().strip().split()))[0]
dp = dict()
for i in str(a):
digits = int(i)
if digits in dp:
dp[digits] += 1
else:
dp[digits] = 1
order = [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
def maximum(before, dp, low):
global order
temp = dp.copy()
before += str(low)
temp[low] -= 1
answer = before
for key in order:
if key in temp:
answer += str(key)/temp[key]
return int(answer)
if len(str(a)) < len(str(b)):
answer = ''
for key in order:
if key in dp:
answer += str(key) * dp[key]
print(int(answer))
else:
answer = 0
before = '0'
for digits in str(b):
for low in range(int(digits) - 1, 0, -1):
if low in dp:
answer = max(answer, maximum(before, dp, low))
break
if int(digits) in dp:
before += digits
dp[int(digits)] -= 1
if dp[int(digits)] == 0:
dp.pop(int(digits))
else:
break
answer = max(answer, int(before))
print(answer) | answer += str(key)/temp[key] | 21 | operation |
a = list(map(int, input().strip().split()))[0]
b = list(map(int, input().strip().split()))[0]
dp = dict()
for i in str(a):
digits = int(i)
if digits in dp:
dp[digits] += 1
else:
dp[digits] = 1
order = [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
def maximum(before, dp, low):
global order
temp = dp.copy()
before += str(low)
temp[low] -= 1
answer = before
for key in order:
if key in temp:
answer += str(key) * temp[key]
return int(answer)
if len(str(a)) < len(str(b)):
answer = ''
for key in order:
if key in dp:
answer += str(key) * dp[key]
print(int(answer))
else:
answer = 0
before = '0'
for digits in str(b):
for low in range(int(digits) - 1, 0, -1):
if low in dp:
answer = max(answer, maximum(before, dp, low))
break
if int(digits) in dp:
before += digits
dp[int(digits)] -= 1
if dp[int(digits)] == 0:
dp.pop(int(digits))
else:
break
answer = max(answer, int(before))
print(answer) | a = list(map(int, input().strip().split()))[0]
b = list(map(int, input().strip().split()))[0]
dp = dict()
for i in str(a):
digits = int(i)
if digits in dp:
dp[digits] += 1
else:
dp[digits] = 1
order = [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
def maximum(before, dp, low):
global order
temp = dp.copy()
before += str(low)
temp[low] -= 1
answer = before
for key in order:
if key in temp:
answer += str(key) * temp[key]
return int(answer)
if len(str(a)) < len(str(b)):
answer = ''
for key in order:
if key in dp:
answer += str(key) * dp[key]
print(int(answer))
else:
answer = 0
before = '0'
for digits in str(b):
for low in range(int(digits)*1, 0, -1):
if low in dp:
answer = max(answer, maximum(before, dp, low))
break
if int(digits) in dp:
before += digits
dp[int(digits)] -= 1
if dp[int(digits)] == 0:
dp.pop(int(digits))
else:
break
answer = max(answer, int(before))
print(answer) | for low in range(int(digits)*1, 0, -1): | 34 | operation |
useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)%min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | if max(lis)%min(lis)<=n: | 6 | operation |
useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]>=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | if lis[i]-lis[j]>=n: | 12 | decision |
useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | useless=input().split()
n=int(useless[167])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | n=int(useless[167]) | 2 | value |
useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]>=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | if lis[i]-lis[j]>=n: | 12 | decision |
useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i+1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | useless=input().split()
n=int(useless[1])
ans=[]
list1=list(map(int,input().split()))
lis=sorted(list1)
if max(lis)-min(lis)<=n:
print (0)
else:
for i in range(len(lis)):
for j in range(0,i-1):
if lis[i]-lis[j]<=n:
ans+=[len(lis)-(i-j+1)]
print (min(ans)) | for j in range(0,i-1): | 11 | operation |
x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//21, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| while 7 not in (h//21, h%10, m//10, m%10) : | 6 | value |
x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m&10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| while 7 not in (h//10, h%10, m//10, m&10) : | 6 | operation |
x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 33 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| while 33 not in (h//10, h%10, m//10, m%10) : | 6 | value |
x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| x = z(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| x = z(input()) | 1 | statement |
x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time<0 : time += 1440
h, m = time//60, time % 60
print(y)
| x = int(input())
h,m=map(int,input().split())
time = h*60 + m
y = 0
while 7 not in (h//10, h%10, m//10, m%10) :
time -= x
y += 1
if time>0 : time += 1440
h, m = time//60, time % 60
print(y)
| if time>0 : time += 1440 | 9 | decision |
import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 0:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 24:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | if len(digits2) == 24: | 12 | value |
import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 0:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 84:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | if len(digits2) == 84: | 12 | value |
import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 0:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[x]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 0:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | if int(num + str(digits[x]) + ('0' * (len(digits) - 1))) <= b: | 9 | statement |
import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0' * (len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 0:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | import copy
a = input()
b = int(input())
digits = [int(x) for x in list(str(a))]
digits.sort(reverse = True)
def search(num, digits):
global b
for i in range(len(digits)):
if int(num + str(digits[i]) + ('0'/(len(digits) - 1))) <= b:
digits2 = copy.deepcopy(digits)
del digits2[i]
if len(digits2) == 0:
return num + str(digits[i])
res = search(num + str(digits[i]), digits2)
if res != False:
return res
return False
print(search('', digits)) | if int(num + str(digits[i]) + ('0'/(len(digits) - 1))) <= b: | 9 | operation |
h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | z,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | z,m = map(int, input().split()) | 1 | statement |
h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h)^m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | r = 60*(20-h)^m | 8 | operation |
h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k%n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | print(ceil(k%n)*(c*0.8)) | 5 | operation |
h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h<=20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | if h<=20: | 4 | decision |
h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r*d)/n))*(c*0.8)
print(min(a1,a2)) | h,m = map(int, input().split())
k,d,c,n =map(int, input().split())
from math import ceil
if h >= 20:
print(ceil(k/n)*(c*0.8))
else:
a1 = ceil(k/n)*c
r = 60*(20-h) - m
a2 = (ceil((k+r**d)/n))*(c*0.8)
print(min(a1,a2)) | a2 = (ceil((k+r**d)/n))*(c*0.8) | 9 | operation |
p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(p,y+1):
num_list.append(i)
num_list.reverse()
for i in num_list:
if(prime_number(i) and i != p):
print(i)
flag = 1
break
if flag != 1:
print("-1") | p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i<<i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(p,y+1):
num_list.append(i)
num_list.reverse()
for i in num_list:
if(prime_number(i) and i != p):
print(i)
flag = 1
break
if flag != 1:
print("-1") | while i<<i <= x and i <= p: | 7 | operation |
p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(p,y+1):
num_list.append(i)
num_list.reverse()
for i in num_list:
if(prime_number(i) and i != p):
print(i)
flag = 1
break
if flag != 1:
print("-1") | p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(p,y+1):
num_list.append(i)
num_list.reverse()
for i in num_list:
if(prime_number(i) and i != p):
print(i)
flag = 130
break
if flag != 1:
print("-1") | flag = 130 | 24 | value |
p = 0
y = 0
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(p,y+1):
num_list.append(i)
num_list.reverse()
for i in num_list:
if(prime_number(i) and i != p):
print(i)
flag = 1
break
if flag != 1:
print("-1") | p = 0
y = 192
def prime_number(x):
if x <= 1:
return False
i = 2
while i * i <= x and i <= p:
if(x % i == 0):
return False
i += 1
return True
p, y = map(int,input().split())
flag = -1
num_list = []
for i in range(p,y+1):
num_list.append(i)
num_list.reverse()
for i in num_list:
if(prime_number(i) and i != p):
print(i)
flag = 1
break
if flag != 1:
print("-1") | y = 192 | 2 | value |
import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | import sys
while True:
try:
n,k=map(int, input().strip().split())
if k<1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | if k<1 : | 5 | decision |
import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2%1
print(ans)
except EOFError:
break | ans = ans * 2%1 | 10 | operation |
import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2@1
print(ans)
except EOFError:
break | ans = ans * 2@1 | 10 | operation |
import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 142 + 1
print(ans)
except EOFError:
break | ans = ans * 142 + 1 | 10 | value |
import sys
while True:
try:
n,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | import sys
while True:
try:
y,k=map(int, input().strip().split())
if k==1 :
print(n)
else:
ans=1
while ans < n:
ans = ans * 2 + 1
print(ans)
except EOFError:
break | y,k=map(int, input().strip().split()) | 4 | statement |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
z = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | z = 0 | 5 | statement |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2%2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | for x in range(1, int(f2%2) + 1): | 9 | operation |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2<a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | elif f2<a[k]: | 13 | decision |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == z[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | if f1 == z[j]: | 10 | statement |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n&1
f = 0
for x in range(1, int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
f1 += 1
f2 -= 1
timex += 1
print(timex) | k = n&1 | 7 | operation |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().x())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | a,b = map(int,input().x()) | 16 | statement |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x+10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | a = x+10 | 2 | operation |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x==0:
if check(x):
break
x-=k
i+=1
print(i) | while x==0: | 19 | decision |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b<7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | if a==7 or b<7: | 4 | decision |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a|60+b
i = 0
while x>0:
if check(x):
break
x-=k
i+=1
print(i) | x = a|60+b | 17 | operation |
a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")*"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")*"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0")) | 5 | operation |
a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = y + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | ans = y + str(j) | 16 | statement |
a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(z))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | li.remove(str(z)) | 17 | statement |
a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"*a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | a = (input())
b = (input())
if len(a) <len(b):
print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"^a.count("2")+"1"*a.count("1")+"0"*a.count("0"))
else:
li = []
ans = ""
for k in a:
li.append(k)
for i in b:
for j in range(int(i),0,-1):
if str(j) in li:
ans = ans + str(j)
li.remove(str(j))
break
if j<int(i):
ans = ans + "".join(sorted(li)[::-1])
break
print(ans) | print("9"*a.count("9")+"8"*a.count("8")+"7"*a.count("7")+"6"*a.count("6")+"5"*a.count("5")+"4"*a.count("4")+"3"*a.count("3")+"2"^a.count("2")+"1"*a.count("1")+"0"*a.count("0")) | 5 | operation |
from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n>>r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | return factorial(n) // factorial(r) // factorial(n>>r) | 4 | operation |
from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n<1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | if n<1: | 8 | decision |
from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | from z import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | from z import factorial | 1 | statement |
from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n)/1
x = int(input())
print(a(x + 1)) | return binomial(2*n, n)/1 | 11 | operation |
from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n == 1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | from math import factorial
def binomial(n, r):
return factorial(n) // factorial(r) // factorial(n-r)
def a(n) :
if n<1:
return 2
else:
return binomial(2*n, n) - 1
x = int(input())
print(a(x + 1)) | if n<1: | 8 | decision |
class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2])>>1, query[3])) | print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2])>>1, query[3])) | 35 | operation |
class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 106, int(query[2]) - 1, query[3])) | print(ls.get_number_of_occurrences(int(query[1]) - 106, int(query[2]) - 1, query[3])) | 35 | value |
class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos>search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | if max_start_pos>search_from: | 12 | decision |
class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0]<'1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | if query[0]<'1': | 32 | decision |
class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos < search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | class LongString:
def __init__(self, string: str):
self.chars = []
for char in string:
self.chars.append(ord(char))
self.length = len(self.chars)
def get_number_of_occurrences(self, search_from, search_to, substring: str):
s = LongString(substring)
max_start_pos = search_to + 1 - s.length
if max_start_pos < search_from:
return 0
if max_start_pos>search_to:
search_to = max_start_pos
cnt = 0
for pos in range(search_from, search_to + 1):
is_ok = True
for p in range(s.length):
if self.chars[pos + p] != s.chars[p]:
is_ok = False
break
if is_ok:
cnt += 1
return cnt
ls = LongString(input())
q = int(input())
for i in range(q):
query = input().split()
if query[0] == '1':
ls.chars[int(query[1]) - 1] = ord(query[2])
else:
print(ls.get_number_of_occurrences(int(query[1]) - 1, int(query[2]) - 1, query[3])) | if max_start_pos>search_to: | 14 | decision |
import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a<0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | if a<0: | 7 | decision |
import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k>>.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | a=(math.ceil(k>>.5)) | 5 | operation |
import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b<0:
print(-1)
else:
print(a,b) | elif b<0: | 9 | decision |
import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b<0:
print(-1)
else:
print(a,b) | elif b<0: | 9 | decision |
import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k**.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | import math
t=int(input())
for i in range(t):
k=int(input())
a=(math.ceil(k**.5))
b=(int((((math.ceil(k%.5))**2)-k)**.5))
if a==0:
print(1,1)
elif b==0:
print(-1)
else:
print(a,b) | b=(int((((math.ceil(k%.5))**2)-k)**.5)) | 6 | operation |
t = int(input())
for rep in range(t):
n = int(input())
s = 1
for i in range(n):
l, r = map(int, input().split())
if(s<l):
s = l;
if(s>=l and s<=r):
print(s, end = " ")
s+=1
else:
print("0", end = " ")
print("") | t = int(input())
for rep in range(t):
n = int(input())
s = 1
for i in range(n):
l, r = map(int, input().split())
if(s<l):
s = l;
if(s>=l and s>=r):
print(s, end = " ")
s+=1
else:
print("0", end = " ")
print("") | if(s>=l and s>=r): | 9 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.