zoukankan      html  css  js  c++  java
  • Nudnik Photographer -Ural1260动态规划

    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 <cstdio>
    #include <cstring>
    #include <iostream>
    
    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<<Dp[n][1]+Dp[n][2]+Dp[n][3]+Dp[n][4]<<endl;
        }
        return 0;
    }
    
    
  • 相关阅读:
    微信机器人-定制消息
    Python实现微信祝福语自动发送
    日常使用 ADB 命令
    python 中的三种等待方式
    Appium自动化测试之环境安装
    Charles 模拟弱网
    Navicat连接MySQL报错-2059
    requests高级用法
    requests基本用法
    Monkey测试环境搭建
  • 原文地址:https://www.cnblogs.com/juechen/p/5255861.html
Copyright © 2011-2022 走看看