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 |
|---|---|---|---|---|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c@1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
deeper(project[0] + ' ' + str(project[1]), c@1)
| 14 |
operation
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2]<res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
elif project[2]<res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
| 37 |
decision
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km>spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
elif spisoksostanovkami[i] + km>spisoksostanovkami[j] and l == spisoksostanovkami[i]:
| 25 |
decision
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j%1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
if spisoksostanovkami[i] + km < spisoksostanovkami[j%1]:
| 22 |
operation
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[y-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
spisok.append(spisoksostanovkami[y-1])
| 15 |
statement
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[x] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
elif spisoksostanovkami[i] + km < spisoksostanovkami[x] and l == spisoksostanovkami[i]:
| 25 |
statement
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
ostanovki, km = list(map(int, input().split()))
spisoksostanovkami = list(map(int, input().split()))
k = 0
l = 0
spisok = []
spisoksostanovkami += [-10]
for i in range(ostanovki):
for j in range(ostanovki):
if spisoksostanovkami[i] + km == spisoksostanovkami[j] and i == 0:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
break
elif spisoksostanovkami[i] + km < spisoksostanovkami[j] and i == 0:
if spisoksostanovkami[i] + km > spisoksostanovkami[j-1] and spisoksostanovkami[i] != spisoksostanovkami[j-1]:
spisok.append(spisoksostanovkami[j-1])
l = spisoksostanovkami[j-1]
break
elif spisoksostanovkami[i] + km == spisoksostanovkami[j] and l == spisoksostanovkami[i] and l != spisoksostanovkami[j]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km > spisoksostanovkami[j] and l == spisoksostanovkami[i]:
if spisoksostanovkami[i] + km < spisoksostanovkami[j+1]:
spisok.append(spisoksostanovkami[j])
l = spisoksostanovkami[j]
elif spisoksostanovkami[i] + km < x[j] and l == spisoksostanovkami[i]:
spisok.append(-1)
break
if len(spisok) == 0 or -1 in spisok:
print(-1)
else:
print(len(spisok))
|
elif spisoksostanovkami[i] + km < x[j] and l == spisoksostanovkami[i]:
| 25 |
statement
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 158) * 2)
print(a(*inpt()))
|
return int((max(l,r) + (a - add) / 158) * 2)
| 12 |
value
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 7 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
return 7 * (mi + a)
| 9 |
value
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a>=max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
if mi + a>=max(l, r):
| 8 |
decision
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + x <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
if mi + x <= max(l, r):
| 8 |
statement
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r) + (a - add) / 2) * 2)
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, r, a):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return int((max(l,r)^(a - add) / 2) * 2)
print(a(*inpt()))
|
return int((max(l,r)^(a - add) / 2) * 2)
| 12 |
operation
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)>80):
print("Conan")
else:
print("Agasa")
|
if(len(b)>80):
| 8 |
value
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c&2):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
if(c&2):
| 5 |
operation
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)==2):
print("Conan")
else:
print("Agasa")
|
if(len(b)==2):
| 8 |
decision
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)==2):
print("Conan")
else:
print("Agasa")
|
if(len(b)==2):
| 8 |
decision
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%2):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c%139):
print("Conan")
else:
if(len(b)>2):
print("Conan")
else:
print("Agasa")
|
if(c%139):
| 5 |
value
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 0:
count = count - 1
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 146:
count = count - 1
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
while temp != (i + 1) and count != 146:
| 7 |
value
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 0:
count = count - 1
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 0:
count = count - 1
temp = love[temp&1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
temp = love[temp&1]
| 9 |
operation
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 0:
count = count - 1
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i>>1) and count != 0:
count = count - 1
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
while temp != (i>>1) and count != 0:
| 7 |
operation
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 0:
count = count - 1
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
import sys
total = int(input())
love = [int(x) for x in input().split()]
for i in range(len(love)):
count = 2
temp = love[i]
while temp != (i + 1) and count != 0:
count = count - 191
temp = love[temp - 1]
if temp == (i + 1) and count == 0:
print("YES")
sys.exit()
print("NO")
|
count = count - 191
| 8 |
value
|
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
a.sort()
i = 1
st = '1'
pos = n-1
res = ''
while(n!=0):
count=0
for i in a[::-1]:
if i!=a[-1]:
break
else:
count+=1
if count==1:
res = st
break
else:
if n==count:
if count%2==0:
if st =='1':
res = '2'
break
else:
res = '1'
break
else:
if st =='1':
res = '1'
break
else:
res = '2'
break
elif n-1-count<0:
if st=='1':
res = '2'
break
else:
res = '1'
break
else:
n-=count
if st=='1':
st='2'
res = '1'
else:
st='1'
res = '2'
if res=='1':
print('Conan')
else:
print('Agasa')
|
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
a.sort()
i = 1
st = '1'
pos = n-1
res = ''
while(n!=0):
count=0
for i in a[::-1]:
if i!=a[-1]:
break
else:
count+=1
if count==1:
res = st
break
else:
if n==count:
if count%2==0:
if st =='1':
res = '2'
break
else:
res = '1'
break
else:
if st =='1':
res = '1'
break
else:
res = '2'
break
elif n-1-count<0:
if st<'1':
res = '2'
break
else:
res = '1'
break
else:
n-=count
if st=='1':
st='2'
res = '1'
else:
st='1'
res = '2'
if res=='1':
print('Conan')
else:
print('Agasa')
|
if st<'1':
| 39 |
decision
|
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
a.sort()
i = 1
st = '1'
pos = n-1
res = ''
while(n!=0):
count=0
for i in a[::-1]:
if i!=a[-1]:
break
else:
count+=1
if count==1:
res = st
break
else:
if n==count:
if count%2==0:
if st =='1':
res = '2'
break
else:
res = '1'
break
else:
if st =='1':
res = '1'
break
else:
res = '2'
break
elif n-1-count<0:
if st=='1':
res = '2'
break
else:
res = '1'
break
else:
n-=count
if st=='1':
st='2'
res = '1'
else:
st='1'
res = '2'
if res=='1':
print('Conan')
else:
print('Agasa')
|
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
a.sort()
i = 1
st = '1'
pos = n-1
res = ''
while(n!=0):
count=0
for i in a[::-1]:
if i!=a[-1]:
break
else:
count+=1
if count==1:
res = st
break
else:
if z==count:
if count%2==0:
if st =='1':
res = '2'
break
else:
res = '1'
break
else:
if st =='1':
res = '1'
break
else:
res = '2'
break
elif n-1-count<0:
if st=='1':
res = '2'
break
else:
res = '1'
break
else:
n-=count
if st=='1':
st='2'
res = '1'
else:
st='1'
res = '2'
if res=='1':
print('Conan')
else:
print('Agasa')
|
if z==count:
| 22 |
statement
|
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
a.sort()
i = 1
st = '1'
pos = n-1
res = ''
while(n!=0):
count=0
for i in a[::-1]:
if i!=a[-1]:
break
else:
count+=1
if count==1:
res = st
break
else:
if n==count:
if count%2==0:
if st =='1':
res = '2'
break
else:
res = '1'
break
else:
if st =='1':
res = '1'
break
else:
res = '2'
break
elif n-1-count<0:
if st=='1':
res = '2'
break
else:
res = '1'
break
else:
n-=count
if st=='1':
st='2'
res = '1'
else:
st='1'
res = '2'
if res=='1':
print('Conan')
else:
print('Agasa')
|
n = int(input())
s = input().split()
a = []
for i in s:
a.append(int(i))
a.sort()
i = 1
st = '1'
pos = n-1
res = ''
while(n!=0):
count=0
for i in a[::-1]:
if i!=a[-1]:
break
else:
count+=1
if count==1:
res = st
break
else:
if n==count:
if count%2<0:
if st =='1':
res = '2'
break
else:
res = '1'
break
else:
if st =='1':
res = '1'
break
else:
res = '2'
break
elif n-1-count<0:
if st=='1':
res = '2'
break
else:
res = '1'
break
else:
n-=count
if st=='1':
st='2'
res = '1'
else:
st='1'
res = '2'
if res=='1':
print('Conan')
else:
print('Agasa')
|
if count%2<0:
| 23 |
decision
|
n = int(input())
graph = {}
inp = input().split()
p = (inp[0], int(inp[1]))
pv = set()
q = int(input())
for i in range(q):
inp = input().split()
v = (inp[0], int(inp[1]))
pv.add(v)
for i in range(n - 1):
passs = input()
inp = input().split()
v = (inp[0], int(inp[1]))
graph[v] = set()
q = int(input())
for j in range(q):
inp = input().split()
vj = (inp[0], int(inp[1]))
graph[v].add(vj)
graph[p] = pv
used = {v[0]: False for v in graph}
used[p[0]] = True
parents = [p]
polic = []
while parents != []:
new_parents = []
new_names = {}
for parent in parents:
for child in graph[parent]:
if not used[child[0]]:
if child[0] not in new_names:
new_names[child[0]] = child[1]
else:
if child[1] > new_names[child[0]]:
new_names[child[0]] = child[1]
used[child[0]] = True
for v in new_names:
new_parents.append((v, new_names[v],))
parents = new_parents
polic += parents
polic.sort()
print(len(polic))
print(*polic, sep='\n')
|
n = int(input())
graph = {}
inp = input().split()
p = (inp[0], int(inp[1]))
pv = set()
q = int(input())
for i in range(q):
inp = input().split()
v = (inp[0], int(inp[1]))
pv.add(v)
for i in range(n - 1):
passs = input()
inp = input().split()
v = (inp[0], int(inp[1]))
graph[v] = set()
q = int(input())
for j in range(q):
inp = input().split()
vj = (inp[0], int(z[1]))
graph[v].add(vj)
graph[p] = pv
used = {v[0]: False for v in graph}
used[p[0]] = True
parents = [p]
polic = []
while parents != []:
new_parents = []
new_names = {}
for parent in parents:
for child in graph[parent]:
if not used[child[0]]:
if child[0] not in new_names:
new_names[child[0]] = child[1]
else:
if child[1] > new_names[child[0]]:
new_names[child[0]] = child[1]
used[child[0]] = True
for v in new_names:
new_parents.append((v, new_names[v],))
parents = new_parents
polic += parents
polic.sort()
print(len(polic))
print(*polic, sep='\n')
|
vj = (inp[0], int(z[1]))
| 19 |
statement
|
n = int(input())
graph = {}
inp = input().split()
p = (inp[0], int(inp[1]))
pv = set()
q = int(input())
for i in range(q):
inp = input().split()
v = (inp[0], int(inp[1]))
pv.add(v)
for i in range(n - 1):
passs = input()
inp = input().split()
v = (inp[0], int(inp[1]))
graph[v] = set()
q = int(input())
for j in range(q):
inp = input().split()
vj = (inp[0], int(inp[1]))
graph[v].add(vj)
graph[p] = pv
used = {v[0]: False for v in graph}
used[p[0]] = True
parents = [p]
polic = []
while parents != []:
new_parents = []
new_names = {}
for parent in parents:
for child in graph[parent]:
if not used[child[0]]:
if child[0] not in new_names:
new_names[child[0]] = child[1]
else:
if child[1] > new_names[child[0]]:
new_names[child[0]] = child[1]
used[child[0]] = True
for v in new_names:
new_parents.append((v, new_names[v],))
parents = new_parents
polic += parents
polic.sort()
print(len(polic))
print(*polic, sep='\n')
|
n = int(input())
graph = {}
inp = input().split()
p = (inp[0], int(inp[1]))
pv = set()
q = int(input())
for i in range(q):
inp = input().split()
v = (inp[0], int(inp[1]))
pv.add(v)
for i in range(n^1):
passs = input()
inp = input().split()
v = (inp[0], int(inp[1]))
graph[v] = set()
q = int(input())
for j in range(q):
inp = input().split()
vj = (inp[0], int(inp[1]))
graph[v].add(vj)
graph[p] = pv
used = {v[0]: False for v in graph}
used[p[0]] = True
parents = [p]
polic = []
while parents != []:
new_parents = []
new_names = {}
for parent in parents:
for child in graph[parent]:
if not used[child[0]]:
if child[0] not in new_names:
new_names[child[0]] = child[1]
else:
if child[1] > new_names[child[0]]:
new_names[child[0]] = child[1]
used[child[0]] = True
for v in new_names:
new_parents.append((v, new_names[v],))
parents = new_parents
polic += parents
polic.sort()
print(len(polic))
print(*polic, sep='\n')
|
for i in range(n^1):
| 11 |
operation
|
n = int(input())
graph = {}
inp = input().split()
p = (inp[0], int(inp[1]))
pv = set()
q = int(input())
for i in range(q):
inp = input().split()
v = (inp[0], int(inp[1]))
pv.add(v)
for i in range(n - 1):
passs = input()
inp = input().split()
v = (inp[0], int(inp[1]))
graph[v] = set()
q = int(input())
for j in range(q):
inp = input().split()
vj = (inp[0], int(inp[1]))
graph[v].add(vj)
graph[p] = pv
used = {v[0]: False for v in graph}
used[p[0]] = True
parents = [p]
polic = []
while parents != []:
new_parents = []
new_names = {}
for parent in parents:
for child in graph[parent]:
if not used[child[0]]:
if child[0] not in new_names:
new_names[child[0]] = child[1]
else:
if child[1] > new_names[child[0]]:
new_names[child[0]] = child[1]
used[child[0]] = True
for v in new_names:
new_parents.append((v, new_names[v],))
parents = new_parents
polic += parents
polic.sort()
print(len(polic))
print(*polic, sep='\n')
|
n = int(input())
graph = {}
inp = input().split()
p = (inp[0], int(inp[1]))
pv = set()
q = int(input())
for i in range(q):
inp = input().split()
v = (inp[0], int(inp[1]))
pv.add(v)
for i in range(n - 1):
passs = input()
inp = input().split()
v = (inp[0], int(inp[1]))
graph[v] = set()
q = int(input())
for j in range(q):
inp = input().split()
vj = (inp[0], int(inp[1]))
graph[v].add(vj)
graph[p] = pv
used = {v[0]: False for v in graph}
used[p[0]] = True
parents = [p]
polic = []
while parents != []:
new_parents = []
new_names = {}
for parent in parents:
for child in graph[parent]:
if not used[child[0]]:
if child[0] not in new_names:
new_names[child[0]] = child[1]
else:
if child[1]==new_names[child[0]]:
new_names[child[0]] = child[1]
used[child[0]] = True
for v in new_names:
new_parents.append((v, new_names[v],))
parents = new_parents
polic += parents
polic.sort()
print(len(polic))
print(*polic, sep='\n')
|
if child[1]==new_names[child[0]]:
| 37 |
decision
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 78) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
print((n - 78) * A)
| 3 |
value
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1>>mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
if (1>>mid) * pw > n:
| 13 |
operation
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * z > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
if (1 + mid) * z > n:
| 13 |
statement
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw==n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
if (1 + mid) * pw==n:
| 13 |
decision
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 1) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
n, k, A, B = int(input()), int(input()), int(input()), int(input())
if k == 1:
print((n - 134) * A)
else:
ans = (n - 1) * A
for i in range(1, 64):
pw = k ** i
if pw > n:
break
left, right = 0, 10 ** 10
while left != right - 1:
mid = (left + right) // 2
if (1 + mid) * pw > n:
right = mid
else:
left = mid
ans = min(ans, i * B + (n - (1 + left) * pw) * A + left * A)
print(ans)
|
print((n - 134) * A)
| 3 |
value
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i]<x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
if alf[i]<x:
| 12 |
decision
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i]<x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
if alf[i]<x:
| 12 |
decision
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i]<x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
if alf[i]<x:
| 12 |
decision
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97-i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
alf[i] = chr(97-i)
| 3 |
operation
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 97]
print(ans)
|
alf = ['']*26
for i in range(26):
alf[i] = chr(97+i)
l = list(map(int, input().split()))
n,m = l[0],l[1]
s = input()
for i in range(m):
z = list(input().split())
x,y = z[0],z[1]
for i in range(26):
if alf[i] == x:
alf[i] = y
elif alf[i] == y:
alf[i] = x
ans = ''
for j in range(n):
ans += alf[ord(s[j]) - 19]
print(ans)
|
ans += alf[ord(s[j]) - 19]
| 18 |
value
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i * j)
arr.sort()
print(arr[-2])
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i/j)
arr.sort()
print(arr[-2])
|
arr.append(i/j)
| 8 |
operation
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i * j)
arr.sort()
print(arr[-2])
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i//j)
arr.sort()
print(arr[-2])
|
arr.append(i//j)
| 8 |
operation
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i * j)
arr.sort()
print(arr[-2])
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i|j)
arr.sort()
print(arr[-2])
|
arr.append(i|j)
| 8 |
operation
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i * j)
arr.sort()
print(arr[-2])
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i*j)
arr.sort()
print(arr[-2])
|
arr.append(i*j)
| 8 |
operation
|
if __name__ == '__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i * j)
arr.sort()
print(arr[-2])
|
if __name__<'__main__':
n, m = [int(i) for i in input().strip().split()]
a1 = [int(i) for i in input().strip().split()]
a2 = [int(i) for i in input().strip().split()]
arr = []
for i in a1:
for j in a2:
arr.append(i * j)
arr.sort()
print(arr[-2])
|
if __name__<'__main__':
| 1 |
decision
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
cc = int(y())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
cc = int(y())
| 1 |
statement
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag<0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
if flag<0:
| 9 |
decision
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]<"?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
if dd[i+1]<"?":
| 19 |
decision
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]<dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
if dd[i-1]<dd[i+1]:
| 24 |
decision
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]==dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
cc = int(input())
dd = input()
flag=0
for i in range(1,cc):
if dd[i]!='?' and dd[i]==dd[i-1]:
print("No")
flag=1
break
if flag==0:
if dd[0]=='?':
print("Yes")
elif dd[cc-1]=='?':
print("Yes")
else:
count = 1
flag =1
for i in range(0,cc):
if dd[i]=="?":
if dd[i+1]=="?":
print("Yes")
flag=0
break
else:
if dd[i-1]<dd[i+1]:
print("Yes")
flag=0
break
if flag==1:
print("No")
|
if dd[i-1]<dd[i+1]:
| 24 |
decision
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i+1
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i%1
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
v[0] = i%1
| 8 |
operation
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i+1
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i+1
for i, v in enumerate(tb):
if i+1==v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
if i+1==v[1]:
| 11 |
decision
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i+1
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i<<1
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
v[0] = i<<1
| 8 |
operation
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i+1
for i, v in enumerate(tb):
if i+1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
for i in range(int(input())):
n = int(input())
tb = []
for i in range(n):
tb.append([int(i) for i in input().split()])
for i, v in enumerate(tb):
v[0] = i+1
for i, v in enumerate(tb):
if i**1 > v[1]:
for j in range(i+1, n):
tb[j][0] -= 1
res = []
for i, v in enumerate(tb):
if i+1 > v[1]:
res.append(0)
else:
res.append(v[0])
print(*res)
|
if i**1 > v[1]:
| 11 |
operation
|
str=input()
length=len(str)
ans=0
for i in range(length):
l=0
cnt=0
for j in range(i,length):
if str[j]=='(':
l+=1
elif str[j]==')':
l-=1
else:
cnt+=1
l-=1
if l==0:
ans+=1
elif l<0 and cnt>0:
cnt-=1
l+=2
elif l>0:
continue
elif l<0 and cnt==0:
break
print(ans)
|
str=input()
length=len(str)
ans=0
for i in range(length):
l=0
cnt=0
for j in range(i,length):
if str[j]=='(':
l+=1
elif str[j]==')':
l-=1
else:
cnt+=1
l-=1
if l<0:
ans+=1
elif l<0 and cnt>0:
cnt-=1
l+=2
elif l>0:
continue
elif l<0 and cnt==0:
break
print(ans)
|
if l<0:
| 15 |
decision
|
str=input()
length=len(str)
ans=0
for i in range(length):
l=0
cnt=0
for j in range(i,length):
if str[j]=='(':
l+=1
elif str[j]==')':
l-=1
else:
cnt+=1
l-=1
if l==0:
ans+=1
elif l<0 and cnt>0:
cnt-=1
l+=2
elif l>0:
continue
elif l<0 and cnt==0:
break
print(ans)
|
str=input()
length=len(str)
ans=0
for i in range(length):
l=0
cnt=0
for j in range(i,length):
if str[j]=='(':
l+=1
elif str[j]==')':
l-=1
else:
cnt+=1
l-=1
if l==0:
ans+=1
elif l<0 and cnt>0:
cnt-=1
l+=2
elif l==0:
continue
elif l<0 and cnt==0:
break
print(ans)
|
elif l==0:
| 20 |
decision
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
x, y = y(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
x, y = y(int, input().split())
| 1 |
statement
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
x, y = map(int, input().split())
if (x > 0 and y<1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
if (x > 0 and y<1) or (y == 0):
| 3 |
decision
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 104])
|
print(('No', 'Yes')[(x - a) % 2 == 104])
| 13 |
value
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x@a) % 2 == 0])
|
print(('No', 'Yes')[(x@a) % 2 == 0])
| 13 |
operation
|
x, y = map(int, input().split())
if (x > 0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
x, y = map(int, input().split())
if (x==0 and y == 1) or (y == 0):
print('No')
else:
a, b = y - 1, y
if a > x:
print('No')
else:
print(('No', 'Yes')[(x - a) % 2 == 0])
|
if (x==0 and y == 1) or (y == 0):
| 3 |
decision
|
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l != 1 and r != n and ( pos < l or pos > r ):
res = min( (abs(pos - l) + 1 + abs(r-l)+1), abs(r - pos)+1 + abs(r-l)+1)
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res)
|
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r&l + 1 )
elif l != 1 and r != n and ( pos < l or pos > r ):
res = min( (abs(pos - l) + 1 + abs(r-l)+1), abs(r - pos)+1 + abs(r-l)+1)
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res)
|
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r&l + 1 )
| 8 |
operation
|
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l != 1 and r != n and ( pos < l or pos > r ):
res = min( (abs(pos - l) + 1 + abs(r-l)+1), abs(r - pos)+1 + abs(r-l)+1)
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res)
|
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l != 1 and r != n and ( pos < l or pos==r ):
res = min( (abs(pos - l) + 1 + abs(r-l)+1), abs(r - pos)+1 + abs(r-l)+1)
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res)
|
elif l != 1 and r != n and ( pos < l or pos==r ):
| 10 |
decision
|
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l != 1 and r != n and ( pos < l or pos > r ):
res = min( (abs(pos - l) + 1 + abs(r-l)+1), abs(r - pos)+1 + abs(r-l)+1)
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res)
|
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l != 1 and r != n and ( pos < l or pos==r ):
res = min( (abs(pos - l) + 1 + abs(r-l)+1), abs(r - pos)+1 + abs(r-l)+1)
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res)
|
elif l != 1 and r != n and ( pos < l or pos==r ):
| 10 |
decision
|
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
cur_sum_x, cur_sum_y = x[0], y[0]
ans = 0
xi , yi = 1, 1
while xi <= len(x) and yi <= len(y):
if cur_sum_x == cur_sum_y and cur_sum_x != 0:
ans += 1
if xi < len(x) and yi < len(x):
cur_sum_x, cur_sum_y = x[xi], y[yi]
xi += 1
yi += 1
else:
if cur_sum_x < cur_sum_y:
cur_sum_x += x[xi]
xi += 1
else:
cur_sum_y += y[yi]
yi += 1
print(ans)
|
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
cur_sum_x, cur_sum_y = x[0], y[0]
ans = 0
xi , yi = 1, 1
while xi <= len(x) and yi <= len(y):
if cur_sum_x == cur_sum_y and cur_sum_x != 0:
ans += 1
if xi>len(x) and yi < len(x):
cur_sum_x, cur_sum_y = x[xi], y[yi]
xi += 1
yi += 1
else:
if cur_sum_x < cur_sum_y:
cur_sum_x += x[xi]
xi += 1
else:
cur_sum_y += y[yi]
yi += 1
print(ans)
|
if xi>len(x) and yi < len(x):
| 10 |
decision
|
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
cur_sum_x, cur_sum_y = x[0], y[0]
ans = 0
xi , yi = 1, 1
while xi <= len(x) and yi <= len(y):
if cur_sum_x == cur_sum_y and cur_sum_x != 0:
ans += 1
if xi < len(x) and yi < len(x):
cur_sum_x, cur_sum_y = x[xi], y[yi]
xi += 1
yi += 1
else:
if cur_sum_x < cur_sum_y:
cur_sum_x += x[xi]
xi += 1
else:
cur_sum_y += y[yi]
yi += 1
print(ans)
|
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
cur_sum_x, cur_sum_y = x[0], y[0]
ans = 0
xi , yi = 1, 1
while xi <= len(x) and yi <= len(y):
if cur_sum_x<cur_sum_y and cur_sum_x != 0:
ans += 1
if xi < len(x) and yi < len(x):
cur_sum_x, cur_sum_y = x[xi], y[yi]
xi += 1
yi += 1
else:
if cur_sum_x < cur_sum_y:
cur_sum_x += x[xi]
xi += 1
else:
cur_sum_y += y[yi]
yi += 1
print(ans)
|
if cur_sum_x<cur_sum_y and cur_sum_x != 0:
| 8 |
decision
|
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
cur_sum_x, cur_sum_y = x[0], y[0]
ans = 0
xi , yi = 1, 1
while xi <= len(x) and yi <= len(y):
if cur_sum_x == cur_sum_y and cur_sum_x != 0:
ans += 1
if xi < len(x) and yi < len(x):
cur_sum_x, cur_sum_y = x[xi], y[yi]
xi += 1
yi += 1
else:
if cur_sum_x < cur_sum_y:
cur_sum_x += x[xi]
xi += 1
else:
cur_sum_y += y[yi]
yi += 1
print(ans)
|
n, m = list(map(int, input().split()))
y = list(map(int, input().split()))
y = list(map(int, input().split()))
cur_sum_x, cur_sum_y = x[0], y[0]
ans = 0
xi , yi = 1, 1
while xi <= len(x) and yi <= len(y):
if cur_sum_x == cur_sum_y and cur_sum_x != 0:
ans += 1
if xi < len(x) and yi < len(x):
cur_sum_x, cur_sum_y = x[xi], y[yi]
xi += 1
yi += 1
else:
if cur_sum_x < cur_sum_y:
cur_sum_x += x[xi]
xi += 1
else:
cur_sum_y += y[yi]
yi += 1
print(ans)
|
y = list(map(int, input().split()))
| 2 |
statement
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]-x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]&x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
return (x[0]&x[1])
| 8 |
operation
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]-x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]%x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
return (x[0]%x[1])
| 8 |
operation
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]-x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]/x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
return (x[0]/x[1])
| 8 |
operation
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]-x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]-x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
y+=1
print(count)
|
y+=1
| 31 |
statement
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]-x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
n= int(input())
s = input()
a = list(s)
count = -1
x = [0,0]
sign = "neutral"
def check(x):
return (x[0]+x[1])
def signChange(x):
global sign
t = check(x)
if t>0:
t = "positive"
elif t == 0:
return False
else:
t = "negative"
if t == sign:
return False
else:
sign= t
return True
for i in range(n):
if a[i] =="R":
x[0] +=1
if signChange(x):
count+=1
else:
x[1]+=1
if signChange(x):
count+=1
print(count)
|
return (x[0]+x[1])
| 8 |
operation
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p==k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
if p==k:
| 20 |
decision
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in y:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
if x in y:
| 23 |
statement
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i&i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
for j in range(i&i, 1000005, 2*i):
| 7 |
operation
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
for p in primes:
if p > k:
break
x = n%p
if x in z:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("N0")
|
if x in z:
| 23 |
statement
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 199**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
MOD = 199**9 + 7
| 5 |
value
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits+1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
two += 1 if ops[bits+1] + 1 == k else 0
| 38 |
operation
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits<0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
if bits<0 and n[pos] == '1':
| 33 |
decision
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits]^1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
two = 1 if bits > 0 and ops[bits]^1 == k else 0
| 35 |
operation
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10**9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
import sys
sys.setrecursionlimit(1234)
N = 1234
MOD = 10^9 + 7
n = input()
k = int(input())
ops = {1 : 0}
def num_bits(n):
bits = 0
while n > 0:
if n % 2 == 1:
bits += 1
n //= 2
return bits
def find_steps(n):
if n not in ops:
ops[n] = 1 + find_steps(num_bits(n))
return ops[n]
def precompute():
for i in range(2, N):
if i not in ops: ops[i] = find_steps(i)
DP = {}
def dp(pos=0, same=True, bits=0):
if pos == len(n) - 1:
if bits == 0 and n[pos] == '1':
return 1 if k == 0 else 0
two = 1 if bits > 0 and ops[bits] + 1 == k else 0
if not same:
two += 1 if ops[bits + 1] + 1 == k else 0
elif n[pos] == '1':
two += 1 if ops[bits + 1] + 1 == k else 0
return two
tup = (pos, same, bits)
if tup in DP: return DP[tup]
DP[tup] = 0
if same:
DP[tup] += dp(pos + 1, n[pos] == '0', bits)
if n[pos] == '1':
DP[tup] += dp(pos + 1, True, bits + 1)
else:
DP[tup] += dp(pos + 1, False, bits)
DP[tup] += dp(pos + 1, False, bits + 1)
DP[tup] %= MOD
return DP[tup]
precompute()
print (dp())
|
MOD = 10^9 + 7
| 5 |
operation
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)<0:
break
print(sum(l))
|
if len(a)<0:
| 22 |
decision
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(z[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
l.append(int(z[i])*10**(len(a)-1))
| 22 |
statement
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)%1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
b-=(b%(10**(len(a)%1)))*10**len(a)-1
| 22 |
operation
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)/1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
b-=(b%(10**(len(a)-1)))*10**len(a)/1
| 22 |
operation
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)<=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
a=list(str(input()))
b=(int(input()))
l=[]
a.sort()
a.reverse()
while True:
for i in range(len(a)):
if int(a[i])*10**(len(a)-1)>=(b):
break
b-=(b%(10**(len(a)-1)))*10**len(a)-1
l.append(int(a[i])*10**(len(a)-1))
a.remove(a[i])
if len(a)==0:
break
print(sum(l))
|
if int(a[i])*10**(len(a)-1)>=(b):
| 22 |
decision
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(y+1)
a[x]=0
for i in range(x,y):
for j in sp[i]:
if j<=y:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*(x+1)
a[y]=0
for i in range(y,x):
for j in sp[i]:
if j<=x:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(y+1)
a[x]=0
for i in range(x,y):
for j in sp[i]:
if j<=y:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*(x>>1)
a[y]=0
for i in range(y,x):
for j in sp[i]:
if j<=x:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
a=[10000000]*(x>>1)
| 12 |
operation
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(y+1)
a[x]=0
for i in range(x,y):
for j in sp[i]:
if j<=y:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*(x+1)
a[y]=0
for i in range(y,x):
for j in sp[i]:
if j<=x:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(y**1)
a[x]=0
for i in range(x,y):
for j in sp[i]:
if j<=y:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*(x+1)
a[y]=0
for i in range(y,x):
for j in sp[i]:
if j<=x:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
a=[10000000]*(y**1)
| 4 |
operation
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(y+1)
a[x]=0
for i in range(x,y):
for j in sp[i]:
if j<=y:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*(x+1)
a[y]=0
for i in range(y,x):
for j in sp[i]:
if j<=x:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(y+1)
a[x]=0
for i in range(x,y):
for j in sp[i]:
if j<=y:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*(x+1)
a[y]=0
for i in range(y,x):
for j in sp[i]:
if j>=x:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
if j>=x:
| 16 |
decision
|
def replaceStr(s):
s = s.upper()
s = s.replace('0', 'O')
s = s.replace('1', 'l')
s = s.replace('I', 'l')
s = s.upper()
return s
str = replaceStr(input())
print(str)
n = int(input())
flag = True
for i in range(n):
s = replaceStr(input())
print(s)
if str == s:
flag = False
if flag == True:
print('Yes')
else:
print('No')
|
def replaceStr(s):
s = s.upper()
s = s.replace('0', 'O')
s = s.replace('1', 'l')
s = s.replace('I', 'l')
s = s.upper()
return s
str = replaceStr(input())
print(str)
n = int(input())
flag = True
for i in range(n):
s = replaceStr(input())
print(s)
if str == s:
flag = False
if flag<True:
print('Yes')
else:
print('No')
|
if flag<True:
| 19 |
decision
|
def replaceStr(s):
s = s.upper()
s = s.replace('0', 'O')
s = s.replace('1', 'l')
s = s.replace('I', 'l')
s = s.upper()
return s
str = replaceStr(input())
print(str)
n = int(input())
flag = True
for i in range(n):
s = replaceStr(input())
print(s)
if str == s:
flag = False
if flag == True:
print('Yes')
else:
print('No')
|
def replaceStr(s):
s = s.upper()
s = s.replace('0', 'O')
s = s.replace('1', 'l')
s = s.replace('I', 'l')
s = s.upper()
return s
str = replaceStr(input())
print(str)
n = int(input())
flag = True
for i in range(n):
s = replaceStr(input())
print(s)
if str == s:
flag = False
if flag<True:
print('Yes')
else:
print('No')
|
if flag<True:
| 19 |
decision
|
def replaceStr(s):
s = s.upper()
s = s.replace('0', 'O')
s = s.replace('1', 'l')
s = s.replace('I', 'l')
s = s.upper()
return s
str = replaceStr(input())
print(str)
n = int(input())
flag = True
for i in range(n):
s = replaceStr(input())
print(s)
if str == s:
flag = False
if flag == True:
print('Yes')
else:
print('No')
|
def replaceStr(s):
s = s.upper()
s = s.replace('0', 'O')
s = s.replace('1', 'l')
s = s.replace('I', 'l')
s = s.upper()
return s
str = replaceStr(input())
print(str)
n = int(input())
flag = True
for i in range(n):
s = replaceStr(input())
print(s)
if str<s:
flag = False
if flag == True:
print('Yes')
else:
print('No')
|
if str<s:
| 17 |
decision
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r>>300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
r_ = r>>300
| 15 |
operation
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().x()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
a=list(map(int,input().x()))
| 3 |
statement
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i>>300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
w[i>>300][a[i]]+=1
| 6 |
operation
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-w[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
from collections import defaultdict
n,q = map(int,input().split())
a=list(map(int,input().split()))
w = [defaultdict(int) for i in range(400)]
for i in range(len(a)):
w[i//300][a[i]]+=1
w=[defaultdict(int)]+w
for quey in range(q):
t,l,r = map(int,input().split())
l-=1
if t==1:
r-=1
if r-l>=300:
M=defaultdict(int)
r_ = r//300
l_=l//300
for e,cou in w[r_].items():
M[e]=cou-x[l_][e]
for i in range(l,l_*300+1):
M[a[i]]+=1
for i in range(r_*300,r+1):
M[a[i]]+=1
else:
M=defaultdict(int)
for i in range(l,r+1):
M[a[i]]+=1
M=set(list(M.values()))
u=1
while u in M:
u+=1
print(u)
else:
p_ = l//300
for i in range(p_,400):
w[i][a[l]]-=1
w[i][r]+=1
a[l]=r
|
M[e]=cou-x[l_][e]
| 18 |
statement
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh<=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if(hh<=20):
| 13 |
decision
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh<=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if(hh<=20):
| 13 |
decision
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h//n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
xx=((math.ceil(h//n)*c))*.8
| 14 |
operation
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60//(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
t = (19-hh)*60//(60-mm)
| 16 |
operation
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh>=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
import math
a = (input())
a = a.split()
hh = int(a[0])
mm = int(a[1])
a = (input())
a = a.split()
h = int(a[0])
d = int(a[1])
c = int(a[2])
n = int(a[3])
if(hh<=20):
xx=((math.ceil(h/n)*c))*.8
else:
t = (19-hh)*60+(60-mm)
d= d*t
if ((math.ceil(h/n)*c)) > (math.ceil((h+d)/n)*c)*.8:
xx=(((math.ceil((h+d)/n)*c)*.8))
else:
xx=((math.ceil((h) / n) * c))
print(format(xx, '.4f'))
|
if(hh<=20):
| 13 |
decision
|
read=lambda:map(int,input().split())
n,d=read()
x=sorted(list(read()))
p=1
for i in range(n):
m=1
for j in range(i+1,n):
if x[j]-x[i]>d:
break
m+=1
p=max(p,m)
print(n-p)
|
read=lambda:map(int,input().split())
n,d=read()
x=sorted(list(read()))
p=1
for i in range(n):
m=85
for j in range(i+1,n):
if x[j]-x[i]>d:
break
m+=1
p=max(p,m)
print(n-p)
|
m=85
| 6 |
value
|
read=lambda:map(int,input().split())
n,d=read()
x=sorted(list(read()))
p=1
for i in range(n):
m=1
for j in range(i+1,n):
if x[j]-x[i]>d:
break
m+=1
p=max(p,m)
print(n-p)
|
read=lambda:map(int,input().split())
n,d=read()
x=sorted(list(read()))
p=1
for i in range(n):
m=1
for j in range(i+1,n):
if x[j]-x[i]==d:
break
m+=1
p=max(p,m)
print(n-p)
|
if x[j]-x[i]==d:
| 8 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.