{"id":17929559,"url":"https://github.com/azl397985856/cf","last_synced_at":"2025-03-24T04:31:03.897Z","repository":{"id":65980512,"uuid":"490922111","full_name":"azl397985856/cf","owner":"azl397985856","description":" Codeforces Solutions: A Record of My Problem Solving Journey.( Codeforces题解，记录自己的Codeforces解题之路。)","archived":false,"fork":false,"pushed_at":"2023-01-07T14:05:11.000Z","size":41,"stargazers_count":19,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-19T01:45:27.031Z","etag":null,"topics":["algorithms","codeforces","data-structures","python","python3"],"latest_commit_sha":null,"homepage":"https://leetcode-solution.cn/","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/azl397985856.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-05-11T01:55:13.000Z","updated_at":"2024-12-28T04:13:23.000Z","dependencies_parsed_at":"2023-02-19T19:31:27.175Z","dependency_job_id":null,"html_url":"https://github.com/azl397985856/cf","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fcf","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fcf/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fcf/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/azl397985856%2Fcf/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/azl397985856","download_url":"https://codeload.github.com/azl397985856/cf/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245210937,"owners_count":20578316,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","codeforces","data-structures","python","python3"],"created_at":"2024-10-28T21:09:38.360Z","updated_at":"2025-03-24T04:31:03.617Z","avatar_url":"https://github.com/azl397985856.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Codeforces\n\n[![Travis](https://p.ipic.vip/o3azht.jpg)]() [![Travis](https://p.ipic.vip/jf4jge.jpg)]() [![Travis](https://p.ipic.vip/owmlpe.jpg)]() [![Travis](https://p.ipic.vip/tqs7lr.jpg)]() [![Travis](https://p.ipic.vip/tdcv1m.jpg)]() [![Travis](https://p.ipic.vip/g4v4zf.jpg)]()\n\n[![](https://img.shields.io/badge/WeChat-微信群-brightgreen)](#哪里能找到我) [![](https://img.shields.io/badge/公众号-力扣加加-blueviolet)](#哪里能找到我) [![](https://img.shields.io/badge/Juejin-掘金-blue)](https://p.ipic.vip/pi37mw.jpg) [![](https://img.shields.io/badge/Zhihu-知乎-blue)](https://p.ipic.vip/sxna9b.jpg) [![](https://img.shields.io/badge/bilili-哔哩哔哩-ff69b4)](https://p.ipic.vip/t4cfcg.jpg)\n\n---\n\n我们的 slogan 是： **只有熟练掌握基础的数据结构与算法，才能对复杂问题迎刃有余。**\n\n建议大家先学习基础的数据结构与算法，然后从简单到困难的顺序刷题。\n\n## 前置知识\n\n- 这里有一张互联网公司面试中经常考察的问题类型总结的思维导图，我们可以结合图片中的信息分析一下。\n\n![leetcode-zhihu](https://p.ipic.vip/5b28b4.jpg)\n\n（图片来自 leetcode)\n\n其中算法，主要是以下几种：\n\n- 基础技巧：分治、二分、贪心\n- 排序算法：快速排序、归并排序、计数排序\n- 搜索算法：回溯、递归、深度优先遍历，广度优先遍历，二叉搜索树等\n- 图论：最短路径、最小生成树\n- 动态规划：背包问题、最长子序列\n\n数据结构，主要有如下几种：\n\n- 数组与链表：单 / 双向链表\n- 栈与队列\n- 哈希表\n- 堆：最大堆 ／ 最小堆\n- 树与图：最近公共祖先、并查集\n- 字符串：前缀树（字典树） ／ 后缀树\n\n## 基础数据结构与算法学习\n\n- [西法的刷题秘籍](https://github.com/azl397985856/leetcode)\n\n\u003e [在线阅读地址](https://leetcode-solution-leetcode-pp.gitbook.io/leetcode-solution/)\n\n## 如何刷 codeforces\n\n**一定不要死磕一看就能写出来的题目，也不要死磕看了十分钟也没有思路的题目。**\n\n进入 problemset， 选择自己想刷的题目即可。比如我想刷搜索题目，就可以标签中进行过滤，同时建议大家选择难度范围。新手建议 1700 分以下练习。等到熟练之后可以挑战一下 1800 - 2500 分数段。\n\n同一个分值的题目难度差距也可能很大，因此大家同时结合通过人数来排序。\n\n![](https://p.ipic.vip/emnjep.jpg)\n\n![](https://p.ipic.vip/jovg3i.jpg)\n\n这样可以更容易找到难度合适的题目。\n\n大家从这个[链接](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=constructive+algorithms%2C2000-2000 \"cf 筛选\")进去就可以看到我选择的过滤标签了。\n\n等到大家熟悉了节奏，推荐大家按照比赛的方式做题。即将一次 contest 的题目整个做一遍。cf 中是按照编号进行组织的。\n\n比如 101a 就是 101 比赛的第一道题。 101c 就是 101 比赛的第三道题，以此类推。\n\n做完一道题建议大家看一下题解，入口是这里的 tutorial。\n\n![](https://p.ipic.vip/8ygsol.jpg)\n\n## :computer: 插件\n\n如果你想看其他搜索人的代码，则可以进入 status 查看。所有人的答案都在这里，你可以根据多个维度进行排序，比如按照代码长短排序。\n\n大家可以使用[codeforces-solutions 插件](https://chrome.google.com/webstore/detail/codeforces-solutions/eiogioiioffnoogeciigdmckkjomcocl?hl=ja)快速进入当前题目的 status 界面。\n\n![](https://p.ipic.vip/titkmq.jpg)\n\n还有很多其他的 cf 插件大家可以体验一下。比如 [Codeforces Enhancer](https://chrome.google.com/webstore/detail/codeforces-enhancer/ocmandagmgmkcplckgnfgaokpgkfenmp)\n\n另外大家也可以使用 zerotrac 开发的用于计算力扣中题目分数的网站。这里的分数指的是竞赛分，大家可以根据自己的竞赛分选择稍微比自己竞赛分高一点的题目进行练习，注意这个只是根据通过人数等计算的一个预估分数。地址：https://zerotrac.github.io/leetcode_problem_rating/\n\n\u003e 这个网站只能预估 764 题以后的题目，之前的老题无法预估。\n\n## codeforces 经典题目解析\n\n你可以将其看成是学习路线，也可以看成是经典题目。\n\n这里的题目按照难度进行汇总，方便大家根据自己的情况选择学习。分数划分和 codeforces 一致，范围为 800 - 3500 分。\n\n### 800 分合集\n\n- [B. Queue at the School](./problems/266b.md)\n\n### 900 分合集\n\n- [B. Construct the String](./problems/1335b.md)\n\n\u003c!-- ### 1000\n\n- [1521a](./1521a.py)\n\n### 1100\n\n- [1672c](./1672c.py) --\u003e\n\n### 1200 分合集\n\n- [D. Districts Connection](./problems/1433d.md)\n\n### 1300 分合集\n\n- [C. Coin Rows](./problems/1555c.md)\n\n### 1400 分合集\n\n- [C. Team](./problems/0401c.md)\n\n### 1700 分合集\n\n- [F. Spy-string](./problems/1360f.md)\n\n## License\n\n[CC BY-NC-ND 4.0](./LICENSE.txt)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fazl397985856%2Fcf","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fazl397985856%2Fcf","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fazl397985856%2Fcf/lists"}