搜索资源列表
Gdbhcx(C)
- 简易哥德巴赫猜想(任何一个大于6的偶数可以分解成两个素数，可以利用枚举法，先把偶数可以分解的所有奇数对列出，再判断是否为素数，直到验证成功为止)-summary Goldbach conjecture (any one of the even greater than 6 can be decomposed into two prime numbers. can enumeration method, the decomposition can even first of all to the
Demo
- 学习C++的最好帮手 最经典的书籍C++ PRIME PLUS
质数圈-c++
- 质数环,运行程序自动生成一定范围内的质数环,即相邻俩数之和为质数-prime Central, a program to run automatically generated within a certain range of standard ring, the two neighboring few and as a prime number
RsaTool.自己写的RSA算法工具
- 自己写的RSA算法工具。支持RSA密钥产生（包括CRT）、RSA运算、强素数生成、大数运算等功能。用了的都说好。,Writing their own tools of the RSA algorithm. Support for RSA Key Generation [including CRT], RSA computation, strong prime number generation, large numbers computing functions. Use of that goo
MFCVegaPrime1.rar
- vega prime用于军事仿真或虚拟现实,标准C++代码,VSG内核,集成于MFC中方便用户开发应用程序!,vega prime for military simulation or virtual reality, standard C++ code, VSG core, integrated into MFC in the development and application of user-friendly program!
C++PRIMER
- c++ Prime 中文版3 + 随书源码-c++ Prime Chinese version 3+ with book source
prime
- 素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法； A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个； B、如果不合法：选择下一种可能；-Prime Centra
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
asil_egemen_findPrimesParallel.c
- MPI Efficient Finding Prime
prime
- Prime algorithm in visual C-Prime algorithm in visual C++
answer-for-c-primer-plus
- c prime plus 中课后练习的答案-c prime plus the answers to the exercises
c-prime-plus
- c prime plus c prime plus c prime plus-c prime plusc prime plusc prime plusc prime plusc prime plus
C++-Primer-Plus(第五版)编程习题解答
- C++-Primer-Plus(第五版)编程习题解答(C++-Primer-Plus(fifth edition) programming problem to solve)
C语言实现的算法
- 有几个非常常用的算法比如判断是否是闰年，求三个数的最大数，判断是否是素数，输出矩阵，(There are several very common algorithms, such as whether it is a leap year, the maximum number of three numbers, to determine whether the prime number, the output matrix,)
Prime search
- 素数查找功能的程序，适用于C语言。质数（prime number）又称素数，有无限个。质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数，这样的数称为质数(The prime search function program is suitable for C language. Prime number, also known as prime number, there are infinite. The prime number is defined as a natural n
uva 583 Prime Factors
- uva 583 Prime Factors solve with C++
c
- 设一个等差数列，首元素为367，公差为186, 现在要求找出属于该等差数列中的第151个素数并输出。(An arithmetic progression, the first element is 367, tolerance is 186, now asked to find belong to the arithmetic sequence of 151st prime numbers and output.)
2.CPrimerPlus6E_code
- c prime 书籍源代码 以更好的学习c(c prime source code and this books can be a better learning c)
Prime-Number-before50
- 简易版-找从2到50的质数。只用了余数来判断，没有用到平方根作为判断条件，有待升级。编程软件用的是C-Free 5(The simple version- To find prime number from 2 to 50)
CPrimerPlus6E_code
- CPrimePlus最新版的源码和课后答案(The lastest answer and codes of C Prime Plus 6th Edition)