Writing C/C++ code efficiently in Competitive programming Last Updated : 12 Sep, 2023 Comments Improve Suggest changes Like Article Like Report First of all you need to know about Template, Macros and Vectors before moving on the next phase! Templates are the foundation of generic programming, which involve writing code in a way that is independent of any particular type.A Macro is a fragment of code which has been given a name. Whenever the name is used, it is replaced by the contents of the macro.Vectors are same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being handled automatically by the container. So we can use these powerful tools for writing our code in a effective way.Some of the cool tricks that may be used in Competitive programming are given as follows: Using Range based for loop: This is very cool feature in C++11 and would be considered best if you want to iterate from begins to end. This code shows how to use ranged for loops to iterate through an array and a vector: CPP // C++ program to demonstrate range based for // loops for accessing vector and array elements #include<iostream> #include <vector> using namespace std; int main() { // Create a vector object that // contains 5 elements vector<int> vec = {0, 1, 2, 3, 4}; // Type inference by reference using auto. // Range based loops are preferred when no // modification is needed in value for (const auto &value : vec) cout << value << ' '; cout << '\n'; // Basic 5 element integer array int array[]= {1, 2, 3, 4, 5}; for (const auto &value: array) cout << value << " "; return 0; } Output: 0 1 2 3 4 1 2 3 4 5Initializer list: This type is used to access the values in a C++ initialization list. Here the objects of this type are automatically constructed by the compiler from initialization list declarations, which is a list of comma-separated elements enclosed in braces. CPP #include<iostream> template<typename T> void printList(std::initializer_list<T> text) { for (const auto & value: text) std::cout << value << " "; } // Driver program int main() { // Initialization list printList( {"One", "Two", "Three"} ); return 0; } Output: One Two ThreeAssigning Maximum or Minimum value: This one is useful to avoid extra effort in writing max() or min() function. CPP #include<iostream> // Call by reference is used in x template<typename T, typename U> static inline void amin(T &x, U y) { if (y < x) x = y; } // call by reference is used in x template<typename T, typename U> static inline void amax(T &x, U y) { if (x < y) x = y; } // Driver program to find the Maximum and Minimum value int main() { int max_val = 0, min_val = 1e5; int array[]= {4, -5, 6, -9, 2, 11}; for (auto const &val: array) // Same as max_val = max (max_val, val) // Same as min_val = min (min_val,val) amax(max_val, val), amin (min_val, val); std::cout << "Max value = " << max_val << "\n" << "Min value = " << min_val; return 0; } Output: Max value = 11 Min value = -9Fast Input/Output in C/C++: In Competitive programming, you must read Input/Output as fast as possible to save valuable time. C #include <bits/stdc++.h> template<typename T> void scan(T &x) { x = 0; bool neg = 0; register T c = getchar(); if (c == '-') neg = 1, c = getchar(); while ((c < 48) || (c > 57)) c = getchar(); for ( ; c < 48||c > 57 ; c = getchar()); for ( ; c > 47 && c < 58; c = getchar() ) x= (x << 3) + ( x << 1 ) + ( c & 15 ); if (neg) x *= -1; } template<typename T> void print(T n) { bool neg = 0; if (n < 0) n *= -1, neg = 1; char snum[65]; int i = 0; do { snum[i++] = n % 10 + '0'; n /= 10; } while (n); --i; if (neg) putchar('-'); while (i >= 0) putchar(snum[i--]); putchar('\n'); } // Driver Program int main() { int value; // Taking input scan(value); // Printing output print(value); return 0; } Input: 756 Output: 756 To know more about fast input and output Read this article . Using Macros as for loop: Perhaps, it would not be good to use such macros as it would reduce the readability of code but for writing fast code you can take that risk! CPP #include <bits/stdc++.h> using namespace std; #define rep(i,n) for (i = 0; i < n; ++i) #define REP(i,k,n) for (i = k; i <= n; ++i) #define REPR(i,k,n) for (i = k; i >= n; --i) // Driver program to test above Macros int main() { int i; int array[] = {4, 5, 6, 9, 22, 11}; int size= sizeof(array)/sizeof(array[0]); // Default 0 index based loop rep(i, size) cout << array[i] << " "; cout<<"\n"; // Starting index based loop REP(i, 1, size-1) cout << array[i] << " "; cout<<"\n"; // Reverse for loop REPR(i, size-1,0) cout << array[i] << " "; return 0; } Output 4 5 6 9 22 11 5 6 9 22 11 11 22 9 6 5 4Using "bits/stdc++.h": Instead of adding tons of #include lines, just use #include<bits/stdc++.h> The files includes all the header files you'll need in competitive programming, saving a lot of your time.Containers: Using various containers like vector, list, map etc enables one to use the pre-defined functions and reduces the size of code considerably (more often than not)Fast cin and cout: If you use cin and cout for I/O, just add the following line just after the main(). std::ios_base::sync_with_stdio(false);auto: Using auto to declare datatypes can save lot of time during programming contests. When a variable is defined as auto, compiler determines its type during compile-time.Libraries and pre-defined functions: Using builtin functions such as __gcd(A,B), swap, _builtin_popcount(R), _builtin_clz(R) etc wherever that can be applied. Try to learn different functions available in algorithm library of C++.They are useful most of the times in programs Ultimately, by using these smart tricks you can easily write code in a minimum amount of time and words. Comment More infoAdvertise with us Next Article Writing C/C++ code efficiently in Competitive programming S Shubham Improve Article Tags : Competitive Programming C++ DSA CPP-Competitive-Programming Practice Tags : CPP 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