Submission #559539

#	Time	Username	Problem	Language	Result	Execution time	Memory
559539		Garguy22	Modsum (NOI12_modsum)	C++17	5 / 25	91 ms	340 KiB

modsum

#include <iostream>
using namespace std;

typedef long long ll;
const int MAXN = 1007;

ll n, ans = 0;
ll a[MAXN], b[MAXN];

void rec(ll ind, int temp){
	if(ind == n) 
		ans += (temp*temp*temp*temp + 2*temp*temp) % 5 + 1;
	for(ll i = a[ind]; i <= b[ind]; i++)
		rec(ind+1, temp+i);
}

int main()
{
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> a[i] >> b[i];
	rec(0, 0);
	cout << ans << endl;
}

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