WTF, lol, How is this problem 2000 difficulty? https://codeforces.me/problemset/problem/1919/H
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
WTF, lol, How is this problem 2000 difficulty? https://codeforces.me/problemset/problem/1919/H
Let $$$m$$$ be some positive integer (not necessary prime) . There is a way to calculate $$$\displaystyle{\frac{a}{b}}\%m$$$ when b is not very big and $$$a \% b = 0$$$ Firstly, let's notice, that $$$\displaystyle{\frac{a}{b}}=mk+(a/b)\%m$$$, for some integer value k. Now, let's do some mathematical stuff:
So, the answer is $$$(a\%mb)/b$$$
Hi Guys, Can anyone help me solve this problem?
https://acm.timus.ru/problem.aspx?space=1&num=2019&locale=en
I tried to solve it greedily. Also i tried to solve it using dynamic programming. I had dp[l][r] true if exists k such that dp[l][k] is true and dp[k + 1][r] is true or dp[l + k][r — k] is true and we can connect letters from range (l, l + k) to the letters from range (r — k, r). Unfortunately, that works for O(n^3)
Название |
---|