ACM-ICPC-Preparation-master.zip
大小:1.68MB
价格:34积分
下载量:0
评分:
5.0
上传者:2301_80488214
更新日期:2025-09-22

ACM-ICPC 备战指南

资源文件列表(大概)

文件名
大小
ACM-ICPC-Preparation-master/
-
ACM-ICPC-Preparation-master/.gitignore
27B
ACM-ICPC-Preparation-master/CODE_OF_CONDUCT.md
3.13KB
ACM-ICPC-Preparation-master/LICENSE
1.05KB
ACM-ICPC-Preparation-master/README.md
8.47KB
ACM-ICPC-Preparation-master/Week00/
-
ACM-ICPC-Preparation-master/Week00/README.md
700B
ACM-ICPC-Preparation-master/Week01/
-
ACM-ICPC-Preparation-master/Week01/README.md
3.24KB
ACM-ICPC-Preparation-master/Week01/solutions/
-
ACM-ICPC-Preparation-master/Week01/solutions/distinct_primes.py
762B
ACM-ICPC-Preparation-master/Week01/solutions/medium_factorization.py
1.21KB
ACM-ICPC-Preparation-master/Week01/solutions/noldbach_problem.py
939B
ACM-ICPC-Preparation-master/Week01/solutions/tiny_implementation.py
987B
ACM-ICPC-Preparation-master/Week01/vanilla_implementations/
-
ACM-ICPC-Preparation-master/Week01/vanilla_implementations/modularExponentiation.cpp
301B
ACM-ICPC-Preparation-master/Week01/vanilla_implementations/primeFactorization.cpp
1.23KB
ACM-ICPC-Preparation-master/Week01/vanilla_implementations/sieveOfEratosthenes.cpp
1.04KB
ACM-ICPC-Preparation-master/Week01/vanilla_implementations/sieve_of_eratosthenes.py
781B
ACM-ICPC-Preparation-master/Week02/
-
ACM-ICPC-Preparation-master/Week02/README.md
3.02KB
ACM-ICPC-Preparation-master/Week02/solutions/
-
ACM-ICPC-Preparation-master/Week02/solutions/complicated_gcd.py
390B
ACM-ICPC-Preparation-master/Week02/solutions/gcd_of_large_number.cc
684B
ACM-ICPC-Preparation-master/Week02/solutions/modular_gcd.py
750B
ACM-ICPC-Preparation-master/Week02/solutions/sherlock_and_gcd.py
940B
ACM-ICPC-Preparation-master/Week02/vanilla_implementations/
-
ACM-ICPC-Preparation-master/Week02/vanilla_implementations/gcd_lcm.py
452B
ACM-ICPC-Preparation-master/Week03/
-
ACM-ICPC-Preparation-master/Week03/README.md
2.96KB
ACM-ICPC-Preparation-master/Week04/
-
ACM-ICPC-Preparation-master/Week04/README.md
2.99KB
ACM-ICPC-Preparation-master/Week04/solutions/
-
ACM-ICPC-Preparation-master/Week04/solutions/merge_sort_codechef.py
568B
ACM-ICPC-Preparation-master/Week04/vanilla_implementations/
-
ACM-ICPC-Preparation-master/Week04/vanilla_implementations/merge_sort.py
1.64KB
ACM-ICPC-Preparation-master/Week05/
-
ACM-ICPC-Preparation-master/Week05/README.md
3.74KB
ACM-ICPC-Preparation-master/Week05/solutions/
-
ACM-ICPC-Preparation-master/Week05/solutions/herding
201.67KB
ACM-ICPC-Preparation-master/Week05/solutions/herding.cpp
1.7KB
ACM-ICPC-Preparation-master/Week05/solutions/herding.py
1.16KB
ACM-ICPC-Preparation-master/Week05/solutions/hike.py
2.56KB
ACM-ICPC-Preparation-master/Week05/solutions/largest_rectangle.py
513B
ACM-ICPC-Preparation-master/Week05/solutions/stock_span_problem.py
559B
ACM-ICPC-Preparation-master/Week05/vanilla_implementations/
-
ACM-ICPC-Preparation-master/Week05/vanilla_implementations/bfs.py
1.58KB
ACM-ICPC-Preparation-master/Week05/vanilla_implementations/dfs.py
1.56KB
ACM-ICPC-Preparation-master/Week06/
-
ACM-ICPC-Preparation-master/Week06/README.md
5.6KB
ACM-ICPC-Preparation-master/Week07/
-
ACM-ICPC-Preparation-master/Week07/README.md
2.63KB
ACM-ICPC-Preparation-master/Week08/
-
ACM-ICPC-Preparation-master/Week08/README.md
44B
ACM-ICPC-Preparation-master/Week09/
-
ACM-ICPC-Preparation-master/Week09/README.md
7.18KB
ACM-ICPC-Preparation-master/Week10/
-
ACM-ICPC-Preparation-master/Week10/Problems/
-
ACM-ICPC-Preparation-master/Week10/Problems/Min-Cut_Max-Flow-01.pdf
486.74KB
ACM-ICPC-Preparation-master/Week10/Problems/Min-Cut_Max-Flow-02.pdf
409.18KB
ACM-ICPC-Preparation-master/Week10/Problems/Min-Cut_Max-Flow-03.pdf
430.23KB
ACM-ICPC-Preparation-master/Week10/README.md
2.75KB
ACM-ICPC-Preparation-master/Week11/
-
ACM-ICPC-Preparation-master/Week11/README.md
1.71KB
ACM-ICPC-Preparation-master/Week12/
-
ACM-ICPC-Preparation-master/Week12/README.md
600B
ACM-ICPC-Preparation-master/Week12/Source/
-
ACM-ICPC-Preparation-master/Week12/Source/trie.cpp
1.52KB
ACM-ICPC-Preparation-master/Week13/
-
ACM-ICPC-Preparation-master/Week13/Readme.md
737B
ACM-ICPC-Preparation-master/Week19/
-
ACM-ICPC-Preparation-master/Week19/Readme.md
340B
ACM-ICPC-Preparation-master/acm_icpc_prep.jpg
463.9KB
ACM-ICPC-Preparation-master/googlefa72b21fb50e2d3b.html
53B

资源内容介绍

先决条件:了解至少一种编程语言。(你必须能够有效地使用该语言。)这个知识库的理念是将结构良好的内容分成几个部分,这样即使很忙也可以跟上。在这里,我们收集了我们认为可以很好地学习所提主题的资源。课程有不同的数据结构和算法。预计一周所需时间为6-7小时。(在规定时间内完成课程)基本使用指南: 使用此存储库取决于用户想要用它做什么。我们为那些想要在继续​​学习的同时慢慢掌握主题知识的人提供以下建议:根据个人喜好,查看针对特定主题提供的书面或视频资源。查看尽可能多的资源,以更好地理解该主题。不检查源代码,尝试自己复制算法或数据结构。当遇到困难或完成时,请查看提供的源代码,并将其与您的代码进行比较,以查看可能的错误。尝试修复它。当您对代码感到满意后,尝试解决给定的问题。当您完成解决问题或在某个时候遇到困难时,请检查给出的解决方案并尝试理解您的错误或查看是否存在更好的方法。
![ACM-ICPC](https://github.com/NAU-ACM/ACM-ICPC-Preparation/blob/master/acm_icpc_prep.jpg "ACM-ICPC")# ACM-ICPC Preparation ![](https://img.shields.io/badge/licence-MIT-green.svg) ![](https://img.shields.io/badge/Weeks%20Completed-8%2F20-orange.svg) ![](https://img.shields.io/badge/Revisions-4%2F20-red.svg)This curriculum has been developed to learn Algorithms to use in Competitive Programming, **but can also be used for:** - Practicing for Interviews - Improving Algorithmic Thinking - Practicing for College Classes**Prerequisites:** - To know at least one programming language. (_You have to be able to use the language efficiently._)The concept of this repository is to have well-structured content divided into parts that one can follow even if they are busy. Here we collected sources we find well prepared to learn the proposed topics. The curriculum has different data structures and algorithms. **Estimated time required for a week is 6-7 hours.** (To complete the curriculum in the given time)**Basic usage guide:**Using this repository depends on what the user wants to do with it. Here we are suggesting the following for people who want to slowly gain knowledge of the topics while continuing their studies etc.: 1. Check out the written or video sources provided for a given topic depending on the preference. Go over as many as needed to gain a good understanding of the topic. 2. Without checking the source code, try to replicate the algorithm or data structure on your own. 3. When stuck or when done, look at the source codes provided, and compare them with yours to see what might be your mistake. Try to fix it. 4. After you feel comfortable with the code, try to solve the given problems. 5. When you are done with solving or are stuck at some point, check given solutions and try to understand your mistake or see if a better approach exists.## ResourcesHere are some of the websites/tools that we use through this curriculum: - [Leetcode](https://leetcode.com) - [Spoj](http://www.spoj.com) - [Hackerrank](https://www.hackerrank.com/domains) - [Topcoder](https://www.topcoder.com) - [Codeforces](http://codeforces.com) - [Lightoj](http://www.lightoj.com) - [ACM-Timus](http://acm.timus.ru)## ContributionIf you have anything to add, do not hesitate to offer! You can check [Code of Conduct](CODE_OF_CONDUCT.md). You can submit a PR or an issue; I will try to personally review all.## TopicsHere are the topics we currently include in the curriculum.### Data Structures - Stacks - Queues - Priority queue - Hashmap - Linked List - Trees - Heaps - Advanced Trees - Tries - Segment trees - Fenwick tree or Binary indexed trees - RMQ - SQRT Decomposition - Disjoint Data Structure - C++ STL (optional)### Algorithms - Number Theory - Prime Numbers (Sieve of Eratosthenes) - GCD and LCM Euclid’s Algorithm - Modular Exponentiation - Long arithmetic (Multi, Add) - Efficient Prime Factorization - Combinatorics (Probability-Combinations-Permutations-Matrix..) - Computational Geometry - Primitive Operations - Intuition - Polygon Inside, Outside - Implementing CCW - Immutable Point ADT - Convex Hull - Closest pair problem - Line intersection - Sort - QuickSort - Counting Sort - Merge Sort - Search - Binary Search - Ternary Search - Graph Theory - Depth First Search (DFS) - Breadth First Search (BFS) - Dijkstra’s Shortest Path - Minimum Spanning Tree - Ford Bellman - Floyd Warshall - LCA (Lowest Common Ancestor) - Max Flow / Min Cut - Dynamic Programming - Knapsack - Matrix chain multiplication - Coin Change - Kadane - Longest increasing Subsequence (with RMQ) - Strings - Z algorithm - Suffix Trees/Arrays - Knuth-Morris-Pratt Algorithm (KMP) - Rabin-Karp Algorithm - Hash - Bit Manipulation - Game theory - Nim game - Grundy numbers - Sprague-Grundy theorem - **Optional Advanced Algorithms** - AVL Trees - Graph Coloring - Mo's Algorithm - Palindromic Tree - Heavy Light Decomposition - Dynamic Programming by Profile - Rod Cutting - Topological Sorting - DP with Bitmask - Dynamic Programming - Diobhantine Equation - Math - Flood Fill - Graph## Curriculum|Week|Topics|Optional Topics|| --- | --- | --- ||[**Heads Up **](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week00)|<ul><li>Big O Notation</li></ul>|||[**1.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week01)|<ul><li>Prime Numbers (Sieve of Eratosthenes)</li><li>Efficient Prime Factorization</li><li>Modular Exponentiation</li></ul>|||[**2.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week02)|<ul><li>GCD and LCM Euclid’s Algorithm</li><li>Long arithmetic (Multi, Sum, Div, Sub)</li></ul>|<ul><li>C++ STL:Vector</li><li>C++ STL:Pairs</li><li>C++ STL:Iterators</li></ul>||[**3.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week03)|<ul><li>QuickSort</li><li>Counting Sort</li></ul>|<ul><li>C++ STL:String</li><li>C++ STL:Set</li><li>C++ STL:Map</li></ul>||[**4.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week04)|<ul><li>Merge Sort</li><li>Binary Search</li></ul>|<ul><li>Ternary Search</li></ul>||[**5.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week05)|<ul><li>Queue (DS)</li><li>Stack (DS)</li><li>Breadth First Search</li><li>Depth First Search</li></ul>|<ul><li>C++ STL: Queue</li><li>C++ STL: Stack</li></ul>||[**6.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week06)|<ul><li>Linked List (DS)</li><li>Dijkstra’s Shortest Path</li><li>Minimum Spanning Tree (MST)</li><li>Floyd Warshall</li></ul>|<ul><li>Cycle Detection (Union Find)</li></ul>||[**7.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week07)|<ul><li>Knapsack</li><li>Coin Change</li><li>Kadane</li></ul>|||[**8.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week08)|**Questions from previous topics**|||[**9.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week09)|<ul><li>Trees (DS)</li><li>Segment Trees (DS)</li><li>Range Minimum Query (RMQ)</li><li>Lowest Common Ancestor (LCA)</li></ul>|<ul><li>Topological Sorting</li></ul>||[**10.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week10)|<ul><li>Ford Bellman</li><li>Max Flow / Min Cut</li><li>Longest increasing Subsequence (with RMQ)</li></ul>|<ul><li>Heavy Light Decomposition</li></ul>||[**11.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week11)|<ul><li>Primitive Operations<ul><li>Intuition</li><li>Polygon Inside, Outside</li><li>Implementing CCW</li><li>Immutable Point ADT</li></ul></li><li>Convex Hull</li><li>Closest pair problem</li><li>Line intersection</li></ul>|||[**12.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week12)|<ul><li>Tries (DS)</li><li>Suffix Trees/Arrays (DS)</li><li>Knuth-Morris-Pratt Algorithm (KMP)</li><li>Rabin-Karp Algorithm</li></ul>|||[**13.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week13)|<ul><li>Heaps (DS)</li><li>Priority queue (DS)</li><li>Combinatorics</li></ul>|||[**14.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week14)|<ul><li>Z algorithm</li><li>Hash</li><li>Disjoint Data Structure (DS)</li></ul>|||[**15.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week15)|<ul><li>Matrix chain multiplication</li><li>SQRT Decomposition (DS)</li></ul>|<ul><li>Mo's Algorithm</li><li>Rod Cutting</li></ul>||[**16.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week16)|**Questions from previous topics**|||[**17.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week17)|<ul><li>Nim gam

用户评论 (0)

发表评论

captcha

相关资源

Objective-C 的模拟对象

使用 OCMock – 简短版本为实例和类方法创建存根模拟对象代表真实对象。使用存根,我们可以指定调用方法时要返回的内容:// create a mock for the user defaultsid userDefaultsMock = OCMClassMock([NSUserDefaults class]);// set it up to return a specific value when stringForKey: is calledOCMStub([userDefaultsMock stringForKey:@"MyAppURLKey"]).andReturn(@"http://testurl");// set it up to return the specified value no matter how the method is invokedOCMStub([userDefaultsMock stringForKey:[OCMArg any]]).andReturn(@"http://testurl");

2.68MB10积分

Docker 官方镜像打包 PHP

简短版本:“简单标签”通常是一个单一平台(Windows 与 Linux),而“共享标签”是多个平台的组合(因此根据它们运行的​​平台可能会有很大不同的界面/行为,但总体上应该代表大致相同的东西)。Dockerfile一些图像在“支持的标签和相应的链接”下分离了“简单标签”和“共享标签”部分。“简单标记”是“单个”Linux 或 Windows 映像的实例。它通常是一个清单列表,可以包含为其他体系结构构建的相同映像;例如,mongo:4.0-xenial目前有amd64和 的映像arm64v8。Docker 守护程序负责为主机体系结构选择合适的映像。“共享标签”是始终指向清单列表的标签,该清单列表包括所有各自映像架构中 Windows 和 Linux 映像的潜在多个版本的组合 - 在示例中mongo,4.0标签是一个共享标签,由(在撰写本文时)所有4.0-xenial、4.0-windowsservercore-ltsc2016、4.0-windowsservercore-1709和组成4.0-windowsservercore-1803。

723.51KB50积分

蓝桥杯VIP全题库共1149道,满分代码

蓝桥杯VIP全题库共1149道,满分代码

1.11KB14积分

基于Kotlin+MVP+Retrofit+RxJava+Glide 等架构实现短视频类小项目,简约风格及详细注释

模块说明:每日精选: 首页采用下拉刷新+RecyclerView 实现,Banner展示每日精选推荐的视频,监听 RecyclerView 的滑动事件,实现 TitleBar 的隐藏显示功能,底部菜单采用高斯模糊的半透明效果,使整个 APP 风格更加清爽。发现: 包括关注和分类模块,关注是推荐的作者上传的视频集,分类包括时尚、运动、创意、广告、音乐、旅行、生活、记录、开胃、游戏、萌宠、动画、综艺、搞笑等可自由选择想查看的类型视频。热门: 热门排行榜包括周排行、月排行、总排行的视频列表。搜索: 根据关键字搜索榜你找到感兴趣的视频。我的: 个人主页的相关介绍。观看记录: 查看之前看过的视频,按时间进行排序。

18.19MB30积分