Describe 피보나치/조현태 here.
~cpp
#include <iostream>
using namespace std;
int fibonacci1( int prv_answer,int sub_answer, int number )
{
//피보나치를 연산합니다.재귀호출�
if( number!=0)
prv_answer=fibonacci1(sub_answer+prv_answer, prv_answer, number-1 );
return prv_answer;
}
void prin(unsigned int num, unsigned int prv_answer )
{
//그냥 ì¶œë ¥
cout << num <<"번째 값� "<< prv_answer <<"입니다.\n";
}
void fibonacci2( unsigned int prv_answer,unsigned int sub_answer, unsigned int number, int call)
{
//ì•ˆì œê·€í˜¸ì¶œ..
unsigned int num=1;
while (number!=0)
{
unsigned int temp=sub_answer;
sub_answer=prv_answer;
prv_answer=temp+sub_answer;
--number;
++num;
if (0==call && number>0)
prin (num, prv_answer);
}
prin (num, prv_answer);
}
void main()
{
//ë©”ì�¸í•¨ìˆ˜- ê°’ì�„ ìž…ë ¥ë°›ê³ ì¶œë ¥í•˜ëŠ” ì—활ì�„ 합니다.
unsigned int number;
int call;
/*while (1)
{
cin >> number;
//cout << fibonacci1( 1 , 0 , number-1) << "\n";
cout << fibonacci2( 1 , 0 , number-1) << "\n";
}*/
cout << "피보나치 수열ì�„ ì¶œë ¥í•˜ëŠ” 프로그램입니다.\n 몇번째 숫ìž�를 ì¶œë ¥í•˜ì‹œê² ìŠµë‹ˆê¹Œ?";
cin >> number;
cout << number <<"번째 숫ìž�까지ì�˜ ê°’ì�„ ì¶œë ¥í•˜ê² ìŠµë‹ˆê¹Œ?(1.예 2.아니오)";
cin >> call;
fibonacci2( 1 , 0 , number-1, call-1);
}
ë‘�번째 꺼는 ì•„ì§� ë¦¬íŽ™í† ë§�ì�´ ë�˜ì§€ 않았습니다.^^; 양해해주세요.ì�´ë²ˆì—” 파ì�´ì�¬ìœ¼ë¡œ ..ã…Žã…Ž
~cpp
def pibo( n ):
#ì‹¸êµ¬ë ¤ ëŠ�린연산
if n<2:
return n
return pibo( n-1)+pibo(n-2)
def fibo( number ):
#ë¹ ë¥¸ì—°ì‚°
number=number-1
prv_answer=1
sub_answer=0
while number!=0:
temp=sub_answer
sub_answer=prv_answer
prv_answer=sub_answer+temp
number=number-1
print prv_answer
if __name__ == '__main__':
t= int (raw_input('ëŠ�린연산 숫ìž�를 ìž…ë ¥í•´ì£¼ì„¸ìš”>>'))
k=pibo( t )
print k
t= int (raw_input('ë¹ ë¥¸ì—°ì‚° 숫ìž�를 ìž…ë ¥í•´ì£¼ì„¸ìš”>>'))
fibo( t )










