#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
ll A, B;
cin >> n >> A >> B;
ll L = A / __gcd(A, B + 1) * B;
vector<int> p(L);
while (n--) {
ll l, r;
cin >> l >> r;
if (L <= r - l + 1) return cout << L, 0;
p[l % L]++;
if (r % L != L - 1) p[r % L + 1]--;
if (r % L < l % L) p[0]++;
}
int cnt = !!p[0];
for (int i = 1; i < L; i++) {
p[i] += p[i - 1];
cnt += !!p[i];
}
cout << cnt;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |