Problem p03006 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v)                                                               \
  sort(ALL(v));                                                                \
  reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                                           \
  cerr << #v << ":";                                                           \
  for (int i = 0; i < v.size(); i++)                                           \
    cerr << " " << v[i];                                                       \
  cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
  cout << a << " ";
  pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
  cout << a << " ";
  pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
  cout << a << " ";
  pr(b, c, d);
}
template <class T> inline bool chmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int main(void) {
  ll N;
  cin >> N;
  vector<pll> xy(N);
  for (int i = 0; i < N; i++) {
    cin >> xy[i].fi >> xy[i].se;
  }
  if (N == 1)
    return 1;

  ll ans = INF;
  REP(i, N) {
    REP(j, N) {
      if (i == j)
        continue;
      ll p = xy[j].fi - xy[i].fi;
      ll q = xy[j].se - xy[i].se;

      ll tmp = 0;
      REP(i2, N) {
        REP(j2, N) {
          if (i2 == j2)
            continue;

          ll tp = xy[j2].fi - xy[i2].fi;
          ll tq = xy[j2].se - xy[i2].se;

          if (tp == p && tq == q)
            tmp++;
        }
      }
      ans = min(ans, N - tmp);
    }
  }

  pr(ans);
}

Fixed submission:
#include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v)                                                               \
  sort(ALL(v));                                                                \
  reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                                           \
  cerr << #v << ":";                                                           \
  for (int i = 0; i < v.size(); i++)                                           \
    cerr << " " << v[i];                                                       \
  cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
  cout << a << " ";
  pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
  cout << a << " ";
  pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
  cout << a << " ";
  pr(b, c, d);
}
template <class T> inline bool chmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int main(void) {
  ll N;
  cin >> N;
  vector<pll> xy(N);
  for (int i = 0; i < N; i++) {
    cin >> xy[i].fi >> xy[i].se;
  }
  if (N == 1) {
    pr(1);
    return 0;
  }

  ll ans = INF;
  REP(i, N) {
    REP(j, N) {
      if (i == j)
        continue;
      ll p = xy[j].fi - xy[i].fi;
      ll q = xy[j].se - xy[i].se;

      ll tmp = 0;
      REP(i2, N) {
        REP(j2, N) {
          if (i2 == j2)
            continue;

          ll tp = xy[j2].fi - xy[i2].fi;
          ll tq = xy[j2].se - xy[i2].se;

          if (tp == p && tq == q)
            tmp++;
        }
      }
      ans = min(ans, N - tmp);
    }
  }

  pr(ans);
}