Submission #1235823

#TimeUsernameProblemLanguageResultExecution timeMemory
1235823SkaModsum (NOI12_modsum)C++20
25 / 25
124 ms456 KiB
#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> f[1005];
int backtrack(int i, int sum){
    sum%=5;
    int ans=0;
    if(i==n){
        return ((sum*sum+2)*sum*sum)%5+1;
    }
    for(int j=f[i].first; j<=f[i].second; j++){
        ans+=backtrack(i+1, sum+j);
    }
    return ans;
}
int main(){
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>f[i].first>>f[i].second;
    }
    cout<<backtrack(0, 0);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...