同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22155_TreeCounting

2022-5-16 18:21| 发布者: Hocassian| 查看: 22| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506157428700-Problem List-采集的数据-后羿采集器.html

Pro.ID

22155

Title

Tree Counting

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22155

AC

Submit

Ratio

0.00%

时间&空间限制

Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

Given two integers n, d. Count the number of labeled trees with n nodes, and the length of the longest path (from one node to another) is d.

输入

Each line contains two integers n, d ( 1 ≤ n ≤ 100 ).

输出

Description

Given two integers n, d. Count the number of labeled trees with n nodes, and the length of the longest path (from one node to another) is d.

Input

Each line contains two integers n, d ( 1 ≤ n ≤ 100 ).

Output

For each case, output a line which contains only one integer.

Sample Input

2 1
3 1
3 2
4 3

Sample Output

1
0
3
12

Source

ZS 2007 Ex6

样例输入