Hi :)
Given n can you find a uniformly random correct bracket sequence with 2 * n characters ?
(uniformly random means all possible answer for the problem have same probability for the outcome of the algorithm)
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
A random problem!
Hi :)
Given n can you find a uniformly random correct bracket sequence with 2 * n characters ?
(uniformly random means all possible answer for the problem have same probability for the outcome of the algorithm)
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 |
![]() |
SaSa | 2016-07-06 17:47:16 | 1 | Tiny change: 'characters?<br>\n(un' -> 'characters ?<br>\n(un' | |
en3 |
![]() |
SaSa | 2016-06-29 15:57:17 | 1 | Tiny change: 'characters ?<br>\n(un' -> 'characters?<br>\n(un' | |
en2 |
![]() |
SaSa | 2016-06-29 15:56:38 | 1 | Tiny change: 'characters?<br>\n(un' -> 'characters ?<br>\n(un' | |
en1 |
![]() |
SaSa | 2016-06-28 19:39:20 | 238 | Initial revision (published) |
Name |
---|