| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 2 | maomao90 | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Hello!
Does anyone know where I can submit my solution for a following problem: We are given 2 $$$\textbf{real}$$$ points on a plane $$$(x1, y1)$$$ and $$$(x2, y2)$$$. Our task is to calculate number of integer points under the segment that connects both our points.
Problem #1139 on timus shares this idea. Yet, it is a slightly different problem.
I think that is not what I need :D
Thank you anyway!
What does points "under" the line/line segment mean? Won't that be infinite?
Do you want integer points in the first quadrant that are under the line? Or some other restriction maybe?