原题链接:
不容易系列
解题思路:
注意事项:
参考代码:
public class 不容易系列 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int a;
while (N > 0) {
a = in.nextInt();
int[] arrays = new int[31];
arrays[0] = 3;
for (int i = 1; i < arrays.length; i++) {
arrays[i] = 2 * (arrays[i - 1] - 1);
}
System.out.println(arrays[a]);
N--;
}
}
}