This Solution got AC, but it gave wrong output for the input below:
3 1
a
b
c
aaaaa
The program gave output: YES but I think the output should be: NO
Am I right? If I'm, then the data set may b too weak! :(
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
This Solution got AC, but it gave wrong output for the input below:
3 1
a
b
c
aaaaa
The program gave output: YES but I think the output should be: NO
Am I right? If I'm, then the data set may b too weak! :(
Name |
---|
Well, it seems you're right. According to your code strings like 'aaa..a' have hash equels 0. So, HASH("baaaa") == HASH("b") and so on.
Unfortunatly, testset doesn't cover this case.
HASH("baaaa") == HASH("b") * BASE^4
Right?
But actually HASH("b") == HASH("aaaab"). That's why it's good to use BASE = 5 and a = 1, b = 2 and c = 3.
BTW, this is my first way when I use a as 0, b as 1 and c as 2 and it seems I was really really really lucky with that :D :D :D
Wow, actually I compare the strings not only by the hash value but by the length too, so in my case it doesn't depend on luck. Sorry for the misunderstanding! :)