代码搜索：背包问题
找到约 10,000 项符合「背包问题」的源代码
代码结果 10,000
www.eeworm.com/read/182772/9191612
c 背包问题.c
/* 0/1背包问题的分支定界法算法*/
#include
#include
#define MAXNUM 100
struct node{
int step;
int price;
int weight;
int max, min;
unsigned long po;
};
www.eeworm.com/read/170013/9823189
cpp 背包问题.cpp
#include"iostream.h"
#include"stdlib.h"
#include"stdio.h"
#define N 20
class goods{
public:
float c;
float v;
float p;
};
void main()
{
goods a[N],t;
int n;
cout
www.eeworm.com/read/170011/9823199
cpp 背包问题.cpp
#include"iostream.h"
#include"stdlib.h"
#include"stdio.h"
#define N 20
class goods{
public:
float c;
float v;
float p;
};
void main()
{
goods a[N],t;
int n;
cout
www.eeworm.com/read/162380/10309186
txt 背包问题.txt
Dim a1 As Integer
Dim a2 As Integer
Dim a3 As Integer
Dim a4 As Integer
Dim a5 As Integer
Dim a6 As Integer
Dim a7 As Integer
Dim a8 As Integer
Dim a9 As Integer
Dim a10 As Integer
Dim a11 A
www.eeworm.com/read/160200/10559298
rar 背包问题.rar
www.eeworm.com/read/159462/10647490
cpp 背包问题.cpp
#include
bool Done;
int next;
void parts(int P[],int W[],int F[],int x[],int p[],int w[],int n);
int DKNAP(int P[],int W[],int n,int M,int p[],int w[],int x[]);
int DKNAP(int P[],int W
www.eeworm.com/read/271491/10992186
dsw 背包问题.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# 警告: 不能编辑或删除该工作区文件！
###############################################################################
Project: "背包问题"=".\背包问题.dsp"
www.eeworm.com/read/271491/10992188
cpp 背包问题.cpp
#include
#include
int knap (int s, int n, int w[])
{
if (s == 0)
{ return 1;}
else if (s < 0 )
{ return 0;}
else if ( s > 0 && n < 1)
{return 0;}
www.eeworm.com/read/271491/10992190
plg 背包问题.plg
Build Log
--------------------Configuration: 背包问题 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\Lain\LOC
www.eeworm.com/read/271491/10992192