搜索资源列表
PrimeSingle
- 求某范围内得素数，我们多核试验提供得，老师让把它并行化-A framework for a prime number, we provide a multi-core test, the teacher let it parallelization
prime_judge
- 米勒拉宾算法判断大质数，对质数的判断为必要条件，而非充分条件-Algorithm to determine米勒拉宾large prime number, confront a number of necessary conditions for the judge, not a sufficient condition for
e11
- 求球体的表面积 判断一个数是否为素数 求球体的表面积 判断一个数是否为素数-Sphere of surface area for a few to judge whether the prime number for a sphere of surface area to determine whether the number of prime numbers
rsa
- rsa 的C语言实现 实现加密解密和素数生成功能-rsa the C language to achieve the realization of encryption and decryption and the prime number generation function
sushu
- 判断一个数是否是素数，判断一个数是否是素数。-To determine whether a number is prime number, to determine whether a number is prime.
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
RSA
- RSA公钥加密的基本实现 bmp灰度图片加解密操作包括 RSA 的加减密算法； 素数检测算法；RSA 密钥生成算法； 应用该 RSA 密码体制加、解密； BMP 灰度图的算法； Pollard p-1 算法 ； Pollard r 算法 ； -RSA public key encryption to achieve the basic gray-scale picture bmp including RSA encryption and decryption operations of addi
PrimeNumber
- This program is to output the prime number that you want.
RSA_CS
- C#的RSA加密解密算法程序，罗宾-米勒素数检验法，学信息安全的同学可以拿去-CSharp the RSA algorithm for encryption and decryption procedures, Robin- Miller, prime number test, students learn information security can be taken away
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[?]的
Rei07
- 求質數法 判斷n是否為質數 時，將n除以n以下的整數直至2為止，以觀察n能 除盡，這時如有被除盡的數，便被視為非質數而脫離出回圈。到了最後如無除盡的數，則此數即為質數。-Seeking qualitative method to determine whether the prime number n to determine whether the prime number n will be n divided by n integers until 2 the followi
403
- 简洁的素数判断程序，输入数据，即可显示，也可以稍加扩展，变成大范围的判断-Simple prime number judging procedures, input data can be displayed, you can easily expand into a wide range of judgments
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.
sushu
- 程序主要实现从一组数中选出素数，并将其输出的功能-Major implementation procedures from a group of several selected prime number, and the output function
Judging
- 判断一个素数能被几个9整除.1.程序分析： 2.程序源代码： -Judging whether a prime number can be divisible by some 9
1
- 1.输入一个数,并以它为边长画出一个用*组成的正方形. 2．求解满足1*1+2*2+...n*n<1000的i的最大值. 3．求1~1000中的完数 4．输入一个数,并判断它是否为素数（这是return 语句的巧用） 5．输出0~100中所有不能被3整除的数-1. Enter a few, and to its side length* component used to draw a square. 2. Solving Satisfied 1* 1+2* 2+ .
s
- 6． 素数环问题 把从1到20这20个数摆成一个环，要求相邻的两个数的和是一个素数。 分析：用回溯算法，考察所有可能的排列。 -6. Prime numbers loop problem 1-20 from 20 before the number into a ring, adjacent to both the number of requests and is a prime number. Analysis: The retrospective algorithm, exam
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