CCC '03 S4 - Substrings

View as PDF

Submit solution

Points: 15 (partial)
Time limit: 3.0s
Memory limit: 256M

Problem type
2003 Canadian Computing Competition, Stage 1, Senior #4

How many distinct substrings does a given string S have?

For example, if S = "abc", S has 7 distinct substrings: "", "a", "b", "c", "ab", "bc", "abc". Note that the empty string and S itself are considered substrings of S.

On the other hand, if S = "aaa". S has only 4 distinct substrings: "", "a", "aa", "aaa".

Input Specification

The first line of the input file contains N, the number of test cases. For each test case, a line follows giving S, a string of from 1 to 5000 alphanumeric characters.

Output Specification

Your output consists of one line per case, giving the number of distinct substrings of S.

Grading

50% of test cases will have l (the length of the string) where l \le 1000. For all cases, l \le 5000.

Sample Input

2
abc
aaa

Output for Sample Input

7
4

Comments


  • -2
    daviecar  commented on Oct. 27, 2019, 5:42 p.m. edited

    I don't think it was supposed to happen, but I just completely brute forced it... (https://dmoj.ca/submission/1661542) Now may I have some tips on how to not be stupid and do it properly?


    • 1
      kingW3  commented on Oct. 27, 2019, 6:25 p.m.

      Since you solved the problem you can view all the solutions to this problem, you could go to "Best submissions" and find the most readable code and try to understand it, or like someone in the comments mentioned google Suffix Tree.


  • 0
    ScriptKitty  commented on July 17, 2018, 4:12 p.m. edit 2

    .


  • 6
    Beautiful_Times  commented on Nov. 29, 2017, 10:04 p.m.

    What are the constraints are N?


    • 3
      Arman_Lamei  commented on July 16, 2019, 10:36 a.m.

      1 <= N <= 5


    • 14
      InfernoApeZ  commented on Nov. 29, 2017, 11:30 p.m.

      N is a real number.


  • -6
    anishmahto  commented on Oct. 23, 2016, 8:12 a.m. edited

    This comment is hidden due to too much negative feedback. Click here to view it.


  • 1
    raggarwal  commented on Nov. 23, 2014, 12:00 a.m.

    Any tips to optimize the code? test case 3/6/7 are >15 seconds for me.


    • 11
      FatalEagle  commented on Nov. 23, 2014, 9:49 a.m.

      Your algorithm is brute force with a worst-case complexity of O(N^4). There are faster algorithms to solve this (like Suffix Tree).