optimize dynamic programming ([1/4](https://koosaga.com/242),
[2/4](https://koosaga.com/243), [3/4, * Nine ways to optimize dynamic programming ([1/4](https://koosaga.com/242),
[2/4](https
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | Proof_by_QED | 130 |
→ Find user
→ Recent actions
You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:
305— search for 305, most probably it will find blogs about the Round 305andrew stankevich contests— search for words "andrew", "stankevich" and "contests" at the same timeuser:mikemirzayanov title:testlib— search containing "testlib" in title by MikeMirzayanov"vk cup"— use quotes to find phrase as istitle:educational— search in title
Results
1.
My Korean Blog [user:bobr_babizon,2024-06-15] posted an [article](https://codeforces.me/blog/entry/130415), a machine translation of a Kinetic Segment Tree post in my Korean blog. Given this interest in my small Korean blog, I felt obliged to introduce it.
In most of my undergrad period, I was sponsored by the generous [Samsung Software Membership](https://infossm.github.io/about/), where one of their remarkable features was to fund "individual research projects" — In short, each month, I write an article on interesting stuff, and they will pay me 500,000 KRW per article. Amazing, as it motivates me to learn new stuff and also get paid.
Here is [the full list of posts](https://koosaga.com/249) written by that initiative.
Not all posts are good. Sometimes, I need to keep up with the deadline and rush the post; sometimes, I write stuff in specific interest; sometimes, the topic is too hard and I only obtain a superficial understanding. But there are some posts, which I think are the ...
2.
Educational Codeforces Round 102 [Rated for Div. 2] Hello Codeforces!
On [contest_time:1473] [contest:1473] will start.
Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>.
This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.
You will be given **6 or 7 problems** and **2 hours** to solve them.
The problems were invented and prepared by Roman [user:Roms,2021-01-13] Glazov, Adilbek [user:adedalic,2021-01-13] Dalabaev, Vladimir [user:vovuh,2021-01-13] Petrov, Ivan [us...
">-22 Было сделано 242 успешных и 872 неудачных, ="red">-22 Было сделано 242 успешных и 872, ="red">-22 242 successful hacks and 872, >:-22 242 successful hacks and 872
Announcement of Educational Codeforces Round 102 (Rated for Div. 2)
3.
Invitation to CodeChef Starters 242 (Rated till 5-Stars) — 10th June We invite you to participate in CodeChef’s [Starters 242](https://www.codechef.com/START242), this Wednesday, 10th June, rated for 5 stars (i.e. for users with rating < 2200).
Time: [8:00 PM — 10:00 PM IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeChef+Starters+242&iso=20260610T20&p1=44&ah=2)
Joining us on the problem setting panel are:
- Setters: [user:IceKnight1093,2026-06-10], [user:Dragmon,2026-06-10]
- Tester: [user:kingmessi,2026-06-10]
- Contest Admin, Statement Verifier and Text Editorialist: [user:IceKnight1093,2026-06-10]
Written editorials will be available for all on [discuss.codechef.com](https://discuss.codechef.com/). Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.
Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them [here](https://...
Invitation to CodeChef Starters 242 (Rated till 5-Stars) — 10th June, +Starters+242&iso=20260610T20&p1=44&ah=2), We invite you to participate in CodeChef’s [Starters 242
](https://www.codechef.com/START242), this
4.
Educational Codeforces Round 51 [Rated for Div. 2] On [contest_time:1051] [contest:1051] will start.
Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>.
This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.
You will be given **7 problems** and **2 hours** to solve them.
The problems were invented and prepared by Roman [user:Ajosteen,2018-09-19] Glazov, Ivan [user:BledDest,2018-09-19] Androsov and me.
Good luck to all participants!
Our friends at Harbour.Sp...
[user:elykuil, 2018-09-20] 6 242
Announcement of Educational Codeforces Round 51 (Rated for Div. 2)
5.
Memory Efficient Segment Trees Segment trees are not as memory efficient as fenwick trees which often becomes the bottleneck of many problems. There has been attempts at reducing the space required to build a segment tree (e.g. iterative implementation takes $2N$ space instead of $4N$ space). But there's a very simple solution to this that can asymptotically improve the space complexity (sorry if this is already well-known).
When building the segment tree, we can simply stop the recursion when $r - l \leq \lg n$. This means the size of the tree is $O \left( \frac{n}{\lg n} \right)$ instead of $O(n)$.
Fortunately we can still answer queries (or perform updates) in $O(\lg n)$ time for most problems. For the internal nodes, we can simply collect the contribution of that node just like usual. For the leaf nodes with range $[l, r]$, we will have to scan through the original array in $a[l \cdots r]$ with a loop and calculate their contribution to the query. Since $r - l \leq \lg n$, the loop still takes $O(\lg n)$...
Segment](https://codeforces.me/contest/242/problem/E)
6.
Codeforces Top 100 Comments Hi guys, Here you can find Top 100 Comments in the history of Codeforces Til 1 Jan 2015. It reminds us of some memories we had together in Codeforces :)
### Top 100
[user:yeputons,2015-01-01] 448 http://codeforces.me/blog/entry/8063#comment-138056
[user:zeulb,2015-01-01] 438 http://codeforces.me/blog/entry/10193#comment-156433
[user:Petr,2015-01-01] 354 http://codeforces.me/blog/entry/12605#comment-174158
[user:zakharvoit,2015-01-01] 326 http://codeforces.me/blog/entry/12605#comment-174167
[user:ashmelev,2015-01-01] 318 http://codeforces.me/blog/entry/4302#comment-87389
[user:tourist,2015-01-01] 307 http://codeforces.me/blog/entry/7499#comment-133421
[user:MikeMirzayanov,2015-01-01] 305 http://codeforces.me/blog/entry/1767#comment-33686
[user:Gogis,2015-01-01] 297 http://codeforces.me/blog/entry/15511#comment-204474
[user:sorry_dreamoon,2015-01-01] 287 http://codeforces.me/blog/entry/15336#comment-202752
[user:MikeMirzayanov,2015-01-01] 286 h...
-01] 242 http://codeforces.me/blog/entry/14077#comment-190437
[user:marat.snowbear,2015-01-01] 241, [user:marat.snowbear,2015-01-01] 242
http://codeforces.me/blog/entry/14077#comment-190437
7.
Codeforces Round #242 (Div. 2) Editorial [problem:424A]
The problem is to find the number of standing hamsters. If it is less than half, we should make the required number of hamsters standing. Otherwise we should make some hamsters sitting.
[problem:424B]
We can sort all the cities by their distance to the Tomsk city $d_{i}$. After that we are to find the smallest index $t$ for which the total population $p_{0} + p_{1} + \ldots + p_{t} >= 10^{6}$. In such case the answer is $d_{t}$. We can sort all cities in $O(NlogN)$ and find the value of $t$ in $O(N)$. Limits for $N$ allow $O(N^{2})$ sorting or any other $O(N^{2})$ solution.
[problem:424C]
Consider the following formulas:
$$c_{i} = p_{i} \oplus (1 \mod i) \oplus (2 \mod i) \oplus \cdots \oplus (n \mod i);$$
$$Q = с_{1} \oplus с_{2} \oplus \ldots \oplus с_{n}.$$
Let $f_{i} = 0 \oplus 1 \oplus \ldots \oplus i$. Lets compute the following function for each $i$ ($0 \leqslant i \leqslant n$).
One can do it in $O(n)$ using $f_{i} = f_{i - 1} \oplus i$.
...
Codeforces Round #242 (Div. 2) Editorial, Разбор задач Codeforces Round #242 (Div. 2)
Tutorial of Codeforces Round 242 (Div. 2)
8.
Codeforces Round #242 (Div. 2) Всем доброго времени суток,
[25 апреля в 11:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23242+%28Div.+2%29&iso=20140425T14&p1=1915&ah=2) состоится очередной раунд Codeforces #242 для участников из 2 дивизиона. Традиционно, участники из первого дивизиона могут написать соревнование вне конкурса.
Подготовкой задач занимался коллектив программистов Национального исследовательского Томского политехнического университета: Павел Хаустов ([user:KhaustovPavel,2014-04-24]), Олеся Голуб ([user:Taube,2014-04-24]), Николай Кузиванов ([user:bnick,2014-04-24]), Дмитрий Саввинов ([user:dsavvinov,2014-04-24]), Алексей Ветров ([user:noxwell,2014-04-24]).
Отдельное спасибо Владимиру Чалышеву ([user:cmd,2014-04-24]) и Алексею Дергунову ([user:dalex,2014-04-24]) за огромную помощь в подготовке раунда.
Кроме того, выражаем благодарность коллективу Codeforces и, в частности, Геральду Агапову ([user:Geral...
Codeforces Round #242 (Div. 2), раунд Codeforces #242 для участников из 2 дивизиона. Традиционно, участники из
первого дивизиона, +%23242+%28Div.+2%29&iso=20140425T14&p1=1915&ah=2) состоится очередной раунд
Codeforces #242 для, Hi, everyone! Regular Codeforces round #242 for participants from the second
division will take, Regular Codeforces round #242 for participants from the second division will
take place on [25
9.
AtCoder Beginner Contest 242 Announcement We will hold AtCoder Beginner Contest 242.
- Contest URL: https://atcoder.jp/contests/abc242
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20220305T2100&p1=248
- Duration: 100 minutes
- Number of Tasks: 8
- Writer:[user:blackyuki,2022-03-05],[user:Kodaman,2022-03-05],[user:leaf1415,2022-03-05],[user:penguinman,2022-03-05],[user:physics0523,2022-03-05]
- Tester:[user:leaf1415,2022-03-05], [user:tatyam,2022-03-05]
- Rated range: ~ 1999
- The point values will be 100-200-300-400-500-500-600-600.
We are looking forward to your participation!
AtCoder Beginner Contest 242 Announcement, We will hold AtCoder Beginner Contest 242.
10.
Who wants a VK-Cup T-Shirt? Hey, folks!
I am not a fan of sport-programming t-shirts, but surely know that some of you would like to have one. If you wanna get a t-shirt, just add yourself in [Google Form](https://docs.google.com/forms/d/15-y3Z49MiGMQX2FU-GmwLpHW39t7LWqIfsdYpSlCS-M/viewform?usp=send_form). After a couple of days I will pick a person randomly from the list, and contact him/her for contacts.
Also, I didn't decide how to calculate a random seed fair enough. So, feel free to propose something :)
Cheers!
**Edit 1:** Guys, please, don't mess around with the doc. Now you cannot edit the doc, please, add a comment with your handle.
**Edit 2:** Ok, you forced me to delete Google Doc, and spend more time, thanks :) Please, **add you handle again** in Google Form. **Pay attention**, you can only add your handle once. Make sure you wrote it correctly. Also to prevent cheating, I will chose among people who participated in at least 2 competitions.
**Edit 3:** Seems that everybody who wanted ...
* 168 muratt * 107 heaton * 6 zeulb * 53 Prestige * 157 bayram * 242
Mohammad_Mohsin_COU * 120
11.
Codeforces Round #515 (Div. 3) After the long delay (disease, conference and many other things) the new Div.3 round is coming!
<copy-pasted-part>
Hello!
[contest:1066] will start at [contest_time:1066]. You will be offered 6 or 7 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.
The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.
[cut]
You will be given 6 or 7 problems and 2 hours to solve them.
Note th...
> 4 [user:SodaineGreen, 2018-10-13] 6 242, ] 6 242 5 [user:wythend, 2018-10
12.
Haskell solutions For those who are interested, here is a list of all problems for which Haskell solutions have been submitted.
(Use the 'Status filter' to show only the Haskell submissions.)
[1A](http://codeforces.me/problemset/status/1/problem/A) [1B](http://codeforces.me/problemset/status/1/problem/B) [1C](http://codeforces.me/problemset/status/1/problem/C)
[2A](http://codeforces.me/problemset/status/2/problem/A) [2B](http://codeforces.me/problemset/status/2/problem/B) [2C](http://codeforces.me/problemset/status/2/problem/C)
[3A](http://codeforces.me/problemset/status/3/problem/A) [3B](http://codeforces.me/problemset/status/3/problem/B) [3C](http://codeforces.me/problemset/status/3/problem/C) [3D](http://codeforces.me/problemset/status/3/problem/D)
[4A](http://codeforces.me/problemset/status/4/problem/A) [4B](http://codeforces.me/problemset/status/4/problem/B) [4C](http://codeforces.me/problemset/status/4/problem/C) [4D](http://codeforces.me/problemset/status/4/problem/D)...
/problemset/status/242/problem/A)
[242B](http://codeforces.me/problemset/status/242/problem/B) [242C](http, [242A](http://codeforces.me/problemset/status/242/problem/A)
[242B](http://codeforces.com
13.
Подготовься к респе::итоги первой недели Привет, Codeforces!
Подошла к концу первая неделя челленджа. Время подвести её итоги. Неделя получилась очень насыщенной, поэтому думаю, что пост получится достаточно длинным.
Суббота, 12/02: с утра написал отбор на городскую олимпиаду, ничего интересного. Вечером написал [contest:1637], написал очень плохо, не решил C, хотя это была очень простая задача. Очень понравилась D с этого контеста, нужно было сделать достаточно красивое преобразование формул, а потом решать рюкзаком.
Оффтоп: начал замечать, что в последнее время много рюкзака стало. На ИОИП, на Global round, на Div. 2.
Дорешивание: [<font style="color:#006400">C. Андрей и камни</font>](https://codeforces.me/contest/1637/problem/C), [<font style="color:#FFA500">D. Очередная задача на минимизацию</style>](https://codeforces.me/contest/1637/problem/D), [<font style="color:#8B0000">E. Лучшая пара</style>](https://codeforces.me/contest/1637/problem/E).
Воскресенье, 13/02: Решал второй отборочный тур ИОИП. Напис...
:#006400"> E. XOR на отрезке](https://codeforces.me/contest/242/problem/E)
напомнила своей идеей, ="color:#006400"> E. XOR на отрезке](https://codeforces.me/contest/242
/problem/E) напомнила своей
14.
COderfocers Codeforces
| In English По-русски
pathetique | Logout
HOMETOPCATALOGCONTESTSGYMPROBLEMSETGROUPSRATINGEDUAPICALENDARHELP
→ Pay attention
Before contest
Codeforces Global Round 26
3 days
Register now »
*has extra registration
→ pathetique
pathetique
User''s contest rating in Codeforces communityRating: 1448
User''s contribution into Codeforces communityContribution: -77
Settings
Blog
Favourites
Teams
Submissions
Problemsetting
Groups
Talks
Contests
→ Top rated
# User Rating
1 tourist 3757
2 jiangly 3647
3 Benq 3581
4 orzdevinwang 3570
5 Geothermal 3569
5 cnnfls_csy 3569
7 Radewoosh 3509
8 ecnerwala 3486
9 jqdai0815 3474
10 gyh20 3447
Countries | Cities | Organizations View all →
→ Top contributors
# User Contrib.
1 maomao90 171
2 awoo 164
3 adamant 163
4 TheScrasse 159
5 maroonrk 155
6 nor 154
7 -is-this-fft- 152
8 Petr 147
9 orz 145
10 pajenegod 144
View all →
→ Favourite groups
# Name
1 X-Camp 402H 2022 Fall
View all →
→ Fi...
VladosiyaPublication date 3 weeks agoComments 242 ← 1 2 3 ... 232 233 →, iNNNoPublication date 37 hours agoComments 242 Codeforces Round 950 (Div. 3)
15.
Codeforces Round #217 (Div. 2) Statistics [contest:370] statistics
[cut]
:
<pre>
<code>
-------------------------------------------------------------------------------------------------
| Codeforces Round #217 (Div. 2) |
-------------------------------------------------------------------------------------------------
| | First | Sent | Pretest | Hacked | Systest | Accepted | Attempts | Success | Severity |
| | | | failed | | failed | | | % | |
-------------------------------------------------------------------------------------------------
| A 500 | 00:03 | 1094 | 44 | 75 | 194 | 781 | 1526 | 51.2 | 1.31 |
| B 500 | 00:09 | 820 | 88 | 2 | 76 | 654 | 1114 | 58.7 | 1.25 |
| C 1500 | 00:27 | 449 | 214 | 2 | 82 | 151 | 1000 | 15.1 | 2.16 |
| D 3000 | 00:38 | 130 | 54 | 1 | 58 | 1...
| 17 | 242 | 7.0 | 1.76 | | E 3000 | 00:53 | 11 | 7 | 0 | 2, | | D 3000 | 00:38 | 130 | 54 | 1 | 58 | 17 | 242 | 7.0 | 1.76
16.
Main test for problem C2 is not strong enough (For codeforces global round 5.)
There are some users who submit the same code for C1 and C2, but get main test failed for C1 and passed for C2.
This JavaScript code shows that there are 12 users who passed C1 and failed C2: (run this in the developer console on a Codeforces page)
<spoiler summary="Code">
```js
function sleep(ms){
return new Promise(function(resolve,reject){
setTimeout(resolve,ms)
})
}
async function custom_test(source,programTypeId,input){
// There's no official API
// adapt from CF customtest js code
const data=await $.post('/data/customtest',{
csrf_token: Codeforces.getCsrfToken(),
source: source,
sourceCode: source,
tabSize: 4,
programTypeId: programTypeId,
input: input,
output: '', // not
_tta: 510, // ?
communityCode: '',
action: 'submitSourceCode',
})
while(true){
sleep(2500)
const response=await $.post("/data/customtest", {
communityCode: "",
action: "getVerdict",
customTestSubmit...
one by user Simon ([rank 242
](https://codeforces.me/contest/1237/standings/participant/29043085, that there's at least one by user Simon ([rank 242
](https://codeforces.me/contest/1237/standings
17.
Counterexample to IOI Sphinx model code So I was trying to upsolve IOI 2024 Q6 Sphinx. In the editorial phase 2 states to split the condensed graph into two sets, and perform binary search on these sets for every colour, to determine which components have what colour. However, each binary search needs $\log N\approx8$ queries to perform the actual binary search, along with an additional query to "confirm" that no other component in the set has that colour. Along with the rest of the solution, this gives a query count of $3N+a+N\log N$, where $a$ is the number of monochromatic components. This means that, in the worst case, the solution would take $4N+N\log N$, which is up to $3000$ queries, more than is allowed in the problem. At first, I thought that there would be some amortisation which keeps the query count under the limit of $2750$ queries, but then I made the following construction:
Consider the test case with $N=250$ vertices, all with different colours. Then, the graph is constructed by taking the first 248 vertic...
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 248 0 249 0 248 1
249 1 248 2 249, 239 240 241 242 243 244 245 246 247 248 249 248 0 249 0 248 1 249 1 248 2 249
2 248 3 249 3
18.
Some nice questions for beginners learning new stuffs (will be adding more in time) _Although I'm too a beginner but I try to learn new things everyday, so here are the questions on DS which beginners like me find hard but are too easy if learned the DS nicely._
## Arrays
| Index | Problem | Prerequisite |
| --- | --- | --- |
| 1 | [Maximum circular subarray sum](https://practice.geeksforgeeks.org/problems/max-circular-subarray-sum/0) | Kadane's Algorithm |
| 2 | [Find subarray with given sum](https://practice.geeksforgeeks.org/problems/subarray-with-given-sum/0) | Hashing |
| 3 | [Equilibrium index of an array](https://practice.geeksforgeeks.org/problems/equilibrium-point/0) | None |
| 4 | [Maximum Sum Increasing Subsequence](https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence/0) | Simple DP |
| 5 | [K-Concatenation](https://www.codechef.com/problems/KCON) | Kadane's Algorithm |
| 6 | [Convert array into Zig-Zag fashion](https://practice.geeksforgeeks.org/problems/convert-array-into-zig-zag-fashion/0) | None |
| 7 | [Find...
/) |BFS| | 11| [Jump Game VII](https://leetcode.com/contest/weekly-contest-242
/problems/jump-game-vii
19.
[COPS Screencast] CF Round #747 (Div2) Hello Codeforces!
I'm Jatin, a member of COPS IIT(BHU). I attempted a screen-cast of Codeforces Round #747 (DIV. 2) followed by a short discussion of the solutions to problems. I managed to solve the first 6 problems (A — E2) and got 242 overall rank.
Video:[Screencast](https://youtu.be/49qLb5FqOOk)
Do subscribe to our channel and share the content if you find it helpful. As always, feel free to comment below.
Thanks for reading and see you in the next contest!
(A — E2) and got 242 overall rank.
20.
Codeforces rating deflation <div align="right">
<table>
<tr>
<td align="left"><em>
— You know what they call an International Grandmaster in 2026?<br>
— They don't call it an International Grandmaster?<br>
— No, man, they got the AI there, they wouldn't know what International Grandmaster is.<br>
— What'd they call it?<br>
— They call it International Master.
</em></td>
</tr>
</table>
</div>
### Introduction
There was a heated discussion recently, and I decided to quantify the rating deflation over the recent 1.5 years.
After accounting for natural improvement, I found roughly 150-190 rating points of deflation. The following is the rating gap between AI period and pre-AI period.
### Background
- We need to estimate the recent rating dynamics and compare it with pre-AI dynamics.
- Participants have natural improvement when they train, especially lower rated...
| -123 | 73 | | Caceres.Nikita | Russia | 1656 | 1898 | +242 | 18 | |
Petricore | Italy | 1670 | 1572, | 73 | | Caceres.Nikita | Russia | 1656 | 1898 | +242 | 18 | | Petricore |
Italy | 1670 | 1572, | Antarctica | 1768 | 2155 | +387 | 13 | | Fu_L | Japan | 1893 | 2135 | +242 |
15 | | bugdone
21.
Республиканская Олимпиада по информатике 2023 [2022](https://codeforces.me/blog/entry/102044)
[2021](https://codeforces.me/blog/entry/90111)
[2020](https://codeforces.me/blog/entry/80808)
[2019](https://respa.daryn.kz/)
[2018](https://codeforces.me/blog/entry/58432)
[2017](https://codeforces.me/blog/entry/51416)
**9 класс**
| *Место* | *ФИО* | *CF handle* | *Балл* | *Медаль*|
|----------|----------|----------|
| 1 | Иса Ахмет | [user:Issa,2023-03-23] | 388 | |
| 2 | Мамадахунов Мансур | [user:Wansur,2023-03-23] | 374 | |
| 3 | Асланов Амир | [user:Aslanov,2023-03-23] | 330 | |
| 4 | Серазитдинов Назар | [user:Otalp,2023-03-23]| 316 |...
-23] | 242 | | | 6 | Казтаев Алишер |
[user:kaztaev,2023-03-23] |242
22.
Who is the most popular? Looks like noone has already done this. Here is top100 of the most popular users on the codeforces.
(the list contains only users from top200 by rating or top200 by contribution)
| # | User | Followers |
| --- | --- | --- |
| 1 | [user:tourist,2015-10-18] | 4721 |
| 2 | [user:Petr,2015-10-18] | 2351 |
| 3 | [user:rng_58,2015-10-18] | 1472 |
| 4 | [user:WJMZBMR,2015-10-18] | 1431 |
| 5 | [user:Egor,2015-10-18] | 974 |
| 6 | [user:ahmed_aly,2015-10-18] | 886 |
| 7 | [user:xiaodao,2015-10-18] | 825 |
| 8 | [user:I_love_Tanya_Romanova,2015-10-18] | 797 |
| 9 | [user:ACRush,2015-10-18] | 790 |
| 10 | [user:dreamoon,2015-10-18] | 786 |
| 11 | [user:yeputons,2015-10-18] | 709 |
| 12 | [user:ftiasch,2015-10-18] | 659 |
| 13 | [user:niyaznigmatul,2015-10-18] | 655 |
| 14 | [user:adurysk,2015-10-18] | 617 |
| 15 | [user:scott_wu,2015-10-18] | 615 |
| 16 | [user:sevenkplus,2015-10-18] | 569 |
| 17 | [user:cgy4ever,2015-10-18] | 527 |
| 18 | [user:PrinceOfPersia,2015-10-18...
| | 60 | [user:ikbal,2015-10-18] | 245 | | 61 |
[user:kien_coi_1997,2015-10-18] |242 | | 62, -18] | 245 | | 60 | [user:ikbal,2015-10-18] | 245 | | 61 |
[user:kien_coi_1997,2015-10-18] |242
23.
Республиканская олимпиада 2026 года. Казахcтан. Результаты. <spoiler summary="Результаты прошлых лет">
[2025](https://codeforces.me/blog/entry/140577)
[2024](https://codeforces.me/blog/entry/127605)
[2023](https://codeforces.me/blog/entry/114266)
[2022](https://codeforces.me/blog/entry/102044)
[2021](https://codeforces.me/blog/entry/90111)
[2020](https://codeforces.me/blog/entry/80808)
[2019](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2019)
[2018](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2018)
[2017](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2017)
</spoiler>
#### **9 класс**
| **Место** | **ФИО** | **CF handle** | **1 тур** | **2 тур** | **Общий** | **Медаль** |
|---|---|---|
| 1 | Бауыржан Шөкей | [user:Shad_29, 2025-08-27] | 234 | 143 | 377 |  |
| 2 | Алишер Еламан | [user:Alish_1_2100,2026-03-22] | 203 | 135 | 338 |  | | 14 | Нұрислам Қуанышбек | [user:WhiplashX,2026-03-22] | 168 | 74 | 242|
.
- The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
- The best 20 participants over all series get sweatshirts and place certificates.
Current standings after four rounds:
| Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 |
| - | - | - | - | - | - | - |
| 1 | [user:tourist,2019-07-21] | 241...
| 0 | | 239 | [user:lawfung,2019-07-21] | 24 | 0 | 0 | 0 | 24 | | 242 |
[user:athin,2019-07-21, -07-21] | 24 | 0 | 0 | 0 | 24 | | 242 | [user:athin,2019-07-21] | 22 | 0 | 22 |
0 | 0 | |242
25.
Segment Tree Problems I gathered up a lot of Segment problems :) -->
**upd1** : more segment :D
**upd2** : now there is e-olymp problems. thanks to [user:dmkozyrev,2019-12-06].
codeforces :
[Xenia and Bit Operations](http://codeforces.me/problemset/problem/339/D)
[Knight Tournament](https://codeforces.me/contest/356/problem/A)
[Bash and a Tough Math Puzzle](https://codeforces.me/problemset/problem/914/D)
[Pashmak and Parmida's problem](https://codeforces.me/contest/459/problem/D)
[Enemy is weak](https://codeforces.me/contest/61/problem/E)
[Circular RMQ](https://codeforces.me/contest/52/problem/C)
[REQ](https://codeforces.me/contest/594/problem/D)
[Lucky Queries](https://codeforces.me/contest/145/problem/E)
[XOR on Segment](http://codeforces.me/problemset/problem/242/E)
[Sereja and Brackets](http://codeforces.me/problemset/problem/380/C)
[Ant Colony](http://codeforces.me/problemset/problem/474/F)
[Babaei and Birthday Cake](https://codeforces...
/problem/242/E) [Sereja and
Brackets](http://codeforces.me/problemset/problem/380/C) [Ant, ](http://codeforces.me/problemset/problem/242/E) [Sereja and
Brackets](http://codeforces.com
26.
Codeforces Global Rounds 2020: Current Results (GR7-GR10) In 2020 (as in 2019), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be
common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number
and complexity of the problems. All such rounds will be rated for all participants.
<i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all problem authors and problem testers.</i>
The prizes for the 6-round series in 2020:
- In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT).
- The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
- The best 20 participants over all series get sweatshirts and place certificates.
Current standings after four rounds (sorted by total points in four rounds):
| Place | Contestant | = | GR 7 | GR 8 | GR 9 | GR 10|
|--|--|--|--|--...
| [user:AndreySergunin,2020-08-18] | 27 | — | 27 | — | — | | 242 |
[user:Tweetexas,2020-08, | — | 27 | — | — | | 242 | [user:Tweetexas,2020-08-18] | 26 | — | &mdash
27.
Командные олимпиады 2024: отборы на NEF и ВКОШП <img src="/predownloaded/74/39/74395f0a59b321dba24163d7c163412f9e00a9f4.jpg" align="right" style="height: 250px; margin: 10px 35px 20px;" alt="text"/>
Привет, Codeforces!
Не успели утихнуть эмоции после грандиозного сентябрьского [ICPC WF Astana](https://codeforces.me/blog/entry/134044), как начался очередной сезон командных соревнований по программированию в Северной Евразии. В ближайшие выходные пройдет максимальное количество региональных чемпионатов как у студентов, так и у школьников, за которыми приглашаем следить вместе с нами. В оба дня присоединяйтесь к трансляциям на каналах NERCNews на [YouTube](https://www.youtube.com/nercnews) и в [VK](https://vk.com/nercnews).
#### Northern Eurasia Regional Contests
Одними из первых четвертьфинал провели Азербайджан, Юг и Поволжье, Центральная Россия, и Кыргызстан. **16 и 17 ноября** чемпионаты пройдут в следующих регионах: Armenia, Belarus, East Siberian, Georgia, Kazakhstan, Moscow, Northwestern Russia, Taurida, Ural, Uzbeki...
/">Беларусь 16 ноября Q <https://acm.bsu.by/contests/<B>242</B>/standings/>, > Q <https://acm.bsu.by/contests/<B>242</B>/standings/> Узбекистан 17
28.
Weird Error Spoiler Alert: This is regarding problem D of the latest Codeforces round (242).
Link to problem statement: http://codeforces.me/contest/424/problem/D
I have two solutions, Let's call them sol-1 and sol-2
Link to sol-1: http://codeforces.me/contest/424/submission/6472455
Link to sol-2: http://codeforces.me/contest/424/submission/6472637
In sol-1 I use a struct node
~~~~~
struct node {
int tot, col;
bool operator <(const node &rhs) const {
return tot < rhs.tot;
}
};
~~~~~
In sol-2 I use `std::pair <int, int>` with the necessary changes to the remaining part of the code.
In sol-1 I get TLE on test case 17.
But In sol-2 I get WA on test case 3.
How is that possible?! Can someone please help me out?
**UPD: Found my mistake. Thank you so much [user:igorjan94,2014-04-25] and [user:andreyv,2014-04-25]**
Spoiler Alert: This is regarding problem D of the latest Codeforces round (242
). Link to problem, Spoiler Alert: This is regarding problem D of the latest Codeforces round (242).
29.
naive algorithm 242E - XOR on Segment Hi,
Just take look how I solved [242E — XOR on Segment](http://www.codeforces.com/problemset/problem/242/E)
here is my [code](http://www.codeforces.com/contest/242/submission/2563497)
the time limit for this problem is 4000ms and the running time for my code is 4000ms :) :] :D
/problem/242/E), here is my [code](http://www.codeforces.com/contest/242/submission/2563497)
30.
Результаты Республиканской Олимпиады по Информатике 2025 `
Это результаты республиканской олимпиады по информатике 2025 Kazakhstan
<spoiler summary="Результаты прошлых лет">
[2024](https://codeforces.me/blog/entry/127605)
[2023](https://codeforces.me/blog/entry/114266)
[2022](https://codeforces.me/blog/entry/102044)
[2021](https://codeforces.me/blog/entry/90111)
[2020](https://codeforces.me/blog/entry/80808)
[2019](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2019)
[2018](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2018)
[2017](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2017)
</spoiler>
9 класс
-----------
<table>
<thead> <tr> <th>Место</th> <th>ФИО</th> <th>CF handle</th> <th>1 тур</th> <th>2 тур</th> <th>общий</th> <th>Медаль</th> </tr> </thead>
<tr>
<td> 1 </td> <td> Даужан Бекетов </td> <td> [user:Away_in_the_heavens,2025-03-12] </td> <td> 196 </td> <td> 173 </td> <td> 369 </td> <td> <img alt=" " src="/predownloaded/93/7...
> 242 237 479 , > Мансур Мамадахунов [user:Wansur,2025-03-12] 242 237 479
31.
need help on a dp problem the dp problem:
[stamp](http://jackneus.com/programming-archives/stamps/)
Given a set of N stamp values (e.g., {1 cent, 3 cents}) and an upper limit K to the number of stamps that can fit on an envelope, calculate the largest unbroken list of postages from 1 cent to M cents that can be created.
I try to use dp in the following way, but get wrong on test 9, my method is:
let dp[i][j] be the max value W that can be made from 1 to W, with the condition that we use first i types of coin and at most j coins to make the total value. then anwser is dp[N][K].
~~~~~
for(int i=1;i<=N;i++)for(int j=0;j<=K;j++)
{
long long maxlen=dp[i-1][j];
long long k=1;
while(k<=j){
int next= k * a[i];
if(next>maxlen+1)break;
else{
maxlen=max(maxlen,k*a[i]+dp[i-1][j-k]);
k++;
}
}
dp[i][j]=maxlen;
}
fout<<dp[N][K]<<endl;
~~~~~
it wrong for test case...
15 63 127 } my output is 242,while anwser is 720., is 242,while anwser is 720. I try hard, but I can't figure out why this method
is wrong. Anyone
32.
Непонятное с рейтингом [Решено] <p>На <b>64</b>-ом раунде мне стало что-то непонятно с рейтингом. Почему <a href="http://codeforces.me/profile/fengzlzl">сержант</a>(<b>1451</b>) выше стоящий на раунде чем <a href="http://codeforces.me/profile/waihonhon">майор</a>(<b>1813</b>) поднялся в рейтинге только на +<b>60</b>, а майор в то время поднялся аж на +<b>131</b>. Сержант ведь со второго дивизиона и у него был рейтинг ниже чем у майора, и стоял он на раунде выше.</p><p><strong>UPD</strong><strong>.</strong> Рейтинг был перещитан. Я поднялся :) Кстати, сержант про которого я написал прибавил +<strong>242</strong>, а майор +<strong>143</strong>.</p>
которого я написал прибавил +242, а майор +143., перещитан. Я поднялся :) Кстати, сержант про которого я написал прибавил +242,
а майор
33.
Результаты Республиканской Олимпиады по Информатике 2024 Это результаты республиканской олимпиады по информатике 2024 ([user:Kazakhstan,2024-02-20])
<spoiler summary="Результаты прошлых лет">
[2023](https://codeforces.me/blog/entry/114266)
[2022](https://codeforces.me/blog/entry/102044)
[2021](https://codeforces.me/blog/entry/90111)
[2020](https://codeforces.me/blog/entry/80808)
[2019](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2019)
[2018](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2018)
[2017](https://scoreboard.bc-pf.org/results/informatics/national-olympiad/2017)
</spoiler>
9 класс
-----------
<table>
<thead> <tr> <th>Место</th> <th>ФИО</th> <th>CF handle</th> <th>1 тур</th> <th>2 тур</th> <th>общий</th> <th>Медаль</th> </tr> </thead>
<tr>
<td> 1 </td> <td> Мамадахунов Мансур </td> <td> [user:Wansur,2024-03-26] </td> <td> 282.07 </td> <td> 181 </td> <td> 463.07 </td> <td> <img alt=" " src="/predownloaded/93/73/9373156f429b185ba6bc779f81d16894f9a7...
242
34.
Codeforces Global Rounds 2020: Final Results In 2020, with the support of XTX Markets, 6 rounds of the Codeforces Global Rounds were held.
Each round was common for both divisions. All such rounds were rated for all participants.
At each such round, 50 brand T-shirts were handed out, and we gave T-shirts to all problem writers!
I say a big thank you to XTX Markets (and personally to Yuri Bedny and Alexander Gerko) for supporting Global Rounds.
Without your help, we could not host them!
I sincerely admire companies like these who come to support and develop the community
that some of their employees come from. It will be great if other companies follow the example and
also offer their help. We need it!
The prizes for the 6-round series in 2020:
- In each round, top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT).
- The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
- The best 20 participants over all series get...
; | 45 | — | 16 | — | — | | 242 | [user:s_r_f,2020-12-08] | 60 | — | &mdash
35.
I'm getting WA because of, "Probably, the solution is executed with error uninitiaized value usage" Hi, I am getting the **Probably, the solution is executed with error 'uninitiaized value usage'** error even though I have initialized it with 0 (see, a[0][1]=0 ). I ran the program for the test case 4 on online compilers and I'm getting the expected correct output. I tried it on my system as well and it works fine. I don't understand why am I getting the error. Help me know what I am doing wrong?
Also, this is my first blog post. So I am sorry if I miss something or don't meet the rules.
Link to the solution: https://codeforces.me/contest/242/submission/76415727
Link to the solution: https://codeforces.me/contest/242/submission/76415727
36.
Статистика использования языков программирования на РОИ с 1997 года **Обновление 6 ноября 2019 года:**
Добавлены данные за 2019 год. Полностью исчез Паскаль. Совсем. Ни одного сданного решения.
**Обновление 22 апреля 2018 года:**
Добавлены данные за 2018 год. Принципиально ничего не меняется, очень сильно выросла доля участников, которые пишут и на C++, и на Python. 3/4 участников пишет только на C++, но почти 1/5 участников пишет на С++ и на Python.
**Обновление 1 апреля 2017 года:**
Добавлены данные за 2017 год. Предсказуемо сокращается число участников, пишущих на Pascal, но неожиданно сократилось и число участников, использующих Java. Python по-прежнему остается распространенным вторым языком после C++.
**Обновление 9 апреля 2016 года:**
Добавлены данные за 2016 год. По-прежнему, для каждого участника считается язык, который он преимущественно использовал. Число в скобках — количество людей, которые сдали хотя бы одно решение на этом языке. То есть достаточно мало участников пишет только на Python или преимущественно на Pyth...
aling="CENTER">242 , > 5 (15) 1 (1) 242
37.
Bug in point calculation? Or is this working by design? This happened in Codeforces Round #709 (Div.2)
There were some technical difficulties during the round and the main site was temporarily down. I had a "pretests passed" submission on question 1 at 0:03 mark, but the UI was not updating correctly so I re-submitted the same solution at 1:44 mark. In the end I was awarded 242 points for that problem and only my last submission counted.
https://codeforces.me/contest/1484/standings/participant/111374935#p111374935
so I re-submitted the same solution at 1:44 mark. In the end I was awarded 242
points for that, . In the end I was awarded 242 points for that problem and only my last
submission counted. https
38.
Республиканская олимпиада 2021 года. Казахcтан. Результаты. 2021 : https://codeforces.me/blog/entry/90111
2020 : https://codeforces.me/blog/entry/80808
2019 : https://respa.daryn.kz/
2018 : https://codeforces.me/blog/entry/58432
2017: https://codeforces.me/blog/entry/51416
####9 Класс
<html>
<body>
<style type="text/css">
.tg {border-collapse:collapse;border-spacing:0;}
.tg td{border-color:black;border-style:solid;border-width:1px;font-family:Arial, sans-serif;font-size:14px;
overflow:hidden;padding:10px 5px;word-break:normal;}
.tg th{border-color:black;border-style:solid;border-width:1px;font-family:Arial, sans-serif;font-size:14px;
font-weight:normal;overflow:hidden;padding:10px 5px;word-break:normal;}
.tg .tg-0pky{border-color:inherit;text-align:left;vertical-align:top}
</style>
<table class="tg" style="undefined;table-layout: fixed; width: 579px">
<colgroup>
<col style="width: 50px">
<col style="width: 160px">
<col style="width: 170px">
<col style="width: 97px">
<col style="width: 102px">
</colgroup...
Акарыс 242 , ">242 . Best two contests give the summary score of a participant. This table is unofficial yet. But anyway... congratulations to the winnerzzzz!
| Place | Contestant | = | Round 1 | Round 2 | Round 3|
| - | - | - | - | - |-|
| 1 | [user:mnbvmar,2018-11-25] | 1497 | 1000 | 497 | 29 |
| 2 | [user:V--o_o--V,2018-11-25] | 1281 | 575 | 575 | 706 |
| 3 | [user:Radewoosh,2018-11-25] | 1265 | — | 265 | 1000 |
| 4 | [user:aid,2018-11-25] | 1204 | 204 | 1000 | 142 |
| 5 | [user:LHiC,2018-11-25] | 1203 | 497 | 706 | 226 |
| 6 | [user:Um_nik,2018-11-25] | 997 | 706 | 291 | 235 |
| 7 | [user:ksun48,2018-11-25] | 788 | 291 | — | 497 |
| 8 | [user:SpyCheese,2018-11-25] | 742 | 371 | 371 | 265 |
| 9 | [user:RAVEman,2018-11-25] | 619 | 19 | 176 | 443 |
| 10 | [user:scott_wu,2018-11-25] | 614...
| [user:Fedosik,2018-11-25] | 242 | — | 135 | 107 | | 51 |
[user:sevenkplus,2018-11-25] | 236 | &mdash, | — | | 50 | [user:Fedosik,2018-11-25] | 242 | — | 135 | 107 | | 51 |
[user:sevenkplus
41.
NEED HELP IN CODEFORCES GRAPH PROBLEM Hey i was trying to solve King's Path on codeforces http://codeforces.me/problemset/problem/242/C
but i am getting wrong answer on test 10;
my code:
http://codeforces.me/contest/242/submission/14186492
Can anyone point my mistake?
Thanks.
Hey i was trying to solve King's Path on codeforces
http://codeforces.me/problemset/problem/242/C
42.
Codeforces rating distribution over time I was curious about rating inflation, so I generated a json object containing counts and percentiles and some plots of codeforces rating distribution over months, only counting active contestants:
<spoiler summary="Json object">
```
{
"2015-01-01": {
"Active": {
"count": 21827,
"percentile": 0.0
},
"Expert+": {
"count": 6763,
"percentile": 69.01543959316443
},
"CM+": {
"count": 1778,
"percentile": 91.85412562422688
},
"M+": {
"count": 724,
"percentile": 96.68300728455583
},
"IM+": {
"count": 236,
"percentile": 98.91877033032483
},
"GM+": {
"count": 124,
"percentile": 99.43189627525541
},
"IGM+": {
"count": 21,
"percentile": 99.90378888532551
},
"LGM": {
...
": 98.86536936497285 }, "GM+": { "count": 242
43.
TLE! http://codeforces.me/contest/242/submission/39896396
why my soltion gives TLE while other solution with same approach got accepted Can anyone help me out .Please Don't Downvote i already got -23 Contributions.
UpD:with use of treemap it got accepted but with AbstractMap.SimpleEntry it get tle is it bcz of bad hash function implemented in AbstrtactMap.SimpleEntry ?
http://codeforces.me/contest/242/submission/39896396 why my soltion gives TLE
while other
44.
IOI 2025 Ranking Prediction Hello Codeforces!
Less than a week to IOI 2025! I used accounts from [this blog](https://codeforces.me/blog/entry/142475) and made the **prediction** for the IOI 2025 ranking. Ratings are calculated based on the average of the current rating and the maximum rating.
[cut]
<table width="100%">
<thead>
<tr>
<th>
Predicted Rank
</th>
<th>
Actual Rank
</th>
<th>
CF handle
</th>
<th>
Name
</th>
<th>
Country
</th>
<th>
Rating
</th>
<th>
Predicted Award
</th>
<th>
Actual Award
</th>
</tr>
</thead>
<tbody>
<tr style="background-color:#FFEE55;">
<td>
1
</td>
<td>
</td>
<td>
[user:JoesSR,2025-07-25]
</td>
<td>
</td>
<td>
🇨🇳 China
</td>
<td>
3163.0
</td>
<td>
🥇 Gold
</td>
<td>
</td>
</tr>
<tr style="background-color:#FFEE55;">
<td>
2
</t...
242 [user:0gur4ik,2025-07-25]
45.
Help with square root decomposition How to solve http://codeforces.me/contest/242/problem/E problem with square root decompositatio?
How to solve http://codeforces.me/contest/242/problem/E problem with square
root decompositatio?
46.
Teams going to Gwalior/Pune Regionals **UPDATE:**
I've uploaded the code that I used to generate this on Github, in case someone needs to generate something similar:
[Codeforces Team Rating Calculator](https://github.com/abdullah768/Codeforces-Team-Rating-Calculator)
The regional round has ended and here's the final Ranklist:
https://www.codechef.com/public/rankings/ACM18GWR
Inspired by the list of teams going to Kharagpur regionals, I decided to make one for Gwalior/Pune regionals. The list contains all the teams from the official Gwalior website. If you know the usernames of members of any of the teams. Please update the excel file:
### [HERE]
(https://docs.google.com/spreadsheets/d/1jRvwzQzp1DOcazgI7jXBB8uY3u7Ze_eQ77Xa75_Q810/edit?usp=sharing)
Team rating calculation has been done according to the official Codeforces team rating calculation formula.
The table will be updated with details from the excel file every 6 hours or so.
Last Updated: 10 pm, 12th December IST
| No. | AIR | Team Name ...
| 242
47.
Республиканская олимпиада 2018 года. Казахcтан. Результаты. Результаты республиканской олимпиады 2018 года (Казахстан). Это не весь список, полную версию вы можете посмотреть здесь
<br>
[Результаты](http://sportprog.io/).
<br>
Про результаты прошлого года можете почитать [здесь](http://codeforces.me/blog/entry/51416)
<br>
Если есть ошибки или вопросы обращайтесь в лс.
<br> <br>
9 класс
<br>
<style type="text/css">
.tg {border-collapse:collapse;border-spacing:0;}
.tg td{font-family:Arial, sans-serif;font-size:14px;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
.tg th{font-family:Arial, sans-serif;font-size:14px;font-weight:normal;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
.tg .tg-yw4l{vertical-align:top}
</style>
<table class="tg">
<tr>
<th class="tg-yw4l">Место</th>
<th class="tg-yw4l">Имя</th>
<th class="tg-yw4l">Область</th>
<th class="tg-yw4l">1 тур</th>
<th class="tg-yw4l">2 тур</th>
<th class="tg-yw4l...
-yw4l">242 , -yw4l">29 213 242
48.
Поправочные коэффициенты и инфляция рейтинга <P>Результат последнего контеста оказался для меня довольно неожиданным, поэтому я решил собрать немного больше информации о возможностях изменения рейтинга CF. Если профиль участника позволяет наблюдать историю изменения его рейтинга, то у меня получились "профили контестов", в которых отражены рост или падение каждого участника конкретного соревнования.<BR>[cut]<BR><A href="http://codeforces.me/blog/entry/102">Формула расчёта рейтинга Codeforces</A> подразумевает сохранение суммы очков всех участников до и после раунда за счёт поправочных коэффициентов. На основании же обработанной мной информации получилась такая табличка:</P>
<TABLE style="WIDTH: 100%" border=1>
<TBODY>
<COLGROUP>
<COL width="20%">
<COL width="20%">
<COL width="20%">
<COL width="20%">
<COL width="20%">
<TBODY>
<TR>
<TD>ID контеста</TD>
<TD>Суммарный рейтинг до соревнования</TD>
<TD>Суммарный рейтинг после соревнования</TD>
<TD>Разность конечного и исходного суммарных рейтингов</TD>
<TD>Коли...
/22/standings">242 23 <http://codeforces.me/contest/23> , 242 <http://codeforces.me/contest/22/standings>
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/19/2026 18:34:02 (g2).
Desktop version, switch to mobile version.
Supported by
