Can someone give me a hint on this problem and also can one friend take more than one gift because it is not clear in the statement.
→ Обратите внимание
До соревнования
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.04.2026 03:00:51 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
You buy exactly one gift for every friend. So in total you buy exactly m gifts. The question is in how many different ways you can choose m out of n gifts. With the extra constraint that at least k of them have a price of at least d.
Divide the n gifts into two groups. One expensive group where every gift has a price of at least d. And one cheap group with all the other gifts.
How many ways there are to choose k gifts out of the expensive gifts and m-k out of the cheap gifts? How many ways to choose k+1 expensive gifts and m-k-1 out of the cheap gifts? ...