//0-1背包
#include<stdio.h>
#include<time.h>#include <stdlib.h>
#include<malloc.h>
typedef struct{
int weight;
int value;
} knapstruct;
void knapsack(int n,int w)
{
knapstruct * knap;
int i,j;
int **c=(int **)calloc(n+1,sizeof(int* ));
for(i=0;i<=n;i++)
c[i]=(int *)calloc(w+1,sizeof(int ));
knap=(knapstruct *)malloc(sizeof(knapstruct)*(n+1));
srand((unsigned int) time(0));
for(i=1;i<=n;i++)
{
knap[i].value=rand()%10+1;
// printf("%5d", knap[i].value);
knap[i].weight=rand()%10+1;
// printf("%5d", knap[i].weight);
}
printf("produce the value and weight at random:\n");
for(i=1;i<=n;i++)
{
printf("%d. %5d %5d\n", i,knap[i].value,knap[i].weight);
}
for(i=1;i<=n;i++)
for(j=1;j<=w;j++)
{
if(knap[i].weight>j) //这里要注意,调试了半天,此时背包大小时慢慢变大的,不能用最大值w
{
c[i][j]=c[i-1][j];
// printf("%5d",c[i][j]);
}
else
{
c[i][j]= (c[i-1][j])>(c[i-1][j-knap[i].weight]+knap[i].value)? c[i-1][j] : c[i-1][j-knap[i].weight]+knap[i].value;
// printf("%5d",c[i][j]);
}
}
for(i=0;i<=n;i++)
{
for(j=0;j<=w;j++)
{
printf("%4d",c[i][j]);
}
printf("\n");
}
free(knap);
for(i=0;i<=n;i++) //prevent from the mem leak
free(c[i]);
free(c);
}
int main()
{
int n,w;
printf("input two number:");
scanf("%d %d",&n,&w);
knapsack( n,w);
return 1;
}
//完全背包问题
#include<stdio.h>
#include <stdlib.h>
#include<time.h>
#include<malloc.h>
typedef struct{
int weight;
int value;
} knapstruct;
void knapsack(int n,int w)
{
knapstruct * knap;
int i,j,k;
int **c=(int **)calloc(n+1,sizeof(int* ));
for(i=0;i<=n;i++)
c[i]=(int *)calloc(w+1,sizeof(int ));
knap=(knapstruct *)malloc(sizeof(knapstruct)*(n+1));
srand( (unsigned int) (time(0)));
for(i=1;i<=n;i++)
{
knap[i].value=rand()%10+1;
// printf("%5d", knap[i].value);
knap[i].weight=rand()%10+1;
// printf("%5d", knap[i].weight);
}
printf("produce the value and weight at random:\n");
for(i=1;i<=n;i++)
{
printf("%d. %5d %5d\n", i,knap[i].value,knap[i].weight);
}
for(i=1;i<=n;i++)
for(j=1;j<=w;j++)
{
if(knap[i].weight>j) //这里要注意,调试了半天,此时背包大小时慢慢变大的,不能用最大值w
{
c[i][j]=c[i-1][j];
// printf("%5d",c[i][j]);
}
else
{
for(k=0;k<=j/knap[i].weight;k++)
// if(j-knap[i].weight*k>=0 这里不要担心数组的越界检查,因为上面的循环条件已经限制了 c语言不做数组越界检查就是为了效率考虑)
c[i][j]= (c[i][j])>(c[i-1][j-knap[i].weight * k]+knap[i].value * k)?
c[i][j] : c[i-1][j-knap[i].weight * k]+knap[i].value *k;
// printf("%5d",c[i][j]);
}
}
for(i=0;i<=n;i++)
{
for(j=0;j<=w;j++)
{
printf("%4d",c[i][j]);
}
printf("\n");
}
free(knap);
for(i=0;i<=n;i++) //prevent from the mem leak
free(c[i]);
free(c);
}
int main()
{
int n,w;
printf("input two number:");
scanf("%d %d",&n,&w);
knapsack( n,w);
return 1;
}