搜索资源列表
chufa
- 化简分数到最简 目前只支持质数小于10000的情况-Simplification of scores to the most Jane prime number currently only supports the case of less than 10000
test
- 该程序实现的是输出间隔为100的相邻的两个质数，这是某年某公司的一个笔试题，算法很短，但是思想具有一定的参考性，编译通过，可运行-The program is the realization of the output interval is 100, two adjacent prime number, this is a company in a year, a pen test, the algorithm is very short, but thinking of a certain
sushu
- PL-SQL编程源码，该源码实现了自定义mod函数判断质数问题，经测试，结果正确。可以判断从你输入的两个数之间的全部质数并输出。-PL-SQL programming source, the source code to achieve a custom mod function to determine the question of quality, tested, the results correctly. Can be judged from the number you enter
prime
- 质性测试，小于32767一个最小的质数，使用PASCAL编写-Qualitative test, less than 32767 to one of the least prime number
zhishu
- 输入一个数，可以判断这个数是否为质数，如果是质数，则把它输出，每隔10个数换一行。-Enter a number, can determine whether the number of prime number, if it is prime number, while its output for every 10 the number of his party.
Programme
- 求面积，数值转换，求出质数，由小到大顺序输出数值，求出字符串长度-the length of the string
Asmallprimenumbercalculationprogramforapplicationd
- 一个计算质数的小程序,适合与基本应用开发-A small prime number calculation program for application development and basic
panduansushu
- 17个1怎么判断是不是质数----- 超出范围了-17 how to judge a prime number is beyond the scope of---------
famousalgorithmcollection
- <经典算法合集>其中包括: 最小生成树 MD5加密 LZW压缩 josephus 乘法表 积分 枚举 基数转换 矩阵问题举例 求解质数 圆周率的求法 改进的快速排序法 几种插入排序法 水仙花数 迷宫生成器 生命游戏 递归 回溯 贪心 动态规划 排序算法-" Classical algorithm Collection> These include:
RSA.tar
- 判断一个大数是否是质数（512比特以上的大数）-To determine whether a large number is prime (512 bits or more of the large numbers)
Eratoshenes
- eratoshenes素数筛选，本源码是通过标记数组下标来记录1000以内的质数-eratoshenes prime filter, the source is through the tag array subscr ipt to record prime number those are less than 1000
CPP
- 利用Visual C++可视化编程环境来实现矩阵的转置、计数器的编写、质数的计算等功能。-Visual C++ using visual programming environment to implement the matrix transpose, the counter written, the calculation of the number of quality features
zhisu
- 本程序通过用户输入范围而求出范围内所有的质数-The scope of this program through the user input to derive all the prime numbers within the range
PRIMES
- 输入2个整数，找出这两个整数中的所有质数-input a and b , find all primes between a and b
zhishu
- 运用函数，能够将100以内的质数求出，改动运行次数，能够求出随意的质数-Use function obtained the primes less than 100, changes the number of runs can be obtained at random primes
C++
- 计时器+质数判定,MS-DOS窗口，64位可执行文件+源代码(timer+prime number MS-DOS window)
质数
- 实现一个质数的运算，质数是除自身和1以外的数字不能被整除(The operation of a prime number)
App1
- 测试一给定大数是否为质数 ? 大数为用户输入 ? 目标为最快速度得到正确的计算结果 ? 回答时给出源代码(For the purpose of better understanding your programming skills, we would appreciate if you could complete the following tests and forward us your test result within 2 days from the date you receiv
PrimeTest
- 用VS设计的一个简单的计算输入的一个大数是否为质数(Judgement that a big integer is prime)
WpfForPrimeNum
- 用户输入一个大数，系统以最快的速度判断这个大数是否是质数。(The user enters a large number, and the system determines whether the large number is prime number at the fastest speed.)