How to improve Competitive programming ? competitive programming guide

How to improve Competitive programming -

I've been receiving many messages about how to practice and improve in competitive programming, in this post I will share some tips that helped me a lot to improve and become a Candidate Master on Codeforces.

- The most important thing, Separate thinking from coding.. think on paper NOT on PC, don't start coding till you are sure of your idea.

- Participate in official contests and ALWAYS upsolve 1 or 2 problems that you couldn't solve during the contest.

- A tip that helped me improve faster, don't spend days on problems.. just think in it for 30 - 45 minutes then go ahead and read the tutorial.. It doesn't matter whether you could solve it by yourself or had to read the tutorial, the most important thing is that you thought about the problem for 30 - 45 minutes before reading the tutorial.

- When you decide to read the tutorial, don't read it all at once, read 1 - 2 lines then think for a while before continuing reading.. Those 1 - 2 lines can call your attention to something you weren't aware of.

- Solve problems that are slightly above your level. Measure your progress every 20 problems, if you were able to solve 70% by yourself then you should increase the difficulty (I use Codeforces difficulty tags to practice).

These point shared by a great competitive programmer.(Unknown )

Comments

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and codeforces rating matters a lot . Competitive Programming teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit: 1.00 s Memory limit: 512 MB There are n n apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer n n : the number of apples. The next line has n n integers p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

Concert Tickets Cses Problem set solution | Concert Tickets Cses Problem set solution Using multiset

Concert Tickets Cses Problem set solution- Porblem statement- Time limit: 1.00 s Memory limit: 512 MB There are n n concert tickets available, each with a certain price. Then, m m customers arrive, one after another. Each customer announces the maximum price he or she is willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price. Input The first input line contains integers n n and m m : the number of tickets and the number of customers. The next line contains n n integers h 1 , h 2 , … , h n h 1 , h 2 , … , h n : the price of each ticket. The last line contains m m integers t 1 , t 2 , … , t m t 1 , t 2 , … , t m : the maximum price for each customer. Output Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again. If a customer cannot get any ticket, print − 1 − 1 . Constraints 1 ≤ n , m ≤ 2 ⋅ 10 5 1 ≤ n , m ≤ 2 ⋅

Technical Keeda

Search This Blog