{"trustable":false,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\t\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n\t MathJax.Hub.Config({\n\t extensions: [\"tex2jax.js\"],\n\t jax: [\"input/TeX\", \"output/SVG\"],\n\t tex2jax: {\n\t inlineMath: [ [\u0027$\u0027,\u0027$\u0027], [\"\\\\(\",\"\\\\)\"] ],\n\t displayMath: [ [\u0027$$\u0027,\u0027$$\u0027], [\"\\\\[\",\"\\\\]\"] ],\n\t processEscapes: true\n\t },\n\t });\n\t\u003c/script\u003e\n\t\u003cscript type\u003d\"text/javascript\"\n\t src\u003d\"https://cdn.staticfile.org/mathjax/2.7.0/MathJax.js\"\u003e\n\t\u003c/script\u003e\n \n\n\u003cbr\u003e现在要安排n道题目的顺序,如果第i到题目放在第j个位置,产生Pij的愉悦度。\n\u003cbr\u003e如果产生总的愉悦度大于等于M,则这个顺序是可以接受的。\n\u003cbr\u003e现在随机产生顺序,期望随机多少次,就可以第一次产生可以接受的排列顺序。\n\n "}},{"title":"Input","value":{"format":"HTML","content":"\n\u003cbr\u003e第一行一个整数T,表示测试数据组数。\n\u003cbr\u003e对于每组测试数据,第一行两个整数N和M (1 \u0026lt;\u003d \u003cvar\u003eN\u003c/var\u003e \u0026lt;\u003d 12) (1 \u0026lt;\u003d \u003cvar\u003eM\u003c/var\u003e \u0026lt;\u003d 500). \n\u003cbr\u003e接下来N行,每行N个数,第i行的第j个数表示Pij"}},{"title":"Output","value":{"format":"HTML","content":"\n\u003cbr\u003e如果永远无法产生,输出\"No solution\"\n\u003cbr\u003e否则输出一个分数p/q,p和q的公约数为1\n \n"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003c/h4\u003e \n \u003cpre\u003e2\n3 10\n2 4 1\n3 2 2\n4 5 3\n2 6\n1 3\n2 4\n\u003c/pre\u003e \n \u003ch4"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003c/h4\u003e \n \u003cpre\u003e3/1\nNo solution\n\u003c/pre\u003e \n "}}]}