updated vim-folding

Author: offamitkumar

Diff for: 4D.cpp

@@ -1,3 +1,5 @@
+// 4-Directional movement array X & Y /*{{{*/
 const int DSIZE = 4;
 array<int,4>X{-1,1,0,0};
 array<int,4>Y{0,0,-1,1};
+/*}}}*/

Diff for: 8D.cpp

@@ -1,3 +1,7 @@
+// 8-Directional Movement /*{{{*/
+
 const int DSIZE = 8;
 array<int,8>X{-1,-1,-1,0,0 ,1,1,1};
 array<int,8>Y{-1, 0, 1,1,-1,1,-1,0};
+
+/*}}}*/

Diff for: __int128_input_output.cpp

@@ -1,5 +1,8 @@
+// __int128 input /*{{{*/
 using LInt = __int128;
+
 // logic copied from stackoverflow , I just overloaded the operators 
+
 ostream& operator<<(ostream&cout , LInt number){
     auto toString = [](LInt num){
         auto tenPow18 = 1000000000000000000;
@@ -16,6 +19,7 @@ ostream& operator<<(ostream&cout , LInt number){
     cout << toString(number);
     return cout;
 }
+
 istream& operator>>(istream&cin , LInt &number){
     string s; cin >> s; 
     number = 0;
@@ -33,3 +37,5 @@ istream& operator>>(istream&cin , LInt &number){
     }
     return cin;
 }
+
+/*}}}*/

Diff for: const.cpp

@@ -1,3 +1,8 @@
+// Constants /*{{{*/
+
 const int MAXM = (int)1e5+100;
 const int MAXN = (int)1e5+100;
 const int64_t MOD  = (int64_t)1e9+7ll;
+
+/*}}}*/
+

Diff for: debug.cpp

@@ -1,11 +1,16 @@
+// Debug Section /*{{{
+
 void Log_Gen() { cerr << endl; }
 template <typename HEAD, typename... TAIL>
 void Log_Gen(HEAD H, TAIL... T) {
   cerr << " " << (H);
   Log_Gen(T...);
 }
+
 #ifdef HELL_JUDGE
-#define Log(...) cerr << "[" << #__VA_ARGS__ << "]:", Log_Gen(__VA_ARGS__)
+#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", Log_Gen(__VA_ARGS__)
 #else
-#define Log(...) 0
+#define debug(...) 0
 #endif
+
+/* }}} */

Diff for: fast_io.cpp

@@ -1,3 +1,7 @@
+// FIO /*{{{*/
+
     ios::sync_with_stdio(false); // FLUSH THE STREAM IF USING puts / printf / scanf/
     cin.tie(nullptr);            //
     cout.tie(nullptr);           //
+
+/*}}}*/

Diff for: linear_sieve.cpp

@@ -1,3 +1,4 @@
+// Linear Sieve /*{{{*/
 const int N = 10000000;
 int lp[N+1];
 vector<int> pr;
@@ -11,6 +12,10 @@ void linear_sieve(void){
             lp[i * pr[j]] = pr[j];
     }
 }
+/*}}}*/
+// Delete one of these 
+// Precomputed Primes upto 1500 /*{{{*/
 
-// for n = 10^3 & prime factorization of 10^6
 vector<int>pr = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399};
+
+/*}}}*/

Diff for: mod_exponentiation.cpp

@@ -1,4 +1,6 @@
-const int MOD = (int)1e9+7;
+// /*{{{*/
+// Mod Exp: @function_name m_pow 
+// /*{{{*/
 int64_t m_pow(int64_t a, int64_t b , int64_t uMOD = (int64_t)1e9+7){
     int64_t res{1ll};
     while(b){
@@ -10,3 +12,5 @@ int64_t m_pow(int64_t a, int64_t b , int64_t uMOD = (int64_t)1e9+7){
     }
     return res;
 }
+/*}}}*/
+/*}}}*/

Diff for: mod_ops.cpp

@@ -1,33 +1,39 @@
+// Mod Operations /*{{{*/
 
 void check2(int64_t &a){
     if(a<0){
         a = (a+MOD+MOD)%MOD;
     }
 }
+
 void check1(int64_t &a, int64_t &b){
     a%=MOD;
     b%=MOD;
     check2(a);
     check2(b);
 }
+
 int64_t mul(int64_t a, int64_t b){
     check1(a,b);
     int64_t temp = (a*b)%MOD;
     check2(temp);
     return temp;
 }
+
 int64_t add(int64_t a, int64_t b){
     check1(a,b);
     int64_t temp = (a+b)%MOD;
     check2(temp);
     return temp;
 }
+
 int64_t sub(int64_t a, int64_t b){
     check1(a,b);
     int64_t temp = (a-b)%MOD;
     check2(temp);
     return temp;
 }
+
 int64_t inverse(int64_t a, int64_t uMOD = (int64_t)1e9+7ll) { 
     int64_t m0 = uMOD; 
     int64_t y = 0ll, x = 1ll; 
@@ -42,10 +48,13 @@ int64_t inverse(int64_t a, int64_t uMOD = (int64_t)1e9+7ll) {
     if (x < 0ll) x += m0; 
     return x; 
 } 
+
 int64_t div(int64_t a, int64_t b){
     check1(a,b);
     int64_t temp = (mul(a,inverse(b,MOD)))%MOD;
     check2(temp);
     return temp;
 }
 
+
+/*}}}*/

Diff for: range.cpp

@@ -1,3 +1,5 @@
+// range(0-N) /*{{{*/
+
 class NumberIterator : iterator<forward_iterator_tag, int> {
     public:
         int v;
@@ -19,3 +21,5 @@ class range : pair<int,int> {
             return second;
         }
 };
+
+// /*}}}*/

Diff for: vpi.cpp

@@ -1,3 +1,5 @@
+// Vector pair input/output /*{{{*/
+
 template<typename A, typename B>
 ostream& operator<<(ostream&out, const pair<A, B>&p){
     out << p.first << ' ' << p.second ;
@@ -25,3 +27,5 @@ ostream& operator<<(ostream&out,const vector<A>&vec){
     }
     return out;
 }
+
+/*}}}*/