搜索资源列表
mimp
- 求解对角线元素很小的矩阵的逆矩阵,避免一般求逆的溢出问题,用Fortran编写-small diagonal elements of the matrix inverse matrix inversion generally avoid the overflow problems, Fortran prepared
finish01
- 一般来说用int型变量超过2^31的数就会溢出。此程序是利用数组对长度很长的整形字符串进行加减操作，并且进行自动测试的例子-int type generally used more than two variables ^ 31 a few will overflow. This procedure is the use of an array of very long length of plastic strings Modified operation, as well as automa
cbig
- 大数的阶乘 算法 初学者容易犯数据类型的范围溢出问题 初学者值得仔细研究-majority of the factorial algorithm beginners easily commit scope of the types of data overflow problems beginners deserves careful study
s0604109
- 二质量浮筏振动频率计算(98.6),以及对于不同质量比,阻尼比 和干扰激励频率时的隔振效果计算,有数据压缩防溢出功能(98.4) 对每个弹性支承均求旋转变换矩阵,可用于辐射式布置(98.4)-two quality floating raft vibration frequency calculation (98.6), and for different quality than, damping ratio and interference at the excitation fre
largeint_multi
- 从文件读入两个很大的整数，做乘法后将结果存入第三个文件。乘数被乘数均可溢出，结果绝对精确。-Reading from the document into two large integers, the result will do multiplication into the third document. Multiplicand multiplier may overflow, the result is absolutely accurate.
overflow
- 求系统的计算最小数,以便让计算人员明确计算机大数吃小数的精度损失
BOX
- 最少背包问题：假设有许多盒子，每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN，它们的重量分别是w1,w2,…,wN。目的是用尽可能少的盒子放入所有的项，任何盒子的重量不能超过他的容量。例如，如果想的重量为0.4, 0.4, 0.6和0.6，用两个盒子就能解决。 按如下策略解决此问题：按给定的次序扫描每一个项，把每一个项放入能够容纳他而不至于溢出的最满的盒子。用优先级队列选择要装入的盒子。-Minimum knapsack problem: Suppose there are m
20033194
- this source is a HASH algorithm.if hash function make the same key, it solve overflow by chain algorithm.
ABufferOverflowStudyAttacksandDefenses
- A Buffer Overflow Study - Attacks and Defenses 一本介绍缓冲区溢出非常好的书，讲解详细，通俗易懂，是值得收藏的好资料-A Buffer Overflow Study- Attacks and Defenses 1 describes a buffer overflow very good book, explained in detail, easy to understand, is worthy of a good collection of i
dashujiecheng
- 大树阶乘的源码，考虑了溢出，并且在vc++2008调试通过-Source code tree factorial, considering the overflow, and debugging through vc++2008
Some_about_Overflow_program_code
- 一些关于溢出的程序代码,一些关于溢出的程序代码-Some about the overflow program code,Some about the overflow program code
FFT_2_DIT_Fixed
- 程序 FFT_2_DIT_Fixed 是基2_DIT_*定点*_FFT算法，值得学习的地方很多。亮点有：倒位序采用最简单，最高效的位移操作；实现存储的旋转因子表；定点溢出处理；灵活多样的宏定义。函数调用形式：void fft(COMPLEX *x)点数在头文件以宏定义形式出现。-Program FFT_2_DIT_Fixed is based 2_DIT_* fixed* _FFT algorithm, it is worth learning a lot of places. Highligh
8_Queens_revised
- N皇后问题的所有解,设定解栈大小为100,N大于时,需要增大解的栈,否则会栈溢出.-all the solution to N Queen (N<=8, else stack overflow)
queue
- (一)题目: 假设以带头结点的循环链表表示队列，并且只设一个指针指向队尾元素结点而不设头指针，试编写相应的队列初始化、入队列、出队列和判断队列状态的算法。 利用上述算法完成下面的各操作，并在每一操作后输出队列状态。 1)下列元素逐一入队：5,7,3,8,55 状态：5个元素 2) 3个元素出队 状态：２个元素 3)再２个元素出队 状态：队空 4)再１个元素出队 状态：队空（指示下溢） -(A) Title: Suppose to take the l
yiqunsuanfa
- 蚁群算法，需要继续改进。算法基于TSP，但是城市数目过多会导致溢出。-Ant colony algorithm, need to continue to improve. Algorithm is based on TSP, but too much can cause an overflow number of cities.
FPTree
- FPGrowth算法，数组实现的，会溢出，别人实现的-FPGrowth algorithm, the array implementation, it will overflow, people to achieve
pso_binary
- 离散粒子群算法，在VC++使用时,需改变设置 project->setting->link: 在category里选择output,在stack的Reserve里输入0x10000000(也就是10M) 原因: 局部变量申请得太多，默认stack只有1M，声明的局部变量超过这个限制就会overflow-binary pso algorithm
cirular-queue
- 为充分利用向量空间，克服"假溢出"现象的方法是：将向量空间想象为一个首尾相接的圆环，并称这种向量为循环向量。存储在其中的队列称为循环队列-To take full advantage of vector space, to overcome the " false overflow" phenomenon is: the vector space of imagination for an end to end ring, saying such a vector for th
NO2
- 顺序表 create_sqlist(Sqlist *L)/*创建顺序表*/ { int k ElemType x k=0 scanf(" d",&x) while(x!=0) { L->data[k]=x k++ scanf(" d",&x) } L->length=k } void print_sqlist(Sqlist *L)/*输出顺序表*/ { int j
Digit-Overflow
- Digit Overflow summary