Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"UVA-10002\":[\"Center of Masses\",1795,null],\"UVA-10000\":[\"Longest Paths\",5786,null],\"UVA-10803\":[\"Thunder Mountain\",1999,null],\"UVA-10008\":[\"What\\u0027s Cryptanalysis?\",17677,null],\"UVA-10369\":[\"Arctic Network\",6202,null],\"UVA-10766\":[\"Organising the Organisation\",604,null],\"UVA-10004\":[\"Bicoloring\",26160,null],\"UVA-776\":[\"Monkeys in a Regular Forest\",1369,null],\"UVA-775\":[\"Hamiltonian Cycle\",620,null],\"UVA-539\":[\"The Settlers of Catan\",3856,null],\"UVA-532\":[\"Dungeon Master\",8106,null],\"UVA-1262\":[\"Password\",2181,null],\"SPOJ-VOCV\":[\"Con-Junctions\",1068,\"\"],\"UVA-10199\":[\"Tourist Guide\",4415,null],\"UVA-10078\":[\"The Art Gallery\",2775,null],\"UVA-270\":[\"Lining Up\",1920,null],\"UVA-302\":[\"John\\u0027s trip\",1346,null],\"UVA-10917\":[\"Walk Through the Forest\",2018,null],\"SPOJ-PRIMIT\":[\"Primitivus recurencis\",244,\"6th Polish Olympiad in Informatics, stage 3\"],\"UVA-10915\":[\"War on Weather\",354,null],\"UVA-11292\":[\"Dragon of Loowater\",14101,null],\"SPOJ-CHOCOLA\":[\"Chocolate\",5837,\"10th Polish Olympiad in Informatics, stage 1\"],\"UVA-10080\":[\"Gopher II\",3085,null],\"SPOJ-POTHOLE\":[\"Potholers\",2332,\"6th Polish Olympiad in Informatics, stage 2\"],\"UVA-10068\":[\"The Treasure Hunt\",158,null],\"UVA-10860\":[\"Many a Little makes a Mickle\",377,null],\"UVA-10102\":[\"The path in the colored field\",3819,null],\"UVA-10982\":[\"Troublemakers\",545,null],\"UVA-10583\":[\"Ubiquitous Religions\",7732,null],\"UVA-10462\":[\"Is There A Second Way Left?\",2714,null],\"UVA-10065\":[\"Useless Tile Packers\",1998,null],\"UVA-11396\":[\"Claw Decomposition\",3526,null],\"UVA-10183\":[\"How Many Fibs?\",6242,null],\"UVA-10748\":[\"Knights Roaming\",180,null],\"UVA-10506\":[\"The Ouroboros problem\",465,null],\"UVA-10987\":[\"Antifloyd\",417,null],\"UVA-10347\":[\"Medians\",5341,null],\"UVA-10502\":[\"Counting Rectangles\",2066,null],\"UVA-10983\":[\"Buy one, get the rest free\",624,null],\"UVA-117\":[\"The Postal Worker Rings Once\",3850,null],\"UVA-515\":[\"King\",830,null],\"UVA-196\":[\"Spreadsheet\",2052,null],\"UVA-871\":[\"Counting Cells in a Blob\",4048,null],\"UVA-10451\":[\"Ancient Village Sports\",2279,null],\"UVA-10615\":[\"Rooks\",418,null],\"UVA-10979\":[\"How Many Triangles?\",139,null],\"UVA-10735\":[\"Euler Circuit\",829,null],\"UVA-10977\":[\"Enchanted Forest\",1297,null],\"UVA-10973\":[\"Triangle Counting\",538,null],\"UVA-523\":[\"Minimum Transport Cost\",800,null],\"UVA-361\":[\"Cops and Robbers\",565,null],\"UVA-11096\":[\"Nails\",869,null],\"UVALive-2721\":[\"Building Bridges\",365,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-10724\":[\"Road Construction\",619,null],\"UVA-10600\":[\"ACM Contest and Blackout\",5698,null],\"UVALive-3531\":[\"Word Rings\",149,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-10843\":[\"Anne\\u0027s game\",1563,null],\"UVALive-3532\":[\"Nuclear Plants\",52,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-10687\":[\"Monitoring the Amazon\",979,null],\"UVA-459\":[\"Graph Connectivity\",10358,null],\"UVA-612\":[\"DNA Sorting\",7093,null],\"UVA-216\":[\"Getting in Line\",5270,null],\"UVA-10608\":[\"Friends\",10686,null],\"UVA-218\":[\"Moth Eradication\",1781,null],\"UVA-177\":[\"Paper Folding\",1023,null],\"UVA-10310\":[\"Dog and Gopher\",4521,null],\"UVA-10278\":[\"Fire Station\",2345,null],\"UVA-10432\":[\"Polygon Inside A Circle\",7596,null],\"UVA-10792\":[\"The Laurel-Hardy Story\",538,null],\"UVA-10034\":[\"Freckles\",10942,null],\"UVA-10793\":[\"The Orc Attack\",934,null],\"UVA-10672\":[\"Marbles on a tree\",1015,null],\"UVALive-3527\":[\"Find the Clones\",285,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"TopCoder-7412\":[\"DrivingAround\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7412\\\"\\u003eSingle Round Match 342 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"UVALive-3528\":[\"The Warehouse\",51,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"TopCoder-7411\":[\"TagalogDictionary\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7411\\\"\\u003eSingle Round Match 342 Round 1 - Division I, Level One\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10666\\u0026amp;pm\\u003d7411\\\"\\u003eSingle Round Match 342 Round 1 - Division II, Level Two\\u003c/a\\u003e\"],\"UVALive-3523\":[\"Knights of the Round Table\",728,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVALive-3524\":[\"The Cow Doctor\",137,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-10679\":[\"I Love Strings!!\",4985,null],\"UVALive-3525\":[\"Wild West\",117,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-10798\":[\"Be wary of Roses\",188,null],\"UVA-10557\":[\"XYZZY\",2864,null],\"UVA-10158\":[\"War\",3520,null],\"UVA-105\":[\"The Skyline Problem\",11305,null],\"UVA-589\":[\"Pushing Boxes\",832,null],\"UVA-104\":[\"Arbitrage\",5136,null],\"UVA-627\":[\"The Net\",2188,null],\"UVA-109\":[\"SCUD Busters\",2726,null],\"UVA-10959\":[\"The Party, Part I\",3276,null],\"UVA-103\":[\"Stacking Boxes\",8036,null],\"UVA-102\":[\"Ecological Bin Packing\",28981,null],\"UVA-12049\":[\"Just Prune The List\",3154,null],\"TopCoder-7503\":[\"CssPropertyConverter\",1,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7503\\\"\\u003eSingle Round Match 340 Round 1 - Division II, Level One\\u003c/a\\u003e\"],\"UVA-10020\":[\"Minimal coverage\",4595,null],\"UVA-10021\":[\"Cube in the labirint\",324,null],\"UVA-10305\":[\"Ordering Tasks\",23172,null],\"UVA-10823\":[\"Of Circles and Squares\",423,null],\"UVA-10944\":[\"Nuts for nuts..\",1002,null],\"UVA-10941\":[\"Words adjustment\",127,null],\"UVA-10301\":[\"Rings and Glue\",1744,null],\"UVA-558\":[\"Wormholes\",10239,null],\"UVA-439\":[\"Knight Moves\",16480,null],\"UVA-714\":[\"Copying Books\",4928,null],\"UVA-10309\":[\"Turn the Lights Off\",1384,null],\"UVA-438\":[\"The Circumference of the Circle\",7847,null],\"UVA-273\":[\"Jack Straws\",988,null],\"UVA-272\":[\"TEX Quotes\",59002,null],\"UVA-673\":[\"Parentheses Balance\",30453,null],\"UVA-793\":[\"Network Connections\",8389,null],\"UVA-10772\":[\"Rose windows\",138,null],\"UVA-10099\":[\"The Tourist Guide\",7558,null],\"UVA-10011\":[\"Where Can You Hide?\",236,null],\"TopCoder-7512\":[\"LandAndSea\",2,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10665\\u0026amp;pm\\u003d7512\\\"\\u003eSingle Round Match 341 Round 1 - Division I, Level Two\\u003c/a\\u003e\\n\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10665\\u0026amp;pm\\u003d7512\\\"\\u003eSingle Round Match 341 Round 1 - Division II, Level Three\\u003c/a\\u003e\"],\"UVA-10010\":[\"Where\\u0027s Waldorf?\",10276,null],\"UVA-10131\":[\"Is Bigger Smarter?\",9703,null],\"UVA-10252\":[\"Common Permutation\",13049,null],\"UVA-291\":[\"The House Of Santa Claus\",6449,null],\"UVA-11902\":[\"Dominator\",2952,null],\"UVA-11506\":[\"Angry Programmer\",1796,null],\"UVA-10418\":[\"Hyper Toy Soldiers\",150,null],\"UVALive-2730\":[\"Toll\",594,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-10896\":[\"Known Plaintext Attack\",960,null],\"UVA-327\":[\"Evaluating Simple C Expressions\",1479,null],\"UVA-325\":[\"Identifying Legal Pascal Real Constants\",1764,null],\"UVA-688\":[\"Mobile Phone Coverage\",819,null],\"UVA-10818\":[\"Dora Trip\",192,null],\"UVA-10815\":[\"Andy\\u0027s First Dictionary\",24539,null],\"UVA-208\":[\"Firetruck\",3614,null],\"UVA-10816\":[\"Travel in Desert\",1292,null],\"UVA-10937\":[\"Blackbeard the Pirate\",669,null],\"TopCoder-7507\":[\"VegetableGarden\",6,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10664\\u0026amp;pm\\u003d7507\\\"\\u003eSingle Round Match 340 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"UVA-200\":[\"Rare Order\",7293,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1553676672000,"title":"π-Algorithmist分类题目(2)","dislikeCnt":0,"content":"\n[海岛Blog](http://blog.csdn.net/tigerisland45)\n\n[挑战ACM编程](https://cn.vjudge.net/group/challenge)是自由参与组。提供挑战题、水题、白书、紫书和蓝书等等......\n\nπ-Algorithmist分类题目(2)\n\nSet Theory\n1. [problem:UVA-1262] Password\n2. [problem:UVALive-3524] The Cow Doctor\n3. [problem:UVA-10158] War\n4. [problem:UVA-10583] Ubiquitous Religions\n5. [problem:UVA-10608] Friends\n6. [problem:UVA-10815] Andy\u0027s First Dictionary\n7. [problem:UVA-12049] Just Prune The List\n8. [problem:UVA-793] Network Connections\n\nHashing\n1. [problem:UVALive-3527] Find the Clones\n2. [problem:UVA-12049] Just Prune The List\n\nComputational Geometry\n1. [problem:UVALive-3525] Wild West\n2. [problem:UVALive-3532] Nuclear Plants\n3. [problem:UVA-10002] Center of Masses\n4. [problem:UVA-10020] Minimal coverage\n5. [problem:UVA-10034] Freckles\n6. [problem:UVA-10065] Useless Tile Packers\n7. [problem:UVA-10078] The Art Gallery\n8. [problem:UVA-105] The Skyline Problem\n9. [problem:UVA-109] SCUD Busters\n10. [problem:UVA-10979] How Many Triangles?\n11. [problem:UVA-11096] Nails\n12. [problem:UVA-218] Moth Eradication\n13. [problem:UVA-270] Lining Up\n14. [problem:UVA-361] Cops and Robbers\n15. [problem:UVA-688] Mobile Phone Coverage\n16. [problem:UVA-10199] Tourist Guide\n\nGeometry\n1. [problem:UVA-10011] Where Can You Hide?\n2. [problem:UVA-10301] Rings and Glue\n3. [problem:UVA-10310] Dog and Gopher\n4. [problem:UVA-10347] Medians\n5. [problem:UVA-10432] Polygon Inside A Circle\n6. [problem:UVA-10451] Ancient Village Sports\n7. [problem:UVA-10772] Rose windows\n8. [problem:UVA-10792] The Laurel-Hardy Story\n9. [problem:UVA-10823] Of Circles and Squares\n10. [problem:UVA-10915] War on Weather\n11. [problem:UVA-438] The Circumference of the Circle\n\nSweep Line\n1. [problem:UVALive-3525] Wild West\n2. [problem:UVA-105] The Skyline Problem\n3. [problem:UVA-10979] How Many Triangles?\n4. [problem:UVA-270] Lining Up\n5. [problem:UVA-688] Mobile Phone Coverage\n6. [problem:UVA-10034] Freckles\n\nGraph Theory\n1. [problem:UVALive-2721] Building Bridges\n2. [problem:UVALive-2730] Toll\n3. [problem:UVALive-3523] Knights of the Round Table\n4. [problem:UVALive-3531] Word Rings\n5. [problem:SPOJ-CHOCOLA] Chocolate\n6. [problem:SPOJ-POTHOLE] Potholers\n7. [problem:SPOJ-PRIMIT] Primitivus recurencis\n8. [problem:SPOJ-VOCV] Con-Junctions\n9. [problem:TopCoder-7412] DrivingAround\n10. [problem:UVA-10000] Longest Paths\n11. [problem:UVA-10004] Bicoloring\n12. [problem:UVA-10021] Cube in the labirint\n13. [problem:UVA-10034] Freckles\n14. [problem:UVA-10068] The Treasure Hunt\n15. [problem:UVA-10080] Gopher II\n16. [problem:UVA-10099] The Tourist Guide\n17. [problem:UVA-10131] Is Bigger Smarter?\n18. [problem:UVA-10199] Tourist Guide\n19. [problem:UVA-10278] Fire Station\n20. [problem:UVA-103] Stacking Boxes\n21. [problem:UVA-10305] Ordering Tasks\n22. [problem:UVA-10369] Arctic Network\n23. [problem:UVA-104] Arbitrage\n24. [problem:UVA-10418] Hyper Toy Soldiers\n25. [problem:UVA-10462] Is There A Second Way Left?\n26. [problem:UVA-10506] The Ouroboros problem\n27. [problem:UVA-10557] XYZZY\n28. [problem:UVA-10583] Ubiquitous Religions\n29. [problem:UVA-10600] ACM Contest and Blackout\n30. [problem:UVA-10615] Rooks\n31. [problem:UVA-10672] Marbles on a tree\n32. [problem:UVA-10687] Monitoring the Amazon\n33. [problem:UVA-10724] Road Construction\n34. [problem:UVA-10735] Euler Circuit\n35. [problem:UVA-10748] Knights Roaming\n36. [problem:UVA-10766] Organising the Organisation\n37. [problem:UVA-10793] The Orc Attack\n38. [problem:UVA-10803] Thunder Mountain\n39. [problem:UVA-10816] Travel in Desert\n40. [problem:UVA-10818] Dora Trip\n41. [problem:UVA-10843] Anne\u0027s game\n42. [problem:UVA-10860] Many a Little makes a Mickle\n43. [problem:UVA-10917] Walk Through the Forest\n44. [problem:UVA-10937] Blackbeard the Pirate\n45. [problem:UVA-10941] Words adjustment\n46. [problem:UVA-10944] Nuts for nuts..\n47. [problem:UVA-10959] The Party, Part I\n48. [problem:UVA-10973] Triangle Counting\n49. [problem:UVA-10977] Enchanted Forest\n50. [problem:UVA-10982] Troublemakers\n51. [problem:UVA-10983] Buy one, get the rest free\n52. [problem:UVA-10987] Antifloyd\n53. [problem:UVA-11396] Claw Decomposition\n54. [problem:UVA-117] The Postal Worker Rings Once\n55. [problem:UVA-11902] Dominator\n56. [problem:UVA-196] Spreadsheet\n57. [problem:UVA-200] Rare Order\n58. [problem:UVA-216] Getting in Line\n59. [problem:UVA-273] Jack Straws\n60. [problem:UVA-291] The House Of Santa Claus\n61. [problem:UVA-302] John\u0027s trip\n62. [problem:UVA-439] Knight Moves\n63. [problem:UVA-459] Graph Connectivity\n64. [problem:UVA-515] King\n65. [problem:UVA-523] Minimum Transport Cost\n66. [problem:UVA-532] Dungeon Master\n67. [problem:UVA-539] The Settlers of Catan\n68. [problem:UVA-558] Wormholes\n69. [problem:UVA-589] Pushing Boxes\n70. [problem:UVA-627] The Net\n71. [problem:UVA-775] Hamiltonian Cycle\n72. [problem:UVA-776] Monkeys in a Regular Forest\n73. [problem:UVA-793] Network Connections\n74. [problem:UVA-871] Counting Cells in a Blob\n75. [problem:UVA-10615] Rooks\n76. [problem:UVA-10735] Euler Circuit\n77. [problem:UVA-11396] Claw Decomposition\n78. [problem:UVA-11506] Angry Programmer\n79. [problem:UVA-10983] Buy one, get the rest free\n\nGraph Connectivity\n1. [problem:UVALive-2721] Building Bridges\n2. [problem:UVALive-3523] Knights of the Round Table\n3. [problem:UVA-10583] Ubiquitous Religions\n4. [problem:UVA-10687] Monitoring the Amazon\n5. [problem:UVA-627] The Net\n6. [problem:UVA-793] Network Connections\n\nGraph DFS with longest path print (DAG)\n1. [problem:UVA-103] Stacking Boxes\n\nHamilton Graph\n1. [problem:UVA-775] Hamiltonian Cycle\n\nBipartite Graph\n1. [problem:UVA-11396] Claw Decomposition\n\nTraveling Salesperson Problem\n1. [problem:UVA-10818] Dora Trip\n2. [problem:UVA-10937] Blackbeard the Pirate\n3. [problem:UVA-10944] Nuts for nuts..\n4. [problem:UVA-216] Getting in Line\n\nEulerian Path\n1. [problem:UVA-177] Paper Folding\n\nConnected Components\n1. [problem:UVA-273] Jack Straws\n\nArticulation Point\n1. [problem:UVA-10199] Tourist Guide\n\nShortest Path\n1. [problem:UVALive-2730] Toll\n2. [problem:UVALive-3528] The Warehouse\n3. [problem:UVA-10102] The path in the colored field\n4. [problem:UVA-10557] XYZZY\n5. [problem:UVA-10724] Road Construction\n6. [problem:UVA-10793] The Orc Attack\n7. [problem:UVA-10803] Thunder Mountain\n8. [problem:UVA-10816] Travel in Desert\n9. [problem:UVA-10860] Many a Little makes a Mickle\n10. [problem:UVA-10959] The Party, Part I\n11. [problem:UVA-10987] Antifloyd\n12. [problem:UVA-117] The Postal Worker Rings Once\n13. [problem:UVA-439] Knight Moves\n14. [problem:UVA-523] Minimum Transport Cost\n15. [problem:UVA-532] Dungeon Master\n16. [problem:UVA-589] Pushing Boxes\n17. [problem:UVA-627] The Net\n\nGrids\n1. [problem:TopCoder-7512] LandAndSea\n2. [problem:TopCoder-7507] VegetableGarden\n\nExhaustive Search\n1. [problem:UVA-10000] Longest Paths\n2. [problem:UVA-102] Ecological Bin Packing\n3. [problem:UVA-10798] Be wary of Roses\n4. [problem:UVA-11902] Dominator\n5. [problem:UVA-208] Firetruck\n6. [problem:UVA-216] Getting in Line\n7. [problem:UVA-291] The House Of Santa Claus\n8. [problem:UVA-612] DNA Sorting\n\nBruteforce\n1. [problem:UVA-10502] Counting Rectangles\n2. [problem:UVA-10896] Known Plaintext Attack\n\nComplete Search\n1. [problem:UVA-10309] Turn the Lights Off\n\nBinary Search\n1. [problem:UVALive-3531] Word Rings\n2. [problem:UVA-10183] How Many Fibs?\n3. [problem:UVA-10983] Buy one, get the rest free\n4. [problem:UVA-11292] Dragon of Loowater\n5. [problem:UVA-714] Copying Books\n\nBreadth-First Search\n1. [problem:TopCoder-7507] VegetableGarden\n2. [problem:UVA-11902] Dominator\n\nString algorithms\n1. [problem:UVALive-3527] Find the Clones\n2. [problem:TopCoder-7503] CssPropertyConverter\n3. [problem:TopCoder-7411] TagalogDictionary\n4. [problem:UVA-10008] What\u0027s Cryptanalysis?\n5. [problem:UVA-10252] Common Permutation\n6. [problem:UVA-10679] I Love Strings!!\n7. [problem:UVA-272] TEX Quotes\n8. [problem:UVA-612] DNA Sorting\n\nStrings\n1. [problem:UVA-10010] Where\u0027s Waldorf?\n\nContext-Free Language\n1. [problem:UVA-673] Parentheses Balance\n\nParsing\n1. [problem:UVA-325] Identifying Legal Pascal Real Constants\n2. [problem:UVA-327] Evaluating Simple C Expressions","threadId":25978,"likeCnt":0,"createTime":1519552420000,"isWorkbook":true,"viewCnt":2810,"openness":1,"fav":false,"id":369,"trustable":false}