#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
long long A, B;
cin >> n >> A >> B;
int ans = 0;
vector<vector<long>> arr_ans;
for (int i = 0; i < n; i++) {
long long l, r;
cin >> l >> r;
for (long long j = l; j <= r; j++) {
long y = j % B;
long x = (j + j/B) % A;
vector<long> tmp = {x, y};
if (find(arr_ans.begin(), arr_ans.end(), tmp) == arr_ans.end()) {
ans++;
arr_ans.push_back(tmp);
}
}
}
cout << ans;
return 0;
}
# | 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... |