#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n,A,B; cin >> n >> A >> B;
vector<pair<int,int>> a(n);
for (int i = 0; i < n; i++)
{
int l,r; cin >> l >> r;
a[i]={l,r};
}
int s=(a[0].second-a[0].first)+1;
int lc=lcm(A,(B+1)%A);
if(lc==0){
cout << min(s,B) << "\n";
}else {
int step=A;
step/=__gcd(A,(B+1)%A);
if(s/B<step){
cout << s << "\n";
}else{
step=step*B;
cout << min(s,(step)) << "\n";
}
}
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... |