DifDif
Practice
4 (65 votes)
Approved
Brute force
Easy
Open
Problem
92% Success 8287 Attempts 20 Points 2s Time Limit 256MB Memory 1024 KB Max Code
You are given a string S. Find the number of different substrings in S.
Input
One line containing a string S consisting of lowercase Latin letters.
Output
Output one integer - answer to the question.
Constraints
1 <= length of S <= 1200
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Submissions
Please login to view your submissions
Similar Problems
Points:20
3 votes
Tags:
Suffix ArrayAdvanced Data StructuresReal worldData Structures
Editorial
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor