Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Full Steiner Topologies
Description A T = (V, E) where V = {v_{1}, v_{2}, …, v, _{n}v_{n}_{+1}, …, v_{2n−2}} is the set of vertices, and E is the set of edges. The n distinctly labeled leaves of T, v_{1}, v_{2}, …, v, correspond to _{n}p_{1}, p_{2}, …, p, respectively; the remaining _{n}n − 2 vertices, v_{n}_{+1}, v_{n}_{+2}, …, v_{2n−2}, called the Steiner vertices, are mutually indistinguishable and each have a degree of three. Figure 2 shows the only full Steiner topology for P = {p_{1}, p_{2}, p_{3}}. Figure 3 shows all three different full Steiner topologies for P = {p_{1}, p_{2}, p_{3}, p_{4}}.Figure 2: Full Steiner topology for Figure 3: Full Steiner topologies for Given Input The input contains multiple test cases. Each test case consists of a single integer Output For each test case, print the answer on a separate line. You shall print the answer rounded to four significant digits. Let Sample Input 3 30 300 3000 30000 300000 3000000 Sample Output 1.000E0 8.687E36 5.677E697 1.462E10024 1.983E130306 4.215E1603145 7.937E19031556 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator