SGU - 123 - The sum （简单数学！）

最新推荐文章于 2015-08-10 21:11:24 发布

zzuspy

最新推荐文章于 2015-08-10 21:11:24 发布

阅读量775

点赞数 1

分类专栏： ~~~~~~~~~~数学 SGU 文章标签： acm algorithm c++ uva iostream

本文链接：https://blog.csdn.net/u014355480/article/details/41869115

版权

~~~~~~~~~~数学同时被 2 个专栏收录

58 篇文章 0 订阅

订阅专栏

SGU

27 篇文章 0 订阅

订阅专栏

SGU - 123

The sum

Time Limit: 250MS

Memory Limit: 4096KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

Here is your second problem, keep calm and solve it .

Nacci sequence of numbers is known to all : F₁ = 1; F₂ = 1; F_n₊₁ = F_n + F_n-1, for n>1. You have to find S - the sum of the first K Nacci numbers.

Input

First line contains natural number K (0<K<41).

Output

First line should contain number S.

Sample Input

Sample Output

Source

简单数学求和题，，居然int都不会爆，，刚开始我还以为要long long。。

AC代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;

int a[42] = {0,1,1};

int main()
{
	int k;
	for(int i=3; i<41; i++)
	{
		a[i] = a[i-1] + a[i-2];
	}	
	scanf("%d", &k);
	int ans = 0;
	for(int i=1; i<=k; i++)
	{
		ans += a[i];
	}
	printf("%d\n", ans);
	return 0;
}