Submission #1235785

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235785		namplh	Modsum (NOI12_modsum)	C++20	25 / 25	130 ms	468 KiB

modsum

#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 1005;
int n, k = 0;
pair<int, int> a[N];

void btr(int i, int s) {
    if (i > n) {
        k += (s * s * s * s + 2 * s * s) % 5 + 1;
        //cout << s << ' ' << (s * s * s * s + 2 * s * s) % 5 + 1 << '\n';
        return;
    }
    for (int j = a[i].first; j <= a[i].second; j++) {
        btr(i + 1, (s + j)%5);
    }
}

signed main() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
    btr(1, 0);
    cout << k;
}

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