Merge pull request #113 from euyogi/master

Correção: ordem dos loops de h() devem ser reversas
edsomjr · Dec 20, 2024 · 0290ce6 · 0290ce6
2 parents f56ea42 + 03113e8
commit 0290ce6
Show file tree

Hide file tree

Showing 3 changed files with 10 additions and 7 deletions.
diff --git a/Strings/slides/hashes/codes/double_hash.cpp b/Strings/slides/hashes/codes/double_hash.cpp
@@ -6,12 +6,13 @@ int f(char c) { return c - 'a' + 1; }
 
 int hi(long long pi, long long qi, const string& s)
 {
+    int N = s.size();
     long long ans = 0;
 
-    for (auto c : s)
+    for (int i = N - 1; i >= 0; --i)
     {
         ans = (ans * pi) % qi;
-        ans = (ans + f(c)) % qi;
+        ans = (ans + f(s[i])) % qi;
     }
 
     return ans;

diff --git a/Strings/slides/hashes/codes/h.cpp b/Strings/slides/hashes/codes/h.cpp
@@ -5,12 +5,13 @@ int f(char c)
 
 int h(const string& s)
 {
+    int N = s.size();
     long long ans = 0, p = 31, q = 1'000'000'007;
 
-    for (auto c : s)
+    for (int i = N - 1; i >= 0; --i)
     {
         ans = (ans * p) % q;
-        ans = (ans + f(c)) % q;
+        ans = (ans + f(s[i])) % q;
     }
 
     return ans;

diff --git a/Strings/slides/hashes/codes/subs.cpp b/Strings/slides/hashes/codes/subs.cpp
@@ -11,12 +11,13 @@ int f(char c)
 
 int h(const string& s)
 {
+    int N = s.size();
     ll ans = 0;
 
-    for (auto c : s)
+    for (int i = N - 1; i >= 0; --i)
     {
         ans = (ans * p) % q;
-        ans = (ans + f(c)) % q;
+        ans = (ans + f(s[i])) % q;
     }
 
     return ans;
@@ -72,8 +73,8 @@ int h(int i, int j, const vector<ll>& ps, const vector<ll>& is)
 
 int unique_substrings(const string& s)
 {
-    set<ll> hs;
     int N = s.size();
+    set<ll> hs;
 
     auto ps = prefixes(s);
     auto is = inverses(s.size());