I am just curious that how do the problem setters create the strong test cases for problems, say which involve strings of size 10^6. I dont think they type a string of length 10^6. Can anyone enlighten my mind on this ?
# | 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 |
I am just curious that how do the problem setters create the strong test cases for problems, say which involve strings of size 10^6. I dont think they type a string of length 10^6. Can anyone enlighten my mind on this ?
Name |
---|
You can write a code that generates an input. Using a random number generator, you can create random test cases. Then you need large worst cases where some slow approaches (which are fast on random tests) would TLE; those cases usually satisfy some conditions using which you can generate them. Just special cases are made by hand.