This is the practice repository for algorithm and data structure study.
Our study book is 알고리즘 문제 해결 전략 and we will study 2 chapters per month.
Basic language of our study is C++ but it doesn't matter to use JAVA or other language instead. Although our book introduces the pseudo-algorithm as C++, so I strongly recommend using C++ std11.
We don't have code convention because every team has difference convention so it is unnecessary to force it.
However, if you want to use specific convention, I recommend MS DotNet convention.
Every week, we will solve real problem in 백준 알고리즘 그룹. Every practice set will have at least 3 problems and at most 5 problems. Practice will start every Saturday, and it will end on Wednesday midnight.
We will review our code after the practice end, so please commit your code file
You have to commit your code in proper name.
Every week, there will be a new folder name MMDDYY.
Please upload your code in the folder as NAME_SET.PROBLEM#.cpp (ex) hj_1.cpp
If you FAILED to solve the problem please add _F in the end of the file (ex) hj_2_F.cpp
For your convenience, I recommend you to use "bits/stdc++.h" which include all useful headers to solve problem.
In the prac folder, you can upload your code that you just solve it for your own study.
-
- Divide and Conquer Algorithm is a method which can solve problem more faster than Brute Force. This strategy divide problem into small problems, then solve divided problems. After solve fragmented problems, merge divided anwsers and acquire final answer.
- Assignment Problem