Submission #333485

#	Time	Username	Problem	Language	Result	Execution time	Memory
333485		ncduy0303	Modsum (NOI12_modsum)	C++17	25 / 25	53 ms	380 KiB

modsum

#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 1e3 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

int n, ans;
ar<int,2> a[MAX_N];

void f(int pos, int sum) {
    if (pos == n) {
        ans += ((ll)sum*sum*sum*sum + 2 * (ll)sum*sum) % 5 + 1;
        return;
    }
    for (int i = a[pos][0]; i <= a[pos][1]; i++) f(pos + 1, sum + i);
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
    f(0, 0);
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

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