Submission #1184093

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184093		peteza	Modsum (NOI12_modsum)	C++20	25 / 25	1 ms	332 KiB

modsum

#include <bits/stdc++.h>
using namespace std;

int n, a, b;
vector<pair<int, int>> vec;
int ans = 0;

void rec(int cn, int x) {
    if(cn == n) {
        ans += (x*x*x*x+2*x*x)%5+1;
        return ;
    }
    for(int i=vec[cn].first; i<=vec[cn].second;i++) {
        rec(cn+1, (x+i)%5);
    }
}

int main() {
    cin >> n;
    vec.resize(n);
    for(auto &e:vec) cin >> e.first >> e.second;
    sort(vec.begin(), vec.end(), [](pair<int, int> a, pair<int, int> b){
        if(a.second - a.first == b.second - b.first) return a.first < b.first;
        return a.second - a.first < b.second - b.first;        
    });
    rec(0, 0);
    cout << ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5