代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/372507/9507389
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFi
www.eeworm.com/read/168218/9931719
cpp load.cpp
// greedy container loading
#include
void IndirectSort(int w[], int t[], int n)
{// Cluge to test when weights already in order.
for (int i=1; i
www.eeworm.com/read/168218/9932241
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFi
www.eeworm.com/read/168218/9932503
cpp load.cpp
// greedy container loading
#include
void IndirectSort(int w[], int t[], int n)
{// Cluge to test when weights already in order.
for (int i=1; i
www.eeworm.com/read/168218/9933525
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFi
www.eeworm.com/read/363661/9940760
java harddisktype.java
/*
****************************************************************************************
* Copyright ? Giovanni Novelli
* All Rights Reserved.
**********************************************
www.eeworm.com/read/363661/9940761
java tapetype.java
/*
****************************************************************************************
* Copyright ? Giovanni Novelli
* All Rights Reserved.
**********************************************
www.eeworm.com/read/360172/10107612
+
【例3.16】 演示访问容器容量信息及对象实例。
#include
#include
using namespace std；
void main(){
vectora(10)；//产生向量a，元素内容均为0
cout
www.eeworm.com/read/359805/10124123
m rheesub.m
% Author: Zukang Shen and Ian C. Wong
% Copyright (C) 2004 Ian C. Wong
%
% This program is free software; you can redistribute it and/or
% modify it under the terms of the GNU General Public
www.eeworm.com/read/358191/10194287
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFi