搜索资源列表
Prime-judgment
- Prime judgment , you can get an integer jugded if it is an prime number after you put it in.
Prime
- 个人原创代码：编写Java Application程序，高效输出100以内的所有素数。-The original code of the individual: write Java Application procedures, efficient output of less than 100 prime numbers.
1.3-Prime-Cryptarithm
- usaco Prime Cryptarithm 答案-usaco Prime Cryptarithm answer
prime
- matlab program to find prime numbers
prime-test
- 素数测试问题（Monte Carlo算法） 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0（bk=1,且k≈log2m）。 例：m=41=101001(2)，bkbk-1…b1b0=101001，（k=5）。 求am可以用下述方法：初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD
vega-prime-frame-thread
- VEGA PRIME 2.0.1 线程模式 MFC单文档-VEGA PRIME VC MFC
Prime-number-generation
- 使用分段筛法，产生一定数值以内的所有素数。-use Segmented sieve method to Generate all prime numbers within a certain range of values
Screening-and-m-prime-number
- 用筛选法求m内的素数，给一个数求其是几位数，并输出每位数-Screening and m within a prime number, give a number for its several numbers, and the number of output per person.
find-prime-numbers
- 利用C语言实现从3-1000之间找出所有的素数，算法比较简洁-Just use the most simple C language to find all the prime numbers between 3 and 1000
prime
- 孪生素数, 起讲的相邻的素数（且必须素数）。用不同的父子进程打印-the sister of prime date ,it s work on linux system.the main proecess is vcc.hello
4-prime-generation
- 利用费马特素性检验实现40000以内的所有素数的生成并通过文件输出-Fei Mate primality test 40000 or less of all prime numbers generated by the file output
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.
prime-no
- print and find prime numbers
is-it-prime
- 判断一个数是否是素数的小程序，经过编译即可使用-Determine if a number is prime number of small programs compiled can be used
prime
- 基于Java的并行计算，搜寻任意范围区间的所有等于质数乘积的数，可作为对并行计算的入门了解。-Java-based parallel search any range interval number is equal to the product of prime numbers, as parallel computing introductory understanding.
How-many-prime-numbers
- 已知许多整数，求素数个数。先输入N（整数个数），再输入N个整数。每个都不超过32位整型，不小于2.-Give you a lot of positive integers, just to find out how many prime numbers there are.In each case, there is an integer N representing the number of integers to find. Ea
c-prime-plus
- c prime plus c prime plus c prime plus-c prime plusc prime plusc prime plusc prime plusc prime plus
Prime-number-program-in-c-language
- this program is to check the number is prime or not
Prime-Palindromes
- USACO题Prime Palindromes的代码-Answer for Prime Palindromes in USACO
prime
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 */ -Determine 101-200 between the number of primes, and output of all primes. A program analysis: judgment Primes: respectively