package com.edu.hhxy;
import java.util.Scanner;
/**
* @author five-five
* @link https://www.dotcpp.com/oj/problem1180.html
* @created 2021/10/13-21:46
*/
public class Demo10 {
public static void main(String[] args) {
//过一个函数,/2,+1
//逆推:函数应为:oldNumberOfSheep=2*(sheeps-1)
Scanner scanner = new Scanner(System.in);
for (int i = scanner.nextInt(); i > 0; i--) {
System.out.println(remainSheep(scanner.nextInt()));
}
}
/**
* @param n 收费站数量
* @return
*/
private static int remainSheep(int n) {
if (n == 1) {
//最后一个收费站的话:老头剩余的Sheeps=3,4/2+1=3->(3-1)*2=4,公式=(保留的Sheeps-1)*2
return (3 - 1) * 2;
}
//oldNumberOfSheep=2*(remainSheepsNumber-1)
return (remainSheep(--n) - 1) * 2;
}
}
0.0分
0 人评分