| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Solve the problem for when the integers have to be in the range $$$[1, k]$$$ for some $$$k$$$.
Solve the problem for multisets faster than $$$\mathcal{O}(n^3)$$$.
Prove and construct exact bound for the answer.
Solve the problem in $$$\mathcal{O}(nk)$$$.
Write a checker for this problem.
Solve the problem purely with generating functions.
Hello, Codeforces!
I am proud to invite you to Order Capital Round 1 (Codeforces Round 1038, Div. 1 + Div. 2), which will be held on Jul/19/2025 17:35 (Moscow time).
The round will be rated for everyone. You will be given 7 problems and 2 hours and 15 minutes to solve them.
All problems were authored by me.
I would like to thank:
cadmiumky and TheScrasse for coordinating the round,
Radewoosh, arvindf232, errorgorn, Adam_GS, Errichto, -XraY-, Marcin_smu, Rafi22, SergeiFedorov, Markadiusz, Dragos, VadymKa, freak93, Andrei_ierdnA, NemanjaSo2005, fwitt, ToxicPie9, madlogic, Porumb, ivgechu, stefdasca, tibinyte2006, lIlIlIlIIll, trraian, Buek, larush, lev1106 for testing,
Alexdat2000 for Russian translations,
MikeMirzayanov for Codeforces and Polygon.
Score distribution:
| $$$500$$$ | $$$1000$$$ | $$$1500$$$ | $$$2000$$$ | $$$2500$$$ | $$$3250$$$ | $$$4000$$$ |
And now, a few words about today's sponsor!

Order Capital is a team of engineers and researchers with a deep passion for algorithms, clean code, and well-crafted solutions. Many of their team members have a competitive programming background — with roots in ICPC, IOI, IMO, Code Jam, and Hacker Cup — so hosting their own Codeforces round is a particularly exciting milestone. They specialize in building high-performance systems for algorithmic trading, where every nanosecond matters.
Here’s the founder’s welcome post in case you missed it — plus info on current openings.
Considering joining the team or doing an internship? Hit the link and fill out the form — they’d love to hear from you!
🏆Prizes & Surprises:🏆
But that’s not all.
Top 10 — guaranteed, plus 20 lucky participants ranked between 11 and 200 will also get our surprise merch boxes!
Good luck, have fun, and don’t forget to apply if you're looking for your next challenge!
UPD: Editorial is up.
| Name |
|---|


