搜索资源列表
gcd
- 密码学基础中求一个元素模p的逆元素，用扩展的欧几里德算法
Euclidium
- 歐基理德輾轉相除法(之一) 以歐基理德輾轉相除法求出m，n這2個整數的最大公因數 -Reed Euclid division algorithm (one) to Euclid division algorithm Reed obtained m, n this two integers gcd
fasterEuclidium
- 歐基理德輾轉相除法(之二) m與n相差太大時，可用(m％n)來取代(m-n)，這樣的處理效率較高。以下便以此方法求出最大公因數。 -Reed Euclid division algorithm (II) m and n be too significant, the available (m％ n) to replace the (mn), this kind of treatment more efficient. The following will be obtained in t
gcd
- A simulation of a circuit to calculate GCD Greater Common Divisor.
gcd
- to get GCD(A,B)，and no recursion -to get GCD(A,B),and no recursion
gcd
- greatest common divisor c-greatest common divisor c++
Desktop
- 求两个数的最大公约数gcd()和仿射加密解密的c++算法- Asks two numbers the greatest common divisor gcd() c++ algorithm
power shell
- A Sample program on Microsoft Powershell. It have functions of Mathematical functions such as GCD,
GCD
- Help to find the Greatest Common Divisor of Numbers
two-pgm.tar
- This a program which performs GCD of two numbers written in c-This is a program which performs GCD of two numbers written in c
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
- 這是一個用來計算GCD的C++程式，輸入兩個INT就能幫你找出最大公倍數-i don t know what to upload but i want to download
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
Greatest-common-divisor-(GCD)
- 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables c
ACM.algorithm
- 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms templat
GCD
- fluent 冷凝UDF 自己改的不是网上照搬的-useful for the fluent condensation model
lcm-and-gcd
- 输入任意倆数，以极其简单的方式求出他们的最大公约数和最小公倍数，测试任意次数-output the lcm and gcd
多项式GCD
- 1。实现，用C／C++和MATLAB，欧几里德算法计算最大公司（GCD）的两个任意多项式在GF（2）。模拟和分析两给定阶数不小(1.Realize, by using c/c++ or Matlab, the Euclidean algorithm to calculate the greatest common division (GCD) for arbitrary two polynomials over GF(2). Simulate and analyze the calculatio
gcd
- gcd on c++ especially for acmers(gcdgcd on c++ especially for acmers)