| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 654975 | ShirAriel | Modsum (NOI12_modsum) | C++17 | 5049 ms | 340 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
