Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:对数组hash,这个果然很好很强大In Reply To:对数组hash,这个果然很好很强大 Posted by:happynp at 2008-07-06 21:15:10 > 从网上搞来的,好像是折叠法 > inline int hashcode(const int *v) > { > int s = 0; > for(int i=0; i<k; i++) > s=((s<<2)+(v[i]>>4))^(v[i]<<10); > s = s % M; > s = s < 0 ? s + M : s; > return s; > } 有哪位大牛能解释一下吗? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator