搜索资源列表
susu.zip
- 任意合数分解成质数的程序,Arbitrary composite number into prime number of procedures
pprime
- 因为151即是一个质数又是一个回文数(从左到右和从右到左是看一样的),所以 151 号是回文质数。 写一个程序来找出范围[a,b](5 <= a < b <= 100,000,000)间的所有回文质数 -The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backw
primes_omp
- 使用OpenMP方法求解质数,来自原书,但做了个人的修改,效率更高-more efficient with myself
java
- 一些java初学者适合的java源代码 里面有判断质数,判断月份的天数,进制转换等等好多有用的源代码 -Some beginners java source code for the java prime number which has to judge, to determine the number of days in January, hex conversion, and so a lot of useful source code
chufa
- 化简分数到最简 目前只支持质数小于10000的情况-Simplification of scores to the most Jane prime number currently only supports the case of less than 10000
prime_judge
- 米勒拉宾算法判断大质数,对质数的判断为必要条件,而非充分条件-Algorithm to determine米勒拉宾large prime number, confront a number of necessary conditions for the judge, not a sufficient condition for
C
- 第一部分 基础篇 实例1 第一个C程序 2 实例2 求整数之积 6 实例3 比较实数大小 8 实例4 字符的输出 10 实例5 显示变量所占字节数 11 实例6 自增/自减运算 13 实例7 数列求和 14 实例8 乘法口诀表 17 实例9 猜数字游戏 19 实例10 模拟ATM(自动柜员机)界面 22 实例11 用一维数组统计学生成绩 24 实例12 用二维数组实现矩阵转置 26 实例13 求解二维数组的最大/最小元素 29 实例14 利
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
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
zhishupanding
- 这是一个质数判定的小程序,输入任意数字,判定是否为质数-This is a prime number of small procedures to determine, enter any number, to determine whether the prime number
primes
- 关于质数的一些程序,是我看了一本关于质数的书后把其中容易实现的算法用MATLAB写出来的。有质数的检验,各种猜想的检验等。-Prime number on some of the procedures that I have read a few books on the quality of which easily achieved after the algorithm using MATLAB written. Qualitative test of a few, all kinds o
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
SimpleEncryptionAlgorithm
- 简单的加密算法,可逆与不可逆 数据加密: 算法1:(不可逆) 将ASCII表中32~~126中的字符,加密后,显示为128~~255的字符. 128~~255的字符会让人看起来头痛些。。。。。。安全. 当ch[?]的值为偶数时:ch[?]=255-ch[?]的个位*10-ch[?]的十位 当ch[?]的值为奇数时: ch[?]=128+ch[?]的个位*10+ch[?]的十位 当ch[?]的值为质数时:ch[?]=128+ch[?]的个位
SimpleEncryptionAlgorithmReversibleAndIrreversible
- 简单的加密解密算法,可逆与不可逆 数据加密: 算法1:(不可逆) 将ASCII表中32~~126中的字符,加密后,显示为128~~255的字符. 128~~255的字符会让人看起来头痛些。。。。。。安全. 当ch[?]的值为偶数时:ch[?]=255-ch[?]的个位*10-ch[?]的十位 当ch[?]的值为奇数时: ch[?]=128+ch[?]的个位*10+ch[?]的十位 当ch[?]的值为质数时:ch[?]=128+ch[?]的
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.
Goldbach
- 哥德巴赫猜想: 将一给定的偶数表示成两个质数之和被称之为此数的哥德巴赫分割。例如, 4 = 2 + 2 6 = 3 + 3 8 = 3 + 5 10 = 3 + 7 = 5 + 5 12 = 5 + 7 14 = 3 + 11 = 7 + 7 … 换句话说,哥德巴赫猜想主张每个大于等于 4 的偶数都是哥德巴赫数-可表示成两个质数之和的数。[1]另有对奇数的相似猜想,称之为李维猜想。 -Goldbach s conjecture:
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
Programme
- 求面积,数值转换,求出质数,由小到大顺序输出数值,求出字符串长度-the length of the string