# -*- coding: utf-8 -*-
# Created on Sat Sep 31 08:15:00 2024
# @author: mhebding
# TP2 - Programmation dynamique 2



## Le sac a dos

# 1.
None # donnees a implementer



## 1 - Programmation dynamique du probleme

# 2.
None # reponse a la question

# 3.
None # reponse a la question

# 4.
def matrice(lignes, colonnes, nombre):
	M = []
	for i in range(lignes):
		M.append([])
		for j in range(colonnes):
			None # a completer
	return None # a completer

# 5.
def sacDynamique(poids, valeurs, capacite):
	N = len(poids)
	V = matrice(N+1, capacite+1 ,0)
	for p in range(1,capacite+1):
		for i in range(0,N):
			None # a completer
	return V, V[-1][-1]

#print('Version Dynamique')
#print(sacDynamique(poids, valeurs, 8))

# 6.
None # reponse a la question



## 2 - Reconstruction de la solution

# 7. 8.
def reconsruction(V, poids, valeurs, noms, capacite):
	None # a implementer



## 3 - Essais

# 9. 10.

# Essais a faire vous meme