SHOW:
|
|
- or go back to the newest paste.
| 1 | #include <bits/stdc++.h> | |
| 2 | using namespace std; | |
| 3 | ||
| 4 | long long dp[101]; | |
| 5 | ||
| 6 | long long fib(int n){
| |
| 7 | - | if(n <= 1) return 0; |
| 7 | + | if(n <= 2) return 0; |
| 8 | if(dp[n] == -1) {
| |
| 9 | dp[n] = 0; | |
| 10 | dp[n] = fib(n-1) + fib(n-2) + 1; | |
| 11 | } | |
| 12 | ||
| 13 | return dp[n]; | |
| 14 | } | |
| 15 | int main(){
| |
| 16 | int n,x; | |
| 17 | cin>>x; | |
| 18 | memset(dp, -1, sizeof(dp)); | |
| 19 | for(int i=0;i<x;i++){
| |
| 20 | cin>>n; | |
| 21 | - | cout << fib(n) << "\n"; |
| 21 | + | cout << 1+fib(n) << "\n"; |
| 22 | } | |
| 23 | ||
| 24 | return 0; | |
| 25 | } |
