搜索资源列表
circlecutting
- 集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？ 本程序要求用贪心算法解决: 贪心算法总是作出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，它所做出的仅是在某种意义上的局部最优解。 -problem given a container, its long-L, width W and H for high, the existing bat
ls
- LS by Cao Siqin, 2007.7.17 ls [-l/-w/-s][-d/-f][-acpo!?] [path or file name mask1] [mask2 ...] Options: -? : display this help -l : list details -a : list all files -w/s : list in a line, file names are sepatated by tab -p : file n
fibo
- The Fibonacci sequence is formed by adding S to a pattern of length n − 1, or L to a pattern of length n − 2.-The Fibonacci sequence is formed by adding S to a pattern of length n − 1, or L to a pattern of length n − 2.
winscript_example
- VBscr ipt wrapper class allow to add vbscr ipt scenaries to applications. No MFC/ATL/etc. Example:scr iptEngine engine engine.Initialize() engine.AddDispatch(L"MyFunction",MyFunctionHandler) engine.Parsescr ipt(L"scr iptText) engine.Execite() -V
l
- 简单的填字游戏，好玩，而且有助于大家的学习-A simple crossword puzzles and fun, but also helps everyone to learn
heapsort
- 堆排序(HeapSort)是一树形选择排序。堆排序的特点是：在排序过程中，将R[l..n]看成是一棵完全二叉树的顺序存储结构，利用完全二叉树中双亲结点和孩子结点之间的内在关系(参见二叉树的顺序存储结构)，在当前无序区中选择关键字最大(或最小)的记录-Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete b
shellorder
- 先取一个小于n的整数d1作为第一个增量，把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插入排序；然后，取第二个增量d2<d1重复上述的分组和排序，直至所取的增量dt=1(dt<dt-l<…<d2<d1)，即所有记录放在同一组中进行直接插入排序为止-First take an integer less than n d1 as the first increment, the document d1 all records
File
- 分解文件(需要输入字节数来指示分割的位置， 分解为：file.l和file.xi) 合并文件(需要输入两个文件名)-decompose file （need to input the number of bytes to indecate position to decompose the file， the file is decomposed into ：file.l and file.xi） compose files(need to input two file name
Backup
- sauvegarde a l aide de drive snapshot
test
- 实对称正定矩阵LDL^分解，其中L为单位下三角矩阵，D为对角阵-A recursive algorithm for calculating the eigenvalues of a real symmetric matrix based on LDLT decomposition is given. With this algorithm, the number of eigenvalues of a real symmetric matrix in the given interval c
bufengtouzhen
- 布冯投针 找一根铁丝弯成一个圆圈，使其直径恰恰等于平行线间的距离d。可以想象得到，对于这样的圆圈来说，不管怎么扔下，都将和平行线有两个交点。因此，如果圆圈扔下的次数为n次，那么相交的交点总数必为2n。 现在设想把圆圈拉直，变成一条长为πd的铁丝。显然，这样的铁丝扔下时与平行线相交的情形要比圆圈复杂些，可能有4个交点，3个交点，2个交点，1个交点，甚至于都不相交。 由于圆圈和直线的长度同为πd，根据机会均等的原理，当它们投掷次数较多，且相等时，两者与平行线组交点的总数可望也是一样的。这就是说，
Lindex
- 是对作者的信息进行分析，是对微软的L因子进行实现-Is the author' s analysis of the information is in the L factor for realization of Microsoft
Cellular_Automate
- A Cellular Automate Simulator which is implemented with the use of a STL-Container and with the use of an array. Good for educational purposes, to learn how to use the copy- & move semantics, as well as the R- and L-Values in C++.
1076
- Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers
PAT
- Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers
ProtoData
- 把数据类型用类的形式进行封装，可以将不同类似的数据装载到一起,并且可以进行序列化 ProtoValue value value[_T("aaa")] = 1 value[_T("bbb")] = L"fddfdsaf" -The form of the data type with the class package, you can load different similar data together, and can be serialized ProtoValue
chengzhong
- 一款用于地磅称重管理的小软件简单演示了串口和地磅连接读取重量的示例-SDAFOPA L[ ,KAPOK ,
Model-answer
- 4.24 (Knight’s Tour) One of the more interesting puzzlers for chess buffs is the Knight’s Tour problem, originally proposed by the mathematician Euler. The question is this: Can the chess piece called the knight move around an empty chessboard and
Huffman_code
- Huffman编码 1、将信号源的符号按照出现概率递减的顺序排列。 2、将两个最小出现概率进行合并相加，得到的结果作为新符号的出现概率。 3、重复进行步骤1和2直到概率相加的结果等于1为止。 4、在合并运算时，概率大的符号用编码0表示，概率小的符号用编码1表示。 5、记录下概率为1处到当前信号源符号之间的0，l序列，从而得到每个符号的编码。-Huffman coding 1. Source symbols are arranged in order of decreasing
TRN.ZIP
- This program provides an example for using the truncated Newton algorithm within the SEISCOPE OPTIMIZATION TOOLBOX. ! The algorithm implemented is described in ! ! L.Metivier, R. Brossier, J. Virieux, S.Operto, ! ! Truncated Newton and full