Don't use bits/stdc++.h

backtracking/knight_tour.cpp

@@ -1,4 +1,4 @@
-#include<bits/stdc++.h>
+#include <iostream>
 # define n 8
 
 /**

computer_oriented_statistical_methods/Gaussian_elimination.cpp

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

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)

graph/BFS.cpp

@@ -1,4 +1,4 @@
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
 class graph
 {

graph/DFS.cpp

@@ -1,4 +1,4 @@
-#include <bits/stdc++.h>
+#include <iostream>
 using namespace std;
 int v = 4;
 void DFSUtil_(int graph[4][4], bool visited[], int s)

graph/Kruskal.cpp

@@ -1,4 +1,4 @@
-#include "bits/stdc++.h"
+#include <iostream>
 //#include <boost/multiprecision/cpp_int.hpp>
 //using namespace boost::multiprecision;
 const int mx = 1e6 + 5;

graph/lca.cpp

@@ -1,4 +1,5 @@
-#include<bits/stdc++.h>
+//#include<bits/stdc++.h>
+#include <iostream>
 
 using namespace std;
 // Find the lowest common ancestor using binary lifting in O(nlogn)

others/matrix_exponentiation.cpp

@@ -18,7 +18,7 @@ Steps for Matrix Expo
 The first element of this matrix is the required result.
 */
 
-#include <bits/stdc++.h>
+#include <iostream>
 using std::cin;
 using std::cout;
 using std::vector;

range_queries/MO.cpp

@@ -1,4 +1,4 @@
-#include "bits/stdc++.h"
+#include <iostream>
 using namespace std;
 const int N = 1e6 + 5;
 int a[N], bucket[N], cnt[N];

range_queries/bit.cpp

@@ -1,5 +1,5 @@
 // Binary Indexed Tree.
-#include<bits/stdc++.h>
+#include <iostream>
 
 using namespace std;
 

range_queries/segTree.cpp

@@ -1,4 +1,5 @@
-#include <bits/stdc++.h>
+//#include <bits/stdc++.h>
+#incldue <iostream>
 #define MAX 4000000
 using namespace std;
 typedef long long ll;

sorting/Tim Sort.cpp

@@ -1,5 +1,5 @@
 // C++ program to perform TimSort.
-#include<bits/stdc++.h>
+#include <iostream>
 using namespace std;
 const int RUN = 32;