import random
from IPython.core.display import SVG
import pyomo.environ as pyo
from pysat.solvers import Solver
from pysat.formula import CNF 
import py_svg_combinatorics as psc
from ipywidgets import widgets, HBox
from collections import Counter
from pprint import pprint
from random import randint
import numpy as np
from IPython.display import IFrame
import IPython
from copy import copy
import os
from pathlib import Path
np.set_printoptions(precision=2)
np.set_printoptions(suppress=True)
nbname = ''
try:
    nbname = __vsc_ipynb_file__
except:
    if 'COCALC_JUPYTER_FILENAME' in os.environ:
        nbname = os.environ['COCALC_JUPYTER_FILENAME']    
title_ = Path(nbname).stem.replace('-', '_').title()    
IFrame(f'https://discopal.ispras.ru/index.php?title=Hardprob/{title_}&useskin=cleanmonobook', width=1280, height=300)

# Случайные данные
m = np.random.randint(3, 20)
n = np.random.randint(3, 20)
A = np.random.randint(1, 100, size=(m,n))
c = np.random.randint(2, size=(n))
b = np.floor(1/np.random.rand(m))

# Увеличиваем вероятность нетривиального решения
for i in range(len(b)):
    b[i] = max(b[i], max(A[i, j] for j in range(n)))


A, b, c

def get_model(A, b, c):
    m = pyo.ConcreteModel()

    m.m, m.n = A.shape

    # на всякий случай, возьмем с собой
    m.A = A
    m.b = b
    m.c = c
    
    m.I = range(m.m)
    m.J = range(m.n)
    
    m.x = pyo.Var(m.J, domain=pyo.Binary)
    m.obj = pyo.Objective(expr = sum( c[j] * m.x[j] for j in m.J), sense=pyo.maximize)

    @m.Constraint(m.I)
    def строчка_не_больше(m, i):
        return sum(A[i, j] * m.x[j] for j in m.J) <= b[i]

    return m

m = get_model(A, b, c)
m.pprint()

def print_solution(m):
    for v in m.component_data_objects(pyo.Var):
        if v.value and v.value > 0:
            print(str(v), v.value)

solver = pyo.SolverFactory('cbc')
solver.solve(m).write()
print_solution(m)