Hello Codeforces, as I come with new life experience and a new view to life, I am yet again making an AMA!
Waiting for your questions,
I would like to thank alinp for inspiration. See you at EJOI in Moldova, my lands.
Marinush
Hello Codeforces, as I come with new life experience and a new view to life, I am yet again making an AMA!
Waiting for your questions,
I would like to thank alinp for inspiration. See you at EJOI in Moldova, my lands.
Marinush
A few days ago, the team selection of Türkiye was completed after a glorious and intense battle. Since no one has posted a blog for the IOI teams yet, I have taken up the responsibility this year. Here is the IOI team of Türkiye:
Cengiz Eray Aslan (erray) — 3rd time at IOI, 0 attempts left
Berke İnan Tol (tolbi) — 2nd time at IOI, 0 attempts left
Duru Özer (Weobe) — 1st time at IOI, 0 attempts left
Noyan Cantürk (Nummer_64) — 1st time at IOI, 3 attempts left
I wish the best of luck to all the participants. If you could kindly let me know the members of your team in the comments, I will be happy to update the list of participating teams. Good luck, and see you there!
Country | Members | |||
---|---|---|---|---|
Türkiye | erray | tolbi | Weobe | Nummer_64 |
Azerbaijan | fuad720 | Huseyn123 | dmraykhan | Tahirliyev |
Brazil | _rey | LoboLobo | Lalic | clarinha |
Kyrgyzstan | yanb0 | Alihan_8 | Relice | Baytoro |
Iran | ParsaDox | Dorost | AmirAli-Asgari | amirhoseinfar1385 |
Kazakhstan | shenfe1 | MnTm | Issa | Tima5 |
Argentina | Edu175 | biank | SpecterByte | FabriATK |
China | orzdevinwang | Kubic | MagicalFlower | PubabaOnO |
Cuba | CTB220406 | Marco_Escandon | Maite_Morales | SN0WM4N |
South Korea | Mingyu331 | heeew | mickeyjung | kes0716 |
Italy | BestCrazyNoob | franv | jamesbamber | AlesL0 |
Spain | Esomer | Dalek_of_Rivia | danx | Hectorungo_18 |
United Kingdom | Hanksburger | sammyuri | Boomyday12343 | anango |
Hi. NAC (ICPC's North America Championship) is in less than two weeks. We've done absolutely fucking nothing for it. So, what better way to get in shape than public humiliation?
Our team — Shayan, sam571128, and me — will stream (on Shayan's channel) a form of head-to-head duel against each other. For now, it will be on something like 1400's. If this turns out to be fun, we may do more of these streams, on harder problems (maybe up to 3000). It will tentatively start on Thursday, 9 AM ET (you'll also see it on the stream sidebar sometime soon) and will run for however long it takes me to have a winning score.
Tentatively, the format will be the simple idea of choosing a large set of problems and racing to finish it/solve the most in a fixed amount of time. We'll say that we can't look at each others' profiles or submissions. We can tell each other how many we've solved (we'll be in person together). Lying will be allowed (and encouraged). If you have a more interesting idea, let us know.
This is far from the best form of practice, but it's at least fun, so why not? There's some symbolism here — Shayan is a relatively new youtuber, and I'm a dinosaur, so this is in some sense a battle of the generations. That, or, it's not that deep. Either way, look forward to it. There will be plenty of banter involved, probably. Also maybe a bet for some amount of $.
Feel free to try to predict who will win. Wrong answers will be reported for "False information/Misinformation". Good luck.
Hello sirs, you might know that Boost has a dynamically sized bitset class, but did you know that GCC also has one? Turns out it's included in the tr2 folder. You can simply include the <tr2/dynamic_bitset>
header, and use it as std::tr2::dynamic_bitset
. Yes, it works on Codeforces.
Here's a code example to count triangles in a graph (abc258_g):
In some problems, we might not be able to use a constant sized bitset. For example, on 1856E2 - PermuTree (hard version). Here's a submission where we replaced neal's custom_bitset template with using custom_bitset = tr2::dynamic_bitset<>;
, and got accepted with little performance difference (260853192, original 217308610).
The implementation of the bitset seems identical to a version of Boost's dynamic bitset, so you can read the docs here. You can view the source here.
Comparing to std::bitset, here are some notable things I saw:
Of course, it also has all the normal std::bitset functionality. However, I'm not sure how fast this is compared to std::bitset; you can let me know in the comments. Interestingly, it seems to be using 64 bit integers on Codeforces.
If you enjoyed this blog, please make sure to like and subscribe for more bitset content.
Thanks qmk for helping with the blog.
Hi, around 3 years ago I compiled most of the Competitive Programming topics in one place here with relevant resources, templates, and problems. It got great responses, it now has 4000+ upvotes and the blog website has been visited 200k+ times! But it contained links to only 1-2 resources and problems per topic and it didn’t contain basic topics for beginners. Also, there was no way of tracking your progress.
This time I decided to improve it, by a lot. I took this project one month ago and it took me on average 6h-10h per day for the last one month to complete this project (also I was doing a full-time job). I hope it was worth it!
The new version is not just a blog, it is a full-fledged website with multiple features (I have hosted it on one of my existing websites):
Link to the website: smash me
To know how to follow the topic list visit the guideline page on the website. Also, keep in mind that while this list is a good place for knowing which topics exist and the resources and problems for them, you should not always do topic-wise practice. From time to time, you should solve random problems and do rating-wise practice. And of course please always participate in live contests.
Upcoming Features:
I am pretty sure there are some inconsistencies and bugs in the website and the collected problems. Feel free to let me know about those and I will try to fix them ASAP.
A few last words: I have been doing this CP thing for around 7 years now! I will mostly retire after the next World Finals (hopefully, as we became 3rd in the last Asia West Championship). Like before, all I want to say is, please don't forget to enjoy the journey and have fun while riding the boat. Whatever you do, try to pick something you love and try to be good at that. I hope my little contribution will help you with your incredible journey.
Best wishes, my friend .
I waited for the "EJOI 2024 Teams" post for a few days, but no one did it.
So, you can share EJOI 2024 team of your country.
Country | P1 | P2 | P3 | P4 |
---|---|---|---|---|
Azerbaijan | coolboy19521 | Hasanv | suleymancakir | Hugs-From_adicto |
Türkiye | efex12 | tte0 | PieArmy | meLearnCode |
Macedonia | ZeoCool | EntityPlantt | mkkkkkkkk | Alexander the Great |
Armenia | tigranmatsak_9 | KIRAKOSYAN | vahagng | aren_dance |
[PS1] sad-fact : Fikrat_Asadzadeh is my beloved friend that is winner in hearts. ❤️
This year's Asia-Pacific Informatics Olympiad (APIO) will take place on the 18-th of May.
For those who don't know about APIO, it's an IOI-style competition with 3 tasks and 5 hours and it serves as one of the main team selection tests for IOI 2024 for most of the participating countries. You can find more on apio2024.org
Let's discuss problems/cutoffs/results here in the comments after the contest (and the mirror, if there's any) ends.
Looking forward to a great contest!
I waited for more than a year to write this blog.
I started CP in July 2017, I always dreamed about reaching red, and it finally happened. I didn't become red like talented contestants in 1-2 years, but it took me more than that.
The start of my CP journey was average (you can see my graph); It took me more than six months to reach pupil, then another six months to get specialist, and it took me more time to achieve higher ranks. I didn't have any mentor or coach. So, I asked many stupid questions, which you can find if you read my old blogs. One of these questions is, "What's the importance of Dynamic Programming?" (I drafted this blog xD), But of course, I don't motivate people to ask these types of questions as they usually can be answered by just searching.
I failed many times during my journey in CP, especially in important competitions (IOI21 and IOI22). I stopped CP many times because I was frustrated and believed I could never improve. For example, I stopped when I was a pupil because I was frustrated that I would never be a stable specialist, but then I returned to CP and decided to try again.
I want people who are stuck in the newbie or higher ranges for much time to know that if you are stuck for a long time in your rating range, it doesn't mean you can't reach higher ranks. It's normal to be stuck for some time in your rating range. What's wrong is comparing yourself with your peers, as everyone starts with a different problem-solving background.
I wrote this blog to show people that no matter how many times you fail or how much time you're stuck in your rating range, there's a light at the end of the tunnel if you keep practising. It's okay to fail many times and to have time before improvement. Don't get frustrated because of some bad contest results. Instead, Analyze what's wrong in your training and fix it. Lastly, I want to show that red isn't impossible and anyone can reach red with enough practice.
FINALLY I AM SPECIALIST !!!
I have been doing Competitive programming for nearly 4 years now, I achieved many wins in national competitions and other Platforms but somehow Codeforces was my weak point, I've been stuck in newbie rating for longer than anyone could imagine (even after attending 60+ contests).
If you can take a look at my rating graph, you will notice a huge gap, that is when I stopped doing Codeforces because at some point I decided that it's not for me, I was starting to be good at solving Div.2 A-B in 15 minutes but I keep messing up Problem C even with 1H 30 minutes of solving it. At first I thought it was a knowledge issue so I started working on my algos and DP, that helped me get better in national contests and technical interviews, but not Div.2 C. At that point I stopped attending contests due to me hitting the rock bottom saying that I will never get better.
After a while, I started remembering how couldn't even get to PUPIL rating and I couldn't even get a single Accepted verdict on simple problems but now Alhamdolilah I can solve them in a matter of seconds, that made me rethink what could be the issue in the famous problem C.
After starting again, attending many contests and hitting the 100 mark (yes 100 contests and still not Expert lol) I started to notice a pattern: I always start solving problem C with the mindset that it's impossible for me to even think of the idea. Now, fixing a bad mindset is harder than training to solve problems, I can now solve up to 1800 rating problems but not in the contest, heck I can even solve them in 30 mins which is an EXPERT level, but I can not do that while being in the contest. Luckily, as problem solvers we know that one step of solving the problem is knowing what it is about, now I know what was my issue, and I am starting to fix it.
I decided to write this very long text to say to all people who are stuck in PUPIL, or even NEWBIE: Don't look at other people's ratings, you can find a lot of them starting after you and getting to specialist and expert, that does not prove anything, people are different, but at some point, you will get your blue color, that is now my mindset, even if it takes 4 more years, I will get it.
Have a nice day everyone, hope you can get your color too :P