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 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
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! :)