{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eYou’re given strings \u003ci\u003eA\u003c/i\u003e and \u003ci\u003eB\u003c/i\u003e.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eYour task is to find 3 numbers:\u003cbr\u003e\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003e1. count of non-empty palindromes \u003ci\u003ep\u003c/i\u003e such that \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eA\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e) \u0026gt; \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eB\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e); \u003cbr\u003e\r\n2. count of non-empty palindromes \u003ci\u003ep\u003c/i\u003e such that \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eA\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e) \u003d \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eB\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e) and \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eA\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e) ≠ 0;\u003cbr\u003e\r\n3. count of non-empty palindromes \u003ci\u003ep\u003c/i\u003e such that \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eA\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e) \u0026lt; \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eB\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e),\u003cbr\u003e\r\nwhere \u003ci\u003ef\u003c/i\u003e(\u003ci\u003eA\u003c/i\u003e, \u003ci\u003ep\u003c/i\u003e) \u003d count of occurrences \u003ci\u003ep\u003c/i\u003e into \u003ci\u003eA\u003c/i\u003e. \u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line contains \u003ci\u003eT\u003c/i\u003e that is the number of tests to follow.\r\nThe next 2\u003ci\u003eT\u003c/i\u003e lines contain strings \u003ci\u003eA\u003c/i\u003e and \u003ci\u003eB\u003c/i\u003e for each test.\r\nThe\u0026nbsp;length of \u003ci\u003eA\u003c/i\u003e and \u003ci\u003eB\u003c/i\u003e will not exceed 200\u0026nbsp;000.\r\nIt is guaranteed that the size of input data doesn\u0027t exceed 8 MB.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eFor each test \u003ci\u003ei\u003c/i\u003e print “Case #i: x y z” on a separate line where \u003ci\u003ex\u003c/i\u003e, \u003ci\u003ey\u003c/i\u003e and \u003ci\u003ez\u003c/i\u003e are the three numbers to compute.\u003c/div\u003e\u003c/div\u003e"}},{"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\r\nabacab\r\nabccab\r\nfaultydogeuniversity\r\nhasnopalindromeatall\r\nabbacabbaccab\r\nyoumayexpectedstrongsamplesbutnow\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 4 1 2\r\nCase #2: 8 3 9\r\nCase #3: 13 0 15\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}