搜索资源列表
prime
- 快速计算出质数-Quickly calculate the prime number
vp_mfc_code
- 这个例子示范了怎样将一个Vega Prime窗口加入到MFC程序文件，全部的Vega Prime代码放在vp_mfcView.cpp.里面。另外的文件是MFC 应用向导自动产生。-This sample illustrates how to add a Vega Prime window to an MFC app. All of the Vega Prime specific code is in vp_mfcView.cpp.
PRIME
- 在密码学中判断一个数是否为素数很重要 该算法判断一个数是否为素数 c语言实现-Cryptography judged in a number of prime numbers is very important for the algorithm to determine whether a number of prime numbers c language
prime
- 利用数学的概念来检查任意输入数值是否为质数-The concept of the use of mathematics to check whether any numerical input prime number
prime_number
- 这个程序是用来判断一个数是否为素数的，用户由键盘输入一个正整数，即可判断该数是否为素数，还可以连续输入，输入-1来结束输入。-This procedure is used to determine whether a number of prime numbers, the user keyboard input from a positive integer, you can determine whether the number
avi_play
- 在vega prime环境下，使用纹理播放avi视频的程序，本人将播放视频封装成一个类，在vega prime中使用十分方便-Vega prime in the circumstances, the use of texture avi video player program, I will play the video package into a category, in the vega prime is very conven
Advanced.ASIC.Chip.Synthesis.Using.Synopsys.Design
- 使用synopsys design compiler和 prime time进行Asic开发的英文pdf-Advanced.ASIC.Chip.Synthesis.Using.Synopsys.Design.Compiler.Physical.Compiler.And.Primetime
prime
- 找n以内的素数的程序，算法复杂度O(n^0.5)-Find the prime numbers below n, the efficiency of the program is O(n^0.5).
prime
- 筛选法搜索所有素数，范围是1~1000,由于除法效率很低，故使用筛选法，适合初学者学习-Screening search all prime numbers, the scope of 1 ~ 1000, due to inefficient division, so the use of screening, suitable for beginners to learn
5_prime_algorithm_compare
- 5种N自然数内素数算法速度比较 第一个是普通的筛选法处理,基本1000以后就挂了-5 kinds of natural number N with the rate of prime number algorithm
Fire
- firestarter – A Real-Time Fire Simulator Many obstacles exist in attempting to graphically render physical phenomena that are highly fluid and ostensibly chaotic in nature. Fire is a prime example of such phenomena
prime
- To find prime numbers
prime
- 求任意一个整数是不是素数。采用for循环分别用改数除以它和1之间的所有数。最后给出结果。-For any prime number is an integer. Used for the cycle were divided by the number changed between it and all the number 1. Finally, the results.
VegaPrimeDistributed
- Vega Prime Distributed中文模块总结-Vega Prime Distributed module
prime
- A prime number code .
flysf
- 这个傅立叶实例算法使用了基2、基3、基4、基5、基8、基10……混合算法，几乎可以计算任意长度的FFT。说明白点也就是当序列长度n为2、3、5、7、11等这些比较小的素数时，或者n的最大素因数<=37时，可计算这个序列的FFT。-The Fourier algorithm uses an instance of the base 2, base 3, base 4, base 5, base 8, base 10 ... ...
sushu
- 输入一个数 然后可以得到比这个数小的所有素数 InTEL汇编程序设计书后的一道题目 天津大学实验 -Enter a number and then can get smaller than this number of all prime numbers InTEL assembly programming book for a test subject of Tianjin University
prime
- 产生大素数。以时间作为随机数生成的种子，随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
Prime
- Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
Prime
- 利用筛选法快速求解超大范围的质数，并具有分页显示功能。-The use of rapid screening method for solving large range of prime numbers, and has paging display.