All Tracks Data Structures Advanced Data Structures Suffix Arrays Problem

DifDif
/

Brute Force

Problem
Editorial
Analytics

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

SAMPLE INPUT
abc
SAMPLE OUTPUT
6
Time Limit: 2.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

This Problem was Asked in

Initializing Code Editor...
Notifications
View All Notifications

?