UVa 10223 - How many nodes ?
来源:互联网 发布:恋人网软件下载 编辑:程序博客网 时间:2024/06/09 20:29
题目:气你一个整数n,问多少个节点可以生成n个不同的二叉树。
分析:数论,卡特兰数。根据定义即可。
说明:参照http://blog.csdn.net/mobius_strip/article/details/39229895
#include <iostream>#include <cstdlib>using namespace std;long long Cat[100];int main(){Cat[0] = 1LL;for (int i = 1 ; i < 20 ; ++ i)Cat[i] = Cat[i-1]*(2*i+1)*2/(i+2);int n;while (cin >> n)for (int i = 0 ; i < 20 ; ++ i)if (Cat[i] == n) {cout << i+1 << endl;break;}return 0;}
0 0
- UVa 10223 - How many nodes ?
- How Many Calls? UVA
- Uva 10303 How Many Trees?
- uva 10183 how many fibs
- uva 10183 How Many Fibs
- UVa 696 - How Many Knights
- UVa 10183 - How Many Fibs?
- UVA 10183 How Many Fibs?
- UVA 10518 How Many Calls?
- UVA 10303 How Many Trees?
- UVa 10183 - How Many Fibs?
- UVa 10183 - How Many Fibs?
- UVA 10183 How Many Fibs?
- UVA 10303 How Many Trees?
- UVA 10518 How Many Calls?
- uva 696 - How Many Knights
- UVA 696 How Many Knights
- UVa:10183 How Many Fibs?
- Eclipse 启动报错Failed to create the Java Virtual Machine的解决方法,三种
- 一个表格,如何让他显示10秒后自动消失
- 怎么查看80端口占用情况 如何查看端口占用情况
- 求访问啊啊啊啊
- hibernate注解版关联映射 详解
- UVa 10223 - How many nodes ?
- 我都快被弄挖掘机的给弄疯了~求解哇~
- 【有向图强连通分量(SCC)】
- LoadRunner中winsocket协议脚本回放时的mismatch问题处理方法
- 将VIM打造成强大的IDE
- java入门-枚举类型与for/switch语句
- 关于c#几个事件处理函数能否并行运行的实验
- KeyChain
- Hibernate一级缓存和二级缓存详解