Introduction to Python

Profound Academy

Course Status
1
Input and Output
2
Mastering I/O
3
Variables and Integer Arithmetic
4
Mastering Variables
5
Conditional Operators
6
More on Boolean Variables
7
Advanced Conditions - Nesting
8
Mastering Conditions
9
Types and Variables
10
Mastering types
11
Strings
12
More Strings
13
Lists and ranges
14
Mastering Lists and ranges
15
For Loops
16
Mastering For loops
17
While Loops
18
continue, break, while...else, for...else
19
String and List methods
20
Nested Loops
21
Mastering Loops
22
List Comprehension
23
Advanced loops
24
Tuples and Sets
25
dict
26
Functions
27
Functions 2
28
Lambda and higher-order functions
29
Files

Recursive Fibonacci

Given a function that computes the Fibonacci numbers, you are asked to compute the number of times the function was called. The function calls itself several times, which is called recursion and we will cover recursion in more detail later.

The program needs to print the total number of times the function fib is called.

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

Recursive Fibonacci

Constraints

To check your solution you need to sign in

Sign in to continue