三角形
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4854 Accepted Submission(s): 3321
Problem Description
用N个三角形最多可以把平面分成几个区域?
Input
输入数据的第一行是一个正整数T(1<=T<=10000),表示测试数据的数量.然后是T组测试数据,每组测试数据只包含一个正整数N(1<=N<=10000).
Output
对于每组测试数据,请输出题目中要求的结果.
Sample Input
2 1 2
Sample Output
2 8
Author
Ignatius.L
找规律
#include <stdio.h>
int dp[10002] = {1, 2, 8, 20};
int main()
{
int i, n;
for(i = 4; i < 10001; ++i)
dp[i] = dp[i-1] + 6 * (i - 1);
scanf("%d", &n);
while(n--){
scanf("%d", &i);
printf("%d\n", dp[i]);
}
return 0;
}