#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back
const int maxn=1000;
int n,l[maxn],r[maxn],ans;
void f(int idx,int s=0){
if(idx==n)ans+=(s*s*s*s+2*s*s)%5+1;
else{
for(int i=l[idx];i<=r[idx];i++){
f(idx+1,(s+i)%5);
}
}
}
void solve() {
cin>>n;
for(int i=0;i<n;i++)cin>>l[i]>>r[i];
f(0);
cout<<ans<<'\n';
}
int main() {
#ifdef FPO
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
}
# | 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... |