Calculate Nth Fibonacci number using DP.

fibo_dp.cpp

#include <iostream>
using namespace std;

long double fibo_dp(long double);

int main(void){
    long double n;
    cout <<"enter number :";
    cin >> n;
    cout <<fibo_dp(n)<<endl;
    return 0;
}

long double fibo_dp(long double n){

    long double first,second,current;
    first=0;
    second=1;
    if (n==1) {return first;}
    else if (n==2) {return second;}
    while ((n-2)>0){
        current=first+second;
        first=second;
        second=current;
        n--;
    }
    return current;      

}

fibo_dp.py

def fibo_dp(n):
    first,second=0,1
    if n==1:
        return first
    if n==2:
        return second
    for _ in xrange(n-2):
        new=first + second
        first=second
        second=new
    return new