Description: Compilation Fibonacci series include irvine32.inc principle: f3 = f2+f1. Data str1 byte " Please enter the demand Fibonacci series of median:" , 0 str2 byte " This program Fibonacci column maximum Location: " 0 j dword 2 the biggest position f1 dword 1,0,0 3 32 96 f2 dword 1,0,0 3 32 96 m dword? code main proc mov edx, offset str1 call writestring call readint mov m, eax the input position CMP m, 0 judged by the input data is less than 0 JNG quit CMP m, 2 determines whether the input data is larger than 2 jng next1 less than or equal to 2, the execution next1 sub m 2 mov ecx, m circulation m times L1: mov edx, f1 mov ebx, f1+4 mov eax, f1+8 add edx, dword ptr f2 adc ebx, dword ptr f2+4 to to to do the Carry addition, eliminating the need to determine whether the binary adc eax, dword ptr f2+8 do into a bit addition, eliminating the need to determine whether into a bit jc next2 determine whether the binary, binary is executed next2, also exceeded 96 position
To Search:
File list (Check if you may need any files):
Fibonacci Sequence\Fibonacci Sequence.rar
..................\菲波那契数列2.asm
Fibonacci Sequence
Download