diff --git a/Dynamic Programming/Longest Common Subsequence.cpp b/Dynamic Programming/Longest Common Subsequence.cpp
index 04800f223..07a4730a6 100644
--- a/Dynamic Programming/Longest Common Subsequence.cpp	
+++ b/Dynamic Programming/Longest Common Subsequence.cpp	
@@ -18,10 +18,10 @@ int lcs(string a, string b){
 	}
 	return res[m][n];
 }
-int main(int argc, char const *argv[])
+int main()
 {
 	string a,b;
 	cin>>a>>b;
 	cout<<lcs(a,b);
 	return 0;
-}
\ No newline at end of file
+}
diff --git a/Dynamic Programming/Longest Common Subsequence.exe b/Dynamic Programming/Longest Common Subsequence.exe
new file mode 100644
index 000000000..b08e32d09
Binary files /dev/null and b/Dynamic Programming/Longest Common Subsequence.exe differ
diff --git a/Greedy Algorithms/Knapsack.cpp b/Greedy Algorithms/Knapsack.cpp
index 661e5774a..41ce4cc9b 100644
--- a/Greedy Algorithms/Knapsack.cpp	
+++ b/Greedy Algorithms/Knapsack.cpp	
@@ -10,7 +10,6 @@ struct Item
 
 float profitPerUnit(Item x)
 {
-//	cout<<(float)x.profit/(float)x.weight<<"\n";
 	return (float)x.profit/(float)x.weight;
 }
 
@@ -53,13 +52,6 @@ void quickSort(Item arr[], int low, int high)
 
 
 
-// void show(Item arr[], int size)
-// {
-//     for (int i=0; i < size; i++)
-//     cout<<arr[i].weight<<"\t"<<arr[i].profit<<"\n";
-// }
-
-
 int main()
 {
 	cout<<"\nEnter the capacity of the knapsack : ";
diff --git a/Greedy Algorithms/Knapsack.exe b/Greedy Algorithms/Knapsack.exe
new file mode 100644
index 000000000..5789ed978
Binary files /dev/null and b/Greedy Algorithms/Knapsack.exe differ