Detail of message

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

竟然是直接nc进制数hash!!!!

Posted by zhucheng at 2005-09-21 19:39:30 on Problem 1200
In Reply To:这道题的NC到底有什么用?我用hash过的,用的是lrj书上的hash函数,但是很慢,是不是需要设计和NC有关的hash函数? Posted by:firefox at 2005-09-20 18:07:06

> unsigned int hash(char*key){
>     unsigned long h=0;
>     while(*key){
>         h=(h<<4)+*key++;
>         unsigned long g=h&0xf0000000L;
>         if(g)h^=g>>24;
>         h&=~g;
>     }
>     return h%NHASH;
> }

Followed by:

题目说了总数不会超过16M的，没什么好惊奇的，本就该这么做 (0) frkstyc 2005-09-21 19:40:30
- 也可以nc^n很大，输入文本很短啊! (0) zhucheng 2005-09-21 19:42:53
  - 就是nc^n<=16M (0) frkstyc 2005-09-21 19:47:58
    - 是说答案不超过16M吧！ (0) zhucheng 2005-09-21 19:50:50
      - You may assume that the maximum number of substrings formed by the possible set of characters does not exceed 16 Millions. (0) frkstyc 2005-09-21 19:51:17
        You are right. (0) zhucheng 2005-09-21 19:52:15
      - 所以说要仔细看题…… (0) frkstyc 2005-09-21 19:51:44
        Re:所以说要仔细看题…… (20) logics_space 2008-11-20 10:06:17

Post your reply here:

Home Page Go Back To top