How can I randomly choose M points from N-dimensional hypercube ?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | Petr | 145 |
9 | pajenegod | 145 |
How can I randomly choose M points from N-dimensional hypercube ?
I am unable to understand the O(n log n) algorithm. I've found many examples, but there are too difficult for me. Could somebody explain it in simple words ? I saw that a lot of users use lower_bound, but I don't see why it works.
I know that there'll be answers like google it etc, but I've already spent many hours and I didn't find anything useful.
Let's say I have boundaries left and right, which are doubles and I want to do binary search. How long should I iterate to be sure that given error isn't too big.
For example, in the last contest there was a problem http://codeforces.com/contest/579/problem/E
I saw some codes and authors use 100, 200 etc iterations
Название |
---|