{"problem":{"name":"Substring","description":{"content":"You are given a string $S$ consisting of lowercase English letters. How many different non-empty substrings does $S$ have? A substring is a contiguous subsequence. For example, `xxx` is a substring of","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc347_b"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ consisting of lowercase English letters. How many different non-empty substrings does $S$ have?\nA substring is a contiguous subsequence. For example, `xxx` is a substring of `yxxxy` but not of `xxyxx`.\n\n## Constraints\n\n*   $S$ is a string of length between $1$ and $100$, inclusive, consisting of lowercase English letters.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc347_b","tags":[],"sample_group":[["yay","5\n\n$S$ has the following five different non-empty substrings:\n\n*   `a`\n*   `y`\n*   `ay`\n*   `ya`\n*   `yay`"],["aababc","17"],["abracadabra","54"]],"created_at":"2026-03-03 11:01:14"}}