POJ 1737 Connected Graph 题解(未完成)
来源:互联网 发布:淘宝客服信息发布出去 编辑:程序博客网 时间:2024/06/07 05:03
Connected Graph
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3156 Accepted: 1533
Description
An undirected graph is a set V of vertices and a set of E∈{V*V} edges.An undirected graph is connected if and only if for every pair (u,v) of vertices,u is reachable from v.
You are to write a program that tries to calculate the number of different connected undirected graph with n vertices.
For example,there are 4 different connected undirected graphs with 3 vertices.
You are to write a program that tries to calculate the number of different connected undirected graph with n vertices.
For example,there are 4 different connected undirected graphs with 3 vertices.
Input
The input contains several test cases. Each test case contains an integer n, denoting the number of vertices. You may assume that 1<=n<=50. The last test case is followed by one zero.
Output
For each test case output the answer on a single line.
Sample Input
12340
Sample Output
11438
Source
LouTiancheng@POJ
————————————————我是华丽丽的分割线——————————————————
据说是男人八题中的第一道
难得我都快不会了...T_T
DP解决。
0 0
- POJ 1737 Connected Graph 题解(未完成)
- poj 1737 Connected Graph
- poj 1737 Connected Graph
- POJ 1737 Connected Graph
- POJ 1737 Connected Graph
- POJ 1737 Connected Graph 递推
- POJ 1737 Connected Graph 高进度+递推
- poj 1737 Connected Graph 组合递推计数+高精度
- Connected Graph
- Nodally 3-connected graph
- poj1737 Connected Graph
- POJ1737 Connected Graph【数学】
- Connected Graph POJ1737 高精度
- poj1737 Connected Graph(组合数学)
- Connected Component in Undirected Graph
- POJ 2553 The Bottom of a Graph TarJan算法题解
- POJ 2553 The Bottom of Graph 强连通图题解
- LeetCode 题解(22): Clone Graph
- mybatis包含的jdbcType数据类型
- 【汇总】2012-2016年东南大学物理系考研报录比
- TYVJ-P1864 守卫者的挑战 题解
- TYVJ P1933 绿豆蛙的归宿 题解(未完成)
- TYVJ 2002 扑克牌 题解
- POJ 1737 Connected Graph 题解(未完成)
- POJ 2299 Ultra-QuickSort 题解
- BZOJ 2179 FFT快速傅立叶 题解
- 随机规划自己的一天系列233
- poj 1995 Raising Modulo Numbers 题解
- 学习笔记: cdq分治
- leetcode 链表处理集锦
- 剑指offer(java版)
- 搜索下拉框