{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"题意是说给你一个联通网路，求出这个网络所有割点的编号，以及如果删除这个割点之后所对应的联通分量数。"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist. \n \u003cbr\u003e \n \u003cbr\u003eThe first network in the file should be identified as \"Network #1\", the second as \"Network #2\", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text \"No SPF nodes\" instead of a list of SPF nodes. \n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e1 2\n5 4\n3 1\n3 2\n3 4\n3 5\n0\n\n1 2\n2 3\n3 4\n4 5\n5 1\n0\n\n1 2\n2 3\n3 4\n4 6\n6 3\n2 5\n5 1\n0\n\n0\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003eNetwork #1\n SPF node 3 leaves 2 subnets\n\nNetwork #2\n No SPF nodes\n\nNetwork #3\n SPF node 2 leaves 2 subnets\n SPF node 3 leaves 2 subnets\u003c/pre\u003e"}}]}