http://acm.hdu.edu.cn/showproblem.php?pid=1249
三角形
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3710 Accepted Submission(s): 2568
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
Recommend
Ignatius.L
代码:
#include<stdio.h> int main() { int n,t; scanf("%d",&t); while(t--) { scanf("%d",&n); printf("%I64d ",(_int64)3*n*(n-1)+2); } return 0; }