//fib.c -- Fibonacci problem using Recursion, by tsaiwn@cs.nctu.edu.tw
#include <stdio.h>
#include <limits.h>
long long fib(int n) {
   if(n<0)return 0;
   if(n<2)return 1;
   return fib(n-1)+fib(n-2);
}
int main( ) {
    int n, i;
    printf("In <limits.h>\n");
    printf("    INT_MAX==%ld\n", INT_MAX);
    printf("   LONG_MAX==%ld\n", LONG_MAX);
    printf("0x7fffffffL==%ld\n", 0x7fffffffL);
    printf("n= ");
    scanf("%d", &n);
    for(i=1; i<= 16; ++i)
#ifdef __MINGW32__
       printf("Fib of %d=%I64d\n", i, fib(i));
#else
       printf("Fib of %d=%lld\n", i, fib(i));
#endif
    printf(" ..."); fflush(stdout);
#ifdef __MINGW32__
    printf("\nFib of %d=%I64d\n", n, fib(n));
#else
    printf("\nFib of %d=%lld\n", n, fib(n));
#endif
    fprintf(stderr, "Hit Enter key..");
    getchar( );   // the new Line when you input n
    getchar( );
    return 0;
}