# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654975 | 2022-11-02T10:06:51 Z | ShirAriel | Modsum (NOI12_modsum) | C++17 | 5000 ms | 340 KB |
#include <iostream> #include <algorithm> #include <vector> using namespace std; typedef long long ll; vector<ll> v, w; ll ans = 0; ll n; void calc(ll ind, ll sum) { if (ind == n) { ans += (sum*sum*sum*sum + 2 * sum*sum) % 5 + 1; return; } for (ll i = v[i]; i <= w[i]; i++) calc(ind + 1, sum + i); } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; v.resize(n); w.resize(n); for (ll i = 0; i < n; i++) cin >> v[i] >> w[i]; calc(0, 0); cout << ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5033 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5049 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5043 ms | 340 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |