{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"来源洛谷","value":{"format":"MD","content":"## 题面翻译\n\n给定一个 $01$ 串 $t$ 和一个字母串 $s$,求有多少对字符串 $(r_0, r_1)$ 满足 $r_0 \\neq r_1$ 且将 $t$ 中的 $0$ 都换成 $r_0$,$1$ 都换成 $r_1$ 后,得到的字符串与 $s$ 相同。\n\n$2 \\leq |t| \\leq 10^5$,$1 \\leq |s| \\leq 10^6$,$t$ 中至少存在一个 $0$ 和一个 $1$。\n\n注意翻译中的 $s, t$ 与英文题面中的相反。\n\n## 题目描述\n\nOne of Arkady\u0027s friends works at a huge radio telescope. A few decades ago the telescope has sent a signal $ s $ towards a faraway galaxy. Recently they\u0027ve received a response $ t $ which they believe to be a response from aliens! The scientists now want to check if the signal $ t $ is similar to $ s $ .\n\nThe original signal $ s $ was a sequence of zeros and ones (everyone knows that binary code is the universe-wide language). The returned signal $ t $ , however, does not look as easy as $ s $ , but the scientists don\u0027t give up! They represented $ t $ as a sequence of English letters and say that $ t $ is similar to $ s $ if you can replace all zeros in $ s $ with some string $ r_0 $ and all ones in $ s $ with some other string $ r_1 $ and obtain $ t $ . The strings $ r_0 $ and $ r_1 $ must be different and non-empty.\n\nPlease help Arkady\u0027s friend and find the number of possible replacements for zeros and ones (the number of pairs of strings $ r_0 $ and $ r_1 $ ) that transform $ s $ to $ t $ .\n\n## 输入格式\n\nThe first line contains a string $ s $ ( $ 2 \\le |s| \\le 10^5 $ ) consisting of zeros and ones — the original signal.\n\nThe second line contains a string $ t $ ( $ 1 \\le |t| \\le 10^6 $ ) consisting of lowercase English letters only — the received signal.\n\nIt is guaranteed, that the string $ s $ contains at least one \u00270\u0027 and at least one \u00271\u0027.\n\n## 输出格式\n\nPrint a single integer — the number of pairs of strings $ r_0 $ and $ r_1 $ that transform $ s $ to $ t $ .\n\nIn case there are no such pairs, print $ 0 $ .\n\n## 样例 #1\n\n### 样例输入 #1\n\n```\n01\naaaaaa\n```\n\n### 样例输出 #1\n\n```\n4\n```\n\n## 样例 #2\n\n### 样例输入 #2\n\n```\n001\nkokokokotlin\n```\n\n### 样例输出 #2\n\n```\n2\n```\n\n## 提示\n\nIn the first example, the possible pairs $ (r_0, r_1) $ are as follows:\n\n- \"a\", \"aaaaa\"\n- \"aa\", \"aaaa\"\n- \"aaaa\", \"aa\"\n- \"aaaaa\", \"a\"\n\nThe pair \"aaa\", \"aaa\" is not allowed, since $ r_0 $ and $ r_1 $ must be different.\n\nIn the second example, the following pairs are possible:\n\n- \"ko\", \"kokotlin\"\n- \"koko\", \"tlin\""}},{"title":"有问题问你谷","value":{"format":"MD","content":"双倍经验:[Gym-243494H](../Gym-243494H) QwQ"}}]}