蓝桥杯备赛day02：递推

最新推荐文章于 2025-02-10 15:53:55 发布

小西yu

最新推荐文章于 2025-02-10 15:53:55 发布

阅读量1.2k

点赞数 22

分类专栏：蓝桥杯2025备赛文章标签：蓝桥杯算法

本文链接：https://blog.youkuaiyun.com/qq_53237241/article/details/141856819

版权

斐波那契数列

#include <bits/stdc++.h>
using namespace std;
int main()
{
   
    int n;
    cin>>n;
    int dp[n+1];
    dp[1]=1;dp[2]=1;
    for(int i = 3;i <= n;i++) dp[i] = dp[i-1]+dp[i-2];
    cout<<dp[n];
    return 0;
}

n = int(input())
dp = [0] * (n + 1)
dp[1] = 1
if n > 1:
    dp[2] = 1
for i in range(3, n + 1):
    dp[i] = dp[i - 1] + dp[i - 2]

print(dp[n])

import java.util.Scanner;
public class Main {
   
    public static void main(String[] args) {
   
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] dp = new int[n + 1];
        dp[1] = 1;
        if (n > 1) {
   
            dp[2] = 1;
        }
        for