搜索资源列表
shusu
- 计算素数:列出所有素数,并计算出素数的总数.涉及到链表,代码通俗易懂-List all prime numbers, and calculate the total number of prime numbers.
PrimeNumber
- 使用visual c++开发的判断一个数是否是素数的程序-Using visual c++ development to determine whether a number is prime program
aaaa
- 编辑一个函数,讲任意数m,确定m及紧靠进m的k个素数保存在xx文件并传回-Edit a function, say any number m, determine m and k m, close into prime numbers saved in the file and return xx
CPPPrimer.EnglishaChinese.4th
- C++ Prime是久负盛名的C++经典教程,其内容是C++大师Stanley B. Lippman丰富的实践经验和C++标准委员会原负责人Josée Lajoie对C++标准深入理解的完美结合,已经帮助全球无数程序员学会了C++。本版对前一版进行了彻底的修订,内容经过了重新组织,更加入了C++ 先驱Barbara E. Moo在C++教学方面的真知灼见。既显著改善了可读性,又充分体现了C++语言的最新进展和当前的业界最佳实践。书中不但新增大量教学辅助内容,用于强调重要的知识点,提醒常见的错误,
1Fund1
- 判断一定范围内有多少个素数,可以变换范围,以MFC变成,文本框显示-Within a certain range to determine the number of prime numbers, you can change the scope of the MFC into the text box displays
Goldbach-Conjecture
- 进行哥德巴赫猜想的数据实验,即输入一个比6大的数,输出x=a+b,x为输入,a、b分别为x的两个素数质因数。-The experimental data Goldbach' s conjecture, that is to enter a larger number than 6, the output x = a+ b, x as input, a, b are the two prime x prime factors.
gedebashi
- 歌德巴斯猜想:1.每个不小于6的偶数都可以表示为两个奇素数之和;2.每个不小于9的奇数都可以表示为三个奇素数之和。-Song De Basi guess: 1 each even-numbered not less than 6 can be expressed as the sum of two odd prime 2 each odd number not less than 9 can be expressed as the sum of three odd primes.
zhishu
- 打印质数的各种算法,首先介绍了教科书上的实现方法,然后从减小时间复杂度的方向出发,介绍了几种打印质数的算法,C++实现。-The number of print quality algorithm, first introduced on the implementation of textbooks, then reduce the time complexity from the direction, describes several printing prime numbers algo
PrimesTest
- 输出一定范围内的素数,判断一个数是否为素数-Output within a certain range of prime numbers, to determine whether a number is prime
guessnum
- 利用Java于言表编写一个面向对象的程序,判断从键盘输入的一个数是否为素数-Use Java to write a table in the words of object-oriented program, input from the keyboard to determine if a number is prime
a
- 1) 利用求n!的方法计算 2!+4!+5!的值。分别利用递归和非递归方法实现求n!。 2) 编写根据三条边求三角形面积的方法。利用该方法求以下两个三角形面积。 (1)三条边分别为:3,4,5 (2)三条边分别为:5.3, 6.2, 8 3)从命令行参数获取两个整数,找出两个整数之间的所有素数,每行输出3个数。-1) use the method seek n! 2!+4!+5! Value. Are recursive and non recursive method seek
ex6_19
- 从命令行参数获取两个整数,找出两个整数之间的所有素数,每行输出3个数。-From the command line parameters for two integers, find two integers all prime numbers between each line of the output number 3.
sgu-499
- 题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 -Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers
java
- 求和,平均数,数的阶乘,以及素数的运算。-Sum, average, the number of factorial, as well as computing prime numbers.
primesrennting
- 线性素数筛选发&0到100万的因子个数 ACM简单算法,筛选法,线性筛选加上因子数-Linear prime screening hair & 0 to 1 million the number of factors ACM simple algorithm, filtering, linear filtering with the number of factors
primefactor
- 素数分解:、在许多情况下,知道一个数是素数还不够,还需要知道它的约数。每个大于1的正整数都能表示为素数的乘积。这个因数分解是唯一的,被称为素数分解(prime factorization)。例如60可以分解为2x2x3x5,其中每个约数都是素数。注意,同一个素数在因数分解中可以出现多次。 -Prime decomposition: in many cases, know that a number is prime is not enough, it also needs to know a
Programto-generaterandomnumbers
- 产生随机数的C++程序,可以生成大素数,解决了rsa算法的随机数产生问题-Generate random numbers in C++ program that can generate large prime numbers rsa algorithm to solve the problem of the random number generator
eladuosai
- 是一种从按照顺序排列的所有自然数中找出素数的方法-Is an order from all natural according to the number of ways to find prime numbers
for
- 歌德巴赫猜想,任何一个大于六的偶数可以拆分成两个质数的和 打印出所有的可能 //任何一个大于六的偶数可以拆分成两个质数的和 //打印出所有的可能 -Goldbach conjecture, any even number greater than six can be split into two prime numbers and print out all possible// any even number greater than six can be split
creatchildprocess
- 计算某个数字上限内的所有质数,数字限于正整数-calculate all prime numbers smaller than input number