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
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 161 |
3 | Um_nik | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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
Name |
---|