搜索资源列表
codes
- 1) it is code which gives lcm and gcd of 2 numbers. 2) to check if a number satisfies 2 out of 5 condition. 3) to check if the number is odd or even. 4) to square a given number. 5) to find number of 0s and 1s in a given binary number.
oujilide
- 广义欧几里得算法，用以计算两个数的最大公约数，依靠定理定理：gcd(a,b) = gcd(b,a mod b)-Generalized Euclidean algorithm for computing the greatest common divisor of two numbers, relying on Theorem Theorem: gcd (a, b) = gcd (b, a the mod b)
gcd
- 求两个数的最大公约数，此程序用C语言编写，经测试没有问题。-For two of the largest number of companies, the program written in C, tested no problem.
1
- 分别编写求两个数值（可以是浮点数，整数或字符）最大值，最小值和平均值的函数maximum, minimum, meanValue。另外，编写一个函数gcd求两个整数的最大公约数。-Respectively write to demand the two values (which can be floating-point, integer or character) maximum, minimum and average function of the maxim
gcd
- 根据控制点和道路中心线的坐标值，利用距离加权平均法内插每个点的高程值，最终生成有Z值的道路边线。-According to the coordinates of control points and road centerlines, using the interpolated elevation value of each point from the weighted average method, the resulting Z value of the road edge.
gcd
- 最大公约数程序，使用多种方法来计算最大公约数-The greatest common divisor of the program, using a variety of methods to calculate the greatest common divisor
1-(a-b)
- 此程序为利用广义欧几里德算法求解最大公约数GCD-This procedure for the use of the generalized Euclidean algorithm for solving the greatest common divisor GCD
GCD_Control
- GCD控制器，该模块功能比较简单，适合初学者。易扩充。-GCD controller, the module is relatively simple for beginners. Easy to expand.
gcd
- 使用欧几里德算法和STEIN算法计算两个整数的最大公约数-compute the greatest common divisor of two integers
GCDP
- 演算法-透過輾轉相除法求出最大公因數, 再透過最大公因數求最小公倍數,最大公因數(GCD)可以使用輾轉相除法來求，最小公倍數(LCM)則由這個公式來求 : GCD * LCM = 兩數乘積-Algorithm- through Euclidean division to find the greatest common factor, through the greatest common factor and least common multiple and greatest com
gcd
- 在CAD中展点；加载完代码后在cad 命令行输入zd然后根据命令提示操作就可也，我的默认点文件是放在"d://myfile.txt"其中点名，X,Y,H用逗号隔开。-Exhibition points in CAD finished loading code cad command line input zd then operate according to the command prompt can also default point file is placed in the &qu
gcd
- 实现求两个正整数的最大公约数和最小公倍数，代码简洁算法简单，适合初学者VC6.0平台-Seek the greatest common divisor and least common multiple of two positive integers, the code simple algorithm is simple, suitable for beginners VC6.0 platform
RSA
- RSA 数字签名的基本思想 RSA数字签名的安全性依赖于大数分解的困难性。 1、参数与密钥生成 首先选取两个大素数p和q，计算 n=pq 其欧拉函数值 （p-1）*（q-1） 然后选取随机整数e，满足 gcd（e，（p-1）*（q-1））)=1 并计算 d=e^-1 mod（（p-1）*（q-1）） 则公钥为（e，n），私钥为d；p，q是秘密参数，需要保密。如不需要 保存，计算出e，d后可销毁。 2、签名算法 设
gcd
- 通过输入的控制，比较两个数的大小，再求取两个数的最大公约数-By the input control, comparison of two numbers, size, and then calculate the greatest common divisor of two numbers
iOS_gcd.pdf
- 比较专业的并发编程介绍资料，详细介绍了 gcd的使用，以及block的知识也有一定的涉及，很经典！-Concurrent programming professional brochure details the the gcd use, as well as block knowledge involving very classic!
GCD
- 求最大公约数和最小公倍数的算法，输入任意里两个整数，输出他们的最大公约数和最小公倍数。-Seek the greatest common divisor and least common multiple of the algorithm, enter any two integers, and output their greatest common divisor and least common multiple.
GCD
- 可以很好的实现求解最大公约数，并且语法结构易懂-Good solving the common denominator, and easy to understand
hdlsrc
- In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more integers(at least one of which is not zero), is the largest positive integer that divides the numbers wi
ACM.algorithm
- 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms templat
CoreDataTest
- 实现Core data 的异步存储：使用GCD异步存储数据，并且实时更新UI-Asynchronous achieve Core data storage: Use GCD asynchronous data storage and real-time updates UI