[ Mesic Aladin @ 19.10.2005. 15:51 ] @
Treba mi kod pomoću FOR petlje |
[ Mesic Aladin @ 19.10.2005. 15:51 ] @
[ idb @ 19.10.2005. 16:34 ] @
[ Mesic Aladin @ 19.10.2005. 18:10 ] @
Nemam pojam ko je *adsi*,trebao bi mi taj niz pomocu For petlje!
--------------------------------- Yahoo! Music Unlimited - Access over 1 million songs. Try it free. --0-558927271-1129741710=:19092 Content-Type: text/html; charset=iso-8859-1 Content-Transfer-Encoding: 8bit <DIV><BR><BR><B><I>idb <[email protected]></I></B> wrote: <BLOCKQUOTE class=replbq style="PADDING-LEFT: 5px; MARGIN-LEFT: 5px; BORDER-LEFT: #1010ff 2px solid"> <P>Ti i *adsi* idete u istu skolu?<BR>http://www.elitesecurity.org/p...R><BR>Prijave/odjave: http://www.elitesecurity.org/p...e#141102<BR><BR>Ne menjajte sledece dve linije ukoliko odgovarate putem emaila!<BR>esauth:141102:6853c26106527f16859e236011f256b2<BR> [ idb @ 19.10.2005. 20:34 ] @
Nekoliko tema ispod ove je bilo rec o Fibonacijevom nizu, na to te je upucivao link.
Evo ti ovde http://cubbi.org/serious/fibonacci/c++.html#f1a se nalazi gotov primer, (autor je Sergei Zubkov a izracunava 46-ti clan niza...) evo ti deo te strane: Code: /* ALGORITHM 2C: NON-RECURSIVE LOOP */ #include <iostream> #include <algorithm> using namespace std; // Function f returns n'th Fibonacci number // It uses ALGORITHM 2C: NON-RECURSIVE LOOP unsigned int f(int x) { unsigned int x1=1; for(unsigned int i=1,x2=1;i<=x;i++) { x1+=x2; swap(x1,x2); } return x1; } // Function f_print prints out n'th Fibonacci number void f_print(int n) { cout << n << "th Fibonacci number is " << f(n) << endl; } // main is the entry point in C++ int main() { f_print(46); return 0; } [ danio @ 20.10.2005. 22:20 ] @
Taj problem je jako popularan kod objasnjavanja dynamic programming
[ stameni @ 21.10.2005. 12:23 ] @
Moguće je i rešiti diferencnu jednačinu a(n+2) = a(n+1) + a(n) uz početne uslove a(1) = 1, a(2) = 1. Dobije se "koska-izraz", ali nisu više potrebne nikakve petlje...
Copyright (C) 2001-2025 by www.elitesecurity.org. All rights reserved.
|