original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
a , b = map(int , input().split())
x , y ,z = map(int , input().split())
has = a + b
req = (2 * x + 2 * y + 3 * z)
if req < has:
print(0)
else:
print(req - has) | a , b = map(int , input().split())
x , y ,z = map(int , input().split())
has = a + b
req = (2 * x + 2 * y + 3@z)
if req < has:
print(0)
else:
print(req - has) | req = (2 * x + 2 * y + 3@z) | 5 | operation |
x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y<x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | elif y<x + 1: | 14 | decision |
x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x<=(y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | if x<=(y - 1) and (x - (y - 1)) % 2 == 0: | 17 | decision |
x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if y<0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | if y<0: | 2 | decision |
x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
y("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | y("Yes") | 8 | statement |
x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if y == 0:
print("No")
elif y == 1:
if x > 0:
print("No")
else:
print("Yes")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y/1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No") | if x >= (y/1) and (x - (y - 1)) % 2 == 0: | 17 | operation |
from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]>min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | if n%a[i]>min: | 6 | decision |
from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+146,boxes) | print(types+146,boxes) | 10 | value |
from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]>min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | if n%a[i]>min: | 6 | decision |
from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if y%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | if y%a[i]<min: | 6 | statement |
from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]<min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | from math import *
n,k=map(int,input().split())
min = inf
a=list(map(int,input().split()))
for i in range(k):
if n%a[i]>min:
min=n%a[i]
boxes=n//a[i]
types=i
print(types+1,boxes) | if n%a[i]>min: | 6 | decision |
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(set(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | answer = 'Yes'
s = input()
if y(s) <= 3:
answer = 'No'
len_of_differents = len(set(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | if y(s) <= 3: | 5 | statement |
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(set(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | answer = 'Yes'
s = input()
if len(s) <= 136:
answer = 'No'
len_of_differents = len(set(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | if len(s) <= 136: | 5 | value |
n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k] - 3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j]>>l[k] - 3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | if l[i] + l[j]>>l[k] - 3 == i + j + k and i != j and j != k and i != k: | 8 | operation |
n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k] - 3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k] - 14 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | if l[i] + l[j] + l[k] - 14 == i + j + k and i != j and j != k and i != k: | 8 | value |
n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k] - 3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k] - 3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r<'YES':
break
print(r) | if r<'YES': | 16 | decision |
n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k] - 3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | n = int(input())
l = list(map(int, input().split()))
r = 'NO'
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] + l[j] + l[k]>>3 == i + j + k and i != j and j != k and i != k:
r = 'YES'
print(i, j, k)
break
if r == 'YES':
break
if r == 'YES':
break
print(r) | if l[i] + l[j] + l[k]>>3 == i + j + k and i != j and j != k and i != k: | 8 | operation |
from sys import exit
n = int(input())
f = list(map(lambda x: int(x) - 1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | from sys import exit
n = int(input())
f = list(map(lambda x: int(x) - 1, input().split()))
for i in range(y(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | for i in range(y(f)): | 7 | statement |
from sys import exit
n = int(input())
f = list(map(lambda x: int(x) - 1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | from sys import exit
n = int(input())
f = list(map(lambda x: int(x)+1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | f = list(map(lambda x: int(x)+1, input().split())) | 5 | operation |
from sys import exit
n = int(input())
f = list(map(lambda x: int(x) - 1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | from sys import exit
n = int(input())
f = list(map(lambda x: int(x)*1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | f = list(map(lambda x: int(x)*1, input().split())) | 5 | operation |
from sys import exit
n = int(input())
f = list(map(lambda x: int(x) - 1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | from sys import exit
n = int(input())
f = list(map(lambda x: int(x)//1, input().split()))
for i in range(len(f)):
if f[f[f[i]]] == i and f[f[i]] != i:
print('YES')
exit(0)
print('NO') | f = list(map(lambda x: int(x)//1, input().split())) | 5 | operation |
n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end-begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | n=int(x())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end-begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | n=int(x()) | 1 | statement |
n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end-begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end-begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]>>1)
else:
print(1000000-a[i]) | print(a[i-1]>>1) | 16 | operation |
n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end-begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end%begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | while end%begin>2: | 5 | operation |
n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end-begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | n=int(input())
a=[int(i) for i in input().split()]
begin=0
end=len(a)
while end**begin>2:
i=(begin+end)//2+1
if a[i]<=500000:
begin=i
else:
end=i
i=begin+1
if a[-1]>500000 and a[0]<500000:
print(max(a[i-1]-1,1000000-a[i]))
elif a[0]<500000:
print(a[i-1]-1)
else:
print(1000000-a[i]) | while end**begin>2: | 5 | operation |
def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j+1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | if j+1 > len(login): | 10 | operation |
def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j**1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | if j**1 > len(login): | 10 | operation |
def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | def check(new_login):
n = int(input())
flag = 0
for i in range(y):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | for i in range(y): | 4 | statement |
def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j]<'1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | elif (new_login[j]<'1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \ | 16 | decision |
def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[j].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | def check(new_login):
n = int(input())
flag = 0
for i in range(n):
login = input()
if flag == len(new_login):
return "No"
flag = 0
for j in range(len(new_login)):
if j + 1 > len(login):
break
if new_login[j].lower() == login[j].lower():
flag += 1
elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[x].lower() == "o" or login[j] == '0'):
flag += 1
elif (new_login[j] == '1' or new_login[j].lower() == "i" or new_login[j].lower() == "l") and \
(login[j] == '1' or login[j].lower() == "i" or login[j].lower() == "l"):
flag += 1
if flag == len(new_login):
return "No"
return "Yes"
new_login = input()
print(check(new_login)) | elif (new_login[j].lower() == "o" or new_login[j] == '0') and (login[x].lower() == "o" or login[j] == '0'): | 14 | statement |
newlogin = input()
existLogins = int(input())
logins = list()
for i in range(existLogins):
existLogin = input()
logins.append(existLogin)
for exl in logins:
new = ''
new1 = ''
for l in exl:
if l == "O":
new += "0"
elif l == "l":
new += "1"
elif l == "I":
new += "1"
else:
new += l
for l in newlogin:
if l == "O":
new1 += "0"
elif l == "l":
new1 += "1"
elif l == "I":
new1 += "1"
else:
new1 += l
if new.lower() == new1.lower():
print("No")
quit()
print("Yes") | newlogin = input()
existLogins = int(input())
logins = list()
for i in range(existLogins):
existLogin = input()
logins.append(existLogin)
for exl in logins:
new = ''
new1 = ''
for l in exl:
if l == "O":
new += "0"
elif l == "l":
new += "1"
elif l == "I":
new += "1"
else:
new += l
for l in newlogin:
if l<"O":
new1 += "0"
elif l == "l":
new1 += "1"
elif l == "I":
new1 += "1"
else:
new1 += l
if new.lower() == new1.lower():
print("No")
quit()
print("Yes") | if l<"O": | 22 | decision |
newlogin = input()
existLogins = int(input())
logins = list()
for i in range(existLogins):
existLogin = input()
logins.append(existLogin)
for exl in logins:
new = ''
new1 = ''
for l in exl:
if l == "O":
new += "0"
elif l == "l":
new += "1"
elif l == "I":
new += "1"
else:
new += l
for l in newlogin:
if l == "O":
new1 += "0"
elif l == "l":
new1 += "1"
elif l == "I":
new1 += "1"
else:
new1 += l
if new.lower() == new1.lower():
print("No")
quit()
print("Yes") | newlogin = input()
existLogins = int(input())
logins = list()
for i in range(existLogins):
existLogin = input()
logins.append(existLogin)
for exl in logins:
new = ''
new1 = ''
for l in exl:
if l == "O":
new += "0"
elif l == "l":
new += "1"
elif l == "I":
new += "1"
else:
new += l
for l in newlogin:
if l == "O":
new1 += "0"
elif l == "l":
new1 += "1"
elif l == "I":
new1 += "1"
else:
z += l
if new.lower() == new1.lower():
print("No")
quit()
print("Yes") | z += l | 29 | statement |
newlogin = input()
existLogins = int(input())
logins = list()
for i in range(existLogins):
existLogin = input()
logins.append(existLogin)
for exl in logins:
new = ''
new1 = ''
for l in exl:
if l == "O":
new += "0"
elif l == "l":
new += "1"
elif l == "I":
new += "1"
else:
new += l
for l in newlogin:
if l == "O":
new1 += "0"
elif l == "l":
new1 += "1"
elif l == "I":
new1 += "1"
else:
new1 += l
if new.lower() == new1.lower():
print("No")
quit()
print("Yes") | newlogin = input()
existLogins = int(input())
logins = list()
for i in range(existLogins):
existLogin = input()
logins.append(existLogin)
for exl in logins:
new = ''
new1 = ''
for l in exl:
if l == "O":
new += "0"
elif l == "l":
new += "1"
elif l == "I":
new += "1"
else:
new += l
for l in newlogin:
if l == "O":
new1 += "0"
elif l<"l":
new1 += "1"
elif l == "I":
new1 += "1"
else:
new1 += l
if new.lower() == new1.lower():
print("No")
quit()
print("Yes") | elif l<"l": | 24 | decision |
l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | l,r,a=map(int,input().split(' '))
if l>r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | if l>r: | 2 | decision |
l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(128*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | print(128*r) | 10 | value |
l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a>x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | if a>x: | 4 | decision |
l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a>x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | if a>x: | 16 | decision |
l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(2*l) | l,r,a=map(int,input().split(' '))
if l<r:
x=r-l
if a<x:
l=l+a
print(2*l)
else:
a=a-x
r=r+a//2
print(2*r)
elif l==r:
r=r+a//2
print(r*2)
else:
x=l-r
if a<x:
r=r+a
print(2*r)
else:
a=a-x
l=l+a//2
print(101*l) | print(101*l) | 22 | value |
t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]==l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]<l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | if(l[i]<l[i-1]): | 10 | decision |
t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]==l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]==l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)<max(j_c)):
print('YES')
else:
print('NO') | if(min(j_c)<max(j_c)): | 25 | decision |
t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]==l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]<l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | if(l[i]<l[i-1]): | 10 | decision |
t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]==l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]==0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | t=int(input())
l=list(map(int,input().split()))
i_count=0
j_count=0
prev=0
prev_w=1
min_c=0
l_c=[]
for i in range(1,t):
if(l[i]==l[i-1]):
p=0
elif(l[i]!=l[i-1]):
l_c.append(i)
l_c.append(i+1)
j_c=[]
for i in range(0,len(l_c)):
if(l[l_c[i]-1]<0 and i==0):
j_c.append(l[:l_c[i]].count(0))
elif(l[l_c[i]-1]==1 and i==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
elif(l[l_c[i]-1]==0):
j_c.append(l[l_c[i-1]:l_c[i]].count(0))
elif(l[l_c[i]-1]==1):
j_c.append(l[l_c[i-1]:l_c[i]].count(1))
if(min(j_c)==max(j_c)):
print('YES')
else:
print('NO') | if(l[l_c[i]-1]<0 and i==0): | 17 | decision |
n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10**6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10//6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | me , fr = 1, 10//6 | 3 | operation |
n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10**6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10<<6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | me , fr = 1, 10<<6 | 3 | operation |
n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10**6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10**6
j=0
while len(a)>0:
me+=1
fr-=57
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | fr-=57 | 7 | value |
n=int(input())
a=[int(i) for i in input().split()]
me , fr = 1, 10**6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | n=int(input())
a=[int(i) for i in input().split()]
x , fr = 1, 10**6
j=0
while len(a)>0:
me+=1
fr-=1
if me in a:
del a[a.index(me)]
if fr in a:
del a[a.index(fr)]
j+=1
print(j) | x , fr = 1, 10**6 | 3 | statement |
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i]==start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| if x[i]==start + k: | 12 | decision |
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1]==k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| if (x[i] - x[i - 1]==k): | 5 | decision |
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i]|x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| if (x[i]|x[i - 1] > k): | 5 | operation |
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start@k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| if x[i] > start@k: | 12 | operation |
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i] - x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = True
for i in range(1, n):
if (x[i]*x[i - 1] > k):
ans = False
break
if ans:
cnt = 1
start = x[0]
for i in range(1, n):
if x[i] > start + k:
start = x[i - 1]
cnt += 1
++i
print(cnt)
else:
print(-1)
| if (x[i]*x[i - 1] > k): | 5 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==153:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | if(q%k)==153: | 13 | value |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)<<k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | f=(q//k+1)<<k | 16 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e^k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | d.append(g[e^k]) | 22 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k-1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | f=(q//k-1)*k | 16 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)%len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
d=[]
for e in range(f):
if(e in c):
d.append(c[e])
else:
d.append(g[e%k])
l=0
l2=1
for j in range(2,n+2):
t=l2
l2=l2*d[(j-1)>>len(d)]+l*d[(j-2)%len(d)]
l=t
if(n==1):
print(d[0]%m)
else:
if(n==0):
print('0')
else:
print(l2%m) | l2=l2*d[(j-1)>>len(d)]+l*d[(j-2)%len(d)] | 29 | operation |
t=int(input())
for i in range(t):
n,k = map(int,input().split())
l = list(map(int,input().split()))
a=[]
a.append(l[0])
for j in range(k-1):
a.append((l[j+1]-l[j])//2+1)
a.append(n-l[k-1]+1)
k= max(a)
print(k) | t=int(input())
for i in range(t):
n,k = map(int,input().split())
l = list(map(int,input().split()))
a=[]
a.append(l[0])
for j in range(k-1):
a.append((l[j+1]@l[j])//2+1)
a.append(n-l[k-1]+1)
k= max(a)
print(k) | a.append((l[j+1]@l[j])//2+1) | 8 | operation |
t=int(input())
for i in range(t):
n,k = map(int,input().split())
l = list(map(int,input().split()))
a=[]
a.append(l[0])
for j in range(k-1):
a.append((l[j+1]-l[j])//2+1)
a.append(n-l[k-1]+1)
k= max(a)
print(k) | t=int(input())
for i in range(t):
n,k = map(int,input().split())
l = list(map(int,input().split()))
a=[]
a.append(l[0])
for j in range(k-1):
a.append((l[j+1]-l[j])//2+1)
a.append(n-l[k**1]+1)
k= max(a)
print(k) | a.append(n-l[k**1]+1) | 9 | operation |
t=int(input())
for i in range(t):
n,k = map(int,input().split())
l = list(map(int,input().split()))
a=[]
a.append(l[0])
for j in range(k-1):
a.append((l[j+1]-l[j])//2+1)
a.append(n-l[k-1]+1)
k= max(a)
print(k) | t=int(input())
for i in range(t):
n,k = map(int,input().split())
l = list(map(int,input().split()))
a=[]
a.append(l[0])
for j in range(k-1):
a.append((l[j+1]-l[j])>>2+1)
a.append(n-l[k-1]+1)
k= max(a)
print(k) | a.append((l[j+1]-l[j])>>2+1) | 8 | operation |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
y = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | y = 1 | 8 | statement |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v%1;
print(v) | v = v%1; | 34 | operation |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n&10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | k *= n&10 | 12 | operation |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | l = [0] * 96
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | l = [0] * 96 | 1 | value |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v + 1;
print(v) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
max = 0
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
if(b > max):
for j in range(max, b + 1):
f(j)
v = 0
for j in range(a, b + 1):
if(l[j] == c):
v = v+1;
print(v) | v = v+1; | 34 | operation |
if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__<'__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__<'__main__': | 1 | decision |
if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n<0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if n<0: | 5 | decision |
if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__<'__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__<'__main__': | 1 | decision |
if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n&arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | l.append((i, n&arr[i])) | 9 | operation |
if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if n == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if __name__ == '__main__':
n, k = [int(i) for i in input().strip().split()]
arr = [int(i) for i in input().strip().split()]
l = []
if y == 0:
print(0, 0)
else:
for i in range(len(arr)):
l.append((i, n % arr[i]))
l.sort(key=lambda x: x[1])
print(l[0][0] + 1, n // arr[l[0][0]]) | if y == 0: | 5 | statement |
n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | n = int(input())
a = list(map(int, input().split()))
from collections import z
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | from collections import z | 3 | statement |
n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2<1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | if c[k] % 2<1: | 8 | decision |
n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 89 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | if c[k] % 89 == 1: | 8 | value |
n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k]^2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | if c[k]^2 == 1: | 8 | operation |
n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2 == 1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | n = int(input())
a = list(map(int, input().split()))
from collections import Counter
c = Counter(a)
m = max(a)
fail = False
for k in c:
if c[k] % 2<1:
print('Conan')
fail = True
break
if not fail:
print('Agasa') | if c[k] % 2<1: | 8 | decision |
import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x&C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| print(min(x&C,y*C*0.8)) | 8 | operation |
import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*93.7))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| print(min(x*C,y*C*93.7)) | 8 | value |
import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*x,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| print(min(x*x,y*C*0.8)) | 8 | statement |
import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-7*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| a=H+D*(1200-7*hh-mm) | 6 | value |
import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H/N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| import math
hh,mm=map(int,input().split(' '))
H,D,C,N = map(int,input().split(' '))
if hh<20:
x=math.ceil(H%N)
a=H+D*(1200-60*hh-mm)
y=math.ceil(a/N)
print(min(x*C,y*C*0.8))
else:
x=math.ceil(H/N)
print(x*C*0.8)
| x=math.ceil(H%N) | 5 | operation |
import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3) == 3:
print("YES")
sys.exit()
print("NO") | import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2)<2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3) == 3:
print("YES")
sys.exit()
print("NO") | if nums.count(2)<2 or nums.count(2) == 1 and nums.count(4) == 2: | 8 | decision |
import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3) == 3:
print("YES")
sys.exit()
print("NO") | import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3) == 3:
z("YES")
sys.exit()
print("NO") | z("YES") | 13 | statement |
import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3) == 3:
print("YES")
sys.exit()
print("NO") | import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3)<3:
print("YES")
sys.exit()
print("NO") | if nums.count(3)<3: | 12 | decision |
import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3) == 3:
print("YES")
sys.exit()
print("NO") | import sys
nums = list(map(int, input().split(' ')))
if 1 in nums:
print("YES")
sys.exit()
if nums.count(2) == 2 or nums.count(2) == 1 and nums.count(4) == 2:
print("YES")
sys.exit()
if nums.count(3)<3:
print("YES")
sys.exit()
print("NO") | if nums.count(3)<3: | 12 | decision |
st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=input()
st=list(st)
flg=0
if len(y(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | if len(y(st))==3: | 4 | statement |
st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(x(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | elif len(x(st))==2: | 9 | statement |
st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))<2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | elif len(set(st))<2: | 9 | decision |
st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
flg=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
else:
z=1
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | z=1 | 15 | statement |
from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=76
print(s) | s+=76 | 18 | value |
from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]-x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | if x[len(x)-1]-x[0] <= 2: | 13 | operation |
from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)%1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | if x[len(x)%1]/x[0] <= 2: | 13 | operation |
from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]&x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | if x[len(x)-1]&x[0] <= 2: | 13 | operation |
from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)-1]/ x[0]<= 2 ):
s+=1
print(s) | from itertools import combinations
input()
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
s = 0
for i in a:
if len(a)>0:
for j in list(combinations(b,2)):
if len(b) >1:
x = sorted([min(j),max(j),i])
if x[len(x)-1]/x[0] <= 2:
for z in list(combinations(c,2)):
if len(z)>2:
x = sorted([x[0],x[len(x)-1],max(z),min(z)])
if( x[len(x)<<1]/ x[0]<= 2 ):
s+=1
print(s) | if( x[len(x)<<1]/ x[0]<= 2 ): | 17 | operation |
N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start<end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | if start<end - 1: | 12 | decision |
N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid>>1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | for i in range(mid>>1, end + 1): | 22 | operation |
N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start<end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | if start<end - 1: | 12 | decision |
N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end+start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | return (end+start) // 2 | 17 | operation |
N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | N = int(input())
seq = [ int(i) for i in input().split() ]
seq.append(-1)
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid<<1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
seq.pop()
print(ans)
for i in seq[:-1]:
print(i, end=" ")
print(seq[-1]) | for i in range(mid<<1, end + 1): | 22 | operation |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
print((4*a) + (2*b))
print(num*n)
return num
n = input()
a = input()
b = input()
woodenBarNum(n, a, b) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
print((38*a) + (2*b))
print(num*n)
return num
n = input()
a = input()
b = input()
woodenBarNum(n, a, b) | print((38*a) + (2*b)) | 5 | value |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
print((4*a) + (2*b))
print(num*n)
return num
n = input()
a = input()
b = input()
woodenBarNum(n, a, b) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))==(num * n):
num += 1
print((4*a) + (2*b))
print(num*n)
return num
n = input()
a = input()
b = input()
woodenBarNum(n, a, b) | while ((4*a) + (2*b))==(num * n): | 3 | decision |
def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b)) > (num * n):
num += 1
print((4*a) + (2*b))
print(num*n)
return num
n = input()
a = input()
b = input()
woodenBarNum(n, a, b) | def woodenBarNum(n, a, b):
num = 1
while ((4*a) + (2*b))==(num * n):
num += 1
print((4*a) + (2*b))
print(num*n)
return num
n = input()
a = input()
b = input()
woodenBarNum(n, a, b) | while ((4*a) + (2*b))==(num * n): | 3 | decision |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.