Don't use bits/stdc++.h

dynamic_programming/Cut Rod.cpp

@@ -3,7 +3,7 @@ contains prices of all pieces of size smaller than n. Determine
 the maximum value obtainable by cutting up the rod and selling 
 the pieces.*/
 
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
 int cutrod(int p[], int n)
 {

dynamic_programming/Fibonacci_Bottom_Up.cpp

@@ -1,4 +1,4 @@
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
 int fib(int n)
 {

dynamic_programming/Fibonacci_Top_Down.cpp

@@ -1,4 +1,4 @@
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
 int arr[1000000];
 int fib(int n)

dynamic_programming/Longest Increasing Subsequence (nlogn).cpp

@@ -2,7 +2,7 @@
 // in O(n log n)
 // tested on : https://cses.fi/problemset/task/1145/
 
-#include <bits/stdc++.h>
+#include <iostream>
 
 using namespace std;
 int LIS(int arr[], int n)

dynamic_programming/longest_common_string.cpp

@@ -1,4 +1,4 @@
-#include<bits/stdc++.h>
+#include <iosrteam>
 using namespace std;
 
 int max(int a,int b)