output.txt` to take input from input.txt and write to output.txt. Then you can easily run your file with ctrl + alt + n \n\n
\n\n### Bonus \n\n[CP Editor](https://cpeditor.org/)\n\nThis editor is purposely designed for CP and Codeforces. Easy to use and many interesting features. It greatly improves typing speed as one of my friends who is a big fan of this editor suggests.\n\n
\n\n## Snippets\n\nSnippets are the cool features offered by the text editors through which you can add a bunch of code just by a few taps. \n\n- [CP Snippets by Atom.io](https://atom.io/packages/cpp-competitive-programming-snippets)\n\n
\nYou can add your own snippets as for loading your template, adding a bfs code or for anything you want. Just look for how to add custom snippets in your text editor.\n\n- [VSCode Guide - Blog](https://code.visualstudio.com/docs/editor/userdefinedsnippets)\n\n- [Sublime Text 3 - Video & Blog](https://devdojo.com/episode/how-to-create-sublime-text-snippets)\n\n
\n\n> Now you're all set to solve the [problems](https://github.com/luctivud/All-Of-Competitive-Programming/tree/master/01-Material).\n\n> I've mentioned all the popular setups. If you're facing an error in setting up it is easy to google it and find solution on stackoverflow. "
},
{
"path": "01-Material/README.md",
"content": "# CP Material\n\nMany of the seniors as well good competitive coders advice to not waste any money on the courses which are designed for beginners. It is always easy to start cp on your own and be good at it. However you can choose to have a good certification on Data Structures and ALgorithms offered by [Codechef](https://www.codechef.com/certification/data-structures-and-algorithms/about) or choose a course which aims at advanced data structures and algorithms.\n\n\n\n
\n\n\n\n#### Content\n\n* [Books](#books)\n\n* [Informative Blogs](#some-good-and-informative-blogs-)\n\n* [Problemset](#Problemset)\n\n\n\n
\n\n\n\n## Books:\n
\n\n* Check out [this](https://github.com/lnishan/awesome-competitive-programming#books-for-algorithms) section for a long list of books.\n\n* I prefer to have [Competitive Programmers Handbook by Antti Laaksonen](https://cses.fi/book/book.pdf) and [Introduction To Algorithms by CLRS](https://web.iiit.ac.in/~pratik.kamble/storage/Algorithms/Cormen_Algorithms_3rd.pdf) as mandatory. \n\n> Note: The best time to read the topics in any book is either in the morning or in the evening to grasp everything. \n\n\n\n\n
\n\n\n\n## Some good and informative blogs :\n
\n\nBelow is the encyclopedia of all that one needs to set up the schedule of cp and start away asap.\n\n* [ACM-ICPC Preparation Repository by BedirT](https://github.com/BedirT/ACM-ICPC-Preparation) : The curriculum and schedule one needs to follow to learn data structures and algorithms for ICPC.\n\n* [Getting into Competitive Coding by hyp0cr1t3](https://github.com/the-hyp0cr1t3/CC) : This repo is best for starting cp. It contains everything you need to master cp from basic setup to data structures along with decent problemset. Make sure to check the tips and tricks section.\n \n* [Awesome Competitive Programming by lnishan](https://github.com/lnishan/awesome-competitive-programming) : The encyclopedia of cp. It contains in-depth analysis as well as topic wise practice problems. Probably more than one can ask for.\n\n* [Competitive Coding Implementation (C++) by Ashishgup](https://github.com/Ashishgup1/Competitive-Coding) : Whenever you run into any problem, just check the implementation of Ashish Sir. His codes are easy to understand and beautifully formatted.\n\n* [Competitive Coding Implementation (Python) by cheran-senthil](https://github.com/cheran-senthil/PyRival) : Python Oriented Library for Competitive Programming.\n\n* [OEIS](https://oeis.org/) : who doesn't love integer sequences? Well everyone should.\n\n\n\n\n\n\n
[Back To Top](#cp-material)
\n\n\n\n\n\n\n## Problemset\n
\n\nThe problemset is divided into two broad categories based on beginner or intermediate level of knowledge. \n\n* [Beginners](#Beginners)\n\n* [Intermediate](#intermediate)\n\n\n\n
[Back To Top](#cp-material)
\n\n\n\n\n### Beginners\n\n
\n\n\n* **Start :**\n\n :page_facing_up: [TopCoder-Introduction to Competitive Programming](https://www.topcoder.com/community/competitive-programming/tutorials) \n\n :movie_camera: [Starting CP - Errichto - Youtube](https://www.youtube.com/watch?v=xAeiXy8-9Y8) \n\n :page_facing_up: [Codingblocks](https://blog.codingblocks.com/2019/start-with-competitive-programming/) \n\n :page_facing_up: [How to start CC - cf](https://codeforces.com/blog/entry/49157) \n
\n\n* **Train :**\n\n :page_facing_up: [Must do Maths in CP - Gfg](https://www.geeksforgeeks.org/math-in-competitive-programming/?ref=leftbar-rightbar) \n\n :page_facing_up: [Hackerearth - Codemonk](https://www.hackerearth.com/blog/developers/hackerearth-codemonk-v2-0/) \n\n :page_facing_up: [Training Roadmap for newcomers - cf](https://codeforces.com/blog/entry/65133) \n\n - [ ] [Arabic CP](https://github.com/mostafa-saad/ArabicCompetitiveProgramming/) and the [Junior Training Sheet](https://docs.google.com/spreadsheets/d/1iJZWP2nS_OB3kCTjq8L6TrJJ4o-5lhxDOyTaocSYc-k/edit#gid=1160016643) as well as [Supervision Template](https://docs.google.com/spreadsheets/d/1QUegTqKnVtdejCwttYFXHeOQs6Q5nmAT77sxWh3qYMc/edit#gid=2139527441).\n\n - [ ] [20+ leetcode problems on Sliding Window](https://leetcode.com/discuss/general-discussion/657507/Sliding-Window-for-Beginners-Problems-or-Template-or-Sample-Solutions)\n
\n\n\n* **Solve :**\n\n It is adviced to solve beginner level problems with lower rating first and then jump to higher ratings when you start feeling comfortable. \n\n Do not copy paste solutions directly from editorial without implementing on your own.\n\n - [ ] [CSES Problemset](https://cses.fi/problemset/)\n\n - [ ] [A2OJ Ladders](https://a2oj.com/ladders)\n\n - [ ] [Another A2OJ ladder](https://earthshakira.github.io/a2oj-clientside/server/Categories.html) : Mirror\n\n - [ ] [CodeForces-Ladders with updated problemset](https://github.com/karansinghgit/CodeForces-Ladders)\n
\n\n* **Bonus :**\n\n :page_facing_up: [Simple Trick to detect integer overflow - codechef discuss](https://discuss.codechef.com/t/simple-trick-to-detect-integer-overflow-c-c/54373) \n\n :page_facing_up: [Catching silly mistakes with GCC](https://codeforces.com/blog/entry/15547) \n\n\n\n\n\n
[Back To Problemset](#problemset)
\n\n\n\n\n### Intermediate\n\n
\n\nSolving the beginner level problems from the above resources will be enough to get a sound knowledge of basic Maths, Greedy, AdHoc and other constructive problems and their approach.\n\nFor Data Structures and Algorithms, consider: \n\n- [ ] [Codechef Blog on Data Structures and Algorithms with 100+ Problems and Tutorial](https://discuss.codechef.com/t/data-structures-and-algorithms/6599) : This blog has tutorials and practice problems for most of the data structures and algorithms that one can come across.\n\n:page_facing_up: [CP Algorithm](https://cp-algorithms.com/) : This online project is the English translation of a popular [russian site](http://e-maxx.ru/algo) containing descriptions of many algorithms and data structures especially popular in field of competitive programming and practice problems.\n\n:page_facing_up: [Important Algorithms for Competitive Programming - Code of Geeks](https://codeofgeeks.com/important-algorithms-for-competitive-programming/) \n\n:page_facing_up: [vplanetcoding](https://www.vplanetcoding.com/course2) : Check out all the free courses.\n\n- [ ] [Junior Training Sheet](https://docs.google.com/spreadsheets/d/1iJZWP2nS_OB3kCTjq8L6TrJJ4o-5lhxDOyTaocSYc-k/edit#gid=1160016643) & [CSES Prolemset](https://cses.fi/problemset/) - (Again!)\n\n
\n\n\n>The problems are majorly categorized into following topics for now:\n
\n\n**Content**\n
\n\n* [Graphs](#Graphs)\n\n* [Dynamic Programming](#Dynamic-Programming)\n\n* [Trees](#Trees)\n\n* [Other](#Other)\n\n\n\n\n
[Back To Problemset](#problemset)
\n \n\n\n \n## Graphs\n
\n\n* #### Tutorial :\n\n :page_facing_up: [CF-Center of graph](https://codeforces.com/blog/entry/17974) \n\n :page_facing_up: [Longest Path Problem - Wikipedia](https://en.wikipedia.org/wiki/Longest_path_problem) \n\n :page_facing_up: [Graph Diameter - Mathworld](https://mathworld.wolfram.com/GraphDiameter.html) \n\n\n* #### Problemset :\n\n - [ ] [Codeforces comment with 100+ graph problems](https://codeforces.com/blog/entry/55219?#comment-390897)\n\n - [ ] [international-open-olympiad-kpiopen-2013-round-1](https://codeforces.com/gym/100279/attachments/download/2025/20122013-international-open-olympiad-kpiopen-2013-round-1-en.pdf)\n\n - [ ] [LeetCode Graph Related Problems](https://leetcode.com/list/x1vj23fh/)\n\n - [ ] [500+ Problems on BFS/DFS/Dijkshtra - A2OJ](https://a2oj.com/category?ID=13)\n\n\n **IARCS**\n - [ ] [Graphs](https://www.iarcs.org.in/inoi/online-study-material/topics/graphs.php)\n - [ ] [Advanced Graph Algo](https://www.iarcs.org.in/inoi/online-study-material/topics/advanced-graph-algorithms.php)\n\n **Union Find**\n - [ ] [leetcode : friend-circle](https://leetcode.com/problems/friend-circles/)\n - [ ] [leetcode : redundant-connection](https://leetcode.com/problems/redundant-connection/)\n - [ ] [leetcode : most-stones-removed-with-same-row-or-column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/)\n - [ ] [leetcode : number-of-operations-to-make-network-connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/)\n - [ ] [leetcode : satisfiability-of-equality-equation](https://leetcode.com/problems/satisfiability-of-equality-equations/)\n - [ ] [leetcode : accounts-merge](https://leetcode.com/problems/accounts-merge/)\n\n **DFS - Basic**\n - [ ] [leetcode : surrounded-region](https://leetcode.com/problems/surrounded-regions/)\n - [ ] [leetcode : number-of-enclave](https://leetcode.com/problems/number-of-enclaves/)\n - [ ] [leetcode : time-needed-to-inform-all-employee](https://leetcode.com/problems/time-needed-to-inform-all-employees/)\n - [ ] [leetcode : find-eventual-safe-state](https://leetcode.com/problems/find-eventual-safe-states/)\n\n **Island Problems**\n - [ ] [leetcode : number-of-closed-island](https://leetcode.com/problems/number-of-closed-islands/)\n - [ ] [leetcode : number-of-island](https://leetcode.com/problems/number-of-islands/)\n - [ ] [leetcode : keys-and-room](https://leetcode.com/problems/keys-and-rooms/)\n - [ ] [leetcode : max-area-of-island](https://leetcode.com/problems/max-area-of-island/)\n - [ ] [leetcode : flood-fill](https://leetcode.com/problems/flood-fill/)\n\n **BFS**\n - [ ] [http://codeforces.com/contest/653/problem/E](http://codeforces.com/contest/653/problem/E)\n - [ ] [https://codeforces.com/contest/769/problem/C](https://codeforces.com/contest/769/problem/C)\n - [ ] [https://codeforces.com/contest/796/problem/D](https://codeforces.com/contest/796/problem/D)\n - [ ] [https://codeforces.com/contest/821/problem/D](https://codeforces.com/contest/821/problem/D)\n - [ ] [http://www.spoj.com/problems/DIGOKEYS/](http://www.spoj.com/problems/DIGOKEYS/)\n - [ ] [http://www.spoj.com/problems/SPIKES/](http://www.spoj.com/problems/SPIKES/)\n - [ ] [http://www.spoj.com/problems/MULTII/](http://www.spoj.com/problems/MULTII/)\n - [ ] [http://www.spoj.com/problems/ADV04F1/](http://www.spoj.com/problems/ADV04F1/)\n - [ ] [http://www.spoj.com/problems/ADV04F1/](http://www.spoj.com/problems/ADV04F1/)\n - [ ] [leetcode : 01-matrix](https://leetcode.com/problems/01-matrix/)\n - [ ] [leetcode : as-far-from-land-as-possible](https://leetcode.com/problems/as-far-from-land-as-possible/)\n - [ ] [leetcode : rotting-orange](https://leetcode.com/problems/rotting-oranges/)\n - [ ] [leetcode : shortest-path-in-binary-matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)\n\n **Graph Coloring**\n - [ ] [leetcode : possible-bipartition](https://leetcode.com/problems/possible-bipartition/)\n - [ ] [leetcode : is-graph-bipartite](https://leetcode.com/problems/is-graph-bipartite/)\n\n **Topological Sort**\n - [ ] [leetcode : course-schedule](https://leetcode.com/problems/course-schedule/)\n - [ ] [leetcode : course-schedule-ii](https://leetcode.com/problems/course-schedule-ii/)\n - [ ] [codeforces : 510C-Fox and names](https://codeforces.com/contest/510/problem/C)\n\n **Other**\n - [ ] [https://dmoj.ca/problem/tle16c4p4](https://dmoj.ca/problem/tle16c4p4)\n - [ ] [https://codeforces.com/problemset/problem/322/E](https://codeforces.com/problemset/problem/322/E)\n - [ ] [https://codeforces.com/problemset/problem/592/D](https://codeforces.com/problemset/problem/592/D)\n - [ ] [https://codeforces.com/contest/456/problem/E](https://codeforces.com/contest/456/problem/E)\n \n\n The above problems were extracted from [this leetcode article](https://leetcode.com/discuss/general-discussion/655708/graph-for-beginners-problems-pattern-sample-solutions). Thanks to the work of [wh0ami sir](https://leetcode.com/wh0ami/).\n\n\n\n\n\n\n
[Back To Problemset](#problemset)
\n \n\n\n\n\n \n## Dynamic Programming\n
\n\n* #### Tutorial :\n\n :page_facing_up: [Hackerearth](https://www.hackerearth.com/practice/algorithms/dynamic-programming/introduction-to-dynamic-programming-1/tutorial/) \n\n :page_facing_up: [Codechef Tutorial and few problems](https://www.codechef.com/wiki/tutorial-dynamic-programming) \n\n :page_facing_up: [TutorialsPoint Blog](https://www.tutorialspoint.com/data_structures_algorithms/dynamic_programming.htm) \n\n :movie_camera: [CS Dojo - Youtube](https://www.youtube.com/watch?v=vYquumk4nWw) \n\n :movie_camera: [Aditya Verma - Youtube](https://www.youtube.com/watch?v=nqowUJzG-iM&list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go) Check this one out.\n\n :movie_camera: [CodeN Code - youtube](https://www.youtube.com/watch?v=AfE1nZjG5ZM&list=PL2q4fbVm1Ik71hmKyay-GkU6J9GTXCe5g) \n\n :page_facing_up: [Dynamic Programming Beginner's Course](https://discuss.codechef.com/t/dynamic-programming-beginners-course/70936) contains problems and video tutorials.\n\n* #### Problemset :\n\n - [ ] [100+ LeetCode problems - wh0ami](https://leetcode.com/discuss/general-discussion/662866/Dynamic-Programming-for-Practice-Problems-Patterns-and-Sample-Solutions)\n\n - [ ] [100+ codeforces problems - karansinghgit](https://github.com/karansinghgit/CodeForces-Ladders/blob/master/dynamicProgramming.md)\n\n - [ ] [1000+ problems on DP - A2OJ](http://a2oj.com/category?ID=33)\n\n - [ ] [Few other DP problems - A2OJ](https://a2oj.com/category?ID=758)\n\n - [ ] [AtCoder DP Contest](https://atcoder.jp/contests/dp/tasks)\n\n - [ ] [30+ Non-Classical Dynamic Programming problems - A2OJ](https://a2oj.com/category?ID=126)\n\n\n\n
[Back To Problemset](#problemset)
\n \n \n\n\n\n## Trees\n
\n\n* #### Tutorial :\n\n :page_facing_up: [Trees - hackerearth](https://www.hackerearth.com/practice/notes/trees/) \n\n :page_facing_up: [Fenwick Tree - gfg](https://www.geeksforgeeks.org/binary-indexed-tree-or-fenwick-tree-2/) \n\n :page_facing_up: [Dynamic Programming on Trees - gfg](https://www.geeksforgeeks.org/dynamic-programming-trees-set-1/) \n \n :movie_camera: [Dynamic Programming on Trees - Aditya Verma - Youtube](https://www.youtube.com/playlist?list=PL_z_8CaSLPWfxJPz2-YKqL9gXWdgrhvdn) \n\n\n* #### Problemset :\n\n - [ ] [Vplanet](https://www.vplanetcoding.com/course3)\n\n - [ ] [Binary and n-ary trees - Hackerearth](https://www.hackerearth.com/practice/data-structures/trees/binary-and-nary-trees/practice-problems/)\n\n - [ ] [BST - hackerearth](https://www.hackerearth.com/practice/data-structures/trees/binary-search-tree/practice-problems/)\n\n - [ ] [Heaps - hackerearth](https://www.hackerearth.com/practice/data-structures/trees/heapspriority-queues/practice-problems/)\n\n - [ ] [GERALD2 - codechef](http://www.codechef.com/NOV13/problems/GERALD2)\n\n - [ ] [GERALD07 - codechef](http://www.codechef.com/MARCH14/problems/GERALD07)\n\n - [ ] [FBCHEF - codechef](http://www.codechef.com/APRIL14/problems/FBCHEF)\n\n - [ ] [GERALD08 - codechef](http://www.codechef.com/APRIL14/problems/GERALD08)\n\n - [ ] [MLCHEF - codechef](https://www.codechef.com/SEPT13/problems/MLCHEF)\n \n - [ ] [200+ Problems on Trees - A2OJ](https://a2oj.com/category?ID=89)\n\n - [ ] [150+ Problems on Segment Trees - A2OJ](https://a2oj.com/category?ID=25)\n\n - [ ] [20+ problems on Balanced BST - A2OJ](https://a2oj.com/category?ID=14)\n\n - [ ] [20+ problems on suffix array A2OJ](https://a2oj.com/category?ID=44)\n\n\n\n\n
[Back To Problemset](#problemset)
\n \n\n\n\n\n \n## Other\n
\n\n:movie_camera: [Algorithm - SecondThread - Youtube](https://www.youtube.com/watch?v=cVBzMXYc4ss&list=PLZU0kmvryb_HZpDW2yfn-H-RxAu_ts6xq)\n\n:page_facing_up: [Matrix Exponentiation cf Blog](https://codeforces.com/blog/entry/67776) \n\n:page_facing_up: [Matrix Expo - gfg](https://www.geeksforgeeks.org/matrix-exponentiation/) \n\n:movie_camera: [Matrix Expo - Errichto - Youtube](https://www.youtube.com/watch?v=eMXNWcbw75E) \n\n- [ ] [Matrix Expo - Problems - Mashup](https://codeforces.com/gym/102644)\n\n- [ ] [90+ problems on matrix expo - A2OJ](https://a2oj.com/category?ID=32)\n\n\n\n
[Back To Problemset](#problemset)
\n\n\n\n\n> Note: There's a whole lot of problems still to be added. Any help will be appreciated."
},
{
"path": "02-Codes/Editorials/ConvertToStrictlyIncreasing/ConevertToStrictlyIncreasing.md",
"content": " Convert an array into Strictly Increasing Array
\n Solution by Udit Gupta \n\n\n
\n\n Problem Statement
\n\nGiven an array consisting of N elements namely from A1 to AN. You have to convert this array to strictly increasing array in not more than K cost. \nOperations allowed :\n1. Increase an element by 1.\n2. Decrease an element by 1.\n\nCost of each operation is 1 unit.\n\n\n\n Constraints
\n\n- N < 3000 \n \n- K < 5000 \n \n- |Ai| < 109 for all i from 1 to N.\n \n\n\n Expected Time Complexity : O(N2)
\n \n \n \n \n
\n\n Solution
\n\n Observation
\n \n \n 1. After solving a few examples on pen and paper, we get to see that a greedy solution would fail on cases like [8, 1, 2, 3, 4] or [7, 1, 5, 2, 4, 8, 6].\n \n 2. Another key observation is that in the transformed array which is strictly increasing, we will find that there is atleast one element which remains unchanged. \n
\n \n Deduction
\n\nThe problem statement above can be translated into simpler terms by stating that \n\nfor each i from _1_ to _N-1_, **Ai < Ai+1**\n\nNow we shall work on simplifying it further and deducing a general formula for all terms, \n\n- **Ai < Ai+1**\n\n- **Ai ≤ Ai+1 - 1**\n\n- Subtracting i from both sides, \n\n- **Ai-i ≤ Ai+1-1-i**\n\n_or_\n\n- **Ai-i ≤ Ai+1-(i+1)**\n\nThis is the general formulation which should work for all indices in range [1, N].\ni.e. \n\nThe sequence represented by **(Ai-i)** ∀ i ∈ [1, N] should be a **non decreasing sequence**.\n\nTo achieve this we take use of dynamic programming and brute force our way to make the subsequent array element equal to the previous one if not or leaving it as it is depending on the previous dp state. \n\nThis idea, here, comes from observation 2 and we can even end up converting the whole array to a single element. \n\n\nDP transition states:\n\n- **dp[j] = min(dp[j-1], dp[j] + abs(A[i] - B[j]))** ∀ i, j ∈ [1, N]. \n\nPlease note that the array **A** here is the converted array represented by (Ai-i) ∀ i ∈ [1, N] and **B** is its sorted version. \n\nOur final answer that represents the minimum cost is stored in the final index of our **dp** array which represents the optimal array till last index of **A**.\n
\n\nIf our minimum cost is not more than **K** then we can certainly achieve the optimal solution.\n\nNote : This dp solution can be made more state verbose by storing the brute forced optimal substructure into their respective states in dp[i][j] but I prefer it this way. \n\n\n Python Code
\n\n\n```python\nN = int(input())\nK = int(input())\nA = [0] + list(map(int, input().split()))\n\n# Convert A[i] = A[i] - i\nfor i in range(1, N+1):\n\tA[i] = A[i] - i\n\n# store sorted A in B to stay working\n# with best possible element already\nB = [0] + sorted(A[1:])\n\n# dp array \ndp = [0 for x in range(N+1)]\n\n# unreachable state\ndp[0] = float('inf')\n\nfor i in range(1, N+1):\n\tfor j in range(1, N+1):\n\t\tdp[j] = min(dp[j-1], dp[j] + abs(A[i] - B[j]))\n\n\n# dp[N] represent the ans\nprint(\"YES \"+str(dp[N]) if dp[N] <= K else \"NO\")\n```\n \n
\n \n\n\n C++ Code
\n\n\n```cpp\n#include\n#include\n#include\n\nsigned main() {\n\tlong long N, K;\n\tstd::cin >> N >> K;\n\n\tstd::vector A(N+1, 0ll);\n\tfor (long long i = 1ll; i <= N; i++) {\n\t\tstd::cin >> A.at(i);\n\t\tA.at(i) -= i;\n\t}\n\n\t// sorted version of A\n\tstd::vector B{A};\n\tstd::sort(B.begin() + 1ll, B.end());\n\n\t// dp array\n\tstd::vector dp(N+1, 0ll);\n\tdp.at(0) = (long long) 1e9;\n\n\tfor (long long i = 1ll; i <= N; i++) {\n\t\tfor (long long j = 1ll; j <= N; j++) {\n\t\t\tdp.at(j) = std::min(dp.at(j-1), dp.at(j) + llabs(A.at(i) - B.at(j)));\n\t\t}\n\t}\n\n\tif (dp.at(N) <= K) {\n\t\tstd::cout << \"YES \" << dp.at(N);\n\t} else {\n\t\tstd::cout << \"NO\";\n\t}\n\n\treturn 0;\n}\n```\n \n
\n \n\n\n\n\nTime Complexity : O(N2)\n\nSpace Complexity : O (N)\n\n\n\n\n \n \n"
},
{
"path": "02-Codes/Editorials/ConvertToStrictlyIncreasing/convertToIncreasing.cpp",
"content": "#include\n\nusing namespace std;\n\nsigned main() {\n\tlong long N, K;\n\tcin >> N >> K;\n\n\tvector A(N+1, 0ll);\n\tfor (long long i = 1ll; i <= N; i++) {\n\t\tcin >> A.at(i);\n\t\tA.at(i) -= i;\n\t}\n\n\t// sorted version of A\n\tvector B{A};\n\tsort(B.begin() + 1ll, B.end());\n\n\t// dp array\n\tvector dp(N+1, 0ll);\n\tdp.at(0) = (long long) 1e9;\n\n\tfor (long long i = 1ll; i <= N; i++) {\n\t\tfor (long long j = 1ll; j <= N; j++) {\n\t\t\tdp.at(j) = min(dp.at(j-1), dp.at(j) + llabs(A.at(i) - B.at(j)));\n\t\t}\n\t}\n\n\tif (dp.at(N) <= K) {\n\t\tcout << \"YES \" << dp.at(N);\n\t} else {\n\t\tcout << \"NO\";\n\t}\n\n\treturn 0;\n}"
},
{
"path": "02-Codes/Editorials/ConvertToStrictlyIncreasing/convertToIncreasing.py",
"content": "N = int(input())\nK = int(input())\nA = [0] + list(map(int, input().split()))\n\n# Convert A[i] = A[i] - i\nfor i in range(1, N+1):\n\tA[i] = A[i] - i\n\n# store sorted A in B to stay working\n# with best possible element already\nB = [0] + sorted(A[1:])\n\n# dp array \ndp = [0 for x in range(N+1)]\n\n# unreachable state\ndp[0] = float('inf')\n\nfor i in range(1, N+1):\n\tfor j in range(1, N+1):\n\t\tdp[j] = min(dp[j-1], dp[j] + abs(A[i] - B[j]))\n\n\n# dp[N] represent the ans\nprint(\"YES \"+str(dp[N]) if dp[N] <= K else \"NO\")"
},
{
"path": "02-Codes/Editorials/Random/TransposeColorsWork.cpp",
"content": "// J A I S H R E E R A M //\n\n#include \n\n#pragma GCC optimize \"trapv\"\n// #pragma GCC optimize (\"Ofast\")\n// // #pragma GCC target (\"fpmath=sse,sse2\")\n// #pragma GCC target (\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n// #pragma GCC optimize (\"-ffloat-store\")\n\n\nusing namespace std;\n\ntypedef long long int lld;\ntypedef unsigned long long int llu;\n\n#define forn(I7, E4) for(lld I7=0ll; I7 < E4; (I7)+=1ll)\n#define forn1(I7, E4) for(lld I7=1ll; I7 < E4+1; (I7)+=1ll)\n#define len(v) ((int)((v).size()))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define f1 first\n#define s2 second\n\ntemplate ostream& operator<<(ostream &os, const pair &p) { return os << '(' << p.first << \", \" << p.second << ')'; }\ntemplate < typename T_container, typename T = typename enable_if < !is_same::value, typename T_container::value_type >::type >\nostream & operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = \", \"; return os << '}'; }\nvoid dbg_out() { cout << \"\\n\"; }\ntemplate void dbg_out(Head H, Tail... T) { cout << H << \", \"; dbg_out(T...);}\n#define _____error_____(...) cout << #__VA_ARGS__ << \" : \", dbg_out(__VA_ARGS__)\n\nconst lld d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};\nconst lld d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};\n\n\nconst long double EPS = 1e-6;\nlld TempVar, mod, MOD;\n\n\n/*\n:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n*/\n\n\n\n\n\n\nvoid solveEachTest(int _TestCase) {\n // cout << \"Case #\" << _TestCase << \": \";\n vectormoves;\n while(cin >> TempVar) {\n \tmoves.push_back((int)TempVar);\n }\n int n = (int)sqrt(moves.back());\n\n vector> matr(n+1, vector(n, '-'));\n forn(i, n) {\n \tforn(j, n) {\n \t\tmatr[i][j] = char('A' + i);\n \t}\n }\n\n matr[n][0] = '.';\n\n\n // for (auto row : matr) {\n\t// \tcout << row << \"\\n\";\n\t// } cout << \"\\n\";\n\n int sz = (int)moves.size();\n int tempX = n, tempY = 0;\n forn(i, sz-1) {\n \tint posX = moves[i] / n, posY = moves[i] % n;\n \tswap(matr[posX][posY], matr[tempX][tempY]);\n \ttempX = posX, tempY = posY;\n \t// for (auto row : matr) {\n \t// \tcout << row << \"\\n\";\n \t// } cout << \"\\n\";\n }\n\n bool ok = true;\n forn(i, n) {\n \tset cnt;\n \tforn(j, n) {\n \t\tcnt.insert(matr[i][j]);\n \t}\n \tok &= ((int)cnt.size() == n);\n }\n\n cout << \"Checker Verdict:\\n\";\n cout << (ok ? \"Accepted\" : \"Wrong Answer\") << \"\\n\";\n cout << \"Moves : \" << moves.size();\n \n return;\n}\n\n\nsigned main() {\n ios_base::sync_with_stdio(false); cin.tie(0);\n // cout.precision(10); cout << fixed;\n #ifdef LUCTIVUD\n // const auto start_time = std::chrono::high_resolution_clock::now();\n freopen(\"/home/luctivud/CPPractice/Zinput.txt\", \"r\", stdin);\n freopen(\"/home/luctivud/CPPractice/Zoutput.txt\", \"w\", stdout);\n #endif\n\n\n MOD = mod = lld(1e9) + 7ll;\n lld _T0T4 = 1;\n // cin >> _T0T4; \n\n for (int _TestCase = 1; _TestCase <= _T0T4; _TestCase++) {\n solveEachTest(_TestCase);\n cout << \"\\n\"; \n }\n\n\n #ifdef LUCTIVUD\n // auto end_time = std::chrono::high_resolution_clock::now();\n // std::chrono::duration diff = end_time - start_time;\n // cerr << \"Finished in : \" << diff.count() << \"\\n\";\n #endif\n\n return 0; \n}\n\n\n/* ~~\nAuthor : Udit \"luctivud\" Gupta \nlinkedin : https://www.linkedin.com/in/udit-gupta-1b7863135/\n*/\n"
},
{
"path": "02-Codes/README.md",
"content": " Containing codes of some problems
\n\n Check the subfolders for contents, it has some snippets and editorials
\n"
},
{
"path": "02-Codes/Snippets/Raw/166_e_MatMul_w_Ashishgup.cpp",
"content": "// J A I S H R E E R A M //\n\n#include \n\n#pragma GCC optimize \"trapv\"\n// #pragma GCC optimize (\"Ofast\")\n// // #pragma GCC target (\"fpmath=sse,sse2\")\n// #pragma GCC target (\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n// #pragma GCC optimize (\"-ffloat-store\")\n\n\nusing namespace std;\n\ntypedef long long int lld;\ntypedef unsigned long long int llu;\n\n#define forn(I7, E4) for(lld I7=0ll; I7 < E4; (I7)+=1ll)\n#define forn1(I7, E4) for(lld I7=1ll; I7 < E4+1; (I7)+=1ll)\n#define len(v) ((int)((v).size()))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define f1 first\n#define s2 second\n\ntemplate ostream& operator<<(ostream &os, const pair &p) { return os << '(' << p.first << \", \" << p.second << ')'; }\ntemplate < typename T_container, typename T = typename enable_if < !is_same::value, typename T_container::value_type >::type >\nostream & operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = \", \"; return os << '}'; }\nvoid dbg_out() { cout << \"\\n\"; }\ntemplate void dbg_out(Head H, Tail... T) { cout << H << \", \"; dbg_out(T...);}\n#define _____error_____(...) cout << #__VA_ARGS__ << \" : \", dbg_out(__VA_ARGS__)\n\nconst lld d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};\nconst lld d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};\n\n\nconst long double EPS = 1e-6;\nlld TempVar, mod, MOD;\n\n\n/*\n:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n*/\n\n\n// matrix exponentiation snippet::\n// // courtesy Ashishgup3 via Github\n\n\n\n\n\nlld add(lld a, lld b) {\n lld res = a + b;\n if(res >= MOD) return res - MOD;\n return res;\n}\n\nlld mult(lld a, lld b) {\n long long res = a;\n res *= b;\n if(res >= MOD) return res % MOD;\n return res;\n}\n\n\n\nconst lld SZ = 2; // size of MaGiC \n\nstruct matrix {\n lld MaGiC[SZ][SZ];\n\n void reset() {\n memset(MaGiC, 0, sizeof(MaGiC));\n }\n\n void makeiden() {\n reset();\n for(lld i=0;i>= 1;\n }\n return res;\n}\n\n\n// // GUIDE :\n//\n// matrix m;\n// m.makeiden();\n//\n// m.MaGiC[0][0] = 0, m.MaGiC[0][1] = 1;\n// m.MaGiC[1][0] = 3, m.MaGiC[1][1] = 2;\n//\n// m = power(m, n);\n//\n// cout << m.MaGiC[0][0];\n\n\t\t\n\n\n\n\n\n\nvoid solveEachTest(int _TestCase) {\n // cout << \"Case #\" << _TestCase << \": \";\n lld n; cin >> n;\n\n matrix m;\n m.makeiden();\n\n m.MaGiC[0][0] = 0, m.MaGiC[0][1] = 1;\n m.MaGiC[1][0] = 3, m.MaGiC[1][1] = 2;\n\n m = power(m, n);\n\n cout << m.MaGiC[0][0];\n \n return;\n}\n\n\nsigned main() {\n ios_base::sync_with_stdio(false); cin.tie(0);\n // cout.precision(10); cout << fixed;\n #ifdef LUCTIVUD\n // const auto start_time = std::chrono::high_resolution_clock::now();\n freopen(\"/home/luctivud/CPPractice/Zinput.txt\", \"r\", stdin);\n freopen(\"/home/luctivud/CPPractice/Zoutput.txt\", \"w\", stdout);\n #endif\n\n\n MOD = mod = lld(1e9) + 7ll;\n lld _T0T4 = 1;\n // cin >> _T0T4; \n\n for (int _TestCase = 1; _TestCase <= _T0T4; _TestCase++) {\n solveEachTest(_TestCase);\n cout << \"\\n\"; \n }\n\n\n #ifdef LUCTIVUD\n // auto end_time = std::chrono::high_resolution_clock::now();\n // std::chrono::duration diff = end_time - start_time;\n // cerr << \"Finished in : \" << diff.count() << \"\\n\";\n #endif\n\n return 0; \n}\n\n\n/* ~~\nAuthor : Udit \"luctivud\" Gupta \nlinkedin : https://www.linkedin.com/in/udit-gupta-1b7863135/\n*/\n"
},
{
"path": "02-Codes/Snippets/Sublime/FastReadWrite.sublime-snippet",
"content": "\n 57) && c != '-'); c = gc());\n if (c == '-') {neg = 1; c = gc();}\n for (; c > 47 && c < 58; c = gc()) {x = (x << 1) + (x << 3) + c - 48;}\n if (neg) x = -x;\n}\n\nvoid scanLong(lld &x) {\n register lld c = gc();\n x = 0;\n bool neg = 0;\n for (; ((c < 48 || c > 57) && c != '-'); c = gc());\n if (c == '-') {neg = 1; c = gc();}\n for (; c > 47 && c < 58; c = gc()) {x = (x << 1) + (x << 3) + c - 48;}\n if (neg) x = -x;\n}\n\n#define pc(x) putchar_unlocked(x);\n\ninline void writeInt (int n) {\n int N = n, rev, count = 0;\n rev = N;\n if (N == 0) { pc('0'); pc('\\n'); return ;}\n while ((rev % 10) == 0) { count++; rev /= 10;} //obtain the count of the number of 0s\n rev = 0;\n while (N != 0) { rev = (rev << 3) + (rev << 1) + N % 10; N /= 10;} //store reverse of N in rev\n while (rev != 0) { pc(rev % 10 + '0'); rev /= 10;}\n while (count--) pc('0');\n pc ('\\n');\n}\n\n\ninline void writeLong (lld n) {\n lld N = n, rev, count = 0;\n rev = N;\n if (N == 0) { pc('0'); pc('\\n'); return ;}\n while ((rev % 10) == 0) { count++; rev /= 10;} //obtain the count of the number of 0s\n rev = 0;\n while (N != 0) { rev = (rev << 3) + (rev << 1) + N % 10; N /= 10;} //store reverse of N in rev\n while (rev != 0) { pc(rev % 10 + '0'); rev /= 10;}\n while (count--) pc('0');\n pc ('\\n');\n}\n\n\n\n]]>\n snip-read-write-fast\n FastIo\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/addundirectededge.sublime-snippet",
"content": "\n adj[]) {\n adj[a].push_back(b);\n adj[b].push_back(a);\n return;\n}\n\n\n]]>\n snip-add-undirected-edge\n Add Undirected Edge\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/basic-template.sublime-snippet",
"content": "\n \n#pragma GCC optimize \"trapv\"\n\nusing namespace std;\n\ntypedef long long int lld;\n\nsigned main() {\n\t\n\t// Input - Output and optimization\n\t\n ios_base::sync_with_stdio(false); cin.tie(0);\n cout.precision(10); cout << fixed;\n\n #ifdef LUCTIVUD\n freopen(\"/home/luctivud/CPPractice/Zinput.txt\", \"r\", stdin);\n freopen(\"/home/luctivud/CPPractice/Zoutput.txt\", \"w\", stdout);\n #endif\n\n $0\n return 0;\n}\n\n]]>\n snip-basic-template\n Basic Template for c++\n \n source.c++ \n"
},
{
"path": "02-Codes/Snippets/Sublime/check execution time.sublime-snippet",
"content": "\n (S34p - S34t);\n cout << \"Time Elapsed: \" << D34n.count() / (long double) 1e6 << \" seconds\" << endl; \n\n]]>\n snip-debug\n CP Template\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/checkvalid.sublime-snippet",
"content": "\n\t= 0 and i < n;\n}\n\n]]>\n\t\n\tsnip-checkvalid\n\t\n\tsource.c++\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/cmp-priority.sublime-snippet",
"content": "\n >\nclass ${1:cmp} {\npublic:\n bool operator() (${2:const pair } &a, ${2:const pair } &b) {\n return ${3:a.s2 > b.s2};\n }\n};\n]]>\n snip-cmp-pq\n cmp for priority queue\n \n source.c++ \n\n"
},
{
"path": "02-Codes/Snippets/Sublime/common-completions.sublime-completions",
"content": "{\n \"scope\": \"source.c++, meta.block.c++, meta.function.c++\",\n\n \"completions\":\n [\n {\"trigger\": \"vectorlld\", \"contents\": \"vector ${1:arr}\"}, \n {\"trigger\": \"vectorpalld\", \"contents\": \"vector> ${1:arr}\"}, \n {\"trigger\": \"vectorvelldp2\", \"contents\": \"vector> ${1:dp}(${2:n}, vector(${3:m}, ${4:-1})) $0\"}, \n {\"trigger\": \"vectorstr\", \"contents\": \"vector ${1:arr}\"}, \n {\"trigger\": \"vectorcha\", \"contents\": \"vector ${1:arr}\"}, \n {\"trigger\": \"vectorboo\", \"contents\": \"vector ${1:visited}\"}, \n {\"trigger\": \"setlld\", \"contents\": \"set ${1:visited}\"}, \n {\"trigger\": \"setpall\", \"contents\": \"set> ${1:arr}\"}, \n {\"trigger\": \"setstr\", \"contents\": \"set ${1:arr}\"}, \n {\"trigger\": \"setchar\", \"contents\": \"set ${1:arr}\"}, \n {\"trigger\": \"setbool\", \"contents\": \"set ${1:arr}\"}, \n {\"trigger\": \"maplld\", \"contents\": \"map ${1:arr}\"}, \n {\"trigger\": \"mapstr\", \"contents\": \"map ${1:arr}\"}, \n {\"trigger\": \"front\", \"contents\": \"front()\"}, \n {\"trigger\": \"first\", \"contents\": \"first\"}, \n {\"trigger\": \"second\", \"contents\": \"second\"}, \n {\"trigger\": \"make_pair\", \"contents\": \"make_pair(${1:fir}, ${2:sec})\"}, \n {\"trigger\": \"make_tuple\", \"contents\": \"make_tuple\"}, \n {\"trigger\": \"push_back\", \"contents\": \"push_back(${1:el})\"}, \n {\"trigger\": \"max_element\", \"contents\": \"max_element(all(${1:arr}))\"}, \n {\"trigger\": \"min_element\", \"contents\": \"min_element(all(${1:arr}))\"}, \n {\"trigger\": \"accumulate\", \"contents\": \"accumulate(all(${1:arr}), ${2:0ll})\"}, \n {\"trigger\": \"sortarr\", \"contents\": \"sort(${1:r}all(${2:arr}))\"}, \n {\"trigger\": \"emplace_back\", \"contents\": \"emplace_back()\"}, \n {\"trigger\": \"insert\", \"contents\": \"insert()\"}, \n {\"trigger\": \"push\", \"contents\": \"push()\"}, \n {\"trigger\": \"for4\", \"contents\": \"for4(${1: i}, ${2:0ll}, ${3:n}, ${4:1ll}) {${0}}\"}, \n {\"trigger\": \"EACH\", \"contents\": \"EACH(${1:it}, ${2:arr}) {${0}}\"}, \n {\"trigger\": \"find\", \"contents\": \"find(all(${1:arr}), ${2:val}) != ${1:arr}.end()\"}, \n {\"trigger\": \"lower_bound\", \"contents\": \"lower_bound(all(${1:arr}), ${2:val})\"}, \n {\"trigger\": \"upper_bound\", \"contents\": \"upper_bound(all(${1:arr}), ${2:val})\"}, \n {\"trigger\": \"reverse\", \"contents\": \"reverse(all(${1:arr}))\"}, \n {\"trigger\": \"len\", \"contents\": \"len(${1:arr})\"}, \n // {\"trigger\": \"debspace\", \"contents\": \"debspace(${1})\"}, \n // {\"trigger\": \"debline\", \"contents\": \"debline(${1})\"}, \n {\"trigger\": \"error\", \"contents\": \"_____error_____(${1})\"}, \n {\"trigger\": \"cin\", \"contents\": \"cin >> \"}, \n {\"trigger\": \"cout\", \"contents\": \"cout << \"}, \n {\"trigger\": \"d4dir\", \"contents\": \"const lld d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};\"}, \n {\"trigger\": \"d8dir\", \"contents\": \"const lld d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};\"},\n // {\"trigger\": \"read\", \"contents\": \"Read(${1})\"}, \n // {\"trigger\": \"println\", \"contents\": \"Println(${1})\"}, \n // {\"trigger\": \"NOYES\", \"contents\": \"Println(\\\"NO\\\\0YES\\\" + 3 * (${1:condition}));\"}, \n {\"trigger\": \"transform\", \"contents\": \"transform(all(${1:str}), ${1:str}.begin(), ::to${2:low}er);\"}, \n ]\n}\n\n\n\n// \"vector ${1:arr}\",\n// \"vector> ${1:arr}\",\n// \"vector> ${1:dp}(${2:n}, vector(${3:m}, ${4:-1})) $0\",\n// \"vector ${1:arr}\",\n// \"vector ${1:arr}\",\n// \"vector ${1:visited}\",\n// \"set ${1:visited}\",\n// \"set> ${1:arr}\",\n// \"set ${1:arr}\",\n// \"set ${1:arr}\",\n// \"set ${1:arr}\",\n// \"map ${1:arr}\",\n// \"map ${1:arr}\",\n// \"map ${1:arr}\",\n// \"front()\",\n// \"first\",\n// \"second\",\n// \"make_pair(${1:fir}, ${2:sec})\",\n// \"make_tuple\",\n// \"push_back(${1:el})\",\n// \"max_element(all(${1:arr}))\",\n// \"min_element(all(${1:arr}))\",\n// \"accumulate(all(${1:arr}), ${2:0ll})\", \n// \"emplace_back()\",\n// \"insert()\",\n// \"push()\",\n// \"input(${0})\",\n// \"for4(${1: i}, ${2:0ll}, ${3:n}, ${4:1ll}) {${0}}\",\n// \"EACH(${1:it}, ${2:arr}) {${0}}\",\n// \"find(all(${1:arr}), ${2:val}) != ${1:arr}.end()\",\n// \"lower_bound(all(${1:arr}), ${2:val})\",\n// \"upper_bound(all(${1:arr}), ${2:val})\",\n// \"reverse(all(${1:arr}))\",\n// \"len(${1:arr})\",\n// \"debspace(${1})\",\n// \"debline(${1})\",\n// \"error(${1})\",\n// \"read(${1})\",\n// \"println(${1})\","
},
{
"path": "02-Codes/Snippets/Sublime/dsu-array.sublime-snippet",
"content": "\n struct DSU {\n lld par3t[SZ], ran4k[SZ];\n DSU() {\n forn(i,SZ) par3t[i] = i, ran4k[i] = 1;\n }\n \n lld find_repr(lld x) { // path compression\n if (par3t[x] != x) par3t[x] = find_repr(par3t[x]);\n return par3t[x];\n }\n \n bool Union(lld x, lld y) { // union-by-ran4k\n x = find_repr(x), y = find_repr(y);\n if (x == y) return 0;\n if (ran4k[x] < ran4k[y]) swap(x,y);\n ran4k[x] += ran4k[y], par3t[y] = x;\n return 1;\n }\n};\n \nDSU<100001> D;\n\n\n]]>\n snip-dsu-array\n dsu using path compression\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/dsu.sublime-snippet",
"content": "\n &par3t, vector &ran4k) {\n iota(all(par3t), 0ll);\n}\n\nlld find_repr(lld x, vector &par3t, vector &ran4k) {\n if (x != par3t[x])\n par3t[x] = find_repr(par3t[x], par3t, ran4k);\n return par3t[x];\n}\n\nvoid Union(lld x, lld y, vector &par3t, vector &ran4k) {\n x = find_repr(x, par3t, ran4k);\n y = find_repr(y, par3t, ran4k);\n\n if (x == y) return;\n\n if (ran4k[x] < ran4k[y]) { \n par3t[x] = y; \n } else if (ran4k[x] > ran4k[y]) { \n par3t[y] = x; \n } else { \n par3t[y] = x; \n ran4k[x] = ran4k[x] + 1; \n } \n return;\n}\n\n\n\n // create par3t and ran4k at the place.\n vector par3t(n, 0);\n vector ran4k(n, 0);\n makeSet(n, par3t, ran4k);\n]]>\n snip-dsu\n dsu using path compression\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/errorWatch.sublime-snippet",
"content": "\n _it(_ss); huehue(_it, args); cout << \"\\n\";}\n\nvoid huehue(istream_iterator it) {}\ntemplate\nvoid huehue(istream_iterator it, T a, Args... args) {\n cout << *it << \" = \" << a << \", \";\n huehue(++it, args...);\n}\n\n]]>\n snip-error-watch\n Error Watch\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/eulerTotientFunc.sublime-snippet",
"content": "\n 1)\n result -= result / n0n;\n return result;\n}\n\nvector phiVal;\n// precompute_phiVal complexity O(N.log(log(N)))\nvoid precompute_phiVal(lld n0n) {\n phiVal.resize(n0n+1);\n phiVal[0] = 0;\n phiVal[1] = 1;\n for (lld i = 2; i <= n0n; i++)\n phiVal[i] = i;\n\n for (lld i = 2; i <= n0n; i++) {\n if (phiVal[i] == i) {\n for (lld j = i; j <= n0n; j += i)\n phiVal[j] -= phiVal[j] / i;\n }\n }\n}\n\n// precompute_phiVal(n);\n\n\n]]>\n snip-totient-euler-phi\n Euler totient Phi\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/leetcode-solution-class.sublime-snippet",
"content": "\n \n#pragma GCC optimize \"trapv\"\n\nusing namespace std;\n// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n\n// Solution class to work with\nclass Solution {\n\t\n};\n\n\n// >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n\nsigned main() {\n\n ios_base::sync_with_stdio(false); cin.tie(0);cout.precision(10);\n\n\tSolution Obj;\n\n\t// read input vars here and pass it to solve.\n\n\tint ans = Obj.solve();\n\n\tcout << ans;\n\n return 0;\n}\n// Random Thought : null \n]]>\n snip-leetcode-solution\n Solution class implementation\n \n source.c++\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/manipulated-sieve-of-eratosthene.sublime-snippet",
"content": "\n isPrime(MAXN , true); // checkIfPrime\nvectorprime_numbers; // List of prime numbers\nvectorsmallest_prime_factor(MAXN); // smallest_prime_factor of a number\n\n\nvoid manipulated_seive() {\n\tisPrime[0] = isPrime[1] = false ;\n\t\n\tprime_numbers.push_back(2);\n\tsmallest_prime_factor[2] = 2ll;\n\n\tfor (long long int i=4; i < MAXN ; i+=2) {\n\t\tisPrime[i] = false;\n\t\tsmallest_prime_factor[i] = 2ll;\n\t}\n\n\tfor (long long int i = 3; i < MAXN ; i+=2) {\n\t\tif (isPrime[i]) {\n\t\t\tprime_numbers.push_back(i);\n\t\t\tsmallest_prime_factor[i] = i;\n\t\t}\n\n\t\tfor (long long int j = 0; j < (int)prime_numbers.size() && i * prime_numbers[j] < MAXN && prime_numbers[j] <= smallest_prime_factor[i]; j++) {\n\t\t\tisPrime[i * prime_numbers[j]] = false;\n\t\t\tsmallest_prime_factor[i * prime_numbers[j]] = prime_numbers[j] ;\n\t\t}\n\t}\n}\n\n\n/* This should be called inside main. */\n\tmanipulated_seive();\n\n\n\n]]>\n snip-fast-sieve\n sieve-manipulated\n \n source.c++ \n\n"
},
{
"path": "02-Codes/Snippets/Sublime/matrix-expo.sublime-snippet",
"content": "\n = MOD) return res - MOD;\n return res;\n}\n\nlld mult(lld a, lld b) {\n long long res = a;\n res *= b;\n if(res >= MOD) return res % MOD;\n return res;\n}\n\n\n\nconst lld SZ = 2; // size of MaGiC \n\nstruct matrix {\n lld MaGiC[SZ][SZ];\n\n void reset() {\n memset(MaGiC, 0, sizeof(MaGiC));\n }\n\n void makeiden() {\n reset();\n for(lld i=0;i>= 1;\n }\n return res;\n}\n\n\n// // GUIDE :\n//\n// matrix m;\n// m.makeiden();\n//\n// m.MaGiC[0][0] = 0, m.MaGiC[0][1] = 1;\n// m.MaGiC[1][0] = 3, m.MaGiC[1][1] = 2;\n//\n// m = power(m, n);\n//\n// cout << m.MaGiC[0][0];\n\n\n]]>\n snip-matrix-expo\n Matrix Expo on recurrence formula\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/max-biparite-matching.sublime-snippet",
"content": "\n > graph, lld u, vector &visited, vector &matchR) {\n\tfor (lld v = 0; v < n; v++) {\n\t\tif (graph[u][v] and !visited[v]) {\n\t\t\tvisited[v] = true;\n\t\t\tif (matchR[v] < 0 || bpm(graph, matchR[v], visited, matchR)) {\n\t\t\t\tmatchR[v] = u;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\nlld maxBPM(vector> graph, vector &matchR) {\n\tlld result = 0;\n\tfor (lld u = 0; u < m; u++) {\n\t\tvector visited(n, 0);\n\t\tif (bpm(graph, u, visited, matchR))\n\t\t\tresult++;\n\t}\n\treturn result;\n}\n\n\n// This should be in main // 0.indexed\n\tn = 6, m = 6; \n\t// for i -> m then for j -> n\n\tvector> graph(m, vector(n, false));\n\tvector matchR(n, -1);\n\tmaxBPM(graph, matchR);\n]]>\n snip-bipartite-matching\n Max B M\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/modop.sublime-snippet",
"content": "\n >= 1;\n\t\t\tbase = (base * base) % mod;\n\t\t}\n\t\treturn res;\n\t}\n\tlld minv(lld base) {\n\t\treturn mpow(base, mod - 2);\n\t}\n\tlld mdiv(lld a, lld b) {\n\t\treturn mmul(a, minv(b));\n\t}\n}\n\n\n\nlld nck(lld n, lld k) {\n\tif (n < k) return 0;\n\tlld r = 1;\n\n\tfor (lld i = n; i > n - k; i--) {\n\t\tr = (r * i) % mod;\n\t}\n\n\tfor (lld i = 1; i <= k; i++) {\n\t\tr = (r * minv(i)) % mod;\n\t}\n\treturn r;\n}\n]]>\n snip-namespace-modop\n modops and ncr on demand\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/myReadTemplate.sublime-snippet",
"content": "\n T Read(T& x) { cin >> x; return x; }\ntemplate void Print(T a) { cout << a; }\ntemplate void Println(T a) { cout << a << \"\\n\"; }\n\ntemplate void Read(vector &arr) { EACH(i, arr) cin >> (i); }\ntemplate void Print(vector arr) { EACH(i, arr) {cout << i << \" \";} }\ntemplate void Println(vector arr) { EACH(i, arr) {cout << i << \" \";} cout << \"\\n\"; }\n\ntemplate void Read(vector> &arr) { EACH(i, arr) Read(i); }\ntemplate void Print(vector> arr) { EACH(i, arr) Println(i); }\ntemplate void Println(vector> arr) { EACH(i, arr) Println(i); }\n\ntemplate void Read(vector &arr, Args &... args) { Read(arr); Read(args...);}\ntemplate void Read(vector> &arr, Args &... args) { Read(arr); Read(args...);}\ntemplate void Read(T &a, Args &... args) { cin >> (a); Read(args...); }\ntemplate void Print(vector &arr, Args &... args) { Print(arr); Print(args...);}\ntemplate void Print(T a, Args... args) { cout << a << \" \"; Print(args...); };\ntemplate void Println(vector &arr, Args &... args) { Print(arr); Println(args...);}\ntemplate void Println(T a, Args... args) { cout << a << \" \"; Println(args...); };\n\n]]>\n snip-read-template\n Read-Print-Template\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/Sublime/ncr-on-demand.sublime-snippet",
"content": "\n \n snip-ncr-binomial\n NCR on demand\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/pbds.sublime-snippet",
"content": "\n \n#include \nusing namespace __gnu_pbds;\n\ntemplate using PBSET = tree, rb_tree_tag, tree_order_statistics_node_update>;\n\n/* \n .insert(el) - set hai!\n .find_by_order(3) - returns an iterator to the k-th largest element (counting from zero)\n .order_of_key(6) - the number of items in a set that are strictly smaller than our item\n*/\n\n]]>\n snip-pbds\n pbds\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/power-expo.sublime-snippet",
"content": "\n 0) {\n\t\tif (y & 1)\n\t\t\tres = (res * x) % MOD;\n\n\t\ty = y >> 1; \n\t\tx = (x * x) % MOD;\n\t}\n\treturn res;\n}\n\n\n]]>\n snip-power\n power exponentiation\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/sieve-of-eratosthene.sublime-snippet",
"content": "\n isPrime(MAXN, true); // Temp vector for sieve result\nvector prime_numbers; // vector of primes\n\nvoid sieve() {\n\tisPrime[0] = isPrime[1] = false;\n\tprime_numbers.push_back(2);\n\tfor (lld i=4; i< MAXN; i+=2)\n\t\tisPrime[i] = false;\n\tfor (lld i = 3; i < MAXN; i+=2) {\n\t\tif (isPrime[i]) {\n\t\t\tprime_numbers.push_back(i); // remove if not necessary\n\t\t\tfor (lld j = 2 * i; j < MAXN; j += i) {\n\t\t\t\tisPrime[j] = false;\n\t\t\t}\n\t\t}\n\t}\n}\n\n/* This should be called inside main. */\nsieve();\t// function call in main\n\n\n]]>\n snip-sieve\n sieve\n \n source.c++\n"
},
{
"path": "02-Codes/Snippets/Sublime/topcoder-template.sublime-snippet",
"content": "\n \nusing namespace std;\n\n\ntypedef long long int lld;\ntypedef unsigned long long int llu;\n\n#define forn(I7, E4) for(lld I7=0ll; I7 < E4; (I7)+=1ll)\n#define forn1(I7, E4) for(lld I7=1ll; I7 < E4+1; (I7)+=1ll)\n#define len(v) ((int)((v).size()))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define f1 first\n#define s2 second\n\ntemplate ostream& operator<<(ostream &os, const pair &p) { return os << '(' << p.first << \", \" << p.second << ')'; }\ntemplate < typename T_container, typename T = typename enable_if < !is_same::value, typename T_container::value_type >::type >\nostream & operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = \", \"; return os << '}'; }\nvoid dbg_out() { cout << \"\\n\"; }\ntemplate void dbg_out(Head H, Tail... T) { cout << H << \", \"; dbg_out(T...);}\n#define _____error_____(...) cout << #__VA_ARGS__ << \" : \", dbg_out(__VA_ARGS__)\n\nconst lld d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};\nconst lld d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};\n\n\nconst long double EPS = 1e-6;\nlld TempVar, mod, MOD;\n\n\nclass ${1:} {\n public:\n ${0:}\n};\n\n\n\n\n//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n\n/*\nsigned main() {\n\n ios_base::sync_with_stdio(false); cin.tie(0);\n // cout.precision(10); cout << fixed;\n #ifdef LUCTIVUD\n // const auto start_time = std::chrono::high_resolution_clock::now();\n freopen(\"/home/luctivud/CPPractice/Zinput.txt\", \"r\", stdin);\n freopen(\"/home/luctivud/CPPractice/Zoutput.txt\", \"w\", stdout);\n #endif\n\n ${1:} obj;\n\n \n\n\n return 0;\n}\n\n*/\n\n]]>\n snip-topcoder-template\n Topcoder class template\n \n source.c++\n\n\n\n\n"
},
{
"path": "02-Codes/Snippets/mydebug.h",
"content": "// C++ includes used for precompiling -*- C++ -*-\n\n// Copyright (C) 2003-2021 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the\n// terms of the GNU General Public License as published by the\n// Free Software Foundation; either version 3, or (at your option)\n// any later version.\n\n// This library is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n\n// Under Section 7 of GPL version 3, you are granted additional\n// permissions described in the GCC Runtime Library Exception, version\n// 3.1, as published by the Free Software Foundation.\n\n// You should have received a copy of the GNU General Public License and\n// a copy of the GCC Runtime Library Exception along with this program;\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\n// .\n\n/** @file stdc++.h\n * This is an implementation file for a precompiled header.\n */\n\n// 17.4.1.2 Headers\n\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include \n#endif\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#if __cplusplus >= 201103L\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#endif\n\n// C++\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include