{"raw_statement":[{"iden":"problem statement","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`."},{"iden":"constraints","content":"*   $S$ is a string of length between $1$ and $100$, inclusive, consisting of lowercase English letters."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"yay"},{"iden":"sample output 1","content":"5\n\n$S$ has the following five different non-empty substrings:\n\n*   `a`\n*   `y`\n*   `ay`\n*   `ya`\n*   `yay`"},{"iden":"sample input 2","content":"aababc"},{"iden":"sample output 2","content":"17"},{"iden":"sample input 3","content":"abracadabra"},{"iden":"sample output 3","content":"54"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}