목차
없음
본문내용
#include
#include
#include
time_t t;
int numbest = 0;
int maxprofit = 0;
int P[6],W[6];
double CAPA = 0.0;
bool include[21],bestset[21];
bool promising(int i, int profit, int weight, int NUMOFITEMS)
{
int j, k;
int totweight;
int bound;
#include
#include
time_t t;
int numbest = 0;
int maxprofit = 0;
int P[6],W[6];
double CAPA = 0.0;
bool include[21],bestset[21];
bool promising(int i, int profit, int weight, int NUMOFITEMS)
{
int j, k;
int totweight;
int bound;