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
int n;int A;int B;
int ar[1000006];int br[1000006];
signed main(){
cin>>n>>A>>B;
set<pair<int,int>>st;
for(int i=1;i<=n;i++){
cin>>ar[i]>>br[i];
}
for(int i=1;i<=n;i++){
for(int t=ar[i];t<=br[i];t++){
st.insert({(t+t/B)%A,t%B } );
}
}
cout<<st.size()<<endl;
}
# | 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... |