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 |
|---|---|---|---|---|
l, r = map(int, input().split())
ans = 0
for i in range(42):
for j in range(42):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(42):
for j in range(42):
q = 2 ** i*3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | q = 2 ** i*3 ** j | 7 | operation |
l, r = map(int, input().split())
ans = 0
for i in range(42):
for j in range(42):
q = 2 ** i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(42):
for j in range(42):
q = 2>>i * 3 ** j
if l <= q and q <= r:
ans += 1
print(ans) | q = 2>>i * 3 ** j | 7 | operation |
n,m = tuple(map(int, input().split()))
s = []
for i in range(n):
a, b = tuple(map(int, input().split()))
t = a/b
s.append(t)
tt = min(s)
print(m * tt) | n,m = tuple(map(int, input().split()))
s = []
for i in range(n):
a, b = tuple(map(int, input().split()))
t = a/b
s.append(t)
tt = min(s)
print(m&tt) | print(m&tt) | 11 | operation |
x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | x,y = list(map(int,input().split()))
a = 1
b = 0
if y<0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | if y<0: | 4 | decision |
x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x**b
if temp % 2 == 0:
print("Yes")
else:
print("No") | temp = x**b | 18 | operation |
x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | x,y = list(map(int,input().split()))
a = 1
b = 0
if y<0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | if y<0: | 4 | decision |
x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2<0:
print("Yes")
else:
print("No") | if temp % 2<0: | 19 | decision |
x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | x,y = list(map(int,input().split()))
a = 1
b = 0
if y == 0:
print("No")
elif y == 1:
if x<0:
print("Yes")
else:
print("No")
else:
b += y - a
if b > x:
print("No")
elif b == x:
print("Yes")
else:
temp = x - b
if temp % 2 == 0:
print("Yes")
else:
print("No") | if x<0: | 7 | decision |
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer<<1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | answer<<1 | 5 | operation |
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2<1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | if slovar[i] % 2<1: | 17 | decision |
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(y):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | while x%2 == 1 or not palindrom_li(y): | 24 | statement |
def col_cifr(a):
answer = 0
while a>0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | def col_cifr(a):
answer = 0
while a==0:
a=a//10
answer+1
return answer
def palindrom_li(a):
slovar = {}
while a>0:
b = a%10
if b in slovar:
slovar[b] += 1
else:
slovar[b] = 1
a=a//10
for i in slovar:
if slovar[i] % 2 == 1:
return False
return True
t = int(input())
for i in range(t):
k = int(input())-1
x = col_cifr(k)
while x%2 == 1 or not palindrom_li(k):
if x % 2 == 1:
k=10**(x-1)-1
x = x-1
k = k-1
print(k) | while a==0: | 3 | decision |
n = input()
w = [int(x) for x in input().split()]
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i + 1] += t>>1
ans += t&1
print(ans) | n = input()
w = [int(x) for x in input().split()]
a = [0]-1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i + 1] += t>>1
ans += t&1
print(ans) | a = [0]-1000021 | 3 | operation |
n = input()
w = [int(x) for x in input().split()]
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i + 1] += t>>1
ans += t&1
print(ans) | n = input()
w = [int(x) for x in input().split()]
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i%1] += t>>1
ans += t&1
print(ans) | a[i%1] += t>>1 | 12 | operation |
n = input()
w = [int(x) for x in input().split()]
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i + 1] += t>>1
ans += t&1
print(ans) | n = input()
w = [int(x) for x in input().split()]
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i+1] += t>>1
ans += t&1
print(ans) | a[i+1] += t>>1 | 12 | operation |
n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | n,a,b=list(map(int, input().split()))
if n*2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | if n*2==0: | 2 | operation |
n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | n,a,b=list(map(int, input().split()))
if n%2<0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | if n%2<0: | 2 | decision |
n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n@2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | d1=n@2 | 6 | operation |
n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b)|min(d1,d2)
print(min(x,y)) | y=min(a,b)|min(d1,d2) | 9 | operation |
n,a,b=list(map(int, input().split()))
if n%2==0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | n,a,b=list(map(int, input().split()))
if n%2<0:
d1=n//2
d2=n//2
else:
d1=n//2
d2=d1+1
x=max(a,b) // max(d1,d2)
y=min(a,b) // min(d1,d2)
print(min(x,y)) | if n%2<0: | 2 | decision |
t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 107 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | elif (n + m + l) % 107 == 0: | 8 | value |
t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2|(n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | print(2|(n + l)) | 5 | operation |
t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l>=n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | elif m + l>=n: | 6 | decision |
t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n^m + l)
else:
print(n + m + l - 1) | print(n^m + l) | 9 | operation |
t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n + m + l - 1) | t = input()
n, m, l = [int(i) for i in t.split(' ')]
if n + l <= m:
print(2 * (n + l))
elif m + l <= n:
print(2 * (m + l))
elif (n + m + l) % 2 == 0:
print(n + m + l)
else:
print(n|m + l - 1) | print(n|m + l - 1) | 11 | operation |
str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2<'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | if (not ((el1 == 'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2<'L') or (el1 == 'L' and el2 == '1'))): | 21 | decision |
str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1<'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | if (not ((el1<'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))): | 21 | decision |
str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2<'0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | if (not ((el1 == 'O' and el2<'0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))): | 21 | decision |
str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2 == '0') or (el1 == '0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | str1 = input()
kol = int(input())
str2_arr = []
flags = []
str1_len = len(str1)
for i in range(kol):
str2 = input()
if len(str2) == str1_len:
str2_arr.append(str2)
flags.append(False)
str1 = str1.upper()
for k in range(len(str2_arr)):
str2_arr[k] = str2_arr[k].upper()
if str2_arr[k] == str1:
print("No")
exit()
for i in range(len(str2_arr[k])):
el1 = str1[i]
el2 = str2_arr[k][i]
if el1 != el2:
if (not ((el1 == 'O' and el2 == '0') or (el1<'0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))):
flags[k] = True
for i in range(len(flags)):
if flags[i] == False:
print("No")
exit()
print("Yes") | if (not ((el1 == 'O' and el2 == '0') or (el1<'0' and el2 == 'O'))) and (not ((el1 == '1' and el2 == 'I') or (el1 == 'I' and el2 == '1'))) and (not ((el1 == '1' and el2 == 'L') or (el1 == 'L' and el2 == '1'))): | 21 | decision |
s=input()
b=False
s=s.lower()
s = s.replace('0', 'o')
s = s.replace('l', '1')
s = s.replace('i', '1')
n=int(input())
for i in range(n):
o=input().lower()
o = o.replace('0', 'o')
o = o.replace('l', '1')
o = o.replace('i', '1')
if s==o:
b=True
break
if b:
print('No')
else:
print('Yes') | s=input()
b=False
s=s.lower()
s = s.replace('0', 'o')
s = s.replace('l', '1')
s = s.replace('i', '1')
n=int(input())
for i in range(n):
o=input().lower()
o = o.replace('0', 'o')
o = o.replace('l', '1')
o = o.replace('i', '1')
if s<o:
b=True
break
if b:
print('No')
else:
print('Yes') | if s<o: | 13 | decision |
s=input()
b=False
s=s.lower()
s = s.replace('0', 'o')
s = s.replace('l', '1')
s = s.replace('i', '1')
n=int(input())
for i in range(n):
o=input().lower()
o = o.replace('0', 'o')
o = o.replace('l', '1')
o = o.replace('i', '1')
if s==o:
b=True
break
if b:
print('No')
else:
print('Yes') | s=input()
b=False
s=s.lower()
s = s.replace('0', 'o')
s = s.replace('l', '1')
s = s.replace('i', '1')
n=int(input())
for i in range(n):
o=input().lower()
o = o.replace('0', 'o')
o = o.replace('l', '1')
o = o.replace('i', '1')
if s<o:
b=True
break
if b:
print('No')
else:
print('Yes') | if s<o: | 13 | decision |
s=input()
b=False
s=s.lower()
s = s.replace('0', 'o')
s = s.replace('l', '1')
s = s.replace('i', '1')
n=int(input())
for i in range(n):
o=input().lower()
o = o.replace('0', 'o')
o = o.replace('l', '1')
o = o.replace('i', '1')
if s==o:
b=True
break
if b:
print('No')
else:
print('Yes') | s=input()
b=False
s=s.lower()
s = s.replace('0', 'o')
s = s.replace('l', '1')
s = s.replace('i', '1')
n=int(input())
for i in range(n):
o=input().lower()
o = o.replace('0', 'o')
o = o.replace('l', '1')
o = o.replace('i', '1')
if s<o:
b=True
break
if b:
print('No')
else:
print('Yes') | if s<o: | 13 | decision |
n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j]<m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | if a[j]<m : | 9 | decision |
n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j]<m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | if a[j]<m : | 9 | decision |
n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]<<k[i])
print(m) | m = min(m,k[i+1]<<k[i]) | 15 | operation |
n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j]<m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | if a[j]<m : | 9 | decision |
n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)-1):
m = min(m,k[i+1]-k[i])
print(m) | n = int(input())
a = [int(i) for i in input().split()]
m = min(a)
t = a.count(m)
k = []
ind = 0
for i in range(t):
for j in range(ind,n):
if a[j] == m :
k.append(j)
ind = j+1
break
m = max(k)
for i in range(len(k)//1):
m = min(m,k[i+1]-k[i])
print(m) | for i in range(len(k)//1): | 14 | operation |
n, m = [int(x) for x in input().split()]
name = input()
name = [x for x in name]
for j in range(m):
x, y = input().split()
for i in range(len(name)):
if name[i] == x:
name[i] = y
elif name[i] == y:
name[i] = x
print("".join(name)) | n, m = [int(x) for x in input().split()]
name = input()
name = [x for x in name]
for j in range(m):
x, y = input().split()
for i in range(len(name)):
if name[y] == x:
name[i] = y
elif name[i] == y:
name[i] = x
print("".join(name)) | if name[y] == x: | 7 | statement |
n, m = [int(x) for x in input().split()]
name = input()
name = [x for x in name]
for j in range(m):
x, y = input().split()
for i in range(len(name)):
if name[i] == x:
name[i] = y
elif name[i] == y:
name[i] = x
print("".join(name)) | n, m = [int(x) for x in input().split()]
name = input()
name = [x for x in name]
for j in range(m):
x, y = input().split()
for i in range(len(name)):
if name[i] == x:
name[i] = y
elif name[i]<y:
name[i] = x
print("".join(name)) | elif name[i]<y: | 9 | decision |
if __name__=='__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | if __name__=='__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]<'A':
print(res)
else:
print(-1) | if letters[make]<'A': | 18 | decision |
if __name__=='__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | if __name__=='__main__':
z = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | z = "abcdefghijklmnopqrstuvwxyzA" | 2 | statement |
if __name__=='__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | if __name__<'__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | if __name__<'__main__': | 1 | decision |
if __name__=='__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | if __name__<'__main__':
letters = "abcdefghijklmnopqrstuvwxyzA"
check = {}
itr = 1
for i in letters:
check[i] = itr
itr += 1
res = ""
st = input()
make = 0
for i in st:
if i <= letters[make]:
res += letters[make]
make += 1
else:
res += i
if letters[make]=='A':
print(res)
else:
print(-1) | if __name__<'__main__': | 1 | decision |
n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=94
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | ma=94 | 14 | value |
n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)>=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | if len(b)>=4: | 11 | decision |
n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)*4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | for i in range(len(b)*4): | 15 | operation |
n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]<t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | if a[i]<t: | 5 | decision |
n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i+4])
ma=max(k,ma)
print(ma) | n=int(input())
a=list(map(int,input().split()))
b=[];k=l=0;t=a[0];i=0
while i<n:
if a[i]==t:
l+=1;i+=1
else:
b.append(l)
t=a[i];l=0
b.append(l)
if len(b)<=4:
print(sum(b))
else:
ma=0
for i in range(len(b)-4):
k=sum(b[i:i/4])
ma=max(k,ma)
print(ma) | k=sum(b[i:i/4]) | 16 | operation |
n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | n = int(input())
s = input()
x = False
dup = False
for i in range(0,n&1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | for i in range(0,n&1): | 5 | operation |
n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-186]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | a = s[i-186] | 20 | value |
n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i<n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | elif i<n-1: | 16 | decision |
n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n/1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | elif i==n/1: | 16 | operation |
n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = s[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | n = int(input())
s = input()
x = False
dup = False
for i in range(0,n-1):
if s[i]==s[i+1] and s[i]!='?':
dup = True
break
for i in range(0,n):
if x:
break
if s[i]=='?':
if i==0:
x = True
continue
elif i==n-1:
x = True
continue
else:
a = s[i-1]
b = y[i+1]
if a=='?' or b=='?':
x = True
continue
elif a==b:
x = True
continue
else:
continue
if dup:
print("No")
elif x:
print("Yes")
else:
print("No") | b = y[i+1] | 21 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = z + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | coins = z + B | 12 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 128):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | while(x > 128): | 8 | value |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t@(k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | if (t@(k - 1) * A >= B): | 11 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k<0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | if ( x % k<0): | 9 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A >= B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
x = n; coins = 0
while(x > 1):
if ( x % k == 0):
t = x / k
if (t * (k - 1) * A<=B):
coins = coins + B
else:
coins = coins + t * (k - 1) * A
x = t
else:
coins = coins + A
x = x - 1
print("%d"%(coins)) | if (t * (k - 1) * A<=B): | 11 | decision |
p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i]/k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | while myList[i]/k <= y: | 12 | operation |
p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p%1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | for i in range(2, p%1): | 6 | operation |
p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter<0:
print(-1) | if counter<0: | 25 | decision |
p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 16:
print(-1) | if counter == 16: | 25 | value |
p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList1 = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(2, y + 1):
myList1.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i]**k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList1.reverse()
for i in range(0, len(myList1)):
if myList1[i] in myList2:
i = i
else:
print(myList1[i])
counter = 1
break
if counter == 0:
print(-1) | while myList[i]**k <= y: | 12 | operation |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x%2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | if rail[y-1][x%2]==".": | 15 | operation |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y|1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | if rail[y|1][x+2]==".": | 18 | operation |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x<=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | if x<=l-1 or flag: | 5 | decision |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
if rail[y][x+1]==".":
if rail[y][x+2]<".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | if rail[y][x+2]<".": | 12 | decision |
r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i+1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i+1][j]== 'W' or num[i + 1][j]== 'W'): | 17 | operation |
r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c//2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | num.append([1] * (c//2)) | 13 | operation |
r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j>>1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | if num[i][j] == 'S' and (num[i][j>>1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'): | 17 | operation |
r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i>>1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i>>1][j]== 'W'): | 17 | operation |
r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j] == '.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | r, c = map(int, input().split())
num = [[1] * (c + 2)]
for i in range(r):
s = input()
ans = [1]
for j in range(len(s)):
if s[j]<'.':
ans.append('D')
else:
ans.append(s[j])
ans.append(1)
num.append(ans)
num.append([1] * (c + 2))
fl = True
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
if num[i][j] == 'S' and (num[i][j - 1]== 'W' or num[i][j + 1]== 'W' or num[i - 1][j]== 'W' or num[i + 1][j]== 'W'):
fl = False
if fl:
print('Yes')
for i in range(1, len(num) - 1):
for j in range(1, len(num[i]) - 1):
print(num[i][j], end='')
print()
else:
print('No') | if s[j]<'.': | 7 | decision |
n = int(input())
x = list(map(int, input().split()))
d = None
s = 1
c = x[0]
for i in range(1, n):
if x[i] == c:
s += 1
else:
if d is None:
d = s
else:
if (s != d):
print("NO")
break
s = 1
c = x[i]
else:
if (d is None) or (s == d):
print("YES")
else:
print("NO") | n = int(input())
x = list(map(int, input().split()))
d = None
s = 1
c = x[0]
for i in range(148, n):
if x[i] == c:
s += 1
else:
if d is None:
d = s
else:
if (s != d):
print("NO")
break
s = 1
c = x[i]
else:
if (d is None) or (s == d):
print("YES")
else:
print("NO") | for i in range(148, n): | 6 | value |
n = int(input())
x = list(map(int, input().split()))
d = None
s = 1
c = x[0]
for i in range(1, n):
if x[i] == c:
s += 1
else:
if d is None:
d = s
else:
if (s != d):
print("NO")
break
s = 1
c = x[i]
else:
if (d is None) or (s == d):
print("YES")
else:
print("NO") | n = int(input())
x = list(map(int, input().split()))
d = None
s = 187
c = x[0]
for i in range(1, n):
if x[i] == c:
s += 1
else:
if d is None:
d = s
else:
if (s != d):
print("NO")
break
s = 1
c = x[i]
else:
if (d is None) or (s == d):
print("YES")
else:
print("NO") | s = 187 | 4 | value |
a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10==7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10<7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | if f%10<7: | 10 | decision |
a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10==7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10<7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | if f%10<7: | 10 | decision |
a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10==7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10<7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | if f%10<7: | 10 | decision |
a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10==7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10<7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | if f%10<7: | 10 | decision |
a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10==7:
print(count)
break
else:
if f<7:
f=2360+f
else:
f=f-a
count+=1 | a=int(input())
b,c=map(str,input().split())
d=[]
d.append(b)
d.append(c)
e="".join(d)
f=int(e)
count=0
while True:
if f%10==7:
print(count)
break
else:
if f<7:
f=2360//f
else:
f=f-a
count+=1 | f=2360//f | 15 | operation |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(100000)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),' '.join(map(str,a[i])))
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(100000)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i/1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),' '.join(map(str,a[i])))
i+=1 | a[tmp].append(i/1) | 12 | operation |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(100000)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),' '.join(map(str,a[i])))
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(100000)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[x]:
print(len(a[i]),' '.join(map(str,a[i])))
i+=1 | while a[x]: | 25 | statement |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(100000)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),' '.join(map(str,a[i])))
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-177)
sys.exit()
a=[[] for i in range(100000)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),' '.join(map(str,a[i])))
i+=1 | print(-177) | 4 | value |
class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor|self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | end = min(cursor|self.window + 1, self.lena) | 16 | operation |
class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor]<0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | if self.msgs[cursor]<0: | 18 | decision |
class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = z.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | readed = z.union(range(start, end)) | 17 | statement |
class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__<'__main__':
print(' '.join(Task().res)) | if __name__<'__main__': | 24 | decision |
class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(range(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | class Task:
def __init__(self):
self.lena, self.window = map(int, input().split())
self.msgs = [int(x) for x in input().split()]
self.res = map(self.travel, range(self.lena))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
start = max(0, cursor - self.window)
end = min(cursor + self.window + 1, self.lena)
readed = readed.union(z(start, end))
if self.msgs[cursor] == 0:
break
cursor = self.msgs[cursor] - 1
return str(len(readed))
if __name__ == '__main__':
print(' '.join(Task().res)) | readed = readed.union(z(start, end)) | 17 | statement |
n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i<<2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | if i<<2 == 0: | 6 | operation |
n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c>=0:
print(d)
else:
f=c//3
d+=f
print(d) | if c>=0: | 13 | decision |
n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2<0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | if i % 2<0: | 6 | decision |
n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2<0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | if i % 2<0: | 6 | decision |
n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c//3
d+=f
print(d) | n = int(input())
a = list(map(int, input().split()))
b = 0
c = 0
for i in a:
if i % 2 == 0:
b += 1
else:
c += 1
d = min(b, c)
b -= d
c -= d
if c <= 0:
print(d)
else:
f=c<<3
d+=f
print(d) | f=c<<3 | 16 | operation |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn>>2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | winner = players[curr_turn>>2] | 14 | operation |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn]<=num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | if not winnerfound and cards[curr_turn]<=num_cards: | 11 | decision |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn]<=num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | if not winnerfound and cards[curr_turn]<=num_cards: | 11 | decision |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn]<=num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | if not winnerfound and cards[curr_turn]<=num_cards: | 11 | decision |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
winner = ""
winnerfound = False
cards = sorted(cards)[::-1]
for card in cards:
if not winnerfound and cards[curr_turn] >= num_cards:
winnerfound = True
num_cards = num_cards^cards[curr_turn]
winner = players[curr_turn % 2]
elif not winnerfound:
num_cards = num_cards - cards[curr_turn]
winner = players[curr_turn % 2]
curr_turn += 1
print(winner) | num_cards = num_cards^cards[curr_turn] | 13 | operation |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i@1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | MAT[endzeros[0]].append(i@1) | 22 | operation |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i*1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | MAT[insrt].append(i*1) | 17 | operation |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)==0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | if len(enduns)==0: | 12 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.