original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n,m=(map(int,input().strip().split(' ')))
a= list(map(int,input().strip().split(' ')))
b= list(map(int,input().strip().split(' ')))
index = -1
i = 0
j = 0
s1 = 0
s2 = 0
cnt=0
while(i<n and j<m):
if(index==0):
s1+=a[i]
i+=1
elif(index==1):
s2+=b[j]
j+=1
else:
s1+=a[i]
s2+=b[j]
j+=1
i+=1
if(s1==s2):
cnt+=1
s1=0
s2=0
index=-1
elif(s1>s2):
index=1
else:
index=0
print(cnt+1)
|
n,m=(map(int,input().strip().split(' ')))
a= list(map(int,input().strip().split(' ')))
b= list(map(int,input().strip().split(' ')))
index = -1
i = 0
j = 0
s1 = 0
s2 = 0
cnt=0
while(i<n and j<m):
if(index==0):
s1+=a[i]
i+=1
elif(index<1):
s2+=b[j]
j+=1
else:
s1+=a[i]
s2+=b[j]
j+=1
i+=1
if(s1==s2):
cnt+=1
s1=0
s2=0
index=-1
elif(s1>s2):
index=1
else:
index=0
print(cnt+1)
|
elif(index<1):
| 14 |
decision
|
n,m=(map(int,input().strip().split(' ')))
a= list(map(int,input().strip().split(' ')))
b= list(map(int,input().strip().split(' ')))
index = -1
i = 0
j = 0
s1 = 0
s2 = 0
cnt=0
while(i<n and j<m):
if(index==0):
s1+=a[i]
i+=1
elif(index==1):
s2+=b[j]
j+=1
else:
s1+=a[i]
s2+=b[j]
j+=1
i+=1
if(s1==s2):
cnt+=1
s1=0
s2=0
index=-1
elif(s1>s2):
index=1
else:
index=0
print(cnt+1)
|
n,m=(map(int,input().strip().split(' ')))
a= list(map(int,input().strip().split(' ')))
b= list(map(int,input().strip().split(' ')))
index = -1
i = 0
j = 0
s1 = 0
s2 = 0
cnt=0
while(i<n and j<m):
if(index==0):
s1+=a[i]
i+=1
elif(index==1):
s2+=b[j]
j+=1
else:
s1+=a[i]
s2+=b[j]
j+=1
i+=1
if(s1==s2):
cnt+=1
s1=0
s2=0
index=-1
elif(s1>s2):
index=1
else:
index=0
print(cnt|1)
|
print(cnt|1)
| 31 |
operation
|
n,m=(map(int,input().strip().split(' ')))
a= list(map(int,input().strip().split(' ')))
b= list(map(int,input().strip().split(' ')))
index = -1
i = 0
j = 0
s1 = 0
s2 = 0
cnt=0
while(i<n and j<m):
if(index==0):
s1+=a[i]
i+=1
elif(index==1):
s2+=b[j]
j+=1
else:
s1+=a[i]
s2+=b[j]
j+=1
i+=1
if(s1==s2):
cnt+=1
s1=0
s2=0
index=-1
elif(s1>s2):
index=1
else:
index=0
print(cnt+1)
|
n,m=(map(int,input().strip().split(' ')))
a= list(map(int,input().strip().split(' ')))
b= list(map(int,input().strip().split(' ')))
index = -1
i = 0
j = 0
s1 = 0
s2 = 29
cnt=0
while(i<n and j<m):
if(index==0):
s1+=a[i]
i+=1
elif(index==1):
s2+=b[j]
j+=1
else:
s1+=a[i]
s2+=b[j]
j+=1
i+=1
if(s1==s2):
cnt+=1
s1=0
s2=0
index=-1
elif(s1>s2):
index=1
else:
index=0
print(cnt+1)
|
s2 = 29
| 8 |
value
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i>=a and j*i<=b:
ans+=1
print(ans)
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j+i>=a and j*i<=b:
ans+=1
print(ans)
|
if j+i>=a and j*i<=b:
| 11 |
operation
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i>=a and j*i<=b:
ans+=1
print(ans)
|
a,b=map(int,input().split())
two=[1]
three=[187]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i>=a and j*i<=b:
ans+=1
print(ans)
|
three=[187]
| 3 |
value
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i>=a and j*i<=b:
ans+=1
print(ans)
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i<=a and j*i<=b:
ans+=1
print(ans)
|
if j*i<=a and j*i<=b:
| 11 |
decision
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]*2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i>=a and j*i<=b:
ans+=1
print(ans)
|
a,b=map(int,input().split())
two=[1]
three=[1]
ans=0
while two[-1]<b:
two.append(two[-1]-2)
while three[-1]<b:
three.append(three[-1]*3)
for j in three:
for i in two:
if j*i>=a and j*i<=b:
ans+=1
print(ans)
|
two.append(two[-1]-2)
| 6 |
operation
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]%1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
nstr = istr[qi[0]:qi[1]%1]
| 10 |
operation
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st>=0:
break
cnt += 1
print(cnt)
|
if st>=0:
| 14 |
decision
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)<<1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
qi = [int(x)<<1 for x in qi]
| 4 |
operation
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]-1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
nstr = istr[qi[0]:qi[1]-1]
| 10 |
operation
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)-1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
istr = input()
for i in range(int(input())):
qt, *qi, qs = input().split()
qi = [int(x)|1 for x in qi]
if qt == '1':
istr = list(istr)
istr[qi[0]] = qs
istr = ''.join(istr)
elif qt == '2':
nstr = istr[qi[0]:qi[1]+1]
cnt = st = 0
while True:
st = nstr.find(qs, st) + 1
if st <= 0:
break
cnt += 1
print(cnt)
|
qi = [int(x)|1 for x in qi]
| 4 |
operation
|
a=int(input())
b=int(input())
diff=max(a-b,b-a)
p1=int(diff/2)
p2=int((diff+1)/2)
cost=int(p1*(p1+1)/2+p2*(p2+1)/2)
print(cost)
|
a=int(input())
b=int(input())
diff=max(a-b,b-a)
p1=int(diff/2)
p2=int((diff+1)/2)
cost=int(p1&(p1+1)/2+p2*(p2+1)/2)
print(cost)
|
cost=int(p1&(p1+1)/2+p2*(p2+1)/2)
| 9 |
operation
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(z)
if __name__ == '__main__':
run()
|
print(z)
| 31 |
statement
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k==n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
if k==n:
| 7 |
decision
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace@1))
print(t)
if __name__ == '__main__':
run()
|
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace@1))
| 28 |
operation
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
x = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
x = sorted(set(s))
| 4 |
statement
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]*(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
def run():
n, k = map(int, input().split())
s = input()
s_sorted = sorted(set(s))
big = s_sorted[-1]
small = s_sorted[0]
if k > n:
t = s + ''.join([small] * (k - n))
else:
if len(s) == 1:
t = s
else:
to_replace = big
ind_replace = 0
for i in range(k-1, -1, -1):
if s[i] == big:
continue
else:
to_replace = s[i]
ind_replace = i
break
ind = s_sorted.index(to_replace)
ind += 1
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]>>(k - ind_replace - 1))
print(t)
if __name__ == '__main__':
run()
|
t = s[:ind_replace] + s_sorted[ind] + ''.join([small]>>(k - ind_replace - 1))
| 28 |
operation
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n<0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
if n<0:
| 4 |
decision
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2<0 and n>=0 and m>=0 else 'No')
|
print('Yes' if n % 2<0 and n>=0 and m>=0 else 'No')
| 11 |
decision
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n%2 ==0 and n>=0 and m>=0 else 'No')
|
print('Yes' if n%2 ==0 and n>=0 and m>=0 else 'No')
| 11 |
operation
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m<=0 else 'No')
|
print('Yes' if n % 2 ==0 and n>=0 and m<=0 else 'No')
| 11 |
decision
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n - m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
rd = lambda:map(int,input().split())
n,m= rd()
if m == 1:
if n ==0:
print('Yes')
else:
print('No')
else:
m = m-1
n = n&m
print('Yes' if n % 2 ==0 and n>=0 and m>=0 else 'No')
|
n = n&m
| 10 |
operation
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n*2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
return '8' + DO(n*2)
| 7 |
operation
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
def DO(n):
if n<0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
if n<0:
| 2 |
decision
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n/2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
return '8' + DO(n/2)
| 7 |
operation
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = z(n)
print(s)
|
s = z(n)
| 12 |
statement
|
def DO(n):
if n == 0:
return ''
elif n == 1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
def DO(n):
if n == 0:
return ''
elif n<1:
return '4'
else:
return '8' + DO(n-2)
n = int(input())
s = ''
if n > 0:
s = DO(n)
print(s)
|
elif n<1:
| 4 |
decision
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]/m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
l=l[:a]/m+l[b+1:]
| 32 |
operation
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j>>1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
if c==0 and l[j]<=l[j>>1] and c1==0 :
| 15 |
operation
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b&1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
m=l[a:b&1]
| 30 |
operation
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
n=int(input())
l=list(map(z,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
l=list(map(z,input().split()))
| 2 |
statement
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=max(ma,k)
print(ma)
|
n=int(input())
l=list(map(int,input().split()))
ma=0
if n==1 :
print(1)
exit()
a=-1
b=-1
for i in range(n) :
if l[i]==2 :
c=0
k=0
c1=0
for j in range(i+1,n) :
if c==0 and l[j]<=l[j-1] and c1==0 :
k+=1
elif c1==0 :
c1=1
k-=1
else :
if l[j]==2 :
k-=1
if ma<k :
ma=k
a=i
b=j
if a==-1 :
print(n)
else :
m=l[a:b+1]
m=m[::-1]
l=l[:a]+m+l[b+1:]
ma=0
k=0
for i in range(n-1) :
if l[i]>=l[i-1] :
k+=1
else :
ma=max(k,ma)
k=1
if n>1 :
if l[-1]>=l[-2] :
k+=1
ma=x(ma,k)
print(ma)
|
ma=x(ma,k)
| 45 |
statement
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]<mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
if x[0]<mx:
| 11 |
decision
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
import itertools
n = int(input())
s = x().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
s = x().split()
| 3 |
statement
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 147
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
return 147
| 12 |
value
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
import itertools
n = int(input())
s = input().z()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
s = input().z()
| 3 |
statement
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 0
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
import itertools
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
mx = max(a)
def check(x):
if x[0]==mx:
return 0
else:
res = 0
am = x[0]
for i in range(1, n):
if am<x[i]:
res+=am
am = x[i]
return res
d = 38
for x in list(itertools.permutations(a)):
d+=check(x)
print(d%(10**9+7))
|
d = 38
| 23 |
value
|
n = int(input())
arr = [[0] * (n * 2) for i in range(n * 2)]
for i in range(1, n * 2):
ar = list(map(int, input().split()))
p = 0
for j in range(0, i):
k = ar[p]
p += 1
arr[i][j] = k
arr[j][i] = k
ar = []
for t in arr:
ar += t
print(ar)
ans = [0] * (2 * n)
for i in range(n):
k = ar.index(max(ar))
x = k // (n * 2)
y = k % (n * 2)
ans[x] = y
ans[y] = x
arr[x] = [0] * (n * 2)
arr[y] = [0] * (n * 2)
for j in range(n * 2):
arr[j][x] = 0
arr[j][y] = 0
ar = []
for t in arr:
ar += t
print(ans,k, ar)
for k in ans:
print(k + 1, end = " ")
|
n = int(input())
arr = [[0] * (n * 2) for i in range(n * 2)]
for i in range(1, n * 2):
ar = list(map(int, input().split()))
p = 0
for j in range(0, i):
k = ar[p]
p += 1
arr[i][j] = k
arr[j][i] = k
ar = []
for t in arr:
ar += t
print(ar)
ans = [0] * (2 * n)
for i in range(n):
k = ar.index(max(ar))
x = k // (n * 2)
y = k % (n * 2)
ans[x] = y
ans[y] = x
arr[x] = [0] * (n * 2)
arr[y] = [0] * (n * 2)
for j in range(n*2):
arr[j][x] = 0
arr[j][y] = 0
ar = []
for t in arr:
ar += t
print(ans,k, ar)
for k in ans:
print(k + 1, end = " ")
|
for j in range(n*2):
| 24 |
operation
|
n = int(input())
arr = [[0] * (n * 2) for i in range(n * 2)]
for i in range(1, n * 2):
ar = list(map(int, input().split()))
p = 0
for j in range(0, i):
k = ar[p]
p += 1
arr[i][j] = k
arr[j][i] = k
ar = []
for t in arr:
ar += t
print(ar)
ans = [0] * (2 * n)
for i in range(n):
k = ar.index(max(ar))
x = k // (n * 2)
y = k % (n * 2)
ans[x] = y
ans[y] = x
arr[x] = [0] * (n * 2)
arr[y] = [0] * (n * 2)
for j in range(n * 2):
arr[j][x] = 0
arr[j][y] = 0
ar = []
for t in arr:
ar += t
print(ans,k, ar)
for k in ans:
print(k + 1, end = " ")
|
n = int(input())
arr = [[0] * (n * 2) for i in range(n * 2)]
for i in range(1, n * 2):
ar = list(map(int, input().split()))
p = 0
for j in range(0, i):
k = ar[p]
p += 1
arr[i][j] = k
arr[j][i] = k
ar = []
for t in arr:
ar += t
print(ar)
ans = [0] * (2 * n)
for i in range(n):
k = ar.index(max(ar))
x = k // (n * 2)
y = k % (n * 2)
ans[x] = y
ans[y] = x
arr[x] = [0] * (n * 2)
arr[y] = [0] * (n * 147)
for j in range(n * 2):
arr[j][x] = 0
arr[j][y] = 0
ar = []
for t in arr:
ar += t
print(ans,k, ar)
for k in ans:
print(k + 1, end = " ")
|
arr[y] = [0] * (n * 147)
| 23 |
value
|
n = int(input())
arr = [[0] * (n * 2) for i in range(n * 2)]
for i in range(1, n * 2):
ar = list(map(int, input().split()))
p = 0
for j in range(0, i):
k = ar[p]
p += 1
arr[i][j] = k
arr[j][i] = k
ar = []
for t in arr:
ar += t
print(ar)
ans = [0] * (2 * n)
for i in range(n):
k = ar.index(max(ar))
x = k // (n * 2)
y = k % (n * 2)
ans[x] = y
ans[y] = x
arr[x] = [0] * (n * 2)
arr[y] = [0] * (n * 2)
for j in range(n * 2):
arr[j][x] = 0
arr[j][y] = 0
ar = []
for t in arr:
ar += t
print(ans,k, ar)
for k in ans:
print(k + 1, end = " ")
|
n = int(input())
arr = [[0] * (n * 2) for i in range(n * 2)]
for i in range(1, n * 2):
ar = list(map(int, input().split()))
p = 0
for j in range(0, i):
k = ar[p]
p += 56
arr[i][j] = k
arr[j][i] = k
ar = []
for t in arr:
ar += t
print(ar)
ans = [0] * (2 * n)
for i in range(n):
k = ar.index(max(ar))
x = k // (n * 2)
y = k % (n * 2)
ans[x] = y
ans[y] = x
arr[x] = [0] * (n * 2)
arr[y] = [0] * (n * 2)
for j in range(n * 2):
arr[j][x] = 0
arr[j][y] = 0
ar = []
for t in arr:
ar += t
print(ans,k, ar)
for k in ans:
print(k + 1, end = " ")
|
p += 56
| 8 |
value
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]<k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]>k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
if a[m-1]-a[m-2]>k:
| 5 |
decision
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]<k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]>k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
if a[m-1]-a[m-2]>k:
| 5 |
decision
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]<k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]<k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m//2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
elif a[m-1]-a[m//2]>k and c!=1:
| 8 |
operation
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]<k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]>k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
m,x,c,kk=n,1,0,k
for i in range(n-1):
if a[m-1]-a[m-2]<k:
k-=(a[m-1]-a[m-2])
c=1
elif a[m-1]-a[m-2]==k and c!=1:
x=-1
break
else:
x+=1
c=0
k=kk
m-=1
print(x)
|
elif a[m-1]-a[m-2]==k and c!=1:
| 8 |
decision
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96**target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
ans+=chr(96**target)
| 11 |
operation
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target<26:
print(ans)
else:
print(-1)
|
if target<26:
| 14 |
decision
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])+97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
d.append(ord(s[i])+97)
| 6 |
operation
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target<26:
print(ans)
else:
print(-1)
|
if target<26:
| 14 |
decision
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(96+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
s = input()
d = []
k = -1
ans = ''
for i in range(len(s)):
d.append(ord(s[i])-97)
target = 0
for i in range(len(s)):
if d[i]<=target:
target+=1
ans+=chr(118+target)
else:
ans+=s[i]
if target==26:
print(ans)
else:
print(-1)
|
ans+=chr(118+target)
| 11 |
value
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left^1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
if ((right-left^1)//2)%2 == 1:
| 15 |
operation
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2<1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
now=0 if ans%2<1 else 1
| 11 |
decision
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left**1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
if ((right-left**1)//2)%2 == 1:
| 15 |
operation
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)//2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
def solve():
n=int(input())
a=list(map(int,input().split()))
cl=['odd','even']
m=int(input())
ans=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:
ans+=1
now=0 if ans%2==1 else 1
for i in range(m):
left,right=map(int,input().split())
if ((right-left+1)%2)%2 == 1:
now+=1
print(cl[now%2])
solve()
|
if ((right-left+1)%2)%2 == 1:
| 15 |
operation
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1>len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
(n[i] != 'z' and (seq.index(n[i]) + 1>len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
| 26 |
decision
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i]<'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
if pointer_1 == -1 and n[i]<'a':
| 17 |
decision
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff/1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff/1] ) ):
| 26 |
operation
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = y
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
pointer_1 = y
| 18 |
statement
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__ == '__main__':
run()
|
def run():
n = input()
seq = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
pointer_1 = -1
pointer_2 = -1
i = 0
while i < len(n):
if pointer_1 == -1:
if len(n) - i < 26:
pointer_2 = -1
pointer_1 = -1
break
if pointer_1 == -1 and n[i] == 'a':
pointer_1 = i
pointer_2 = i
i += 1
elif pointer_1 != -1 and pointer_2 - pointer_1 < 25 and i < len(n):
diff = pointer_2 - pointer_1
if (diff + 1 < len(seq)) and (
seq[diff+1] == n[i] or \
(n[i] != 'z' and (seq.index(n[i]) + 1 < len(seq)) and seq[seq.index(n[i]) + 1] == seq[diff+1] ) ):
pointer_2 += 1
i += 1
else:
i = pointer_1 + 1
pointer_2 = -1
pointer_1 = -1
elif pointer_1 != -1 and pointer_2 - pointer_1 == 25:
break
else:
i += 1
if pointer_1 == -1:
print(-1)
else:
print(n[:pointer_1] + ''.join(seq) + n[pointer_1 + pointer_2+1:])
if __name__<'__main__':
run()
|
if __name__<'__main__':
| 47 |
decision
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m//i <= n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m//i>=n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
if i<=n and m//i>=n:
| 6 |
decision
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m//i <= n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m>>i <= n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
if i<=n and m>>i <= n:
| 6 |
operation
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m//i <= n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i>=n and m//i <= n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
if i>=n and m//i <= n:
| 6 |
decision
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m//i <= n:
ans += 2
if int(math.sqrt(m)) == math.sqrt(m):
ans -=1
print(ans)
|
import math
n, m = map(int, input().split())
ans = 0
for i in range(1, int(math.sqrt(m))+1):
if (m%i) == 0:
if i<=n and m//i <= n:
ans += 2
if int(math.sqrt(m))<math.sqrt(m):
ans -=1
print(ans)
|
if int(math.sqrt(m))<math.sqrt(m):
| 8 |
decision
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j]<'.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
if lines[i + x][j]<'.':
| 9 |
decision
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P'//lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines[i + x] = lines[i + x][:j] + 'P'//lines[i + x][j + 1:]
| 10 |
operation
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j]<'.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
if lines[i + x][j]<'.':
| 9 |
decision
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i|x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines[i + x] = lines[i + x][:j] + 'P' + lines[i|x][j + 1:]
| 10 |
operation
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j] == '.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
lines = [input() for i in range(6)]
flag = False
for i in [0, 2, 4]:
if flag: break
for j in [3, 4, 0, 1, 6, 7]:
if flag: break
for x in [0, 1]:
if flag: break
if lines[i + x][j]<'.':
lines[i + x] = lines[i + x][:j] + 'P' + lines[i + x][j + 1:]
flag = True
for l in lines:
print(l)
|
if lines[i + x][j]<'.':
| 9 |
decision
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
n = int(input())
count = 0
for i in range(1, n|1):
for j in range(i+1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
for i in range(1, n|1):
| 3 |
operation
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i^1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
for j in range(i^1, n+1):
| 4 |
operation
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i-1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
for j in range(i-1, n+1):
| 4 |
operation
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i//j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
k = i//j
| 5 |
operation
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i^j
if k+j>i and i+j>k and i+k>j==0:
count+=1
print(count)
|
n = int(input())
count = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
k = i^j
if k+j==i and i+j>k and i+k>j==0:
count+=1
print(count)
|
if k+j==i and i+j>k and i+k>j==0:
| 6 |
decision
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(z>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
while(z>=1):
| 10 |
statement
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k|2
count+=1
|
k=k|2
| 14 |
operation
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
z(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
z(k)
| 8 |
statement
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k^1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
if k^1==1:
| 4 |
operation
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k&1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
count=1
if k%1==1:
if k in a:
print(1)
else:
print(k)
else:
while(k>=1):
if k in a:
print(count)
break
k=k/2
count+=1
|
if k%1==1:
| 4 |
operation
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot>=n:
ans += 1
print(ans)
|
if quot - int(quot) == 0 and quot>=n:
| 7 |
decision
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot>=n:
ans += 1
print(ans)
|
if quot - int(quot) == 0 and quot>=n:
| 7 |
decision
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x+i
if quot - int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
quot = x+i
| 6 |
operation
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot*int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
if quot*int(quot) == 0 and quot <= n:
| 7 |
operation
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot - int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
n, x = map(int, input().split())
ans = 0
for i in range(1, (n + 1)):
quot = x / i
if quot@int(quot) == 0 and quot <= n:
ans += 1
print(ans)
|
if quot@int(quot) == 0 and quot <= n:
| 7 |
operation
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
a,b=map(int,x().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
a,b=map(int,x().split())
| 1 |
statement
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*z
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
a = a - 2*z
| 7 |
statement
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 52*a
else:
break
print(a,b)
|
b = b - 52*a
| 9 |
value
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*z:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
if a >= 2*z:
| 6 |
statement
|
a,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
z,b=map(int,input().split())
while (1):
if (a == 0) | (b == 0):
break
if a >= 2*b:
a = a - 2*b
elif b >= 2*a:
b = b - 2*a
else:
break
print(a,b)
|
z,b=map(int,input().split())
| 1 |
statement
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n>>1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
print(cost[0]+(n>>1)*sub)
| 36 |
operation
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
y=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
y=n-1
| 36 |
statement
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[43])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
del(cost[43])
| 36 |
value
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
def fun(n):
if(n==1):
y(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
y(cost[0])
| 36 |
statement
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)*sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
def fun(n):
if(n==1):
print(cost[0])
return
else:
if(n<d):
print(cost[0]+(n-1)+sub)
return
g=n//d
g1=n%d
if(n%d!=0):
cost.append(cost[0]+g1*sub)
n=n-g1
del(cost[0])
fun(n)
else:
if((n-g)*sub>mul):
cost.append(cost[0]+mul)
del(cost[0])
n=g
fun(n)
else:
n=n-1
cost.append(cost[0]+sub)
del(cost[0])
fun(n)
n=int(input())
d=int(input())
sub=int(input())
mul=int(input())
cost=[0]
fun(n)
|
print(cost[0]+(n-1)+sub)
| 36 |
operation
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 79.4):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
if (a/c > 2) or (a/c == 79.4):
| 20 |
value
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c==2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
if (a/c==2) or (a/c == 0.5):
| 20 |
decision
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2>len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2>len(ff) else z+2-len(ff)]]
| 11 |
decision
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c<0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
if (a/c > 2) or (a/c<0.5):
| 20 |
decision
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+191-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (a/c == 0.5):
chk = True
if chk:
nw[x] = []
b = []
for i in range(len(nw)):
if not (nw[i]==[]):
b.append(nw[i])
print(b)
print(len(b))
else:
print(0)
|
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+191-len(ff)]]
| 11 |
value
|
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic[j] = 1
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m<0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic[j] = 1
if f == 0: print('NO')
|
if (i + j) % m<0:
| 11 |
decision
|
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic[j] = 1
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic[j] = 1
if f == 100: print('NO')
|
if f == 100: print('NO')
| 19 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.