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

• Also, when creating a pull request, please title it ${YYYYMMDD} ${INFO}.

Statistics

Here are the current statistics of submissions: Link.

Today's Problem

Difficulty	Problems	Hints	Solution
1600	CF922C	Actually, you can find out each $n\bmod i$.	Editorial
2100	CF748E	$10^7$ should be used. Find out the maximum number of students who can get at least $k$ slices for each $k$.	Editorial