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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
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 |
---|