搜索资源列表
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
prime
- 素数环: 把从1到10这10个数摆成一个环,要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始,每个空位有9种可能,每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数(最后一个和第一个也要满足)。 〖算法流程〗 1、数据初始化; 2、递归填数: 判断第J种可能是否合法; A、如果合法:填数;判断是否到达目标(10个已填完): 是,打印结果;不是,递归填下一个; B、如果不合法:选择下一种可能;-Prime Centra
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
prime
- 利用数学的概念来检查任意输入数值是否为质数-The concept of the use of mathematics to check whether any numerical input prime number
prime
- 一是利用计算机对正整数进行素因子分解认识素数,通过运用筛法与试除法寻找一定范围内的素数,体会到筛法比试除法有效但无法找出所有素数;二是通过若干特殊形式的素数的研究,寻找素数生成公式,发现一些结论;三是借助于非线性拟合技术,观察素数分布规律,利用其研究有关数论问题。-The first computer was used to prime factor decomposition of positive integers understanding of prime numbers, throug
Prime
- 输入一个整数数据并求大于该数据的的最小素数-Enter an integer data and the data request is greater than the smallest prime number
prime-number-1
- 素数填表问题 素数填表问题 素数填表问题 素数填表问题-Problems filling prime prime prime problem filling filling filling prime problem problems problem filling prime prime prime problem filling filling problems
Calculate-prime-number-less-than-100
- 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100
HNU-12043-Prime-NumberAgain
- HNU 12043 的源代码。 核心代码为快速筛选素数-HNU 12043 source code. Rapid screening of the core code for the prime number
Prime
- This a Program that computes nth Prime number-This is a Program that computes nth Prime number
Prime-judgment
- Prime judgment , you can get an integer jugded if it is an prime number after you put it in.
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
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.
is-it-prime
- 判断一个数是否是素数的小程序,经过编译即可使用-Determine if a number is prime number of small programs compiled can be used
Quick-Prime
- Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.-Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.
output-prime-number
- 判断101-200之间有多少个素数,并输出所有素数。-output100-200 prime number
prime
- simple prime number find in C++