SGU 130 Circle

最新推荐文章于 2018-10-10 11:12:00 发布

最新推荐文章于 2018-10-10 11:12:00 发布 · 74 阅读

本文提供了一道SGU编程题的解决方案，通过动态规划的方法计算特定数值的组合数。代码中详细展示了初始化DP数组的过程及核心计算逻辑。

sgu上搞这种题目估计是用来增长自信心的。。。否则哥真要被sgu虐死了！！擦！！

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 33;

i64 dp[33];
int n;

void dpstart()
{
    MM(dp,0);
    dp[0]=1;
    dp[1]=1;
    dp[2]=2;
    int now,to;
    for(int k=3;k<maxn;k++)
    {
        for(int i=1;i<=k;i++)
        {
            now=i-1;
            to=k-i;
            dp[k]+=dp[now]*dp[to];
        }
    }
    return ;
}

int main()
{
    dpstart();
    while(cin>>n)
    {
        cout<<dp[n]<<" "<<n+1<<endl;
    }
    return 0;
}