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;
typedef long long ll;
typedef pair<ll, ll> pll;
ll n, a, b, l, r;
set<pll> st;
// vector<pll> tset;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> a >> b;
while(n--)
{
cin >> l >> r;
for (ll i = l; i <= r; ++i)
{
pll hasil = {(i + (i/b)) % a, i % b};
st.insert(hasil);
// tset.push_back(hasil);
}
}
// cout << "---\n";
// for (int i = 0; i < tset.size(); ++i)
// {
// cout << tset[i].first << " " << tset[i].second << "\n";
// }
// cout << "\n";
cout << st.size() << "\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... |