Daily_CF_Problems

Main Activities (Daily)

• 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.

How to join

• 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/...}.

Statistics

Here are the current statistics of submissions: Link.

Today's Problem

Difficulty	Problems	Hints	Solution
1600	CF788A	$a[i]-a[i+1]$ doesn't really matter. How can you use DP to solve a segment-sum-maximum problem? This is similar.	Editorial
2100	CF1599H	Use queries to rule out the wrong points. Note that the border should contain a point in the target.	Editorial