Children’s Queue

Children’s Queue

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10040    Accepted Submission(s): 3198


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?
 

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
  
  
1 2 3
 

Sample Output
  
  
1 2 4
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
	int n;
	int f[1001][101] = {0};
	f[0][1]=1;
	f[1][1]=1;
	f[2][1]=2;
	f[3][1]=4;
	for(int i=4; i<1001; ++i)
	{
		for(int j=1;j<101;++j)
		{
			f[i][j]+=f[i-1][j]+f[i-2][j]+f[i-4][j];
			f[i][j+1]+=f[i][j]/10000;	
			f[i][j]%=10000;	
		}
	}
	
	while(cin>>n)
	{int j=100;
	while(!f[n][j])
	{j--;}	
	cout<<f[n][j];
	j--;
	for(;j>0;j--)
		printf("%04d", f[n][j]);
	cout<<endl;

	
	}
	
	return 0;
}


好的,我明白了。关于你的问题,下面是对应的算法实现: 【创建一棵树】 我们先来看一下在 Python 中如何利用孩子链存储结构或长子兄弟链存储结构(任选一种)来创建一棵树。这里我选择使用孩子链存储结构来实现: ```python # 定义一个树节点类 class TreeNode: def __init__(self, value): self.value = value self.children = [] # 创建一棵孩子链存储结构的树 def create_tree(): # 树的根节点 root = TreeNode('A') # 树的第二层结点 node_b = TreeNode('B') node_c = TreeNode('C') node_d = TreeNode('D') root.children = [node_b, node_c, node_d] # 树的第三层结点 node_e = TreeNode('E') node_f = TreeNode('F') node_g = TreeNode('G') node_h = TreeNode('H') node_i = TreeNode('I') node_j = TreeNode('J') node_k = TreeNode('K') node_l = TreeNode('L') node_m = TreeNode('M') node_n = TreeNode('N') node_o = TreeNode('O') node_p = TreeNode('P') node_q = TreeNode('Q') node_r = TreeNode('R') node_s = TreeNode('S') node_t = TreeNode('T') node_u = TreeNode('U') node_v = TreeNode('V') node_w = TreeNode('W') node_x = TreeNode('X') node_y = TreeNode('Y') node_z = TreeNode('Z') node_b.children = [node_e, node_f, node_g] node_c.children = [node_h, node_i, node_j] node_d.children = [node_k, node_l] node_e.children = [node_m] node_g.children = [node_n, node_o] node_h.children = [node_p, node_q] node_i.children = [node_r] node_k.children = [node_s] node_l.children = [node_t, node_u] node_o.children = [node_v] node_r.children = [node_w, node_x] node_t.children = [node_y, node_z] # 返回树的根节点 return root ``` 【求树的高度】 下面的算法可以求一个树的高度: ```python # 求一个树的高度 def tree_height(root): if not root: return 0 if not root.children: return 1 return 1 + max(tree_height(child) for child in root.children) ``` 【实现树的层次遍历】 下面的算法可以实现树的层次遍历: ```python # 实现树的层次遍历 def level_order(root): if not root: return [] res = [] queue = [root] while queue: level = [] for _ in range(len(queue)): node = queue.pop(0) level.append(node.value) for child in node.children: queue.append(child) res.append(level) return res ``` 【先根遍历】 下面的算法可以实现先根遍历: ```python # 先序遍历 def preorder(root): if not root: return [] res = [] res.append(root.value) for child in root.children: res += preorder(child) return res ``` 【后根遍历】 下面的算法可以实现后根遍历: ```python # 后序遍历 def postorder(root): if not root: return [] res = [] for child in root.children: res += postorder(child) res.append(root.value) return res ``` 以上就是对应于你的问题的算法实现,希望可以帮到你。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值