Submission #654473

#	Time	Username	Problem	Language	Result	Execution time	Memory
654473		Carmel_Ab1	Modsum (NOI12_modsum)	C++17	25 / 25	54 ms	340 KiB

modsum

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;

ll ans = 0;
ll n;

void calc(int ind, vector<ll>& v, vector<ll>& w, 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, v, w, sum + i);
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin >> n;

	vector<ll> v(n), w(n);
	for (ll i = 0; i < n; i++)
		cin >> v[i] >> w[i];

	calc(0, v, w, 0);

	cout << ans;

}

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