https://github.com/aben20807/oj_code

1062_高階競技程式設計 ADVANCED COMPETITIVE PROGRAMMING
https://github.com/aben20807/oj_code

algorithms cpp online-judges

Last synced: 11 months ago
JSON representation

1062_高階競技程式設計 ADVANCED COMPETITIVE PROGRAMMING

• Host: GitHub
• URL: https://github.com/aben20807/oj_code
• Owner: aben20807
• License: mit
• Created: 2018-02-09T11:23:54.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2022-12-30T04:33:57.000Z (over 3 years ago)
• Last Synced: 2025-01-16T19:22:50.864Z (over 1 year ago)
• Topics: algorithms, cpp, online-judges
• Language: C++
• Homepage:
• Size: 185 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Practice in Online Judge

+ [x] : have comments.

## Basic

+ UVa/100\_The\_3n+1\_problem

+ UVa/10055\_Hashmat\_the\_brave\_warrior

+ UVa/10424\_Love\_Calculator

+ UVa/11727\_Cost\_Cutting

+ UVa/11984\_A\_Change\_in\_Thermal\_Unit

+ UVa/11462\_Age\_Sort

+ UVa/10922\_2\_the\_9s

+ [x] UVa/488\_Triangle\_Wave

+ [x] UVa/10633\_Rare\_Easy\_Problem

+ [x] UVa/10679\_I\_Love\_Strings: try to use Aho-Corasick Automaton

+ [x] leetcode/70-climbing-stairs

+ [x] leetcode/790-domino-and-tromino-tiling

## Data structure

### Linked list

+ [x] leetcode/2-add-two-numbers

+ [x] leetcode/328-odd-even-linked-list

### Stack

+ [x] leetcode/150-evaluate-reverse-polish-notation

+ leetcode/232-implement-queue-using-stacks

+ [x] leetcode/739-daily-temperatures

### Heap

+ [x] leetcode/1962-remove-stones-to-minimize-the-total

+ [x] leetcode/1834-single-threaded-cpu: priority queue (C failed, using C++ instead)

## Sort

+ UVa/10327\_Flip\_Sort: Bubble Sort

+ UVa/10810\_Ultra-QuickSort: Merge Sort

+ UVa/(POJ)2299\_Ultra-QuickSort

+ UVa/10107\_What\_is\_the\_Median: Insertion Sort

## Greedy

+ [x] leetcode/55-jump-game

+ [x] leetcode/2279-maximum-bags-with-full-capacity-of-rocks

## Union-Find

+ UVa/10685\_Nature

+ UVa/10583\_Ubiquitous\_Religions

+ UVa/11987\_Almost\_Union-Find

## STL

+ UVa/10420\_List\_of\_Conquests: Map

+ UVa/136\_Ugly\_Numbers: Vector

+ [x] UVa/902\_Password\_Search: Map

+ [x] UVa/10226\_Hardwood\_Species: Map

+ [x] UVa/10391\_Compound\_Words: Map

## DFS

+ UVa/539\_The\_Settlers\_of\_Catan

+ UVa/352\_The\_Seasonal\_War

+ UVa/260\_Il\_Gioco\_dellX

+ UVa/10004\_Bicoloring

+ UVa/10946\_You\_want\_what\_filled

+ [x] leetcode/124-binary-tree-maximum-path-sum

+ leetcode/834-sum-of-distances-in-tree: double DFS

+ [x] leetcode/841-keys-and-rooms

+ [x] leetcode/872-leaf-similar-trees

+ [x] leetcode/938-range-sum-of-bst

+ [x] leetcode/1026-maximum-difference-between-node-and-ancestor

+ [x] leetcode/1339-maximum-product-of-splitted-binary-tree: double DFS

+ [x] leetcode/797-all-paths-from-source-to-target: all paths

## BFS

+ UVa/532\_Dungeon\_Master

+ UVa/439\_Knight\_Moves

+ UVa/383\_Shipping\_Routes

+ UVa/567\_Risk

+ UVa/762\_We\_Ship\_Cheap

+ [x] leetcode/1971-find-if-path-exists-in-graph

## Prime

+ UVa/406\_Prime\_Cuts

## Prime factor

+ UVa/10392\_Factoring\_Large\_Numbers

+ UVa/294\_Divisors

## GCD

+ UVa/408\_Uniform\_Generator

+ UVa/10104\_Euclid\_Problem

## Big number

+ UVa/10106\_Product

## Floating point

+ UVa/906\_Rational\_Neighbor

## Binary search

+ UVa/10474\_Where\_is\_the\_Marble

+ UVa/10341\_Solve\_It

+ [x] UVa/10611\_The\_Playboy\_Chimp

+ [x] leetcode/2389-longest-subsequence-with-limited-sum: prefix sum

## Backtracking

+ UVa/441\_Lotto

+ [x] UVa/167\_The\_Sultans\_Successors

+ UVa/291\_The\_House\_Of\_Santa\_Claus

+ [x] UVa/524\_Prime\_Ring\_Problem

+ UVa/574\_Sum\_It\_Up

+ UVa/624\_CD

+ [x] UVa/750\_8\_Queens\_Chess\_Problem

## DP

+ UVa/674\_Coin\_Change

+ UVa/990\_Diving\_for\_gold

+ UVa/10819\_Trouble\_of\_13-Dots

+ UVa/10306\_e-Coins: 2D

+ UVa/108\_Maximum\_Sum: 2D

+ leetcode/198-house-robber: 1D

+ [x] leetcode/309-best-time-to-buy-and-sell-stock-with-cooldown: FSM

+ [x] leetcode/931-minimum-falling-path-sum: 2D

## LCS

+ [x] UVa/531\_Compromise

+ [x] UVa/111\_History\_Grading

+ [x] UVa/10066\_The\_Twin\_Towers

+ [x] UVa/10100\_Longest\_Match

+ [x] UVa/10192\_Vacation

+ [x] UVa/10252\_Common\_Permutation: sort

+ [x] UVa/10405\_Longest\_Common\_Subsequence

+ [x] leetcode/1143-longest-common-subsequence

## LIS (LDS)

+ [x] UVa/231\_Testing\_the\_CATCHER

+ [x] UVa/437\_The\_Tower\_of\_Babylon

+ [x] UVa/481\_What\_Goes\_Up

+ [x] UVa/497\_Strategic\_Defense\_Initiative

## Shortest Path

+ UVa/341\_Non-Stop\_Travel: Bellman-Ford

+ [x] UVa/558\_Wormholes: Bellman-Ford

+ [x] UVa/10000\_Longest\_Paths: Bellman-Ford

+ [x] UVa/10048\_Audiophobia: Floyd

+ UVa/10278\_Fire\_Station: Floyd

+ UVa/10986\_Sending\_email: SPFA

## Articulation (Cut Vertex)

+ UVa/315\_Network

+ [x] UVa/10199\_Tourist\_Guide

## SCC (Tarjan)

+ UVa/11838\_Come\_and\_Go

+ UVa/247\_Calling\_Circles

+ UVa/459\_Graph\_Connectivity

+ [x] UVa/11709\_Trust\_groups

## MST

+ UVa/10034\_Freckles: Kruskal

+ [x] UVa/10397\_Connect\_the\_Campus: Kruskal

+ [x] UVa/10147\_Highways: Kruskal

+ [x] UVa/10600\_ACM\_contest\_and\_Blackout: Kruskal

+ [x] UVa/10842\_Traffic\_Flow: Kruskal, MaxST

+ [x] UVa/908\_Re-connecting\_Computer\_Sites: Kruskal

+ [x] UVa/11710\_Expensive\_subway: Kruskal

+ [x] UVa/10369\_Arctic\_Network: Kruskal

## KMP (Knuth-Morris-Pratt)

+ UVa/455\_Periodic\_Strings

+ [x] UVa/10298\_Power\_Strings

+ [x] UVa/11475\_Extend\_to\_Palindromes

## Maximum Flow

+ [x] UVa/820\_Internet\_Bandwidth: Ford Fulkerson

+ [x] UVa/10330\_Power\_Transmission: Ford Fulkerson

+ UVa/10779\_Collectors\_Problem: Ford Fulkerson

+ UVa/11418\_Clever\_Naming\_Patterns: Edmonds Karp

## Bipartite Matching (Augmenting Path)

+ [x] UVa/10080\_Gopher\_II

+ [x] UVa/\(POJ)2536\_Gopher\_II

+ [x] UVa/259\_Software\_Allocation

+ UVa/663\_Sorting\_Slides

+ UVa/1486\_Sorting\_Slides

+ UVa/670\_The\_dog\_task

+ UVa/1325\_Machine\_Schedule

+ UVa/(POJ)1194\_Machine\_Schedule

+ UVa/11159\_Factors\_and\_Multiples

+ [x] leetcode/886-possible-bipartition

## Segment Tree

+ UVa/(POJ)3264\_Balanced\_Lineup

## Binary Indexed Tree

+ UVa/(POJ)2352\_Stars

+ UVa/(POJ)1195\_Mobile\_phones: 2D

+ [x] UVa/\(POJ)3321\_Apple\_Tree

+ [x] UVa/11423\_Cache\_Simulator

+ UVa/(POJ)2155\_Matrix: 2D

+ UVa/(POJ)3067\_Japan

+ UVa/(POJ)2481\_Cows

## Line Intersection

+ UVa/191\_Intersection

+ UVa/378\_Intersecting\_Lines

## Convex Hull

+ UVa/218\_Moth\_Eradication

+ [x] UVa/681\_Convex\_Hull\_Finding