搜索资源列表
exer3
- 3, 采用尽可能少的电路,求出两个在100以内的正整数的最大公约数和最小公倍数。(不许采用mod函数),仿真并综合出电路-3, the circuit using as little as possible, find two positive integers less than the 100 greatest common divisor and least common multiple. (Not allowed to use mod function), and integrated
gcd_lcm
- 求两个100以内整数的最大公约数和最小公倍数,只用加法和减法运算-Find the greatest common divisor of two integers less than 100 and the least common multiple, only addition and subtraction
verilog
- Verilog HDL 1.红外线发射调制电路 2.分数分频 3.最大公约数和最小公倍数 4.秒表-1.infra transmission modulator 2.fractal frequency divider 3.maximal common divisor 4.timer
mod.verilog
- 计算两个数值间的最大公约数和最小公倍数。-calculate two numbers greatest common divisor and lowest common multiple.