learn22coding
diff --git a/‎Implementations/content/strings (14)/Light/LyndonFactor.h
Copy file name to clipboardExpand all lines: Implementations/content/strings (14)/Light/LyndonFactor.h
+4-4Lines changed: 4 additions & 4 deletions b/‎Implementations/content/strings (14)/Light/LyndonFactor.h
Copy file name to clipboardExpand all lines: Implementations/content/strings (14)/Light/LyndonFactor.h
+4-4Lines changed: 4 additions & 4 deletions
diff --git a/‎Resources/Competition Math.md
Copy file name to clipboardExpand all lines: Resources/Competition Math.md
+1-1Lines changed: 1 addition & 1 deletion b/‎Resources/Competition Math.md
Copy file name to clipboardExpand all lines: Resources/Competition Math.md
+1-1Lines changed: 1 addition & 1 deletion
@@ -13,7 +13,7 @@ vs duval(str s) {
 	int N = sz(s); vs factors;
 	for (int i = 0; i < N; ) {
 		int j = i+1, k = i;
-		for (; j < n && s[k] <= s[j]; j++) {
+		for (; j < N && s[k] <= s[j]; ++j) {
 			if (s[k] < s[j]) k = i;
 			else ++k;
 		}
@@ -22,9 +22,9 @@ vs duval(str s) {
 	return factors;
 }
 int minRotation(str s) { 
-	int n = sz(s); s += s;
-	auto d = duval(s); int ind = 0, ans = 0;
-	while (ans+sz(d[ind]) < n) ans += sz(d[ind++]);
+	int N = sz(s); s += s;
+	vs d = duval(s); int ind = 0, ans = 0;
+	while (ans+sz(d[ind]) < N) ans += sz(d[ind++]);
 	while (ind && d[ind] == d[ind-1]) ans -= sz(d[ind--]);
 	return ans;
 }
@@ -13,7 +13,7 @@ If you're still coming up with new ideas, keep thinking. Otherwise, you have sev
  * Leave it for a while and do something else if you actually want to solve it on your own.
  * Get a hint from someone else.
 
-I'm impatient, so usually I go with the first option. Sometimes I end up reading a CF editorial before reading the statement? Idk if this is a good strategy tho. :/
+I'm impatient, so usually I go with the first option.
 
 > I think something should be added or clarified.