三角形平方平面,推到一下,就可以得出公式:F(1) = 2. F(2) = 8; F(n >= 3) = F(n - 1) + 6 * (n - 1)。
AC代码:
#include <iostream>
using namespace std;
int a[10005];
int main()
{
a[0] = 0; a[1] = 2; a[2] = 8;
for(int i = 3; i < 10002; i++)
a[i] = a[i - 1] + 3 * (i - 1) * 2;
int n, t;
cin >> t;
while(t--)
{
cin >> n;
cout << a[n] << endl;
}
return 0;
}原文地址:http://blog.csdn.net/qq_25425023/article/details/45331175