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 |
|---|---|---|---|---|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s) - 1 and s[i+1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i>len(s) - 1 and s[i+1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
if i>len(s) - 1 and s[i+1] == s[i]:
| 10 |
decision
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s) - 1 and s[i+1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s) - 1 and s[i<<1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
if i < len(s) - 1 and s[i<<1] == s[i]:
| 10 |
operation
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s) - 1 and s[i+1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s) - 1 and s[i+1] == s[i]:
return False
continue
for i in range(len(y)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
for i in range(len(y)):
| 14 |
statement
|
n,pos,a,b=map(int,input().split())
if a==1 and b==n:
ans=0
if a==1 and b!=n:
ans=abs(pos-b)+1
if a!=1 and b==n:
ans=abs(pos-a)+1
if a!=1 and b!=n:
ans=b-a+min(abs(pos-a),abs(pos-b))+2
print(ans)
|
n,pos,a,b=map(int,input().split())
if a==1 and b==n:
ans=0
if a==1 and b!=n:
ans=abs(pos-b)+1
if a!=1 and b==n:
ans=abs(pos-a)+1
if a!=1 and b!=n:
ans=b-a+min(y(pos-a),abs(pos-b))+2
print(ans)
|
ans=b-a+min(y(pos-a),abs(pos-b))+2
| 9 |
statement
|
n,pos,a,b=map(int,input().split())
if a==1 and b==n:
ans=0
if a==1 and b!=n:
ans=abs(pos-b)+1
if a!=1 and b==n:
ans=abs(pos-a)+1
if a!=1 and b!=n:
ans=b-a+min(abs(pos-a),abs(pos-b))+2
print(ans)
|
n,pos,a,b=map(int,input().split())
if a==81 and b==n:
ans=0
if a==1 and b!=n:
ans=abs(pos-b)+1
if a!=1 and b==n:
ans=abs(pos-a)+1
if a!=1 and b!=n:
ans=b-a+min(abs(pos-a),abs(pos-b))+2
print(ans)
|
if a==81 and b==n:
| 2 |
value
|
n,pos,a,b=map(int,input().split())
if a==1 and b==n:
ans=0
if a==1 and b!=n:
ans=abs(pos-b)+1
if a!=1 and b==n:
ans=abs(pos-a)+1
if a!=1 and b!=n:
ans=b-a+min(abs(pos-a),abs(pos-b))+2
print(ans)
|
n,pos,a,b=map(int,input().split())
if a==1 and b<n:
ans=0
if a==1 and b!=n:
ans=abs(pos-b)+1
if a!=1 and b==n:
ans=abs(pos-a)+1
if a!=1 and b!=n:
ans=b-a+min(abs(pos-a),abs(pos-b))+2
print(ans)
|
if a==1 and b<n:
| 2 |
decision
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy>0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy>0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest/2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
if rest/2!=0:
| 13 |
operation
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy>0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy==0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
elif original==1 and copy==0:
| 8 |
decision
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy>0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original<1 and copy>0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
elif original<1 and copy>0:
| 8 |
decision
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy>0:
print('NO')
elif copy>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
x=input()
copy,original=x.split()
copy=int(copy)
original=int(original)
if original==0:
print('NO')
elif original==1 and copy>0:
print('NO')
elif z>original:
rest=copy-original-1
if rest%2!=0:
print('NO')
else:
print('YES')
elif copy==original:
print('NO')
elif (original-1)==copy:
print('YES')
else:
print('NO')
|
elif z>original:
| 11 |
statement
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-185][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
if (i > 0) and arr[i-185][j] == 'S' and arr[i][j] == 'W':
| 23 |
value
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j*1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
if (j > 0) and arr[i][j] == 'S' and arr[i][j*1] == 'W':
| 26 |
operation
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i<<1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
if (i > 0) and arr[i<<1][j] == 'S' and arr[i][j] == 'W':
| 23 |
operation
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1] == 'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
n, m = input().split()
n, m = int(n), int(m)
arr = [list(input()) for k in range(n)]
poss = True
for i in range(n):
for j in range(m):
if (arr[i][j] == '.'):
if (i > 0) and arr[i-1][j] == 'S':
arr[i][j] = 'D'
if (j > 0) and arr[i][j-1] == 'S':
arr[i][j] = 'D'
if (i < n-1) and arr[i+1][j] == 'S':
arr[i][j] = 'D'
if (j < m-1) and arr[i][j+1] == 'S':
arr[i][j] = 'D'
if (i > 0) and arr[i][j] == 'S' and arr[i-1][j] == 'W':
poss = False
if (i > 0) and arr[i-1][j] == 'S' and arr[i][j] == 'W':
poss = Falsev
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1]<'W':
poss = False
if (j > 0) and arr[i][j-1] == 'S' and arr[i][j] == 'W':
poss = False
if poss:
print('Yes')
for row in arr:
print(''.join(row))
else:
print('No')
|
if (j > 0) and arr[i][j] == 'S' and arr[i][j-1]<'W':
| 26 |
decision
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg<=1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
if msg<=1:
| 9 |
decision
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, z + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
msgs[i].update(set(range(j, z + min(n - j, k) + 1)))
| 8 |
statement
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
n, k = map(int, input().split())
y = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
y = list(map(int, input().split()))
| 2 |
statement
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg<=1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
if msg<=1:
| 9 |
decision
|
n, k = map(int, input().split())
msgs = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
n, k = map(int, input().split())
z = list(map(int, input().split()))
for i, msg in enumerate(msgs):
j = i + 1
msgs[i] = {j}
msgs[i].update(set(range(j - min(j - 1, k), j)))
msgs[i].update(set(range(j, j + min(n - j, k) + 1)))
if msg >= 1:
msgs[i] |= msgs[msg - 1]
print(len(msgs[i]), end=' ')
|
z = list(map(int, input().split()))
| 2 |
statement
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(30.6)):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
for m_i in range(1, int(30.6)):
| 12 |
value
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i**(n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
if n_i*n_i**(n_i//m_i)*(n_i//m_i) == val:
| 13 |
operation
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
t = int(input())
values = []
for z in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
for z in range(t):
| 3 |
statement
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
check = 0
if val == 1:
print('-1')
continue
for n_i in range(1, int(1e9)):
for m_i in range(1, int(1e5)):
if n_i*n_i - (n_i//m_i)<<(n_i//m_i) == val:
print(n_i, m_i)
check = 1
count = 1
break
if count == 1:
break
if check == 0:
print('-1')
|
if n_i*n_i - (n_i//m_i)<<(n_i//m_i) == val:
| 13 |
operation
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]+FS[x-1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]+FS[x-1])
for x in range(0,a):
if x@1 in FS:
print('O', end="")
else:
print('o', end="")
|
if x@1 in FS:
| 7 |
operation
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]+FS[x-1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]**FS[x-1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
FS.append(FS[x]**FS[x-1])
| 4 |
operation
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]+FS[x-1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]+FS[x^1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
FS.append(FS[x]+FS[x^1])
| 4 |
operation
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]+FS[x-1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
a=int(input())
FS=[1,1]
for x in range(1,a):
FS.append(FS[x]-FS[x-1])
for x in range(0,a):
if x+1 in FS:
print('O', end="")
else:
print('o', end="")
|
FS.append(FS[x]-FS[x-1])
| 4 |
operation
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i]^pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
sum_rast += x[i]^pr_st
| 7 |
operation
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i]&pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
sum_rast += x[i]&pr_st
| 7 |
operation
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i]|pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
sum_rast += x[i]|pr_st
| 7 |
operation
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[y]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
pr_st = x[y]
| 16 |
statement
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast > k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
cnt = 0
pr_st = x[0]
sum_rast = 0
for i in range(1, n):
sum_rast += x[i] - pr_st
if sum_rast==k:
cnt += 1
sum_rast = 0
elif sum_rast == k:
cnt += 1
sum_rast = 0
pr_st = x[i]
else:
pr_st = x[i]
if pr_st != x[-1]:
print(-1)
else:
print(cnt)
|
if sum_rast==k:
| 8 |
decision
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < x[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
while s[-1] - (es + s[-1]) / (it + 1) < x[-1] -(es + s[it] + s[-1]) / (it + 2):
| 10 |
statement
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1)>s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
while s[-1] - (es + s[-1]) / (it + 1)>s[-1] -(es + s[it] + s[-1]) / (it + 2):
| 10 |
decision
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q)<2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
if len(q)<2:
| 8 |
decision
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-95]) / (it + 1))
|
print(s[-1] - (es + s[-95]) / (it + 1))
| 14 |
value
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 0:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
s = []
it = 0
es = 0
qn = int(input())
while qn > 98:
qn -= 1
q = [int(x) for x in input().split()]
if len(q) == 2:
s.append(q[1])
while s[-1] - (es + s[-1]) / (it + 1) < s[-1] -(es + s[it] + s[-1]) / (it + 2):
es += s[it]
it += 1
else:
print(s[-1] - (es + s[-1]) / (it + 1))
|
while qn > 98:
| 5 |
value
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i==x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i<x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
if(i<x1+x2):
| 6 |
decision
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i==x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i<x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
if(i<x1+x2):
| 6 |
decision
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i==x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i==x1+x2):
s+='O'
temp=x1//x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
temp=x1//x2
| 8 |
operation
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i==x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a@1):
if(i==x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
for i in range(2,a@1):
| 5 |
operation
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i==x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
a=int(input())
s="O"
x1=1
x2=1
for i in range(2,a+1):
if(i<x1+x2):
s+='O'
temp=x1+x2
x1=x2
x2=temp
else:
s+='o'
print(s)
|
if(i<x1+x2):
| 6 |
decision
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a<=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
if (a<=2*b):
| 7 |
decision
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2//b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
if (a>=2//b):
| 7 |
operation
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2^a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
if (b>=2^a):
| 13 |
operation
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
y(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
y(a,b)
| 15 |
statement
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a - 2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
def pehla(a,b):
if (a==0 or b==0):
print (a,b)
else:
dusra(a,b)
def dusra(a,b):
if (a>=2*b):
a = a//2*b
pehla(a,b)
else:
teesra(a,b)
def teesra(a,b):
if (b>=2*a):
b = b - 2*a
pehla(a,b)
else:
print (a,b)
n , m = [int(x) for x in input().split()]
pehla(n,m)
|
a = a//2*b
| 8 |
operation
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+149]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+149]=='x' or a[i+1]=='-')):
| 22 |
value
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i%1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i%1]=='x' or a[i+1]=='-')):
| 22 |
operation
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+86]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+86]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
| 22 |
value
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i>>1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i>>1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
| 11 |
operation
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
n,k=map(int,input().split())
b=[]
s=0
f=True
for j in range(n):
a=list(input())
for i in range(len(a)):
if a[i]=='S':
if i>0 and (a[i-1]=='P' or a[i-1]=='S'): s+=1
if i<11 and (a[i+1]=='P' or a[i+1]=='S'): s+=1
if a[i]=='.' and (i==0 or a[i-1]<'.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
if k==0: f=False; break
else:
k-=1
a[i]='x'
b.append(a)
print(s)
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.' and ((i==0 or a[i-1]=='.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') or (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-')):
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=1
if f:
for j in range(n):
a=b[j]
for i in range(len(a)):
if a[i]=='.':
if k==0: f=False; break
else:
k-=1
a[i]='x'
s+=2
print(s)
for j in range(n):
print(''.join(b[j]))
|
if a[i]=='.' and (i==0 or a[i-1]<'.' or a[i-1]=='P' or a[i-1]=='x' or a[i-1]=='-') and (i==11 or a[i+1]=='.' or a[i+1]=='P' or a[i+1]=='x' or a[i+1]=='-'):
| 11 |
decision
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z+"o"
print(z)
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z^"o"
print(z)
|
z=z^"o"
| 16 |
operation
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z+"o"
print(z)
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n@1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z+"o"
print(z)
|
for i in range(1,n@1):
| 7 |
operation
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z+"o"
print(z)
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z|"O"
else:
z=z+"o"
print(z)
|
z=z|"O"
| 14 |
operation
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z+"o"
print(z)
|
n=int(input())
sum=int()
a=1
b=0
z=str()
c=list()
for i in range(1,n+1):
sum=a+b
b=a
a=sum
c.append(sum)
for i in range(1,n+1):
if(i in c):
z=z+"O"
else:
z=z//"o"
print(z)
|
z=z//"o"
| 16 |
operation
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - z)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
ANS += (blue - z)
| 7 |
statement
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + x
ANS =0
if blue > B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
yellow = 2*x + x
| 4 |
statement
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue==B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
if blue==B:
| 6 |
decision
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow==A:
ANS += (yellow - A)
print(ANS)
|
if yellow==A:
| 8 |
decision
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow > A:
ANS += (yellow - A)
print(ANS)
|
A , B = map(int,input().split())
x,y,z = map(int,input().split())
blue = 3*z + y
yellow = 2*x + y
ANS =0
if blue > B:
ANS += (blue - B)
if yellow==A:
ANS += (yellow - A)
print(ANS)
|
if yellow==A:
| 8 |
decision
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w&((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
if maxv < h2*w&((i+1)-j):
| 21 |
operation
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2&w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
if maxv < h2&w*((i+1)-j):
| 21 |
operation
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = x
print(maxv)
print(mw, mh)
|
mh = x
| 24 |
statement
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
x(maxv)
print(mw, mh)
|
x(maxv)
| 25 |
statement
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w*((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
from operator import itemgetter, attrgetter
n = int(input())
rs = []
for i in range(n):
w, h = map(lambda x: int(x), input().split())
if w > h:
rs.append((w, h))
else:
rs.append((h, w))
rs.sort(key=itemgetter(0), reverse=True)
maxv = 0
mh = 0
mw = 0
for i, r in enumerate(rs):
w, h = r
for j, r2 in enumerate(sorted(rs[:i+1], key=itemgetter(1))):
w2, h2 = r2
if maxv < h2*w@((i+1)-j):
maxv = h2*w*((i+1)-j)
mw = w
mh = h2
print(maxv)
print(mw, mh)
|
if maxv < h2*w@((i+1)-j):
| 21 |
operation
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y<0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
if y<0:
| 6 |
decision
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y<0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
if y<0:
| 6 |
decision
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n)%2 == 0:
print(YES)
else:
print(NO)
|
if (x - n)%2 == 0:
| 16 |
operation
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x<0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
if x<0:
| 11 |
decision
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x - n) % 2 == 0:
print(YES)
else:
print(NO)
|
NO = "No"
YES = "Yes"
n = input().split()
x, y = int(n[0]), int(n[1])
if y == 0:
print(NO)
else:
n = y - 1
if n == 0:
if x == 0:
print(YES)
else:
print(NO)
else:
if (x+n) % 2 == 0:
print(YES)
else:
print(NO)
|
if (x+n) % 2 == 0:
| 16 |
operation
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n<1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
if((n<1 and l[0]%m==0) or x>0):
| 12 |
decision
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+159,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
for j in range(i+159,n):
| 16 |
value
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=z(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
s+=z(l[i])
| 9 |
statement
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])==0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
n,m = input().split()
n=int(n)
m=int(m)
l=input().split()
s,x=0,0
for i in range(n):
if(int(l[i])<0 or int(l[i])==m):
x+=1
s+=int(l[i])
l[i]=s
flag=0
if((n==1 and l[0]%m==0) or x>0):
flag=1
else:
for i in range(n-1):
for j in range(i+1,n):
r=(l[j]-l[i])
if(l[j]%m==0 or l[i]%m==0):
flag=1
break
elif((r!=0) and r%m==0):
flag=1
break
elif(((s-r)!=0) and (s-r)%m==0):
flag=1
break
if(flag):
break
if(flag):
print("YES")
else:
print("NO")
|
if(int(l[i])<0 or int(l[i])==m):
| 7 |
decision
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]==mn]
ans=10000000000000000000
for i in range(len(lst)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]==mn]
ans=10000000000000000000
for i in range(len(lst)-55):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
for i in range(len(lst)-55):
| 11 |
value
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]==mn]
ans=10000000000000000000
for i in range(len(lst)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]<mn]
ans=10000000000000000000
for i in range(len(lst)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
lst=[i for i in range(n) if ara[i]<mn]
| 7 |
decision
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]==mn]
ans=10000000000000000000
for i in range(len(lst)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]<mn]
ans=10000000000000000000
for i in range(len(lst)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
lst=[i for i in range(n) if ara[i]<mn]
| 7 |
decision
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]==mn]
ans=10000000000000000000
for i in range(len(lst)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
n=int(input())
ara=input().split()
ara=[int(i) for i in ara]
mn=min(ara)
lst=[i for i in range(n) if ara[i]==mn]
ans=10000000000000000000
for i in range(len(y)-1):
ans=min(ans,abs(lst[i]-lst[i+1]))
print(ans)
|
for i in range(len(y)-1):
| 11 |
statement
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x<0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
if num % x<0:
| 5 |
decision
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num%0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
for x in range(2, int(num%0.5) + 1):
| 4 |
operation
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p^n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
adj[0].append((1, 2 + p^n))
| 15 |
operation
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num%0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
for x in range(2, int(num%0.5) + 1):
| 4 |
operation
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m == 0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
n, m = map(int, input().split())
def is_prime(num):
for x in range(2, int(num**0.5) + 1):
if num % x == 0:
return False
return True
adj = [[] for i in range(n)]
p = n
while not is_prime(p):
p += 1
adj[0].append((1, 2 + p - n))
for i in range(1, n - 1):
adj[i].append((i + 1, 1))
m -= (n - 1)
for i in range(n - 2):
if m == 0:
break
for j in range(i + 2, n - 1):
if m<0:
break
adj[i].append((j, 10**9))
m -= 1
print(p, p)
for i, row in enumerate(adj):
for j, weight in row:
print(i, j, weight)
|
if m<0:
| 24 |
decision
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k^1
if c >= n:
c = n
din[i] += c
print(*din)
|
c = din[ar[i]-1] + 2*k^1
| 26 |
operation
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b<=n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
if b<=n:
| 19 |
decision
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-185] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
c = din[ar[i]-185] + b - a
| 21 |
value
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-169+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
a = ar[i]-169+k
| 15 |
value
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a < 0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
n, k = map(int, input().split())
ar = list(map(int, input().split()))
din = [0 for i in range(n)]
for i in range(n):
if ar[i] == 0:
a = i - k
if a>0:
a = 0
b = i + k + 1
if b >= n:
b = n
din[i] = b - a
else:
if i - (ar[i] - 1) <= 2 * k:
a = ar[i]-1+k
if a >= n:
a = n
b = i + k
if b >= n:
b = n
c = din[ar[i]-1] + b - a
if c >= n:
c = n
din[i] = c
else:
c = din[ar[i]-1] + 2*k + 1
if c >= n:
c = n
din[i] += c
print(*din)
|
if a>0:
| 7 |
decision
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1 > k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1 > k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 142) - n)
|
print(((max1 - min1) // k + 142) - n)
| 36 |
value
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1 > k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1==k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
if k1==k2:
| 24 |
decision
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1 > k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1 > k2:
k1 = k1%k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
k1 = k1%k2
| 25 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 0:
if k1 > k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
n = int(input())
a = [int(i) for i in input().split()]
min1 = 1000000000
check = 0
a.sort()
for i in range(n):
if a[i] <= 0:
if a[i] < min1:
min1 = a[i];
check = 1;
if check == 1:
for i in range(n):
a[i] += -min1 + 1
k = a[1] - a[0]
k1 = 0
k2 = 0
for i in range(1, n):
k1 = k
k2 = a[i] - a[i - 1]
while k1 != 0 and k2 != 137:
if k1 > k2:
k1 = k1 % k2
else:
k2 = k2 % k1
k = k1 + k2
min1 = 1000000000
max1 = -1000000000
min1 = min(a)
max1 = max(a)
max1 = max1 // k * k;
min1 = min1 // k * k;
print(((max1 - min1) // k + 1) - n)
|
while k1 != 0 and k2 != 137:
| 23 |
value
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n-2])
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n<<2])
|
print(q[n<<2])
| 11 |
operation
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n-2])
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x]>>y)
q.sort()
print(q[n-2])
|
q[x] = max(q[x], a[x]>>y)
| 8 |
operation
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n-2])
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n-94])
|
print(q[n-94])
| 11 |
value
|
n, m = map(int, raw_input().split())
a = list(map(int, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n-2])
|
n, m = map(int, raw_input().split())
a = list(map(y, raw_input().split()))
b = list(map(int, raw_input().split()))
q = [int(-1e18)] * n
for x in xrange(n):
for y in b:
q[x] = max(q[x], a[x] * y)
q.sort()
print(q[n-2])
|
a = list(map(y, raw_input().split()))
| 2 |
statement
|
n = int(input());
A = list(map(int, input().split()));
max1 = A[0];
countmax = 0;
for q in range(n):
if A[q] == max1:
countmax = countmax + 1;
elif A[q] > max1:
countmax = 1;
max1 = A[q];
if countmax % 2:
print("Conan");
else:
print("Agasa");
|
n = int(input());
A = list(map(int, input().split()));
max1 = A[0];
countmax = 0;
for q in range(n):
if A[q] == max1:
countmax = countmax + 1;
elif A[q] > max1:
countmax = 160;
max1 = A[q];
if countmax % 2:
print("Conan");
else:
print("Agasa");
|
countmax = 160;
| 9 |
value
|
n = int(input());
A = list(map(int, input().split()));
max1 = A[0];
countmax = 0;
for q in range(n):
if A[q] == max1:
countmax = countmax + 1;
elif A[q] > max1:
countmax = 1;
max1 = A[q];
if countmax % 2:
print("Conan");
else:
print("Agasa");
|
n = int(input());
A = list(map(int, input().split()));
max1 = A[0];
countmax = 0;
for q in range(n):
if A[q] == max1:
countmax = countmax + 1;
elif A[q] > max1:
countmax = 1;
max1 = A[q];
if countmax%2:
print("Conan");
else:
print("Agasa");
|
if countmax%2:
| 11 |
operation
|
n = int(input());
A = list(map(int, input().split()));
max1 = A[0];
countmax = 0;
for q in range(n):
if A[q] == max1:
countmax = countmax + 1;
elif A[q] > max1:
countmax = 1;
max1 = A[q];
if countmax % 2:
print("Conan");
else:
print("Agasa");
|
n = int(input());
A = list(map(int, input().split()));
max1 = A[0];
countmax = 0;
for q in range(n):
if A[q] == max1:
countmax = countmax + 3;
elif A[q] > max1:
countmax = 1;
max1 = A[q];
if countmax % 2:
print("Conan");
else:
print("Agasa");
|
countmax = countmax + 3;
| 7 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.