代码搜索：背包问题
找到约 10,000 项符合「背包问题」的源代码
代码结果 10,000
www.eeworm.com/read/398001/8011436
dsp 装载问题二.dsp
# Microsoft Developer Studio Project File - Name="装载问题二" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Con
www.eeworm.com/read/398001/8011438
ncb 装载问题二.ncb
www.eeworm.com/read/398001/8011439
dsw 装载问题二.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/297534/8012292
txt tsp问题代码.txt
function [y,val]=QACS
tic
load att48 att48;
MAXIT=300; % 最大循环次数
NC=48; % 城市个数
tao=ones(48,48);% 初始时刻各边上的信息最为1
rho=0.2; % 挥发系数
alpha=1;
beta=2;
Q=100;
mant=20;
www.eeworm.com/read/397807/8020612
cpp 汽车加油问题.cpp
#include
#include // for operation on files
ifstream fin("input.txt");
ofstream fout("output.txt");
void main()
{
int n, k;
int s[1000];
int i,t,l,tag=1;
fin >>
www.eeworm.com/read/197075/8032552
txt 子集和数问题.txt
//子集和数问题,用回溯法实现
#include
#include
using namespace std;
vector set(30,0);//数据集合
vector option(30,false);//标志是否选中数据
vector visited(30,false);//标记是否已经被访问
b
www.eeworm.com/read/397569/8037609
cpp 最少硬币问题.cpp
#include
using namespace std;
int mat[11][222222];
int elem[111];
int a[111];
const int MAX=INT_MAX/2;
int min(int a,int b)
{
if(a
www.eeworm.com/read/397569/8037614
cpp 删数问题.cpp
#include
#include
using namespace std;
void delek();
string a;
int k;
int main()
{
cin >> a;
cin >> k;
delek();
cout
www.eeworm.com/read/397569/8037623
cpp 最优分解问题.cpp
#include
using namespace std;
void dicomp();
long a[3000];
long result[3000]={1,0};
long c;
long k;
long n;
long len;
long m;
int main()
{
scanf("%ld",&n);
dicomp();
for(len
www.eeworm.com/read/397357/8054653
cpp 士兵队列问题.cpp
#include
#include
using namespace std;
int x[10000];
int y[10000];
int main()
{
int n;
cin >> n;
for(int i=0;i> x[i] >> y[i];
int tempx;