Pagini recente » Cod sursa (job #3212001) | Diferente pentru utilizator/mdan intre reviziile 40 si 38 | Diferente pentru utilizator/mdan intre reviziile 40 si 39 | Ședință 2009-10-23 | Diferente pentru blog/rolling-hash intre reviziile 17 si 16
Nu exista diferente intre titluri.
Diferente intre continut:
After spending O(n) time on preprocessing h, we have an efficient way to compute the hash code for any subsequence of S.
The division operation modulo a prime needs some number theory insight. You can do it using Fermat's little theorem or using the Extended Euclidean Algorithm. If you need to process a lot of sub strings it's useful to pre process all the values for <tex>a^{-i} % p</tex>.
The division operation modulo a prime needs some number theory insight. You can do it using Fermat's little theorem or using the Extended Euclidean Algorithm. If you need to process a lot of sub strings it may be useful to pre process all the values for <tex>a^{-i} mod p</tex>.
h2. Caveats
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
