#define clr(v, d) memset(v, d, sizeof(v)) #define rep(i, v) for(int i=0;i<sz(v);++i) #define lp(i, n) for(int i=0;i<(int)(n);++i) #define lpi(i, j, n) for(int i=(j);i ...
Let’s see a very basic problem. Count the number of distinct substrings that occur in a given string. You can solve this problem in two ways. The number of different substrings is equal to the number ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results