搜索资源列表
nprime
- 给出个数字，输出它前的质数，很好用的，对于小学生来说！-Enter the number to determine whether a prime number, the good, is for the students!
prime
- 判断数字是否是质数，很好用的，对于小学生来说！-Determine whether the number is a prime number, the good, is for students!
wcp
- 文件中：wcp.exe是我们针对编译实验的文法的一个编译器（不含源码）；pi.txt和prime_number.txt是按照实验文法写的测试程序（前者是求pi值，后者是求质数） 注：wcp将编译和执行放在了一起，而且对原实验文法做了以下扩展 1.标识符采用c语言标准的标识符 2.增加了print语句来打印结果（statement：print VarList ） 执行方法：在cmd下进入wcp所在目录，如 E:\My Learns\编译原理 然后执行如下 E
RSA.tar
- 判断一个大数是否是质数（512比特以上的大数）-To determine whether a large number is prime (512 bits or more of the large numbers)
primeNumber
- 求1000以内的质数，自己实现的程序，算法的时间复杂度较好-Find prime numbers less than 1000
F3_
- 一个质数判断算法，判断一个数是否为质数！-Just if "zhishu"
zhishu
- 质数的编法，希望通过这个可以帮助您了解偶数等等的编法-Prime numbers compiled method, hope this helps you understand the weave even more
4-1
- 任意输入两个数，可以求这两个数之间的所有质数。-You can gain all the prime numbers between the two numbers you input.
primesToFile
- 搜索质数，并将其输出至文件，路径在程序中设置。-put primes to file
mingzi
- 求100以内的质数算法，实现快速找质数，简洁易懂-The prime algorithm within 100
E
- 检测哥德巴赫猜想的代码，把一个大于等于6的偶数，分成两个奇质数的和！-Goldbach conjecture code detection, a greater than or equal to 6, even, into two odd primes!
01_PrimeNumberFinder
- 这是prime number finder的程序，也就是对质数的判别和寻找。-This is a prime number finder program, which is the identification and finding prime numbers.
Judgment-is-one-number-for-primes
- 判断一个数是否为质数 采用较先进的方法 速度较快-Judgment is one number for primes Use advanced method faster
prime-parallel
- 使用并行算法求解质数,求解速度基本上可以做到2倍的加速比-primes with parallel code
Sieve
- Sieve算法实例，找质数的算法，找出2到x之间的所有质数的算法-Sieve algorithm instance, the algorithm to find prime numbers, from 2 to identify all the prime numbers between x algorithm
4give-all-primes
- 由读者自行给出人一个数据，则输出这一范围内的所有质数。-To give all primes as a output if you give specified number.
DOS
- 质数判断，转速判断， 质数判断，转速判断， 质数判断，转速判断，-zhishu panduan，zhishu panduan，zhishu panduan，zhishu panduan，zhishu panduan，
test
- 实现查找大于某个数的最小质数，只需要实现输入这个数-Find more than a few to achieve the smallest prime number
Eratoshenes
- eratoshenes素数筛选，本源码是通过标记数组下标来记录1000以内的质数-eratoshenes prime filter, the source is through the tag array subscr ipt to record prime number those are less than 1000
Calculate-prime-number-less-than-100
- 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100