original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[1]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | a = list(map(int, input().split()))
array = list(map(int, input().split()))
array.sort()
n = a[0]
d = a[193]
count = 0
if d == 0:
print(0)
else:
for i in range(0, len(array)):
for j in range(i + 1, len(array)):
if array[j] - array[i] <= d:
count = max(count, j - i + 1)
print(n - count) | d = a[193] | 8 | value |
s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j]==p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | if c[8 * i + j]==p: | 19 | decision |
s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
x() | x() | 29 | statement |
s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8>>i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | p = c[8>>i + j] | 20 | operation |
s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j]==p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | if c[8 * i + j]==p: | 19 | decision |
s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | s = []
c = []
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [3 , 3 , 0 , 4 , 4 , 0 , 3 , 3]
c += [2 , 2 , 0 , 3 , 3 , 120 , 2 , 2]
c += [2 , 2 , 0 , 3 , 3 , 0 , 2 , 2]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
c += [1 , 1 , 0 , 2 , 2 , 0 , 1 , 1]
for i in range(6):
s.append(input())
p = 0
pos = 0
for i in range(6):
for j in range(8):
if s[i][j] == '.':
if c[8 * i + j] > p:
p = c[8 * i + j]
pos = (i , j)
for i in range(6):
for j in range(8):
if pos == (i , j):
print('P',end="")
else:
print(s[i][j],end="")
print() | c += [2 , 2 , 0 , 3 , 3 , 120 , 2 , 2] | 5 | value |
n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 109
num = n // a[i]
print(box, num) | box = i + 109 | 9 | value |
n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 51
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | mod = n + 51 | 4 | value |
n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i&1
num = n // a[i]
print(box, num) | box = i&1 | 9 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n/a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | m = n/a[i] | 6 | operation |
n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n // a[i]
print(box, num) | n, k = map(int, input().split())
a = list(map(int, input().split()))
box, num = 0, 0
mod = n + 1
for i in range(k):
m = n % a[i]
if m < mod:
mod = m
box = i + 1
num = n@a[i]
print(box, num) | num = n@a[i] | 10 | operation |
x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in (str(t//60) and str(t%60)):
t-=x
y+=1
if t<0:
t=1439+t+1
print(y) | x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in (str(t//60) and str(t%60)):
t-=x
y+=1
if t<0:
t=1439+z+1
print(y) | t=1439+z+1 | 11 | statement |
x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in (str(t//60) and str(t%60)):
t-=x
y+=1
if t<0:
t=1439+t+1
print(y) | x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in (str(t//60) and str(t%60)):
t-=x
y+=1
if t>0:
t=1439+t+1
print(y) | if t>0: | 10 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + x[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | b[i][j + x[i]] = 1 | 13 | statement |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0]<1:
print('YES')
else:
print('NO') | if b[n - 1][0]<1: | 14 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i]<=m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | if j + a[i]<=m: | 10 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [y(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [y(i) for i in input().split()] | 1 | statement |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][0] = 2
b[0][a[0]] = 1
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i]/m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | b[i][j + a[i]/m] = 1 | 11 | operation |
Input = list(map(int,input().split()))
n, pos, l, r = Input[0], Input[1], Input[2], Input[3]
if l == 1 and r != n:
print(abs(r - pos) + 1)
elif r == n and l != 1:
print(abs(pos - l) + 1)
elif l == 1 and r == n:
print('0')
else:
print(min(abs(pos - l), abs(r - pos)) + r - l + 2) | Input = list(map(int,input().split()))
n, pos, l, r = Input[0], Input[1], Input[2], Input[3]
if l == 1 and r != n:
print(abs(r - pos) + 1)
elif r == n and l != 1:
print(abs(pos - l) + 1)
elif l == 1 and r<n:
print('0')
else:
print(min(abs(pos - l), abs(r - pos)) + r - l + 2) | elif l == 1 and r<n: | 7 | decision |
Input = list(map(int,input().split()))
n, pos, l, r = Input[0], Input[1], Input[2], Input[3]
if l == 1 and r != n:
print(abs(r - pos) + 1)
elif r == n and l != 1:
print(abs(pos - l) + 1)
elif l == 1 and r == n:
print('0')
else:
print(min(abs(pos - l), abs(r - pos)) + r - l + 2) | Input = list(map(int,input().split()))
n, pos, l, r = Input[0], Input[1], Input[2], Input[3]
if l == 1 and r != n:
print(abs(r - pos) + 1)
elif r<n and l != 1:
print(abs(pos - l) + 1)
elif l == 1 and r == n:
print('0')
else:
print(min(abs(pos - l), abs(r - pos)) + r - l + 2) | elif r<n and l != 1: | 5 | decision |
Input = list(map(int,input().split()))
n, pos, l, r = Input[0], Input[1], Input[2], Input[3]
if l == 1 and r != n:
print(abs(r - pos) + 1)
elif r == n and l != 1:
print(abs(pos - l) + 1)
elif l == 1 and r == n:
print('0')
else:
print(min(abs(pos - l), abs(r - pos)) + r - l + 2) | Input = list(map(int,input().split()))
n, pos, l, r = Input[0], Input[1], Input[2], Input[3]
if l == 1 and r != n:
print(abs(r|pos) + 1)
elif r == n and l != 1:
print(abs(pos - l) + 1)
elif l == 1 and r == n:
print('0')
else:
print(min(abs(pos - l), abs(r - pos)) + r - l + 2) | print(abs(r|pos) + 1) | 4 | operation |
from collections import Counter
s = input().strip()
counter = Counter(s)
nchar = len(counter)
ans = 'No'
if nchar==4 or \
nchar==3 and any([n>1 for ch, n in counter.items()]) or\
nchar==2 and all([n>1 for ch, n in counter.items()]):
ans = 'Yes'
print(ans) | from collections import Counter
s = input().y()
counter = Counter(s)
nchar = len(counter)
ans = 'No'
if nchar==4 or \
nchar==3 and any([n>1 for ch, n in counter.items()]) or\
nchar==2 and all([n>1 for ch, n in counter.items()]):
ans = 'Yes'
print(ans) | s = input().y() | 2 | statement |
from collections import Counter
s = input().strip()
counter = Counter(s)
nchar = len(counter)
ans = 'No'
if nchar==4 or \
nchar==3 and any([n>1 for ch, n in counter.items()]) or\
nchar==2 and all([n>1 for ch, n in counter.items()]):
ans = 'Yes'
print(ans) | from collections import Counter
s = input().strip()
counter = Counter(s)
nchar = len(counter)
ans = 'No'
if nchar==4 or \
nchar==3 and any([n>1 for ch, n in counter.items()]) or\
nchar<2 and all([n>1 for ch, n in counter.items()]):
ans = 'Yes'
print(ans) | nchar<2 and all([n>1 for ch, n in counter.items()]): | 8 | decision |
n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc^minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | p = maxc^minc | 9 | operation |
n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n<1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | if n<1: | 6 | decision |
n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = x - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | maxp = x - minp | 13 | statement |
n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n%minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | maxp = n%minp | 13 | operation |
n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp < 1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | n, a, b = (int(i) for i in input().split())
minc = min(a, b)
maxc = max(a, b)
if n == 1:
print(minc)
exit()
p = maxc // minc
minp = minc // n
if minp>1:
minp = 1
maxp = n - minp
s = min(minc / minp, maxc / maxp)
if s < 1:
s = 1
print(int(s)) | if minp>1: | 11 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i<"o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | if i<"o" or i == "O": | 9 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format+i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | logins_format = logins_format+i | 13 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower()<new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | if new_logins[0].lower()<new_logins[counter].lower(): | 22 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i<"o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | if i<"o" or i == "O": | 9 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format|" "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
return output
test = new_login_check(input())
print(test) | logins_format = logins_format|" " | 14 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)+max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | if max(a)+max(b)>min(a)*min(b): | 7 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)<<max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | if max(a)<<max(b)>min(a)*min(b): | 7 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i/j)
print(max(c)) | c.append(i/j) | 14 | operation |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)==0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | if min(b)==0: | 4 | decision |
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=0:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if min(b)>0:
a.remove(max(a))
elif min(b)<=184:
if max(a)*max(b)>min(a)*min(b):
a.remove(max(a))
else:
a.remove(min(a))
c=[]
for i in a:
for j in b:
c.append(i*j)
print(max(c)) | elif min(b)<=184: | 6 | value |
import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num%10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | return num % 10 + sumDig(num%10) | 6 | operation |
import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(x(n) == 10):
k -= 1
n += 1
print(n-1) | if(x(n) == 10): | 11 | statement |
import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n<<1) | print(n<<1) | 14 | operation |
import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | import sys
def sumDig(num):
if(x < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | if(x < 10): | 4 | statement |
import sys
def sumDig(num):
if(num < 10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | import sys
def sumDig(num):
if(num>10):
return num
return num % 10 + sumDig(num // 10)
k = int(input())
n = 19
while(k > 0):
if(sumDig(n) == 10):
k -= 1
n += 1
print(n-1) | if(num>10): | 4 | decision |
n=int(input())
t=[[] for i in range(1000)]
for i in range(1,n+1):
a,b=map(int,input().split())
x=a//1000
if x>=1000:x=999
t[x]+=[(a,b,i)]
d="haut"
for i in range(1000):
if t[i]!=[]:
g=sorted(t[i],key=lambda e:e[1])
for (a,b,j) in g:
print(j,end=" ") | n=int(input())
t=[[] for i in range(1000)]
for i in range(1,n+1):
a,b=map(int,input().split())
x=a//1000
if x<=1000:x=999
t[x]+=[(a,b,i)]
d="haut"
for i in range(1000):
if t[i]!=[]:
g=sorted(t[i],key=lambda e:e[1])
for (a,b,j) in g:
print(j,end=" ") | if x<=1000:x=999 | 6 | decision |
n=int(input())
t=[[] for i in range(1000)]
for i in range(1,n+1):
a,b=map(int,input().split())
x=a//1000
if x>=1000:x=999
t[x]+=[(a,b,i)]
d="haut"
for i in range(1000):
if t[i]!=[]:
g=sorted(t[i],key=lambda e:e[1])
for (a,b,j) in g:
print(j,end=" ") | n=int(input())
t=[[] for i in range(1000)]
for i in range(1,n+1):
a,b=map(int,input().split())
x=a//1000
if x>=1000:x=999
t[x]+=[(a,b,i)]
d="haut"
for i in range(1000):
if t[i]!=[]:
g=sorted(t[i],key=lambda e:e[146])
for (a,b,j) in g:
print(j,end=" ") | g=sorted(t[i],key=lambda e:e[146]) | 12 | value |
n=int(input())
t=[[] for i in range(1000)]
for i in range(1,n+1):
a,b=map(int,input().split())
x=a//1000
if x>=1000:x=999
t[x]+=[(a,b,i)]
d="haut"
for i in range(1000):
if t[i]!=[]:
g=sorted(t[i],key=lambda e:e[1])
for (a,b,j) in g:
print(j,end=" ") | n=int(input())
t=[[] for i in range(1000)]
for i in range(1,n+1):
a,b=map(int,input().split())
x=a+1000
if x>=1000:x=999
t[x]+=[(a,b,i)]
d="haut"
for i in range(1000):
if t[i]!=[]:
g=sorted(t[i],key=lambda e:e[1])
for (a,b,j) in g:
print(j,end=" ") | x=a+1000 | 5 | operation |
n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 153, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | for i in range(len(s) // 2, 153, -1): | 6 | value |
n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i>len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | if l + i < len(s) and j + i>len(s) and (i>o) and (s[j:j+i] == s[l:j+i]): | 9 | decision |
n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:x+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | s1 = s[j:x+i] | 11 | statement |
n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i]<s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i]<s[l:j+i]): | 9 | decision |
n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i] == s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | n = int(input())
s = input()
o = -1
k = len(s)
s1 = ""
for i in range(len(s) // 2, 0, -1):
for j in range(len(s)):
for l in range(j,len(s)):
if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i]<s[l:j+i]):
o = i
s1 = s[j:j+i]
ss = s.replace(s1, "")
k = (k - len(ss))
print(k // o - 1 + len(ss) + o) | if l + i < len(s) and j + i < len(s) and (i>o) and (s[j:j+i]<s[l:j+i]): | 9 | decision |
n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]*n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in (''.join(t) for t in arrInv))
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]*n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in (''.join(t) for t in arrInv))
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.x(arr)) | print('\n'.x(arr)) | 11 | statement |
n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]*n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in (''.join(t) for t in arrInv))
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]/n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in (''.join(t) for t in arrInv))
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | arr=[input().replace('.','D') for i in [3]/n] | 2 | operation |
n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]*n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in (''.join(t) for t in arrInv))
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | n,m=map(int,input().split())
arr=[input().replace('.','D') for i in [3]^n]
flag1=any('WS' in x or 'SW' in x for x in arr)
arrInv=zip(*arr)
flag2=any('WS' in x or 'SW' in x for x in (''.join(t) for t in arrInv))
if flag1 or flag2:
print("No")
else:
print("Yes")
print('\n'.join(arr)) | arr=[input().replace('.','D') for i in [3]^n] | 2 | operation |
import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)@ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if (ord(i)@ord('a')<=x): | 10 | operation |
import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)**ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if (ord(i)**ord('a')<=x): | 10 | operation |
import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
if(len(s)>26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if(len(s)>26): | 4 | decision |
import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)//ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if (ord(i)//ord('a')<=x): | 10 | operation |
import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
if(len(s)<26):
return -1
else:
x=149
for i in s:
if (ord(i)-ord('a')<=x):
x+=1
if(x>=26):
return 'abcdefghijklmnopqrstuvwxyz'
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | x=149 | 8 | value |
n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t) == 1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t)<1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | if not(abs(s - t) == y or (abs(s - t)<1 and min(s, t) % y != 0)): | 12 | decision |
n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t) == 1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[117:]):
if not(abs(s - t) == y or (abs(s - t) == 1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | for s, t in zip(a, a[117:]): | 11 | value |
n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t) == 1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(y - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t) == 1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | y.append(abs(y - t)) | 7 | statement |
n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t) == 1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | n = int(input())
a = [int(x) for x in input().split()]
y = []
for s, t in zip(a, a[1:]):
if abs(s - t) != 1 and s != t:
y.append(abs(s - t))
y.append(1)
y = y[0]
for s, t in zip(a, a[1:]):
if not(abs(s - t) == y or (abs(s - t)<1 and min(s, t) % y != 0)):
break
else:
print("YES")
print("{} {}".format(10**9, y))
exit()
print("NO") | if not(abs(s - t) == y or (abs(s - t)<1 and min(s, t) % y != 0)): | 12 | decision |
cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p])>=2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p])>=2: | 20 | decision |
cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k])>=2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k])>=2: | 17 | decision |
cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p])>=2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p])>=2: | 20 | decision |
cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q])>=2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q])>=2: | 23 | decision |
cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q]) / min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | cmd = [0] * 6
g, d, f = map(int, input().split())
gol = list(map(int, input().split()))
defe = list(map(int, input().split()))
fig = list(map(int, input().split()))
cnt = 0
for i in range(g):
cmd[0] = gol[i]
for j in range(d):
if max(gol[i], defe[j]) / min(gol[i], defe[j]) <= 2:
cmd[1] = defe[j]
for k in range(j, d):
if max(gol[i], defe[j], defe[k]) / min(gol[i], defe[j], defe[k]) <= 2:
cmd[2] = defe[k]
for p in range(f):
if max(gol[i], defe[j], defe[k], fig[p]) / min(gol[i], defe[j], defe[k], fig[p]) <= 2:
cmd[3] = fig[p]
for q in range(p, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q])@min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2:
cmd[4] = fig[q]
for r in range(q, f):
if max(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) / min(gol[i], defe[j], defe[k], fig[p], fig[q], fig[r]) <= 2:
cmd[5] = fig[r]
cnt += 1
print(cnt) | if max(gol[i], defe[j], defe[k], fig[p], fig[q])@min(gol[i], defe[j], defe[k], fig[p], fig[q]) <= 2: | 23 | operation |
def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = z("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | n = z("Number of moves") | 28 | statement |
def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif x == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | elif x == "R": | 13 | statement |
def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x>y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | elif x>y: f = 1 | 17 | decision |
def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m == "U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | def coincount(n, S):
f = 0
x = y = 0
i = 0
cross = [0,0,0]
count = 0
while i < n:
cross[0] = cross[1]
cross[1] = cross[2]
cur_m = S[i]
if cur_m<"U":
y += 1
elif cur_m == "R":
x += 1
if x > y: f = -1
elif x < y: f = 1
else: f = 0
cross[2] = f
if cross == [-1, 0, 1] or cross == [1, 0, -1]:
count += 1
i += 1
return count
n = input("Number of moves")
n = int(n)
S = input("Sequence of moves")
coincount(n, S) | if cur_m<"U": | 11 | decision |
n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in y(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| for i in y(n): | 13 | statement |
n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2/min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| print(n-2/min(counta1,counta2)) | 22 | operation |
n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)>2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| if((a1-a2)>2): | 7 | decision |
n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-z)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| if((a1-z)<2): | 7 | statement |
n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]==a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| n=int(input())
a=list(map(int,input().split()))
a1=max(a)
a2=min(a)
if((a1-a2)<2):
print(n)
print(*a)
else:
counta1=0
counta2=0
for i in range(n):
if(a[i]<a1):
counta1+=1
elif(a[i]==a2):
counta2+=1
s1=str(a1)+ ' '
s2=str(a2) + ' '
s3=str(a2+1) + ' '
if(min(counta1,counta2)>(n-counta1-counta2)//2):
print(n-2*min(counta1,counta2))
print(s1*(counta1-min(counta1,counta2)) + s2*(counta2-min(counta1,counta2)) + s3*(n-counta1 - counta2 + 2*min(counta1,counta2)))
else:
x=n-counta1 - counta2
print(n-(x//2)*2)
print(s1*(counta1 + x//2) + s2*(counta2 + x//2) + s3*(x%2))
| if(a[i]<a1): | 14 | decision |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n or k>=n/2:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global y
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n or k>=n/2:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | global y | 5 | statement |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n or k>=n/2:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 48:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n or k>=n/2:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i-d > 48: | 9 | value |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n or k>=n/2:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-d > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+d < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n or y>=n/2:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if k >= n or y>=n/2: | 24 | statement |
n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q%1;
q = q + 1;
print(s); | q = q%1; | 8 | operation |
n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < y(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | while q < y(s) - 1: | 5 | statement |
n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q/1;
print(s); | q = q/1; | 9 | operation |
n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q < len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | n = int(input());
e = "aeiuoy";
s = input();
q = 0;
while q>len(s) - 1:
if s[q] in e and s[q + 1] in e:
s = s[:q + 1] + s[q + 2:];
q = q - 1;
q = q + 1;
print(s); | while q>len(s) - 1: | 5 | decision |
n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i<q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | if (i<q): | 9 | decision |
n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i<q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | if (i<q): | 9 | decision |
n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i<q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | if (i<q): | 9 | decision |
n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n>>m)+1)
print(min(space)) | space.append((n>>m)+1) | 13 | operation |
n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(l)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | n = int (input(""))
l = []
space = []
for x in range(n):
p=int(input(""))
l.append(p)
q=min(y)
for i in l:
if (i==q):
m=l.index(q)
l.remove(q)
n = l.index(q)
space.append((n-m)+1)
print(min(space)) | q=min(y) | 7 | statement |
n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i*1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | x = a[i]-a[i*1] | 14 | operation |
n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i]==b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | if a[i]==b: | 24 | decision |
n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1)^x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | if (mas[i][0]-1) // x != (mas[i][1]-1)^x: | 33 | operation |
n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1]) > 1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | n = int(input())
a = list(map(int,input().split(' ')))
m = a[0]
b = a[0]
x = 0
mas = []
fl = True
for i in range(1,n):
if a[i] == a[i-1]:
fl = False
break
if abs(a[i]-a[i-1])==1:
if x == 0:
x = a[i]-a[i-1]
else:
if x != abs(a[i]-a[i-1]):
fl = False
break
if m != b:
mas.append((m,b))
m = a[i]
b = a[i]
else:
if a[i] > b:
b = a[i]
if a[i] < m:
m = a[i]
if m != b:
mas.append((m,b))
for i in range(len(mas)):
if x != 0:
if (mas[i][0]-1) // x != (mas[i][1]-1) // x:
fl = False
break
else:
x = 1
if fl:
print('YES')
print(str(1000000000),str(x))
else:
print('NO') | if abs(a[i]-a[i-1])==1: | 12 | decision |
import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud)==0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | while (len(stud)==0): | 18 | decision |
import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda y: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | stud.sort(key = lambda y: x[0]) | 15 | statement |
import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds)%' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | print(str(seconds)%' ', end = '') | 31 | operation |
import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q)==0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | while s[1] < seconds and len(q)==0 and len(stud) > 0: | 22 | decision |
import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1] < seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | import sys
import os
import math
import re
t = int(input())
for _ in range(t):
n = int(input())
stud = []
for _ in range(n):
l,r = map(int,input().split())
stud.append((l,r))
stud.sort(key = lambda x: x[0])
seconds = 1
q = []
while (len(stud) > 0):
[q.append(kid) for kid in stud if kid[0] == seconds]
if (len(q) > 0):
s = q[0]
while s[1]>seconds and len(q) > 0 and len(stud) > 0:
print('0 ', end='')
del q[0]
del stud[0]
if (len(stud) <= 0 or len(q) <= 0):
break;
s = q[0]
if (len(q) > 0 and len(stud) > 0):
if (q[0][0] <= seconds):
print(str(seconds) + ' ', end = '')
del q[0]
del stud[0]
seconds +=1
print("") | while s[1]>seconds and len(q) > 0 and len(stud) > 0: | 22 | decision |
n=int(input())
a=[int(i) for i in input().split()]
m=min(a)
b=[]
otvet=[]
pos0=a.index(m)
for i in range(len(a)):
if (a[i]==m) & (i!=pos0):
b.append(i)
for i in b:
otvet.append((i-pos0))
pos0=i
print(min(otvet)) | n=int(input())
a=[int(i) for i in input().split()]
m=min(a)
b=[]
otvet=[]
pos0=a.index(m)
for i in range(len(a)):
if (a[i]==m) & (i!=pos0):
b.append(i)
for i in b:
otvet.append((i*pos0))
pos0=i
print(min(otvet)) | otvet.append((i*pos0)) | 11 | operation |
n=int(input())
a=[int(i) for i in input().split()]
m=min(a)
b=[]
otvet=[]
pos0=a.index(m)
for i in range(len(a)):
if (a[i]==m) & (i!=pos0):
b.append(i)
for i in b:
otvet.append((i-pos0))
pos0=i
print(min(otvet)) | n=int(input())
a=[int(i) for i in input().split()]
m=min(a)
b=[]
otvet=[]
pos0=a.index(m)
for i in range(len(a)):
if (a[i]==m)>>(i!=pos0):
b.append(i)
for i in b:
otvet.append((i-pos0))
pos0=i
print(min(otvet)) | if (a[i]==m)>>(i!=pos0): | 8 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.