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
1700	CF1592C	The xor-sum of every connected component is fixed. Use this fact.	Editorial
2000	CF1903E	We only care about the parity of the result. So the sum of the square of the Euclidean distance can be simplified.	Editorial