{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eThis is a very simple problem that everyone learned at school. Given two numbers \u003cb\u003ea\u003c/b\u003e and \u003cb\u003eb\u003c/b\u003e, you\u0027ll have to tell if \u003cb\u003ea\u003c/b\u003e is divisible by \u003cb\u003eb\u003c/b\u003e."}},{"title":"Input","value":{"format":"HTML","content":" \n \u003cp\u003eInput starts with an integer \u003cb\u003et (t ≤ 525)\u003c/b\u003e, denoting the number of test cases.\u003c/p\u003e \n \u003cp\u003eEach case starts with a line containing two integers \u003cb\u003ea (-10\u003csup\u003e200\u003c/sup\u003e ≤ a ≤ 10\u003csup\u003e200\u003c/sup\u003e)\u003c/b\u003e and \u003cb\u003eb (|b| \u0026gt; 0, b fits into a 32 bit signed integer)\u003c/b\u003e. Numbers will not contain leading zeroes.\u003c/p\u003e \n "}},{"title":"Output","value":{"format":"HTML","content":" \n \u003cp\u003eFor each case, print the case number first. Then print \u003cb\u003e\u0027divisible\u0027\u003c/b\u003e if \u003cb\u003ea\u003c/b\u003e is divisible by \u003cb\u003eb\u003c/b\u003e. Otherwise print \u003cb\u003e\u0027not divisible\u0027\u003c/b\u003e.\u003c/p\u003e \n "}},{"title":"Sample Input","value":{"format":"HTML","content":"6\u003cbr\u003e\n101 101\u003cbr\u003e\n0 67\u003cbr\u003e\n-101 101\u003cbr\u003e\n7678123668327637674887634 101\u003cbr\u003e\n11010000000000000000 256\u003cbr\u003e\n-202202202202000202202202 -101\u003cbr\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"Case 1: divisible\u003cbr\u003e\nCase 2: divisible\u003cbr\u003e\nCase 3: divisible\u003cbr\u003e\nCase 4: not divisible\u003cbr\u003e\nCase 5: divisible\u003cbr\u003e\nCase 6: divisible\u003cbr\u003e"}}]}