P1990 覆盖墙壁

最新推荐文章于 2024-07-22 15:43:53 发布

代维7

最新推荐文章于 2024-07-22 15:43:53 发布

阅读量234

点赞数 2

分类专栏：洛谷文章标签：动态规划 c++ 算法

本文链接：https://blog.csdn.net/Recursions/article/details/124890834

版权

洛谷专栏收录该内容

129 篇文章 1 订阅

订阅专栏

覆盖墙壁 - 洛谷

/*
 * @Description: To iterate is human, to recurse divine.
 * @Autor: Recursion
 * @Date: 2022-05-20 21:23:11
 * @LastEditTime: 2022-05-20 21:30:28
 */
#include <bits/stdc++.h>
#define LL long long 
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 10000;
const int INF = 1e9 + 10;
const int N = 1e6;
LL dp[N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 5;
    dp[4] = 11;
    for(int i = 4;i <= n;i ++)
        dp[i] = dp[i - 3]%mod + 2*dp[i - 1]%mod;
    cout << dp[n]%mod << endl;


    return 0;
}