Submission #654978

#	Time	Username	Problem	Language	Result	Execution time	Memory
654978		ShirAriel	Modsum (NOI12_modsum)	C++17	25 / 25	58 ms	360 KiB

modsum

//every operation is adding at least one. we kmow that the answer is less than 1e6 so we can do brutforce.

#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[ind]; i <= w[ind]; 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;
}

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