A Better Way To Approach Competitive Programming Last Updated : 11 May, 2022 Comments Improve Suggest changes Like Article Like Report This article helps to all those who want to begin with Competitive Programming. The only prerequisite one need is the knowledge of a programming language. Now, Let us find a better approach to Competitive Programming. Please note: One should read the proper Input and Output format because most of the beginners make mistakes of having extra print statements in the output. So please be careful about the output format. Example - "Please Enter Next Number :" and "Output is : . Analyze the problem constraints before writing code because most of the time you have written the code that is brute force and will not run in the given time limit constraint. Following are some of the issues that you might face if you are a beginner.: Time Limit : It is given in seconds. It gives you insight into the order of the correct solution. Consider the following situation.Time Limit = 1 Sec Let us Assume 1 sec approximately can perform 10^8 operations. If you write a program that is of order O(N^2) and the problem has T test cases. Then the total order of your program becomes O(T*N^2). If T <= 1000 and N <= 1000, then (ignoring hidden constants in asymptotic notations) your code may not be accepted in the worst case as 1000*1000*1000 is 10^9 operations which mean 10 seconds. To avoid TLE, always think of the worst test cases that are possible for the problem and analyze your code in that situation. Run Time Error : It is the one of the most encountered problem by the beginners. The main reason could be : Segmentation Fault : It is the illegal accessing of memory address. e.g int[] array = new int[100]; System.out.println(array[101]); Declaration of an array of more than 10^8. Divide & Taking Modulus with 0 . You should know how to use GDB that will help you to correct your run time error. Compilation Error : It is one of the errors that is frequently faced when programming in C/C++. Wrong Answer : Whenever you encounter WA, write a brute force code & make sure that it is perfect. Now generate test cases using random function in C++. Run your code on these test cases and match the output. Now think of the corner cases that will help you to find the problem in your algorithm. IntOverflow : Many times unknowingly you will exceed the maximum value that can be stored in primitive type int. e.g. Constraints : 0 < num1,num2 <= 10^9 C #include<iostream.h> int main() { int num1, num2; cin >> num1 >> num2; int answer = num1 + num2; // error if num1 and num2 are large // numbers cout<< answer; return 0; } The above program won’t run correctly always because (2*10^9) it may exceed the maximum value that can be stored in INTS. i.e 10^9. So you will have to use long long int or unsigned int primitive data type for the answer in such a case. Comparing Doubles : C int main() { float a ; cin >> a; if (a == 10) cout << “YES”; } float and double data types don’t have infinite precision . Beware (6/15 digit precision for them respectively). So always use a margin of (~0.0000001) in comparing. Example - if (abs(a -10) < (0.0000001)) { cout << “YES”; } Other Useful Points : Sometimes when you are stuck. Check running time of other accepted code and analyze about the order of solution is required and the amount of memory that is allowed. 4 MB ~ integer array of size 10^6 (assuming int takes 4 bytes) or 2-d array of size 10^3*10^3 Standard Memory limits in most of the problem are of the order of 256MB. If you have to allocate a large array, then it is NOT a good idea to do allocation inside a function as memory is allocated and released for every test case, and memory is allocated on the function call stack (stack size is limited at many places). Thus if you have to make an array of large size, make it global. I hope this article was of help to you and hope that you will now be able to attempt questions being better prepared and thereby perform better, quicker. :) Comment More infoAdvertise with us Next Article A Better Way To Approach Competitive Programming U Ujjwal Kanodia Improve Article Tags : GBlog Competitive Programming DSA GBlog-Competitive-Programming Similar Reads Competitive Programming - A Complete Guide Competitive Programming is a mental sport that enables you to code a given problem under provided constraints. The purpose of this article is to guide every individual possessing a desire to excel in this sport. This article provides a detailed syllabus for Competitive Programming designed by indust 8 min read Competitive Programming (CP) Handbook with Complete Roadmap Welcome to the Competitive Programming Handbook or CP Handbook by GeeksforGeeks! This Competitive Programming Handbook is a go-to resource for individuals aiming to enhance their problem-solving skills and excel in coding competitions. This CP handbook provides a comprehensive guide, covering fundam 12 min read Mathematics for Competitive ProgrammingMust do Math for Competitive ProgrammingCompetitive Programming (CP) doesnât typically require one to know high-level calculus or some rocket science. But there are some concepts and tricks which are sufficient most of the time. You can definitely start competitive coding without any mathematical background, but maths becomes essential as 15+ min read Pigeonhole Principle for CP | Identification, Approach & ProblemsIn competitive programming, where people solve tough problems with computer code, the Pigeonhole Principle is like a secret tool. Even though it's a simple idea, it helps programmers tackle complex challenges. This article is your guide to understanding how this principle works and why it's crucial 8 min read Euler Totient for Competitive ProgrammingWhat is Euler Totient function(ETF)?Euler Totient Function or Phi-function for 'n', gives the count of integers in range '1' to 'n' that are co-prime to 'n'. It is denoted by \phi(n) .For example the below table shows the ETF value of first 15 positive integers: 3 Important Properties of Euler Totie 8 min read Mathematics for Competitive Programming Course By GeeksforGeeksMathematics forms the foundation of problem-solving in Competitive Programming (CP). Mastering key mathematical concepts is crucial for approaching algorithmic challenges effectively. If you're an aspiring competitive programmer or someone who wishes to enhance your problem-solving skills, this Math 3 min read Number Theory for CPBinary Exponentiation for Competitive ProgrammingIn competitive programming, we often need to do a lot of big number calculations fast. Binary exponentiation is like a super shortcut for doing powers and can make programs faster. This article will show you how to use this powerful trick to enhance your coding skills. Table of ContentWhat is Binary 15+ min read GCD (Greatest Common Divisor) Practice Problems for Competitive ProgrammingGCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest positive integer that divides both of the numbers.GCD of Two NumbersFastest Way to Compute GCDThe fastest way to find the Greatest Common Divisor (GCD) of two numbers is by using the Euclidean algorithm. The E 4 min read Bit Manipulation for CPBit Manipulation for Competitive ProgrammingBit manipulation is a technique in competitive programming that involves the manipulation of individual bits in binary representations of numbers. It is a valuable technique in competitive programming because it allows you to solve problems efficiently, often reducing time complexity and memory usag 15+ min read Bit Tricks for Competitive ProgrammingIn competitive programming or in general, some problems seem difficult but can be solved very easily with little concepts of bit magic. We have discussed some tricks below in the previous post.Bitwise Hacks for Competitive Programming One-Liner Hacks of Bit Manipulation:One-Liner CodeFunctionx&1 7 min read Bitwise Hacks for Competitive ProgrammingPrerequisite: It is recommended to refer Interesting facts about Bitwise Operators How to set a bit in the number 'num': If we want to set a bit at nth position in the number 'num', it can be done using the 'OR' operator( | ).  First, we left shift '1' to n position via (1<<n)Then, use the 'O 14 min read Combinatorics for CPInclusion Exclusion principle for Competitive ProgrammingWhat is the Inclusion-Exclusion Principle?The inclusion-exclusion principle is a combinatoric way of computing the size of multiple intersecting sets or the probability of complex overlapping events. Generalised Inclusion-Exclusion over Set:For 2 Intersecting Set A and B: A\bigcup B= A + B - A\bigca 5 min read Greedy for CPBinary Search on Answer Tutorial with ProblemsBinary Search on Answer is the algorithm in which we are finding our answer with the help of some particular conditions. We have given a search space in which we take an element [mid] and check its validity as our answer, if it satisfies our given condition in the problem then we store its value and 15+ min read Ternary Search for Competitive ProgrammingTernary search is a powerful algorithmic technique that plays a crucial role in competitive programming. This article explores the fundamentals of ternary search, idea behind ternary search with its use cases that will help solving complex optimization problems efficiently. Table of Content What is 8 min read Array based concepts for CPWhat are Online and Offline query-based questions in Competitive ProgrammingThe query-based questions of competitive programming are mainly of two types: Offline Query.Online Query. Offline Query An offline algorithm allows us to manipulate the data to be queried before any answer is printed. This is usually only possible when the queries do not update the original element 4 min read Precomputation Techniques for Competitive ProgrammingWhat is the Pre-Computation Technique?Precomputation refers to the process of pre-calculating and storing the results of certain computations or data structures in advance, in order to speed up the execution time of a program. This can be useful in situations where the same calculations or data stru 15+ min read PreComputation Technique on ArraysPrecomputation refers to the process of pre-calculating and storing the results of certain computations or data structures(array in this case) in advance, in order to speed up the execution time of a program. This can be useful in situations where the same calculations are needed multiple times, as 15 min read Frequency Measuring Techniques for Competitive ProgrammingMeasuring the frequency of elements in an array is a really handy skill and is required a lot of competitive coding problems. We, in a lot of problems, are required to measure the frequency of various elements like numbers, alphabets, symbols, etc. as a part of our problem. Examples: Input: arr[] = 15+ min read Dynamic Programming (DP) for CPDP on Trees for Competitive ProgrammingDynamic Programming (DP) on trees is a powerful algorithmic technique commonly used in competitive programming. It involves solving various tree-related problems by efficiently calculating and storing intermediate results to optimize time complexity. By using the tree structure, DP on trees allows p 15+ min read Dynamic Programming in Game Theory for Competitive ProgrammingIn the fast-paced world of competitive programming, mastering dynamic programming in game theory is the key to solving complex strategic challenges. This article explores how dynamic programming in game theory can enhance your problem-solving skills and strategic insights, giving you a competitive e 15+ min read Game Theory for CPInteractive Problems in Competitive ProgrammingInteractive Problems are those problems in which our solution or code interacts with the judge in real time. When we develop a solution for an Interactive Problem then the input data given to our solution may not be predetermined but is built for that problem specifically. The solution performs a se 6 min read Mastering Bracket Problems for Competitive ProgrammingBracket problems in programming typically refer to problems that involve working with parentheses, and/or braces in expressions or sequences. It typically refers to problems related to the correct and balanced usage of parentheses, and braces in expressions or code. These problems often involve chec 4 min read MEX (Minimum Excluded) in Competitive ProgrammingMEX of a sequence or an array is the smallest non-negative integer that is not present in the sequence.Note: The MEX of an array of size N cannot be greater than N since the MEX of an array is the smallest non-negative integer not present in the array and array having size N can only cover integers 15+ min read Like