三种解法——1020猴子吃桃的问题

解题思路:找到关系求出通项；递归思路; 常规思路

注意事项:

参考代码:eg:1

#include<stdio.h>

int hz_taozi(int n)

{

        if(n==1)

            return 1; 

        if(n>1)

            return  2*hz_taozi(n-1);

}

    int main()

    {

        int x;

                scanf("%d",&x);

            hz_taozi(x);

                printf("%d",3*hz_taozi(x)-2); //找的是等比数列的关系求出通项！！ 

        return 0;

}

    eg2:

#include<stdio.h>

        int hz(int n)

    {

        if(n==1)

            return 1;

        if(n>1)

            return (hz(n-1)+1)*2;

    }

        int main()

    {

        int x;

                scanf("%d",&x);

            hz(x);

                printf("%d",hz(x));

        return 0;

    }

    eg:3

 #include<stdio.h>

    int main()

    {

        int N , i ,S;

                scanf("%d",&N);

        for(i=1,S=1;i<N;i++)

        {

            S=(S+1)*2; 

        }

                printf("%d",S);

    return 0;

     }