{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e Finally Biaoge reached the amusement park. But soon he got lost…\u003cbr\u003e The amusement park has N sites and N bidirectional roads connecting these sites. You can start from every site to get to any other site through the roads. Every time Biaoge got to a site, he marked it as visited and then chose a new site which was connected directly to it and not visited yet. If there were more than one site meet the conditions, Biaoge would choose randomly with equal possibility.\u003cbr\u003e Biaoge also chose the first site among N sites randomly with equal possibility and then repeated this process until there was no site to go.\u003cbr\u003e Calculate the possibility for each site of being the last site which Biaoge would visit. And output \u003cstrong\u003ethe sum of five largest possibilities\u003c/strong\u003e.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":" There are multiple test case.\u003cbr\u003e For each test case the first line contains an Integer N(5≤N≤100000) indicating the number of sites(All sites are labeled from 1 to N) . And then N lines follow. Each line contains two Integer x,y(1≤x,y≤N)indicating two sites connected by the road.\u003cbr\u003e The input end with N\u003d0.\u003cbr\u003e Obviously there is \u003cstrong\u003eexactly one loop\u003c/strong\u003e in the abstracted graph. It is guaranteed that the length of loop is \u003cstrong\u003ebetween 3 and 30\u003c/strong\u003e."}},{"title":"Output","value":{"format":"HTML","content":" For each case, output the sum of five largest possibilities in a single line. The answer should be rounded to 5 digits after decimal points."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\r\n5 2\r\n2 4\r\n4 5\r\n3 4\r\n1 2\r\n10\r\n5 8\r\n8 3\r\n3 1\r\n1 5\r\n2 1\r\n10 8\r\n7 8\r\n6 7\r\n4 10\r\n9 10\r\n0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1.00000\r\n0.91250\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}