hdu 1297 Children’s Queue(大数处理)
来源:互联网 发布:ubuntu matlab java 编辑:程序博客网 时间:2024/06/05 14:14
链接:hdu 1297
Problem Description
There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other words, either no girl in the queue or more than one girl stands side by side. The case n=4 (n is the number of children) is like
FFFF, FFFM, MFFF, FFMM, MFFM, MMFF, MMMM
Here F stands for a girl and M stands for a boy. The total number of queue satisfied the headmaster’s needs is 7. Can you make a program to find the total number of queue with n children?
FFFF, FFFM, MFFF, FFMM, MFFM, MMFF, MMMM
Here F stands for a girl and M stands for a boy. The total number of queue satisfied the headmaster’s needs is 7. Can you make a program to find the total number of queue with n children?
Input
There are multiple cases in this problem and ended by the EOF. In each case, there is only one integer n means the number of children (1<=n<=1000)
Output
For each test case, there is only one integer means the number of queue satisfied the headmaster’s needs.
Sample Input
123
Sample Output
124
题意:n个人站成一队,女生不能单独站着,即如果有女生必须至少有两个女生相邻(可以没有女生),
问有多少种排法
分析:情况一:(最后是以男生结尾的) 这时候是:f[n-1]+男;
情况二:(最后是以女生结尾的)
1.这时候有可能:f[n-2]+女+女
2.还有可能:f[n-4]+男+女+女+女
所以最后的递推式是:f[n]=f[n-1]+f[n-2]+f[n-4];
注:数较大,要用大数处理
AC代码:
#include<stdio.h>int a[1001][101]={0};int main(){ int i,j,n,m; a[1][0]=1; a[2][0]=2; a[3][0]=4; a[4][0]=7; for(i=5;i<=1000;i++) for(j=0;j<=100;j++){ a[i][j]+=a[i-1][j]+a[i-2][j]+a[i-4][j]; m=a[i][j]/10000; a[i][j]%=10000; a[i][j+1]+=m; } while(scanf("%d",&n)!=EOF){ for(i=100;i>=0;i--) if(a[n][i]!=0) break; printf("%d",a[n][i]); for(j=i-1;j>=0;j--) printf("%04d",a[n][j]); printf("\n"); } return 0;}
0 0
- hdu 1297 Children’s Queue(大数处理)
- hdu 1297 children's queue #DP#大数
- HDU 1297 Children’s Queue 递归+大数
- hdu 1297 Children’s Queue(递推+大数)
- hdu 1297 Children’s Queue (大数加法+递推)
- HDU 1297 Children’s Queue(含整型大数模板)
- Children’s Queue 1297 (大数)
- 【大数递推】HDU 1297——Children’s Queue
- HDOJ/HDU 1297 Children’s Queue(推导~大数)
- hdu 1297 Children’s Queue 递推 大数
- HDU 大数模板之Children’s Queue
- HDU 1297 Children’s Queue (DP)
- hdu 1297 Children’s Queue
- 【HDU 1297】Children’s Queue
- HDU 1297 - Children’s Queue
- HDU 1297 Children’s Queue
- HDU 1297 Children’s Queue
- hdu 1297 Children’s Queue
- HTTP Debugger Pro v6.2 + Keygen For HTTP Debugger Pro v6.x
- ESET NOD32 最新更新有效的升级ID用户名和密码
- 计算机视觉领域牛人博客,实力的研究机构等网站链接
- leetcode:Gray Code
- PHP 获取数组任意下标key的上一个prev和下一个next下标值
- hdu 1297 Children’s Queue(大数处理)
- 黑马程序员--GUI--
- [枫叶学院] Unity3d高级开发教程 工具集(一) 哈希列表——强大的自定义数据集
- 黑马程序员_学习笔记 03 C#基础
- 安装完Eclipse后,没有AVD manager和SDK manager(Eclipse 22.63)
- 使用SharePoint Designer将JavaScript和自定义网站页面集成
- Spring 架构图
- leetcode:Merge Sorted Array
- Java 开发环境搭建_JDK的安装