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 | 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 | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
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 |
---|