【ACM】杭电OJ 2050

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/CSDN___CSDN/article/details/84370147

直线: 

f(n)=f(n-1)+n=\frac{n(n+1)}{2}+1

平行线

f(n)=2n^{2}+1

折线

f(n)=2n^{2}-n+1 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main ()
{
	int n,m;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d",&m);
		printf("%d\n",2*m*m-m+1);
	}
	return 0;
}

猜你喜欢

转载自blog.csdn.net/CSDN___CSDN/article/details/84370147