使用Logisim搭建一个根据输入序号x计算对应序号斐波那契数fib[x]的电路（输入序号0对应输出数0，输入序号1对应输出数1，输入序号2对应输出数1，以此类推）并提交。64个周期就能计算出32位无符号整数能表示的最大数位置上的斐波那契数的（最后32bit）-Use Logisim to construct a circuit that calculates the corresponding serial number fib [x] based on the input serial number x (input number 0 corresponds to output number 0, input number 1 corresponds to output number 1, input number 2 corresponds to output number 1, and so on ) And submitted. 64 cycles can be calculated to 32-bit unsigned integer can represent the maximum number of positions on the Fibonacci number (the last 32bit)