HDACM2064
采用递归的方法:有n个盘子需要移动,第n个盘子要移动时,把上面(n-1)个盘子看做成一个盘子,则这时就把它当做2个盘子从最左边移到最右边 移动的次数:2+1+2+1+2 按题目要求联想一下就能懂这个意思
import java.util.Scanner;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
int n = sc.nextInt();
long a=2,b;
for (int i = 2; i <= n; i++) {
b=3*a+2;
a=b;
}
System.out.println(a);
}
}
}