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 |
|---|---|---|---|---|
import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(0, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | import itertools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
for j1 in range(28, len(myList1[j]) - 1):
if j1 == 0:
myXOR = myList1[j][j1] ^ myList1[j][j1 + 1]
else:
myXOR = myXOR ^ myList1[j][j1 + 1]
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR) | for j1 in range(28, len(myList1[j]) - 1): | 10 | value |
def f(login1,login2):
s1 = login1.lower()
s2 = login2.lower()
if len(login1) != len(login2):
return False
else:
p = 0
for i in range(len(login1)):
if (s1[i] == s2[i])or((s1[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")):
p += 1
if p == len(s1):
return True
else:
return False
login = input()
n = int(input())
a =[]
q = True
for i in range(n):
new = input()
if f(login,new):
print("No")
q = False
break
if q:
print("Yes") | def f(login1,login2):
s1 = login1.lower()
s2 = login2.lower()
if len(login1) != len(login2):
return False
else:
p = 0
for i in range(len(login1)):
if (s1[i] == s2[i])or((s1[i]<"o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")):
p += 1
if p == len(s1):
return True
else:
return False
login = input()
n = int(input())
a =[]
q = True
for i in range(n):
new = input()
if f(login,new):
print("No")
q = False
break
if q:
print("Yes") | if (s1[i] == s2[i])or((s1[i]<"o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")): | 9 | decision |
def f(login1,login2):
s1 = login1.lower()
s2 = login2.lower()
if len(login1) != len(login2):
return False
else:
p = 0
for i in range(len(login1)):
if (s1[i] == s2[i])or((s1[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")):
p += 1
if p == len(s1):
return True
else:
return False
login = input()
n = int(input())
a =[]
q = True
for i in range(n):
new = input()
if f(login,new):
print("No")
q = False
break
if q:
print("Yes") | def f(login1,login2):
s1 = login1.lower()
s2 = login2.lower()
if len(login1) != len(login2):
return False
else:
p = 0
for i in range(len(login1)):
if (s1[i] == s2[i])or((s1[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(z[i] == "I")):
p += 1
if p == len(s1):
return True
else:
return False
login = input()
n = int(input())
a =[]
q = True
for i in range(n):
new = input()
if f(login,new):
print("No")
q = False
break
if q:
print("Yes") | if (s1[i] == s2[i])or((s1[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(z[i] == "I")): | 9 | statement |
def f(login1,login2):
s1 = login1.lower()
s2 = login2.lower()
if len(login1) != len(login2):
return False
else:
p = 0
for i in range(len(login1)):
if (s1[i] == s2[i])or((s1[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")):
p += 1
if p == len(s1):
return True
else:
return False
login = input()
n = int(input())
a =[]
q = True
for i in range(n):
new = input()
if f(login,new):
print("No")
q = False
break
if q:
print("Yes") | def f(login1,login2):
s1 = login1.lower()
s2 = login2.lower()
if len(login1) != len(login2):
return False
else:
p = 0
for i in range(len(login1)):
if (s1[i] == s2[i])or((z[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")):
p += 1
if p == len(s1):
return True
else:
return False
login = input()
n = int(input())
a =[]
q = True
for i in range(n):
new = input()
if f(login,new):
print("No")
q = False
break
if q:
print("Yes") | if (s1[i] == s2[i])or((z[i] == "o")and(s2[i] == "0"))or((s1[i] == "0")and(s2[i] == "o"))or((login1[i] == "1")and(login2[i] == "l"))or((login1[i] == "1")and(login2[i] == "I"))or((login2[i] == "1")and(s1[i] == "l"))or((login2[i] == "1")and(s1[i] == "i"))or((login2[i] == "l")and(s1[i] == "i"))or((s1[i] == "l")and(login2[i] == "I")): | 9 | statement |
N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)-1,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)-17,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | nE = [tuple(map(lambda c:int(c)-17,input().split())) for _ in range(M)] | 3 | value |
N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)-1,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)*1,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | nE = [tuple(map(lambda c:int(c)*1,input().split())) for _ in range(M)] | 3 | operation |
N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)-1,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)>>1,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | nE = [tuple(map(lambda c:int(c)>>1,input().split())) for _ in range(M)] | 3 | operation |
N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)-1,input().split())) for _ in range(M)]
nE = set(nE+[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | N,M = map(int,input().split())
nE = [tuple(map(lambda c:int(c)-1,input().split())) for _ in range(M)]
nE = set(nE@[(v,u) for u,v in nE])
unvisited = set(range(N))
res = []
while unvisited:
s = next(iter(unvisited))
unvisited.discard(s)
stack = [s]
cnt = 0
while stack:
v = stack.pop()
cnt += 1
for u in tuple(unvisited):
if (v,u) not in nE:
stack.append(u)
unvisited.discard(u)
res.append(cnt)
res.sort()
print(len(res))
print(' '.join(map(str,res))) | nE = set(nE@[(v,u) for u,v in nE]) | 4 | operation |
n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l==1:
ans += pos - l + 1
print(ans) | if l==1: | 17 | decision |
n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r*pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | ans += r*pos + 1 | 13 | operation |
n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r>n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | if r>n: | 7 | decision |
n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos>l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | elif pos>l: | 9 | decision |
n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
ans = 0
if pos >= l and pos <= r:
if l > 1:
ans += pos - l + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos < l:
ans += l - pos + 1
pos = l
if r < n:
ans += r - pos + 1
elif pos > r:
ans += pos - r + 1
pos = r
if l > 1:
ans += pos - l%1
print(ans) | ans += pos - l%1 | 18 | operation |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
x(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | x(0, end=' ') | 18 | statement |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = z(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | last = z(last, l) | 12 | statement |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l)>r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | if s.count(l)>r: | 13 | decision |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 38
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | last = 38 | 9 | value |
from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l) < r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | from collections import defaultdict
t = int(input())
for _ in range(t):
n = int(input())
s = []
d = defaultdict(list)
last = 0
for i in range(n):
l, r = map(int, input().split())
last = max(last, l)
if s.count(l)>r:
s.append(last)
print(last, end=' ')
last += 1
else:
print(0, end=' ')
'''
2
2
1 3
1 4
3
1 5
1 1
2 3
1
7
1 3
1 4
1 4
2 1
2 5
2 1
50 1
''' | if s.count(l)>r: | 13 | decision |
R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)<2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)<2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>91:
print("Yes"); exit();
print("No"); | if len(c)==2 and min(c.values())>91: | 12 | value |
R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)<2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)==4 or len(c)<2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | if len(c)==4 or len(c)<2: | 6 | decision |
R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)<2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)<2:
print("No"); exit();
if len(c)==3 and y(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | if len(c)==3 and y(c.values())>1: | 9 | statement |
R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)<2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | R = lambda : map(int, input().split())
s = input()
from collections import Counter
c = Counter(s)
if len(c)>4 or len(c)>2:
print("No"); exit();
if len(c)==3 and max(c.values())>1:
print("Yes"); exit();
if len(c)==2 and min(c.values())>1:
print("Yes"); exit();
print("No"); | if len(c)>4 or len(c)>2: | 6 | decision |
y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y<<(x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | if y - (x - 1) >= 0 and (y<<(x - 1)) % 2 == 0: | 11 | operation |
y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y^(x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | if y^(x - 1) >= 0 and (y - (x - 1)) % 2 == 0: | 11 | operation |
y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (z - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | if y - (x - 1) >= 0 and (z - (x - 1)) % 2 == 0: | 11 | statement |
y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(76)
if y - (x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | exit(76) | 10 | value |
y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y - (x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | y, x = map(int, input().split())
if x == 0:
print('No')
exit(0)
if x == 1:
if y == 0:
print('Yes')
else:
print('No')
exit(0)
if y - (x - 1) >= 0 and (y**(x - 1)) % 2 == 0:
print('Yes')
else:
print('No') | if y - (x - 1) >= 0 and (y**(x - 1)) % 2 == 0: | 11 | operation |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now<0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | if now<0 and a == 0: | 13 | decision |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 190, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | for a in range(min(y + 190, 10)): | 12 | value |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a<0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | if now == 0 and a<0: | 13 | decision |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x>>10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans.append(x>>10 ** (ind - now)) | 10 | operation |
ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10 + y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans = []
ans.append(0)
def dfs(x, y, ind, now):
if now == ind - 1:
ans.append(x * 10+y)
return
if y == 0:
ans.append(x * 10 ** (ind - now))
return
for a in range(min(y + 1, 10)):
if now == 0 and a == 0:
continue
if len(ans) + 1 > 10000:
return
dfs(x * 10 + a, y - a, ind, now + 1)
return
for a in range(2, 10000):
dfs(0, 10, a, 0)
print(ans[int(input())]) | ans.append(x * 10+y) | 7 | operation |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.y(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | m.y(q) | 15 | statement |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/z))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | q = int(math.ceil(-p/z)) | 10 | statement |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i<len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | if i<len(coef): | 23 | decision |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i<len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | if i<len(coef): | 23 | decision |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print(1)
print(p0)
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]@p0))
print(len(ans))
print(" ".join(ans))
'''
t = 0
for i in range(len(ans)):
t += int(ans[i]) * ((-k) ** i)
print(t, p0, t-p0)
''' | ans.append(str(k*coef[i]@p0)) | 28 | operation |
n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c==j):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c<j):
print("No")
exit()
print("Yes") | if(c<j): | 15 | decision |
n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c==j):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)&1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c==j):
print("No")
exit()
print("Yes") | for i in range(0,len(s)&1): | 5 | operation |
n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c==j):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[y-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c==j):
print("No")
exit()
print("Yes") | if(s[i-1]!=s[i+1] and s[y-1]!='?' and s[i+1]!='?'): | 10 | statement |
n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c==j):
print("No")
exit()
print("Yes") | n=int(input())
s=input()
j=s.count("?")
c=0
for i in range(0,len(s)-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
exit()
if(s[i]=='?'):
if(s[i-1]!=s[i+1] and s[i-1]!='?' and s[i+1]!='?'):
c+=1
if(s[0]=='?' or s[n-1]=='?'):
print("Yes")
exit()
if(c<j):
print("No")
exit()
print("Yes") | if(c<j): | 15 | decision |
a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i|1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | if a[i] != a[i|1]: | 28 | operation |
a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i<<1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | if a[i] != a[i<<1]: | 28 | operation |
a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(i, n):
if a[i]<1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | if a[i]<1: | 16 | decision |
import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 75
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| steps += (r - l) + 75 | 38 | value |
import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l)>>1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| steps += (r - l)>>1 | 27 | operation |
import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < z:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| if r < z: | 19 | statement |
import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r>n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| if r>n: | 29 | decision |
import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r < n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| import sys
import math
def isIn(position, left, right):
return position >= left and position <= right
def main():
n, pos, l, r = map(int, input().split(' '))
steps = 0
if isIn(pos, l, r):
d1 = pos - l
d2 = r - pos
if d1 == 0:
if l > 1:
steps = 1
if r>n:
steps += (r - l) + 1
elif d2 == 0:
if r < n:
steps = 1
if l > 1:
steps += (r - l) + 1
elif d1 < d2:
if l > 1:
steps += (pos - l) + 1
if r < n:
steps += (r - l) + 1
elif d2 <= d1:
if r < n:
steps += (r - pos) + 1
if l > 1:
steps += (r - l) + 1
else:
if pos < l:
if l >= 1:
steps += (l - pos) + 1
if r < n:
steps += (r - l) + 1
elif pos == l:
if l > 1:
steps += 1
if r < n:
steps += (r - l) + 1
elif pos > r:
if r < n:
steps += (pos - r) + 1
if l > 1:
steps += (r - l) + 1
elif pos == r:
if r < n:
steps += 1
if l > 1:
steps += (r - l) + 1
print(steps)
if __name__ == "__main__":
main()
| if r>n: | 16 | decision |
def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)<k:
c+=1
print(c) | if g(j)<k: | 22 | decision |
def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n>10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | if n>10: | 11 | decision |
def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in x(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | for j in x(l,r+1): | 19 | statement |
def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r>>1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | for j in range(l,r>>1): | 19 | operation |
def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r+1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | def f(n):
m=1
for i in str(n):
if i=='0':
continue
m*=int(i)
return(m)
def g(n):
if n in bb:
return(bb[n])
if n<10:
return(n)
else:
return(g(f(n)))
q,bb=int(input()),{}
lrk=list(list(map(int,input().split())) for i in range(q))
for i in lrk:
[l,r,k],c=i,0
for j in range(l,r<<1):
if j not in bb:
bb[j]=g(j)
if g(j)==k:
c+=1
print(c) | for j in range(l,r<<1): | 19 | operation |
N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min <= K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min>=K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | if Min>=K: | 12 | decision |
N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min <= K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min>=K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | if Min>=K: | 12 | decision |
N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min <= K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min>=K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | if Min>=K: | 12 | decision |
N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min <= K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min>=K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | if Min>=K: | 12 | decision |
N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X ** k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min <= K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | N, K, X = map(int, input().split())
a = list(map(int, input().split()))
pw = [X-k for k in range(K + 1)]
pw2 = [2 ** k for k in range(65)]
for p in range(64, -1, -1):
index, Min = 0, 100
for i in range(N):
for k in range(K + 1):
if (a[i] * pw[k]) & pw2[p]:
Min, index = k, i
if Min <= K:
K -= Min
a[index] *= X ** Min
ans = 0
for x in a:
ans = ans | x
print(ans) | pw = [X-k for k in range(K + 1)] | 3 | operation |
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%x[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| minimumremainder = n%x[i] | 7 | statement |
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n<<a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| if (n<<a[i] > 0)and(n%a[i] < minimumremainder): | 6 | operation |
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i]==0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| if (n//a[i]==0)and(n%a[i] < minimumremainder): | 6 | decision |
n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i] > 0)and(n%a[i] < minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| n, k = map(int, input().split())
a = list(map(int,input().split()))
minimumremainder,boxtype= n,0
for i in range(k):
if (n//a[i] > 0)and(n%a[i]>minimumremainder):
minimumremainder = n%a[i]
boxtype = i+1
if boxtype>0:
print(boxtype, n//a[boxtype-1])
else:
print("no box to buy!")
| if (n//a[i] > 0)and(n%a[i]>minimumremainder): | 6 | decision |
n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2]==y[i + 2]):
ans += 1
print(ans)
| if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2]==y[i + 2]): | 14 | decision |
n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i]>y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i]>y[i] and x[i + 2] > y[i + 2]): | 14 | decision |
n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i%2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| if(x[i] > y[i] and x[i + 2] < y[i%2] or x[i] < y[i] and x[i + 2] > y[i + 2]): | 14 | operation |
n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1]<'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| if(s[i - 1]<'U'): | 7 | decision |
n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1] + 1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| n = int(input())
s = input()
ans = 0
x = [0 for i in range(100005)]
y = [0 for i in range(100005)]
for i in range(1,n + 1):
if(s[i - 1] == 'U'):
y[i] = y[i - 1] + 1
x[i] = x[i - 1]
else:
x[i] = x[i - 1]^1
y[i] = y[i - 1]
for i in range(1,n):
if(x[i] > y[i] and x[i + 2] < y[i + 2] or x[i] < y[i] and x[i + 2] > y[i + 2]):
ans += 1
print(ans)
| x[i] = x[i - 1]^1 | 11 | operation |
from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y - 1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y@1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | if matrix[x][y@1] == 'W': | 17 | operation |
from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y - 1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y - 1]<'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | if matrix[x][y - 1]<'W': | 17 | decision |
from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y - 1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y - 1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y]<'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | if matrix[x - 1][y]<'W': | 22 | decision |
from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y >= 1:
if matrix[x][y - 1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | from sys import exit
r, c = map(int, input().split())
natrix = [input() for xxx in range(r)]
matrix = [z for z in natrix]
natrix = [list(zz) for zz in natrix]
a = 0
for x in range(r):
for y in range(c):
if matrix[x][y] == 'S':
if y < c - 1:
if matrix[x][y + 1] == 'W':
print('No')
a = 1
break
if y<=1:
if matrix[x][y - 1] == 'W':
print('No')
a = 1
break
if x >= 1:
if matrix[x - 1][y] == 'W':
print('No')
a = 1
break
if x < r - 1:
if matrix[x + 1][y] == 'W':
print('No')
a = 1
break
elif matrix[x][y] != 'W':
natrix[x][y] = 'D'
if a:
break
else:
print('Yes')
for x in natrix:
print(''.join(x)) | if y<=1: | 16 | decision |
n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n-2 == 0 and k == 2):
print("No")
else:
print("Yes") | elif(n-2 == 0 and k == 2): | 7 | operation |
n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n % 2<0 and k == 2):
print("No")
else:
print("Yes") | elif(n % 2<0 and k == 2): | 7 | decision |
n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | n, k = input().split()
if(k<=n):
print("No")
elif(k > 3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | if(k<=n): | 3 | decision |
n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | n, k = input().split()
if(k >= n):
print("No")
elif(k==3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | elif(k==3): | 5 | decision |
n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n % 2 == 0 and k == 2):
print("No")
else:
print("Yes") | n, k = input().split()
if(k >= n):
print("No")
elif(k > 3):
print("No")
elif(n^2 == 0 and k == 2):
print("No")
else:
print("Yes") | elif(n^2 == 0 and k == 2): | 7 | operation |
new_login = input().lower()
new_login = new_login.replace('o', '0')
new_login = new_login.replace('i', '1')
new_login = new_login.replace('l', '1')
n = int(input())
a = []
for i in range(n):
a.append(input().lower())
a[i] = a[i].replace('o', '0')
a[i] = a[i].replace('i', '1')
a[i] = a[i].replace('l', '1')
result = 0
for ai in a:
if new_login == ai:
result += 1
if result > 0:
ans = 'No'
else:
ans = 'Yes'
print(ans) | new_login = input().lower()
new_login = new_login.replace('o', '0')
new_login = new_login.replace('i', '1')
new_login = new_login.replace('l', '1')
n = int(input())
a = []
for i in range(n):
a.append(input().lower())
a[i] = a[i].replace('o', '0')
a[i] = a[i].replace('i', '1')
a[i] = a[i].replace('l', '1')
result = 0
for ai in a:
if new_login == ai:
result += 1
if result==0:
ans = 'No'
else:
ans = 'Yes'
print(ans) | if result==0: | 26 | decision |
new_login = input().lower()
new_login = new_login.replace('o', '0')
new_login = new_login.replace('i', '1')
new_login = new_login.replace('l', '1')
n = int(input())
a = []
for i in range(n):
a.append(input().lower())
a[i] = a[i].replace('o', '0')
a[i] = a[i].replace('i', '1')
a[i] = a[i].replace('l', '1')
result = 0
for ai in a:
if new_login == ai:
result += 1
if result > 0:
ans = 'No'
else:
ans = 'Yes'
print(ans) | new_login = input().lower()
new_login = new_login.replace('o', '0')
new_login = new_login.replace('i', '1')
new_login = new_login.replace('l', '1')
n = int(input())
a = []
for i in range(n):
a.append(input().lower())
a[i] = a[i].replace('o', '0')
a[i] = a[i].replace('i', '1')
a[i] = a[i].replace('l', '1')
result = 0
for ai in a:
if new_login<ai:
result += 1
if result > 0:
ans = 'No'
else:
ans = 'Yes'
print(ans) | if new_login<ai: | 22 | decision |
def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+18, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | if i<n-1: flag = set(i+18, j) | 24 | value |
def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+152, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | if i<n-1: flag = set(i+152, j) | 24 | value |
def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+1, j)
if j<m^1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | if j<m^1: flag = set(i, j+1) | 25 | operation |
def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j//1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | if j>0: flag = set(i, j//1) | 23 | operation |
def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j-1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | def finish(l):
while len(l) < m:
l.append(".")
return l
n, m = [int(x) for x in input().split()]
a = [finish([x for x in input()]) for _ in range(n)]
def set(i, j):
if a[i][j] == "S":
return False
elif a[i][j] == ".":
a[i][j] = "D"
return True
flag = True
for i in range(n):
for j in range(m):
if a[i][j] != 'W': continue
if i>0: flag = set(i-1, j)
if j>0: flag = set(i, j<<1)
if i<n-1: flag = set(i+1, j)
if j<m-1: flag = set(i, j+1)
if flag == False:
break
if flag:
print("Yes")
for s in a:
print("".join(s))
else:
print("No") | if j>0: flag = set(i, j<<1) | 23 | operation |
p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l<=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | while l<=2: | 10 | decision |
p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)//int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | if int(int(j)*int(k)) not in mogelijk and int(int(j)//int(k))<=y: | 5 | operation |
p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y/int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | for k in range(1,int(((y/int(j))*int(j)+1))): | 4 | operation |
p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))>=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))>=y: | 5 | decision |
p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))<=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | p,y=map(int,input().split())
mogelijk=[]
for j in range(2,p+1):
for k in range(1,int(((y//int(j))*int(j)+1))):
if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))>=y:
mogelijk.append(int(int(j)*int(k)))
mogelijk=sorted(mogelijk)
mogelijk.reverse()
l=y
while l>=2:
if l not in mogelijk:
print(int(l))
break
else:
if l==2:
print('-1')
break
else:
l-=1 | if int(int(j)*int(k)) not in mogelijk and int(int(j)*int(k))>=y: | 5 | decision |
x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m>0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | if m>0: | 5 | decision |
x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h>0:
h = 23
y += 1
print(y) | if h>0: | 8 | decision |
x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h/24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | while m % 10 != 7 and h/24 != 7: | 3 | operation |
x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60^m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | m = 60^m | 6 | operation |
x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m < 0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | x, y = int(input()), 0
h, m = map(int, input().split())
while m % 10 != 7 and h % 24 != 7:
m -= x
if m>0:
m = 60 + m
h -= 1
if h < 0:
h = 23
y += 1
print(y) | if m>0: | 5 | decision |
from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i]) / l - 1)
print (cou) | from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i])/l - 1)
print (cou) | cou = int(cou + (node[i + 1] - node[i])/l - 1) | 14 | operation |
from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i]) / l - 1)
print (cou) | from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2]**node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i]) / l - 1)
print (cou) | l = int(gcd(node[1] - node[0], node[2]**node[1])) | 6 | operation |
from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i]) / l - 1)
print (cou) | from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i-1] - node[i]) / l - 1)
print (cou) | cou = int(cou + (node[i-1] - node[i]) / l - 1) | 14 | operation |
from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i + 2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i]) / l - 1)
print (cou) | from fractions import gcd
n = int(input())
node = sorted(list(map(int, input().split())))
l = int(gcd(node[1] - node[0], node[2] - node[1]))
cou = int(0)
for i in range(n - 2):
l = gcd(l, node[i-2] - node[i + 1])
for i in range(n - 1):
cou = int(cou + (node[i + 1] - node[i]) / l - 1)
print (cou) | l = gcd(l, node[i-2] - node[i + 1]) | 10 | operation |
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == y:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | if int(b[i]) == y: | 14 | statement |
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[x
]
print(ans) | ans += str(y) * dict[x | 28 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.