猴子吃桃的问题

解题思路:
        倒推
注意事项:

参考代码:

#include<iostream>

using namespace std;

int main()

{

int n;

cin >> n;

int TotalOfDay = 1;

int sum = 0;

for (int i = 1; i < n; i++)

{

    TotalOfDay = (1 + TotalOfDay) * 2;

    if (i == n - 1)

    {

        sum = TotalOfDay;

        break;

    }

}

cout << sum << endl;

return 0;

}