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 ll long long
using namespace std;
int main(){
ll n,a,b;cin>>n>>a>>b;
bool vis[b+5][10000]={0};
pair<long long,long long> arr[10000];
for(ll i=1;i<=n;i++){
cin>>arr[i].first>>arr[i].second;
}
ll ans=0;
for(ll j=1;j<=n;j++){
ll x,y;
x=arr[j].first;
y=arr[j].second;
for(ll i=x;i<=y;i++){
ll c=(i+i/b)%a;
ll d=i%b;
if(!vis[d][c]){
ans++;
vis[d][c]=true;
}
}
}
cout<<ans;
}
# | 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... |