From f8976e1df02a022627c60840d01b29a3bfc7fbaa Mon Sep 17 00:00:00 2001
From: ShazidMahsrafi <shazid456@gmail.com>
Date: Tue, 26 Dec 2023 16:26:56 +0600
Subject: [PATCH] update

---
 Template/CPTemp.cpp | 32 +++++---------------------------
 1 file changed, 5 insertions(+), 27 deletions(-)

diff --git a/Template/CPTemp.cpp b/Template/CPTemp.cpp
index f944e0c..81ea04b 100644
--- a/Template/CPTemp.cpp
+++ b/Template/CPTemp.cpp
@@ -1,7 +1,7 @@
 #include<bits/stdc++.h>
 using namespace std;
 
-// Short forms
+#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
 #define int                 long long
 #define ll                  long long
 #define ull                 unsigned long long
@@ -11,32 +11,11 @@ using namespace std;
 #define pb                  push_back
 #define all(x)              x.begin(), x.end()
 #define sz(x)               (int)(x).size()
-
-// Outputs
 #define yes                 cout<<"YES"<<endl
 #define no                  cout<<"NO"<<endl
+#define MOD                 1000000007
+ull pow(ull x, ull n)       {ull ans=1; x%=MOD; while(n) {if(n&1) ans=(ans*x)%MOD; x=(x*x)%MOD; n>>=1;} return ans;}
 
-// Constants
-#define PI                  3.141592653589793238
-#define MIN                 INT_MIN
-#define MAX                 INT_MAX
-#define INF                 LONG_LONG_MAX
-#define M                   1000000007
-#define LLM                 1000000000000000007
-
-// Faster Input Output
-#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-// Maths
-ll fact(ll n)                   { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
-ll nPr(ll n, ll r)              { return fact(n) / fact(n - r); }
-ll nCr(ll n, ll r)              { return fact(n) / (fact(r) * fact(n - r)); }
-ll gcd(ll a, ll b)              { if (b == 0) return a; return gcd(b, a % b); }
-ll lcm(ll a, ll b)              { return (a * b) / gcd(a, b);}
-ull mypow(ull a, ull b)         { ull ans = 1; a%=M; while(b){ if (b&1) ans = (ans*a) % M; a = (a*a) % M; b >>= 1; } return ans; }
-bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
-
-//Debugging
 #ifndef ONLINE_JUDGE
 #define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
 #define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
@@ -44,7 +23,6 @@ bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i <= sq
 #define dbg(x)
 #define dbgin(x)
 #endif
- 
 void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
 void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
 template <class T, class V> void _print(pair <T, V> p);
@@ -58,7 +36,6 @@ template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_
 template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
 template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
 template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
-
 /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 void solve()
@@ -71,5 +48,6 @@ int32_t main()
     FAST_IO;
     int TC = 1;
     //cin >> TC;
-    while (TC--) solve();
+    while (TC--) 
+        solve();
 }
\ No newline at end of file