Neko and Aki's Prank

最新推荐文章于 2020-01-29 01:19:01 发布

原创最新推荐文章于 2020-01-29 01:19:01 发布 · 577 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #DP

C++ 专栏收录该内容

1012 篇文章

订阅专栏

本文详细解析了Codeforces比赛中的D题解法，采用DP算法结合特定规律，通过C++实现，深入探讨了解题思路及代码实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

https://codeforces.com/contest/1152/problem/D

题解：DP+规律

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=1000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
ll dp[N][N],DP[N][N];
char str;
struct node{};
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    for(int i=1;i<=1000;i++){
        dp[i][0]=(i+1)/2;
        for(int j=1;j<=i;j++){
            dp[i][j]=(dp[i-1][j]+1+dp[i-1][j-1])%MOD;
            if(j>=2)dp[i][j]=(dp[i][j]+dp[i][j-2])%MOD;
            //printf("%9lld%c",dp[i][j]," \n"[j==i]);
        }
    }
    while(~scanf("%d",&n)){
        cout<<dp[n][n]<<endl;
    }

    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}