This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int gcd(int a, int b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(a, b%a);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
int x[n], y[n], gx = 0, gy = 0;
for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
for(int i = 1; i < n; i++) {
gx = gcd(abs(x[i]-x[i-1]), gx);
gy = gcd(abs(y[i]-y[i-1]), gy);
}
if(gx*gy == 0) cout << -1;
else cout << gx*gy;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |