当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1294：Rooted Trees Problem

题目描述
Give you two definitions tree and rooted tree. An undirected connected graph without cycles is called a tree. A tree is called rooted if it has a distinguished vertex r called the root. Your task is to make a program to calculate the number of rooted trees with n vertices denoted as Tn. The case n=5 is shown in Fig. 1.
输入解释
There are multiple cases in this problem and ended by the EOF. In each case, there is only one integer means n(1<=n<=40) .
输出解释
For each test case, there is only one integer means Tn.
输入样例 
1
2
5
输出样例 
1
1
9
来自杭电HDUOJ的附加信息
Author SmallBeer(CML)
Recommend lcy
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 杭电ACM集训队训练赛（VIII）
源链接： HDU-1294
最后修改于 2020-10-25T22:43:40+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)