搜索资源列表
1002
- Sicily上的1002题，主要是为一些初学者设计的-Problem Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers sums to a composite (non-prime) number. For example, if
prime
- 质性测试，小于32767一个最小的质数，使用PASCAL编写-Qualitative test, less than 32767 to one of the least 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. The other files were auto-gene
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
Rian.tar
- This the prime generator using Bit Array. It s the best prime generator. The algorithm based on Eratos and using the bit operation to enhanced the speed of computation.-This is the prime generator using Bit Array. It s the best prime generator. The a
prime
- prime algorithm to finding minimum spanning tr-prime algorithm to finding minimum spanning tree
prime
- 实现两个四位素数之间的转换，每次变一位数 中间过程都是素数 要几次-Between the two prime numbers to achieve the conversion of four, each time varying the number of intermediate process is a prime number to be several times
E-Prime
- e-prime-e-prime
vega-prime
- vega prime 2.0常用问题大全 附带VP小程序-vega prime
judge-prime-number
- 利用labview中的公式节点，实现判断素数的功能。-Labview using the formula node to achieve the function to determine the prime numbers.
Prime-(1-1000)
- This a simple program and prints prime numbers from 1 to 1000. -This is a simple program and prints prime numbers from 1 to 1000.
c-prime-plus
- c prime plus c prime plus c prime plus-c prime plusc prime plusc prime plusc prime plusc prime plus
Prime-Palindromes
- USACO题Prime Palindromes的代码-Answer for Prime Palindromes in USACO
prime
- 输入整数a、b，输出a到b间的所有素数的简单程序。-Used to output all prime numbers between a to b simple program
prime-number
- 实现查询质数的功能，并能查询数目,可以在所有质数中查询 -check the prime number
prime
- 用C++实现prime算法，实现最小生成树，代码简单-With C++ achieve prime algorithm, and the minimum spanning tree, the code is simple
prime
- 用除法快速求质数,-Fast calculation of prime number division
Prime-number
- TC环境下，给一定数量寻找其中所有的质数。-Under the environment of TC, to find all the prime numbers to a certain number.
E-Prime教程
- 心理学实验的推荐实验设计软件e-prime的教程(A tutorial on the recommended experimental design software e-prime for psychological experiments)
the Mersenne prime
- 用Fortran语言写的一个简单的寻找梅森素数的小程序，主要是利用了二进制数组存储数据，然后用卢卡斯·莱默检验法判断所找到的数是否为梅森素数。(A simple program for finding Mason primes is written in Fortran language. It mainly uses binary arrays to store data, and then uses Lucas Lemmer test to determine whether the num