搜索资源列表
3x3填质数问题
- 3X3填质数问题，在一个3×3的矩阵中填写1－10的数字，保证上下左右相加都是质数-3X3 fill several quality problems in a 3 3 matrix to fill in the figures 1-10, ensuring that all about is the sum of the number of quality
AlgorithmCode
- 海明码 出站入站序列 非递归生成树 九格填质数 七子控棋盘等等算法-Haiming yards out station stops recursive sequence-9 grid spanning tree fill several seven-quality control algorithm chessboard, etc.
Erathosthenes
- Erathosthenes给一个自然数a，判断是否为质数，最高效的-Erathosthenes to a natural number one, to determine whether the quality of a few, the most efficient. .
prime_number_upright
- 质数竖式 下面的竖式是一个乘法运算问题，它的每个＊号可以代入一个数字， 这个数字属于一个特定的由N个数字组成的集合。如果这个集合是｛2，3，5，7｝， 那么这个竖式称作“质数竖式”。 此程序就是为了解决这样一个问题而做的。-few quality below the vertical shaft is a multiplication problem, it * can each generation into a number of This is a specific N-d
fanzishu
- 反质数解题报告，汲及一个数与其约数”的关系
zhishupanduan
- 计算机专业同学初学C++，质数的判断，算法实现是必须完成的课题
2-8
- 在9（3*3）个方格的方阵中填入数字1到N(N>=10)内的某9个数字 每个方格填一个整数，要求相邻两个方格的两个整数之和为质数。 试求所有的解-in 9 (3 * 3) grid matrix to fill out a number of N (Ngt; = 10) of a nine figures each box filled an integral require two adjacent box at the two integral to the quality and n
质数圈-c++
- 质数环,运行程序自动生成一定范围内的质数环,即相邻俩数之和为质数-prime Central, a program to run automatically generated within a certain range of standard ring, the two neighboring few and as a prime number
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
myprogrom
- 下楼问题，质数问题，分书问题，开灯问题，排球问题，排课问题，等c++源码-Problem downstairs, prime number problem, sub-book questions, questions turn on the lights, volleyball questions, Course Scheduling problem, such as c++ source code
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
PrimeNumber
- 一个用来计算质数的小程序，可以把每次计算的结果保存，下次可以接着从上次的结果开始重新计算-One used to calculate the prime number of small programs, can save the results of each calculation, the next can then start from the last recalculation of the results of
mingzi
- 求100以内的质数算法，实现快速找质数，简洁易懂-The prime algorithm within 100
Sieve
- Sieve算法实例，找质数的算法，找出2到x之间的所有质数的算法-Sieve algorithm instance, the algorithm to find prime numbers, from 2 to identify all the prime numbers between x algorithm
fenjie
- 里面描述了将一个数分解成若干个质数的乘积的形式的算法，很简洁，希望能给大家一点儿启发。-it describes the split method of a data to a series .
EKG
- 使用动态规划高效求解EKG序列。EKG序列现在在质数研究方面有着非常重要的意义，而且EKG序列在医学等方面也有应用。-To get the EKG sequence.
nprime
- 给定一个整数N（2 <= N <= 8），生成所有的具有下列特性的特殊的N位质数：其前任意位都是质数。-Given an integer N (2 < = N < = 8), to generate all of the following characteristics of the particular N-bit prime number: it before any bits are prime numbers.
zhishu-fenjie
- 将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。 程序分析：对n进行分解质因数，应先找到一个最小的质数k，然后按下述步骤完成： (1)如果这个质数恰等于n，则说明分解质因数的过程已经结束，打印出即可。 (2)如果n <> k，但n能被k整除，则应打印出k的值，并用n除以k的商,作为新的正整数你,重复执行第一步。 (3)如果n不能被k整除，则用k+1作为k的值,重复执行第一步。 -The prime factorization of a
15
- c语言入门，数组的应用，利用数组求前n个质数,通过数组处理数学问题- c language portal, application of the array, use an array of the first n primes seeking to deal with an array of mathematical problems by
primenumber
- 输入一个数字，按回车，然后输出能被这个数整除的所有数。也可以变换下程序用以检测输入的数字是否是质数（或素数）。-Enter a number, press Enter, and then output this number can be divisible by all the numbers. Transformation program can also detect whether the input to digital is a prime number (or prime).