{"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":"","value":{"format":"HTML","content":"给你n个城市,m条单向边,再给你起点终点,问你多少条不同的最短路"}},{"title":"Input","value":{"format":"HTML","content":"第一个数T,测试样例数(T\u003c\u003d65)\n每个测试样例,给出n,m(2\u003c\u003dn\u003c\u003d1000,0\u003c\u003dm\u003c\u003d100000),表示节点个数和边个数,接下来m行啊,给出a,b,c代表起点,终点,边的权。\n单向边,可能有重边,自环,如果有两条边都是从a-\u003eb,他们是不同的边,最后一行给出起点终点,他们互不相同"}},{"title":"Output","value":{"format":"HTML","content":"Output a line with a integer, means the chances starvae can get at most."}},{"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\u003e3\n7 8\n1 2 1\n1 3 1\n2 4 1\n3 4 1\n4 5 1\n4 6 1\n5 7 1\n6 7 1\n1 7\n\n6 7\n1 2 1\n2 3 1\n1 3 3\n3 4 1\n3 5 1\n4 6 1\n5 6 1\n1 6\n\n2 2\n1 2 1\n1 2 2\n1 2\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1\n1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}