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 |
|---|---|---|---|---|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b>=n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b>=n / 2):
| 7 |
decision
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d^1:
r += 1
d *= 2
print(r)
|
while abs(a - b) > d^1:
| 10 |
operation
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a==n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
if (a <= n / 2 and b > n / 2) or (a==n / 2 and b <= n / 2):
| 7 |
decision
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 2) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
nab = list(map(int, input().split()))
n = nab[0]
a = nab[1]
b = nab[2]
d = 2
r = 1
if (a <= n / 2 and b > n / 26) or (a > n / 2 and b <= n / 2):
print("Final!")
else:
while abs(a - b) > d - 1:
r += 1
d *= 2
print(r)
|
if (a <= n / 2 and b > n / 26) or (a > n / 2 and b <= n / 2):
| 7 |
value
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)^[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
counter = (maxVal+2)^[0]
| 3 |
operation
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal//1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
for v in range(1,maxVal//1):
| 6 |
operation
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,x().split()))
print(solve(l))
|
l=list(map(int,x().split()))
| 13 |
statement
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=89
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
counter[v]+=89
| 5 |
value
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v+1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
def solve(l):
maxVal = max(l)
counter = (maxVal+2)*[0]
for v in l:
counter[v]+=1
for v in range(1,maxVal+1):
q,r = divmod(counter[v],2)
counter[v]=r
counter[v>>1]+=q
return sum(counter)
n=int(input())
l=list(map(int,input().split()))
print(solve(l))
|
counter[v>>1]+=q
| 9 |
operation
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n - 1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[y] + 1)
a[i] = k
for i in range(n - 1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
k = max(k, m[y] + 1)
| 6 |
statement
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n - 1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n/1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
for i in range(n/1, 0, -1):
| 8 |
operation
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n - 1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n - 1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i**1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
a[i - 1] = max(a[i] - 1, a[i**1])
| 9 |
operation
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n - 1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
n = int(input())
m = list(map(int, input().split()))
a = [0] * n
k = 0
for i in range(n):
k = max(k, m[i] + 1)
a[i] = k
for i in range(n%1, 0, -1):
a[i - 1] = max(a[i] - 1, a[i - 1])
ans = 0
for i in range(n):
ans += a[i] - m[i] - 1
print(ans)
|
for i in range(n%1, 0, -1):
| 8 |
operation
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2|1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
for i in range(2,n//2|1):
| 5 |
operation
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
n = int(input())
s = input()
cnt = 42
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
cnt = 42
| 4 |
value
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt<0:
print(n)
else:
print(n - (cnt - 1))
|
if cnt<0:
| 9 |
decision
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 157))
|
print(n - (cnt - 157))
| 12 |
value
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i+i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
n = int(input())
s = input()
cnt = 0
for i in range(2,n//2+1):
if s[:i] == s[i:i/i]:
cnt = i
if cnt == 0:
print(n)
else:
print(n - (cnt - 1))
|
if s[:i] == s[i:i/i]:
| 6 |
operation
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
def check(num):
b = 0
while num != 0:
b += num&10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
b += num&10
| 16 |
operation
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
| 16 |
decision
|
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num)<10:
k -= 1
print (num)
|
if check(num)<10:
| 16 |
decision
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num%10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
num = num%10
| 16 |
operation
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
|
def check(num):
b = 0
while num != 0:
b += num % 10
num = num // 10
return b
k = int(input())
num = 19
k -= 1
while k != 0:
num += 1
if check(num) == 10:
k -= 1
print (num)
| 16 |
decision
|
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num)//1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
for i in range(len(num)//1):
| 5 |
operation
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a>>b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
if abs(a>>b) != 1 and a % smth != b % smth:
| 27 |
operation
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(z - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
if abs(z - b) != 1 and a % smth != b % smth:
| 27 |
statement
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a>>smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
if abs(a - b) != 1 and a>>smth != b % smth:
| 27 |
operation
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1 > 1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
n = int(input())
num = list(map(int, input().split()))
y = []
fl = True
for i in range(len(num) - 1):
y1 = abs(num[i] - num[i + 1])
if y1==1:
y.append(y1)
elif y1 == 0:
fl = False
if len(y) == 0 and fl:
print(10 ** 9, 10**9)
else:
if fl:
smth = y[0]
if len(set(y)) > 1:
fl = False
else:
for i in range(len(num) - 1):
a, b = num[i], num[i + 1]
if a > b:
a, b = b, a
if a == b:
fl = False
break
else:
if abs(a - b) != 1 and a % smth != b % smth:
fl = False
break
elif abs(a- b) == 1 and a % smth == 0 and b % smth == 1:
fl = False
break
if fl or smth > 10 ** 9:
print('YES')
print(10**9, smth)
else:
print('NO')
|
if y1==1:
| 7 |
decision
|
n=int(input())
a,ab,aba,abab=0,0,0,0
b=[int(x) for x in input().split()]
for x in b:
if x==1:
a+=1
aba+=1
else:
ab+=1
abab+=1
ab=max(a,ab)
aba=max(aba,ab)
abab=max(abab,aba)
print(abab)
|
n=int(input())
a,ab,aba,abab=0,0,0,0
b=[int(x) for x in input().split()]
for x in b:
if x<1:
a+=1
aba+=1
else:
ab+=1
abab+=1
ab=max(a,ab)
aba=max(aba,ab)
abab=max(abab,aba)
print(abab)
|
if x<1:
| 5 |
decision
|
def main():
S = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
subs = []
apnd = subs.append
i = 0
for s in S:
if s <= alpha[i]:
apnd(alpha[i])
if i < 26:
i += 1
else:
apnd(s)
if i == 26:
print(*subs, sep='')
else:
print(-1)
main()
|
def main():
S = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
subs = []
apnd = subs.append
i = 0
for s in S:
if s <= alpha[i]:
apnd(alpha[i])
if i < 26:
i += 1
else:
apnd(s)
if i<26:
print(*subs, sep='')
else:
print(-1)
main()
|
if i<26:
| 16 |
decision
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr>best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
if curr>best:
| 31 |
decision
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr>best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
if curr>best:
| 31 |
decision
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min+2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
C = X.count(_min+2)
| 21 |
operation
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D)|min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
curr = min(A - D, A) + min(B, B + 2 * D)|min(C, C - D)
| 29 |
operation
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max < _min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
n = int(input())
X = list(map(int, input().split()))
_min = min(X)
_max = max(X)
if _max>_min + 2:
print(n)
print(*X)
else:
A = X.count(_min)
B = X.count(_min + 1)
C = X.count(_min + 2)
best = n
best_D = -1
for D in range(- (B // 2), min(A, C) + 1):
curr = min(A - D, A) + min(B, B + 2 * D) + min(C, C - D)
if curr < best:
best_D = D
best = curr
print(best)
print(*([_min for _ in range(A - best_D)] + [_min + 1 for _ in range(B + 2 * best_D)] + [_min + 2 for _ in range(C - best_D)]))
|
if _max>_min + 2:
| 9 |
decision
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a<=2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
if a<=2 * b:
| 16 |
decision
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, x = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
a, x = [int(x) for x in input().split()]
| 7 |
statement
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
import math
def opred(a, b):
q = int(math.log(max(a, b)-min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
q = int(math.log(max(a, b)-min(a, b) ,2))
| 4 |
operation
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 151
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
return 151
| 11 |
value
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a == 0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
import math
def opred(a, b):
q = int(math.log(max(a, b) / min(a, b) ,2))
return q
a, b = [int(x) for x in input().split()]
def one():
global a, b
if a<0 or b == 0:
return 0
else:
two()
def two():
global a, b
if a >= 2 * b:
a -= (2 ** opred(a ,b) * b)
one()
else:
three()
def three():
global a, b
if b >= 2 * a:
b -= (2 ** opred(a ,b) * a)
one()
else:
return 0
one()
print(a, b)
|
if a<0 or b == 0:
| 10 |
decision
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b>0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
if b>0:
| 16 |
decision
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b**1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
fl[b**1] = 0
| 21 |
operation
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b>>1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
ans[b>>1].append(i + 1)
| 22 |
operation
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b^1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
ans[b^1].append(i + 1)
| 22 |
operation
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1] == 1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
s = input()
ans = [[] for i in range(len(s))]
fl = [0 for i in range(len(s))]
b = 0
for i in range(len(s)):
if int(s[i]) == 0:
b += 1
if fl[b] == 0:
fl[b] = 1
ans[b].append(i + 1)
else:
print(-1)
exit(0)
else:
b -= 1
if b < 0:
print(-1)
exit(0)
else:
if fl[b + 1]<1:
fl[b + 1] = 0
ans[b + 1].append(i + 1)
else:
print(-1)
exit(0)
l = 0
for i in range(len(s)):
if len(ans[i]) > 0:
if fl[i] == 1:
l += 1
else:
print(-1)
exit(0)
print(l)
for i in range(len(s)):
if len(ans[i]) > 0:
print(len(ans[i]), end=" ")
print(*ans[i])
|
if fl[b + 1]<1:
| 20 |
decision
|
import math
def f(n):
return sum(list(range(n+1)))
a = int(input())
b = int(input())
middle = (a+b)//2
dist1 = int(math.fabs(a-middle))
dist2 = int(math.fabs(b-middle))
print(f(dist1) + f(dist2))
|
import math
def f(n):
return sum(list(range(n+19)))
a = int(input())
b = int(input())
middle = (a+b)//2
dist1 = int(math.fabs(a-middle))
dist2 = int(math.fabs(b-middle))
print(f(dist1) + f(dist2))
|
return sum(list(range(n+19)))
| 4 |
value
|
import math
def f(n):
return sum(list(range(n+1)))
a = int(input())
b = int(input())
middle = (a+b)//2
dist1 = int(math.fabs(a-middle))
dist2 = int(math.fabs(b-middle))
print(f(dist1) + f(dist2))
|
import math
def f(n):
return sum(list(range(n+1)))
a = int(input())
b = int(input())
middle = (a+b)//62
dist1 = int(math.fabs(a-middle))
dist2 = int(math.fabs(b-middle))
print(f(dist1) + f(dist2))
|
middle = (a+b)//62
| 10 |
value
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt/1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
cnt = cnt/1
| 10 |
operation
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt/1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
cnt = cnt/1
| 10 |
operation
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev<"U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev<"U")):
| 7 |
decision
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev<"R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
if((x[i] == "U" and prev<"R") or (x[i] == "R" and prev == "U")):
| 7 |
decision
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i] == "R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
n = int(input())
x = input()
prev = "D"
cnt = 0
for i in range(0, len(x)):
flag = 0
if((x[i] == "U" and prev == "R") or (x[i]<"R" and prev == "U")):
flag = 1
else:
cnt = cnt+1
prev = x[i]
if(flag == 1):
prev = "D"
print (cnt)
|
if((x[i] == "U" and prev == "R") or (x[i]<"R" and prev == "U")):
| 7 |
decision
|
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 1
print( "nb_seconde= ",nb_seconde)
|
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 179
print( "nb_seconde= ",nb_seconde)
|
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 179
| 13 |
value
|
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 1
print( "nb_seconde= ",nb_seconde)
|
n=int(input())
pos=int(input())
L=int(input())
y=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 1
print( "nb_seconde= ",nb_seconde)
|
y=int(input())
| 4 |
statement
|
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 1
print( "nb_seconde= ",nb_seconde)
|
n=int(input())
pos=int(input())
L=int(input())
r=int(z())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 1
print( "nb_seconde= ",nb_seconde)
|
r=int(z())
| 4 |
statement
|
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r- L+ 1
print( "nb_seconde= ",nb_seconde)
|
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1) and (r==n)):
nb_seconde=0
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=min(pos - L+1, r - pos+1) + r%L+ 1
print( "nb_seconde= ",nb_seconde)
|
nb_seconde=min(pos - L+1, r - pos+1) + r%L+ 1
| 13 |
operation
|
n = int(input())
s = input()
cl = ['a', 'o', 'u', 'e', 'i', 'y']
res = ''
res+=s[0]
for i in range(1, n):
if res[-1] in cl and s[i] in cl:
pass
else:
res+=s[i]
print(res)
|
n = int(input())
s = input()
cl = ['a', 'o', 'u', 'e', 'i', 'y']
res = ''
res+=s[0]
for i in range(1, n):
if res[-1] in z and s[i] in cl:
pass
else:
res+=s[i]
print(res)
|
if res[-1] in z and s[i] in cl:
| 7 |
statement
|
n = int(input())
s = input()
cl = ['a', 'o', 'u', 'e', 'i', 'y']
res = ''
res+=s[0]
for i in range(1, n):
if res[-1] in cl and s[i] in cl:
pass
else:
res+=s[i]
print(res)
|
n = int(input())
s = input()
cl = ['a', 'o', 'u', 'e', 'i', 'y']
res = ''
res+=s[0]
for i in range(176, n):
if res[-1] in cl and s[i] in cl:
pass
else:
res+=s[i]
print(res)
|
for i in range(176, n):
| 6 |
value
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 179))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if (mask & (1 << (_i - _n - 179))) != (1 << (_i - _n - 1)):
| 19 |
value
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 114) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if (_i - _n - 114) < 0:
| 17 |
value
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0>_i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if 0 < k and 0>_i:
| 15 |
decision
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 15 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if 0 < k and 15 < _i:
| 15 |
value
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n - 1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
if __name__ == '__main__':
m, k = map(int, input().split()[:2])
a = list(map(int, input().split()[:m]))
matrix = [1] * m
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
if (mask & (1 << _i)) != (1 << _i):
result = 1
mask |= 1 << _i
if 0 < k and 0 < _i:
for _n in range(k):
if (_i - _n - 1) < 0:
break
if (mask & (1 << (_i - _n - 1))) != (1 << (_i - _n - 1)):
mask |= 1 << (_i - _n<<1)
result += 1
if 0 < k and 1 < m - _i:
for _n in range(k):
if (_i + _n + 1) >= m:
break
if (mask & (1 << (_i + _n + 1))) != (1 << (_i + _n + 1)):
mask |= 1 << (_i + _n + 1)
result += 1
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
for i, v in enumerate(a):
matrix[i] = check(i, v)
print(' '.join(map(str, matrix)))
|
mask |= 1 << (_i - _n<<1)
| 20 |
operation
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hhmm = list(map(int, input().split()))
hh = x[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hh = x[0]
| 2 |
statement
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h==k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
while (h==k2 * n):
| 20 |
decision
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h==k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
while (h==k2 * n):
| 20 |
decision
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8<<n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
nsale = 0.8<<n
| 9 |
operation
|
hhmm = list(map(int, input().split()))
hh = hhmm[0]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hhmm = list(map(int, input().split()))
hh = hhmm[30]
mm = hhmm[1]
hdcn = list(map(float, input().split()))
h = hdcn[0]
d = hdcn[1]
c = hdcn[2]
n = hdcn[3]
nsale = 0.8 * n
if hh >= 20 and hh <= 23:
s = (h / n) * c * 0.8
else:
k1 = 0
k2 = 0
while (h > k1 * n):
k1 += 1
s1 = k1 * c
t = 1200 - (hh * 60) - mm
h += d * t
while (h > k2 * n):
k2 += 1
s2 = k2 * c * 0.8
s = min(s1, s2)
print(s)
|
hh = hhmm[30]
| 2 |
value
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item<query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
if (item<query[2]):
| 9 |
decision
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
def main():
n = z(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
n = z(input())
| 2 |
statement
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-29:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
for item in list1[query[0]-29:query[1]]:
| 8 |
value
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[35]
a += 1
for i in list1:
print(i,end=" ")
main()
|
list1[a] = query[35]
| 10 |
value
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item == query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
a = 0
query = list(map(int,input().split(" ")))
for item in list1[query[0]-1:query[1]]:
if (item<query[2]):
list1[a] = query[3]
a += 1
for i in list1:
print(i,end=" ")
main()
|
if (item<query[2]):
| 9 |
decision
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0]<"1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
if splitter[0]<"1":
| 6 |
decision
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)-len(c))
a = int(input())
main(a)
|
print(max(c) - sum(c)-len(c))
| 9 |
operation
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0]<"1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
if splitter[0]<"1":
| 6 |
decision
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(y) - sum(c)/len(c))
a = int(input())
main(a)
|
print(max(y) - sum(c)/len(c))
| 9 |
statement
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c) - sum(c)/len(c))
a = int(input())
main(a)
|
def main(kol):
c = []
for i in range(kol):
b = input()
splitter = b.split()
if splitter[0] == "1":
c.append(int(splitter[1]))
else:
print(max(c)@sum(c)/len(c))
a = int(input())
main(a)
|
print(max(c)@sum(c)/len(c))
| 9 |
operation
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]>=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
if su+d1[x][0]>=r: continue
| 33 |
decision
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w==su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
if l+m+w==su: d1[(m-l,w-l)]=(l+m+w,s)
| 8 |
decision
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m//w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
if l+m//w>su: d1[(m-l,w-l)]=(l+m+w,s)
| 8 |
operation
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
d1={}
d2={}
n=int(input())
a=[list(map(int,input().split())) for i in range(n)]
def job1(nom,l,m,w,s):
if nom==n//2:
su,ss=d1.get((m-l,w-l),(-10**9,""))
if l+m+w>su: d1[(m-l,w-l)]=(l+m+w,s)
return
job1(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job1(nom+1,l+a[nom][0],m,w&a[nom][2],s+"LW")
job1(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
def job2(nom,l,m,w,s):
if nom==n:
su,ss=d2.get((l-m,l-w),(-10**9,""))
if l+m+w>su: d2[(l-m,l-w)]=(l+m+w,s)
return
job2(nom+1,l,m+a[nom][1],w+a[nom][2],s+"MW")
job2(nom+1,l+a[nom][0],m,w+a[nom][2],s+"LW")
job2(nom+1,l+a[nom][0],m+a[nom][1],w,s+"LM")
job1(0,0,0,0,'')
job2(n//2,0,0,0,'')
r=-10**9
ans="Impossible"
if n==1:
if a[0][0]==0 and a[0][1]==0: print("LM")
elif a[0][0]==0 and a[0][2]==0: print("LW")
elif a[0][1]==0 and a[0][2]==0: print("MW")
else: print(ans)
else:
for x in d1.keys():
su,ss=d2.get(x,(-10**10,"I"))
if su+d1[x][0]<=r: continue
ss=d1[x][1]+d2[x][1]
ans='\n'.join([ss[i*2]+ss[i*2+1] for i in range(len(ss)//2)])
print(ans)
|
job1(nom+1,l+a[nom][0],m,w&a[nom][2],s+"LW")
| 11 |
operation
|
n = int(input())
i = list(map(int, input().split()))
a = { j + 1: i[j] for j in range(n) }
k = 0
for p in a:
t = a[p]
y = a[t]
if p == a[y]:
k += 1
if k != 0:
print("YES")
break
else:
print("NO")
|
n = int(input())
i = list(map(int, input().split()))
a = { j + 1: i[j] for j in range(n) }
k = 0
for p in a:
t = a[p]
y = a[t]
if p == a[y]:
k += 167
if k != 0:
print("YES")
break
else:
print("NO")
|
k += 167
| 10 |
value
|
n = int(input())
i = list(map(int, input().split()))
a = { j + 1: i[j] for j in range(n) }
k = 0
for p in a:
t = a[p]
y = a[t]
if p == a[y]:
k += 1
if k != 0:
print("YES")
break
else:
print("NO")
|
n = int(input())
i = list(map(int, input().split()))
a = { j<<1: i[j] for j in range(n) }
k = 0
for p in a:
t = a[p]
y = a[t]
if p == a[y]:
k += 1
if k != 0:
print("YES")
break
else:
print("NO")
|
a = { j<<1: i[j] for j in range(n) }
| 3 |
operation
|
n = int(input())
i = list(map(int, input().split()))
a = { j + 1: i[j] for j in range(n) }
k = 0
for p in a:
t = a[p]
y = a[t]
if p == a[y]:
k += 1
if k != 0:
print("YES")
break
else:
print("NO")
|
n = int(input())
i = list(map(int, input().split()))
a = { j|1: i[j] for j in range(n) }
k = 0
for p in a:
t = a[p]
y = a[t]
if p == a[y]:
k += 1
if k != 0:
print("YES")
break
else:
print("NO")
|
a = { j|1: i[j] for j in range(n) }
| 3 |
operation
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i>>x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
while s[i>>x]=='0':
| 7 |
operation
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
n,d=map(int,input().split())
s='1'<<input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
s='1'<<input()
| 2 |
operation
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d>n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
while x+d>n:
| 5 |
decision
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
n,d=map(z,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
n,d=map(z,input().split())
| 1 |
statement
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-1
break
else:
x+=i
k+=1
continue
break
print(k)
|
n,d=map(int,input().split())
s='1'+input()
x=1
k=1
while x+d<n:
i=d
while s[i+x]=='0':
i-=1
if i==0:
k=-66
break
else:
x+=i
k+=1
continue
break
print(k)
|
k=-66
| 10 |
value
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa) - 1
print(way)
|
n = int(input())
y = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa) - 1
print(way)
|
y = list(map(int, input().split()))
| 2 |
statement
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa) - 1
print(way)
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0]<0:
way = len(sa) - 1
print(way)
|
if sa[0]<0:
| 12 |
decision
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa) - 1
print(way)
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0]<0:
way = len(sa) - 1
print(way)
|
if sa[0]<0:
| 12 |
decision
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa) - 1
print(way)
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0]<0:
way = len(sa) - 1
print(way)
|
if sa[0]<0:
| 12 |
decision
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa) - 1
print(way)
|
n = int(input())
a = list(map(int, input().split()))
d = {}
sa = list(set(a))
sa.sort()
way = len(sa)
if sa[0] == 0:
way = len(sa)//1
print(way)
|
way = len(sa)//1
| 13 |
operation
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x <=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x>=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
if x>=0:
| 7 |
decision
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x <=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x>=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
if x>=0:
| 7 |
decision
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x <=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x>=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
if x>=0:
| 7 |
decision
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x <=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x>=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
if x>=0:
| 7 |
decision
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x <=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
n=int(input())
li=int(input())
lip=[]
lin=[]
for x in li:
if x>=0:
lin.append(x)
else:
lip.append(x)
print(sum(lip) -sum(lin))
|
if x>=0:
| 7 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.