ACM-Team-Notebook

ACM Team Notebook is a reference material that can be carried by the teams for the onsite contest. This notebook contains commonly used algorithms, code snippets, cheatsheets and conceptual implementation for ACM International Collegiate Programming Contest.

About ACM

The ICPC, entitled the ACM International Collegiate Programming Contest, is an annual multi-tiered competitive programming competition among the universities of the world. The contest is sponsored by IBM. Headquartered at Baylor University, directed by ICPC Executive Director and Baylor Professor William B. Poucher, the ICPC operates in autonomous regions on six continents under the auspices of the Association for Computing Machinery (ACM) in accordance with the ICPC Policies and Procedures which are published at the Official ICPC Headquarters Website.

How to use

To clone the repository:

git clone https://github.com/Aksh77/ACM-Team-Notebook.git

You can also Download the notebook as ZIP files

Programs included

S.No	Program name	Description
1	Basic DP Algorithm Implementations	DP implementations of Subset Sum problem, Fibonacci, Number of ways to cover a distance
2	Breadth First Search	Program to print BFS traversal from a given source vertex
3	C++ STL	Reference Sheet for C++ STL- Map, Stack, Queue, Priority Queue, List, Deque, Vector
4	Depth First search	Program to print DFS traversal from a given vertex
5	Dijkstra's Algo	Program for Dijkstra's single source shortest path algorithm
6	Floyd Warshall Algorithm	Program to find shortest distances between every pair of vertices in a given edge-weighted directed Graph
7	Geometry Algorithms	Code snippets for Geometry based questions
8	KMP Algorithm	Program to find all occurrences of a given pattern in a string
9	Knapsack Problem	Program to solve Knapsack Problems (get the maximum total value in the knapsack)
10	Library Functions	Reference sheet for library functions- Mathematical Functions, String and Character functions
11	Longest Increasing Subsequence	DP implementation of algorithm to find the longest increasing subsequence of an Array
12	Longest common subsequence	DP implementation of algorithm to find the longest common subsequence of 2 strings
13	Maximum Sub-Array	Program to find the subarray with the largest sum
14	Miller Rabin primality Test	Probabilistic algorithm to check primality of large numbers
15	Modulo Arithmetic Algorithms	Modular Arithmetic programs- Euclid's Algorithm to find GCD, and Modular Exponentiation
16	Prefix Sum Array	Program to print the prefix-sum (cumulative sum) of an array
17	Prime factors	Program to find all prime factors of a number
18	Rabin-Karp Algorithm	Program to find all occurrences of a given pattern in a string
19	Ray Casting Algorithm	Check whether a point is within a given polygon
20	Segmented Sieve of Eratosthenes	Program to find prime numbers upto n using Segmented Sieve of Eratosthenes

msharsha / acm-team-notebook Goto Github PK