{"trustable":false,"prependHtml":"\u003cstyle\u003e.statText pre { font-size: 12px; }\ntable {display:block !important; width:100%; }\ntable tbody {display:block !important; width:100%; }\ntable tbody tr { width:100% !important;display: block;}\ntable tbody tr td.statText { margin-left: 5px; display: inline-block; width: fit-content; }\ntable tbody tr td.statText br { display: block; content: \" \";line-height: 12px;margin: 12px 0;}\ntable tbody tr td.statText table table pre {\n white-space: pre-wrap;\n text-overflow: ellipsis;\n word-break: break-all;\n}\ntd { padding: 0 !important; border: none !important; }\npre { line-height: normal; margin: 0; }\n\u003c/style\u003e","sections":[{"title":"","value":{"format":"MD","content":"给定一张 N 个点 M 条边的图,边有权值 $d_i$。\n\n每次操作可以把其中一条边的边权 +1 或 -1。\n\n另外给定一组边集 $\\\\{e_1\\\\}$ 和一组边集 $\\\\{e_2\\\\}$,分别都有 N-1 条边。\n\n问最少多少次操作,可以使得 $\\\\{e_1\\\\}$ 是最小生成树的同时,$\\\\{e_2\\\\}$ 是最大生成树。"}},{"title":"","value":{"format":"MD","content":"\u003cstyle\u003e.statText pre { font-size: 12px; }\u003c/style\u003e\u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003ch3\u003eProblem Statement\u003c/h3\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cp\u003e Cat Noku received an undirected, connected, weighted graph with n nodes and m edges. The edges are labeled from 0 to m-1, and are described by the int[]s \u003cb\u003ea, b, w\u003c/b\u003e. The i-th edge connects the \u003cb\u003ea\u003c/b\u003e[i]-th node to the \u003cb\u003eb\u003c/b\u003e[i]-th node with weight \u003cb\u003ew\u003c/b\u003e[i]. It is guaranteed that this graph is connected. Also, it is guaranteed that this graph has no self-loops or multiple edges. \u003c/p\u003e \u003cp\u003e Cat Noku also has two spanning trees of the graph. These are described the int[]s \u003cb\u003em1, m2\u003c/b\u003e, which each contain exactly n-1 elements. The elements of each of these int[]s are the indices of the edges that form one of the two spanning trees. Note that it is possible for these two spanning trees to have some (possibly even all) edges in common. \u003c/p\u003e \u003cp\u003e Cat Noku would like to make his spanning trees \u003ci\u003eextreme\u003c/i\u003e. More specifically, he wants the following: \u003c/p\u003e\n \u003col\u003e \n \u003cli\u003e The spanning tree described by \u003cb\u003em1\u003c/b\u003e is a \u003ci\u003eminimum\u003c/i\u003e spanning tree. \u003c/li\u003e \n \u003cli\u003e The spanning tree described by \u003cb\u003em2\u003c/b\u003e is a \u003ci\u003emaximum\u003c/i\u003e spanning tree. \u003c/li\u003e \n \u003c/ol\u003e \u003cp\u003e\u003c/p\u003e \u003cp\u003e Of course, the conditions may not be currently satisfied, so to fix this, Cat Noku can modify the edge weights. In each second, he can choose exactly one edge, and either increase or decrease its weight by 1. All edge weights must remain positive at all times. \u003c/p\u003e \u003cp\u003e Please help Cat Noku find the minimum number of seconds needed to satisfy his goal. \u003c/p\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003ch3\u003eDefinition\u003c/h3\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003eClass:\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eExtremeSpanningTrees\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003eMethod:\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eminTime\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003eParameters:\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eint[], int[], int[], int[], int[]\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003eReturns:\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003elong\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003eMethod signature:\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003elong minTime(int[] a, int[] b, int[] w, int[] m1, int[] m2)\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e(be sure your method is public)\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003ch3\u003eNotes\u003c/h3\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e- A minimum spanning tree is a spanning tree that has the smallest sum of edge weights among all spanning trees. A maximum spanning tree is defined in the same way.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003ch3\u003eConstraints\u003c/h3\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003en will be between 2 and 50, inclusive.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003em will be between n-1 and 1,000, inclusive.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cb\u003ea,b,w\u003c/b\u003e will each contain exactly m elements.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eEach element of \u003cb\u003ew\u003c/b\u003e will be between 1 and 10^9, inclusive.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eEach element of \u003cb\u003ea,b\u003c/b\u003e will be between 0 and n-1, inclusive.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eThe edges described (a[i], b[i]) will describe a simple undirected connected graph.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cb\u003em1,m2\u003c/b\u003e will each contain exactly n-1 elements.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eElements in \u003cb\u003em1\u003c/b\u003e will be distinct, and between 0 and m-1, inclusive.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eElements in \u003cb\u003em2\u003c/b\u003e will be distinct, and between 0 and m-1, inclusive.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eThe indices specified by \u003cb\u003em1\u003c/b\u003e will denote a spanning tree.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" valign\u003d\"top\" class\u003d\"statText\"\u003e-\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003eThe indices specified by \u003cb\u003em2\u003c/b\u003e will denote a spanning tree.\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003ch3\u003eExamples\u003c/h3\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" nowrap\u003d\"true\" class\u003d\"statText\"\u003e0)\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{0,1,2,3,4}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{1,2,3,4,0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{6,1,2,4,9}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{1,0,3,2}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{3,1,2,0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003eReturns: 12\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003eIn this case, the same tree must be both a minimum and a maximum spanning tree. It is optimal to make all edge weights equal, which means we should move the edge weights to the median weight (in this case 4). Thus, the answer is |6-4|+|1-4|+|2-4|+|4-4|+|9-4| \u003d 12.\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" nowrap\u003d\"true\" class\u003d\"statText\"\u003e1)\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{0,1,2,3,4}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{1,2,3,4,0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{1000000000, 1, 50000, 230, 78778878}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{1,2,3,4}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{0,1,2,4}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003eReturns: 229\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003eOne optimal solution in this case is to increase the weight on the edge labeled 1 to 230.\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" nowrap\u003d\"true\" class\u003d\"statText\"\u003e2)\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{2, 3, 2, 1, 4, 3, 1, 2}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{4, 0, 1, 0, 0, 4, 3, 0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{35, 69, 83, 48, 23, 77, 18, 75}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{7, 2, 4, 6}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{6, 0, 3, 5}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003eReturns: 126\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" nowrap\u003d\"true\" class\u003d\"statText\"\u003e3)\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{18, 10, 7, 20, 25, 16, 0, 25, 1, 1, 18, 5, 21, 29, 0,\n19, 27, 5, 5, 2, 5, 14, 24, 28, 17, 17, 13, 28, 29, 21,\n27, 14, 3, 4, 0, 6, 7, 2, 19, 22, 1, 15, 28, 28, 22, 4,\n18, 27, 25, 25, 16, 26, 14, 24, 28, 23, 23, 2, 7, 25, 27,\n28, 24, 21, 3, 1, 4, 4, 23, 21}\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{26, 1, 0, 25, 6, 7, 19, 10, 3, 25, 19, 28, 24, 10, 10,\n1, 4, 21, 2, 13, 11, 9, 23, 27, 22, 25, 16, 25, 3, 3, 23,\n21, 20, 25, 5, 27, 12, 10, 10, 9, 13, 8, 22, 29, 16, 21,\n0, 8, 8, 11, 20, 29, 13, 7, 20, 11, 5, 3, 6, 22, 2, 21,\n16, 18, 0, 24, 2, 15, 16, 23}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{178550173, 70889251, 552583494, 693530287, 913018412,\n813354729, 22559015, 790019960, 417638821, 350031148,\n342183709, 546736964, 846258018, 288707281, 910585230,\n217659326, 472037330, 407441317, 869355814, 510462471,\n495766436, 645229822, 817030, 843038598, 814619628, 144969408,\n832500308, 150645645, 400781547, 266132945, 112756643,\n991866897, 166797713, 408918210, 192114032, 765168046,\n69601053, 422959288, 206902656, 71012802, 520439340, 779668518,\n457709439, 792537906, 212760134, 200551833, 511130875,\n811123320, 772309593, 734005608, 802837429, 982498923,\n335250225, 43356697,621725643, 161179558, 278880928, 88948197,\n77554027, 686360474, 851408784, 777256397, 279272225, 856462366,\n912791986, 518766837, 430982430, 985439708, 307712218, 659114756}\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{60, 44, 62, 66, 0, 34, 69, 1, 17, 40, 65, 6, 30, 21, 50, 8,\n10, 37, 41, 23, 9, 39, 36, 35, 58, 48, 28, 24, 20}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{20, 12, 29, 23, 26, 10, 55, 58, 53, 40, 24, 50, 15, 11, 35,\n48, 43, 63, 60, 39, 59, 46, 7, 42, 52, 41, 51, 36, 67}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003eReturns: 11341657393\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align\u003d\"center\" nowrap\u003d\"true\" class\u003d\"statText\"\u003e4)\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u003c/td\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{1}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{123456789}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003e{0}\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\u003cpre\u003eReturns: 0\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd class\u003d\"statText\"\u003e\n \u003ctable\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd colspan\u003d\"2\" class\u003d\"statText\"\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n \u003c/table\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n\u003c/table\u003e\n\u003chr\u003e\u003cp\u003eThis problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved. \u003c/p\u003e"}}]}