Can anyone explain the solution for this problem 102014F - Directional Resemblance ?
The problem basically says:
We are given N vectors in 3D and we want to find 2 vectors such that the angle between them is minimum.
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 156 |
6 | Qingyu | 153 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Minimum Angle Between 2 vectors from a given set of vectors (3D)
Can anyone explain the solution for this problem 102014F - Directional Resemblance ?
The problem basically says:
We are given N vectors in 3D and we want to find 2 vectors such that the angle between them is minimum.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
ZeyadKhattab | 2019-09-13 09:34:00 | 15 | ||
en1 |
![]() |
ZeyadKhattab | 2019-09-11 21:34:52 | 259 | Initial revision (published) |
Name |
---|