Problem

1/7

Fibonacci-Zahlen: Memorisierung der Rekursion (C++)

Problem

Raus. N- Die Zahl von Fibonacci.

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
1 
#include <iostream>
2 
using namespace std;
3 
long long A[10000];
4 
long long f(long long n) {
5 
	if (A[n] != 0)
6 
		return A[n];
7 
	if (n < 2) return n;
8 
	else {
9
10 
		return A[n];
11 
	}
12 
}
13 
int main()
14 
{
15 
	int n;
16 
	cin >> n;
17 
	cout << f(n);
18 
	return 0;
19 
}

     

Program check result

To check the solution of the problem, you need to register or log in!