Problem p04018 (C++)

Buggy submission (status: Runtime Error):
/*

This Submission is to determine how many 120/240 min const. delivery point there
are.

//info
120 req. steps <= 5
*/
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define MOD 998244353LL
#define seg_size 262144
#define REP(a, b) for (long long a = 0; a < b; ++a)

unsigned long xor128() {
  static unsigned long x = time(NULL), y = 362436069, z = 521288629,
                       w = 88675123;
  unsigned long t = (x ^ (x << 11));
  x = y;
  y = z;
  z = w;
  return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a, complex<double> b) {
  return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
  return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
  return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
  double cosine = dot(a, b) / (leng(a) * leng(b));
  double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
  double kaku = acos(min((double)1.0, max((double)-1.0, cosine)));
  if (sine <= 0) {
    kaku = 2 * Ma_PI - kaku;
  }
  return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
  vector<int> ans;
  double now_minnest = a[0].real();
  int now_itr = 0;
  REP(i, a.size()) {
    if (now_minnest > a[i].real()) {
      now_minnest = a[i].real();
      now_itr = i;
    }
  }
  ans.push_back(now_itr);
  complex<double> ba(0, 1);
  while (true) {
    int now_go = 0;
    double now_min = 0;
    double now_length = 0;
    int starter = ans[ans.size() - 1];
    for (int i = 0; i < a.size(); ++i) {
      if (i != starter) {
        double goa = angles(ba, a[i] - a[starter]);
        if (goa - now_min >= eps ||
            (abs(goa - now_min) <= eps &&
             (abs(a[i] - a[starter]) - now_length) >= eps)) {
          now_min = goa;
          now_go = i;
          now_length = abs(a[i] - a[starter]);
        }
      }
    }
    if (now_go == ans[0])
      break;
    ans.push_back(now_go);
    ba = complex<double>(a[now_go] - a[starter]);
  }
  return ans;
}
long long geko[200000] = {};
pair<long long, long long> nya[200000];
long long powing(long long A, long long B, long long C) {
  long long ans = 1;
  while (B != 0) {
    if (B % 2 == 1) {
      ans *= A;
      ans %= C;
    }
    A *= A;
    A %= C;
    B /= 2;
  }
  return ans;
}
pair<long long, long long> oks(long long start, long long len) {
  pair<long long, long long> first_set = nya[start + len - 1]; // finite
  if (start != 0) {
    pair<long long, long long> geko = nya[start - 1];
    geko.first *= powing(26, len, MAX_MOD);
    geko.second *= powing(26, len, MOD);
    geko.first %= MAX_MOD;
    geko.second %= MOD;
    first_set =
        make_pair(first_set.first - geko.first, first_set.second - geko.second);
    first_set.first = (first_set.first + MAX_MOD) % MAX_MOD;
    first_set.second = (first_set.second + MOD) % MOD;
  }
  return first_set;
}
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int ok = 1;
  for (int i = 1; i < s.length(); ++i) {
    if (s[i] != s[i - 1]) {
      ok = 0;
    }
  }
  if (ok == 1) {
    cout << s.length() << endl;
    cout << 1 << endl;
    return 0;
  }
  ok = 1;
  for (int i = 2; i < s.length(); ++i) {
    if (s.length() % i == 0) {
      int tmp = 0;
      for (int q = 0; q < s.length(); ++q) {
        if (s[q % i] != s[q]) {
          tmp = 1;
          break;
        }
      }
      if (tmp == 0) {
        ok = 0;
        break;
      }
    }
  }
  if (ok == 1) {
    cout << 1 << endl;
    cout << 1 << endl;
    return 0;
  }
  long long ans = s.length() - 1;
  pair<long long, long long> now = make_pair(0, 0);
  for (int i = 0; i < s.length(); ++i) {
    now.first *= 26;
    now.second *= 26;
    now.first += s[i] - 'a';
    now.second += s[i] - 'a';
    now.first %= MAX_MOD;
    now.second %= MOD;
    nya[i] = now;
  }
  for (int i = 1; i < s.length(); ++i) {
    for (int q = 2; i * q < s.length(); ++q) {
      if (oks(i * (q - 1), i) == nya[i - 1]) {
        geko[i * q - 1] = 1;
      } else {
        break;
      }
    }
    for (int q = 2; i * q < s.length(); ++q) {
      if (oks(s.length() - i, i) == oks(s.length() - i * q, i)) {
        geko[s.length() - i * q - 1] = 1;
      } else {
        break;
      }
    }
  }
  for (int i = 0; i < s.length(); ++i) {
    if (geko[i] == 1) {
      ans--;
    }
  }
  cout << "2" << endl;
  cout << ans << endl;
}

Fixed submission:
/*

This Submission is to determine how many 120/240 min const. delivery point there
are.

//info
120 req. steps <= 5
*/
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define MOD 998244353LL
#define seg_size 262144
#define REP(a, b) for (long long a = 0; a < b; ++a)

unsigned long xor128() {
  static unsigned long x = time(NULL), y = 362436069, z = 521288629,
                       w = 88675123;
  unsigned long t = (x ^ (x << 11));
  x = y;
  y = z;
  z = w;
  return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a, complex<double> b) {
  return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
  return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
  return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
  double cosine = dot(a, b) / (leng(a) * leng(b));
  double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
  double kaku = acos(min((double)1.0, max((double)-1.0, cosine)));
  if (sine <= 0) {
    kaku = 2 * Ma_PI - kaku;
  }
  return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
  vector<int> ans;
  double now_minnest = a[0].real();
  int now_itr = 0;
  REP(i, a.size()) {
    if (now_minnest > a[i].real()) {
      now_minnest = a[i].real();
      now_itr = i;
    }
  }
  ans.push_back(now_itr);
  complex<double> ba(0, 1);
  while (true) {
    int now_go = 0;
    double now_min = 0;
    double now_length = 0;
    int starter = ans[ans.size() - 1];
    for (int i = 0; i < a.size(); ++i) {
      if (i != starter) {
        double goa = angles(ba, a[i] - a[starter]);
        if (goa - now_min >= eps ||
            (abs(goa - now_min) <= eps &&
             (abs(a[i] - a[starter]) - now_length) >= eps)) {
          now_min = goa;
          now_go = i;
          now_length = abs(a[i] - a[starter]);
        }
      }
    }
    if (now_go == ans[0])
      break;
    ans.push_back(now_go);
    ba = complex<double>(a[now_go] - a[starter]);
  }
  return ans;
}
long long geko[1000000] = {};
pair<long long, long long> nya[1000000];
long long powing(long long A, long long B, long long C) {
  long long ans = 1;
  while (B != 0) {
    if (B % 2 == 1) {
      ans *= A;
      ans %= C;
    }
    A *= A;
    A %= C;
    B /= 2;
  }
  return ans;
}
pair<long long, long long> oks(long long start, long long len) {
  pair<long long, long long> first_set = nya[start + len - 1]; // finite
  if (start != 0) {
    pair<long long, long long> geko = nya[start - 1];
    geko.first *= powing(26, len, MAX_MOD);
    geko.second *= powing(26, len, MOD);
    geko.first %= MAX_MOD;
    geko.second %= MOD;
    first_set =
        make_pair(first_set.first - geko.first, first_set.second - geko.second);
    first_set.first = (first_set.first + MAX_MOD) % MAX_MOD;
    first_set.second = (first_set.second + MOD) % MOD;
  }
  return first_set;
}
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int ok = 1;
  for (int i = 1; i < s.length(); ++i) {
    if (s[i] != s[i - 1]) {
      ok = 0;
    }
  }
  if (ok == 1) {
    cout << s.length() << endl;
    cout << 1 << endl;
    return 0;
  }
  ok = 1;
  for (int i = 2; i < s.length(); ++i) {
    if (s.length() % i == 0) {
      int tmp = 0;
      for (int q = 0; q < s.length(); ++q) {
        if (s[q % i] != s[q]) {
          tmp = 1;
          break;
        }
      }
      if (tmp == 0) {
        ok = 0;
        break;
      }
    }
  }
  if (ok == 1) {
    cout << 1 << endl;
    cout << 1 << endl;
    return 0;
  }
  long long ans = s.length() - 1;
  pair<long long, long long> now = make_pair(0, 0);
  for (int i = 0; i < s.length(); ++i) {
    now.first *= 26;
    now.second *= 26;
    now.first += s[i] - 'a';
    now.second += s[i] - 'a';
    now.first %= MAX_MOD;
    now.second %= MOD;
    nya[i] = now;
  }
  for (int i = 1; i < s.length(); ++i) {
    for (int q = 2; i * q < s.length(); ++q) {
      if (oks(i * (q - 1), i) == nya[i - 1]) {
        geko[i * q - 1] = 1;
      } else {
        break;
      }
    }
    for (int q = 2; i * q < s.length(); ++q) {
      if (oks(s.length() - i, i) == oks(s.length() - i * q, i)) {
        geko[s.length() - i * q - 1] = 1;
      } else {
        break;
      }
    }
  }
  for (int i = 0; i < s.length(); ++i) {
    if (geko[i] == 1) {
      ans--;
    }
  }
  cout << "2" << endl;
  cout << ans << endl;
}