资源列表
qiege_new
- //多边形切割 //可用于半平面交 //将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-/ / polygon cutting / / can be used for half-plane AC / / will polygon along l1, l2 determined by the straight line cutting in the side cutting side, ensuring l1, l2, side not collinea
qie_ge_new
- 将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-will polygon along l1, l2 cutting straight to determine the lateral side of the cutting, guaranteed l1, l2, side is not collinear
bag
- 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即p1*x1+p2*x1+...+pi*xi(其1<=i<=n，x取0或1，取1表示选取物品i) 取得最大值。
beibao
- 背包问题运用贪婪算法的matlab 程序实现
经典矩形问题
- 经典矩形问题 生成各种矩阵是竞赛时经常考的一种题目,如何用C语言或C++生成以下形式几种矩阵:-classic rectangular matrix of various problems generated when the contest is a regular test subject, how to use C or C generated several matrix form :
isqrt
- 32位无符号整数开方得到16位无符号整数的算法及实现代码-32-bit unsigned integer prescr iption 16 bit unsigned integer code of the algorithm and the realization of A algorithm an emplimentation codes of computing the 16-bits square root result from a 32-bits unsigned integer
lingozuiduan
- Lingo求解最短路问题的很好的例子，带有例题详细说明，是最短路问题求解的通用程序！-Solving the shortest path problem Lingo good example, with detailed examples, is the most common procedures for solving shortest path problem!
string
- C/C++实现在链式存储结构下对字符串进行各种操作。结构清晰，有注释。-C/C++ implementation structure in the chain stores carry out various operations on the string. Clear structure, with comments.
c4
- 装箱问题 问题描述：装箱问题可简述如下：设有编号为0、1、…、n-1的n种物品，体积分别为v0、v1、…、vn-1。将这n种物品装到容量都为V的若干箱子里。约定这n种物品的体积均不超过V，即对于0≤i＜n，有0＜vi≤V。不同的装箱方案所需要的箱子数目可能不同。装箱问题要求使装尽这n种物品的箱子数要少-Packing problem Problem Descr iption: Packing problem can be summarized as follows: with numbe
test
- 这个汉诺塔 问题 汉诺塔 问题 测试-this is a test program
parabolic-Eq-fortran-FTCS
- 抛物型方程 fortran 源代码 显示格式 FTCS-parabolic Eq fortran codes explicit FTCS
algoritmo-gneetico
- A simple algorithm wich finds the max value of an equation using genetic programming algorithm