Anti Hashing.

Правка en1, от Rajan_sust, 2018-03-19 18:05:55

The problem was set in acm icpc preliminary contest 2017 in Dhaka site. Problem Link : E.Anti Hash

Problem is : you will given a string S of length N consisting of lowercase letters (a-z) only.Also given a base B and mod-value M for doing polynomial hashing. Note : B and M are both prime.

Your task is to find another string T, satisfying all of the following constraints: - Length of T is exactly N. - T consists of only lowercase letters (a-z). - T and S have the same hash value that means, collision happens. - For hashing in both case you have to use B and M.

Any idea? Thanks in advance.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Rajan_sust 2018-03-19 18:08:03 8
en2 Английский Rajan_sust 2018-03-19 18:07:01 16
en1 Английский Rajan_sust 2018-03-19 18:05:55 770 Initial revision (published)