Problem Link

#Solution – Idea :Editorial

#include <bits/stdc++.h>

using namespace std;

int f[1005];

int main(void) {

int t;

cin >> t;

while (t–) {

int a, b, c, d, A, B, C, D, N;

long long ans = 0;

cin >> N >> A >> B >> C >> D;

for (int i = 0; i <= N; i++)

f[i] = 0;

for (i = 0; i <= i; i++)

for (j = 0; j <= j && j + i * 2 <= N; j++)

f[j + i * 2]++;

for (i = 0; i <= i; i++)

for (j = 0; j <= j && i * 5 + j * 10 <= (N); j++)

ans += f[N – i * 5 – j * 10];

cout << ans << endl;

}

return 0;

}

### Like this:

Like Loading...