https://pasteboard.co/JVs1DoO.png
Do you also see the issue here?
MikeMirzayanov do you have a time to take a look at this?
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 157 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
https://pasteboard.co/JVs1DoO.png
Do you also see the issue here?
MikeMirzayanov do you have a time to take a look at this?
We have 2 sets — S and T in 3d space ( points from these sets are separed by hyperplane ).
We need to find closest pair of points ( one of which is from S, other one from T ).
There's an algorithm for 2d case when we have only 1 set of points. How do this solve this one though?
ЗКШ в Харькове — нужны тесты и авторские решения ко всем годам. Кто-то может с этим помочь?
Name |
---|