Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-3069\":[\"Saruman\\u0027s Army\",10269,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2006\\\"\\u003eStanford Local 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1443\":[\"马的遍历\",95236,null],\"洛谷-P6207\":[\"Cows on Skates G\",4379,\"USACO06OCT\"],\"洛谷-P1588\":[\"Catch That Cow S\",9808,\"USACO07OPEN\"],\"CodeForces-1669G\":[\"Fall Down\",17825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1669\\\"\\u003eCodeforces Round 784 (Div. 4)\\u003c/a\\u003e\"],\"POJ-2386\":[\"Lake Counting\",23843,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2004+November\\\"\\u003eUSACO 2004 November\\u003c/a\\u003e\\u003c/div\\u003e\"],\"洛谷-P1029\":[\"最大公约数和最小公倍数问题\",74143,\"NOIP2001 普及组\"],\"洛谷-P2822\":[\"组合数问题\",27739,\"NOIP2016 提高组\"],\"POJ-3617\":[\"Best Cow Line\",11356,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2007+November+Silver\\\"\\u003eUSACO 2007 November Silver\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3253\":[\"Fence Repair\",21133,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+November+Gold\\\"\\u003eUSACO 2006 November Gold\\u003c/a\\u003e\\u003c/div\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"iiiiitsu","updateTime":1686811961000,"title":"Algorithms 2023 Workbook","dislikeCnt":0,"content":"# DFS\n[problem:POJ-2386] Lake Counting 水洼计数\n[problem:CodeForces-1669G] Fall Down ~~重力大模拟~~\n\n# BFS\n## 基础\n[problem:洛谷-P1588]\n[problem:洛谷-P1443]\n[problem:洛谷-P6207] 不会\n# Greedy\n[problem:POJ-3069] Saruman\u0027s Army 最少区间覆盖最大区域\n[problem:POJ-3253] Fence Repair 自由分割,二叉树\n[problem:POJ-3617] Best Cow Line 字符串字典序重排 Greedy\n# 数论\n[problem:洛谷-P1029] p q 的最大公约数 x 最小公倍数 y 乘起来是两个数的乘积 $xy\u003dpq$\n# 组合数学\n[problem:洛谷-P2822] 50分 TLE了 但是思路是对的:(1)新组合数 $n \\choose m$ 不用阶乘 用两个老组合数: ${n\\choose m}\u003d{n-1\\choose m-1} + {n-1\\choose m}$ (2)同时注意题目问的是整除k 那打的表直接膜k\n\n\n","threadId":137187,"likeCnt":0,"createTime":1676247571000,"isWorkbook":true,"viewCnt":322,"openness":2,"fav":false,"id":3459,"trustable":false}