Updated

likecs · likecs · commit d6f375b1cfcd · 2016-09-27T07:49:24.000+05:30
diff --git a/check.cpp b/check.cpp
@@ -1,6 +1,3 @@
-//The below contains the brute force code for any solution
-//It helps me to check the answers or find a pattern in question
-
 #include <bits/stdc++.h>
 using namespace std;
  
@@ -9,27 +6,32 @@ typedef long double LD;
 
 const int MAX   = 1e5 + 5;
 const int LIM   = 3e5 + 5;
+const int MOD   = 1e9 + 7;
 const LD  EPS   = 1e-10;
 const double PI = acos(-1.0);
 
 #define fastio          ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
 #define Assert(x) 		{if(!(x)){cerr<<"Assertion failed at line "<<__LINE__<<": "<<#x<<" = "<<(x)<<"\n";exit(1);}}
+#define inchar          getchar//_unlocked
+#define outchar(x)      putchar(x)//_unlocked(x)
 #define unique(a)       sort((a).begin(), a.end()), (a).erase(unique((a).begin(), (a).end()),(a).end())
 
 #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
 template <typename Arg1>void __f(const char* name, Arg1&& arg1){cout<<name<<" : "<<arg1<<"\n";}
 template <typename Arg1, typename... Args>void __f(const char* names, Arg1&& arg1, Args&&... args){const char* comma=strchr(names+1,',');cout.write(names,comma-names)<<" : "<<arg1<<" , ";__f(comma+1, args...);}
 
 double tick(){static clock_t oldt;clock_t newt=clock();double diff=1.0*(newt-oldt)/CLOCKS_PER_SEC;oldt = newt;return diff;}
-int ilog2(int n){return 31 - __builtin_clz(n);}
-int ilog2(LL n){return 63 - __builtin_clzll(n);}
+template<typename T> void inPos(T &x){x=0;register T c=inchar();while(((c<48)||(c>57))&&(c!='-'))c=inchar();bool neg=false;if(c=='-')neg=true;for(;c<48||c>57;c=inchar());for(;c>47&&c<58;c=inchar())x=(x<<3)+(x<<1)+(c&15);if(neg)x=-x;}
+template<typename T> void outPos(T n){if(n<0){outchar('-');n*=-1;}char snum[65];int i=0;do {snum[i++]=n%10+'0';n/=10;}while(n);i=i-1;while(i>=0)outchar(snum[i--]);outchar('\n');}
+inline void inStr(char *str){register char c=0;register int i=0;while(c<33)c=inchar();while (c!='\n'&&c!=' '&&c!=EOF){str[i]=c;c=inchar();++i;}str[i]='\0';}
 template<typename T> T gcd(T a, T b){return (b?__gcd(a,b):a);}
 template<typename T> T lcm(T a, T b){return (a*(b/gcd(a,b)));}
 template<typename T> T mod(T a, T b) {return (a<b ? a : a%b);}
-template<typename T> T mod_neg(T a, T b) {return ((a%b)+b)%b;}
+template<typename T> T add(T a, T b, T c){T x=a+b;return (x>=c ? x-c : x);}
+template<typename T> T mod_neg(T a, T b) {a=mod(a, b);if(a<0){a+=b;}return a;}
 LL mulmod(LL a,LL b, LL m){LL q=(LL)(((LD)a*(LD)b)/(LD)m);LL r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
 template<typename T> T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
-template<typename T> T power(T e, T n, T m){T x=1,p=e;while(n){if(n&1)x=mod(x*p,m);p=mod(p*p,m);n>>=1;}return x;}
+template<typename T> T power(T e, T n, T m){T x=1%m,p=e;while(n){if(n&1)x=mod(x*p,m);p=mod(p*p,m);n>>=1;}return x;}
 template<typename T> T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
 template<typename T> T mod_inverse(T a, T n){T x,y;T d = extended_euclid(a, n, x, y);return (d>1?-1:mod_neg(x,n));}
 
@@ -39,8 +41,7 @@ int main() {
         freopen("res.txt", "w", stdout);
     #endif
 
-    // Brute force code goes below
+    // Brute force code or some Accepted code goes below
 
-    // cerr<<tick();
     return 0;
 }
diff --git a/code_template.cpp b/code_template.cpp
@@ -1,5 +1,3 @@
-//Below is the template in C++ which I used for Programming Competitions
-
 /******************************************
 *    AUTHOR:         BHUVNESH JAIN        *
 *    INSTITUITION:   BITS PILANI, PILANI  *
@@ -12,11 +10,12 @@ typedef long double LD;
 
 const int MAX   = 1e5 + 5;
 const int LIM   = 3e5 + 5;
+const int MOD   = 1e9 + 7;
 const LD  EPS   = 1e-10;
 const double PI = acos(-1.0);
 
 #define fastio          ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
-#define Assert(x)       {if(!(x)){cerr<<"Assertion failed at line "<<__LINE__<<": "<<#x<<" = "<<(x)<<"\n";exit(1);}}
+#define Assert(x) 		{if(!(x)){cerr<<"Assertion failed at line "<<__LINE__<<": "<<#x<<" = "<<(x)<<"\n";exit(1);}}
 #define inchar          getchar//_unlocked
 #define outchar(x)      putchar(x)//_unlocked(x)
 #define unique(a)       sort((a).begin(), a.end()), (a).erase(unique((a).begin(), (a).end()),(a).end())
@@ -29,15 +28,14 @@ double tick(){static clock_t oldt;clock_t newt=clock();double diff=1.0*(newt-old
 template<typename T> void inPos(T &x){x=0;register T c=inchar();while(((c<48)||(c>57))&&(c!='-'))c=inchar();bool neg=false;if(c=='-')neg=true;for(;c<48||c>57;c=inchar());for(;c>47&&c<58;c=inchar())x=(x<<3)+(x<<1)+(c&15);if(neg)x=-x;}
 template<typename T> void outPos(T n){if(n<0){outchar('-');n*=-1;}char snum[65];int i=0;do {snum[i++]=n%10+'0';n/=10;}while(n);i=i-1;while(i>=0)outchar(snum[i--]);outchar('\n');}
 inline void inStr(char *str){register char c=0;register int i=0;while(c<33)c=inchar();while (c!='\n'&&c!=' '&&c!=EOF){str[i]=c;c=inchar();++i;}str[i]='\0';}
-int ilog2(int n){return 31 - __builtin_clz(n);}
-int ilog2(LL n){return 63 - __builtin_clzll(n);}
 template<typename T> T gcd(T a, T b){return (b?__gcd(a,b):a);}
 template<typename T> T lcm(T a, T b){return (a*(b/gcd(a,b)));}
 template<typename T> T mod(T a, T b) {return (a<b ? a : a%b);}
-template<typename T> T mod_neg(T a, T b) {return ((a%b)+b)%b;}
+template<typename T> T add(T a, T b, T c){T x=a+b;return (x>=c ? x-c : x);}
+template<typename T> T mod_neg(T a, T b) {a=mod(a, b);if(a<0){a+=b;}return a;}
 LL mulmod(LL a,LL b, LL m){LL q=(LL)(((LD)a*(LD)b)/(LD)m);LL r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
 template<typename T> T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
-template<typename T> T power(T e, T n, T m){T x=1,p=e;while(n){if(n&1)x=mod(x*p,m);p=mod(p*p,m);n>>=1;}return x;}
+template<typename T> T power(T e, T n, T m){T x=1%m,p=e;while(n){if(n&1)x=mod(x*p,m);p=mod(p*p,m);n>>=1;}return x;}
 template<typename T> T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
 template<typename T> T mod_inverse(T a, T n){T x,y;T d = extended_euclid(a, n, x, y);return (d>1?-1:mod_neg(x,n));}
 
diff --git a/inp_generator.cpp b/inp_generator.cpp
@@ -1,5 +1,3 @@
-//Below code is used to generate some random test cases
-
 #include <iostream>
 #include <cstdio>
 #include <cmath>
@@ -15,6 +13,10 @@ const int mod = 1e2;
 const int mod2 = 10;
 const LL modl = 1e18;
 
+//Sample program to generate 1000 random integers
+//For generating some specific test case as per problems, you can refer to 
+// https://github.com/likecs/Test-case-generators
+
 int main() {
 	#ifndef ONLINE_JUDGE
 		freopen("inp.txt", "w", stdout);
@@ -24,12 +26,9 @@ int main() {
 	t = 1000;
 	printf("%d\n", t);
 	while (t--) {
-		int n, q, x, y, l, r;
+		int n;
 		n = rand()%mod + 1;
 		printf("%d\n", n);
-		
-		// LL n;
-		// n = (LL)rand() * (LL)rand() % modl + 1;
 	}
 	return 0;
 }
diff --git a/precision_checker.cpp b/precision_checker.cpp
@@ -5,6 +5,7 @@
 #include <algorithm>
 using namespace std;
 
+//Set the precision limit you want for comparing the 2 output files
 const double EPS = 1e-7;
 
 int main() {
diff --git a/timer.cpp b/timer.cpp
@@ -14,6 +14,7 @@ int main() {
 	//write your code below
 
 	//include this at the end of your code to get the time
-	cerr<<tick();
+	cerr << tick();		//Prints execution time on error screen
+
 	return 0;
 }
diff --git a/work.cpp b/work.cpp
@@ -1,6 +1,3 @@
-//Below contains the workspace for my coding 
-//This is the file which I upload on Online Judges
-
 /******************************************
 *    AUTHOR:         BHUVNESH JAIN        *
 *    INSTITUITION:   BITS PILANI, PILANI  *
@@ -13,6 +10,7 @@ typedef long double LD;
 
 const int MAX   = 1e5 + 5;
 const int LIM   = 3e5 + 5;
+const int MOD   = 1e9 + 7;
 const LD  EPS   = 1e-10;
 const double PI = acos(-1.0);
 
@@ -30,21 +28,21 @@ double tick(){static clock_t oldt;clock_t newt=clock();double diff=1.0*(newt-old
 template<typename T> void inPos(T &x){x=0;register T c=inchar();while(((c<48)||(c>57))&&(c!='-'))c=inchar();bool neg=false;if(c=='-')neg=true;for(;c<48||c>57;c=inchar());for(;c>47&&c<58;c=inchar())x=(x<<3)+(x<<1)+(c&15);if(neg)x=-x;}
 template<typename T> void outPos(T n){if(n<0){outchar('-');n*=-1;}char snum[65];int i=0;do {snum[i++]=n%10+'0';n/=10;}while(n);i=i-1;while(i>=0)outchar(snum[i--]);outchar('\n');}
 inline void inStr(char *str){register char c=0;register int i=0;while(c<33)c=inchar();while (c!='\n'&&c!=' '&&c!=EOF){str[i]=c;c=inchar();++i;}str[i]='\0';}
-int ilog2(int n){return 31 - __builtin_clz(n);}
-int ilog2(LL n){return 63 - __builtin_clzll(n);}
 template<typename T> T gcd(T a, T b){return (b?__gcd(a,b):a);}
 template<typename T> T lcm(T a, T b){return (a*(b/gcd(a,b)));}
 template<typename T> T mod(T a, T b) {return (a<b ? a : a%b);}
-template<typename T> T mod_neg(T a, T b) {return ((a%b)+b)%b;}
+template<typename T> T add(T a, T b, T c){T x=a+b;return (x>=c ? x-c : x);}
+template<typename T> T mod_neg(T a, T b) {a=mod(a, b);if(a<0){a+=b;}return a;}
 LL mulmod(LL a,LL b, LL m){LL q=(LL)(((LD)a*(LD)b)/(LD)m);LL r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
 template<typename T> T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
-template<typename T> T power(T e, T n, T m){T x=1,p=e;while(n){if(n&1)x=mod(x*p,m);p=mod(p*p,m);n>>=1;}return x;}
+template<typename T> T power(T e, T n, T m){T x=1%m,p=e;while(n){if(n&1)x=mod(x*p,m);p=mod(p*p,m);n>>=1;}return x;}
 template<typename T> T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
 template<typename T> T mod_inverse(T a, T n){T x,y;T d = extended_euclid(a, n, x, y);return (d>1?-1:mod_neg(x,n));}
 
 int main() {
     #ifndef ONLINE_JUDGE
         freopen("inp.txt", "r", stdin);
+        freopen("out.txt", "w", stdout);
     #endif
 
     

Original file line number	Diff line number	Diff line change
`@@ -14,6 +14,7 @@ int main() {`
`14`	`14`	`//write your code below`
`15`	`15`
`16`	`16`	`//include this at the end of your code to get the time`
`17`		`- cerr<<tick();`
	`17`	`+ cerr << tick(); //Prints execution time on error screen`
	`18`	`+`
`18`	`19`	`return 0;`
`19`	`20`	`}`