http://xrumersale.site/
Absolutely NEW update of SEO/SMM
package "XRumer 16.0 + XEvil 3.0":
captchas solution of Google,
Facebook, Bing, Hotmail, SolveMedia,
Yandex,
and more than 8400 another size-types
of captchas,
with highest precisio
User:
Guest
Date: 2015-11-30
. Use linear hasnihg to a domain of
p=2*t (modular hasnihg works, but
multiply-shift is better). Then
compute the set (S+S) mod p using FFT
in time O(t*lg t).Now you can look up
each value in -S in this set (S+S)
mod p. If a value is not in, you know
it's not part of a solution. Repeat
O(lg n) times and only the true
solutions remain.