問題解決與流程圖-全文預(yù)覽
【正文】 (9) * * A(8) 38 ? (11) 10 a0 = 1 a 1 = 1 a n = a n1 + a n2 a 10 39 (11) ? ( ) A(9) + A(8) Return 1 N = 0 or N = 1 N = 10 Return 1 N = 9 Return 1 N = 8 A(9) A(8) A(8) A(8) + A(7) A(7) + A(6) N = 0 or N = 1 N = 0 or N = 1 A(7) A(7) A(6) 40 (11) ? ( ) M2 M0 = 1 For i = 1 to 10 M1 = 1 M2 = 0 M2 = M1 + M0 M0 = M1 M1 = M2 41 ? (12) A=120 B=32 42 (12) ? ( ) GCD (32, 24) Return B (120 mod 32) = 0 A=120 Return B A = 32 (32 mod 24) = 0 GCD (24, 8) B=32 B = 24 Return 8 A = 24 (24 mod 8) = 0 GCD (8, 0) B = 8 43 (12) ? Function GCD(A, B) If (A mod B) = 0 Then Return B Else Return GCD(B, (A mod B)) End If End Function Begin = mod Do while ( 0) = = = mod Loop Print End 44 ? 9 , April 2, 2023 ? 10 04:03:4804:03:4804:034/2/2023 4:
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號-1