Coinage

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;
}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Uncategorized and tagged , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s