mirror of https://github.com/TheAlgorithms/C
improved the code
This commit is contained in:
parent
a2706e5463
commit
61c02122c4
Binary file not shown.
|
@ -4,20 +4,38 @@
|
||||||
|
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
|
||||||
int ways(int n, int a[], int k) {
|
int ways(int n, int a[], int k)
|
||||||
|
{
|
||||||
if(n<0 || k<0) return 0;
|
if(n<0 || k<0) return 0;
|
||||||
if(n == 0) return 1;
|
if(n == 0) return 1;
|
||||||
if(k == 0) return 0;
|
if(k == 0) return 0;
|
||||||
return ways(n, a, k-1) + ways(n-a[k-1], a, k);
|
return ways(n, a, k-1) + ways(n-a[k-1], a, k);
|
||||||
}
|
}
|
||||||
|
|
||||||
int main() {
|
int main()
|
||||||
int m; scanf("%d", &m);
|
{
|
||||||
int coin[m], i; for(i=0; i<m; i++) scanf("%d", &coin[i]);
|
int m;
|
||||||
|
int t;
|
||||||
|
int n;
|
||||||
|
|
||||||
int t; scanf("%d", &t);
|
printf("Number of coins? ");
|
||||||
while(t--) {
|
scanf("%d", &m);
|
||||||
int n; scanf("%d", &n);
|
int coin[m], i;
|
||||||
|
for(i=0; i<m; i++)
|
||||||
|
{
|
||||||
|
printf("coin? ");
|
||||||
|
scanf("%d", &coin[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
printf("---- your requests --- \n");
|
||||||
|
while(1)
|
||||||
|
{
|
||||||
|
printf("amount? exit(0) ");
|
||||||
|
scanf("%d", &n);
|
||||||
|
if (!n)
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
printf("%d\n", ways(n, coin, m));
|
printf("%d\n", ways(n, coin, m));
|
||||||
}
|
}
|
||||||
return 0;
|
return 0;
|
||||||
|
|
Binary file not shown.
Loading…
Reference in New Issue