1 files changed, 12 insertions, 20 deletions
diff --git a/codeforces/SerejaAndSuffixes/main.cpp b/codeforces/SerejaAndSuffixes/main.cpp
index c14fd91..fb52f0c 100755
--- a/codeforces/SerejaAndSuffixes/main.cpp
+++ b/codeforces/SerejaAndSuffixes/main.cpp
@@ -1,4 +1,4 @@
-#include<bits/stdc++.h>
+#include <bits/stdc++.h>
 using namespace std;
 
 using ll = long long;
@@ -10,7 +10,7 @@ using mpii = map<int, int>;
 using mpll = map<ll, ll>;
 using db = long double;
 
-#define pb push_back 
+#define pb push_back
 #define all(x) (x).begin(), (x).end()
 #define rall(x) (x).rbegin(), (x).rend()
 #define lb lower_bound
@@ -21,17 +21,15 @@ const db PI = acos((db)-1);
 const int dx[4]{1, 0, -1, 0};
 const int dy[4]{0, 1, 0, -1};
 
-//pretty printing
-template<typename K, typename V>
-void printm(const map<K, V> &mp) {
+// pretty printing
+template <typename K, typename V> void printm(const map<K, V> &mp) {
   cerr << "{" << endl;
   for (auto p : mp) {
     cerr << "  { " << p.first << " : " << p.second << " }\n";
   }
   cerr << "}" << endl;
 }
-template<typename T>
-void printv(const vector<T> &v) {
+template <typename T> void printv(const vector<T> &v) {
   cerr << "[";
   for (int i = 0; i < v.size(); i++) {
     if (i == v.size() - 1) {
@@ -43,8 +41,7 @@ void printv(const vector<T> &v) {
   cerr << "]\n";
 }
 
-template<typename T>
-void printvv(const vector<vector<T>> &v) {
+template <typename T> void printvv(const vector<vector<T>> &v) {
   cerr << "[\n";
   for (auto &vec : v) {
     cout << "  ";
@@ -52,17 +49,13 @@ void printvv(const vector<vector<T>> &v) {
   }
   cerr << "]\n";
 }
-void print() {
-  cerr << "\n";
-}
+void print() { cerr << "\n"; }
 
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
+template <typename T, typename... TS> void print(T val, TS... vals) {
   cerr << val << " ";
   print(vals...);
 }
 
-
 /* stuff you should look for:
   ---------------------------
    * special cases (n=1?)
@@ -81,8 +74,9 @@ void solve() {
   for (auto &x : v) {
     cin >> x;
     st.insert(x);
-  } 
-  for (auto &x : q) cin >> x;
+  }
+  for (auto &x : q)
+    cin >> x;
   vi fq(1e5 + 5);
   vi dp(n);
   dp[0] = st.size();
@@ -98,10 +92,8 @@ void solve() {
   }
 }
 
-int main () {
+int main() {
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);
   solve();
 }
-
-