递归小白

#include <iostream>
using namespace std;

int c[35];
int fun();
int fun2(int);
int fun3(int);
int func(int);
int res = 0;
int main()
{
    for (int i=0; i<20; i++)
    {
        c[i] = 0;
    }
    cout << func(0) << endl;
    return 0;
}
int func(int i)
{
        if (i == 19)
        {
            c[i] = 0;
            res++;
            c[i] = 1;
            res++;
        }
        else
        {
            c[i] = 0;
            res = func(i+1);
            c[i] = 1;
            res = func(i+1);
        }
    return res;
}
//1*3
int fun()
{
    int res = 0;
    c[0] = 0;
    res = fun2(res);
    c[0] = 1;
    res = fun2(res);
    return res;
}

int fun2(int res)
{
    c[1] = 0;
    res = fun3(res);
    c[1] = 1;
    res = fun3(res);
    return res;
}

int fun3(int res)
{
    c[2] = 0;
    res++;
    c[2] = 1;
    res++;
    return res;
}