oj.uz

Submission #331694

# Submission time Handle Problem Language Result Execution time Memory
331694 2020-11-29T15:49:47 Z ncduy0303 Modsum (NOI12_modsum) C++17
5 / 25
 6 ms 384 KB 
#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, l[MAX_N], r[MAX_N];

int f(int idx, int sum) {
    if (idx == n) return (sum*sum*sum*sum + 2*sum*sum) % 5 + 1;
    int res = 0;
    for (int x = l[idx]; x <= r[idx]; x++) {
        res += f(idx + 1, sum + x);
    }
    return res;
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> l[i] >> r[i];
    cout << f(0, 0) << "\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; tc = 1;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -