{"trustable":true,"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":"\u003cdiv id\u003d\"problem-body\"\u003e\n\t\u003cp\u003e \u003c/p\u003e\r\n\u003ctable class\u003d\"problems\" style\u003d\"width: 100%;\" border\u003d\"0\"\u003e\r\n\u003ctbody\u003e\r\n\u003ctr class\u003d\"navigation\"\u003e\r\n\u003ctd width\u003d\"50%\"\u003e\u003ca href\u003d\"https://www.spoj.com/problems/TPCPALIN/en/\"\u003eEnglish\u003c/a\u003e\u003c/td\u003e\r\n\u003ctd width\u003d\"50%\"\u003e\u003ca href\u003d\"https://www.spoj.com/problems/TPCPALIN/vn/\"\u003eVietnamese\u003c/a\u003e\u003c/td\u003e\r\n\u003c/tr\u003e\r\n\u003c/tbody\u003e\r\n\u003c/table\u003e\r\n\u003cp\u003e\u003c/p\u003e\r\n\r\n\u003cp\u003eGiven two strings s1 and s2. We can merge characters of two strings (with order in original strings) to get a new string.\u003c/p\u003e\r\n\u003cp\u003eFor example : s1 \u003d \u0027ab\u0027 and s2 \u003d \u0027ba\u0027.\u003c/p\u003e\r\n\u003cp\u003eWe can merge to get st \u003d \u0027a\u003cstrong\u003eb\u003c/strong\u003eb\u003cstrong\u003ea\u003c/strong\u003e\u0027 but not st \u003d \u0027a\u003cstrong\u003eab\u003c/strong\u003eb\u0027.\u003c/p\u003e\r\n\u003cp\u003e\u003cstrong\u003eThe Problem :\u003c/strong\u003e\u0026nbsp;Given two string contain only lowercase letters, count the number of palindrome by merging in different ways.\u0026nbsp;\u003c/p\u003e\r\n\u003cp\u003eExample: \u0027aba\u0027, \u0027abba\u0027 are palindrome, \u0027abc\u0027 and \u0027abca\u0027 aren\u0027t.\u003c/p\u003e\r\n\u003ch3\u003eInput\u003c/h3\u003e\r\n\u003cp\u003e- Two lines, each line contains a string, string\u0027s length isn\u0027t over 500.\u003c/p\u003e\r\n\u003ch3\u003eOutput\u003c/h3\u003e\r\n\u003cp\u003e- A single integer is the number of palindrome after \u003cstrong\u003emodulo 3210121\u003c/strong\u003e.\u003c/p\u003e\r\n\u003ch3\u003eExample\u003c/h3\u003e\r\n\u003cdiv\u003e\u003ctable class\u003d\"vjudge_sample\"\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\u003eab\r\nba\r\n\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e\r\n\r\n\u003cp\u003e \u003c/p\u003e\n\u003c/div\u003e"}}]}