搜索资源列表
14
- 算法功能：输入一个正整数，若其是素数，将其输出，否则，找出与其最邻近的素数，并输出这个素数。-Algorithm functions: enter a positive integer, if it is a prime number, output, otherwise identify their nearest prime number, and outputs the primes.
primNum
- 找到1到2000的素数,并找出连续整数和为1898的个数-1-2000 to find the prime numbers, and to identify 1898 consecutive integers and the number of
5
- 编一个程序找出所有的由四个不同数字组成的素数。-Find all by four different number of primes.
findsushu
- 用筛选法可得到2～10000之间的所有素数，找出此序列中最长的等差序列（连续的和不连续的两种）。例如：3，5，7 为一连续等差序列，长度为3，公差为2；而7，13，19 为一不连续等差序列，长度为3，公差为6。-2 with the screening method available for all prime numbers between 10000 to find out the sequence of the longest arithmetic sequence (continuou
4_12primenumber
- 输入正整数i和n，由程序负责从i开始找起，连续找出n个素数并显示在屏幕上-Enter a positive integer i, n, the program is responsible From i started looking on, to find n consecutive primes and displayed on screen
Magic-square
- 魔方阵 （1）.设n是奇数，请编写程序构造n*n阶魔方阵，即行、列、两对角线上n个数之和相等的方阵。 （2）.构造3*3素数魔方阵，即找出9个不大于500的素数并排成魔方阵。 -Magic square (1) n is an odd number, please write a program to construct n* n-order magic square that line, column the two diagonal n numbers equal to the
sushu
- 实现了素数的拆分和。只是很简单，没写麻烦的，复杂的可找我，-Realized primes splitting and. Very simply, I did not write cumbersome and complicated to find me, Oh
findprimenumber
- VS2008 下利用筛选法 实现找素数！-VS2008 use screening method to achieve the next to find prime numbers!
find-prime-number
- 用C++语言找出1到1000内所有的素数，希望广大朋友的支持-With C++ language to find all primes within 1-1000, hope that the majority support of friends
zhaosushu
- 这是一个书本上的找素数c++代码，适合初学者，希望你能喜欢-it’s a simple code
7_1
- 按钮"第一题"：找出100-200之间的所有素数，并对它们求和。 按钮"第二题"：求S=a+aa+aaa+……+aaaa…a的值。 按钮"第三题"：斐波那契数列 按钮"第四题"：编写程序，打印图形。 -Button " first question" : find all the prime numbers between 100-200, and summing them. Button " second question" : seeking S = a+aa+aaa+ ..