Hi there,
Nearest neighbour is a problem where you are given N points and you are asked to process online queries: for a new point find the closest point from given N points. Euclid distance is used:
Who knows where I can test this problem?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hi there,
Nearest neighbour is a problem where you are given N points and you are asked to process online queries: for a new point find the closest point from given N points. Euclid distance is used:
Who knows where I can test this problem?
Hi there!
Problem from past regional olympiad: There are N ≤ 5000 distinct points |xi|, |yi| ≤ 104 on the plane. You are asked to find the number of different right triangles, where the vertices are from N points.
TL: 2s, ML: 64MB
Thanks
Hi everybody!
Recently I have thought of how can I solve such problem: There is a root of a tree. At each step player can create on any leaf of a tree either left child (with probability p) or right child (with probability 1 - p). What is the expected value of a height of a tree after n player steps?
UPD: Leaf is chosen with the same probability (equiprobably).
Leaf -- is a vertex with the number of children less than 2.
Hi everybody!
Will be it possible to participate in IOI 2013 online?
Thanks
Name |
---|