Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"POJ-1200\":[\"Crazy Search\",5964,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+Europe+2002\\\"\\u003eSouthwestern Europe 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10003\":[\"Cutting Sticks\",17425,null],\"UVA-10245\":[\"The Closest Pair Problem\",5376,null],\"UVA-10088\":[\"Trees on My Island\",1545,null],\"UVA-10001\":[\"Garden of Eden\",1875,null],\"UVA-10089\":[\"Repackaging\",957,null],\"POJ-3349\":[\"Snowflake\\r\\nSnow\\r\\nSnowflakes\",7716,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCCC+2007\\\"\\u003eCCC 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2534\":[\"Falling cards\",45,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2002\\\"\\u003eNortheastern Europe 2002\\u003c/a\\u003e, Far-Eastern Subregion\\u003c/div\\u003e\"],\"POJ-2777\":[\"Count Color\",10470,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.03.26\\\"\\u003ePOJ Monthly--2006.03.26\\u003c/a\\u003e,dodo\\u003c/div\\u003e\"],\"POJ-1325\":[\"Machine Schedule\",6456,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2002\\\"\\u003eBeijing 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10084\":[\"Hotter Colder\",507,null],\"UVA-10006\":[\"Carmichael Numbers\",10923,null],\"UVA-10127\":[\"Ones\",13290,null],\"UVA-10128\":[\"Queue\",2799,null],\"UVA-10249\":[\"The Grand Dinner\",2909,null],\"UVA-10004\":[\"Bicoloring\",26160,null],\"UVA-10247\":[\"Complete Tree Labeling\",908,null],\"UVA-10092\":[\"The Problem with the Problem Setter\",2106,null],\"UVA-10090\":[\"Marbles\",3446,null],\"UVA-10233\":[\"Dermuba Triangle\",1308,null],\"UVA-10110\":[\"Light, more light\",24312,null],\"UVA-10077\":[\"The Stern-Brocot Number System\",6315,null],\"UVA-10198\":[\"Counting\",4708,null],\"UVA-10199\":[\"Tourist Guide\",4415,null],\"UVA-10196\":[\"Check The Check\",5127,null],\"UVA-10075\":[\"Airlines\",1030,null],\"UVA-10194\":[\"Football (aka Soccer)\",4354,null],\"POJ-2785\":[\"4 Values whose Sum is 0\",9688,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouthwestern+Europe+2005\\\"\\u003eSouthwestern Europe 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10195\":[\"The Knights Of The Round Table\",6575,null],\"HDU-1394\":[\"Minimum Inversion Number\",10921,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZOJ+Monthly%2C+January+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZOJ Monthly, January 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-707\":[\"Robbery\",560,null],\"UVA-706\":[\"LC-Display\",11475,null],\"UVA-10117\":[\"Nice Milk\",291,null],\"UVA-701\":[\"The Archeologists\\u0027 Dilemma\",3107,null],\"UVA-705\":[\"Slash Maze\",2603,null],\"UVA-704\":[\"Colour Hash\",1395,null],\"UVA-10082\":[\"WERTYU\",35194,null],\"POJ-1182\":[\"食物链\",25651,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNoi+01\\\"\\u003eNoi 01\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10189\":[\"Minesweeper\",28447,null],\"UVA-10069\":[\"Distinct Subsequences\",3732,null],\"UVA-10187\":[\"From Dusk Till Dawn\",1283,null],\"UVA-10067\":[\"Playing with Wheels\",5443,null],\"UVA-10188\":[\"Automated Judge Script\",4012,null],\"UVA-10065\":[\"Useless Tile Packers\",1998,null],\"UVA-10183\":[\"How Many Fibs?\",6242,null],\"UVA-10105\":[\"Polynomial Coefficients\",4205,null],\"HDU-1166\":[\"敌兵布阵\",38911,\"\"],\"UVA-10104\":[\"Euclid Problem\",10890,null],\"UVA-116\":[\"Unidirectional TSP\",12049,null],\"UVA-10191\":[\"Longest Nap\",4767,null],\"HDU-1698\":[\"Just a Hook\",18461,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Sunline+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10177\":[\"(2/3/4)-D Sqr/Rects/Cubes/Boxes?\",2342,null],\"UVA-10054\":[\"The Necklace\",5511,null],\"UVA-10051\":[\"Tower of Cubes\",2496,null],\"POJ-1679\":[\"The Unique MST\",10632,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.06.27+srbga%40POJ\\\"\\u003ePOJ Monthly--2004.06.27 srbga@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10215\":[\"The Largest/Smallest Box ...\",1261,null],\"UVA-10213\":[\"How Many Pieces of Land ?\",3095,null],\"UVA-10181\":[\"15-Puzzle Problem\",2092,null],\"UVA-120\":[\"Stacks of Flapjacks\",13424,null],\"UVA-10182\":[\"Bee Maja\",3400,null],\"UVA-10180\":[\"Rope Crisis in Ropeland!\",908,null],\"UVA-10167\":[\"Birthday Cake\",3622,null],\"UVA-10201\":[\"Adventures in Moving - Part IV\",1440,null],\"UVA-10047\":[\"The Monocycle\",3111,null],\"UVA-10168\":[\"Summation of Four Primes\",8035,null],\"UVA-10044\":[\"Erdos Numbers\",3342,null],\"UVA-10042\":[\"Smith Numbers\",5330,null],\"UVA-10043\":[\"Chainsaw Massacre\",531,null],\"UVA-10161\":[\"Ant on a Chessboard\",9243,null],\"UVA-10041\":[\"Vito\\u0027s Family\",23019,null],\"UVA-10209\":[\"Is This Integration ?\",5933,null],\"UVA-10205\":[\"Stack \\u0027em Up\",4416,null],\"UVA-10202\":[\"Pairsumonious Numbers\",1333,null],\"UVA-10049\":[\"Self-describing Sequence\",3081,null],\"POJ-2060\":[\"Taxi Cab Scheme\",2440,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2004\\\"\\u003eNorthwestern Europe 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10050\":[\"Hartals\",18676,null],\"UVA-850\":[\"Crypt Kicker II\",3003,null],\"HDU-1754\":[\"I Hate It\",29367,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2007%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A86%A3%A9_linle%D7%A8%B3%A1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(6)_linle专场 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10035\":[\"Primary Arithmetic\",30378,null],\"UVA-10310\":[\"Dog and Gopher\",4521,null],\"HDU-4109\":[\"Instrction Arrangement\",1260,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Alibaba-Cup+Campus+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Alibaba-Cup Campus Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10157\":[\"Expressions\",1072,null],\"UVA-10278\":[\"Fire Station\",2345,null],\"UVA-10033\":[\"Interpreter\",5278,null],\"UVA-10154\":[\"Weights and Measures\",3242,null],\"UVA-10276\":[\"Hanoi Tower Troubles Again!\",5526,null],\"UVA-10034\":[\"Freckles\",10942,null],\"UVA-10152\":[\"ShellSort\",5323,null],\"UVA-10032\":[\"Tug of War\",2390,null],\"UVA-10271\":[\"Chopsticks\",3007,null],\"UVA-10150\":[\"Doublets\",2643,null],\"UVA-10039\":[\"Railroads\",1057,null],\"UVA-10315\":[\"Poker Hands\",3861,null],\"UVA-10158\":[\"War\",3520,null],\"UVA-10037\":[\"Bridge\",4362,null],\"UVA-10038\":[\"Jolly Jumpers\",41140,null],\"UVA-10159\":[\"Star\",256,null],\"UVA-10160\":[\"Servicing Stations\",1413,null],\"UVA-861\":[\"Little Bishops\",3450,null],\"POJ-2195\":[\"Going Home\",8703,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPacific+Northwest+2004\\\"\\u003ePacific Northwest 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-100\":[\"The 3n + 1 problem\",113495,null],\"UVA-10267\":[\"Graphical Editor\",4750,null],\"UVA-10142\":[\"Australian Voting\",4724,null],\"UVA-10261\":[\"Ferry Loading\",2851,null],\"UVA-10149\":[\"Yahtzee\",1108,null],\"UVA-10029\":[\"Edit Step Ladders\",1836,null],\"UVA-10026\":[\"Shoemaker\\u0027s Problem\",8973,null],\"UVA-10270\":[\"Bigger Square Please...\",425,null],\"UVA-10135\":[\"Herding Frosh\",191,null],\"UVA-10132\":[\"File Fragmentation\",3330,null],\"UVA-10099\":[\"The Tourist Guide\",7558,null],\"UVA-10012\":[\"How Big Is It?\",1983,null],\"UVA-10254\":[\"The Priest Mathematician\",1494,null],\"UVA-10010\":[\"Where\\u0027s Waldorf?\",10276,null],\"UVA-10131\":[\"Is Bigger Smarter?\",9703,null],\"UVA-10252\":[\"Common Permutation\",13049,null],\"UVA-849\":[\"Radar Tracking\",34,null],\"UVA-10138\":[\"CDVII\",1372,null],\"UVA-10018\":[\"Reverse and Add\",27304,null],\"UVA-10139\":[\"Factovisors\",6232,null],\"UVA-10136\":[\"Chocolate Chip Cookies\",647,null],\"POJ-1639\":[\"Picnic Planning\",2375,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dEast+Central+North+America+2000\\\"\\u003eEast Central North America 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10258\":[\"Contest Scoreboard\",7544,null],\"UVA-10137\":[\"The Trip\",11667,null],\"UVA-843\":[\"Crypt Kicker\",2886,null],\"UVA-848\":[\"Fmt\",724,null],\"UVA-847\":[\"A Multiplication Game\",7548,null],\"UVA-846\":[\"Steps\",7504,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"Trote_w","updateTime":1490022731000,"title":"《挑战编程》(2009) 习题集","dislikeCnt":0,"content":"第一章 入门:\nProblem 1-1 [problem:UVA-100] Difficulty:1\nProblem 1-2 [problem:UVA-10189] Difficulty:1\nProblem 1-3 [problem:UVA-10137] Difficulty:1\nProblem 1-4 [problem:UVA-706] Difficulty:1\nProblem 1-5 [problem:UVA-10267] Difficulty:1\nProblem 1-6 [problem:UVA-10033] Difficulty:2\nProblem 1-7 [problem:UVA-10196] Difficulty:1\nProblem 1-8 [problem:UVA-10142] Difficulty:1\n\n第二章 数据结构:\nProblem 2-1 Difficulty:1 [problem:UVA-10038] \nProblem 2-2 Difficulty:2 [problem:UVA-10315] \nProblem 2-3 Difficulty:2 [problem:UVA-10050] \nProblem 2-4 Difficulty:2 [problem:UVA-843] \nProblem 2-5 Difficulty:1 [problem:UVA-10205] \nProblem 2-6 Difficulty:2 [problem:UVA-10044] \nProblem 2-7 Difficulty:1 [problem:UVA-10258] \nProblem 2-8 Difficulty:3 [problem:UVA-10149] \n\n第三章 字符串:\nProblem 3-1 难度:1 [problem:UVA-10082] \nProblem 3-2 难度:2 [problem:UVA-10010] \nProblem 3-3 难度:1 [problem:UVA-10252] \nProblem 3-4 难度:2 [problem:UVA-850] \nProblem 3-5 难度:1 [problem:UVA-10188] \nProblem 3-6 难度:2 [problem:UVA-10132] \nProblem 3-7 难度:3 [problem:UVA-10150] \nProblem 3-8 难度:2 [problem:UVA-848] \n\n第四章 排序:\nProblem 4-1 难度:1 [problem:UVA-10041] \nProblem 4-2 难度:2 [problem:UVA-120] \nProblem 4-3 难度:3 [problem:UVA-10037] \nProblem 4-4 难度:1 [problem:UVA-10191] \nProblem 4-5 难度:2 [problem:UVA-10026] \nProblem 4-6 难度:2 [problem:UVA-10138] \nProblem 4-7 难度:2 [problem:UVA-10152] \nProblem 4-8 难度:1 [problem:UVA-10194] \n\n第五章 算数与代数:\nProblem 5-1 难度:1 [problem:UVA-10035] \nProblem 5-2 难度:1 [problem:UVA-10018] \nProblem 5-3 难度:1 [problem:UVA-701] \nProblem 5-4 难度:2 [problem:UVA-10127] \nProblem 5-5 难度:3 [problem:UVA-847] \nProblem 5-6 难度:1 [problem:UVA-10105] \nProblem 5-7 难度:1 [problem:UVA-10077] \nProblem 5-8 难度:4 [problem:UVA-10202] \n\n第六章 组合数学:\nProblem 6-1 难度:1 [problem:UVA-10183] \nProblem 6-2 难度:2 [problem:UVA-10213] \nProblem 6-3 难度:2 [problem:UVA-10198] \nProblem 6-4 难度:2 [problem:UVA-10157] \nProblem 6-5 难度:2 [problem:UVA-10247] \nProblem 6-6 难度:2 [problem:UVA-10254] \nProblem 6-7 难度:2 [problem:UVA-10049] \nProblem 6-8 难度:2 [problem:UVA-846] \n\n第七章 数论:\nProblem 7-1 难度:1 [problem:UVA-10110] \nProblem 7-2 难度:2 [problem:UVA-10006] \nProblem 7-3 难度:1 [problem:UVA-10104] \nProblem 7-4 难度:2 [problem:UVA-10139] \nProblem 7-5 难度:2 [problem:UVA-10168] \nProblem 7-6 难度:1 [problem:UVA-10042] \nProblem 7-7 难度:1 [problem:UVA-10090] \nProblem 7-8 难度:2 [problem:UVA-10089] \n\n第八章 回溯法:\nProblem 8-1 难度:2 [problem:UVA-861] \nProblem 8-2 难度:3 [problem:UVA-10181] \nProblem 8-3 难度:2 [problem:UVA-10128] \nProblem 8-4 难度:3 [problem:UVA-10160] \nProblem 8-5 难度:2 [problem:UVA-10032] \nProblem 8-6 难度:2 [problem:UVA-10001] \nProblem 8-7 难度:3 [problem:UVA-704] \nProblem 8-8 难度:3 [problem:UVA-10270] \n\n第九章 图遍历:\nProblem 9-1 难度:1 [problem:UVA-10004] \nProblem 9-2 难度:2 [problem:UVA-10067] \nProblem 9-3 难度:3 [problem:UVA-10099] \nProblem 9-4 难度:2 [problem:UVA-705] \nProblem 9-5 难度:3 [problem:UVA-10029] \nProblem 9-6 难度:3 [problem:UVA-10051] \nProblem 9-7 难度:3 [problem:UVA-10187] \nProblem 9-8 难度:3 [problem:UVA-10276] \n\n第十章 图算法:\nProblem 10-1 难度:2 [problem:UVA-10034] \nProblem 10-2 难度:3 [problem:UVA-10054] \nProblem 10-3 难度:2 [problem:UVA-10278] \nProblem 10-4 难度:3 [problem:UVA-10039] \nProblem 10-5 难度:3 [problem:UVA-10158] \nProblem 10-6 难度:3 [problem:UVA-10199] \nProblem 10-7 难度:4 [problem:UVA-10249] \nProblem 10-8 难度:3 [problem:UVA-10092] \n\n第十一章 动态规划:\nProblem 11-1 难度:2 [problem:UVA-10131] \nProblem 11-2 难度:3 [problem:UVA-10069] \nProblem 11-3 难度:3 [problem:UVA-10154] \nProblem 11-4 难度:3 [problem:UVA-116] \nProblem 11-5 难度:2 [problem:UVA-10003] \nProblem 11-6 难度:3 [problem:UVA-10261] \nProblem 11-7 难度:3 [problem:UVA-10271] \nProblem 11-8 难度:3 [problem:UVA-10201] \n\n第十二章 网络:\nProblem 12-1 难度:1 [problem:UVA-10161] \nProblem 12-2 难度:3 [problem:UVA-10047] \nProblem 12-3 难度:2 [problem:UVA-10159] \nProblem 12-4 难度:2 [problem:UVA-10182] \nProblem 12-5 难度:3 [problem:UVA-707] \nProblem 12-6 难度:2 [problem:UVA-10177] \nProblem 12-7 难度:2 [problem:UVA-10233] \nProblem 12-8 难度:3 [problem:UVA-10075] \n\n第十三章 几何:\nProblem 13-1 难度:1 [problem:UVA-10310] \nProblem 13-2 难度:2 [problem:UVA-10180] \nProblem 13-3 难度:2 [problem:UVA-10195] \nProblem 13-4 难度:3 [problem:UVA-10136] \nProblem 13-5 难度:2 [problem:UVA-10167] \nProblem 13-6 难度:2 [problem:UVA-10215] \nProblem 13-7 难度:3 [problem:UVA-10209] \nProblem 13-8 难度:3 [problem:UVA-10012] \n\n第十四章 计算几何:\nProblem 14-1 难度:2 [problem:UVA-10135] \nProblem 14-2 难度:2 [problem:UVA-10245] \nProblem 14-3 难度:3 [problem:UVA-10043] \nProblem 14-4 难度:3 [problem:UVA-10084] \nProblem 14-5 难度:3 [problem:UVA-10065] \nProblem 14-6 难度:2 [problem:UVA-849] \nProblem 14-7 难度:3 [problem:UVA-10088] \nProblem 14-8 难度:4 [problem:UVA-10117] \n\n\n《算法竞赛宝典》题单(部分)\n次小生成树:[problem:POJ-1679]\n度限制生成树:[problem:POJ-1639]\n关键路径(拓扑排序):[problem:HDU-4109]\n\n哈希表:[problem:POJ-3349][problem:POJ-2785][problem:POJ-1200]\n并查集:[problem:POJ-2534][problem:POJ-1182]\n线段树:[problem:HDU-1166][problem:HDU-1754][problem:HDU-1698][problem:HDU-1394][problem:POJ-2777]\n二分图:[problem:POJ-1325][problem:POJ-2060][problem:POJ-2195]\n","likeCnt":2,"createTime":1486299570000,"isWorkbook":true,"viewCnt":2292,"openness":1,"fav":false,"id":49,"trustable":false}