oj.uz

Submission #654474

# Submission time Handle Problem Language Result Execution time Memory
654474 2022-10-31T12:21:08 Z Carmel_Ab1 Modsum (NOI12_modsum) C++17
25 / 25
 77 ms 340 KB 
#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)%5);
}

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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 332 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 23 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 77 ms 340 KB Output is correct