{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cdiv id\u003d\"problem-body\"\u003e \n\u003cbr\u003e\n \u003cp\u003e As Diwali is a few days away , Amit wants to set up a shop to sell sweets having N counters. The counters are located along a straight line at positions x1, x2 ,. . . , xN .\u003cbr\u003e\u003cbr\u003e He has C types of sweets and he wants to put one type of sweets on one counter such that the minimum distance between any two type of sweets is as large as possible. (As some counters may remain empty).So what is the largest minimum distance between two counters having sweets on them ?\n\u003cbr\u003e \u003c/p\u003e \n\u003ch3\u003eConstraints\u003c/h3\u003e\n\u003cp\u003e 2 \u0026lt;\u003d N \u0026lt;\u003d 10\u003csup\u003e5\u003c/sup\u003e \u003cbr\u003e\n 0 \u0026lt;\u003d xi \u0026lt;\u003d 10\u003csup\u003e9\u003c/sup\u003e \u003cbr\u003e\n 2 \u0026lt;\u003d C \u0026lt;\u003d N\n\u003c/p\u003e\n\n \u003ch3\u003eInput\u003c/h3\u003e \n \u003cp\u003e\u003ci\u003e\u003c/i\u003eLine 1 : The number of test cases, then \u003ci\u003et\u003c/i\u003e test cases follows. \u003cbr\u003e Line 2: Two space-separated integers: N and C\u003cbr\u003e Next N Integers contains location X of counters .\u003cbr\u003e \u003c/p\u003e \n \u003ch3\u003eOutput\u003c/h3\u003e \n \u003cp\u003eFor each test case output one integer: the largest minimum distance.\u003cbr\u003e \u003c/p\u003e \n \u003ch3\u003eExample\u003c/h3\u003e \n \u003cp\u003e \u003cb\u003eInput:\u003c/b\u003e \u003c/p\u003e \n \u003cpre\u003e\n1\n5 3\n1 2 10 5 12\n\u003c/pre\u003e \n \u003cp\u003e \u003cb\u003eOutput:\u003c/b\u003e \u003c/p\u003e \n \u003cpre\u003e\n4\n\u003c/pre\u003e \n \u003cp\u003e \u003cb\u003eOutput details:\u003c/b\u003e \u003c/p\u003e \n \u003cp\u003e Amit can put his 3 sweets on the counter at positions 1, 5 ,10, or 1 , 5 , 12\nresulting in a minimum distance of 4 . \n\u003cbr\u003e \u003c/p\u003e \n \u003c/div\u003e\n \u003c/body\u003e\n\u003c/html\u003e\n"}}]}