Problem p02589 (C++) — buggy submission, verdict: Runtime Error

/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>

#include <boost/rational.hpp>
*/
// #include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
// using namespace atcoder;
#define _GLIBCXX_DEBUG
#define rep(i, t) for (ll i = (ll)(0); i < (ll)(t); i++)
#define rep2(i, s, t) for (ll i = (ll)(s); i < (ll)(t); i++)
#define rep3(i, t) for (ll i = (ll)(1); i <= (ll)(t); i++)
#define rep4(i, s, t) for (ll i = (ll)(s); i <= (ll)(t); i++)
#define repr(i, t) for (ll i = (t - 1); i >= (0); i--)
#define repr2(i, s, t) for (ll i = (t - 1); i >= (s); i--)
#define repr3(i, t) for (ll i = (t); i >= (1); i--)
#define repr4(i, s, t) for (ll i = (t); i >= (s); i--)
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 1e18;
const ll MINF = 1e15;
const int INF = 1e9 + 1e5;
// const int mod=1000000007;
const int mod = 998244353;

const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = acos(-1);
// const ll dx[] ={0,1,0,-1,1,-1,1,-1};
// const ll dy[] ={1,0,-1,0,1,1,-1,-1};
inline const bool ingrid(const int i, const int j, const int H, const int W) {
  return i >= 0 && i < H && j >= 0 && j < W;
}
const ll dx[] = {0, 1, 0, -1};
const ll dy[] = {1, 0, -1, 0};
const bool is_low(char c) { return ('a' <= c) && (c <= 'z'); }
const bool is_upp(char c) { return ('A' <= c) && (c <= 'Z'); }
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define rrep(n) for (ll i = (n); i--;)
#define stlen(s) ll s.size() - 1
#define all(v) begin(v), end(v)
#define range(v, a) begin(v), begin(v) + a
#define range2(v, a, b) begin(v) + a, begin(v) + b
#define range3(v, a) begin(v) + 1, begin(v) + a + 1
#define range4(v, a, b) begin(v) + a + 1, begin(v) + b + 1
#define allr(v) rbegin(v), v.rend(v)
#define ranger(v, a) rbegin(v), rbegin(v) + a
#define ranger2(v, a, b) rbegin(v) + a, rbegin(v) + b
#define ranger3(v, a) rbegin(v) + 1, rbegin(v) + a + 1
#define ranger4(v, a, b) rbegin(v) + a + 1, rbegin(v) + b + 1
#define cout(n) cout << std::fixed << std::setprecision(n)
// #define sum(...) accumulate(all(__VA_ARGS__),0LL)
#define dsum(...) accumulate(all(__VA_ARGS__), 0.0L)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define ULL(...)                                                               \\
  ull __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define CHR(...)                                                               \\
  char __VA_ARGS__;                                                            \\
  in(__VA_ARGS__)
#define DBL(...)                                                               \\
  double __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define LD(...)                                                                \\
  ld __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a)                                                                \\
  sort(all(a));                                                                \\
  a.erase(unique(all(a)), end(a));
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                  \\
  vector<type> name(size);                                                     \\
  in(name)
#define vv(type, name, h, ...)                                                 \\
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                   \\
  vector<vector<type>> name(h, vector<type>(w));                               \\
  in(name)
template <class T> inline const auto min(const T &a) {
  return *min_element(all(a));
}
template <class T> inline const auto max(const T &a) {
  return *max_element(all(a));
}
inline const ll popcnt(const ull a) { return __builtin_popcountll(a); }
inline const ll gcd(ll a, ll b) {
  while (b) {
    ll c = b;
    b = a % b;
    a = c;
  }
  return a;
}
inline const ll lcm(ll a, ll b) {
  unless(a && b) return 0;
  return a * b / gcd(a, b);
}
inline const ll intpow(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      ans *= a;
    a *= a;
    b /= 2;
  }
  return ans;
}
inline const ll modpow(ll a, ll b, ll p = mod) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      (ans *= a) %= p;
    (a *= a) %= p;
    b /= 2;
  }
  return ans;
}
template <class T, class U> inline const bool chmin(T &a, const U &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class U> inline const bool chmax(T &a, const U &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
inline const vector<ll> iota(const ll n) {
  vector<ll> a(n);
  iota(all(a), 0);
  return a;
}
inline const vector<pll> factor(ull x) {
  vector<pll> ans;
  for (ull i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans.push_back({i, 1});
      while ((x /= i) % i == 0)
        ans.back().second++;
    }
  if (x != 1)
    ans.push_back({x, 1});
  return ans;
}
inline const map<ll, ll> factor_map(ull x) {
  map<ll, ll> ans;
  for (ull i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans[i] = 1;
      while ((x /= i) % i == 0)
        ans[i]++;
    }
  if (x != 1)
    ans[x] = 1;
  return ans;
}
inline const vector<ll> divisor(ull x) {
  vector<ll> ans;
  for (ull i = 2; i * i <= x; i++)
    if (x % i == 0)
      ans.push_back(i);
  rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
  return ans;
}
inline const int scan() { return getchar(); }
inline const void scan(int &a) { scanf("%d", &a); }
inline const void scan(unsigned &a) { scanf("%u", &a); }
inline const void scan(long &a) { scanf("%ld", &a); }
inline const void scan(long long &a) { scanf("%lld", &a); }
inline const void scan(char &a) {
  do {
    a = getchar();
  } while (a == ' ' || a == '\\n');
}
inline const void scan(float &a) { scanf("%f", &a); }
inline const void scan(double &a) { scanf("%lf", &a); }
inline const void scan(long double &a) { scanf("%Lf", &a); }
inline const void scan(string &a) { cin >> a; }
template <class T> inline const void scan(vector<T> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, size_t size> inline const void scan(array<T, size> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, class L> inline const void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T, size_t size> inline const void scan(T (&a)[size]) {
  for (auto &&i : a)
    scan(i);
}
inline const void in() {}
template <class Head, class... Tail>
inline const void in(Head &head, Tail &...tail) {
  scan(head);
  in(tail...);
}
inline const int ctoi(const char c) {
  if (c >= 'a' && c <= 'z') {
    return c - 'a';
  }
  if (c >= 'A' && c <= 'Z') {
    return c - 'A';
  }
  if (c >= '0' && c <= '9') {
    return c - '0';
  }
  return -1;
}
inline const void print() { putchar(' '); }
inline const void print(const bool a) { printf("%d", a); }
inline const void print(const int a) { printf("%d", a); }
inline const void print(const unsigned a) { printf("%u", a); }
inline const void print(const long a) { printf("%ld", a); }
inline const void print(const unsigned long long a) { printf("%llu", a); }
inline const void print(const char a) { printf("%c", a); }
inline const void print(const double a) { printf("%.15f", a); }
inline const void print(const long double a) { printf("%.15Lf", a); }
inline const void print(const string &a) {
  for (auto &&i : a)
    print(i);
}
template <class T> inline const void print(const vector<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T> inline const void print(const deque<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T, size_t size> inline const void print(const T (&a)[size]) {
  print(a[0]);
  for (auto i = a; ++i != end(a);) {
    putchar(' ');
    print(*i);
  }
}
template <class T> inline const void print(const T &a) { cout << a; }
inline const int out() {
  putchar('\\n');
  return 0;
}
template <class T> inline const int out(const T &t) {
  print(t);
  putchar('\\n');
  return 0;
}
template <class Head, class... Tail>
inline const int out(const Head &head, const Tail &...tail) {
  print(head);
  putchar(' ');
  out(tail...);
  return 0;
}
inline const int first(const bool i) { return out(i ? "first" : "second"); }
inline const int yes(const bool i) { return out(i ? "yes" : "no"); }
inline const int Yes(const bool i) { return out(i ? "Yes" : "No"); }
inline const int YES(const bool i) { return out(i ? "YES" : "NO"); }
inline const int possible(const bool i) {
  return out(i ? "possible" : "impossible");
}
inline const int Possible(const bool i) {
  return out(i ? "Possible" : "Impossible");
}
inline const int POSSIBLE(const bool i) {
  return out(i ? "POSSIBLE" : "IMPOSSIBLE");
}

using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll, ll>>>;
using mat = vector<vector<ll>>;
using vec = vector<ll>;

/*
namespace mp = boost::multiprecision;
// 任意長整数型
using Bint = mp::cpp_int;
// 仮数部長が32の浮動小数点数型
using Real32 = mp::number<mp::cpp_dec_float<32>>;
// 仮数部長が1024の浮動小数点数型
using Real1024 = mp::number<mp::cpp_dec_float<1024>>;
// 有理数型
using Rat = boost::rational<Bint>;
*/
ll ans;

template <int char_size, int base> struct Trie {
  struct Node {
    vector<int> next; // 子の頂点番号を格納。存在しなければ-1
    vector<int> accept; // 末端がこの頂点になる文字列のstr_idを保存
    int c;              // 文字数をint型で表現したもの
    int common; // いくつの文字列がこの頂点を共有しているか
    Node(int c_) : c(c_), common(0) { next.assign(char_size, -1); }
  };
  vector<Node> nodes; // Trie 本体
  int root;           // 根
  Trie() : root(0) {
    // 初期化。はじめは根しか無い
    nodes.push_back(Node(root));
  }

  void insert(const string &word,
              int word_id) { // 単語:str と　単語の番号: str_id
    int node_id = 0;
    for (int i = 0; i < (int)word.size(); i++) {
      int c = (int)(word[i] - base);
      int &next_id = nodes[node_id].next[c];
      if (next_id == -1) { // 次の頂点が存在しなければ追加
        next_id = (int)nodes.size();
        nodes.push_back(Node(c));
      }
      ++nodes[node_id].common;
      node_id = next_id;
    }
    ++nodes[node_id]
          .common; // 単語の終端なのでノードが終端となる文字列の数として加算
    nodes[node_id].accept.push_back(
        word_id); // 単語の終端なので、頂点に番号を入れておく
  }
  void insert(const string &word) { insert(word, nodes[0].common); }
  // 単語とprefixの検索

  bool search(const string &word, bool prefix = false) {
    int node_id = 0;
    for (int i = 0; i < (int)word.size(); i++) {
      int c = (int)(word[i] - base);
      int next_id = nodes[node_id].next[c];
      if (next_id == -1) {
        return false;
      }
      node_id = next_id;
    }
    return (prefix)
               ? true
               : nodes[node_id].accept.size() > 0; // 最後の頂点が受理状態か確認
  }
  void mysearch(const string &word) {
    bool exist[word.size()][char_size];
    memset(exist, false, sizeof(exist));
    repr(i, word.size()) {
      if (i == word.size() - 1) {
        rep(j, char_size) exist[i][j] = (j == (int)(word[i] - base));

      } else {
        rep(j, char_size) exist[i][j] =
            (j == (int)(word[i] - base)) | exist[i + 1][j];
      }
    }

    int node_id = 0;
    for (int i = 0; i < (int)word.size(); i++) {
      rep(j, 26) if (exist[i][j]) {
        int next_id = nodes[node_id].next[j];
        if (next_id != -1 && nodes[next_id].accept.size() > 0)
          ans++;
      }
      node_id = nodes[node_id].next[(int)(word[i] - base)];
    }
  }
  // 指定したprefixを持つ文字列があるか検索
  bool startwith(const string &prefix) { return search(prefix, true); }
  // 挿入した単語の数
  int count() const { return (nodes[0].common); }
  // Trie木のノード数
  int size() const { return (int)nodes.size(); }
};

signed main() {
  INT(N);
  vector<string> S(N);
  rep(i, N) cin >> S[i];
  rep(i, N) Rev(S[i]);

  Trie<26, 'a'> trie;
  rep(i, N) trie.insert(S[i]);
  rep(i, N) trie.mysearch(S[i]);
  out(ans - N);
}

Error: 0

Fixed submission:

/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>

#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, t) for (ll i = (ll)(0); i < (ll)(t); i++)
#define rep2(i, s, t) for (ll i = (ll)(s); i < (ll)(t); i++)
#define rep3(i, t) for (ll i = (ll)(1); i <= (ll)(t); i++)
#define rep4(i, s, t) for (ll i = (ll)(s); i <= (ll)(t); i++)
#define repr(i, t) for (ll i = (t - 1); i >= (0); i--)
#define repr2(i, s, t) for (ll i = (t - 1); i >= (s); i--)
#define repr3(i, t) for (ll i = (t); i >= (1); i--)
#define repr4(i, s, t) for (ll i = (t); i >= (s); i--)
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int mod = 1000000007;
// const int mod=998244353;

const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = acos(-1);
// const ll dx[] ={0,1,0,-1,1,-1,1,-1};
// const ll dy[] ={1,0,-1,0,1,1,-1,-1};
bool grindin(int i, int j, int H, int W) {
  return i >= 0 && i < H && j >= 0 && j < W;
}
const ll dx[] = {0, 1, 0, -1};
const ll dy[] = {1, 0, -1, 0};
#define is_low(c) ('a' <= c) && (c <= 'z')
#define is_upp(c) ('A' <= c) && (c <= 'Z')
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define rrep(n) for (ll i = (n); i--;)
#define stlen(s) ll s.size() - 1
#define all(v) begin(v), end(v)
#define range(v, a) begin(v), begin(v) + a
#define range2(v, a, b) begin(v) + a, begin(v) + b
#define range3(v, a) begin(v) + 1, begin(v) + a + 1
#define range4(v, a, b) begin(v) + a + 1, begin(v) + b + 1
#define allr(v) rbegin(v), v.rend(v)
#define ranger(v, a) rbegin(v), rbegin(v) + a
#define ranger2(v, a, b) rbegin(v) + a, rbegin(v) + b
#define ranger3(v, a) rbegin(v) + 1, rbegin(v) + a + 1
#define ranger4(v, a, b) rbegin(v) + a + 1, rbegin(v) + b + 1
#define cout(n) cout << std::fixed << std::setprecision(n)
// #define sum(...) accumulate(all(__VA_ARGS__),0LL)
#define dsum(...) accumulate(all(__VA_ARGS__), 0.0L)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define ULL(...)                                                               \\
  ull __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define CHR(...)                                                               \\
  char __VA_ARGS__;                                                            \\
  in(__VA_ARGS__)
#define DBL(...)                                                               \\
  double __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define LD(...)                                                                \\
  ld __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a)                                                                \\
  sort(all(a)); a.erase(unique(all(a))),end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                  \\
  vector<type> name(size);                                                     \\
  in(name)
#define vv(type, name, h, ...)                                                 \\
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                   \\
  vector<vector<type>> name(h, vector<type>(w));                               \\
  in(name)
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
  while (b) {
    ll c = b;
    b = a % b;
    a = c;
  }
  return a;
}
ll lcm(ll a, ll b) {
  unless(a && b) return 0;
  return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      ans *= a;
    a *= a;
    b /= 2;
  }
  return ans;
}
ll modpow(ll a, ll b, ll p = mod) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      (ans *= a) %= p;
    (a *= a) %= p;
    b /= 2;
  }
  return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<ll> iota(ll n) {
  vector<ll> a(n);
  iota(all(a), 0);
  return a;
}
vector<pll> factor(ull x) {
  vector<pll> ans;
  for (ull i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans.push_back({i, 1});
      while ((x /= i) % i == 0)
        ans.back().second++;
    }
  if (x != 1)
    ans.push_back({x, 1});
  return ans;
}
map<ll, ll> factor_map(ull x) {
  map<ll, ll> ans;
  for (ull i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans[i] = 1;
      while ((x /= i) % i == 0)
        ans[i]++;
    }
  if (x != 1)
    ans[x] = 1;
  return ans;
}
vector<ll> divisor(ull x) {
  vector<ll> ans;
  for (ull i = 2; i * i <= x; i++)
    if (x % i == 0)
      ans.push_back(i);
  rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
  return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(char &a) {
  do {
    a = getchar();
  } while (a == ' ' || a == '\\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
  for (auto &&i : a)
    scan(i);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
  scan(head);
  in(tail...);
}
int ctoi(char c) {
  if (c >= 'a' && c <= 'z') {
    return c - 'a';
  }
  if (c >= 'A' && c <= 'Z') {
    return c - 'A';
  }
  return -1;
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
  for (auto &&i : a)
    print(i);
}
template <class T> void print(const vector<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T> void print(const deque<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T, size_t size> void print(const T (&a)[size]) {
  print(a[0]);
  for (auto i = a; ++i != end(a);) {
    putchar(' ');
    print(*i);
  }
}
template <class T> void print(const T &a) { cout << a; }
int out() {
  putchar('\\n');
  return 0;
}
template <class T> int out(const T &t) {
  print(t);
  putchar('\\n');
  return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
  print(head);
  putchar(' ');
  out(tail...);
  return 0;
}
int first(bool i) { return out(i ? "first" : "second"); }
int yes(bool i) { return out(i ? "yes" : "no"); }
int Yes(bool i) { return out(i ? "Yes" : "No"); }
int YES(bool i) { return out(i ? "YES" : "NO"); }
int possible(bool i) { return out(i ? "possible" : "impossible"); }
int Possible(bool i) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }

using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll, ll>>>;
using mat = vector<vector<ll>>;
using vec = vector<ll>;

/*
namespace mp = boost::multiprecision;
// 任意長整数型
using Bint = mp::cpp_int;
// 仮数部長が32の浮動小数点数型
using Real32 = mp::number<mp::cpp_dec_float<32>>;
// 仮数部長が1024の浮動小数点数型
using Real1024 = mp::number<mp::cpp_dec_float<1024>>;
// 有理数型
using Rat = boost::rational<Bint>;
*/

/* 4 方向への隣接頂点への移動を表すベクトル */

signed main() {

  INT(N);

  ll ans = 0;

  map<string, bool> ms;
  string S[N];
  rep(i, N) {

    cin >> S[i];
    ms[S[i]] = true;
  }

  rep(i, N) {

    if (S[i].size() == 1)
      continue;
    bool seen[26];
    memset(seen, false, sizeof(seen));
    seen[ctoi(S[i][0])] = true;
    string table[S[i].size()];
    table[S[i].size() - 1] = S[i].substr(S[i].size() - 1, 1);
    repr(j, S[i].size() - 1) table[j] = string(1, S[i][j]) + table[j + 1];

    rep2(j, 2, S[i].size()) {
      seen[ctoi(S[i][j - 1])] = true;
      for (char c = 'a'; c <= 'z'; c++) {

        if (seen[ctoi(c)] && ms[string(1, c) + table[j]])
          ans++;
      }
    }
    seen[ctoi(S[i][S[i].size() - 1])] = true;
    for (char c = 'a'; c <= 'z'; c++)
      if (seen[ctoi(c)] && ms[string(1, c)])
        ans++;
  }
  out(ans);
}