代码搜索：Knapsack
找到约 462 项符合「Knapsack」的源代码
代码结果 462
www.eeworm.com/read/291651/8404689
cpp knapsack.cpp
// Knapsack.cpp: implementation of the Knapsack class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "Knapsack.h"
#include "iostream.h"
www.eeworm.com/read/291651/8404713
h knapsack.h
// Knapsack.h: interface for the Knapsack class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_KNAPSACK_H__329C4290_86E9_4012_B73E_C0AE554376F7__INCLU
www.eeworm.com/read/290293/8491453
c knapsack.c
/*
Author: Pate Williams (c) 1997
Solution of the subset problem using LLL
reduction. See "Handbook of Applied
Cryptography" by Alfred J. Menezes et al
pages 120 - 121.
*/
#inclu
www.eeworm.com/read/386996/8714253
c knapsack.c
/*
Author: Pate Williams (c) 1997
Solution of the subset problem using LLL
reduction. See "Handbook of Applied
Cryptography" by Alfred J. Menezes et al
pages 120 - 121.
*/
#inclu
www.eeworm.com/read/382803/8999448
java knapsack.java
public class Knapsack {
private static class Element implements Comparable {
int id; //物品编号
double d;
private Element(int idd, double dd){
id = idd;
d = dd;
www.eeworm.com/read/382800/8999935
class knapsack.class
www.eeworm.com/read/382800/8999937
java knapsack.java
public class Knapsack {
public static void knapsack(int []v, int []w, int c, int [][]m)
{
int n=v.length-1;
int jMax=Math.min(w[n]-1,c);
for (int j=0;j
www.eeworm.com/read/184866/9068608
java knapsack.java
package com.laure.suanfa;
public class Knapsack{
public static void greedyKnapsack(int[] p,int[] w,int m,int[] x){
int i,n;
int cu;//背包剩余容量
n=x.length;
for(i=0;i
www.eeworm.com/read/378375/9233436
class knapsack.class
www.eeworm.com/read/371084/9569088
dsp knapsack.dsp
# Microsoft Developer Studio Project File - Name="Knapsack" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86)