{"id":20560917,"url":"https://github.com/aben20807/oj_code","last_synced_at":"2025-08-13T03:11:58.584Z","repository":{"id":107925460,"uuid":"120897247","full_name":"aben20807/oj_code","owner":"aben20807","description":"1062_高階競技程式設計 ADVANCED COMPETITIVE PROGRAMMING","archived":false,"fork":false,"pushed_at":"2022-12-30T04:33:57.000Z","size":189,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-16T19:22:50.864Z","etag":null,"topics":["algorithms","cpp","online-judges"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aben20807.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-02-09T11:23:54.000Z","updated_at":"2022-12-06T05:14:24.000Z","dependencies_parsed_at":null,"dependency_job_id":"6b9038e9-b34f-453a-94ef-dd9b267ef0b0","html_url":"https://github.com/aben20807/oj_code","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aben20807%2Foj_code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aben20807%2Foj_code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aben20807%2Foj_code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aben20807%2Foj_code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aben20807","download_url":"https://codeload.github.com/aben20807/oj_code/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242171194,"owners_count":20083552,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","cpp","online-judges"],"created_at":"2024-11-16T03:56:17.765Z","updated_at":"2025-03-06T07:48:19.568Z","avatar_url":"https://github.com/aben20807.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Practice in Online Judge\n\n+ [x] : have comments.\n\n## Basic\n\n+ UVa/100\\_The\\_3n+1\\_problem\n+ UVa/10055\\_Hashmat\\_the\\_brave\\_warrior\n+ UVa/10424\\_Love\\_Calculator\n+ UVa/11727\\_Cost\\_Cutting\n+ UVa/11984\\_A\\_Change\\_in\\_Thermal\\_Unit\n+ UVa/11462\\_Age\\_Sort\n+ UVa/10922\\_2\\_the\\_9s\n+ [x] UVa/488\\_Triangle\\_Wave\n+ [x] UVa/10633\\_Rare\\_Easy\\_Problem\n+ [x] UVa/10679\\_I\\_Love\\_Strings: try to use Aho-Corasick Automaton\n+ [x] leetcode/70-climbing-stairs\n+ [x] leetcode/790-domino-and-tromino-tiling\n\n## Data structure\n\n### Linked list\n\n+ [x] leetcode/2-add-two-numbers\n+ [x] leetcode/328-odd-even-linked-list\n\n### Stack\n\n+ [x] leetcode/150-evaluate-reverse-polish-notation\n+ leetcode/232-implement-queue-using-stacks\n+ [x] leetcode/739-daily-temperatures\n\n### Heap\n\n+ [x] leetcode/1962-remove-stones-to-minimize-the-total\n+ [x] leetcode/1834-single-threaded-cpu: priority queue (C failed, using C++ instead)\n\n## Sort\n\n+ UVa/10327\\_Flip\\_Sort: Bubble Sort\n+ UVa/10810\\_Ultra-QuickSort: Merge Sort\n+ UVa/(POJ)2299\\_Ultra-QuickSort\n+ UVa/10107\\_What\\_is\\_the\\_Median: Insertion Sort\n\n## Greedy\n\n+ [x] leetcode/55-jump-game\n+ [x] leetcode/2279-maximum-bags-with-full-capacity-of-rocks\n\n## Union-Find\n\n+ UVa/10685\\_Nature\n+ UVa/10583\\_Ubiquitous\\_Religions\n+ UVa/11987\\_Almost\\_Union-Find\n\n## STL\n\n+ UVa/10420\\_List\\_of\\_Conquests: Map\n+ UVa/136\\_Ugly\\_Numbers: Vector\n+ [x] UVa/902\\_Password\\_Search: Map\n+ [x] UVa/10226\\_Hardwood\\_Species: Map\n+ [x] UVa/10391\\_Compound\\_Words: Map\n\n## DFS\n\n+ UVa/539\\_The\\_Settlers\\_of\\_Catan\n+ UVa/352\\_The\\_Seasonal\\_War\n+ UVa/260\\_Il\\_Gioco\\_dellX\n+ UVa/10004\\_Bicoloring\n+ UVa/10946\\_You\\_want\\_what\\_filled\n+ [x] leetcode/124-binary-tree-maximum-path-sum\n+ leetcode/834-sum-of-distances-in-tree: double DFS\n+ [x] leetcode/841-keys-and-rooms\n+ [x] leetcode/872-leaf-similar-trees\n+ [x] leetcode/938-range-sum-of-bst\n+ [x] leetcode/1026-maximum-difference-between-node-and-ancestor\n+ [x] leetcode/1339-maximum-product-of-splitted-binary-tree: double DFS\n+ [x] leetcode/797-all-paths-from-source-to-target: all paths\n\n## BFS\n\n+ UVa/532\\_Dungeon\\_Master\n+ UVa/439\\_Knight\\_Moves\n+ UVa/383\\_Shipping\\_Routes\n+ UVa/567\\_Risk\n+ UVa/762\\_We\\_Ship\\_Cheap\n+ [x] leetcode/1971-find-if-path-exists-in-graph\n\n## Prime\n\n+ UVa/406\\_Prime\\_Cuts\n\n## Prime factor\n\n+ UVa/10392\\_Factoring\\_Large\\_Numbers\n+ UVa/294\\_Divisors\n\n## GCD\n\n+ UVa/408\\_Uniform\\_Generator\n+ UVa/10104\\_Euclid\\_Problem\n\n## Big number\n\n+ UVa/10106\\_Product\n\n## Floating point\n\n+ UVa/906\\_Rational\\_Neighbor\n\n## Binary search\n\n+ UVa/10474\\_Where\\_is\\_the\\_Marble\n+ UVa/10341\\_Solve\\_It\n+ [x] UVa/10611\\_The\\_Playboy\\_Chimp\n+ [x] leetcode/2389-longest-subsequence-with-limited-sum: prefix sum\n\n## Backtracking\n\n+ UVa/441\\_Lotto\n+ [x] UVa/167\\_The\\_Sultans\\_Successors\n+ UVa/291\\_The\\_House\\_Of\\_Santa\\_Claus\n+ [x] UVa/524\\_Prime\\_Ring\\_Problem\n+ UVa/574\\_Sum\\_It\\_Up\n+ UVa/624\\_CD\n+ [x] UVa/750\\_8\\_Queens\\_Chess\\_Problem\n\n## DP\n\n+ UVa/674\\_Coin\\_Change\n+ UVa/990\\_Diving\\_for\\_gold\n+ UVa/10819\\_Trouble\\_of\\_13-Dots\n+ UVa/10306\\_e-Coins: 2D\n+ UVa/108\\_Maximum\\_Sum: 2D\n+ leetcode/198-house-robber: 1D\n+ [x] leetcode/309-best-time-to-buy-and-sell-stock-with-cooldown: FSM\n+ [x] leetcode/931-minimum-falling-path-sum: 2D\n\n## LCS\n\n+ [x] UVa/531\\_Compromise\n+ [x] UVa/111\\_History\\_Grading\n+ [x] UVa/10066\\_The\\_Twin\\_Towers\n+ [x] UVa/10100\\_Longest\\_Match\n+ [x] UVa/10192\\_Vacation\n+ [x] UVa/10252\\_Common\\_Permutation: sort\n+ [x] UVa/10405\\_Longest\\_Common\\_Subsequence\n+ [x] leetcode/1143-longest-common-subsequence\n\n## LIS (LDS)\n\n+ [x] UVa/231\\_Testing\\_the\\_CATCHER\n+ [x] UVa/437\\_The\\_Tower\\_of\\_Babylon\n+ [x] UVa/481\\_What\\_Goes\\_Up\n+ [x] UVa/497\\_Strategic\\_Defense\\_Initiative\n\n## Shortest Path\n\n+ UVa/341\\_Non-Stop\\_Travel: Bellman-Ford\n+ [x] UVa/558\\_Wormholes: Bellman-Ford\n+ [x] UVa/10000\\_Longest\\_Paths: Bellman-Ford\n+ [x] UVa/10048\\_Audiophobia: Floyd\n+ UVa/10278\\_Fire\\_Station: Floyd\n+ UVa/10986\\_Sending\\_email: SPFA\n\n## Articulation (Cut Vertex)\n\n+ UVa/315\\_Network\n+ [x] UVa/10199\\_Tourist\\_Guide\n\n## SCC (Tarjan)\n\n+ UVa/11838\\_Come\\_and\\_Go\n+ UVa/247\\_Calling\\_Circles\n+ UVa/459\\_Graph\\_Connectivity\n+ [x] UVa/11709\\_Trust\\_groups\n\n## MST\n\n+ UVa/10034\\_Freckles: Kruskal\n+ [x] UVa/10397\\_Connect\\_the\\_Campus: Kruskal\n+ [x] UVa/10147\\_Highways: Kruskal\n+ [x] UVa/10600\\_ACM\\_contest\\_and\\_Blackout: Kruskal\n+ [x] UVa/10842\\_Traffic\\_Flow: Kruskal, MaxST\n+ [x] UVa/908\\_Re-connecting\\_Computer\\_Sites: Kruskal\n+ [x] UVa/11710\\_Expensive\\_subway: Kruskal\n+ [x] UVa/10369\\_Arctic\\_Network: Kruskal\n\n## KMP (Knuth-Morris-Pratt)\n\n+ UVa/455\\_Periodic\\_Strings\n+ [x] UVa/10298\\_Power\\_Strings\n+ [x] UVa/11475\\_Extend\\_to\\_Palindromes\n\n## Maximum Flow\n\n+ [x] UVa/820\\_Internet\\_Bandwidth: Ford Fulkerson\n+ [x] UVa/10330\\_Power\\_Transmission: Ford Fulkerson\n+ UVa/10779\\_Collectors\\_Problem: Ford Fulkerson\n+ UVa/11418\\_Clever\\_Naming\\_Patterns: Edmonds Karp\n\n## Bipartite Matching (Augmenting Path)\n\n+ [x] UVa/10080\\_Gopher\\_II\n+ [x] UVa/\\(POJ)2536\\_Gopher\\_II\n+ [x] UVa/259\\_Software\\_Allocation\n+ UVa/663\\_Sorting\\_Slides\n+ UVa/1486\\_Sorting\\_Slides\n+ UVa/670\\_The\\_dog\\_task\n+ UVa/1325\\_Machine\\_Schedule\n+ UVa/(POJ)1194\\_Machine\\_Schedule\n+ UVa/11159\\_Factors\\_and\\_Multiples\n+ [x] leetcode/886-possible-bipartition\n\n## Segment Tree\n\n+ UVa/(POJ)3264\\_Balanced\\_Lineup\n\n## Binary Indexed Tree\n\n+ UVa/(POJ)2352\\_Stars\n+ UVa/(POJ)1195\\_Mobile\\_phones: 2D\n+ [x] UVa/\\(POJ)3321\\_Apple\\_Tree\n+ [x] UVa/11423\\_Cache\\_Simulator\n+ UVa/(POJ)2155\\_Matrix: 2D\n+ UVa/(POJ)3067\\_Japan\n+ UVa/(POJ)2481\\_Cows\n\n## Line Intersection\n\n+ UVa/191\\_Intersection\n+ UVa/378\\_Intersecting\\_Lines\n\n## Convex Hull\n\n+ UVa/218\\_Moth\\_Eradication\n+ [x] UVa/681\\_Convex\\_Hull\\_Finding\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faben20807%2Foj_code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faben20807%2Foj_code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faben20807%2Foj_code/lists"}