The floor sum is an algorithm that solves for the value of a function approximating $$$f(a,b,c,n)=\sum\limits_{i=0}^n\lfloor\frac{ai+b}{c}\rfloor$$$ in $$$O(\log n)$$$ time complexity.
How to calculate floor sum?
The floor sum is an algorithm that solves for the value of a function approximating $$$f(a,b,c,n)=\sum\limits_{i=0}^n\lfloor\frac{ai+b}{c}\rfloor$$$ in $$$O(\log n)$$$ time complexity.
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en29 |
|
YipChip | 2025-03-26 06:18:26 | 2 | ||
| en28 |
|
YipChip | 2025-03-25 05:33:43 | 0 | (published) | |
| en27 |
|
YipChip | 2025-03-25 05:30:35 | 359 | (saved to drafts) | |
| en26 |
|
YipChip | 2025-03-25 05:06:19 | 2 | ||
| en25 |
|
YipChip | 2025-03-25 05:03:42 | 454 | ||
| en24 |
|
YipChip | 2025-03-24 18:01:07 | 173 | ||
| en23 |
|
YipChip | 2025-03-24 15:32:43 | 0 | (published) | |
| en22 |
|
YipChip | 2025-03-24 15:31:41 | 16 | (saved to drafts) | |
| en21 |
|
YipChip | 2025-03-24 15:29:12 | 0 | (published) | |
| en20 |
|
YipChip | 2025-03-24 15:28:45 | 6 | ||
| en19 |
|
YipChip | 2025-03-24 15:27:44 | 16 | ||
| en18 |
|
YipChip | 2025-03-24 15:26:36 | 35 | ||
| en17 |
|
YipChip | 2025-03-24 15:25:26 | 54 | ||
| en16 |
|
YipChip | 2025-03-24 15:24:05 | 23 | ||
| en15 |
|
YipChip | 2025-03-24 15:22:29 | 36 | ||
| en14 |
|
YipChip | 2025-03-24 15:19:57 | 37 | ||
| en13 |
|
YipChip | 2025-03-24 15:18:25 | 47 | ||
| en12 |
|
YipChip | 2025-03-24 15:17:27 | 39 | ||
| en11 |
|
YipChip | 2025-03-24 15:16:59 | 342 | ||
| en10 |
|
YipChip | 2025-03-24 15:12:53 | 7099 | ||
| en9 |
|
YipChip | 2025-03-24 15:04:47 | 615 | ||
| en8 |
|
YipChip | 2025-03-24 15:02:43 | 55 | ||
| en7 |
|
YipChip | 2025-03-24 15:01:42 | 2 | ||
| en6 |
|
YipChip | 2025-03-24 15:01:29 | 2 | ||
| en5 |
|
YipChip | 2025-03-24 15:00:39 | 30 | ||
| en4 |
|
YipChip | 2025-03-24 14:59:33 | 38 | ||
| en3 |
|
YipChip | 2025-03-24 14:57:38 | 2 | ||
| en2 |
|
YipChip | 2025-03-24 14:57:17 | 1967 | ||
| en1 |
|
YipChip | 2025-03-24 14:52:32 | 203 | Initial revision (saved to drafts) |