Codeforces Round #760 (Div. 3) Editorial [problem:1618A] Idea: [user:Brovko,2021-12-14], preparation: [user:Brovko,2021-12-14] <spoiler summary="Tutorial"> [tutorial:1618A] </spoiler> <spoiler summary="Solution (Brovko)"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; for(int i = 0; i < t; i++) { vector <int> b(7); for(int i = 0; i < 7; i++) cin >> b[i]; cout << b[0] << ' ' << b[1] << ' ' << b[6] - b[0] - b[1] << endl; } } ~~~~~ </spoiler> [problem:1618B] Idea: [user:BledDest,2021-12-14], preparation: [user:awoo,2021-12-14] <spoiler summary="Tutorial"> [tutorial:1618B] </spoiler> <spoiler summary="Solution (awoo)"> ~~~~~ for _ in range(int(input())): n = int(input()) s = input().split() for i in range(n - 3): if s[i][1] != s[i + 1][0]: s.insert(i + 1, s[i][1] + s[i + 1][0]) break else: ...

Full text and comments »

Codeforces Round #823 (Div. 2) Hello, Codeforces! We invite you to [contest:1730] which will be held on [contest_time:1730]. You will be given **2 hours** to solve **6 problems**. The problems were invented and prepared by [user:shnirelman,2022-09-24], [user:Lankin,2022-09-24] and me. We would like to thank: - [user:isaf27,2022-09-24] for coordinating the round. - [user:KAN,2022-09-24] for the help during preparation of the contest. - [user:kevinxiehk,2022-09-24], [user:74TrAkToR,2022-09-24], [user:Aleks5d,2022-09-24], [user:cadmiumky,2022-09-24], [user:satyam_343,2022-09-24], [user:gothic_kobra,2022-09-24], [user:NikitaSemenov,2022-09-24], [user:tibinyte,2022-09-24] for testing the round. - [user:MikeMirzayanov,2022-09-24] for Codeforces and Polygon. Wish you good luck and high rating! The scoring distribution will be announced closer to the beginning of the round. **UPD**: Scoring distribution: **500 &mdash; 1000 &mdash; 1500 &mdash; 2250 &mdash; 2250 &mdash; 3000**. **UPD2**: Edit...

Full text and comments »

Codeforces rating deflation <div align="right"> <table> <tr> <td align="left"><em> &mdash; You know what they call an International Grandmaster in 2026?<br> &mdash; They don't call it an International Grandmaster?<br> &mdash; No, man, they got the AI there, they wouldn't know what International Grandmaster is.<br> &mdash; What'd they call it?<br> &mdash; 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...

Full text and comments »

codeforces Codeforces | In English По-русски pathetique | Logout HOMETOPCATALOGCONTESTSGYMPROBLEMSETGROUPSRATINGEDUAPICALENDARHELP → Pay attention Before contest Educational Codeforces Round 162 (Rated for Div. 2) 2 days Register now » → pathetique pathetique User''s contest rating in Codeforces communityRating: 1448 User''s contribution into Codeforces communityContribution: -61 Settings Blog Favourites Teams Submissions Problemsetting Groups Talks Contests → Top rated # User Rating 1 jiangly 3678 2 Benq 3602 3 ecnerwala 3542 4 maroonrk 3541 5 cnnfls_csy 3540 6 orzdevinwang 3493 7 inaFSTream 3478 8 Um_nik 3430 9 Geothermal 3409 9 Rebelz 3409 Countries | Cities | Organizations View all → → Top contributors # User Contrib. 1 maomao90 174 2 adamant 164 3 TheScrasse 161 3 SecondThread 161 3 awoo 161 6 nor 159 7 maroonrk 158 8 Um_nik 156 9 BledDest 145 9 Geothermal 145 View all → → Favourite groups # Name 1 X-Camp 402H 2022 Fall View all → ...

Full text and comments »

Codeforces False Plagiarism Matching for 1619A Hi all, I got a plagiarism match for my solution to problem [1619A](https://codeforces.me/problemset/problem/1619/A) (Round 762, Div.3). Here is my solution: [140025309](https://codeforces.me/contest/1619/submission/140025309) And here is the other guy ([Jaggar_2021](https://codeforces.me/profile/Jaggar_2021))'s code: [140079029](https://codeforces.me/contest/1619/submission/140079029) I don't know the other person and I have never seen his account before. This was our conversation after the false plagiarism detection:  I agree that the code is somewhat similar, but the problem was very easy (Div.3 A) and my solution simply involved breaking the original string in half (if the length was a multiple of 2) and comparing the two halves. This was the approach that most people would have thought of. Also my code has slight differences, like I have used one more else block and I have used a typedef ...

Full text and comments »

Codeforces Round #823 — editorial [tutorial:1730A] Jury solution: [submission:173498496] [tutorial:1730B] binary search: [submission:173497901] classic: [submission:173497940] [tutorial:1730C] Jury solution: [submission:173498569] [tutorial:1730D] Jury solution: [submission:173498668] [tutorial:1730E] Jury solution: [submission:173498009] [tutorial:1730F] Jury solution: [submission:173498327]

Full text and comments »

Teams going to ICPC WF 2023 (Egypt 2023, 2nd final) — WIP List Hi again! As we decided in [the other blog](https://codeforces.me/blog/entry/116946), let's have two differents lists, one per WF that will be held on Egypt. We'll fill this post with teams of **THE SECOND WF** in Egypt, assuming that those are the qualified from Regionals 2022/2023. Please add a comment with your team information and I will add it to the post. Info preferred: **{Handles on CF (otherwise, real name), Region, Country, University}** If you see some mistake on the teams, any kind of correction would be appreciated, also if you see here a team that belongs to the other post (or viceversa), let me know. </table> # Top 15 Over-All <table><thead><tr><th>Rank</th> <th>Country/Region</th><th>University</th> <th>Member1</th> <th>Member2</th> <th>Member3</th> <th>Rating</th></tr> </thead> <tr><td>1</td><td>Japan</td><td>&#129353; Tokyo Institute of Technology</td><td>[user:potato167,2024-05-01]</td><td>[user:tatyam,2024-05-01]</td><td>[user:noshi91,2024-05-...

Full text and comments »