{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Given two integers, **a** and **b**, you should check whether **a** is divisible by **b** or not. We know that an integer **a** is divisible by an integer **b** if and only if there exists an integer **c** such that **a \u003d b * c**."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026le; 525)**, denoting the number of test cases.\n\nEach case starts with a line containing two integers **a (-10\u003csup\u003e200\u003c/sup\u003e \u0026le; a \u0026le; 10\u003csup\u003e200\u003c/sup\u003e)** and **b (|b| \u0026gt; 0, b fits into a 32 bit signed integer)**. Numbers will not contain any leading zeroes."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number first. Then print `divisible` if **a** is divisible by **b**. Otherwise print `not divisible`."}},{"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\u003e6\n101 101\n0 67\n-101 101\n7678123668327637674887634 101\n11010000000000000000 256\n-202202202202000202202202 -101\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: divisible\nCase 2: divisible\nCase 3: divisible\nCase 4: not divisible\nCase 5: divisible\nCase 6: divisible\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}