# ACM-ICPC Algorithms
### Introduction to ACM-ICPC
ACM International Collegiate Programming Contest (abbreviated as ACM-ICPC or ICPC) is an annual multi-tiered competitive programming competition among the universities of the world.
Alternately, we can say that the [International Collegiate Programming Contest](https://en.wikipedia.org/wiki/ACM_International_Collegiate_Programming_Contest) is an algorithmic programming contest for college students.
- Teams of three, representing their university, work to solve real-world problems, fostering collaboration, creativity, innovation, and the ability to perform under pressure.
- Through training and competition, teams challenge each other to raise the bar on what could be done.
- Quite simply, it is the oldest, largest, and most prestigious programming contest in the world.
### Purpose of ACM-ICPC Algorithms
ACM-ICPC Algorithms is a collection of important algorithms and data structures used to solve questions in this worldwide olympiad. It aims to provide solutions in various languages as per [ICPC 2018 WF](https://icpc.baylor.edu/worldfinals/programming-environment), including:
- C
- C++
- Java
- Python (2 & 3)
- Kotlin
##### For more information, visit: **Official Website of [ICPC](https://icpc.baylor.edu/)**
#### If you wish to contribute, please refer to [the contributor guidelines](https://github.com/matthewsamuel95/ACM-ICPC-Algorithms/blob/master/CONTRIBUTING.md).
**Table of Contents :**
* [Breadth First Search](/BFS)
* [Branch And Bound](/Branch%20and%20Bound)
* [0/1 Knapsack](/Branch%20and%20Bound/0_1%20Knapsack)
* [Binary Search Tree](/BST)
* [Backtracking](/BackTracking)
* [Hamilton Path](/BackTracking/Hamilton%20Path)
* [Knights Tour](/BackTracking/KnightsTour)
* [NQueens](/BackTracking/NQueens)
* [Rat In A Maze](/BackTracking/RatInAMaze)
* [Sudoku Algorithm](/BackTracking/SudokuAlgorithm)
* [Depth First Search](/DFS)
* [Bit Manipulation](/BitManipulation)
* [Checking Power of 2](/BitManipulation/Checking_power_of_2)
* [Nth Magic No](/BitManipulation/Nth_magic_number)
* [Set kth Bit](/BitManipulation/Set_kth_bit)
* [Sparse Number](/BitManipulation/Sparse_number)
* [Count Ones](/BitManipulation/count_ones)
* [Divide Integers](/BitManipulation/divide_integers)
* [Even Odd](/BitManipulation/even_odd)
* [Print Subsets](/BitManipulation/print_subsets)
* [Reverse Bits](/BitManipulation/reverse_bits)
* [Single Number](/BitManipulation/single_number)
* [Swap Bits](/BitManipulation/swap_bits)
* [Data Structures](/Data%20Structures)
* [Disjoint Set](/Data%20Structures/disjointset)
* [Doubly Linked List](/Data%20Structures/DoublyLinkedList)
* [Fenwick Tree](/Data%20Structures/Fenwick_tree)
* [LCA](/Data%20Structures/LCA)
* [Linked List](/Data%20Structures/Linked%20List)
* [Queue](/Data%20Structures/Queue)
* [Queue From Stack Or Stack From Queue](/Data%20Structures/QueueFromStack_StackFromQueue)
* [Red Black Tree](/Data%20Structures/Red%20Black%20Tree)
* [Singly Linked List](/Data%20Structures/SinglyLinkedList)
* [Stack](/Data%20Structures/Stack)
* [Segment Tree](/Data%20Structures/Segment%20Tree)
* [Treap](/Data%20Structures/Treap)
* [Trie](/Data%20Structures/Trie)
* [Dynamic Programming](/DP)
* [Coin Change](/DP/Coin%20Change%20Problem)
* [Collect Maximum Points](/DP/Collect_Max_Points)
* [Edit Distance](/DP/EditDistance)
* [Egg Dropping Puzzle](/DP/Egg%20Dropping%20Puzzle)
* [Fibonacci Series](/DP/Fibonacci)
* [Floyd Warshall Algorithm](/DP/Floyd%20Warshall%20Algorithm)
* [Game Of Sum](/DP/game_of_sum)
* [Knapsack](/DP/Knapsack)
* [Longest Palindrome Substring](/DP/Longest%20Palindrome%20Substring)
* [Longest Common Increasing Subsequence](/DP/LCIS)
* [Longest Common Subsequence](/DP/LongestCommonSubsequence)
* [Longest Increasing Subsequence](/DP/LongestIncreasingSubsequence)
* [Longest Repeated Subsequence](/DP/Longest%20Repeated%20Subsequence)
* [Matrix Chain Multiplication](/DP/MatrixChain_multiplication)
* [Max Sum Increasing Subsequence](/DP/Maximum%20Sum%20Increasing%20Subsequence)
* [Minimum Path Sum](/DP/MinimumPathSum)
* [Number Of Islands](/DP/NumberOfIslands)
* [Partition Problem](/DP/PartitionProblem)
* [Print Neatly](/DP/PrintNeatly)
* [Recursive Staircase Problem](/DP/Recursive_Staircase_Problem)
* [Shortest Uncommon Subsequence](/DP/ShortestUncommonSubsequence)
* [Subset Sum](/DP/subset%20sum%20problem)
* [Longest Bitonic SubSequence](/DP/LongestBitonicSubseq)
* [Tiling Problem](/DP/Tiling%20Problem)
* [Graph Algorithms](/Graph)
* [Articulation Points](/Graph/Articulation_points)
* [Bellman Ford SSSP](/Graph/BellmanFordSSSP)
* [Bridges](/Graph/bridges)
* [Centroid Decomposition](/Graph/Centroid%20Decomposition)
* [Detect Cycle](/Graph/Detect_Cycle)
* [Dials Algorithm](/Graph/DialsAlgorithm)
* [Dijkstras SPT](/Graph/DijkstrasSPT)
* [Euler Path](/Graph/EulerPath)
* [Floyd Warshall](/Graph/FloydWarshall)
* [Graph Coloring](/Graph/Graph_m_Coloring)
* [Johnson's Algorithm](/Graph/Johnson'sAlgorithm)
* [Kruskal MST](/Graph/KruskalsMST)
* [Prims MST](/Graph/PrimsMST)
* [Sack](/Graph/Sack)
* [SPFA SSSP](/Graph/SPFA%20SSSP)
* [Targan SCC](/Graph/TarganSCC)
* [Topo Sort](/Graph/TopoSort)
* [Fenwick Tree](/Graph/FenwickTree)
* [Weighted Quick Union](/Graph/Weighted_Quick_Union)
* [Greedy Algorithms](/Greedy)
* [Activity Selection](/Greedy/ActivitySelection)
* [Containership](/Greedy/ContainerShip)
* [Equalizing Bit Strings](/Greedy/EqualizingBitStrings)
* [Gas Station](/Greedy/Gas%20Station)
* [Greedy Graph Coloring](/Greedy/Greedy_Graph_Coloring)
* [Huffman Coding](/Greedy/Huffman%20coding)
* [Knapsack](/Greedy/Knapsack)
* [Kruskal's Minimum Spanning Tree](/Greedy/Kruskal’sMinimumSpanningTree)
* [Maximum Increasing Subarray](/Greedy/MaximumIncreasingSubarray)
* [Minimum Coins](/Greedy/MinimumCoins)
* [Odd Sum Subsequence](/Greedy/OddSumSubsequence)
* [Hashing Algorithms](/Hashing)
* [2 Sum](/Hashing/2_Sum)
* [3 Sum](/Hashing/3_Sum)
* [4 Sum](/Hashing/4_Sum)
* [Machine Learning](/MachineLearning)
* [Perceptron](/MachineLearning/Perceptron)
* [Mathematical Algorithms](/Math)
* [3 Sum square complexity](/Math/3_Sum_square_complexity)
* [Factors Of A Given Number](/Math/All%20factors%20of%20a%20given%20Number)
* [Collatz Conjecture](/Math/collatz_conjecture)
* [Combinations](/Math/Combinations)
* [Bézout's Coefficients](/Math/Bézout's%20Coefficients)
* [Convex Hull](/Math/convexhull)
* [Euler's Totient Function](/Math/eulers_totient_function)
* [Factorization](/Math/Factorization)
* [Factors](/Math/factors)
* [Fast Exponentiation with Mod](/Math/Fast%20Exponentiation%20with%20Mod)
* [Floor Square Root](/Math/floor_sqrt)
* [Greatest Common Divisor](/Math/gcd)
* [Histogram Area](/Math/histogram_area)
* [Largest Number Divisible By Three](/Math/largest_number_divisible_by_three)
* [Last Digit Exp](/Math/last_digit_exp)
* [Logarithm](/Math/log)
* [Lowest Common Multiple](/Math/lowest_common_multiple)
* [Matrix Power](/Math/Matrix_Power)
* [Max Divisible Number](/Math/max_divisible_num)
* [Max Sub Rectangle](/Math/max_sub_rectangle)
* [Max Sub Square](/Math/Max_Sub_Square)
* [Miller Rabin Primality Test](/Math/miller_rabin_primality_test)
* [Modular Multiplication Inverse](/Math/modular_multiplicative_inverse)
* [Next Power of 2](/Math/NextPow2)
* [Nth Root](/Math/nthRoot)
* [Pascal Row](/Math/pascal_row)
* [Power](/Math/Power)
* [Prime](/Math/Prime)
* [Randomized Algorithms](/Math/Randomized%20algorithms)
* [Set](/Math/Set)
* [Sieve Of Eratosthenes](/Math/sieve_of_eratosthenes)
* [Square Root](/Math/squareroot)
* [Subset Sum](/Math/subset_sum)
* [Sum Of Digits](/Math/sum_of_digits)
* [Tower Of Hanoi](/Math/TowerofHanoi)
* [Tr
没有合适的资源?快使用搜索试试~ 我知道了~
Algorithm-ACM-ICPC-Algorithms.zip
共650个文件
cpp:258个
py:100个
java:85个
需积分: 9 0 下载量 78 浏览量
2019-09-17
11:25:34
上传
评论
收藏 1.65MB ZIP 举报
温馨提示
Algorithm-ACM-ICPC-Algorithms.zip,竞争规划中的算法,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
资源推荐
资源详情
资源评论
收起资源包目录
Algorithm-ACM-ICPC-Algorithms.zip (650个子文件)
Merge_Sort.adb 3KB
QuickSort.adb 3KB
Insertion_Sort.adb 2KB
Bubble_Sort.bf 124B
red black tree insertion.c 6KB
Insertion.c 4KB
TowerOfHanoi.c 4KB
DoublyLinkedList.c 3KB
SinglyLinkedList.c 3KB
nqueens.c 3KB
Insertion.c 3KB
dfs.c 3KB
bfs.c 3KB
SinglyLinkedList(Array Implementation).c 3KB
Deletion.c 2KB
Deletion_By_Position.c 2KB
LCS.c 2KB
DijkstrasUsingmatrix.c 2KB
Deletion_By_Key.c 2KB
rabin_karp.c 2KB
BS.c 2KB
stack_using_array.c 2KB
Deletion_Every_Alternate_Node.c 2KB
CircularQueue.c 2KB
Infix to postfix conversion using stack.c 2KB
TimSort.c 2KB
Infix to prefix conversion using stack.c 2KB
toposort.c 1KB
Topological_Sorting.c 1KB
LINKED_QUEUE.c 1KB
binary search.c 1KB
LIS.c 1KB
ShellSort.c 1KB
Couting_Sort.c 1KB
quicksort.c 984B
Pancake_Sorting.c 915B
Bubble_Sort_1.c 835B
Check_Substring.c 792B
c binarysearch.c 784B
max-continuous-subarrays.c 770B
LINKED_STACK.c 692B
PrimeNumbers.c 670B
Selection_Sort_2.c 656B
nthRoot.c 642B
Bubble_Sort_2.c 609B
Collect_Max_Coins.c 598B
eulers_totient_func.c 566B
fibonacci_using_dp.c 539B
Insertion_Sort.c 530B
isPalindrome.c 526B
BinarySearch.c 513B
linear_search.c 466B
Selection_Sort_1.c 455B
pascal_row.c 427B
palindrome.c 426B
sum_of_digits.c 418B
multiply_with_7_using_bit_method.c 401B
isPrime.c 379B
TowerOfHanoi.c 379B
isPalindrome.c 357B
towerhanoi.c 350B
square_root.c 341B
Checkpowerof2.c 273B
Count_Ones.c 168B
GCD.c 165B
evenOdd.c 153B
GoldbergTarjan.cc 2KB
subset_sum.cc 504B
DijkstrasUsingAdjcencyList.cpp 9KB
PrimsMSTusingAdjacencyList.cpp 9KB
ap.cpp 5KB
AhoCorasickStringMatching.cpp 5KB
KruskalsMST.cpp 5KB
Math.cpp 5KB
bridges.cpp 4KB
grahamscan.cpp 4KB
bst.cpp 4KB
tree_delete_node.cpp 4KB
BellmanFordSSSP.cpp 3KB
GomoryHu.cpp 3KB
Dinic.cpp 3KB
Kruskal’sMinimumSpanningTree.cpp 3KB
multiply_polynomials_fft.cpp 3KB
convexhull.cpp 3KB
tries_using_map.cpp 3KB
DijkstrasUsingMatrix.cpp 3KB
manacher algorithm.cpp 3KB
DoublyLinkedList.cpp 3KB
gcd_sum.cpp 3KB
shortest-path-faster-algorithm.cpp 3KB
Intersection point of two Linked Lists.cpp 3KB
BST.cpp 3KB
Floyd Warshall Algorithm.cpp 3KB
TarjansAlgorithm.cpp 3KB
PrimsMSTusingMatrix.cpp 3KB
stack_from_queue_costly_pop.cpp 3KB
non-recursive-segment-tree.cpp 3KB
GreedyGraphColoring.cpp 3KB
ValidSudoku.cpp 3KB
knightstour.cpp 3KB
共 650 条
- 1
- 2
- 3
- 4
- 5
- 6
- 7
资源评论
weixin_38744375
- 粉丝: 372
- 资源: 2万+
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功