{"trustable":false,"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":"1","value":{"format":"HTML","content":" 求1到n的最短路"}},{"title":"2","value":{"format":"HTML","content":"输入包括多组数据。每组数据第一行是两个整数M、N(N\u0026lt;\u003d100,M\u0026lt;\u003d10000),N表示成都的大街上有几个路口,M则表示有几条路。N\u003dM\u003d0表示输入结束。接下来M行,每行包括3个整数A,B,C(1\u0026lt;\u003dA,B\u0026lt;\u003dN,1\u0026lt;\u003dC\u0026lt;\u003d1000),表示在路口A与路口B之间有一条路,我们需要C分钟的时间走过这条路。 \n输入保证至少存在1条路线。 "}},{"title":"3","value":{"format":"HTML","content":"对于每组输入,输出一行,表示最短时间"}},{"title":"4","value":{"format":"HTML","content":"\u003cpre\u003e1 2\n1 2 3\n3 3\n1 2 5\n2 3 5\n3 1 2\n0 0\u003c/pre\u003e"}},{"title":"5","value":{"format":"HTML","content":"\u003cpre\u003e3\n2\u003c/pre\u003e"}},{"title":"6","value":{"format":"HTML","content":"#"}},{"title":"7","value":{"format":"HTML","content":"i"}},{"title":"8","value":{"format":"HTML","content":"n"}},{"title":"9","value":{"format":"HTML","content":"c"}},{"title":"10","value":{"format":"HTML","content":"l"}},{"title":"11","value":{"format":"HTML","content":"u"}},{"title":"12","value":{"format":"HTML","content":"d"}},{"title":"13","value":{"format":"HTML","content":"e"}}]}