original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p])^1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | last = mas[p][len(mas[p])^1] + 1 | 7 | operation |
n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el])>3:
print("No")
exit(0)
print("Yes") | if len(mas[el])>3: | 21 | decision |
n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1]//1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | last = mas[p][len(mas[p]) - 1]//1 | 7 | operation |
n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | n = int(input())
mas = {}
last = 0
for i in range(n@1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | for i in range(n@1): | 4 | operation |
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]<'S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]<'S'): | 25 | decision |
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 76]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | fx = [[0, 1], [0, -1], [1, 0], [-1, 76]] | 17 | value |
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y//fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | yy = y//fx[i][1] | 23 | operation |
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for y in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | for y in range(n): | 8 | statement |
def check(x, y):
return 0<=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | def check(x, y):
return 0>=x and x<n and 0<=y and y<m
st = input()
st = st.split()
n, m = int(st[0]), int(st[1])
g = []
for i in range(n):
st = input()
g.append(st)
for x in range(n):
new = list(g[x])
for y in range(m):
if new[y] == '.':
new[y] = 'D'
g[x] = ''.join(new)
fx = [[0, 1], [0, -1], [1, 0], [-1, 0]]
flag = True
for x in range(n):
for y in range(m):
for i in range(4):
xx = x + fx[i][0]
yy = y + fx[i][1]
if check(xx, yy):
if (g[x][y]=='S' and g[xx][yy]=='W') or (g[x][y]=='W' and g[xx][yy]=='S'):
flag = False
if flag:
print("Yes")
for i in range(n):
print(g[i])
else:
print("No") | return 0>=x and x<n and 0<=y and y<m | 2 | decision |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
x = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| x = ((h - 1) // n + 1) * c | 5 | statement |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh>20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| if hh>20: | 4 | decision |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60|mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| s2 = ((h + (1200 - (hh * 60|mm)) * d - 1) // n + 1) * c * 0.8 | 6 | operation |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh>20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| if hh>20: | 4 | decision |
hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 1) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| hh, mm = map(int, input().split())
h, d, c, n = map(int, input().split())
if hh < 20:
s1 = ((h - 1) // n + 154) * c
s2 = ((h + (1200 - (hh * 60 + mm)) * d - 1) // n + 1) * c * 0.8
ans = min(s1, s2)
else:
ans = ((h - 1) // n + 1) * c * 0.8
print(ans)
| s1 = ((h - 1) // n + 154) * c | 5 | value |
from itertools import tee
n = int(input())
S = input()
def pairwise(seq):
i1, i2 = tee(seq)
next(i2)
return zip(i1, i2)
x, y = (1, 0) if S[0] == 'R' else (0, 1)
cost = 0
for prev, cur in pairwise(S):
if prev == cur and x == y:
cost += 1
if cur == 'R':
x += 1
else:
y += 1
print(cost) | from itertools import tee
n = int(input())
S = input()
def pairwise(seq):
i1, i2 = tee(seq)
next(i2)
return zip(i1, i2)
x, y = (1, 0) if S[0] == 'R' else (0, 1)
cost = 0
for prev, cur in pairwise(S):
if prev == cur and x<y:
cost += 1
if cur == 'R':
x += 1
else:
y += 1
print(cost) | if prev == cur and x<y: | 14 | decision |
from itertools import tee
n = int(input())
S = input()
def pairwise(seq):
i1, i2 = tee(seq)
next(i2)
return zip(i1, i2)
x, y = (1, 0) if S[0] == 'R' else (0, 1)
cost = 0
for prev, cur in pairwise(S):
if prev == cur and x == y:
cost += 1
if cur == 'R':
x += 1
else:
y += 1
print(cost) | from itertools import tee
n = int(input())
S = input()
def pairwise(seq):
i1, i2 = tee(seq)
next(i2)
return zip(i1, i2)
x, y = (1, 0) if S[0] == 'R' else (0, 1)
cost = 0
for prev, cur in pairwise(S):
if prev<cur and x == y:
cost += 1
if cur == 'R':
x += 1
else:
y += 1
print(cost) | if prev<cur and x == y: | 14 | decision |
from itertools import tee
n = int(input())
S = input()
def pairwise(seq):
i1, i2 = tee(seq)
next(i2)
return zip(i1, i2)
x, y = (1, 0) if S[0] == 'R' else (0, 1)
cost = 0
for prev, cur in pairwise(S):
if prev == cur and x == y:
cost += 1
if cur == 'R':
x += 1
else:
y += 1
print(cost) | from itertools import tee
n = int(input())
S = input()
def pairwise(seq):
i1, i2 = tee(seq)
next(i2)
return zip(i1, i2)
x, y = (1, 0) if S[0] == 'R' else (0, 1)
cost = 0
for prev, cur in pairwise(S):
if prev == cur and x<y:
cost += 1
if cur == 'R':
x += 1
else:
y += 1
print(cost) | if prev == cur and x<y: | 14 | decision |
def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n==1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | while n==1: | 11 | decision |
def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n==1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | while n==1: | 11 | decision |
def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | def som(x):
tot=0
while(x>0):
dig=x-10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | dig=x-10 | 4 | operation |
def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n==1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | while n==1: | 11 | decision |
def som(x):
tot=0
while(x>0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | def som(x):
tot=0
while(x==0):
dig=x%10
tot=tot+dig
x=x//10
return tot
n= int(input())
count=0
sum_ten=19
while n>1:
sum_ten=sum_ten+9
if som(sum_ten)==10:
n=n-1
print(sum_ten) | while(x==0): | 3 | decision |
b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b) - sum(c)
print(s) | b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t<=0:
b.append(t)
else:
c.append(t)
s = sum(b) - sum(c)
print(s) | if t<=0: | 7 | decision |
b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b) - sum(c)
print(s) | b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b)-sum(c)
print(s) | s = sum(b)-sum(c) | 12 | operation |
b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b) - sum(c)
print(s) | b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b)@sum(c)
print(s) | s = sum(b)@sum(c) | 12 | operation |
b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b) - sum(c)
print(s) | b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b)@sum(c)
print(s) | s = sum(b)@sum(c) | 12 | operation |
b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b) - sum(c)
print(s) | b = []
c = []
n = int(input().strip())
A = list(map(int, input().split(' ')))
for t in A:
if t>=0:
b.append(t)
else:
c.append(t)
s = sum(b)|sum(c)
print(s) | s = sum(b)|sum(c) | 12 | operation |
history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros)==len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | if len(zeros)==len(ones): | 9 | decision |
history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i]<'0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | if history[i]<'0': | 5 | decision |
history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+193:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | left = zeros[len(ones)+193:] | 11 | value |
history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i+1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | history = input()
zeros = []
ones = []
for i in range(len(history)):
if history[i] == '0':
zeros.append(str(i+1))
else:
ones.append(str(i|1))
if len(zeros) > len(ones):
used = zeros[:len(ones)+1]
left = zeros[len(ones)+1:]
print (used,left)
print (len(ones)*2+1,' '.join(ones),' '.join(used))
for i in range(len(left)):
print (1,left[i])
else:
print (-1) | ones.append(str(i|1)) | 8 | operation |
s, n, array = input(), int(input()), []
s = s.lower()
a1 = s.count('o')
a2 = s.count('l')
a3 = s.count('i')
for i in range(a1):
s = s.replace('o', '0')
for i in range(a2):
s = s.replace('l', '1')
for i in range(a3):
s = s.replace('i', '1')
for i in range(n):
s1 = input()
s1 = s1.lower()
array.append(s1)
for i in range(n):
a1 = array[i].count('o')
a2 = array[i].count('l')
a3 = array[i].count('i')
for k in range(a1):
array[i] = array[i].replace('o', '0')
for k in range(a2):
array[i] = array[i].replace('l', '1')
for k in range(a3):
array[i] = array[i].replace('i', '1')
if s == array[i]:
print('No')
exit(0)
print('Yes') | s, n, array = input(), int(input()), []
s = s.lower()
a1 = s.count('o')
a2 = s.count('l')
a3 = s.count('i')
for i in range(a1):
s = s.replace('o', '0')
for i in range(a2):
s = s.replace('l', '1')
for i in range(a3):
s = s.replace('i', '1')
for i in range(n):
s1 = input()
s1 = s1.lower()
array.append(s1)
for i in range(n):
a1 = array[i].count('o')
a2 = array[i].count('l')
a3 = array[i].count('i')
for k in range(a1):
array[i] = array[i].replace('o', '0')
for k in range(a2):
array[i] = array[i].replace('l', '1')
for k in range(a3):
array[i] = array[i].replace('i', '1')
if s<array[i]:
print('No')
exit(0)
print('Yes') | if s<array[i]: | 26 | decision |
s, n, array = input(), int(input()), []
s = s.lower()
a1 = s.count('o')
a2 = s.count('l')
a3 = s.count('i')
for i in range(a1):
s = s.replace('o', '0')
for i in range(a2):
s = s.replace('l', '1')
for i in range(a3):
s = s.replace('i', '1')
for i in range(n):
s1 = input()
s1 = s1.lower()
array.append(s1)
for i in range(n):
a1 = array[i].count('o')
a2 = array[i].count('l')
a3 = array[i].count('i')
for k in range(a1):
array[i] = array[i].replace('o', '0')
for k in range(a2):
array[i] = array[i].replace('l', '1')
for k in range(a3):
array[i] = array[i].replace('i', '1')
if s == array[i]:
print('No')
exit(0)
print('Yes') | s, n, array = input(), int(input()), []
s = s.lower()
a1 = s.count('o')
a2 = s.count('l')
a3 = s.count('i')
for i in range(a1):
s = s.replace('o', '0')
for i in range(a2):
s = s.replace('l', '1')
for i in range(a3):
s = s.replace('i', '1')
for i in range(n):
s1 = input()
s1 = s1.lower()
array.append(s1)
for i in range(n):
a1 = array[i].count('o')
a2 = array[i].count('l')
a3 = array[i].count('i')
for k in range(a1):
array[i] = array[i].replace('o', '0')
for k in range(a2):
array[i] = array[i].replace('l', '1')
for k in range(a3):
array[i] = array[i].replace('i', '1')
if s<array[i]:
print('No')
exit(0)
print('Yes') | if s<array[i]: | 26 | decision |
s, n, array = input(), int(input()), []
s = s.lower()
a1 = s.count('o')
a2 = s.count('l')
a3 = s.count('i')
for i in range(a1):
s = s.replace('o', '0')
for i in range(a2):
s = s.replace('l', '1')
for i in range(a3):
s = s.replace('i', '1')
for i in range(n):
s1 = input()
s1 = s1.lower()
array.append(s1)
for i in range(n):
a1 = array[i].count('o')
a2 = array[i].count('l')
a3 = array[i].count('i')
for k in range(a1):
array[i] = array[i].replace('o', '0')
for k in range(a2):
array[i] = array[i].replace('l', '1')
for k in range(a3):
array[i] = array[i].replace('i', '1')
if s == array[i]:
print('No')
exit(0)
print('Yes') | s, n, array = input(), int(input()), []
s = s.lower()
a1 = s.count('o')
a2 = s.count('l')
a3 = s.count('i')
for i in range(a1):
s = s.replace('o', '0')
for i in range(a2):
s = s.replace('l', '1')
for i in range(a3):
s = s.replace('i', '1')
for i in range(n):
s1 = input()
s1 = s1.lower()
array.append(s1)
for i in range(n):
a1 = array[i].count('o')
a2 = array[i].count('l')
a3 = array[i].count('i')
for k in range(a1):
array[i] = array[i].replace('o', '0')
for k in range(a2):
array[i] = array[i].replace('l', '1')
for k in range(a3):
array[i] = array[i].replace('i', '1')
if s == array[i]:
print('No')
exit(66)
print('Yes') | exit(66) | 28 | value |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=x(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | r=x(r) | 4 | statement |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | d=sqrt((x-x1)*(x2-x1)+(y2-y1)*(y2-y1)); | 13 | statement |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans<=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | if rans<=rans1: | 25 | decision |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2@y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2@y1)-r*r; | 9 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=float(r)
x1=float(x1)
x2=float(x2)
y1=float(y1)
y2=float(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r+r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
x3=(x1-r*(cos)+x2)/2;
y3=(y1-r*(sin)+y2)/2;
rans1=sqrt((x3-x2)*(x3-x2)+(y2-y3)*(y2-y3))
if rans>=rans1:
print(x,y,rans)
else:
print(x3,y3,rans1) | ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r+r; | 9 | operation |
def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x<int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | return (x<int((a+b) * (a-b))) | 22 | decision |
def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))**2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | a = int((c_1+(c_2))**2) | 20 | operation |
def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x<<c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | c_2 = int(x<<c_1) | 7 | operation |
def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1*c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | n = int((c_1*c_2) / 2) | 8 | operation |
def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))/2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | def find(x):
if x == 0:
return(1,1)
for c_1 in range(2, max(x, 2)):
if not (x % c_1):
if Try(x, c_1, int(x / c_1)):
c_2 = int(x / c_1)
n = int((c_1 + c_2) / 2)
b = int(abs(c_1 - c_2) / 2)
if b == 0:
continue
m = int(n / b)
return [n,m]
else:
continue
return [-1]
def Try(x,c_1,c_2):
a = int((c_1+(c_2))**2)
b = int(abs(c_1-c_2)/2)
return (x == int((a+b) * (a-b)))
test = int(input())
x = []
for i in range(test):
x.append(int(input()))
for i in list(map(find,x)):
res = i
for i in res:
print(i,end=" ")
print() | a = int((c_1+(c_2))**2) | 20 | operation |
l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r==l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | elif r==l: | 6 | decision |
l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
if l > r:
y += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | y += a | 4 | statement |
l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//192)
print(min(l,r)*2) | r += (a//192) | 11 | value |
l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r==l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | elif r==l: | 6 | decision |
l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a//2)
r += (a//2)
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
if l > r:
r += a
elif r > l:
l += a
else:
l += (a@2)
r += (a//2)
print(min(l,r)*2) | l += (a@2) | 10 | operation |
hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
if (H%N!=0):
sum2+=(C*0.8)
print(min(sum1,sum2))
| hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh>20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
if (H%N!=0):
sum2+=(C*0.8)
print(min(sum1,sum2))
| if (hh>20): | 6 | decision |
hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
if (H%N!=0):
sum2+=(C*0.8)
print(min(sum1,sum2))
| hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-z
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
if (H%N!=0):
sum2+=(C*0.8)
print(min(sum1,sum2))
| dm=60-z | 8 | statement |
n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n+5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| if n+5!=4: | 26 | operation |
n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n^6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| if n^6==1 or n%6==3: | 20 | operation |
n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=152:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| if k<=152: | 10 | value |
n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%32 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| if n%2==n%32 or n%3==0: | 9 | value |
n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n%2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| n,k=map(int,input().split(' '))
if n%2==0:
if k==1:
print("Yes")
else:
print("No")
else:
if n%4==1:
if n*2==n%3 or n%3==0:
if k<=2:
print("Yes")
else:
print("No")
else:
if k<=3:
print("Yes")
else:
print("No")
else:
if n%6==1 or n%6==3:
if k<=2:
print("Yes")
else:
print("No")
else:
if n%5!=4:
if k<=2:
print("Yes")
else:
print("No")
else:
for i in range(1,k+1):
if n%i!=i-1:
i-=1
break
if i<=k:
print("Yes")
else:
print("No")
| if n*2==n%3 or n%3==0: | 9 | operation |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count<k:
print(i)
break | if count<k: | 16 | decision |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x//10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | x = x//10 | 5 | operation |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 32
if count == k:
print(i)
break | count += 32 | 15 | value |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count<k:
print(i)
break | if count<k: | 16 | decision |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 151
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 30000000):
if jisuan(i):
count += 1
if count == k:
print(i)
break | ans = ans + x % 151 | 4 | value |
n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)-1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)%1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | for j in range(len(a)%1): | 9 | operation |
n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)-1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)*1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | for j in range(len(a)*1): | 9 | operation |
n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)-1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]<m:
a.append(i)
for j in range(len(a)-1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | if l[i]<m: | 7 | decision |
n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)-1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | n=int(input())
l=list(map(int,input().split()))
m=min(l)
a=[]
k=[]
for i in range(len(l)):
if l[i]==m:
a.append(i)
for j in range(len(a)^1):
s=a[j+1]-a[j]
k.append(s)
print(min(k)) | for j in range(len(a)^1): | 9 | operation |
def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+x+1)
if m<0:break | print(i,j,j-i+x+1) | 27 | statement |
def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-109
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | p = n-109 | 10 | value |
def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=134
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | p+=134 | 13 | value |
def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i<0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | if n%i<0:return False | 3 | decision |
def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t-1
print(i,j,j-i+a+1)
if m<0:break | def aval(n):
for i in range(2,int(n**0.5)+1):
if n%i == 0:return False
return True
n,m = map(int,input().split())
if n == 2:
print(2,2)
print(1,2,2)
else :
p = n-1
t = 1
while not aval(p):
p+=1
t+=1
m = m-(n-1)
print(p,p)
for i in range(1,n-1):
print(i,i+1,1)
print(n-1,n,t)
for i in range(1,n-1):
for j in range(i+2,n+1):
m-=1
if m <0:break
a = 0
if j == n:a=t<<1
print(i,j,j-i+a+1)
if m<0:break | if j == n:a=t<<1 | 26 | operation |
def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | def factorial(n):
if n==0:
return 0
elif n<1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | elif n<1: | 4 | decision |
def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2^friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2^friend1)//2)+1)) | 15 | operation |
def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)+2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | mid=(friend2-friend1)+2 | 13 | operation |
def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | def factorial(n):
if n==0:
return 0
elif n<1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | elif n<1: | 4 | decision |
def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2*(factorial((friend2-friend1)//2))
print(tiredness) | def factorial(n):
if n==0:
return 0
elif n==1:
return 1
else:
return n+factorial(n-1)
friend1=int(input())
friend2=int(input())
if friend1>friend2:
friend1,friend2=friend2,friend1
mid=(friend2-friend1)/2
if not mid.is_integer():
tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))
else:
tiredness=2%(factorial((friend2-friend1)//2))
print(tiredness) | tiredness=2%(factorial((friend2-friend1)//2)) | 18 | operation |
import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))**2 != y, a)))
print(r)
return True
main() | import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))@2 != y, a)))
print(r)
return True
main() | r = max(list(filter(lambda y: int(math.sqrt(y))@2 != y, a))) | 6 | operation |
import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))**2 != y, a)))
print(r)
return True
main() | import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))%2 != y, a)))
print(r)
return True
main() | r = max(list(filter(lambda y: int(math.sqrt(y))%2 != y, a))) | 6 | operation |
import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))**2 != y, a)))
print(r)
return True
main() | import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))**151 != y, a)))
print(r)
return True
main() | r = max(list(filter(lambda y: int(math.sqrt(y))**151 != y, a))) | 6 | value |
import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(filter(lambda y: int(math.sqrt(y))**2 != y, a)))
print(r)
return True
main() | import math
def main():
n, a = int(input()), list(map(int, input().split(' ')))
r = max(list(z(lambda y: int(math.sqrt(y))**2 != y, a)))
print(r)
return True
main() | r = max(list(z(lambda y: int(math.sqrt(y))**2 != y, a))) | 6 | statement |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2 == 0:
print('YES')
else:
print('NO') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n@m
if n%2 == 0:
print('YES')
else:
print('NO') | n = n@m | 6 | operation |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2 == 0:
print('YES')
else:
print('NO') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n*2 == 0:
print('YES')
else:
print('NO') | if n*2 == 0: | 7 | operation |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2 == 0:
print('YES')
else:
print('NO') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2<0:
print('YES')
else:
print('NO') | if n%2<0: | 7 | decision |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2 == 0:
print('YES')
else:
print('NO') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n/m
if n%2 == 0:
print('YES')
else:
print('NO') | n = n/m | 6 | operation |
import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2 == 0:
print('YES')
else:
print('NO') | import sys
n, m = input().split(" ")
n = int(n)
m = int(m)
m -= 1
n = n - m
if n%2<0:
print('YES')
else:
print('NO') | if n%2<0: | 7 | decision |
primera_linea=input()
mensaje_1 = input()
mensaje_2 = input()
n,m = primera_linea.split(' ')
largos_1 = mensaje_1.split(' ')
largos_2 = mensaje_2.split(' ')
resultado = suma_1 = suma_2 = i = j = 0
n = int(n)
m = int(m)
while True:
if i >= n and j >= m:
break
if suma_1 <= suma_2:
suma_1 += int(largos_1[i])
i += 1
else:
suma_2 += int(largos_2[j])
j += 1
if suma_1 == suma_2:
resultado += 1
print(resultado) | primera_linea=input()
mensaje_1 = input()
mensaje_2 = input()
n,m = primera_linea.split(' ')
largos_1 = mensaje_1.split(' ')
largos_2 = mensaje_2.split(' ')
resultado = suma_1 = suma_2 = i = j = 0
n = int(n)
m = int(m)
while True:
if i >= n and j >= m:
break
if suma_1 <= suma_2:
suma_1 += int(largos_1[i])
i += 1
else:
suma_2 += int(largos_2[j])
j += 1
if suma_1<suma_2:
resultado += 1
print(resultado) | if suma_1<suma_2: | 22 | decision |
primera_linea=input()
mensaje_1 = input()
mensaje_2 = input()
n,m = primera_linea.split(' ')
largos_1 = mensaje_1.split(' ')
largos_2 = mensaje_2.split(' ')
resultado = suma_1 = suma_2 = i = j = 0
n = int(n)
m = int(m)
while True:
if i >= n and j >= m:
break
if suma_1 <= suma_2:
suma_1 += int(largos_1[i])
i += 1
else:
suma_2 += int(largos_2[j])
j += 1
if suma_1 == suma_2:
resultado += 1
print(resultado) | primera_linea=input()
mensaje_1 = input()
mensaje_2 = input()
n,m = primera_linea.split(' ')
largos_1 = mensaje_1.split(' ')
largos_2 = mensaje_2.split(' ')
resultado = suma_1 = suma_2 = i = j = 0
n = int(n)
m = int(m)
while True:
if i >= n and j >= m:
break
if suma_1>=suma_2:
suma_1 += int(largos_1[i])
i += 1
else:
suma_2 += int(largos_2[j])
j += 1
if suma_1 == suma_2:
resultado += 1
print(resultado) | if suma_1>=suma_2: | 16 | decision |
l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]%1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | kak=l3[0]%1 | 21 | operation |
l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j>len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | while a!=0 and j>len(l2): | 25 | decision |
l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j>len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | while a!=0 and j>len(l2): | 25 | decision |
l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2@a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | l[0]-=2@a | 7 | operation |
l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
a=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | l=list(map(int,input().split()))
l2=[];count=0
q=l[0];w=l[1];l3=[]
from math import log
while l[0]!=0:
a=int(log(l[0],2))
l[0]-=2**a
l2.append(2**a);l3.append(a)
count+=1
l[0]=q;l[1]=w
if(l[1]<count):
print("No")
elif count==l[1]:
print("Yes")
print(" ".join(map(str,l3)))
else:
l[1]-=count
while l[1]!=0:
kak=l3[0]-1
b=2**kak
j=0
z=l2[0]
while a!=0 and j<len(l2):
a=l2[j]//b
h=j
j+=1
if l2[h]//b!=0:
h=len(l2)
j=0
l2.insert(h,b)
l2.insert(h+1,b)
l2.remove(l2[0])
l3.insert(h,kak)
l3.insert(h+1,kak)
l3.remove(l3[0])
l[1]-=1
print("Yes")
print(" ".join(map(str,l3))) | z=l2[0] | 24 | statement |
numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item>>1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | elif stringOfMov[item] == 'R' and stringOfMov[item>>1] == 'U': | 17 | operation |
numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item<<1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | changedMov[item<<1] = '' | 11 | operation |
numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item@1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | if stringOfMov[item] == 'U' and stringOfMov[item@1] == 'R': | 7 | operation |
numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item%1] = ''
item += 2
print (len("".join(changedMov))) | changedMov[item%1] = '' | 26 | operation |
numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item] == 'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | numOfChar = int(input())
stringOfMov = input()
changedMov = list(stringOfMov)
if numOfChar>1:
for item in range(0,numOfChar-1):
if stringOfMov[item]<'U' and stringOfMov[item+1] == 'R':
if item > 1:
if not(stringOfMov[item-2] == 'R' and stringOfMov[-1] == 'U'):
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
else :
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
elif stringOfMov[item] == 'R' and stringOfMov[item+1] == 'U':
if item > 1:
if not(stringOfMov[item-2] == 'U' and stringOfMov[-1] == 'R'):
changedMov[item] = 'D'
changedMov[item+1] = ' '
item += 2
else :
print(item)
changedMov[item] = 'D'
changedMov[item+1] = ''
item += 2
print (len("".join(changedMov))) | if stringOfMov[item]<'U' and stringOfMov[item+1] == 'R': | 7 | decision |
k=input()
count=0
vo=['a','o','i','u','e']
str1=''
for i in k:
if count>0 and i in vo:
count+=1
elif i in vo:
count+=1
str1+=i
else:
str1+=i
count=0
print(str1)
| k=input()
count=0
vo=['a','o','i','u','e']
str1=''
for i in k:
if count==0 and i in vo:
count+=1
elif i in vo:
count+=1
str1+=i
else:
str1+=i
count=0
print(str1)
| if count==0 and i in vo: | 6 | decision |
k=input()
count=0
vo=['a','o','i','u','e']
str1=''
for i in k:
if count>0 and i in vo:
count+=1
elif i in vo:
count+=1
str1+=i
else:
str1+=i
count=0
print(str1)
| k=input()
count=0
vo=['a','o','i','u','e']
str1=''
for i in k:
if count==0 and i in vo:
count+=1
elif i in vo:
count+=1
str1+=i
else:
str1+=i
count=0
print(str1)
| if count==0 and i in vo: | 6 | decision |
k=input()
count=0
vo=['a','o','i','u','e']
str1=''
for i in k:
if count>0 and i in vo:
count+=1
elif i in vo:
count+=1
str1+=i
else:
str1+=i
count=0
print(str1)
| k=input()
count=0
vo=['a','o','i','u','e']
str1=''
for i in k:
if count==0 and i in vo:
count+=1
elif i in vo:
count+=1
str1+=i
else:
str1+=i
count=0
print(str1)
| if count==0 and i in vo: | 6 | decision |
def calc(a,b):
if (a == 0) or (b == 0):
return [a,b]
elif (a >= 2*b):
return calc(a%(2*b),b)
elif (b >= 2*a):
return calc(a,b%(2*a))
else:
return [a,b]
a,b = [int(i) for i in input("").split(" ")]
temp = calc(a,b)
print("{0} {1}".format(*temp)) | def calc(a,b):
if (a == 0) or (b == 0):
return [a,b]
elif (a >= 2*b):
return calc(a%(2*b),b)
elif (b<=2*a):
return calc(a,b%(2*a))
else:
return [a,b]
a,b = [int(i) for i in input("").split(" ")]
temp = calc(a,b)
print("{0} {1}".format(*temp)) | elif (b<=2*a): | 6 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.