remove slow test LOL

Author: lrvideckis

tests/library_checker_aizu_tests/strings/longest_common_substring.test.cpp

@@ -12,15 +12,15 @@ int main() {
   pair<int, int> substr_s = {0, 0}, substr_t = {0, 0};
   for (int i = 0; i < sz(sf_a.lcp); i++) {
     if (both[sf_a.sa[i]] == '$' ||
-      both[sf_a.sa[i + 1]] == '$')
+        both[sf_a.sa[i + 1]] == '$')
       continue;
     bool before_in_s = (sf_a.sa[i] < sz(s));
     bool after_in_s = (sf_a.sa[i + 1] < sz(s));
     if (before_in_s ^ after_in_s) {
       if (sf_a.lcp[i] > substr_s.second - substr_s.first) {
         substr_s = {sf_a.sa[i], sf_a.sa[i] + sf_a.lcp[i]};
         substr_t = {
-          sf_a.sa[i + 1], sf_a.sa[i + 1] + sf_a.lcp[i]};
+            sf_a.sa[i + 1], sf_a.sa[i + 1] + sf_a.lcp[i]};
         if (after_in_s) swap(substr_s, substr_t);
         substr_t.first -= int(sz(s)) + 1;
         substr_t.second -= int(sz(s)) + 1;