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)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 154 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | pajenegod | 144 |
9 | orz | 144 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|