Skip to content

To practice your competitive programming skills, try solving daily Codeforces problems!

Yawn-Sean/Daily_CF_Problems

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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 GYM104785K If you can categorize the edges into two parts and both have no cyclical dependencies, at least one of them has more than $m/2$ edges. Editorial
*2200 GYM104873 Remove the square. There are not a lot of lines. Editorial

About

To practice your competitive programming skills, try solving daily Codeforces problems!

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published