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 |
|---|---|---|---|---|
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1)
|
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
z(-1)
|
z(-1)
| 19 |
statement
|
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1)
|
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i])==ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1)
|
if ord(s[idx + i])==ord('a') + i:
| 9 |
decision
|
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i) + s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1)
|
s = input()
st = 0
while st <= len(s) - 26:
if 'a' in s:
idx = s.find('a', st)
counter = 0
for i in range(1, 26):
if ord(s[idx + i]) > ord('a') + i:
st = idx + i
continue
else:
s = s[:idx + i] + chr(ord('a') + i)+s[idx + i + 1:]
counter += 1
if counter == 25:
print(s)
quit()
print(-1)
|
s = s[:idx + i] + chr(ord('a') + i)+s[idx + i + 1:]
| 13 |
operation
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
n,x=map(int,input().split())
a=list(x(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
a=list(x(int,input().split()))
| 2 |
statement
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n/n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
m=n/n%a[i]
| 8 |
operation
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=8
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
M=8
| 3 |
value
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=57
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
I=57
| 4 |
value
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for i in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
n,x=map(int,input().split())
a=list(map(int,input().split()))
M=0
I=0
ans=0
for z in range(len(a)):
if a[i]<n:
m=n-n%a[i]
if M<m:
M=m
ans=m//a[i]
I=i+1
print(I,ans)
|
for z in range(len(a)):
| 6 |
statement
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0]<'?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
if s[0]<'?' and s[1] != '?':
| 11 |
decision
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i@1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
if s[i] == s[i@1] and s[i] == '?':
| 19 |
operation
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
x += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
x += 1
| 24 |
statement
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i>>1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
if s[i] == s[i>>1] and s[i] == '?':
| 19 |
operation
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and s[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
k = int(input())
s = input()
gg = False
good = False
p = 0
if s[0] == '?':
p += 1
if k >= 2 :
if s[0] == '?' and s[1] != '?':
good = True
if s[-1] == '?' and s[-2] != '?':
good = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
gg = True
if s[i] == s[i-1] and x[i] == '?':
good = True
if i < k - 1 and s[i] == '?' and s[i-1] == s[i+1]:
good = True
if s[i] == '?':
p += 1
if good == True and gg == False and p > 0:
print('Yes')
else:
print('No')
|
if s[i] == s[i-1] and x[i] == '?':
| 19 |
statement
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn]<0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
while gardens[fn]<0:
| 17 |
decision
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
x.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
x.append(0)
| 10 |
statement
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
rpt = int(input())
for repeat in range(rpt):
inp = z()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
inp = z()
| 3 |
statement
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 46 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
elif currmax % 2 == 46 and (currmax + 1) / 2 > maxnum:
| 35 |
value
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[int(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
rpt = int(input())
for repeat in range(rpt):
inp = input()
inp = inp.split(" ")
gardensnum = int(inp[0])
tapsnum = int(inp[1])
gardens = []
taps = []
for i in range(gardensnum):
gardens.append(0)
taps = input().split(" ", tapsnum - 1)
for i in range(tapsnum):
gardens[z(taps[i]) - 1] = 1
startmaxspace = 0
fn = 0
while gardens[fn] == 0:
startmaxspace = startmaxspace + 1
fn = fn + 1
endmaxspace = 0
fn = gardensnum - 1
while gardens[fn] == 0:
endmaxspace = endmaxspace + 1
fn = fn - 1
maxnum = 0
currmax = 0
for i in range(startmaxspace, gardensnum - startmaxspace):
if gardens[i] == 0:
currmax = currmax + 1
else:
if currmax % 2 == 0 and currmax / 2 > maxnum:
maxnum = currmax / 2
elif currmax % 2 == 1 and (currmax + 1) / 2 > maxnum:
maxnum = (currmax + 1) / 2
currmax = 0
print(int(max(startmaxspace, endmaxspace, maxnum)) + 1)
|
gardens[z(taps[i]) - 1] = 1
| 13 |
statement
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
ans += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n==k):
ans += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
if (n==k):
| 12 |
decision
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
ans += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
x = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
ans += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
x = int(input())
| 1 |
statement
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
ans += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
y += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
y += (n % k) * a
| 13 |
statement
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
ans += (n % k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
ans = 0
if (k == 1):
print(n * a);
else:
while n != 1:
if n % k:
if (n > k):
ans += (n&k) * a
n -= n % k
else:
ans += (n - 1) * a;
n = 1;
else:
ans += min((n - (n // k)) * a, b)
n //= k
print(ans)
|
ans += (n&k) * a
| 13 |
operation
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var%2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
sum1=var%2
| 13 |
operation
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org**1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
if copy==(org**1):
| 8 |
operation
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org>>1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
if copy==(org>>1):
| 8 |
operation
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org<<1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
var=org<<1
| 11 |
operation
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var+2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
n=[int(x) for x in input().split()]
copy=n[0]
org=n[1]
count=0
if copy==(org-1):
print("yes")
else:
var=org-1
for i in range(copy):
sum1=var/2
if sum1==copy:
count=1
else:
var=sum1
if count==1:
print("Yes")
else:
print("No")
|
sum1=var/2
| 13 |
operation
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]|b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
product = a[i]|b[j]
| 6 |
operation
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]+b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
product = a[i]+b[j]
| 6 |
operation
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,z().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
b = list(map(int,z().split(' ')))
| 11 |
statement
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j]==product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
if a[i]*b[j]==product:
| 5 |
decision
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[i]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
def max_pair(n,a,m,b):
product = a[0]*b[0]
for i in range(n):
for j in range(m):
if a[i]*b[j] > product:
product = a[z]*b[j]
return product
n,m = map(int,input().split(' '))
a = list(map(int,input().split(' ')))
b = list(map(int,input().split(' ')))
a.remove(max(a))
print(max_pair(n-1,a,m,b))
|
product = a[z]*b[j]
| 6 |
statement
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1]>=k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
if arr[i] - arr[i-1]>=k:
| 7 |
decision
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1]>=k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
if arr[i] - arr[i-1]>=k:
| 7 |
decision
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-194]
ans += 1
else:
print(-1)
exit()
print(ans)
|
xs = arr[i-194]
| 8 |
value
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs==k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
if arr[i] - xs==k:
| 6 |
decision
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs > k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
n, k = map(int, input().split())
arr = list(map(int, input().split()))
xs = arr[0]
ans = 1
for i in range(1, n):
if arr[i] - xs==k:
if arr[i] - arr[i-1] <= k:
xs = arr[i-1]
ans += 1
else:
print(-1)
exit()
print(ans)
|
if arr[i] - xs==k:
| 6 |
decision
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p/q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p*q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
x.append(p*q)
| 10 |
operation
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p/q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
x,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p/q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
x,q = input().split(" ")
| 7 |
statement
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p/q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p/q)
ans = min(x)^m
ans = round(ans,8)
print (ans)
|
ans = min(x)^m
| 12 |
operation
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p/q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
n,m= input().split(" ")
n = int(n)
m = int(m)
x =[]
for i in range(n):
p,q = input().split(" ")
p = float(p)
q = float(q)
x.append(p**q)
ans = min(x)*m
ans = round(ans,8)
print (ans)
|
x.append(p**q)
| 10 |
operation
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+z[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
b=b+z[(ascii_letters.index(a[i]))%len(ascii_letters)]
| 8 |
statement
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])>ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
if ord(a[i])>ord(a[i+1])-1:
| 6 |
decision
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))%1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
while i < int(len(a))%1:
| 5 |
operation
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])>ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
if ord(a[i])>ord(a[i+1])-1:
| 6 |
decision
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])<ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
from string import ascii_letters
a=input()
b=''
i=0
while i < int(len(a))-1:
if ord(a[i])>ord(a[i+1])-1:
i=i+1
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
elif ord(a[i])==ord(a[i+1]):
b=b+ascii_letters[(ascii_letters.index(a[i]))%len(ascii_letters)]
b=b+ascii_letters[(ascii_letters.index(a[i+1])+1)%len(ascii_letters)]
i=i+2
else:
i=i+1
print(-1)
exit(0)
print (b)
|
if ord(a[i])>ord(a[i+1])-1:
| 6 |
decision
|
sub="abcdefghijklmnopqrstuvwxyz"
s=list(input())
j=0
for i in range(len(s)):
if j==26:
break
if s[i]<=sub[j]:
s[i]=sub[j]
j+=1
if j==26:
print(''.join(s))
else:
print("-1")
|
sub="abcdefghijklmnopqrstuvwxyz"
s=list(input())
j=0
for i in range(len(s)):
if j<26:
break
if s[i]<=sub[j]:
s[i]=sub[j]
j+=1
if j==26:
print(''.join(s))
else:
print("-1")
|
if j<26:
| 5 |
decision
|
sub="abcdefghijklmnopqrstuvwxyz"
s=list(input())
j=0
for i in range(len(s)):
if j==26:
break
if s[i]<=sub[j]:
s[i]=sub[j]
j+=1
if j==26:
print(''.join(s))
else:
print("-1")
|
sub="abcdefghijklmnopqrstuvwxyz"
s=list(input())
j=0
for i in range(len(s)):
if j<26:
break
if s[i]<=sub[j]:
s[i]=sub[j]
j+=1
if j==26:
print(''.join(s))
else:
print("-1")
|
if j<26:
| 5 |
decision
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in y), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n = sorted((i for i in y), reverse=True)
| 3 |
statement
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(y)
print(solve(n, N))
|
return d + ''.join(y)
| 19 |
statement
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[81]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
if d < N[81]:
| 17 |
value
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if z(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
if z(n) < len(N):
| 9 |
statement
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos] + n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n, N = input(), input()
N = [i for i in N]
n = sorted((i for i in n), reverse=True)
def has_hal(n, N):
return sorted(n) < N
def solve(n, N):
if len(n) < len(N):
return ''.join(n)
if not n:
return ''
if n[0] == N[0]:
if has_hal(n[1:], N[1:]):
return n[0] + solve(n[1:], N[1:])
for pos, d in enumerate(n):
if d < N[0]:
n1 = n[:pos]*n[pos + 1:]
return d + ''.join(n1)
print(solve(n, N))
|
n1 = n[:pos]*n[pos + 1:]
| 18 |
operation
|
input()
lis = list(map(int,input().split()))
bear = lis[0]
num = 0
lis1 = lis[1:]
lis1.sort(reverse=True)
i = 0
while i in range(len(lis1)):
if lis1[0] >= bear:
lis1[i] -= 1
num += 1
bear += 1
lis1.sort(reverse = True)
i += 1
print(num)
|
input()
lis = list(map(int,input().split()))
bear = lis[0]
num = 0
lis1 = lis[1:]
lis1.sort(reverse=True)
i = 0
while y in range(len(lis1)):
if lis1[0] >= bear:
lis1[i] -= 1
num += 1
bear += 1
lis1.sort(reverse = True)
i += 1
print(num)
|
while y in range(len(lis1)):
| 9 |
statement
|
input()
lis = list(map(int,input().split()))
bear = lis[0]
num = 0
lis1 = lis[1:]
lis1.sort(reverse=True)
i = 0
while i in range(len(lis1)):
if lis1[0] >= bear:
lis1[i] -= 1
num += 1
bear += 1
lis1.sort(reverse = True)
i += 1
print(num)
|
input()
lis = list(map(int,input().split()))
bear = lis[0]
num = 32
lis1 = lis[1:]
lis1.sort(reverse=True)
i = 0
while i in range(len(lis1)):
if lis1[0] >= bear:
lis1[i] -= 1
num += 1
bear += 1
lis1.sort(reverse = True)
i += 1
print(num)
|
num = 32
| 4 |
value
|
input()
lis = list(map(int,input().split()))
bear = lis[0]
num = 0
lis1 = lis[1:]
lis1.sort(reverse=True)
i = 0
while i in range(len(lis1)):
if lis1[0] >= bear:
lis1[i] -= 1
num += 1
bear += 1
lis1.sort(reverse = True)
i += 1
print(num)
|
input()
lis = list(map(int,input().split()))
bear = lis[0]
num = 0
lis1 = lis[1:]
lis1.sort(reverse=True)
i = 0
while i in range(len(lis1)):
if lis1[0]<=bear:
lis1[i] -= 1
num += 1
bear += 1
lis1.sort(reverse = True)
i += 1
print(num)
|
if lis1[0]<=bear:
| 10 |
decision
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a+i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
while a+i==0:
| 7 |
operation
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
a = eval(input())
ans = 1
i = 2
while a<=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
while a<=i*i:
| 4 |
decision
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
a = eval(input())
ans = 1
i = 2
while a<=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
while a<=i*i:
| 4 |
decision
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a<<i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
while a<<i==0:
| 7 |
operation
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=1:
ans *= a
print(ans)
|
a = eval(input())
ans = 1
i = 2
while a>=i*i:
if a%i==0:
ans *= i
while a%i==0:
a /= i
i+=1
if a!=194:
ans *= a
print(ans)
|
if a!=194:
| 10 |
value
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i]<-1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
if ans[i]<-1 and ans[j] == -1:
| 11 |
decision
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2/n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
for i in range(1, 2/n):
| 5 |
operation
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j]<-1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
if ans[i] == -1 and ans[j]<-1:
| 11 |
decision
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i]<-1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
if ans[i]<-1 and ans[j] == -1:
| 11 |
decision
|
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
n = int(input())
m = list()
ans = [-1] * 2//n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] == -1:
ans[i] = j + 1
ans[j] = i + 1
print(' '.join(map(str, ans)))
|
ans = [-1] * 2//n
| 3 |
operation
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))<j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
if(int(math.sqrt(j))*int(math.sqrt(j))<j or int(math.sqrt(k))*int(math.sqrt(k))==k):
| 8 |
decision
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(y.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
if(int(y.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
| 8 |
statement
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))<k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))<k):
| 8 |
decision
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))<k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))<k):
| 8 |
decision
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.sqrt(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
n=int(input())
import math
s=''
i=1
while(n!=0):
j=(5*i*i)+4
k=(5*i*i)-4
if(int(math.y(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
s=s+"O"
else:
s=s+"o"
n-=1
i+=1
print(s)
|
if(int(math.y(j))*int(math.sqrt(j))==j or int(math.sqrt(k))*int(math.sqrt(k))==k):
| 8 |
statement
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value<10):
break
print(counter)
|
if(value<10):
| 22 |
decision
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
n,d=map(x,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
n,d=map(x,input().split())
| 1 |
statement
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1*i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
if (ele - cords[len(cords)-1*i]) != d :
| 17 |
operation
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele>>cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
if (ele>>cords[len(cords)-1-i]) != d :
| 17 |
operation
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value == 10):
break
print(counter)
|
n,d=map(int,input().split())
cords=[]
inp = input()
inp = inp.split(" ")
inp = list (inp)
for ele in inp:
cords.append(int(ele))
cords = sorted (cords,reverse=True)
value = 0
counter = 0
for i in range (len(cords)):
counter=0
for ele in cords :
if (ele - cords[len(cords)-1-i]) != d :
counter+=1
else:
value = 10
break
if(value<10):
break
print(counter)
|
if(value<10):
| 22 |
decision
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)<len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
if len(k)<len(s):
| 21 |
decision
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)<<1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
i+=len(s)<<1
| 27 |
operation
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]<k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
if len(k)!=0 and a[i]<k[cnt]:
| 14 |
decision
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i<=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
import sys
n = int(input())
a = input()
s = a[0]
i = 0
cnt = 0
res = 0
k = ""
while i>=n-1:
if len(k)!=0 and a[i]==k[cnt]:
k = k+a[i]
i+=1
cnt+=1
else:
if len(k)==len(s):
s = s + k
k = a[i]
cnt = 0
res+=1
i+=len(s)-1
else:
s = s + a[i]
k = a[i]
cnt = 0
i+=1
res+=1
print(res)
|
while i>=n-1:
| 12 |
decision
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i > 10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i==10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
if i==10**6/2:
| 7 |
decision
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i > 10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i==10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
if i==10**6/2:
| 7 |
decision
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i > 10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i==10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
if i==10**6/2:
| 7 |
decision
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i > 10**6/2:
a.append(abs(10**6/2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
n = int(input())
ai = list(map(int, input().split()))
a = []
for i in ai:
if i > 10**6/2:
a.append(abs(10**6<<2 - i))
else:
a.append(abs(10**6/2 - i) + 1)
print(int(10**6/2 - min(a)))
|
a.append(abs(10**6<<2 - i))
| 8 |
operation
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i<=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
if i<=0:
| 8 |
decision
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i<=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
if i<=0:
| 8 |
decision
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(b)^sum(c))
|
print(sum(b)^sum(c))
| 12 |
operation
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(z)-sum(c))
|
print(sum(z)-sum(c))
| 12 |
statement
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=0:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
n = int(input())
B=[]
b=[]
c=[]
for i in range(n):
B.append(int(input()))
for i in B:
if i>=73:
b.append(i)
else:
c.append(i)
print(sum(b)-sum(c))
|
if i>=73:
| 8 |
value
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]==0:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l&arr[i]==0:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
if l&arr[i]==0:
| 6 |
operation
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]==0:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]==94:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
if l%arr[i]==94:
| 6 |
value
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]==0:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]==0:
if times == 0:
times = l/arr[i]
elif l>>arr[i]<times:
times = l/arr[i]
print(times)
|
elif l>>arr[i]<times:
| 9 |
operation
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]==0:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
times = 0
n=input()
l=input()
arr=list(input().strip())
for i in range(n):
if l%arr[i]<0:
if times == 0:
times = l/arr[i]
elif l/arr[i]<times:
times = l/arr[i]
print(times)
|
if l%arr[i]<0:
| 6 |
decision
|
n = int(input())
a = list(map(int, input().split()))
m = min(a)
index = -1
dist = 0
distances = []
for i in range(n):
if a[i] == m:
if index != -1:
dist = i - index
distances.append(dist)
index = i
print(min(distances))
|
n = int(input())
a = list(map(int, input().split()))
m = min(a)
index = -1
dist = 0
distances = []
for i in range(n):
if a[i] == m:
if index != -1:
dist = i&index
distances.append(dist)
index = i
print(min(distances))
|
dist = i&index
| 11 |
operation
|
n = int(input())
a = list(map(int, input().split()))
m = min(a)
index = -1
dist = 0
distances = []
for i in range(n):
if a[i] == m:
if index != -1:
dist = i - index
distances.append(dist)
index = i
print(min(distances))
|
n = int(input())
a = list(map(int, input().split()))
m = min(a)
index = -1
dist = 0
distances = []
for i in range(n):
if a[i]<m:
if index != -1:
dist = i - index
distances.append(dist)
index = i
print(min(distances))
|
if a[i]<m:
| 9 |
decision
|
n = int(input())
a = list(map(int, input().split()))
m = min(a)
index = -1
dist = 0
distances = []
for i in range(n):
if a[i] == m:
if index != -1:
dist = i - index
distances.append(dist)
index = i
print(min(distances))
|
n = int(input())
a = list(map(int, input().split()))
m = min(a)
index = -1
dist = 0
distances = []
for i in range(n):
if a[i] == m:
if index != -1:
dist = i//index
distances.append(dist)
index = i
print(min(distances))
|
dist = i//index
| 11 |
operation
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
answer += answer
answer -= 1
print(answer)
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
answer += answer
answer -= 1
z(answer)
|
z(answer)
| 14 |
statement
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
answer += answer
answer -= 1
print(answer)
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 72
while answer + answer < n:
answer += answer
answer -= 1
print(answer)
|
answer = 72
| 9 |
value
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
answer += answer
answer -= 1
print(answer)
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer>n:
answer += answer
answer -= 1
print(answer)
|
while answer + answer>n:
| 10 |
decision
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
answer += answer
answer -= 1
print(answer)
|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
y += answer
answer -= 1
print(answer)
|
y += answer
| 11 |
statement
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.