给定一个字符串 $s = s_1s_2 \dots s_n$。考虑其子串的无序对 $\{a, b\}$。如果 $a$ 不是 $b$ 的子串，且 $b$ 也不是 $a$ 的子串，我们称这样的对为“不可比的”。你需要计算字符串 $s$ 中不可比子串对的数量。
输入的第一行包含一个由小写英文字母组成的字符串 $s$ ($1 \le |s| \le 10^5$)。
输出一个整数，即该问题的答案。
abba
8
abacaba
64
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: