https://github.com/kyure-a/competitive-snippets

Snippets / Library for Competitive programming
https://github.com/kyure-a/competitive-snippets

atcoder competitive-programming cpp

Last synced: about 1 month ago
JSON representation

Snippets / Library for Competitive programming

• Host: GitHub
• URL: https://github.com/kyure-a/competitive-snippets
• Owner: Kyure-A
• License: unlicense
• Created: 2023-04-03T07:09:51.000Z (over 3 years ago)
• Default Branch: master
• Last Pushed: 2023-06-26T09:27:05.000Z (about 3 years ago)
• Last Synced: 2025-01-11T23:24:44.676Z (over 1 year ago)
• Topics: atcoder, competitive-programming, cpp
• Language: C++
• Homepage:
• Size: 42 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# competitive-snippets

[![Actions Status](https://github.com/Kyure-A/competitive-snippets/workflows/verify/badge.svg)](https://github.com/Kyure-A/competitive-snippets/actions) 

[![AtCoder](https://badgen.org/img/atcoder/kyre/rating/algorithm?style=flat)](https://atcoder.jp/users/kyre?contestType=algo)

[![GitHub Pages](https://img.shields.io/static/v1?label=GitHub+Pages&message=+&color=brightgreen&logo=github&style=flat)](https://kyure-a.github.io/competitive-snippets/)

## What is this?

Snippets / Library for Competitive programming (mainly AtCoder).

## What functions does this repository have?

- Mex

- Euclidean Distance

- stack DFS (Depth-First Search) 

- BFS (Breadth-First Search)

- Dijkstra's Algorithm

- Unionfind (Disjoint Set Union)

  - There are three types: one that can manage disjoint set of int, one that can manage disjoint set of pair (using map, which is slow and impractical), and one that can manage disjoint set of type T.

- Topological Sort

These exist in this repository. More will be added periodically.