【迭代】斐波那契迭代算法

#include 
unsigned long Fibonacci( unsigned );
int main()
{
    int n;
    scanf("%d",&n);
    printf("%d",Fibonacci(n));
    return 0;
}
unsigned long Fibonacci( unsigned n )
{
    if ( n > 2 )
        return Fibonacci(n-1) + Fibonacci(n-2);
    else return 1;
}*/

/*#include 
int main()
{
    int n;
    scanf("%d",&n);
    printf("%d %p",n,&n);
    return 0;
}