34 lines
989 B
Python
34 lines
989 B
Python
from math import inf
|
|
|
|
tasks1 = [f"1.{i + 1}" for i in range(5)]
|
|
tasks2 = [f"2.{i + 1}" for i in range(5)]
|
|
tasks3 = [f"3.{i + 1}" for i in range(5)]
|
|
|
|
all_variants = []
|
|
|
|
for i in tasks1:
|
|
for j in tasks2:
|
|
for k in tasks3:
|
|
all_variants.append([i, j, k])
|
|
|
|
selected_variants = [all_variants[0]]
|
|
|
|
for _ in range(9):
|
|
best_candidate = all_variants[0]
|
|
min_max_intersections = inf
|
|
for variant in all_variants:
|
|
max_intersections = -inf
|
|
for selected_variant in selected_variants:
|
|
intersections = 0
|
|
for j in range(3):
|
|
if selected_variant[j] == variant[j]:
|
|
intersections += 1
|
|
if max_intersections < intersections:
|
|
max_intersections = intersections
|
|
if max_intersections < min_max_intersections:
|
|
min_max_intersections = max_intersections
|
|
best_candidate = variant
|
|
selected_variants.append(best_candidate)
|
|
|
|
print(any([]), sep="\n")
|