zoukankan      html  css  js  c++  java
  • HDOJ_ACM_Queuing

    Problem Description
    Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There are many people lined up at the lunch time. 

      Now we define that ‘f’ is short for female and ‘m’ is short for male. If the queue’s length is L, then there are 2L numbers of queues. For example, if L = 2, then they are ff, mm, fm, mf . If there exists a subqueue as fmf or fff, we call it O-queue else it is a E-queue.
    Your task is to calculate the number of E-queues mod M with length L by writing a program.
     
    Input
    Input a length L (0 <= L <= 10 6) and M.
     
    Output

                Output K mod M(1 <= M <= 30) where K is the number of E-queues with length L.
     
    Sample Input
    3 8
    4 7
    4 8
     
    Sample Output
    6
    2
    1
     
    Code
    Accepted-----
    View Code
    Wrong--------
    View Code
    Explanition
    The reason why it is f(n)=f(n-1)+f(n-3)+f(n-4)
    last letter

    e:
      e  -----------f(n-1)
    f:
      eef ----------f(n-3)
      fef -----------0
      fff  -----------0
    eff:
      feff ----------0
      eeff-----------f(n-4)

    Key Point

    you must initialize the array every time!

      
  • 相关阅读:
    留言板
    文件操作1
    JQUERY与JS的区别
    PHP 练习租房
    PHP 投票练习
    PHP,单项查询及多项查询
    PHP 增删改查 import!!
    PHP 数据访问
    PHP 对象及其三大特性
    正则表达式和数组
  • 原文地址:https://www.cnblogs.com/chuanlong/p/2765874.html
Copyright © 2011-2022 走看看