Recursive Algorithm in C Language -- monkey peach Extraction

Recursive Algorithm in C Language -- monkey peach Extraction
Q: The monkey picked up a few peaches on the first day and immediately ate half of them. The monkey was so addicted that he ate another peach. The next morning, I ate another half of the remaining peaches, and I ate another one. In the future, the remaining half of the previous day will be eaten every day, and one peach will be left when you want to eat it again on the morning of the seventh day. How many peaches can be picked on the first day.

# Include <stdio. h> int main () {int I; int B = 1; int c; for (I = 9; I> 0; I --) {c = 2 * (B + 1); B = c;} printf ("% d peaches in total \ n", B); return 0 ;}