搜索资源列表
prolog
- 用Prolog写的一些基本函数，如compress, decompress, pack, gcd, duplicate, sort-Some fundamental functions written in Prolog, such as compress, decompress, pack, gcd, duplicate, sort.
gcd
- oujilide suanfa de kuozhansuanfade shxiamzj jdsa lfjdas f-Euclid suandafa a ldjfdkuodahznadnfa,dfna dsfjdas fjdas
mimaxue
- 内含背包程序，RSA程序，中国剩余定理程序和GCD程序的源代码-Includes backpack program, RSA program, Chinese remainder theorem programs and GCD program' s source code
Shell_Scripting
- Sample programs of shell scr ipting. finding the maximum no. finding the gcd of a no. etc.
gcd
- AntNet :Routing in Communication Networks -AntNet :Routing in Communication Networks
VHDLcodes
- Behavioral descr iption of ALU, RAM MODULE, ROM MODULE, DIVIDE BY N COUNTER, GENERIC DIVIDER 2n+1, GCD CALCULATOR, GCD FSM CODE, JK FLIP FLOP in VHDL . These are fully synthesized codes with optimization.- Behavioral descr iption of ALU, RAM MODULE,
gcd
- greatest common divisor c-greatest common divisor c++
Desktop
- 求两个数的最大公约数gcd()和仿射加密解密的c++算法- Asks two numbers the greatest common divisor gcd() c++ algorithm
hi-precision
- 实现大数操作的算法模板，重载了基本操作（+，-，* ，/），取模，次方，gcd等-Operation of the algorithm to achieve large numbers templates, overloads the basic operation (+,-,*, /), modulus, power, gcd, etc.
gcd_lcm
- 给出两整数a与b, 找出a与b的最小公倍数LCM(a,b), 找出a与b的最大公因子GCD(a,b).-finds the LCM(Lowest Common Multiple)/GCD(Greatest Common Divisor) of two positive integers
power shell
- A Sample program on Microsoft Powershell. It have functions of Mathematical functions such as GCD,
VHDLvsVerilog
- This document is in two parts. The first part takes an unbiased view of VHDL and Verilog by comparing their similarities and contrasting their differences. The second part contains a worked example of a model that computes the Greatest Common Divisor
GCD
- 用VC++ 开发AutoCAD的一个简单的示例代码-a simple sample of VC++ developing autoCAD
GCD
- Help to find the Greatest Common Divisor of Numbers
gcd_lcm
- 求两个100以内整数的最大公约数和最小公倍数，只用加法和减法运算-Find the greatest common divisor of two integers less than 100 and the least common multiple, only addition and subtraction
num.cpp
- 数论mod有关算法 丢翻图方程 线性同余方程解 原始根 gcd exgcd 中国剩余定理 需要高精度库gmpc-gcd exgcd diophantic equation linear congruence Chinese reminder square root primitive root
013
- 通过字符串操作模拟控制台的cd命令，要求至少完成 “cd 【目录名】”、“cd ..” 和“cd \” 三个命令。实例可以参考:开始->运行->cmd->键入上述三个命令观察提示符前的字符串变化，帮助可通过cd /?显示；可使用字符串处理函数。并用此程序练习和熟悉调试过程。 实验014：重写实验007和012，要求使用函数IsPrime实现判断一个数是否是素数，GCD返回两个数的最大公约数，LCM返回两个数的最小公倍数，并在main中调用。-Through the stri
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
mycode
- hdu 1695 GCD (增加点字符）-hdu 1695 GCD (increased dot character)
lab2
- 定义一个分数类，用两个整数数据成员表示分数的分子和分母，成员函数包括求两个整数的最大公约数gcd()和最小公倍数lcm()的函数，再定义构造函数、获取分数、打印分数、实现分数四则运算的成员函数。 计算结果仍用分数表示并调用gcd()，lcm()成员函数化简-Define a fraction of class, with two integer data members of the numerator and denominator of the fraction, member functi