Fibonacci PD

#include<stdio.h>

long long int vet[1000] = {0};

long long int fib(int n, int *cont);

int main()
{
    int n,cont = 0;
    printf("informe um valor: ");
    scanf("%d", &n);

    printf("O fibonacci de %d eh %lld\n", n, fib(n, &cont));
    printf("contador : %d\n", cont);
}

long long int fib(int n, int *cont)
{
    *cont = *cont + 1;

    if(n == 1 || n == 2)
    {
        return(1);
    }

    else
    {
        if(vet[n-1] == 0)
        {
            vet[n-1] = fib(n - 1, cont);
        }

        if(vet[n - 2] == 0)
        {
            vet[n - 2] = fib(n - 2, cont);
        }

        return(vet[n-1] + vet[n - 2] );
    }
}