https://github.com/akhilsharmaa/competitive-programming-sublime

Sublime template @akhilsharmaa, auto-completions file
https://github.com/akhilsharmaa/competitive-programming-sublime

build competitive-programming cpp osx-setup sublime-text

Last synced: 27 days ago
JSON representation

Sublime template @akhilsharmaa, auto-completions file

• Host: GitHub
• URL: https://github.com/akhilsharmaa/competitive-programming-sublime
• Owner: akhilsharmaa
• Created: 2023-01-07T13:00:19.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2024-05-15T16:13:34.000Z (8 months ago)
• Last Synced: 2024-05-16T05:08:06.244Z (7 months ago)
• Topics: build, competitive-programming, cpp, osx-setup, sublime-text
• Homepage:
• Size: 46.9 KB
• Stars: 4
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
 ## My Competitve Programming ` C++ Templates ` setup - OSX

[![Codeforces](https://badges.riever.dev/codeforces/akhilsharmaa.svg)](https://codeforces.com/profile/akhilsharmaa)

[![AtCoder](https://badges.riever.dev/atcoder/akhilsharma.svg)](https://atcoder.jp/users/akhilsharma)





https://github.com/user-attachments/assets/d806caf1-d3e9-48a9-b325-3278bf3f186c

### C++ `templates` file links : 

These are my some *templates(sublime supported)* : 

### Basics

- [main()](./akhilsharmaa.sublime-snippet) - **main()** function, #defines, constants(MOD, N, INF) etc. 

- [Pow(n, k)](./binpow.sublime-snippet) - find `n^k` in O(log n) with MOD

- [Combinatorics](./combinatorics-arithmetic.sublime-snippet) - includes  **nCr(n,r),  nPr(n, r), inv(), divide(), factorial()...**

- [factorial()](./factorial.sublime-snippet) - initilize globally **(N!)** `int fact[N];`for accessing factorial of num. 

- [isPrime()](./isPrime-sieveofE.sublime-snippet) - initilize globally  `int isPrime[N];`for accessing `N` is prime or non-prime. using the *sieve of eratosthenes*. 

- [prefixSum()](./prefixSum.sublime-snippet) - returns `vector` of prefix of the vector array.

- [2DmatrixPrefixSum()](./matrixPrefixSum.sublime-snippet) - Build the prefix sum 2D matrix (size of matrix = (n+1) x (m+1))

### Good 

- [Graph()](./graph-all-function.sublime-snippet) - BFS, Dijkstra.. all Graph algo 

- [dfs()](./dfs.sublime-snippet) - Graph **Depth** first search algorithm template

- [Dijkstra()](./DijkstraAlgo.sublime-snippet) - Shortest Path Algorithm using **priority_queue** of STL 

- [isBipartiteDFS()](./isBipartite-DFS.sublime-snippet) - Check whether the graph can divided into bipartite graph 

- [SegmentTree()](./SegmentTree.sublime-snippet) - implementation of segment tree data-structure 

- [SparseTable()](./SparseTable.sublime-snippet) - implementation of Sparse Table (minQuery) data-structure 

( I suggest to take references from this and **try to create your own template** it will take time but worth it. )

### Auto completition file [cpp.sublime-completions](https://github.com/akhilsharmaa/Competitive-Programming-SETUP/blob/main/cpp.sublime-completions)

Move this file at: ```/Sublime Text/Packages/User/cpp.sublime-completions``` Add your own auto-completion snippets. *Easy to add :)*