-
Update 2 Codeforces problems with different difficulty everyday except Sunday in the file
daily_problems/${YYYY}/${MM}/${MMDD}/problems.md
with hints. -
Update the solution to at least 1 of the 2 problems in the file
daily_problems/${YYYY}/${MM}/${MMDD}/solution/${problem_code}.md
. -
Categorize the problems by their used methods in the file
categories/${method}.md
.
-
Upload your solution in the folder:
daily_problems/${YYYY}/${MM}/${MMDD}/personal_submission
. -
Remember to name your submission code file
${problem_code}_{your_name}.{py/cpp/...}
. -
Also, when creating a pull request, please title it
${YYYYMMDD} ${INFO}
.
Here are the current statistics of submissions: Link.
Difficulty | Problems | Hints | Solution |
---|---|---|---|
1600 | CF980B | You don't need to actually calculate the number of shortest paths. | Editorial |
2200 | CF507D | The modulo condition starts from the suffix, so DP from the right. | Editorial |