This document provides an introduction to programming contests. It outlines 9 steps: 1) having an eagerness to learn programming languages, data types, and algorithms, 2) understanding why programming contests are useful for improving skills, 3) learning how to attack problems by reading the problem, abstracting it, designing an algorithm, implementing and debugging, and submitting, 4) solving some beginner problems, 5) understanding the different verdicts of accepted, time limit exceeded, etc., 6) dealing with challenges of time and memory complexity, 7) learning about time complexity, 8) learning number theory topics like prime numbers, and 9) learning the Standard Template Library. The document recommends practicing problems on sites like GeeksforGeeks and

1. Introduction to
Programming Contests
Badhan Sen

2. Step 1: Eagerness to learn

3. ➔ Least importantly, Programming Language Knowledge:
➔ You will be coding in C/ C++/ Java.
➔ Tamim Shahriar Subeen Link
➔ Data Type
➔ Input/output
➔ Conditional Logic
➔ Loop(while, for, do .. while)
➔ Array
➔ Function & String
Eagerness to learn

4. Step 2: Why Programming Contest?

5. ➔ You will keep learning:
◆ Many useful algorithms, mathematical insights
◆ How to code/debug quickly and accurately
◆ How to work in a team
➔ Then you can rock in classes, Job Interviews, etc.
➔ It’s also fun!
Why Programming Contest?

6. Step 3: Steps to Attack a Problem

7. 1. Read the problem statement
a. Check the input/output specification!
2. Make the problem abstract
3. Design an algorithm
a. Often the hardest step
4. Implement and debug
5. Submit
6. AC!
a. If not, go back to 4
Steps to Attack a Problem

8. Step 4: Solve Some Problems

9. ➔ Solve some BEGINNER’s problems
➔ Find a number in an array
➔ Solve some Math equations
Solve Some Problems

12. Step 5: Verdicts

13. 1. Wrong answer
2. Time limit exceeded
3. Memory limit exceeded
4. Run time error
5. Presentation error
6. Accepted!
Verdicts

14. Step 6: Challenges

15. 1. Time
a. How many instructions your code is executing
b. Worst case!
2. Memory
a. How much memory (size of data you are using i.e. array) your code needs
b. Worst case!
3. Compromise between time and memory
Challenges

16. Step 7: Time Complexity

17. Time Complexity

18. Time Complexity

19. Time Complexity

20. Step 8: Number Theory

21. 1. Prime Number
2. Probability
3. Combinatorics
4. Gcd & Lcm
Number Theory

22. Step 9: Learn STL(Standard Template Library)

23. ➔ Tanvir Hasan Anick Blog
➔ Zobayer Bhai's Blog
➔ TopCoder STL Tutorial Part 1
➔ TopCoder STL Tutorial Part 2
STL Resources

24. Next Steps

25. What next?
Practice, Practice and Practice?

26. References
GeeksForGeeks
HackerEarth CodeMonk
ShafaetPlanet
BUBT Camp Resources
BACS Camp Resources
Dawn of Programming Contest [Mahbubul Hasan]