Revision: 67804
Initial Code
Initial URL
Initial Description
Initial Title
Initial Tags
Initial Language
at October 30, 2014 18:51 by jacktan
Initial Code
int fibonacci_I (int i) { if (i < 1) { return 0; } int mth_result = 1; int var1 = 1; for (;i > 2; i--) { mth_result = mth_result + var1; var1 = mth_result - var1; } return mth_result; }
Initial URL
http://ideone.com/xSjGRA
Initial Description
You can put it in other programming language, like [Java](http://ideone.com/xSjGRA "Fibonacci.java") ##Fibonacci问题å˜ç§ + é’è›™è·³å° ä¸€åªé’蛙一次å¯ä»¥è·³1级å°é˜¶ï¼Œä¹Ÿå¯ä»¥è·³2级。 求该é’è›™è¦è·³ä¸Šä¸€ä¸ªn级的å°é˜¶æ€»å…±æœ‰å¤šå°‘ç§è·³æ³•ã€‚ + 矩形覆盖 我们å¯ä»¥ç”¨2个å°æ£æ–¹å½¢æž„æˆçš„2X1å°çŸ©å½¢åŽ»ï¼Œæ¨ªç€æˆ–ç«–ç€æ— é‡å 地覆盖由å°æ£æ–¹å½¢æž„æˆçš„2Xn大矩形。 请问用8个2X1å°çŸ©å½¢åŽ»æ— é‡å 覆盖1个2X8的大矩形,总共有多少ç§æ–¹æ³•ã€‚
Initial Title
A general non-recursive method to implement Fibonacci
Initial Tags
Initial Language
C