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>
#define llong long long
using namespace std;
const int N = 2e5 + 3;
const int inf = 2e9 + 11;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, A, B;
cin >> n >> A >> B;
set < pair < int, int > > st;
for(int i = 1; i <= n; i++){
int l, r;
cin >> l >> r;
for(int t = l; t <= r; t++){
st.insert({(t + t / B) % A, t % B});
}
}
cout << st.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... |