Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"Aizu-1301\":[\"Malfatti Circles\",268,\"ACM International Collegiate Programming Contest, Asia Regional 2009, Japan\"],\"Aizu-2511\":[\"Sinking islands\",329,\"ACM-ICPC Japan Alumni Group Practice Contest for Japan Domestic 2013\"],\"Aizu-0211\":[\"Jogging\",344,\"7th PC Koshien, Final\"],\"Aizu-GRL_5_A\":[\"Diameter of a Tree\",2414,null],\"Aizu-GRL_1_B\":[\"Single Source Shortest Path (Negative Edges)\",3393,null],\"Aizu-GRL_1_C\":[\"All Pairs Shortest Path\",5025,null],\"Aizu-CGL_7_D\":[\"Cross Points of a Circle and a Line\",1161,null],\"Aizu-CGL_7_E\":[\"Cross Points of Circles\",1166,null],\"Aizu-CGL_3_C\":[\"Polygon-Point Containment\",1634,null],\"Aizu-2224\":[\"Save your cats\",1874,\"ACM-ICPC Japan Alumni Group Summer Camp 2010 Day 4\"],\"Aizu-DPL_1_A\":[\"Coin Changing Problem\",7197,null],\"Aizu-ALDS1_5_C\":[\"Koch Curve\",7324,null],\"Aizu-DPL_1_B\":[\"0-1 Knapsack Problem\",11044,null],\"Aizu-ALDS1_5_B\":[\"Merge Sort\",12281,null],\"Aizu-0561\":[\"Books\",608,\"10th Japanese Olympiad in Informatics\"],\"Aizu-2104\":[\"Country Road\",1450,\"University of Tokyo Programming Contest 2008\"],\"Aizu-ALDS1_5_A\":[\"Exhaustive Search\",16535,null],\"Aizu-ALDS1_1_D\":[\"Maximum Profit\",20762,null],\"Aizu-0284\":[\"Happy End Problem\",62,\"11th PC Koshien, Preliminary Round\"],\"Aizu-DPL_1_E\":[\"Edit Distance (Levenshtein Distance)\",2547,null],\"Aizu-ALDS1_1_C\":[\"Prime Numbers\",17395,null],\"Aizu-ALDS1_1_B\":[\"Greatest Common Divisor\",18531,null],\"Aizu-1257\":[\"Sum of Consecutive prime Numbers\",621,\"ACM International Collegiate Programming Contest, Asia Regional 2005, Japan\"],\"Aizu-DPL_1_C\":[\"Knapsack Problem\",5342,null],\"Aizu-ALDS1_1_A\":[\"Insertion Sort\",29059,null],\"Aizu-DPL_1_D\":[\"Longest Increasing Subsequence\",4362,null],\"Aizu-ALDS1_12_A\":[\"Minimum Spanning Tree\",8237,null],\"Aizu-ALDS1_12_C\":[\"Single Source Shortest Path II\",4591,null],\"Aizu-ALDS1_12_B\":[\"Single Source Shortest Path I\",7393,null],\"Aizu-ALDS1_9_C\":[\"Priority Queue\",9814,null],\"Aizu-ALDS1_9_B\":[\"Maximum Heap\",8229,null],\"Aizu-0282\":[\"Programming Contest\",518,\"11th PC Koshien, Preliminary Round\"],\"Aizu-ALDS1_9_A\":[\"Complete Binary Tree\",8102,null],\"Aizu-DSL_1_A\":[\"Disjoint Set: Union Find Tree\",7106,null],\"Aizu-ALDS1_5_D\":[\"The Number of Inversions\",5310,null],\"Aizu-1167\":[\"Pollock\\u0027s conjecture\",2821,\"ACM International Collegiate Programming Contest, Japan Domestic 2010\"],\"Aizu-1166\":[\"Amazing Mazes\",2908,\"ACM International Collegiate Programming Contest, Japan Domestic 2010\"],\"Aizu-1047\":[\"Crop Circle\",96,\"University of Aizu Programming Contest 2009, PCK Warm Up\"],\"Aizu-GRL_2_A\":[\"Minimum Spanning Tree\",6062,null],\"Aizu-GRL_2_B\":[\"Minimum-Cost Arborescence\",507,null],\"Aizu-1162\":[\"Discrete Speed\",680,\"ACM International Collegiate Programming Contest, Japan Domestic 2009\"],\"Aizu-1281\":[\"The Morning after Halloween\",286,\"ACM International Collegiate Programming Contest, Asia Regional 2007, Japan\"],\"Aizu-GRL_6_A\":[\"Maximum Flow\",4439,null],\"Aizu-CGL_2_A\":[\"Parallel/Orthogonal\",2428,null],\"Aizu-CGL_2_B\":[\"Intersection\",2257,null],\"Aizu-0519\":[\"Worst Reporter\",575,\"6th Japanese Olympiad in Informatics\"],\"Aizu-1327\":[\"One-Dimensional Cellular Automaton\",573,\"ACM International Collegiate Programming Contest, Asia Regional 2012, Japan\"],\"Aizu-CGL_2_C\":[\"Cross Point\",1951,null],\"Aizu-CGL_2_D\":[\"Distance\",1723,null],\"Aizu-CGL_6_A\":[\"Segment Intersections: Manhattan Geometry\",791,null],\"Aizu-DSL_2_A\":[\"Range Minimum Query (RMQ)\",8336,null],\"Aizu-ALDS1_4_D\":[\"Allocation\",7355,null],\"Aizu-DPL_2_A\":[\"Traveling Salesman Problem\",4120,null],\"Aizu-ALDS1_4_C\":[\"Dictionary\",13925,null],\"Aizu-DSL_2_B\":[\"Range Sum Query (RSQ)\",6135,null],\"Aizu-ALDS1_4_B\":[\"Binary Search\",22626,null],\"Aizu-DSL_2_C\":[\"Range Search (kD Tree)\",1611,null],\"Aizu-ALDS1_4_A\":[\"Linear Search\",16113,null],\"Aizu-ALDS1_13_C\":[\"15 Puzzle\",2976,null],\"Aizu-DPL_2_B\":[\"Chinese Postman Problem\",335,null],\"Aizu-2003\":[\"Railroad Conflict\",453,\"ACM-ICPC Japan Alumni Group Practice Contest for Japan Domestic 2006\"],\"Aizu-1157\":[\"Roll-A-Big-Ball\",536,\"ACM International Collegiate Programming Contest, Japan Domestic 2008\"],\"Aizu-NTL_1_D\":[\"Euler\\u0027s Phi Function\",1740,null],\"Aizu-NTL_1_C\":[\"Least Common Multiple\",2327,null],\"Aizu-NTL_1_B\":[\"Power\",4892,null],\"Aizu-ALDS1_13_B\":[\"8 Puzzle\",3396,null],\"Aizu-NTL_1_A\":[\"Prime Factorize\",4976,null],\"Aizu-ALDS1_13_A\":[\"8 Queens Problem\",5910,null],\"Aizu-ALDS1_8_C\":[\"Binary Search Tree III\",6310,null],\"Aizu-ALDS1_8_B\":[\"Binary Search Tree II\",7951,null],\"Aizu-ALDS1_8_A\":[\"Binary Search Tree I\",9130,null],\"Aizu-NTL_1_E\":[\"Extended Euclid Algorithm\",1395,null],\"Aizu-2090\":[\"Repeated Subsequences\",115,\"ACM-ICPC Japan Alumni Group Summer Camp 2007 Day 2\"],\"Aizu-0508\":[\"String With Rings\",321,\"5th Japanese Olympiad in Informatics\"],\"Aizu-0507\":[\"Square\",736,\"5th Japanese Olympiad in Informatics\"],\"Aizu-1189\":[\"Prime Caves\",646,\"ACM International Collegiate Programming Contest, Japan Domestic 2013\"],\"Aizu-1187\":[\"ICPC Ranking\",1200,\"ACM International Collegiate Programming Contest, Japan Domestic 2013\"],\"Aizu-2431\":[\"House Moving\",409,\"ACM-ICPC Japan Alumni Group Summer Camp 2012 Day 2\"],\"Aizu-2157\":[\"Dial Lock\",417,\"ACM-ICPC Japan Alumni Group Summer Camp 2009 Day 2\"],\"Aizu-GRL_3_B\":[\"Bridges\",1420,null],\"Aizu-2272\":[\"Cicada\",544,\"Kyoto University Programming Contest 2011\"],\"Aizu-GRL_3_C\":[\"Strongly Connected Components\",1994,null],\"Aizu-GRL_3_A\":[\"Articulation Points\",2197,null],\"Aizu-1183\":[\"Chain-Confined Path\",467,\"ACM International Collegiate Programming Contest, Japan Domestic 2012\"],\"Aizu-1182\":[\"Railway Connection\",600,\"ACM International Collegiate Programming Contest, Japan Domestic 2012\"],\"Aizu-GRL_7_A\":[\"Bipartite Matching\",1541,null],\"Aizu-CGL_1_A\":[\"Projection\",3332,null],\"Aizu-CGL_1_B\":[\"Reflection\",2572,null],\"Aizu-CGL_1_C\":[\"Counter-Clockwise\",2369,null],\"Aizu-0539\":[\"Pizza\",825,\"8th Japanese Olympiad in Informatics\"],\"Aizu-CGL_5_A\":[\"Closest Pair\",1238,null],\"Aizu-ALDS1_7_A\":[\"Rooted Trees\",9800,null],\"Aizu-1298\":[\"Separate Points\",351,\"ACM International Collegiate Programming Contest, Asia Regional 2009, Japan\"],\"Aizu-ALDS1_3_D\":[\"Areas on the Cross-Section Diagram\",6615,null],\"Aizu-ALDS1_3_C\":[\"Doubly Linked List\",13433,null],\"Aizu-ALDS1_3_B\":[\"Queue\",17716,null],\"Aizu-ALDS1_3_A\":[\"Stack\",20192,null],\"Aizu-1330\":[\"Never Wait for Weights\",711,\"ACM International Collegiate Programming Contest, Asia Regional 2012, Japan\"],\"Aizu-DPL_3_A\":[\"Largest Square\",1532,null],\"Aizu-0520\":[\"Lightest Mobile\",408,\"6th Japanese Olympiad in Informatics\"],\"Aizu-DPL_3_B\":[\"Largest Rectangle\",1106,null],\"Aizu-ALDS1_10_C\":[\"Longest Common Subsequence\",9224,null],\"Aizu-ALDS1_10_B\":[\"Matrix Chain Multiplication\",8198,null],\"Aizu-1053\":[\"Accelerated Railgun\",260,\"University of Aizu Programming Contest 2010\"],\"Aizu-1173\":[\"The Balance of the World\",2333,\"ACM International Collegiate Programming Contest, Japan Domestic 2011\"],\"Aizu-ALDS1_7_D\":[\"Reconstruction of a Tree\",3551,null],\"Aizu-ALDS1_7_C\":[\"Tree Walk\",7170,null],\"Aizu-ALDS1_10_A\":[\"Fibonacci Number\",12650,null],\"Aizu-ALDS1_7_B\":[\"Binary Trees\",7936,null],\"Aizu-0526\":[\"Boat Travel\",1027,\"7th Japanese Olympiad in Informatics, Preliminary Round\"],\"Aizu-0525\":[\"Osenbei\",2583,\"7th Japanese Olympiad in Informatics, Preliminary Round\"],\"Aizu-0528\":[\"Common Sub-String\",703,\"7th Japanese Olympiad in Informatics\"],\"Aizu-2297\":[\"Rectangular Stamps\",284,\"ACM-ICPC Japan Alumni Group Summer Camp 2011 Day 2\"],\"Aizu-1247\":[\"Monster Trap\",57,\"ACM International Collegiate Programming Contest, Asia Regional 2003, Japan\"],\"Aizu-2057\":[\"The Closest Circle\",131,\"ACM-ICPC Japan Alumni Group Summer Camp 2006 Day 1\"],\"Aizu-0310\":[\"Frame\",125,\"12th PC Koshien, Final\"],\"Aizu-GRL_4_B\":[\"Topological Sort\",4431,null],\"Aizu-2173\":[\"Wind Passages\",138,\"ACM-ICPC Japan Alumni Group Summer Camp 2009 Day 3\"],\"Aizu-2170\":[\"Marked Ancestor\",2362,\"ACM-ICPC Japan Alumni Group Summer Camp 2009 Day 3\"],\"Aizu-0558\":[\"Cheese\",4586,\"10th Japanese Olympiad in Informatics, Preliminary Round\"],\"Aizu-1128\":[\"Square Carpets\",117,\"ACM International Collegiate Programming Contest, Japan Domestic 2003\"],\"Aizu-CGL_4_A\":[\"Convex Hull\",2162,null],\"Aizu-CGL_4_B\":[\"Diameter of a Convex Polygon\",1124,null],\"Aizu-CGL_4_C\":[\"Convex Cut\",732,null],\"Aizu-ALDS1_6_B\":[\"Partition\",9068,null],\"Aizu-ALDS1_6_A\":[\"Counting Sort\",9592,null],\"Aizu-ALDS1_2_D\":[\"Shell Sort\",9548,null],\"Aizu-ALDS1_2_C\":[\"Stable Sort\",13366,null],\"Aizu-1116\":[\"Jigsaw Puzzles for Computers\",141,\"ACM International Collegiate Programming Contest, Japan Domestic 2001\"],\"Aizu-ALDS1_2_B\":[\"Selection Sort\",20443,null],\"Aizu-0301\":[\"Baton Relay Game\",448,\"12th PC Koshien, Preliminary Round\"],\"Aizu-ALDS1_2_A\":[\"Bubble Sort\",24315,null],\"Aizu-ALDS1_11_B\":[\"Depth First Search\",13217,null],\"Aizu-ALDS1_11_A\":[\"Graph\",10549,null],\"Aizu-ALDS1_11_D\":[\"Connected Components\",5156,null],\"Aizu-ALDS1_11_C\":[\"Breadth First Search\",10952,null],\"Aizu-1196\":[\"Bridge Removal\",519,\"ACM International Collegiate Programming Contest, Japan Domestic 2014\"],\"Aizu-ALDS1_6_D\":[\"Minimum Cost Sort\",2579,null],\"Aizu-ALDS1_6_C\":[\"Quick Sort\",7244,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943581000,"title":"白书《挑战程序设计竞赛2(算法和数据结构)》题目一览","dislikeCnt":0,"content":"\n[海岛Blog](http://blog.csdn.net/tigerisland45)\n\n[挑战ACM编程](https://cn.vjudge.net/group/challenge)是自由参与组。提供挑战题、水题、白书、紫书和蓝书等等......\n\n白书《挑战程序设计竞赛2(算法和数据结构)》题目一览\n\n第2章 算法与复杂度\n1. [problem:Aizu-ALDS1_1_D] Maximum Profit\n\n第3章 初等排序\n1. [problem:Aizu-ALDS1_1_A] Insertion Sort\n2. [problem:Aizu-ALDS1_2_A] Bubble Sort\n3. [problem:Aizu-ALDS1_2_B] Selection Sort\n4. [problem:Aizu-ALDS1_2_C] Stable Sort\n5. [problem:Aizu-ALDS1_2_D] Shell Sort\n\n第4章 数据结构\n1. [problem:Aizu-ALDS1_3_A] Stack\n2. [problem:Aizu-ALDS1_3_B] Queue\n3. [problem:Aizu-ALDS1_3_C] Doubly Linked List\n4. [problem:Aizu-ALDS1_3_D] Areas on the Cross-Section Diagram\n\n第5章 搜索\n1. [problem:Aizu-ALDS1_4_A] Linear Search\n2. [problem:Aizu-ALDS1_4_B] Binary Search\n3. [problem:Aizu-ALDS1_4_C] Dictionary\n4. [problem:Aizu-ALDS1_4_D] Allocation\n\n第6章 递归和分治法\n1. [problem:Aizu-ALDS1_5_A] Exhaustive Search\n2. [problem:Aizu-ALDS1_5_C] Koch Curve\n\n第7章 高等排序\n1. [problem:Aizu-ALDS1_5_B] Merge Sort\n2. [problem:Aizu-ALDS1_6_B] Partition\n3. [problem:Aizu-ALDS1_6_C] Quick Sort\n4. [problem:Aizu-ALDS1_6_A] Counting Sort\n5. [problem:Aizu-ALDS1_5_D] The Number of Inversions\n6. [problem:Aizu-ALDS1_6_D] Minimum Cost Sort\n\n第8章 树\n1. [problem:Aizu-ALDS1_7_A] Rooted Trees\n2. [problem:Aizu-ALDS1_7_B] Binary Trees\n3. [problem:Aizu-ALDS1_7_C] Tree Walk\n4. [problem:Aizu-ALDS1_7_d] Reconstruction of a Tree\n\n第9章 二叉搜索树\n1. [problem:Aizu-ALDS1_8_A] Binary Search Tree I\n2. [problem:Aizu-ALDS1_8_B] Binary Search Tree II\n3. [problem:Aizu-ALDS1_8_C] Binary Search Tree III\n\n第10章 堆\n1. [problem:Aizu-ALDS1_9_A] Complete Binary Tree\n2. [problem:Aizu-ALDS1_9_B] Maximum Heap\n3. [problem:Aizu-ALDS1_9_C] Priority Queue\n\n第11章 动态规划法\n1. [problem:Aizu-ALDS1_10_A] Fibonacci Number\n2. [problem:Aizu-ALDS1_10_C] Longest Common Subsequence\n3. [problem:Aizu-ALDS1_10_B] Matrix Chain Multiplication\n\n第12章 图\n1. [problem:Aizu-ALDS1_11_A] Graph\n2. [problem:Aizu-ALDS1_11_B] Depth First Search\n3. [problem:Aizu-ALDS1_11_C] Breadth First Search\n4. [problem:Aizu-ALDS1_11_D] Connected Components\n\n第13章 加权图\n1. [problem:Aizu-ALDS1_12_A] Minimum Spanning Tree\n2. [problem:Aizu-ALDS1_12_B] Single Source Shortest Path I\n3. [problem:Aizu-ALDS1_12_C] Single Source Shortest Path II\n\n第14章 高等数据结构\n1. [problem:Aizu-DSL_1_A] Disjoint Set: Union Find Tree\n2. [problem:Aizu-DSL_2_C] Range Search (kD Tree)\n3. [problem:Aizu-DSL_2_A] Range Minimum Query (RMQ)\n4. [problem:Aizu-DSL_2_B] Range Sum Query (RSQ)\n\n第15章高等图算法\n1. [problem:Aizu-GRL_1_C] All Pairs Shortest Path\n2. [problem:Aizu-GRL_4_B] Topological Sort\n3. [problem:Aizu-GRL_3_A] Articulation Points\n4. [problem:Aizu-GRL_5_A] Diameter of a Tree\n5. [problem:Aizu-GRL_2_A] Minimum Spanning Tree\n6. [problem:Aizu-GRL_1_B] Single Source Shortest Path (Negative Edges)\n7. [problem:Aizu-GRL_3_B] Bridges\n8. [problem:Aizu-GRL_3_C] Strongly Connected Components\n9. [problem:Aizu-GRL_2_B] Minimum-Cost Arborescence\n10. [problem:Aizu-GRL_6_A] Maximum Flow\n11. [problem:Aizu-GRL_7_A] Bipartite Matching\n\n第16章 计算几何学\n1. [problem:Aizu-CGL_2_A] Parallel/Orthogonal\n2. [problem:Aizu-CGL_1_A] Projection\n3. [problem:Aizu-CGL_1_B] Reflection\n4. [problem:Aizu-CGL_2_D] Distance\n5. [problem:Aizu-CGL_1_C] Counter-Clockwise\n6. [problem:Aizu-CGL_2_B] Intersection\n7. [problem:Aizu-CGL_2_C] Cross Point\n8. [problem:Aizu-CGL_7_D] Cross Points of a Circle and a Line\n9. [problem:Aizu-CGL_7_E] Cross Points of Circles\n10. [problem:Aizu-CGL_3_C] Polygon-Point Containment\n11. [problem:Aizu-CGL_4_A] Convex Hull\n12. [problem:Aizu-CGL_6_A] Segment Intersections: Manhattan Geometry\n13. [problem:Aizu-CGL_5_A] Closest Pair\n14. [problem:Aizu-CGL_4_B] Diameter of a Convex Polygon\n15. [problem:Aizu-CGL_4_C] Convex Cut\n\n第17章 动态规划法\n1. [problem:Aizu-DPL_1_A] Coin Changing Problem\n2. [problem:Aizu-DPL_1_B] 0-1 Knapsack Problem\n3. [problem:Aizu-DPL_1_D] Longest Increasing Subsequence\n4. [problem:Aizu-DPL_3_A] Largest Square\n5. [problem:Aizu-DPL_3_B] Largest Rectangle\n6. [problem:Aizu-DPL_1_C] Knapsack Problem\n7. [problem:Aizu-DPL_1_E] Edit Distance (Levenshtein Distance)\n8. [problem:Aizu-DPL_2_A] Traveling Salesman Problem\n9. [problem:Aizu-DPL_2_B] Chinese Postman Problem\n\n第18章 数论\n1. [problem:Aizu-ALDS1_1_C] Prime Numbers\n2. [problem:Aizu-ALDS1_1_B] Greatest Common Divisor\n3. [problem:Aizu-NTL_1_B] Power\n4. [problem:Aizu-NTL_1_A] Prime Factorize\n5. [problem:Aizu-NTL_1_C] Least Common Multiple\n6. [problem:Aizu-NTL_1_D] Euler\u0027s Phi Function\n7. [problem:Aizu-NTL_1_E] Extended Euclid Algorithm\n\n第19章 启发式搜索\n1. [problem:Aizu-ALDS1_13_A] 8 Queens Problem\n2. [problem:Aizu-ALDS1_13_B] 8 Puzzle\n3. [problem:Aizu-ALDS1_13_C] 15 Puzzle\n\n附录-挑战程序设计竞赛真题\n\n排序/搜索\n1. [problem:Aizu-1187] ICPC Ranking\n2. [problem:Aizu-2104] Country Road\n3. [problem:Aizu-0528] Common Sub-String\n4. [problem:Aizu-0539] Pizza\n\n数据结构\n1. [problem:Aizu-1173] The Balance of the World\n2. [problem:Aizu-0558] Cheese\n3. [problem:Aizu-0301] Baton Relay Game\n4. [problem:Aizu-0282] Programming Contest\n5. [problem:Aizu-2170] Marked Ancestor\n6. [problem:Aizu-1330] Never Wait for Weights\n\n递归/分治\n1. [problem:Aizu-0507] Square\n2. [problem:Aizu-0525] Osenbei\n3. [problem:Aizu-2057] The Closest Circle\n\n图\n1. [problem:Aizu-0508] String With Rings\n2. [problem:Aizu-1166] Amazing Mazes\n3. [problem:Aizu-2511] Sinking islands\n4. [problem:Aizu-0519] Worst Reporter\n5. [problem:Aizu-0526] Boat Travel\n6. [problem:Aizu-1182] Railway Connection\n7. [problem:Aizu-1162] Discrete Speed\n8. [problem:Aizu-1196] Bridge Removal\n9. [problem:Aizu-2224] Save your cats\n\n动态规划\n1. [problem:Aizu-2272] Cicada\n2. [problem:Aizu-1167] Pollock\u0027s conjecture\n3. [problem:Aizu-2090] Repeated Subsequences\n4. [problem:Aizu-0561] Books\n5. [problem:Aizu-2431] House Moving\n6. [problem:Aizu-0310] Frame\n\n计算几何学\n1. [problem:Aizu-1053] Accelerated Railgun\n2. [problem:Aizu-2003] Railroad Conflict\n3. [problem:Aizu-1157] Roll-A-Big-Ball\n4. [problem:Aizu-1298] Separate Points\n5. [problem:Aizu-1047] Crop Circle\n6. [problem:Aizu-1247] Monster Trap\n\n整数\n1. [problem:Aizu-1257] Sum of Consecutive prime Numbers\n2. [problem:Aizu-0211] Jogging\n3. [problem:Aizu-1327] One-Dimensional Cellular Automaton\n\n搜索(状态迁移)\n1. [problem:Aizu-1116] Jigsaw Puzzles for Computers\n2. [problem:Aizu-2157] Dial Lock\n3. [problem:Aizu-2297] Rectangular Stamps\n4. [problem:Aizu-1281] The Morning after Halloween\n5. [problem:Aizu-1128] Square Carpets\n\n综合问题\n1. [problem:Aizu-1189] Prime Caves\n2. [problem:Aizu-0520] Lightest Mobile\n3. [problem:Aizu-1301] Malfatti Circles\n4. [problem:Aizu-1183] Chain-Confined Path\n5. [problem:Aizu-2173] Wind Passages\n6. [problem:Aizu-0284] Happy End Problem","threadId":39154,"likeCnt":27,"createTime":1542411322000,"isWorkbook":true,"viewCnt":6928,"openness":1,"fav":false,"id":732,"trustable":false}