array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(9) " sort of/" [2]=> string(1) "0" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(33) " sort of/[EP 1] Implementation.md" [2]=> string(4) "2060" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(25) " sort of/[EP 2] Greedy.md" [2]=> string(4) "1461" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(26) " sort of/[EP 3] Sorting.md" [2]=> string(4) "3815" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(26) " sort of/[EP 4] C++ STL.md" [2]=> string(4) "2880" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(35) " sort of/[EP 5] Frequency tables.md" [2]=> string(4) "1371" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(34) "Beginner Topics/[S1] Greed is good" [1]=> string(24) " sort of/[~] Practice.md" [2]=> string(4) "2163" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(56) "Beginner Topics/[S2] Primal proficiency/[EP 2] Primality" [1]=> string(27) " Factorization and Sieve.md" [2]=> string(4) "1805" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(36) "Beginner Topics/[S3] 2P or not to 2P" [1]=> string(28) " No wait isn't this just bs/" [2]=> string(1) "0" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(36) "Beginner Topics/[S3] 2P or not to 2P" [1]=> string(49) " No wait isn't this just bs/[EP 1] Prefix sums.md" [2]=> string(4) "2011" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(36) "Beginner Topics/[S3] 2P or not to 2P" [1]=> string(50) " No wait isn't this just bs/[EP 2] Two pointers.md" [2]=> string(4) "1456" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(36) "Beginner Topics/[S3] 2P or not to 2P" [1]=> string(51) " No wait isn't this just bs/[EP 3] Binary search.md" [2]=> string(4) "4378" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(36) "Beginner Topics/[S3] 2P or not to 2P" [1]=> string(52) " No wait isn't this just bs/[EP 4] Ternary search.md" [2]=> string(4) "1024" [3]=> string(21) "2023-06-05 08:57:02 " } array(4) { [0]=> string(36) "Beginner Topics/[S3] 2P or not to 2P" [1]=> string(43) " No wait isn't this just bs/[~] Practice.md" [2]=> string(4) "2598" [3]=> string(21) "2023-06-05 08:57:02 " } CC 联合开发网 - pudn.com
CC

所属分类:C#编程
开发工具:C++
文件大小:0KB
下载次数:0
上传日期:2023-06-05 15:57:04
上 传 者sh-1993
说明:  所有与竞争性编程相关的内容-入门指南,主题概念,实践问题,片段和模板...
(Everything competitive programming related - introductory guide, topics/concepts, practice problems, snippets & templates, tips & tricks and more.)

文件列表:
Beginner Topics/ (0, 2023-06-05)
Beginner Topics/[S2] Primal proficiency/ (0, 2023-06-05)
Beginner Topics/[S2] Primal proficiency/[EP 1] Basic math.md (926, 2023-06-05)
Beginner Topics/[S2] Primal proficiency/[EP 3] GCD and Totient function.md (2063, 2023-06-05)
Beginner Topics/[S2] Primal proficiency/[EP 4] Modular Arithmetic.md (6168, 2023-06-05)
Beginner Topics/[S2] Primal proficiency/[EP 5] Binary Exponentiation.md (712, 2023-06-05)
Beginner Topics/[S2] Primal proficiency/[~] Practice.md (1853, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/ (0, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 0] Introduction to Dynamic Programming.md (2143, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 1] Coin change.md (873, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 2] Maximum subarray sum.md (695, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 3] Knapsack.md (1165, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 4] LCS & Edit distance.md (862, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 5] LIS.md (1069, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 6] Grid DP.md (635, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[EP 7] MCM style DP.md (918, 2023-06-05)
Beginner Topics/[S4] Boohoo~ It's dp time/[~] Practice.md (2771, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/ (0, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 0] Graph terminology and representation.md (732, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 1] Graph traversal/ (0, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 1] Graph traversal/[Pt 1] DFS.md (1562, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 1] Graph traversal/[Pt 2] BFS.md (1628, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 2] Shortest paths/ (0, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 2] Shortest paths/[Pt 1] Bellman-Ford.md (647, 2023-06-05)
Beginner Topics/[S5] Do you understand the graphity of this situation/[EP 2] Shortest paths/[Pt 2] Dijkstra's.md (1245, 2023-06-05)
... ...

# Getting into Competitive Coding Programming is all about writing code to solve problems or tasks. Competitive programming makes a sport out of this, where contestants compete (usually online) to solve a bunch of such problems in a limited amount of time. ## What's in a problem? Problems are primarily math, logic and/or algorithm based and typically look something like [this](https://codeforces.com/problemset/problem/4/A). Such problems usually consist of a statement (that details the task), the input and output format, constraints on the input and some examples (will be further explained later on). Try [this](https://codeforces.com/problemset/problem/71/A) problem. Read the statement carefully and try to understand what it is asking. Once you figure it out, all that's left is to code it. Here's what one of the many possible solutions looks like.
C++ code ```c++ #include using namespace std; int main() { int n; cin >> n; while(n--) { string s; cin >> s; if(s.length() <= 10) cout << s << endl; else cout << s.front() << s.length()-2 << s.back() << endl; } return 0; } ```
## Choosing a language Most competitive programmers prefer C++, and for [good reason](https://www.codingninjas.com/blog/2018/04/11/the-best-languages-for-competitive-programming/). However, Java and Python are also fairly popular. Knowing a programming language is the only pre-requisite. While I do say that, you are by no means expected to be an expert. If you can manage a basic hello world and can work with loops and conditionals, you are good to go. **Note**: The code snippets in this guide will be in C++ since it is arguably the best language for competitive programming ~~and not because I do not know any other languages :/ UPD: I learnt a little bit of Java and Pythom :)~~ ## Setting up an IDE If you haven't already set up an IDE, you may find use for one of the following links. I personally use Sublime Text, with VS code being my second choice, but it is a matter of personal preference. * [Sublime Text](./Sublime%20Text%20Setup.md) * [VS code](https://medium.com/@chinmaykulkarni8/how-to-setup-visual-studio-code-for-c-c-java-python-competitive-programming-angular-22fdc9b1f4c6) and a [cool extension](https://github.com/agrawal-d/competitive-programming-helper/) ## Competitive coding platforms There are many platforms that host programming contests and allow you to practice solving problems, among other things. One such platform is [Codeforces](https://codeforces.com/), which I primarily use and recommend. [Here](./Competitve%20Programming%20Platforms.md) is a detailed guide I've written about problem statements, how contests work and the rating system on Codeforces (and a few other platforms). ## Get started Here are a few problems for you to get started with. They're really simple and should help you understand how to submit code on online platforms.
Click
Once you're done with these, head on over to the [problemset](https://codeforces.com/problemset?order=BY_RATING_ASC) ~~I liked bugabooset better~~ on Codeforces and sort problems by rating. Solve some easy problems till you get a feel for it. ## What's next? Once you familiarize yourself with these things, here are some things you could consider doing next: * **Time complexity:** Take a look at [time and space complexity](./Complexity%20and%20Big-O%20Notation.md), as you will soon realise that not all logically 'correct' solutions pass the given constraints. * **Learn new concepts/topics:** Develop your problem solving skills by learning new topics, one at a time. [Here's](./Beginner%20Topics) a collection of some common beginner topics and problems on the same. The [cses problemset](https://cses.fi/problemset/list/) is another great place to practice standard problems from various topics. * **Practice:** Turn to the codeforces [problemset](https://codeforces.com/problemset), and sort by difficulty and tags. Grind problems because there's nothing like **practice, practice, practice**. * **Contests:** Participate in live [contests](https://codeforces.com/contests) or take [virtual](https://codeforces.com/blog/entry/70036) ones. Virtual contests are a way to participate in or experience old contests that have already happened in the past.
The secret formula Practice In all seriousness though Learn new topic > Practice problems > Improve speed > Learn new topic > Practice ... Rinse and repeat.
## Extras * **Cool repos:** [YouKn0wWho](https://github.com/ShahjalalShohag/code-library), [smax](https://github.com/mzhang2021/cp-library), [Ashishgup](https://github.com/Ashishgup1/Competitive-Coding) * **Rating predictor:** [CF Predictor](https://cf-predictor-frontend.herokuapp.com/) or [Carrot](https://github.com/meooow25/carrot/) * **Problem/Contest parser:** [Competitve Companion](https://github.com/jmerle/competitive-companion) coupled with * [Competitve Programming Helper](https://github.com/agrawal-d/competitive-programming-helper/) (for VS code) * [FastOlympicCodingHook](https://codeforces.com/blog/entry/60627?#comment-593580) \[[alt](https://codeforces.com/blog/entry/85342)\] (for Sublime Text) * **Stats:** [Codeforces Visualizer](https://cfviz.netlify.com/), [Codeforces Practice Tracker](https://codeforces.com/blog/entry/78203), [CF Analytics](https://codeforces.com/blog/entry/93417) * **Misc:** [Codeforces Live Telegram Bot](https://codeforces.com/blog/entry/82669), [Codeforces Enhancer](https://codeforces.com/blog/entry/74062), [Codeforces Customizer](https://codeforces.com/blog/entry/93536), [Dark mode](https://codeforces.com/blog/entry/93606)

近期下载者

相关文件


收藏者