// A Naive recursive C program to find minimum of coins
// to make a given change V
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>


// m is size of coins array (number of different coins)
int minCoins(int coins[], int m, int V)
{
  // base case
  if (V == 0) return 0;

  // Initialize result
  int res = INT_MAX;

  // Try every coin that has smaller value than V
  for (int i=0; i<m; i++)
    {
      if (coins[i] <= V)
	{
	  int sub_res = minCoins(coins, m, V-coins[i]);
	  
	  // Check for INT_MAX to avoid overflow and see if
	  // result can minimized
	  if (sub_res != INT_MAX && sub_res + 1 < res)
	    res = sub_res + 1;
	}
    }
  return res;
}

// Driver program to test above function
int main(int argc, char ** argv)
{
  if (argc < 3){
    fprintf(stderr, "Usage: mcc value [coins]+\n");
    exit(1);
  }

  int V = atoi(argv[1]);
  int coins[argc-1];
  int m = argc-2;
  
  int tmp;
  for (int i =0; i < argc-2; i++){
    tmp = atoi(argv[i+2]);
    coins[i] = tmp;
  }

  //int coins[] = {9, 6, 5, 1};
  // int m = sizeof(coins)/sizeof(coins[0]);
  // int V = 11;
  printf("Minimum coins required is %d\n", minCoins(coins, m, V));
  return 0;
}