热门标签 | HotTags
当前位置:  开发笔记 > 编程语言 > 正文

NudnikPhotographer-Ural1260动态规划

Timelimit:1.0secondMemorylimit:64MBIftwopeoplewerebo
Time limit: 1.0 second Memory limit: 64 MB

If two people were born one after another with one second difference and one of them is a child, then the other one is a child too. We get by induction that all the people are children.
Everyone knows that the mathematical department of the Ural State University is a big family of N persons, 1, 2, 3, …, N years old respectively.
Once the dean of the department ordered a photo if his big family. There were to be present all the students of the department arranged in one row. At first the dean wanted to arrange them by their age starting from the youngest student, but than he decided that it would look unnatural. Than he advised to arrange the students as follows:
The 1 year old student is to sit at the left end of the row.
The difference in ages of every two neighbors mustn’t exceed 2 years.
The dean decided that thereby the students would seem look as they were arranged by their ages (one can hardly see the difference in ages of 25 and 27 years old people). There exist several arrangements satisfying to the requirements. Photographer didn’t want to thwart dean’s desire and made the photos of all the possible mathematical department students’ arrangements.

Input

There is the integer number N, 1 ≤ N ≤ 55.

Output

the number of photos made by the photographer.

Sample

input output
4 4

Notes

If N = 4 then there are following possible arrangements: (1,2,3,4), (1,2,4,3), (1,3,2,4) and (1,3,4,2).

Problem Author: Alexander Ipatov
Problem Source: Open collegiate programming contest for high school children of the Sverdlovsk region, October 11, 2003

看的我啸的博客

#include 
#include 
#include 

using namespace std;

typedef long long LL;

LL Dp[60][5];

int main()
{
    Dp[1][1] = 0;
    Dp[1][2] = 1;
    Dp[1][3] = 0;
    Dp[1][4] = 0;

    Dp[2][1] = 0;
    Dp[2][2] = 1;
    Dp[2][3] = 0;
    Dp[2][4] = 0;

    for(int i=3;i<=55;i++)
    {
        Dp[i][1]+=Dp[i-1][2];

        Dp[i][2]+=(Dp[i-1][2]+Dp[i-1][4]);

        Dp[i][3]+=(Dp[i-1][1]+Dp[i-1][3]);

        Dp[i][4]+=(Dp[i-1][1]);
    }
    int n;

    while(~scanf("%d",&n))
    {
        cout<1]+Dp[n][2]+Dp[n][3]+Dp[n][4]<return 0;
}


推荐阅读
author-avatar
过去丶真的過卜去
这个家伙很懒,什么也没留下!
PHP1.CN | 中国最专业的PHP中文社区 | DevBox开发工具箱 | json解析格式化 |PHP资讯 | PHP教程 | 数据库技术 | 服务器技术 | 前端开发技术 | PHP框架 | 开发工具 | 在线工具
Copyright © 1998 - 2020 PHP1.CN. All Rights Reserved | 京公网安备 11010802041100号 | 京ICP备19059560号-4 | PHP1.CN 第一PHP社区 版权所有