oj.uz

답안 #654978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654978 2022-11-02T10:10:23 Z ShirAriel 나머지들의 합 (NOI12_modsum) C++17
25 / 25
 58 ms 360 KB 
//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.0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 4 ms 212 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 19 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 58 ms 360 KB Output is correct