given a set of $$$n \le 10^5$$$ range $$$[x_i, 2 \times x_i]$$$ and $$$\sum x_i \le 10^5$$$ determine the number of arrays $$$a$$$ such that $$$x_i \le a_i \le 2 \times x_i$$$ and all the elements in $$$a$$$ are pairwise distinct
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/20/2026 11:42:47 (g2).
Desktop version, switch to mobile version.
Supported by
intereting -> interesting, my bad!
is this not just very simple combinatorics or am i tripping
twin the general problem is lowkey unsolvable so you gotta consider the $$$[n, 2n]$$$ non-challant part twin
ohh i didnt see that each element in i is bounded by the corresponding x. nvm, i suck at reading and combinatorics