Description
蜂巢的形状如图,给每层一个编号,问第n层内的格子数
Input
一整数n(0<=n<=10^9)
Output
输出第n层内的格子数(包括第n层)
Sample Input
2
Sample Output
19
Solution
ans=1+6+12+18+…+6*n=1+6n(n+1)/2=3n(n+1)+1
Code
#include<cstdio>
#include<iostream>
using namespace std;
int n;
int main()
{
while(~scanf("%d",&n))
printf("%I64d\n",3ll*n*(n+1)+1);
return 0;
}