From 3856aca9488d750530e942ea1bfbc855d2220009 Mon Sep 17 00:00:00 2001
From: Srijanak De <54339186+srijanakde2001@users.noreply.github.com>
Date: Mon, 30 Dec 2019 21:24:12 +0530
Subject: [PATCH 1/5] Solved subset problem

close #195
---
 smsubset.cpp | 71 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 71 insertions(+)
 create mode 100644 smsubset.cpp

diff --git a/smsubset.cpp b/smsubset.cpp
new file mode 100644
index 0000000..360c321
--- /dev/null
+++ b/smsubset.cpp
@@ -0,0 +1,71 @@
+#include <iostream>
+using namespace std;
+ 
+ 
+int g=21,garr[20];
+ 
+void subarray(int *arr, int n, int x, int ans[], int m)
+{	
+	if(x==0 && n>=-1)
+	{
+	   if(m<=g)
+	   {
+	      g = m;
+	     for(int j=0;j<g;j++)
+	       garr[j] = ans[j];
+	      
+	   }
+	   return;
+	}
+	
+	if(n<0)
+	   return;   
+	
+	subarray(arr,n-1,x,ans,m);
+	ans[m] = arr[n];
+	subarray(arr,n-1,x-arr[n],ans,m+1);
+	
+	return;
+}
+ 
+ 
+int main()
+{
+	int n,x,i,j=0,arr[20],ans[20],m=0,narr[20];
+	
+	cin>>n>>x;
+	
+	for(i=n-1;i>=0;i--)
+	{
+		cin>>arr[i];
+		narr[n-1-i] = arr[i];
+	}
+	
+	subarray(arr,n-1,x,ans,m);
+	
+	if(g==21)
+	  cout<<"-1";
+	
+	else
+	{
+	  for(i=0;i<n;i++)
+	  {	  
+	    
+	    if(narr[i]==garr[j])
+	    {
+	     if(j==0)	
+		  cout<<i+1<<" ";
+		 else
+		  cout<<i+1<<" ";
+		 j++;	
+        }
+        
+        if(j>=g)
+          break;
+	  	  
+	  }
+    }  
+ 
+   return 0;	
+ 
+}

From 7e256467104e769664adae26926959a44f62c2d9 Mon Sep 17 00:00:00 2001
From: Srijanak De <54339186+srijanakde2001@users.noreply.github.com>
Date: Wed, 1 Jan 2020 18:38:58 +0530
Subject: [PATCH 2/5] Update smsubset.cpp

See if more changes are to be made.
---
 smsubset.cpp | 101 +++++++++++++++++++--------------------------------
 1 file changed, 37 insertions(+), 64 deletions(-)

diff --git a/smsubset.cpp b/smsubset.cpp
index 360c321..80f5877 100644
--- a/smsubset.cpp
+++ b/smsubset.cpp
@@ -1,71 +1,44 @@
 #include <iostream>
 using namespace std;
- 
- 
 int g=21,garr[20];
- 
 void subarray(int *arr, int n, int x, int ans[], int m)
-{	
-	if(x==0 && n>=-1)
-	{
-	   if(m<=g)
-	   {
-	      g = m;
-	     for(int j=0;j<g;j++)
-	       garr[j] = ans[j];
-	      
-	   }
-	   return;
-	}
-	
-	if(n<0)
-	   return;   
-	
-	subarray(arr,n-1,x,ans,m);
-	ans[m] = arr[n];
-	subarray(arr,n-1,x-arr[n],ans,m+1);
-	
-	return;
+{if(x==0 && n>=-1)
+  {if(m<=g)
+     {g = m;
+      for(int j=0;j<g;j++)
+	garr[j] = ans[j];
+     }
+    return;
+  }
+ if(n<0)
+  return;   
+ subarray(arr,n-1,x,ans,m);
+ ans[m] = arr[n];
+ subarray(arr,n-1,x-arr[n],ans,m+1);
+ return;
 }
- 
- 
 int main()
-{
-	int n,x,i,j=0,arr[20],ans[20],m=0,narr[20];
-	
-	cin>>n>>x;
-	
-	for(i=n-1;i>=0;i--)
-	{
-		cin>>arr[i];
-		narr[n-1-i] = arr[i];
-	}
-	
-	subarray(arr,n-1,x,ans,m);
-	
-	if(g==21)
-	  cout<<"-1";
-	
-	else
-	{
-	  for(i=0;i<n;i++)
-	  {	  
-	    
-	    if(narr[i]==garr[j])
-	    {
-	     if(j==0)	
-		  cout<<i+1<<" ";
-		 else
-		  cout<<i+1<<" ";
-		 j++;	
+{int n,x,i,j=0,arr[20],ans[20],m=0,narr[20];
+ cin>>n>>x;
+ for(i=n-1;i>=0;i--)
+  {cin>>arr[i];
+   narr[n-1-i] = arr[i];
+  }
+ subarray(arr,n-1,x,ans,m);
+ if(g==21)
+  cout<<"-1";
+ else
+  {for(i=0;i<n;i++)
+     {if(narr[i]==garr[j])
+	{if(j==0)	
+	   cout<<i+1<<" ";
+	 else
+           cout<<i+1<<" ";
+	 j++;	
         }
-        
-        if(j>=g)
-          break;
-	  	  
-	  }
-    }  
- 
-   return 0;	
- 
-}
+      if(j>=g)
+       break;
+     }
+  }  
+ return 0;	
+ }

From 443ed1233e12e48d1b2389f4299ed2fe6be51c49 Mon Sep 17 00:00:00 2001
From: Srijanak De <54339186+srijanakde2001@users.noreply.github.com>
Date: Thu, 2 Jan 2020 22:26:49 +0530
Subject: [PATCH 3/5] Updated again smsubset.cpp

---
 smsubset.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/smsubset.cpp b/smsubset.cpp
index 80f5877..f4dfd41 100644
--- a/smsubset.cpp
+++ b/smsubset.cpp
@@ -30,11 +30,11 @@ int main()
  else
   {for(i=0;i<n;i++)
      {if(narr[i]==garr[j])
-	{if(j==0)	
-	   cout<<i+1<<" ";
-	 else
+	    {if(j==0)	
+	      cout<<i+1<<" ";
+	     else
            cout<<i+1<<" ";
-	 j++;	
+	     j++;	
         }
       if(j>=g)
        break;

From dee4a2884e287021ee68e2798b21ddfc4d6de50e Mon Sep 17 00:00:00 2001
From: Srijanak De <54339186+srijanakde2001@users.noreply.github.com>
Date: Thu, 2 Jan 2020 22:38:21 +0530
Subject: [PATCH 4/5] Update 3

---
 smsubset.cpp | 28 ++++++++++++++++++----------
 1 file changed, 18 insertions(+), 10 deletions(-)

diff --git a/smsubset.cpp b/smsubset.cpp
index f4dfd41..4a7ba3b 100644
--- a/smsubset.cpp
+++ b/smsubset.cpp
@@ -2,11 +2,14 @@
 using namespace std;
 int g=21,garr[20];
 void subarray(int *arr, int n, int x, int ans[], int m)
-{if(x==0 && n>=-1)
-  {if(m<=g)
-     {g = m;
+{
+ if(x==0 && n>=-1)
+  {
+    if(m<=g)
+     {
+	  g = m;
       for(int j=0;j<g;j++)
-	garr[j] = ans[j];
+	    garr[j] = ans[j];
      }
     return;
   }
@@ -18,19 +21,24 @@ void subarray(int *arr, int n, int x, int ans[], int m)
  return;
 }
 int main()
-{int n,x,i,j=0,arr[20],ans[20],m=0,narr[20];
+{
+ int n,x,i,j=0,arr[20],ans[20],m=0,narr[20];
  cin>>n>>x;
  for(i=n-1;i>=0;i--)
-  {cin>>arr[i];
+  {
+   cin>>arr[i];
    narr[n-1-i] = arr[i];
   }
  subarray(arr,n-1,x,ans,m);
  if(g==21)
   cout<<"-1";
  else
-  {for(i=0;i<n;i++)
-     {if(narr[i]==garr[j])
-	    {if(j==0)	
+  {
+   for(i=0;i<n;i++)
+     {
+	  if(narr[i]==garr[j])
+	    {
+		 if(j==0)	
 	      cout<<i+1<<" ";
 	     else
            cout<<i+1<<" ";
@@ -41,4 +49,4 @@ int main()
      }
   }  
  return 0;	
- }
+}

From 6f2ed10a304e10d0e9b6b5420230193e39cdad73 Mon Sep 17 00:00:00 2001
From: Srijanak De <54339186+srijanakde2001@users.noreply.github.com>
Date: Tue, 14 Jan 2020 18:37:23 +0530
Subject: [PATCH 5/5] Update smsubset.cpp

---
 smsubset.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/smsubset.cpp b/smsubset.cpp
index 4a7ba3b..330fea9 100644
--- a/smsubset.cpp
+++ b/smsubset.cpp
@@ -45,7 +45,7 @@ int main()
 	     j++;	
         }
       if(j>=g)
-       break;
+        break;
      }
   }  
  return 0;