indian coin change problem

Author: vanshikajha

Greedy/indian coin change problem.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+using namespace std;
+  
+
+int deno[] = { 1, 2, 5, 10, 20,
+               50, 100, 500, 1000 };
+int n = sizeof(deno) / sizeof(deno[0]);
+  
+void findMin(int V)
+{
+    sort(deno, deno + n);
+  
+    
+    vector<int> ans;
+  
+    
+    for (int i = n - 1; i >= 0; i--) {
+  
+        
+        while (V >= deno[i]) {
+            V -= deno[i];
+            ans.push_back(deno[i]);
+        }
+    }
+  
+    
+    for (int i = 0; i < ans.size(); i++)
+        cout << ans[i] << " ";
+}
+  
+
+int main()
+{
+    int n = 93;
+    cout << "Following is minimal"
+         << " number of change for " << n
+         << ": ";
+    findMin(n);
+    return 0;
+}