递归入门题,简单的汉诺塔变形.
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
while(scanf("%d", &n) != EOF)
{
cout << pow(3, n) - 1 << endl;
}
return 0;
}
递归入门题,简单的汉诺塔变形.
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
while(scanf("%d", &n) != EOF)
{
cout << pow(3, n) - 1 << endl;
}
return 0;
}