递归,公式:f(n)=(f(n-1)+1)*2,n>2;f(2)=4;
#include <iostream>
using namespace std;
int Fun(int a){
int f, n = a;
if (n == 2) f = 4;
else f = (Fun(n-1) + 1) * 2;
return f;
}
int main(){
int n,S;
while (cin >> n){
递归,公式:f(n)=(f(n-1)+1)*2,n>2;f(2)=4;
#include <iostream>
using namespace std;
int Fun(int a){
int f, n = a;
if (n == 2) f = 4;
else f = (Fun(n-1) + 1) * 2;
return f;
}
int main(){
int n,S;
while (cin >> n){