View Code of Problem 3695

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
/*可以分两步*/
/*先将沙漏的上半部分求出来 再求下半部分*/ 
int main(void)
{
	long long a[90]={1,2};
	for(int i=2;i<90;i++)
	{
		a[i]=a[i-1]+a[i-2];
	}
	int t;//第一行输入一个T
	scanf("%d",&t);
	while(t--)
	{	int n;
		scanf("%d",&n);
		long long sum=0;
		for(int i=0;i<n;i++)
		{
			sum+=a[i]; 
		} 
		printf("%lld\n",sum);
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 3695