Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

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 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.

Weakness

Last visit:  7 years ago
Registered:  9 years ago
2.
By maroonrk, history, 6 years ago, In English
TL Issue in the #659 (Div. 1) Problem F I've hacked all AC solutions of [this](https://codeforces.me/contest/1383/problem/F) problem, which were submitted during the contest, and I believe I can hack most of upsolving solutions. Currently, I only checked that they time out on my local machine, because "Unexpected Verdict" prevents me from uphacking. I even hacked model implementation in the editorial. [Here](https://ideone.com/cHvjkp)'s my latest generator. Feel free to challenge it. Side Note: [user:yosupo,2020-07-26] wrote a [solution](https://codeforces.me/contest/1383/submission/88036534), which passes the above case, but I failed it with another [generator](https://ideone.com/LKx3FP). What I want to argue is that TL of this problem is too tight, and it affected some of the competitors. For example, I got almost the same idea as the model solution during the contest. Still, I was too scared to write it because I suspected it would time out without full optimization and possibly some tweaks like shuffling ve...
(or believed the weakness of the test) passed F, which seems unfair to me., , this observation didn't help me, and some people who didn't think of this (or believed theweakness of

Full text and comments »

  • Vote: I like it
  • +1015
  • Vote: I do not like it

3.
By E869120, 9 years ago, In English
[Tutorial] A Way to Practice Competitive Programming : From rating 1000 to 2000 Dear Codeforces Community.<br /> <br /> Today I want to share some ways to practice competitive programming and getting rating. I think this is helpful for those who is practicing competitive programming hardly but rating is sluggish. (By the way, on July 17th, I have a project of competitive programming said CombNaf in Japan. I did a lecture about this. Great thanks to the CombNaf's organizer is [user:Nafmo2,2017-07-17].)<br /> <br /> I will write this by **4 steps**: rating **<font color="grey">1000</font> --> <font color="green">1250</font>**, **<font color="green">1250</font> --> <font color="aqua">1500</font>**, **<font color="aqua">1500</font> --> <font color="blue">1750</font>**, **<font color="blue">1750</font> --> <font color="purple">2000</font>**, in Codeforces Rating System.<br /> <br /> Before writing about each step, I wrote it as premise: You don't have to do this way. This is just a way to practice. Ways to practice is different among people, so I think this may n...
practice these two: * Overcome your weakness (For example, DP problems, Graph Theory

Full text and comments »

  • Vote: I like it
  • +181
  • Vote: I do not like it

4.
By dreamoon_love_AA, history, 11 years ago, In English
Codeforces Round #320 [Bayan Thanks-Round] Editorial ## [Problm 1 : Raising Bacteria](http://codeforces.me/problemset/problem/579/A) Write down $x$ into its binary form. If the $i^{th}$ least significant bit is $1$ and $x$ contains $n$ bits, we put one bacteria into this box in the morning of $(n+1-i)^{th}$ day. Then at the noon of the $n^{th}$ day, the box will contain $x$ bacteria. So the answer is the number of ones in the binary form of $x$. [code of author's friend: this](http://codeforces.me/contest/579/submission/13053439) ## [Problem 2 : Finding Team Member](http://codeforces.me/problemset/problem/579/B) Sort all possible combinations from high strength to low strength. Then iterator all combinations. If two people in a combination still are not contained in any team. then we make these two people as a team. [author's code: this](http://codeforces.me/contest/579/submission/13053526) ## [Problem 3 : A Problem about Polyline](http://codeforces.me/problemset/problem/578/A) If point ($a$,$b$) is located on t...
## [Problem 5 : Weakness and Poorness](http://codeforces.me/problemset/problem/578/C), ) | suffix[i+1]); printf("%I64d\n",ans); } ``` ## [Problem 5 : Weakness and Poorness](http, We can discover when you are given $x$. The **weakness** will be (y coordinator of highest line at

Full text and comments »

  • Vote: I like it
  • +89
  • Vote: I do not like it

5.
By Chilli, history, 8 years ago, In English
C++ STL: Order of magnitude faster hash tables with Policy Based Data Structures TL;DR ----- The Policy Hash Table has 3-6x faster insertion/deletion and 4-10x increase for writes/reads. As far as I can tell, there are no downsides. The policy hash table (specifically the open-addressing version), beats out unordered_map in all my benchmarks. PS: Make sure you read the section a better hash function and use it &mdash; I'd recommend this one: https://github.com/kth-competitive-programming/kactl/blob/master/content/data-structures/HashMap.h Background ------ I've often been irritated by how slow unordered_map is in C++. Too often, I have something that runs fast enough in terms of complexity, but the constant factor from unordered_map slows down the solution too much. Yesterday though, after using the useful order statistics tree from https://codeforces.me/blog/entry/11080, I was curious if there were any other useful data structures hiding in the Policy STL. And lo and behold, I found a hash table. Benchmarks ------------------ Well, enough backsto...
, the API seems almost exactly the same. Defeating Anti-Hash tests ------ One weakness of hash, Defeating Anti-Hash tests ------ One weakness of hash tables is that mean people can find hash

Full text and comments »

  • Vote: I like it
  • +328
  • Vote: I do not like it

6.
By djm03178, history, 3 years ago, In English
A Type of Tests That Might Be Effective for Many Multi-Test Problems I've always loved hacking in CF rounds, especially for open hacking and uphacking. Recently, I've been focusing on hacking for TLE because there are plenty of solutions that can pass every single randomly generated tests but can still have broken worst case time complexity and the tests for that can only be found under deep investigation on the code. One of the findings that I saw during hacking in recent rounds, is that there is a fairly common mistake that many people make but most problems don't have tests against it. The conditions for such mistakes are: 1. The problem must be a multi-test problem (around $10^4$ or more if possible). 2. The constraint on the $n$ variable of a single test should be as large as the constraint on the sum of $n$ in all tests. 3. The solution has both of these slow aspects described below but none of them are _that_ slow to get TLE when only one of them is attacked. Condition #1 and #2 are very common in recent rounds so it's not hard to find...
wasn't even against its weakness (it was made for another submission before). A $n=290001$ test, weakness (it was made for another submission before). A $n=290001$ test shouldn't be much different

Full text and comments »

  • Vote: I like it
  • +140
  • Vote: I do not like it

7.
By DarkestBlade, history, 6 months ago, In English
Hi guys check out my new website cf-cool-graphs (WITH COOL GRAPHS) I know there's already hundreds of cf analytic projects but trust me i have cool graphs to show. check out the website on https://cf-cool-graphs.vercel.app/ Cool Features: Performance Calculator: -> Calculate your in-contest and virtual performance (i know tle bot can calculate performance but it doesn't do virtual performance); virtual performance is just an estimate based on your placement compared to the official rankings; Because I am poor the calculations will take a bit of time so sorry about that; but we do cache the calculations so it is faster next time; I also cache the contests queried if it is not yet cached so it will be faster the more the service is used; ![ ](/predownloaded/89/75/8975b8655f32dd5e7aa98c99fb18c6567e0f14cf.png) Rolling Average: -> Gives your 50-problem rolling average ratings; This is my favorite graph to be honest; its a good tell if you are improving or not, even if the rating is quite flat; I attached my recent 50-day average an...
Weakness Map:

Full text and comments »

  • Vote: I like it
  • +55
  • Vote: I do not like it

8.
By thanhchauns2, history, 4 years ago, In English
What I have done and haven't in 2022 and my wishes for 2023. Hi Codeforces! ------------------ Ladies and gentlemen, 2023 is near. Lots of things happened to us in 2022, both achievements and disappointments. This is just a list of what I have done and haven't yet in 2022, and my goals for 2023. I'm just in the mood to write something, don't take it seriously. Successful tasks: - Have my hair grown back. - Being in the top 100 of a contest. - Set a div.2 round. - Solving every problem of a div.3 contest (with my alt account). - Be able to solve some 2400 problems. - Overcome my weakness of bitmasks and data structures. - Won the 2022 local CP cup at my university. - Participate in the 2022 ICPC Asia HCMC Regional Contest. - Have my own Computer Science community. - My community is a great partner in some big events. - Meet my girlfriend. - Meet [user:6aren,2022-12-20]. - Meet [user:_dlbm17,2022-12-20]. - Meet [user:jalsol,2022-12-20]. - Meet [user:SPyofgame,2022-12-20]. - And many more people. - Visit home regularly,...
combined round. - Get a job. - Visit another country. - Overcome my leftover weakness., to solve some 2400 problems. - Overcome my weakness of bitmasks and data structures. - Won the 2022, . - Overcome my weakness of bitmasks and data structures. - Won the 2022 local CP cup at my university

Full text and comments »

  • Vote: I like it
  • +244
  • Vote: I do not like it

9.
By greateric, history, 4 weeks ago, In English
Claude solves open problem in cryptography ECDSA is a signing algorithm in cryptography. You might have seen it in use in SSH (`ssh-keygen -t ecdsa`). Also, most cryptocurrencies use ECDSA as the signing algorithm to prove that you own the coins in an address. An elliptic curve is basically described by an equation like $y^2 = x^3 + 7$, or more accurately, in a finite field mod a power of 2 or a prime, like $y^2 \equiv x^3 + 7 \pmod{p}$, where $p$ is large, like $2^{256}$ large. In short, the algorithm works by generating a private key $d$, which is a random number less than the order of the curve ( **DO NOT pick $d=4$ like someone did** ), and there's a public point $G$ called the generator point. The public key is the (x, y)-coordinates of $d \cdot G$, where $\cdot$ is multiplication. Adding and multiplying points is a little convoluted and is described [here](https://en.wikipedia.org/wiki/Elliptic_curve#Group_law). It's a little different in finite fields, and you can find an example implementation [on my GitHub](ht...
curves to secure US government information, so they probably wouldn't intentionally build aweakness, information, so they probably wouldn't intentionally build a weakness into their own curves that could

Full text and comments »

  • Vote: I like it
  • +17
  • Vote: I do not like it

10.
By NonTourist, 5 months ago, In English
AlgoRadar: an explainable problem recommendation system for CP practice # AlgoRadar &mdash; an explainable recommender for CP practice Hello Codeforces! I built **AlgoRadar**, an open-source recommendation/analytics system for competitive programming practice. Repository: [Link](http://github.com/drawmebaaz/AlgoRadar) The goal is simple: > Given my public submission history, what should I practice next? The system uses Codeforces as the strongest source because it provides public submissions, verdicts, problem ratings, tags, rating history, and problemset metadata. It also has adapters for LeetCode and CodeChef, but Codeforces is the main difficulty anchor. --- ## 1. Main idea AlgoRadar converts public CP activity into explainable features and ranks unsolved problems by **learning value**, not just rating or popularity. Rough pipeline: ``` handle -> fetch public submissions/problem metadata -> build profile/tag/difficulty features -> classify focus areas -> estimate solve probability -> rank candidate problems -> buc...
is why average solved rating and hardest solved rating are used. --- ## 3. Focus /weakness, ## 3. Focus / weakness classification, ``` rating gap tag depth weakness classification solve probability topic familiarity Gaussian

Full text and comments »

  • Vote: I like it
  • +7
  • Vote: I do not like it

11.
By Ignat, 16 years ago, translation, In English
Разбор задачи C из Яндекс.Алгоритм 2011 раунд 1 <p>Good day!</p><p>I am an author of the problem C in the first round of Yandex.Algorithm competition and I would like to tell you about the solution of this problem.<br></p><p>I hope you enjoyed the problem and&nbsp;regret about&nbsp;the weakness of the test-set. This trouble was mentioned by the user&nbsp;<b>maksay</b>, whose quadratic solution&nbsp;is successfully passed system tests. I did not consider this case when created tests for the problem and random tests with deep trees could not challenge this solution.&nbsp;&nbsp;</p><p>[cut]</p><div>So, let remember statement of the problem. We have &nbsp;the correct binary search tree and the set of request keys. For each request key we consider paths in the tree with one error. These paths are constructed by the search of request key in the tree with one wrong choice of the next vertice. Each wrong choice generate one search path in the tree.&nbsp;</div><div><br></div><div>At the beginning solve the problem for one request key. Consid...
I hope you enjoyed the problem and regret about the weakness of the test-set. This , problem and regret about the weakness of the test-set. This trouble was mentioned by the

Full text and comments »

  • Vote: I like it
  • +55
  • Vote: I do not like it

12.
By EnumerativeCombinatorics, history, 11 years ago, In English
What is the good way for competitive programmers to practice English? Hello, I'm writing a blog entry because I'm seeking the answer for the problem: Competitive Programmers and English. As you can see, it is not a competitive programming problem, but a real-world problem. At first, I describe why I want to ask it to Codeforces users. In my case, I'm very poor at English, especially speaking fluently. For example, I didn't get an internship jobs outside Japan because of the language problem, although I applied for many companies and I was very good at writing codes for interview problems. Most companies did not give me why I was rejected, but it is almost obvious that it is because of my very poor English speaking skills. Besides, when I went to IOI 2015 as the problem statement translating team of Japan, I have many opportunities to talk with competitive programmers from outside Japan, but indeed I couldn't talk with them very well. Somehow I took a TOEFL exam, and I've got not so low score in total. However, my speaking score is about 10pts out o...
of 30 lower than reading, listening and writing. So it is obvious that my weakness is English, weakness is English speaking, and I feel it is a big barrier to do many things, such as internships

Full text and comments »

13.
By joyboy24, history, 5 months ago, In English
CP-Vertex — 1v1 Duels and Weakness-Oriented Training Hi everyone! Over the past few months I've been building **CP-Vertex**, a training platform designed around one simple idea: > Most tools can tell you **what your weaknesses are**. Very few tell you **what to practice next.** The goal of CP-Vertex is to bridge that gap. Website: https://cpvertex.vercel.app/ Source Code: https://github.com/aristoncodes/CP-Vertex --- ## The Training Loop Instead of randomly picking problems, CP-Vertex follows a simple workflow: > **Analyze your profile → Identify weak topics → Practice them → Test yourself in a duel → Upsolve missed problems → Repeat** The focus is on helping you improve the topics that actually limit your progress. --- ## 1v1 Duels Challenge another programmer to a live duel. Problems are automatically selected around both players' ratings, making matches competitive rather than one-sided. Features: * Automatic problem selection * Live progress updates * Spectator mode * Server-side d...
CP-Vertex — 1v1 Duels and Weakness-Oriented Training

Full text and comments »

  • Vote: I like it
  • +8
  • Vote: I do not like it

14.
By MIDORIYA_, 7 months ago, In English
Upsolve it — Stop Guessing What to Solve on Codeforces ### Hi Everyone <div style="overflow: hidden;"> <img src="/predownloaded/ea/3c/ea3ca5038d21aed7d64db88b0596f90924dd225f.png" style="float: right; width: 400px; margin-left: 25px; margin-bottom: 15px;" /> <p> If you train regularly on Codeforces, you've probably faced this. </p> <p> You open a gym<br> You see a long list of problems<br> You spend time deciding what to solve </p> <p> Is this too easy? Too hard? Even useful? </p> <p> Most people don't struggle with solving.<br> They struggle with <b>choosing what to solve</b>. </p> </div> --- #### The Idea I built **[Upsolve it](https://upsolve-it.hnuicpc.tech)**, a tool that gives you a structured way to train based on your level. * No random picking * No guessing * No wasted time before solving --- #### What It Does * **Level-based training:** reads your Codeforces rating and hands you problems at the right difficulty, hidden until the session ends. You can also adjust the level ma...
fully random * **Five training modes:** Ladder, Weakness, Speed, Contest Simulation, Endurance, each, manually, filter by tags, or go fully random * **Five training modes:** Ladder, Weakness, Speed

Full text and comments »

  • Vote: I like it
  • +17
  • Vote: I do not like it

15.
By InoriYuitsukaMedalist, history, 3 weeks ago, In English
The most important beginner concept in programming ## Summary This blog introduces a thinking model for beginners to help solve recursion and basic DP (recursion with memoization) problems. This kind of thinking, in my opinion, is one of the most important things beginners need to master in their programming journey (and for those taking CS1101S, it's like $50 \%$ of the problems in that course). ## Notes Some of the solutions below is very **unoptimized**. This is intentional as to not distract from the main point of the blog. As the inspiration for this blog was from CS1101S, all the code in this blog will be written in Source (a subset of Python only used in CS1101S). Some of the examples also uses CS1101S definitions and functions as well. I will list them here for reference: CS1101S Terms | Definitions --- | --- pair | A pair is a list/array of two elements. llist | A llist (similar to a linked list) is either `None` (empty llist) or a **pair** whose tail is a llist. The first element of a llist `lst` is `head(lst)`...
below. Worst case I will just ignore you (lol). As an example, I will briefly present aweakness, As an example, I will briefly present a weakness of this model: While it may create a working DP

Full text and comments »

16.
By Nourhan_Abo-Heba, history, 15 months ago, In English
STL – Arrays, Vectors, Deques, Stacks, Queues <p>Hi everyone!<br> Let's talk about some basic STL containers, their pros/cons, and when to use each.</p> <br> <b>Table of Contents</b> <ul> <li>Array</li> <li>Vector</li> <li>Deque</li> <li>Stack</li> <li>Queue</li> <li>TL;DR</li> <li>Tips &amp; Tricks</li> <li>Practice Problems</li> </ul> <br> <hr> <b>1. Array</b> <ul> <li>Fixed size.</li> <li>Contiguous in memory → random access is <b>O(1)</b>.</li> <li><b>Disadvantage:</b> you can't add or erase elements.</li> </ul> <pre> int arr[5]; // size is fixed </pre> <hr> <b>2. Vector</b> <ul> <li>Dynamic array — like an array but resizable.</li> <li>Contiguous in memory (same as array).</li> <li>Adding/removing at the <b>end</b> is <b>O(1)</b>.</li> <li>Insertion/erasure in the <b>middle or front</b> is <b>O(n)</b> — avoid when possible.</li> </ul> Common functions: <pre> vector&lt;int&gt; v(n); // size n, all zeros vector&lt;int&gt; v; // empty vector v.push_b...
* Solves vector's weakness at the front. * Supports push_front() / pop_front, (Double Ended Queue) * Solves vector's weakness at the front. * Supports

Full text and comments »

  • Vote: I like it
  • -21
  • Vote: I do not like it

17.
By green_heaven, history, 6 months ago, In English
CF Analytics — not just stats, but actual coaching Hey Codeforces! Built something I think you'll find useful. **CF Analytics** — not just stats, but actual coaching. It pulls your full submission and contest history and gives you a real picture of where you stand and what to do next. ## What's inside: * Rating history, contest progression, activity heatmap * Topic-strength radar across 30+ algorithm tags * Weakness analysis based on your actual submission patterns * AI-generated personalized roadmap toward your target rating * Curated problem recommendations for your weak spots The AI part actually looks at your data — not generic *"practice DP and graphs"* advice. It gives you a concrete plan based on what you've been solving and where you're dropping problems. ## Links [Live Link](https://cfanalytics-frontend.vercel.app/) [GitHub](https://github.com/greenheaven24/cfanalytics) Free and open source. Try it with your handle and let me know in the comments if the weakness analysis matches what you'd exp...
progression, activity heatmap * Topic-strength radar across 30+ algorithm tags *Weakness analysis based, + algorithm tags * Weakness analysis based on your actual submission patterns * AI-generated personalized, Try it with your handle and let me know in the comments if the weakness analysis matches what you'd

Full text and comments »

  • Vote: I like it
  • +16
  • Vote: I do not like it

18.
By worstesttest, history, 7 years ago, In English
masterpiece.txt Bee Movie Script According to all known laws of aviation, there is no way a bee should be able to fly. Its wings are too small to get its fat little body off the ground. The bee, of course, flies anyway because bees don't care what humans think is impossible. Yellow, black. Yellow, black. Yellow, black. Yellow, black. Ooh, black and yellow! Let's shake it up a little. Barry! Breakfast is ready! Ooming! Hang on a second. Hello? - Barry? - Adam? - Oan you believe this is happening? - I can't. I'll pick you up. Looking sharp. Use the stairs. Your father paid good money for those. Sorry. I'm excited. Here's the graduate. We're very proud of you, son. A perfect report card, all B's. Very proud. Ma! I got a thing going here. - You got lint on your fuzz. - Ow! That's me! - Wave to us! We'll be in row 118,000. - Bye! Ba...
In tennis, you attack at the point of weakness!, weakness! It was my grandmother, Ken. She's 81. Honey, her backhand's a joke! I'm not

Full text and comments »

  • Vote: I like it
  • -31
  • Vote: I do not like it

19.
By SleeepyHead, 21 month(s) ago, In English
Became an expert! Resources to help you do the same. It took me about a year to become an Expert, which may be a small feat, but I still believe that maybe sharing the resources which I personally had used might help someone. 1. For learning algorithms: You can use a channel called takeuforward by a guy named striver: https://www.youtube.com/@takeUforward. The guy has excellent explaining skills. I would ideally recommend building a habit of reading blogs and articles, as later on, you will only have those to help you. 2. For practice: - CSES Problem set: It's a very great website to practice good quality questions. The questions are sometimes standard and sometimes very unique so you ultimately end up learning a lot but the time constrains can be a bit irritating tbh. https://cses.fi/problemset/list/ - TLE eliminators cp-31: Best one I found for rating wise practice although you will need more than 31 questions generally to get comfortable with higher rating but it does provide us with all the necessary concepts and algorith...
) 3. Always upsolve the contests and if you are unable to find you're weakness then maybe try, 3. Always upsolve the contests and if you are unable to find you're weakness then maybe try looking

Full text and comments »

  • Vote: I like it
  • +23
  • Vote: I do not like it

20.
By Bibhuti, history, 9 years ago, In English
Need guidance and tips regarding upsolving I am a mediocre coder as of now. I want to improve fast but am confused about how to go for **upsolving**. Once upon a time I thought of solving 5 problems per day by sorting the problemset from most solved to least solved and go with the flow but now I feel like I am only doing naive questions which only make me feel good but no improvement at all. I've done nearly 420 questions but still feeling damn dissatisfied. I really don't have any instructor or coach here to give some particular guidance to how to solve something or how not to solve something. So please someone, anyone help me out. One more thing is that when I go for solving hard questions and just go for solving Div 2 C or so, it scares the hell out of me. I feel like I don't know anything & maybe I'm jumping straight away to something without any previous knowledge of it. I hope many coders would have gone the same phase just like me. I just want to interact with anyone willing to help just for once and clear my ...
I think my strength is I've dedication and hard work and I hope the weakness in me is I'm really, weakness in me is I'm really not confident about what I am doing is right or not. I would be highly

Full text and comments »

  • Vote: I like it
  • +42
  • Vote: I do not like it

21.
By ChaosAngel, 7 years ago, In English
Redundant testing on duplicate hacks Hello! In the aftermath of the recent educational round, there is an apparent weakness in the test-cases of problem A that is leading to a ton of hacks. This large volume of hacks will be added to the systests tomorrow morning. However, they do not represent distinct weaknesses; odds are that only a tiny fraction of these test-cases is necessary, since they are all targeting the same weakness, and most codes will fail at the first hack. Doesn't this represent an inefficiency that will be an added burden on the already crowded system tests? I don't know how this could be handled, but perhaps live rejudging of all codes on individual successful hack cases will prevent many unnecessary hacks from being created in the first place? This is not exclusive to this contest, and is a persistent issue in div3's and educationals with long hacking phases that could perhaps be improved to save system test resources. Cheers<br> CA
, since they are all targeting the same weakness, and most codes will fail at the first hack., Hello! In the aftermath of the recent educational round, there is an apparent weakness in the test

Full text and comments »

  • Vote: I like it
  • +51
  • Vote: I do not like it

22.
By priyadarshinir, history, 10 months ago, In English
Dive in Thoughts ### A Dive Into Thoughts — And How Not to Lose the Idea That Brought You ================== ------------------ ### Every developer remembers the moment an idea first appeared. ### ### It was simple. ### Clear. ### Almost obvious. ### ### Maybe it was a solution to a bug. ### Maybe a product idea. ### Maybe a side project you couldn’t stop thinking about. ### ### At that moment, the idea felt alive. ### ### Then we did what developers do best — ### we started thinking deeply. ### ### And somewhere in that depth, many ideas slowly disappear. ### ### Not because they were bad. ### But because they drifted. ### Deep Thinking Is a Gift — But It Has a Shadow --------------------------------------------- ### Thinking deeply is our strength. ### We question edge cases. ### We optimize. ### We prepare for scale. ### We imagine everything that could go wrong. ### ### But deep thinking has a shadow side. ### ### Sometimes we go so deep that we forget ...
?” ### ### “Am I building value, or just building?” ### ### These pauses are not weakness

Full text and comments »

  • Vote: I like it
  • -27
  • Vote: I do not like it

23.
By AJ_Forces, history, 2 years ago, In English
Need help with Dynamic Programming. Hey there CF fam! I just became Pupil in the last contest and couldn't solve problem C. After the contest I saw that it could've been solved by DP. DP is my weakest topic. In all of the contests I have given, I have never been able to solve a single dp problem. I have practiced many problems on Leetcode and few on CF as well but I still feel lost whenever I see a dp problem. I looked up several blogs on CF and Leetcode and have solved several of the problems from the suggested lists(I was able to solve those maybe because I knew in advance that this will be solved by dp) but still can't feel even slightly confident about DP problems in general. Have you guys ever faced this problem? Can any of you help me out with this? Although I am a newbie but I have studied topics like dp, graphs, segment trees, DSU, etc and have solved problems based on these on Leetcode(mostly) and on CF as well. Just because of my bad contest temperament and weakness in DP, I am not able to go beyond problem...
temperament and weakness in DP, I am not able to go beyond problem C in any div2 contest., well. Just because of my bad contest temperament and weakness in DP, I am not able to go beyond

Full text and comments »

  • Vote: I like it
  • +6
  • Vote: I do not like it

24.
By L_ryuzaki_, history, 12 days ago, In English
Wrong soln for C2.Disgusting + GCD (Checker Version) in Codeforces Round 1132 (Div. 2) got accepted A wrong solution to C2 got accepted: https://codeforces.me/contest/2284/submission/397621024 I submitted the exact same code initially and received a WA. However, when I submitted it again, without making any changes, it got accepted. It doesn't seem fair in competitive programming when the same incorrect code can receive different verdicts on separate submissions.The reason behind this soln getting accepted is the weakness of test cases i think. UPD-- my concern is not about getting accepted by changing return; to return ; . It was about getting lucky even though the answer is wrong. the solution is correct when the number of times we need to generate random numbers is correct. In this , the number is calculated using wrong probabilities but still the author got lucky and his solution got accepted in the first try. That means the test cases were not strong enough , that's all. The method used here is absolutely fine but the calculated number of times we need to gene...
getting accepted is the weakness of test cases i think. UPD-- my concern is not about, soln getting accepted is the weakness of test cases i think.

Full text and comments »

  • Vote: I like it
  • -23
  • Vote: I do not like it

25.
By Jesse_Pinkman_bch, history, 23 months ago, In English
How to Improve in Competitive Programming and Solve More Problems? Hi Codeforces community, I am currently majoring in Computer Science and have solved around 250 questions on LeetCode. However, I am struggling to perform well in Codeforces contests. My performance typically looks like this: Div 2: I can usually solve 2 problems and occasionally 3 when I am lucky. Div 3 & Div 4: I cap at around 3-4 problems most of the time. My rank generally falls in the 4k–10k range in contests. I am really passionate about improving my competitive programming skills but feel stuck at my current level. I would like to ask for guidance from this amazing community: Practice Resources: Are there any specific websites, problem lists, or strategies I should follow to practice more effectively? Math Topics: Are there essential math concepts/topics that I should focus on to better understand and solve problems? Weakness Analysis: How do I identify my weaknesses and overcome them efficiently? Contest Strategy: Any tips for managing time during contests and de...
focus on to better understand and solve problems? Weakness Analysis: How do I identify my

Full text and comments »

  • Vote: I like it
  • +2
  • Vote: I do not like it

26.
By SmartCoder, 11 years ago, In English
E. Weakness and Poorness (Time Limit) HI,<br> After I got the idea of [this problem](http://codeforces.me/contest/579/problem/E) and solved it true, it's my first time to solve E during contest but sadly I got TLE it seems that the time limit is too strict.<br> I used loop in My Ternary search (my loop limit is 400 ) and It got TLE ,after the contest I changed it to 398 and it suddenly passed.<br> I asked about that in a comment and [user:ho-jo-bo-ro-lo,2015-09-17] told me he use 500 in loop and it passed but I have to use cin.tie(0); <br> what about submitting the same code twice with cin.tie(0) one got TLE and the other got Accepted.<br> [Accepted](http://codeforces.me/contest/579/submission/13056600)<br> [Time limit exceeded on test 22](http://codeforces.me/contest/579/submission/13056593)<br> during the contest I got TLE on Testcase #15 so if the TLE because reading and writing speed I think testcase 13,14 has the maximum limit and similar numbers so why it passed them and failed in 15.<br> Thanks
E. Weakness and Poorness (Time Limit)

Full text and comments »

Tags tle
  • Vote: I like it
  • +8
  • Vote: I do not like it

27.
By DaRkViRuS, history, 7 years ago, In English
Code forces app for contests and statistics New V1.1.0 My CodeForces: gives you the ability to monitor your progress and know your strength and weakness points in every type of problems you can list all problems and view them in offline mode and share them with friends you can list all upcoming, current, and finished contests and add a reminder for them My contest is aimed to help you to know your progress while you are training to the contests please if you have any suggestion or feedback don't hesitate to contact me or add review and rating on the play store and please share it with friends to make it reach all people here is the play store link https://play.google.com/store/apps/details?id=com.nour.code_forces and to keep updates you can like the Facebook page https://www.facebook.com/mycontestpage ✌️✌️✌️✌️✌️✌️
My CodeForces: gives you the ability to monitor your progress and know your strength andweakness

Full text and comments »

  • Vote: I like it
  • +9
  • Vote: I do not like it

28.
By mochow, history, 11 years ago, In English
What should I do? I have participated at 80 contests and solved a good number of problems on CF. But I am nowhere near any improvement. I should have been CM a long time ago. I know most of the typical algorithms and try harder problems like div2 D, E but none of them are helping much. I mostly have contest time weakness than offline problem solving. Continuous failure is kind of killing me and letting me drown in frustrations. What should I do? I badly need a way out here.
helping much. I mostly have contest time weakness than offline problem solving., weakness than offline problem solving. Continuous failure is kind of killing me and letting me

Full text and comments »

  • Vote: I like it
  • +54
  • Vote: I do not like it

29.
By Wall_breaker, history, 6 years ago, In English
My feelings after div.2 I am a new Candidate Master. However, I will lose it soon. After today's match, I found that I still had a lot of weaknesses. I am not skillful. I could't solve Probelm A at once, which made me quite stressed and nervous and led to the final failure. At last, I fell down before D. When the contest ended, I calmed myself down and solved D. Then, I understood my biggest weakness was FEAR. Well, fear is not helpful to solve a problem. To change the situation, I will do more tasks and take part in more VPs. Although I will go down to the expert this time, I think it is good for me to see myself clearly. And I believe I will return to the Candidate Master soon.
ended, I calmed myself down and solved D. Then, I understood my biggest weakness was FEAR. Well

Full text and comments »

  • Vote: I like it
  • +110
  • Vote: I do not like it

30.
By Nishu_Coder, history, 4 years ago, In English
I couldn't able to understand editorials thoroghly. I was discussing with my companion about what should I do to improve on visualizing problems. He pointed out that the biggest weakness of my lack of visualizing problem patterns is that I don't go through the editorials thoroughly. He is absolutely correct I don't read editorials with full enthusiasm. I don't know what is happening right now but I am not able to understand editorials. It would be too embarrassing for me to say that I am not that good at English but I think that the idea of making the editorials interesting should be really important. after all editorials are the only place where someone learns to visualize patterns and understanding various techniques. Although I am not that person with great understanding of aptitude and Logic but I really aspire to learn more. so as a matter of suggestion I want the editorialist should explain various testcase possibilities, along with corner cases by writing examples ones by one(I would want them to write at least 5 to 6 spec...
pointed out that the biggest weakness of my lack of visualizing problem patterns is that I don't go

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

31.
By ab2912, history, 7 months ago, In English
CodePulse: a simple tool to track your Codeforces growth and weaknesses Hi Codeforces, I made a small project called CodePulse — a Codeforces analytics dashboard built with Vite + React and deployed on **GitHub Pages**. It includes: * handle sync for contests and submissions * performance dashboard with key stats * charts for trends and rating changes * topic-wise strength/weakness analysis * problem history with search and filters * contest history * handle comparison * goals for rating, solved count, streaks, and contest participation * local-first storage with JSON import/export Link: https://advaybagaria.github.io/codepulse-cp-analytics/ I built it mainly to make practice tracking and review a bit more organized. Feedback and feature suggestions are welcome.
* topic-wise strength/weakness analysis * problem history with search and filters * contest history, trends and rating changes * topic-wise strength/weakness analysis * problem history with search and

Full text and comments »

  • Vote: I like it
  • +15
  • Vote: I do not like it

32.
By Puc_Puc, history, 6 years ago, In English
Tip for practicing to reach Expert Recently, I have been doing contest and stuck at **Specialists** for ~2 months. I recognize that my weakness is submitting _WA_ and solving problems _not fast enough_ (I could get into rank~1000 without it). I know that in order to achieve **Expert**, you have to get into rank ~1000 at least 1-2 contests consecutively. Although I'm able to solve 60% of the contest problems, it requires fast coding and bug-free writing skill. So, is there any site beside CF that you think that it's good and I could practice so as to achieve my goal?. I know that there are lots of **Specialists** guys have the same question as mine. Thank you so much. Have a nice day ^^
weakness is submitting _WA_ and solving problems _not fast enough_ (I could get into rank~1000

Full text and comments »

  • Vote: I like it
  • -16
  • Vote: I do not like it

33.
By tom, 12 years ago, In English
Debugging problems Hello guys, I'm working hard on my competetive programming skills for a couple of months, but I still find debugging problems as my main weakness. I waste huge chunk of time for looking for a bug (often much more time than for writing a code). Is there any way to improve this skill? Do you use some your techniques? Thanks.
debugging problems as my main weakness. I waste huge chunk of time for looking for a bug (often much, still find debugging problems as my main weakness. I waste huge chunk of time for looking for a bug

Full text and comments »

  • Vote: I like it
  • +6
  • Vote: I do not like it

34.
By wewark, history, 10 years ago, In English
578C — Weakness and Poorness WA [problem:578C] My submission here [submission:19371924] gives WA test 30 and I can't find out why. I am using ternary search and Kadane's algorithm. Help please!
578C — Weakness and Poorness WA

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

35.
By En_deavour, history, 6 years ago, In English
Helping about improving Greedy Problem Solving Ability I have solved nearly 51 greedy problems. But I felt `helpless` in solving greedy problem though. `Likewise in today's Educational round, there were B, C, D problems which were greedy type.` What should be your tips if I want to `increase my greedy problem-solving skill?` I know these questions may be sound weird to some of you and this post will be downvoted. Yet I am eagerly want to know the way of `doing better in greedy and constructive algorithm problems or how you guys recovered this weakness from strength.` Anyway I am new at CP and I am learning, I will take any instruction positively. [Codedrills Profile](https://recommender.codedrills.io/profile?handles=IWanna_MightiestDisciple)
weakness from strength.` Anyway I am new at CP and I am learning, I will take any instruction positively

Full text and comments »

  • Vote: I like it
  • -20
  • Vote: I do not like it

36.
By godlife7, 13 years ago, In English
if he had no adverse reaction Heaven. Madman biggest problem now left is: how to defeat the visiting Atletico Madrid at home For Mussina, the advent of World War II until the good news one after another. On the last training session before the game, the Blues appeared a surprising figure &mdash; he is with Atletico Madrid in the first leg game injured goalkeeper Petr Cech after the Blues goalkeeper has been news that the season. But when the "Sky Sports" reporter asked the injury situation, Cech said he can play the game against Atletico Madrid.Not only is Cech, Terry had lying on the injury list is also returned to the training ground, according to "The Sun" revealed: "Terry let everyone surprised, he is a tough guy, if he had no adverse reactions played crucial Champions League semi-final. "FriendAlthough this season Atletico fame, also remains unbeaten in the Champions League, but more people are optimistic about the final Chelsea can qualify for the finals. After all, the Blues have been unbeaten in the <a href...
biggest weakness is broken intensive bad defensive ability, often lowly attack to score points. That, depend on others face. The reason, in addition to the referee issue, the Blues biggestweakness is broken

Full text and comments »

  • Vote: I like it
  • -21
  • Vote: I do not like it