package practice;
import java.util.Scanner;
public class HDU_oj2050 {
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
int c = sn.nextInt();
for(int i = 0;i < c;i++) {
int m = sn.nextInt();
System.out.println(guilv(m));
}
sn.close();
}
public static int guilv(int n)// 也可以用递归实现,不过递归太耗时
{
int sum = 2, i;// sum初始化为2
for (i = 2; i <= n; i++)
// sum+=(((i-1)*2+1)*2-1);
sum += 4 * i - 3;
return sum;
}
}
参考于:https://blog.csdn.net/hpulw/article/details/50579567