Advertisement
Guest User

Untitled

a guest
Nov 6th, 2015
158
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.26 KB | None | 0 0
  1. def full_hash(w,n,N):
  2.     n = 1
  3.     while 2**(n-1)<num:
  4.         if 2**n>=num:
  5.             break
  6.         n+=1
  7.     Hv = 0
  8.     for c in w:
  9.         Hv = (Hv*31+ord(c))%2147483647
  10.     first_four = int(to2sCompStr(Hv,64)[64-n:],2)
  11.     if(first_four < N):
  12.         return first_four
  13.     return stack_hash(str(Hv),n,N)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement