{"problem":{"name":"I. Incomparable Pairs","description":{"content":"You are given a string s = s1s2... sn. Consider an unordered pair of its substrings {a, b}. Let us call such pair _incomparable_ if neither a is a substring of b nor b is a substring of a. You have to","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":3000,"memory_limit":524288},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10212I"},"statements":[{"statement_type":"Markdown","content":"You are given a string s = s1s2... sn. Consider an unordered pair of its substrings {a, b}. Let us call such pair _incomparable_ if neither a is a substring of b nor b is a substring of a. You have to compute the number of incomparable pairs of substrings of s.\n\nThe first line of input contains a single string s consisting of lowercase English letters (1 ≤ |s| ≤ 105).\n\nOutput a single integer which is the answer to the problem.\n\n## Input\n\nThe first line of input contains a single string s consisting of lowercase English letters (1 ≤ |s| ≤ 105).\n\n## Output\n\nOutput a single integer which is the answer to the problem.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ s = s_1 s_2 \\dots s_n $ be a string of length $ n \\geq 1 $ over the alphabet of lowercase English letters.  \nLet $ \\mathcal{S} $ be the set of all non-empty substrings of $ s $.  \n\n**Constraints**  \n$ 1 \\leq n \\leq 10^5 $\n\n**Objective**  \nCompute the number of unordered pairs $ \\{a, b\\} \\subseteq \\mathcal{S} $, $ a \\neq b $, such that neither $ a $ is a substring of $ b $ nor $ b $ is a substring of $ a $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10212I","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}