Thanks for trying out this extension <3. It was designed to help Competitive Programmers to get access to pre-made functions and codes easily for going fast during solving. For more information or adding any issue, Go to the Github page below-
GitHub : https://github.com/101rakibulhasan/coderush-snippets
Marketplace: https://marketplace.visualstudio.com/items?itemName=101rakibulhasan.coderush
-
snippets are categorized into 3 parts-
- general = has no snippet type brfor keyword. They are just snippets. Example: vec, arr, tw
- conv = has "conv_" before keyword. This type converts one type to another type. Example: 'conv_inttobits' coverts int to bits
- gen = has "gen_" before keyword. this type generates certain output into another variable. Example: prime numbers etc gen_prime
- init -> Initialize C++ Main()
- init-cp -> CP-Initialize C++ Main()
- tw -> While-TestCase
- tf -> For-TestCase
- twsv -> While-TestCase with Special Value
- tweof -> While-TestCase with EOF
- prnt_vec -> Print Vector
- vec -> Initialize Vector
- prnt_Farr -> Initialize Function For Printing 1D Array
- prnt_arr -> Print Array
- arr -> Initialize Array[size] With Input
- arr_2d -> Initialize 2D Array
- prnt_arr_2d -> Print 2D Array
- print -> Print COUT
- scan -> Get CIN
-
gen_Fprime -> Generate Prime Numbers Till N
gen_prime -> (vector) Initialize Prime Numbers Generator
-
gen_Fprimefactors -> (vector) Generates Prime Factors Function
gen_primefactors -> (vector) Initialize Prime Factors
-
conv_inttobits -> Convert Int To Binary
-
conv_Fnumtostr -> (string) Convert Number to String Function
conv_numtostr -> (string) Convert Number to String
-
conv_Fstrtonum -> (ll) Convert String to Number Function
conv_strtonum -> (ll) Convert String to Number
-
Fbs -> (vec,ll) Returns Index using Binary Search Function
bs -> (vec,ll) Returns Index using Binary Search
-
Fprime -> (ll) Returns 1 or 0 if Prime or Not
prime -> Initialize Prime Checker Variable
-
Fdfs -> DFS Function
dfs -> Initializes DFS
-
Fbfs -> BFS Function (bfs_nodes)
bfs -> (root,edge) BFS Initialize (bfs_nodes)
-
Fgcd -> GCD Function
gcd -> (ll) Returns GCD
-
Flcm -> (ll) LCM Function
lcm -> (ll) Returns the LCM Number
-
Fpower -> (base^upper) Power Function
power -> Do Power (base^powervar)
-
Flcs -> Longest Common Subsequence Length Function
lcs -> Longest Common Subsequence Length Between two strings
-
Fbe -> Binary Exponent Function
be -> Initialize Binary Exponent Function
-
Fme -> Modular Exponentiation Function
me -> Initilaize Modular Exponentiation Function
- olist -> Initialize Ordered List