Update Template.cpp

Author: SamZhangQingChuan

Template.cpp

@@ -20,8 +20,6 @@
 #define UB upper_bound
 #define fr(x) freopen(x,"r",stdin)
 #define fw(x) freopen(x,"w",stdout)
-#define iout(x) printf("%d\n",x)
-#define lout(x) printf("%lld\n",x)
 #define REP(x, l, u) for(ll x = l;x<u;x++)
 #define RREP(x, l, u) for(ll x = l;x>=u;x--)
 #define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
@@ -45,22 +43,11 @@ typedef double db;
 typedef long double ld;
 using namespace __gnu_pbds; //required
 using namespace std;
-template<typename T> using ordered_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
+template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 typedef vector<ll> VLL;
 typedef vector<int> VI;
-const int block_size = 320;
-typedef complex<ll> point;
 const ll mod = 1e9 + 7;
-const ll inf = 1e9 + 7;
-const ld eps = 1e-9;
-const db PI = atan(1) * 4;
 
-template<typename T>
-inline int sign(const T &a) {
-    if(a < 0)return -1;
-    if(a > 0)return 1;
-    return 0;
-}
 
 string to_string(string s) { return '"' + s + '"'; }
 
@@ -104,21 +91,6 @@ inline bool upmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }
 template<typename T, typename S>
 inline bool upmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }
 
-template<typename T>
-inline void in(T &x) {
-    x = 0;
-    T f = 1;
-    char ch = getchar();
-    while(!isdigit(ch)) {
-        if(ch == '-') f = -1;
-        ch = getchar();
-    }
-    while(isdigit(ch)) {
-        x = x * 10 + ch - '0';
-        ch = getchar();
-    }
-    x *= f;
-}
 
 ull twop(ll x) { return 1ULL << x; }
 
@@ -134,27 +106,6 @@ ll inverse(ll a, ll m) {
     return MOD((1 - inverse(m, a) * m) / a, m);
 }
 
-template<typename A, typename B>
-inline void in(A &x, B &y) {
-    in(x);
-    in(y);
-}
-
-template<typename A, typename B, typename C>
-inline void in(A &x, B &y, C &z) {
-    in(x);
-    in(y);
-    in(z);
-}
-
-template<typename A, typename B, typename C, typename D>
-inline void in(A &x, B &y, C &z, D &d) {
-    in(x);
-    in(y);
-    in(z);
-    in(d);
-}
-
 template<typename T>
 T sqr(T x) { return x * x; }
 
@@ -170,13 +121,9 @@ ll fast(ll a, ll b, ll mod) {
     if(b < 0)a = inverse(a, mod), b = -b;
     ll ans = 1;
     while(b) {
-        if(b & 1) {
-            b--;
-            ans = ans * a % mod;
-        } else {
-            a = a * a % mod;
-            b /= 2;
-        }
+        if(b & 1)ans = ans * a % mod;
+        a = a * a % mod;
+        b /= 2;
     }
     return ans % mod;
 }
@@ -199,7 +146,7 @@ signed main() {
     int t = 1;
 //    in(t);
     for(int i = 1; i <= t; i++) {
-//        cout<<"Case #"<<i<<":";
+//        cout<<"Case #"<<i<<": ";
         SOLVE::main();
 
     }