搜索资源列表
GCD_LSB
- GCD and LSB algorithm.
front
- java写的类pascal编译器，实现program test(input, output) begin read(x, y) write(gcd(x, y)) end. -java pascal compiler writing class, to achieve program test (input, output) begin read (x, y) write (gcd (x, y)) end.
gcd3
- 用verilog代码编写的GCD即找两个数之间的最大公约数的FPGA工程。-Verilog code written with the GCD of two numbers that find the common denominator between the FPGA project.
gcd_performence
- 基于流水线设计的性能优先的gcd算法的verilog 代码 频率可达500M-based pipeline design gcd for high clock
GCD1
- GCD算法的FSMD实现。即利用有限状态机和数据路径-GCD algorithm order which FSMD using finite state machine and data path
gcd2
- GCD算法的FSM+D实现。即利用有限状态机和数据路径分开-GCD algorithm of the FSM + D realize it is using finite state machine and data path separate
main.cpp_1
- This program calculate if two numbers are coprimes For given integer N (1<=N<=10^4) find amout of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only
GCD_Clac
- A VHDL code to calculate GCD of two four bits binary numbers.
GCD_Verilog
- 利用Verilog语言写的采用更相减运算的球两个数的最大公约数-Using Verilog language written using a subtraction ball number two of the greatest common divisor
gcd.cpp.tar
- SystemC Sourcode to get the Greatest Common Divisor out of two numbers.
Networked-Physics-Demo---GDC-2010
- gcd的使用，物理引擎的使用，ios网络编程-networked physics demo- gcd
extended-euclid
- 经典的Extended-Euclid算法，计算GCD-implement Extended-Euclid
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.