you have an an integer n such that 1<=n<= 10^12, find the sum of all triagular numbers that are less than or equal n,
time limit: 1 second
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 144 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
you have an an integer n such that 1<=n<= 10^12, find the sum of all triagular numbers that are less than or equal n,
time limit: 1 second
Months ago, Springer published a new competitive programming book, you can officially download the book here
Direct link (pdf): https://link.springer.com/content/pdf/10.1007%2F978-3-319-72547-5.pdf direct link (epub):https://link.springer.com/download/epub/10.1007%2F978-3-319-72547-5.epub
| Название |
|---|


