1 1 2 3 5 8 13 21 34 55...

long fib(int n)
{
     long last=1,before_last=1;
     for (int i=0;i<n-2;i++)
     {
        last = last + before_last;
        before_last = last-before_last;
     }
     return last;
}