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;
const int N = 1e6 + 5;
#define ll long long
set <pair <ll, ll>> s;
int main () {
ll A, B;
int n;
cin >> n >> A >> B;
for (int i = 1; i <= n; ++i) {
ll l, r;
cin >> l >> r;
for (ll j = l; j <= r; ++j) {
ll x = j + (j / B), y = j % B;
x %= A;
s.insert ({x, y});
}
}
cout << (int)s.size();
}
# | 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... |