搜索资源列表
10301_PrimeCalc
- 质数计算器:判断一个数字是否为质数。C#编写,使用新进程进行计算,可在计算中直接退出;带有错误捕捉。-A calculator: test whether a number is prime. writing in C#, using the new process to calculate, can be directly out of the calculation with the wrong capture.
prime-number
- 求解质数,利用bitset实现,非常适合求解答大质数。-Solving prime number, use bitset implement, ideal for large prime numbers seeking answers.
29
- 用穷举法找出1~100之间的质数,并显示出来,分别使用while,do……while,for循环语句实现-To find prime numbers between 1 to 100 with the brute-force method, and displayed, respectively while, do ...... while, for loop to achieve
Prime_num
- 求取质数,输入数值选取区间,自动生成随机数,并对求取质数进行和、平均数、中位数的求取-Calculate the prime, the input value selection range, automatic generation of random Numbers, and to calculate the prime Numbers and calculating, average, median
10301_PrimeCalc
- 质数计算器:判断一个数字是否为质数。C#编写,使用新进程进行计算,可在计算中直接退出;带有错误捕捉。我的第一个C#程序-standard calculator : Judging whether a digital standard. C# development, the use of the new process, which can be calculated directly With the wrong capture. My first one C# procedures
chufa
- 化简分数到最简目前只支持质数小于10000的情况-Simplification of scores to the most Jane prime number currently only supports the case of less than 10000
CPP117
- 利用Visual C++可视化编程环境来实现矩阵的转置、计数器的编写、质数的计算等功能。-Visual C++ using visual programming environment to implement the matrix transpose, the counter written, the calculation of the number of quality features
1
- flirly 精通数学,经常研究数学问题。对于质数这种问题更是无敌。 对于N个不同的质数P1,P2.....Pn,用这些质数作为项(允许重复),任意组成一个数列,使这个数列的任一连续项的乘积不是完全平方数。 求出这种数列的项数的最大值,flirly想知道这个值的大小,由于结果可能很大,只需要输出对一个给定正整数m取模后的结果即可。你知道这个 结果吗? -Standard input will contain multiple data sets. Each data set c
PRIMES
- 输入2个整数,找出这两个整数中的所有质数-input a and b , find all primes between a and b
calculate
- 计算质数,并且可以显示,所计算的计算花的时间,而且可以算出在此数以下的所有质数-Prime number calculation and can be shown that the calculation for calculating the time spent, but this figure can be worked out in all the following prime number
HW3C
- 创建动态数列,可以进行数据统计,分类数据,查找质数。使用数据结构中的筛选法来进行数据分析。-Create dynamic series can be statistics, data classification, to find prime numbers. Use of screening data structure for data analysis.
Goldbach-conjecture
- 用c语言编写的哥德巴赫猜想程序,用于实现结论:任何一个大于4的偶数,都可以被拆解成2个质数之和-The program is used to achieve the conclusion of Goldbach conjecture.
shuxuegongju
- Android项目源码显示质数和素数的数学工具是一个数学工具项目源码,可以很方便的显示出固定范围的素数和质数之和或者质数的数量。是一个专业性比较强的项目。一般人用不到。-Android project source code display mathematical tool for prime numbers and prime is a mathematical tool for project source code, can easily display the number of fi
DAZHENGSHUDEYUNSUAN
- 随机大质数和大随机数产生算法的设计与实现-Design and implementation of algorithms random large prime numbers and large random number generation
dsdfs
- 对n进行分解质因数,应先找到一个最小的质数k,然后按下述步骤完成:-it should find the most small prime number
miller_rabin
- Miller-Rabin质数测试 输入 第1行:1个正整数t,表示数字的个数,10≤t≤50 第2..t+1行:每行1个正整数,第i+1行表示正整数a[i],2≤a[i]≤10^18 输出 第1..t行:每行1个字符串,若a[i]为质数,第i行输出 Yes ,否则输出 No -Miller-Rabin primality test input The first line: 1 positive integer T, said a number
zhishuhe
- 该程序是C++程序,求解前N个质数和,并且运行简单,速度快。-This is a C++ program which is used to solve the sum of the former prime number ,and this program is fast.
zhishu
- 手动输入一个数,输出从2到N之间所有的质数。-Input an integer, pick out the all prime number.
leetcode
- 计算n以内的质数个数。(由于文件小于1kb,禁止上传,所以就复制了几个副本) 采用欧拉算法,运行速度极快,100000000以内的数字,只要几毫秒就可得出结果-Calculate the number of quality within the number n. (Because the file is less than 1kb, prohibit the uploading, so I copied several copies) Euler algorithm, run fast,
sdf
- 题目:将一个正整数分解质因数。例如:输入90,打印出90 2*3*3*5。 程序分析:对n进行分解质因数,应先找到一个最小的质数k,然后按下述步骤完成: (1)如果这个质数恰等于n,则说明分解质因数的过程已经结束,打印出即可。 (2)如果n<>k,但n能被k整除,则应打印出k的值,并用n除以k的商,作为新的正整数你n, 重复执行第一步。 (3)如果n不能被k整除,则用k+1作为k的值,重复执行第一步。 -A positive integer factori