Bangladesh Informatics Olympiad 2016 took place in 24th December, 2015.
The problems are now added in GYM — Bangladesh Olympiad in Informatics 2016 by rubabredwan The problems are pretty interesting. Those who are preparing for IOI should give a try.
If interested the standings of the main contest can be found here — BdOI 2016 Standings
→ Обратите внимание
До соревнования
Codeforces Round 940 (Div. 2) and CodeCraft-23
3 дня
Зарегистрироваться »
Codeforces Round 940 (Div. 2) and CodeCraft-23
3 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 19.04.2024 04:44:11 (k1).
Десктопная версия, переключиться на мобильную.
При поддержке
Problem B is pretty nice, albeit fairly easy. I remember seeing Problem C on an old COCI, like 2006/2007 or so. Thanks rubabredwan for taking the time to put the contest on Codeforces, it's interesting to see what other countries' olympiads look like. Is this the olympiad that chooses the IOI team?
Unfortunately, I don't see any bounds for joy values on E :(
Also, F is a version of this problem with lower bounds.
i can't figure out solution of problem C.can someone give hints.
dp[i][j] — how many permutations with elements from 1 to i have exactly j inversions.
The answer is
.
Is editorial going to be published?
A memory limit of 32 MB on Problem E. Is there any specific reason for doing so ? I have a NlogN solution (time and memory), but it just fails to fit into the memory limits.
Can Problem D be solved using greedy by picking the best point every time? I keep getting wrong answer not sure if it can be solved in such a way or do I have a mistake in code. My code: https://ideone.com/NkRObU
I assume it is ideally meant to be a DP problem that can be solved only this way. The fact that K is as small as 50 gives a good hint, doesn't it ?
implementing a deque in problem a causes TLE in test 5. what can i do?