which primes are best for hashing a graph? like two tree is isomorpic? then we need to hash the graph..need some prime. which are best for it. thank you :)
# | 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 | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
which primes are best for hashing a graph? like two tree is isomorpic? then we need to hash the graph..need some prime. which are best for it. thank you :)
Name |
---|
You can find here.
thanks vai..i think for these problem we need higher prime, cause nodes can be up to 10^5 ..i am not sure.
use unordered_map
i think it'll work for your work or u can google for the primes over 1e6 and find your power and mod... :)
In this problem, i saw that everyone use higher prime. In lower prime they get Wa.. They use 10^10 up primes.