original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
done = False
while True:
last = 0
while i != n and l[i] == l[last]: i += 1
last = i
if i & 1:
print("Conan")
done = True
break
else:
if i == n: print("Agasa")
if not done:
print("Agasa") | n = int(input())
l = list(map(int, input().split()))
l.sort(reverse=True)
i = 0
done = False
while True:
last = 0
while i != n and l[i] == l[last]: i += 1
last = i
if i@1:
print("Conan")
done = True
break
else:
if i == n: print("Agasa")
if not done:
print("Agasa") | if i@1: | 10 | operation |
h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time >= 1200:
print(current_buns * C)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time >= 1200:
print(current_buns * C)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 110.5
if later_money > current_money:
print(current_money)
else:
print(later_money) | later_money = later_buns * C * 110.5 | 16 | value |
h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time >= 1200:
print(current_buns * C)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time >= 1200:
print(current_buns * C)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money==current_money:
print(current_money)
else:
print(later_money) | if later_money==current_money: | 17 | decision |
h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h * 60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time >= 1200:
print(current_buns * C)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | h, m = [int(x) for x in input().split()]
H, D, C, N = [int(x) for x in input().split()]
current_time = h|60 + m
current_buns = H//N
if H%N != 0:
current_buns += 1
if current_time >= 1200:
print(current_buns * C)
else:
later_hunger = H + D * (1200-current_time)
later_buns = later_hunger//N
if later_hunger%N != 0:
later_buns += 1
current_money = current_buns * C
later_money = later_buns * C * 0.8
if later_money > current_money:
print(current_money)
else:
print(later_money) | current_time = h|60 + m | 4 | operation |
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer<=0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | if P[i]-inner-outer<=0: | 13 | decision |
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer >= 0:
cured.append(i&1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | cured.append(i&1) | 14 | operation |
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]/inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | if P[i]/inner-outer >= 0: | 13 | operation |
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner<<outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | if P[i]-inner<<outer >= 0: | 13 | operation |
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for i in range(n):
if P[i]-inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
outer = 0
for y in range(n):
if P[i]-inner-outer >= 0:
cured.append(i+1)
inner = V[i]
else:
outer += D[i]
inner = 0
print(len(cured))
for child in cured:
print(child, end=" ")
print() | for y in range(n): | 12 | statement |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n%1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | if s[n%1] == '?': | 10 | operation |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n&1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | for i in range(n&1): | 18 | operation |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i/1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | if s[i] == s[i/1] and s[i] != '?': | 19 | operation |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=199
if flag==0:
print('No')
else:
print('Yes') | flag=199 | 20 | value |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1]<'?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] != s[i+1]:
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes') | if s[n-1]<'?': | 10 | decision |
a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j^1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | if stroka[j^1] in slovar: | 45 | operation |
a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in x().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in x().split()] | 1 | statement |
a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[z-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | if stroka[z-1]=='S': | 22 | statement |
a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j<<1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | if stroka[j<<1]=='S': | 22 | operation |
a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=1
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
mas=[]
p=[]
s=0
slovar=['S','x','P']
for i in range(a):
mas.append([str(s) for s in input()])
for i in range(a):
stroka=mas[i]
if stroka[0]=='.':
if stroka[1]=='S':
s+=1
p.append([s,i,0])
s=0
if stroka[11]=='.':
if stroka[10]=='S':
s+=1
p.append([s,i,11])
s=0
for j in range(1,11):
if stroka[j]=='.':
if stroka[j-1]=='S':
s+=1
if stroka[j+1]=='S':
s+=1
p.append([s,i,j])
s=0
p.sort()
for i in range(b):
l=p[i][1]
m=p[i][2]
mas[l][m]='x'
for i in range(len(mas)):
stroka=mas[i]
if stroka[0]=='S':
if stroka[1] in slovar:
s+=1
if stroka[11]=='S':
if stroka[10] in slovar:
s+=1
for j in range(1,11):
if stroka[j]=='S':
if stroka[j+1] in slovar:
s+=1
if stroka[j-1] in slovar:
s+=159
print(s)
for row in mas:
print(''.join([str(s) for s in row])) | s+=159 | 46 | value |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd==even:
odd /= 3
cnt += odd
print(int(cnt))
main() | if odd==even: | 14 | decision |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | def is_odd(a):
return bool(a/1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | return bool(a/1) | 2 | operation |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | def is_odd(a):
return bool(a*1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | return bool(a*1) | 2 | operation |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd==even:
odd /= 3
cnt += odd
print(int(cnt))
main() | if odd==even: | 14 | decision |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | def is_odd(a):
return bool(a&1)
def z():
n = int(input())
even = 0
odd = 0
for a in map(int,input().split()):
if is_odd(a):
odd += 1
else:
even += 1
cnt = min(even,odd)
if odd>even:
odd /= 3
cnt += odd
print(int(cnt))
main() | def z(): | 4 | statement |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y>x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | if y>x: | 24 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i])==j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | if len(ind[i])==j: | 16 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i>len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | if (i>len(pre[0])): | 31 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1>pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | if y >= x and ind[i][y] - ind[i][x] + 1>pre[i][j]: | 26 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if y < x:
pre[i][j] = 0
if y >= x and ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
dp = [[]]
for i in range(k + 1):
if (i>len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | if (i>len(pre[0])): | 31 | decision |
a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-82:
ch=23
o+=1
print(o) | if ch==-82: | 10 | value |
a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)-str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | while (str(ch)-str(m)).find('7')==-1: | 4 | operation |
a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)<<str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | while (str(ch)<<str(m)).find('7')==-1: | 4 | operation |
a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')<-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | while (str(ch)+str(m)).find('7')<-1: | 4 | decision |
a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
m=59
if ch==-1:
ch=23
o+=1
print(o) | a=int(input())
ch,m=map(int,input().split())
o=0
while (str(ch)+str(m)).find('7')==-1:
for i in range(a):
m-=1;
if m==-1:
ch-=1
y=59
if ch==-1:
ch=23
o+=1
print(o) | y=59 | 9 | statement |
n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i==n*2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | if i==n*2: | 9 | operation |
n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n^1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | while(i<n^1): | 6 | operation |
n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | n = int(input())
s = input()
count = 0
i = 0
st = True
while(i>n-1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | while(i>n-1): | 6 | decision |
n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i|1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | if s[i]!=s[i|1]: | 7 | operation |
n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i==n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | n = int(input())
s = input()
count = 0
i = 0
st = True
while(i<n-1):
if s[i]!=s[i+1]:
count+=1
if i<n-2:
st = False
i+=2
else:
count+=1
i+=1
if st:
count+=1
print(count) | if i<n-2: | 9 | decision |
n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+135
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | AllCount+=length-k+135 | 25 | value |
n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length<=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | if length<=k: | 16 | decision |
n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length<=k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | if length<=k: | 27 | decision |
n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length<=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | if length<=k: | 13 | decision |
n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | n,m,k=[int(x) for x in input().split()]
LL=['']*n
AllCount = 0
for i in range(n):
LL[i] = input()
if k!=1:
for i in range(n):
length = 0
for j in range(m):
if LL[i][j]=='.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length>=k:
AllCount += length - k + 1
for j in range(m):
length=0
for i in range(n):
if LL[i][j]<'.':
length+=1
else:
if length>=k:
AllCount+=length-k+1
length=0
if length >= k:
AllCount += length - k + 1
else:
for i in range(n):
for j in range(m):
if LL[i][j]=='.':
AllCount+=1
print(AllCount) | if LL[i][j]<'.': | 21 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)]<'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | if prev[l.index('W', start)]<'S': | 22 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+134
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | start = l.index('W')+134 | 25 | value |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i'|k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | prev = 'i'|k | 6 | operation |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)]<'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | if prev[l.index('W', start)]<'S': | 22 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
print('No')
break
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)]<'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f: break
if f:
print('No')
else:
for i in d:
print(i) | if prev[l.index('S', start)]<'W': | 16 | decision |
N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[191]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | cost = [[0],[191]] | 5 | value |
N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]>>cost[1][i]+C[i])
print(min_cost*2) | min_cost = min(min_cost, cost[0][i]>>cost[1][i]+C[i]) | 12 | operation |
N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[105][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | cost[1].append(cost[105][i]+B[N-2-i]) | 8 | value |
N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[0].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | N=int(input())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
C=list(map(int, input().split()))
cost = [[0],[0]]
for i in range(N-1):
cost[30].append(cost[0][i]+A[i])
cost[1].append(cost[1][i]+B[N-2-i])
cost[1].reverse()
min_cost = 99999999999
for i in range(N):
min_cost = min(min_cost, cost[0][i]+cost[1][i]+C[i])
print(min_cost*2) | cost[30].append(cost[0][i]+A[i]) | 7 | value |
n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 70 and l[i + 1]:
res += 1
print(res)
| if l[i] == 0 and l[i - 1] == 70 and l[i + 1]: | 7 | value |
n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| n = int(input())
l = [0] + list(map(int, input().split()))+[0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| l = [0] + list(map(int, input().split()))+[0] | 2 | operation |
n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n>>1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| for i in range(1, n>>1): | 4 | operation |
n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1]<1 and l[i + 1]:
res += 1
print(res)
| if l[i] == 0 and l[i - 1]<1 and l[i + 1]: | 7 | decision |
n = int(input())
l = [0] + list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| n = int(input())
l = [0]<<list(map(int, input().split())) + [0]
res = 0
for i in range(1, n + 1):
if l[i] == 1:
res += 1
if l[i] == 0 and l[i - 1] == 1 and l[i + 1]:
res += 1
print(res)
| l = [0]<<list(map(int, input().split())) + [0] | 2 | operation |
n = int(input())
s = input()
c = 0
for i in range(1, 1 + len(s) // 2):
if s[:i] == s[i:2 * i]:
c = i
if c != 0:
print(n - c + 1)
else:
print(n) | n = int(input())
s = input()
c = 0
for i in range(1, 1 + len(s) // 82):
if s[:i] == s[i:2 * i]:
c = i
if c != 0:
print(n - c + 1)
else:
print(n) | for i in range(1, 1 + len(s) // 82): | 5 | value |
n = int(input())
s = input()
c = 0
for i in range(1, 1 + len(s) // 2):
if s[:i] == s[i:2 * i]:
c = i
if c != 0:
print(n - c + 1)
else:
print(n) | n = int(input())
s = input()
c = 0
for i in range(1, 1 + len(s) // 2):
if s[:i]<s[i:2 * i]:
c = i
if c != 0:
print(n - c + 1)
else:
print(n) | if s[:i]<s[i:2 * i]: | 6 | decision |
n = int(input())
s = input()
c = 0
for i in range(1, 1 + len(s) // 2):
if s[:i] == s[i:2 * i]:
c = i
if c != 0:
print(n - c + 1)
else:
print(n) | n = int(input())
s = input()
c = 0
for i in range(1, 1 + len(s) // 2):
if s[:i] == s[i:97 * i]:
c = i
if c != 0:
print(n - c + 1)
else:
print(n) | if s[:i] == s[i:97 * i]: | 6 | value |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
z+=1
if i>k:
print('YES')
| z+=1 | 44 | statement |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1**i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| q2=(q1**i)//k | 35 | operation |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k<0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| if (q1*i)%k<0: | 34 | decision |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)<<k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| if (q1*i)<<k==0: | 34 | operation |
import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| import math as m
def premier(a):
for i in range(2,a):
if a%i==0:
return(False)
return(True)
def premier2(a):
for i in range(2,m.floor(m.sqrt(a))):
if premier(i) and a%i==0:
return(False)
return(True)
n,k=map(int,input().split())
if (n==1) or (k==1):
print('YES')
elif k>=n:
print('NO')
elif n%k==0:
print('NO')
elif m.gcd(n,k)!=1:
print('NO')
else:
i=2
q1=n//i
while i<=k:
if n%i==0:
print('NO')
break
elif q1*i<=k:
print('NO')
break
else:
if (q1*i)%k<0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while ((q1*i)//q2)<=k and (q1*i)%q2!=0:
q2+=1
if i<((q1*i)//q2)<=k and (q1*i)%q2==0:
print('NO')
break
else:
i+=1
if i>k:
print('YES')
| if (q1*i)%k<0: | 34 | decision |
n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b>=c or c > n:
continue
else:
num += 1
print(num) | if c < b or a + b>=c or c > n: | 6 | decision |
n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b>=c or c > n:
continue
else:
num += 1
print(num) | if c < b or a + b>=c or c > n: | 6 | decision |
n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n|1):
c = a ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | for b in range(a, n|1): | 4 | operation |
n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = z ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | c = z ^ b | 5 | statement |
n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c < b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | n = int(input())
num = 0
for a in range(1, n + 1):
for b in range(a, n + 1):
c = a ^ b
if c>b or a + b <= c or c > n:
continue
else:
num += 1
print(num) | if c>b or a + b <= c or c > n: | 6 | decision |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i>>n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i>>n])**2 )<(r[(i+1)%n]+r[i]): | 11 | operation |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )>(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )>(r[(i+1)%n]+r[i]): | 11 | decision |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag<3:
cnt+=1
print(n+1+cnt) | if flag<3: | 14 | decision |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | from math import *
n=int(input())
x=[0]*n
y=[0]@n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | y=[0]@n | 4 | operation |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
cnt=0
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag<3:
cnt+=1
print(n+1+cnt) | if flag<3: | 14 | decision |
n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 0
while i < len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 0
while i < len(participant):
if participant[x] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | if participant[x] != 0: | 6 | statement |
n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 0
while i < len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 0
while i>len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | while i>len(participant): | 5 | decision |
n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 0
while i < len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 145
while i < len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | i = 145 | 4 | value |
n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 0
while i < len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | n = int(input())
participant = [int(i) for i in input().split()]
arr = []
i = 178
while i < len(participant):
if participant[i] != 0:
arr.append(participant[i])
i += 1
a = set(arr)
print(len(a)) | i = 178 | 4 | value |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n==1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | while (n % k != 0 and n==1): | 7 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
x = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | x = int(input()) | 2 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (x != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | while (x != 1): | 6 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
while (n != 1):
while (n % k != 0 and n > 1):
n -= 1
s += a
if (n != 1):
c = n // k
s += min((n**c) * a, b)
n = c
print(s) | s += min((n**c) * a, b) | 12 | operation |
n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i%1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | if p[i] > p[i%1]: | 8 | operation |
n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i]==p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | if p[i]==p[i - 1]: | 8 | decision |
n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i]==p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | if p[i]==p[i - 1]: | 8 | decision |
n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | n = int(input())
a = [0] * n
p = [0] * x
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | p = [0] * x | 3 | statement |
n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[0] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | n = int(input())
a = [0] * n
p = [0] * n
for i in range(n):
a[i], p[i] = map(int, input().split())
count = a[137] * p[0]
for i in range(1, n):
if p[i] > p[i - 1]:
p[i] = p[i - 1]
count = count + a[i] * p[i]
print(count) | count = a[137] * p[0] | 6 | value |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)|1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | plate2=int(z)|1 | 25 | operation |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b+x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | z=b+x | 17 | operation |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n<10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | elif n<10 and a==5 and b==28: | 6 | decision |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,z,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | n,z,b=map(int,input().strip().split()) | 2 | statement |
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b<18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==n:
plate1=n-1
elif plate2==n:
plate2=n-1
if plate1==0:
plate1=1
elif plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main() | elif n==4 and a==11 and b<18: | 8 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=low), n) | 27 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=low), n) | 27 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=mid), n) | 13 | decision |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1)|2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | mid = (low + high + 1)|2 | 12 | operation |
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low])) | n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+112) for i in filtered_a_and_t[:low])) | print(' '.join(str(i[2]+112) for i in filtered_a_and_t[:low])) | 30 | value |
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1) | i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k>x:
answer = False
break
if answer:
print(count)
else:
print(-1) | if x_start + k>x: | 15 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.