搜索资源列表
Prime
- 这是研究生课程计算方法与技术中讲到的Prime算法的具体实现，相信学这个课的同学都会感兴趣的。-This is the postgraduate courses calculation methods and technologies referred to the Prime algorithm to achieve specific, I believe that this course of study students will be interested.
shushu
- 求素数的程序，用了一些标准库．不难，但很有用-Prime number for the procedure, using a number of standard library. It is not difficult, but very useful
prime
- 题目 质数分解与栈的使用 简介 只能被自身和1整除的正整数称为质数。每一个整数都可以写成质数乘积的形式，称为整数的质数分解。例如： 1776 = 37 x 3 x 2 x 2 x 2 x 2. -Title prime number decomposition and the use of stack profile only divisible by themselves and a positive integer is called prime number. Ever
prime
- 快速求素数，用到了概率算法。可以求出相当大范围内的素数，远远优于普通的素数算法-Fast seek primes, using a probability algorithm. Can be obtained within the scope of a large prime number, which is far superior to an ordinary prime number algorithm
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
Prime
- Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
prime
- 大二数据结构程序代码 实现prime算法-Sophomore data structure to achieve prime code algorithm
hangdian1016
- Prime Ring Problem 杭州电子科技大学ACM在线判定系统的1016题素数环，本人自己写的算法，有兴趣的同学可以拿去参考下，正常情况是可以AC的-Prime Ring Problem, Hangzhou University of Electronic Science and Technology ACM determine the system' s 1016 title-line prime ring, I write their own algorithms, in
prime-number-1
- 素数填表问题 素数填表问题 素数填表问题 素数填表问题-Problems filling prime prime prime problem filling filling filling prime problem problems problem filling prime prime prime problem filling filling problems
Prime
- Prime算法生成最小生成树，使用GDI+将最小生成树画出-Prime algorithm to generate minimum spanning tree, minimum spanning tree to use GDI+ to draw
Prime
- prime算法实现，求图的最短路径，算法课的作业-prime algorithm, find the map of the shortest path algorithm homework assignment
prime
- 图论的最小生成树问题——Prime算法的C语言实现-Graph theory, minimum spanning tree problem- Prime algorithm in C language
find-prime-numbers-code
- 此代码可以高效的求出所1到1200000的素数，具体的范围可以根据需要修改代码-This code can efficiently find the prime numbers 1-1200000, the specific scope may need to modify code
prime
- 输入一个数，判断这个数是否为素数的C语言代码- Enter a number to determine if the number is prime in C language code
PRIME-TEST
- 素数测试问题, 如果把乘、除法（包括取模）看成常数时间， 则算法的时间复杂度为 (k)= (log m)=O(log n)。 而当n极大时，与n在同一数量级的两个数相乘除， 不超过O(log2n)次二进制位操作。 ∴算法的时间复杂性为O(log3n)二进制位操作 -Prime test, If the multiplication, division ( including the modulus as a constant
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 n ) algorithm ( M = n) A
find-prime-numbers
- 利用C语言实现从3-1000之间找出所有的素数，算法比较简洁-Just use the most simple C language to find all the prime numbers between 3 and 1000
Prime
- 判断用户输入的一个数字是否为素数，并对一个数字进行因式分解-Judgment entered by the user whether a number is prime, and a factoring numbers
output-prime-number
- 判断101-200之间有多少个素数，并输出所有素数。-output100-200 prime number
prime
- simple prime number find in C++