HDU——Queuing
来源:互联网 发布:快读小说怎么没网络了 编辑:程序博客网 时间:2024/04/29 21:05
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.
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 84 74 8
Sample Output
621
#include <stdio.h>#define N 1000001#define M 30char node[N][M];void init(){ int i,j; for(i=1;i<=M;i++) { node[1][i]=2%i; node[2][i]=4%i; node[3][i]=6%i; node[4][i]=9%i; for (j=5;j<=N;j++) { node[j][i]=(node[j-1][i]+node[j-3][i]+node[j-4][i])%i; } }}int main(){ init(); int n,m; while (~scanf("%d%d",&n,&m)) { printf("%d\n",node[n][m]); } return 0;}
- HDU——Queuing
- 【矩阵乘法再实践】HDU 2604——queuing
- HDU Queuing
- hdu2604——Queuing
- hdu 2604 Queuing
- hdu 2604 Queuing 矩阵
- hdu 2604 Queuing
- hdu 2604 queuing
- hdu 2604 - Queuing
- hdu 2604 Queuing
- HDU 2604-Queuing
- hdu 2604 Queuing 矩阵
- HDU 2604 Queuing
- HDU 2604 Queuing
- 【HDU 2604】 Queuing
- HDU 2604 Queuing
- HDU 2604 Queuing
- HDU 2604 Queuing
- GCD实战一:使用串行队列实现简单的预加载
- activity间的动画,系统通知nOTIFICATION
- poj 1149 PIGS(最大流)
- 母函数的基本方程的介绍
- 在应用程序中监视剪贴板的变化和内容
- HDU——Queuing
- Mini2440 DM9000 驱动分析(二)
- 文章搜罗
- hdu1754 I Hate It
- Android学习笔记(三)之带有侧边索引的快速查找(跟带字母索引查找的通讯录差不多)
- Socket的错误码和描述
- Adobe Edge Animate –修改Edge Commons Spotlight功能,使之能支持播放中国网站视频
- makefile 中的 wildcard 与 patsubst 函数
- C# FUNC 应用