Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"HDU-4416\":[\"Good Article Good sentence\",866,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Hangzhou+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Hangzhou Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2774\":[\"Long Long Message\",7465,\"\\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,Zeyuan Zhu,\\\"Dedicate to my great beloved mother.\\\"\\u003c/div\\u003e\"],\"POJ-2778\":[\"DNA Sequence\",4525,\"\\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\"],\"UVA-10008\":[\"What\\u0027s Cryptanalysis?\",17717,null],\"POJ-3746\":[\"Teacher YYF\",405,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly+Contest+-+2009.08.23\\\"\\u003ePOJ Monthly Contest - 2009.08.23\\u003c/a\\u003e, Jason\\u003c/div\\u003e\"],\"HDU-2594\":[\"Simpsons’ Hidden Talents\",6607,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2010-05+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2010-05 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1314\":[\"Names for Babies\",743,null],\"ZOJ-1179\":[\"Finding Rectangles\",547,null],\"ZOJ-1174\":[\"Skip Letter Code\",141,null],\"ZOJ-1175\":[\"Word Process Machine\",778,null],\"ZOJ-1170\":[\"String Matching\",1904,null],\"ZOJ-1050\":[\"Start Up the Startup\",418,null],\"HDU-3613\":[\"Best Reward\",2113,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A818%A3%A9%A1%AA%A1%AAHost+by+TJU+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(18)——Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1711\":[\"Number Sequence\",16576,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-Spring+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-Spring Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1699\":[\"Best Sequence\",3238,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2004.07.18\\\"\\u003ePOJ Monthly--2004.07.18\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-2087\":[\"剪花布条\",23939,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B6%AC%C1%B7%C8%FD%BE%C5%D6%AE%B6%FE\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 冬练三九之二 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4300\":[\"Clairewd’s message\",3093,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+1\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 1 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2243\":[\"考研路茫茫——单词情结\",2010,\"\"],\"HDU-3973\":[\"AC\\u0027s String\",397,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Multi-University+Training+Contest+14+-+Host+by+FZU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Multi-University Training Contest 14 - Host by FZU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4787\":[\"GRE Words Revenge\",427,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Chengdu+Regional+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Chengdu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HUST-1010\":[\"The Minimum Length\",811,\"\"],\"HDU-3336\":[\"Count the string\",7364,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4821\":[\"String\",1588,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Asia+Regional+Changchun+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Asia Regional Changchun \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1334\":[\"Genes in DNA\",365,null],\"HDU-3294\":[\"Girls\\u0027 research\",2414,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+%A1%B0HDU-Sailormoon%A1%B1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 “HDU-Sailormoon” Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1068\":[\"P,MTHBGWB\",1729,null],\"POJ-3080\":[\"Blue Jeans\",8233,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSouth+Central+USA+2006\\\"\\u003eSouth Central USA 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10082\":[\"WERTYU\",35292,null],\"ZOJ-1181\":[\"Word Amalgamation\",1521,null],\"HDU-3746\":[\"Cyclic Nacklace\",8190,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+3rd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 3rd “Vegetable-Birds Cup” Programming Open Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10188\":[\"Automated Judge Script\",4030,null],\"UVA-10340\":[\"All in All\",26599,null],\"POJ-2752\":[\"Seek the Name, Seek the Fame\",12881,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.01.22\\\"\\u003ePOJ Monthly--2006.01.22\\u003c/a\\u003e,Zeyuan Zhu\\u003c/div\\u003e\"],\"POJ-2758\":[\"Checking the Text\",639,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.02.26\\\"\\u003ePOJ Monthly--2006.02.26\\u003c/a\\u003e,zgl \\u0026amp; twb\\u003c/div\\u003e\"],\"HDU-3068\":[\"最长回文\",10273,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+16+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 16 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3065\":[\"病毒侵袭持续中\",5322,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+16+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 16 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3341\":[\"Lost\\u0027s revenge\",972,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.03.06\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.03.06 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1109\":[\"Language of FatMouse\",6455,null],\"HDU-5008\":[\"Boring String Problem\",540,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+ACM%2FICPC+Asia+Regional+Xi%26%23039%3Ban+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 ACM/ICPC Asia Regional Xi\\u0027an Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4436\":[\"str2int\",798,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Asia+Tianjin+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Asia Tianjin Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3729\":[\"Facer’s string\",409,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly+Contest+%E2%80%93+2009.04.05\\\"\\u003ePOJ Monthly Contest – 2009.04.05\\u003c/a\\u003e, Facer\\u003c/div\\u003e\"],\"HDU-2896\":[\"病毒侵袭\",6475,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+10+-+Host+by+NIT\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 10 - Host by NIT \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1686\":[\"Oulipo\",11225,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BB%AA%B6%AB%C7%F8%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC_%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 华东区大学生程序设计邀请赛_热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1268\":[\"Unlucky Strings\",466,null],\"ZOJ-1116\":[\"A Well-Formed Problem\",185,null],\"LightOJ-1258\":[\"Making Huge Palindromes\",2481,null],\"SPOJ-DISUBSTR\":[\"Distinct Substrings\",7691,\"ByteCode \\u002706\"],\"HDU-4270\":[\"Dynamic Lover\",232,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+ACM%2FICPC+Asia+Regional+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1111\":[\"Poker Hands\",575,null],\"FZU-1901\":[\"Period II\",817,\"FOJ有奖月赛-2010年05月\"],\"ZOJ-3494\":[\"BCD Code\",1334,null],\"POJ-3693\":[\"Maximum repetition substring\",2235,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\\\"\\u003e2008 Asia Hefei Regional Contest Online by USTC\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3450\":[\"Corporate Identity\",2012,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2007\\\"\\u003eCTU Open 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3294\":[\"Life Forms\",3081,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+Local+Contest\\\"\\u003eWaterloo Local Contest\\u003c/a\\u003e, 2006.9.30\\u003c/div\\u003e\"],\"SPOJ-REPEATS\":[\"Repeats\",1454,\"BOI 2004\"],\"UVA-232\":[\"Crossword Answers\",6520,null],\"Aizu-1312\":[\"Where\\u0027s Wally\",287,\"ACM International Collegiate Programming Contest, Asia Regional 2010, Japan\"],\"HDU-4847\":[\"Wow! Such Doge!\",2849,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014%CE%F7%B0%B2%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014西安全国邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2825\":[\"Wireless Password\",1855,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+1+-+Host+by+TJU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 1 - Host by TJU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3974\":[\"Palindrome\",6542,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSeventh+ACM+Egyptian+National+Programming+Contest\\\"\\u003eSeventh ACM Egyptian National Programming Contest\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-3518\":[\"Boring counting\",1188,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A89%A3%A9%A1%AA%A1%AAHost+by+HNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(9)——Host by HNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"URAL-1158\":[\"Censored!\",1071,\"\"],\"POJ-2406\":[\"Power Strings\",21532,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2002.07.01\\\"\\u003eWaterloo local 2002.07.01\\u003c/a\\u003e\\u003c/div\\u003e\"],\"SPOJ-PHRASES\":[\"Relevant Phrases of Annihilation\",1144,\"DASM Programming League 2004 (problemset 1)\"],\"ZOJ-2727\":[\"List the Books\",2580,null],\"ZOJ-1126\":[\"Bio-Informatics\",69,null],\"SPOJ-SUBST1\":[\"New Distinct Substrings\",5153,\"Base on a problem in ByteCode06\"],\"UVA-401\":[\"Palindromes\",24676,null],\"LightOJ-1427\":[\"Substring Frequency (II)\",640,null],\"LightOJ-1428\":[\"Melody Comparison\",490,null],\"HDU-4162\":[\"Shape Number\",654,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+2011+Rocky+Mountain+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 2011 Rocky Mountain Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3581\":[\"Sequence\",1349,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Founder+Monthly+Contest+%E2%80%93+2008.04.13\\\"\\u003ePOJ Founder Monthly Contest – 2008.04.13\\u003c/a\\u003e, Yao Jinyu\\u003c/div\\u003e\"],\"UVA-1225\":[\"Digit Counting\",22295,null],\"UVA-1587\":[\"Box\",5545,null],\"HDU-4333\":[\"Revolving Digits\",1353,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2012+Multi-University+Training+Contest+4\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2012 Multi-University Training Contest 4 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-1588\":[\"Kickdown\",4821,null],\"HDU-3522\":[\"Minimum Integer sequence\",114,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2010+ACM-ICPC+Multi-University+Training+Contest%A3%A89%A3%A9%A1%AA%A1%AAHost+by+HNU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(9)——Host by HNU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3247\":[\"Resource Archiver\",833,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+%A1%B0NIT+Cup%A1%B1+National+Invitational+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 “NIT Cup” National Invitational Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"SPOJ-BEADS\":[\"Glass Beads\",3545,\"ACM Central European Programming Contest, Prague 1998\"],\"UVA-612\":[\"DNA Sorting\",7102,null],\"UVA-1583\":[\"Digit Generator\",9997,null],\"UVA-1584\":[\"Circular Sequence\",8905,null],\"UVA-1585\":[\"Score\",22769,null],\"ZOJ-1014\":[\"Operand\",670,null],\"UVA-1586\":[\"Molar mass\",14229,null],\"ZOJ-3430\":[\"Detect the Virus\",2193,null],\"UVA-455\":[\"Periodic Strings\",19305,null],\"UVA-850\":[\"Crypt Kicker II\",3130,null],\"HDU-1358\":[\"Period\",7347,\"\"],\"HDU-2328\":[\"Corporate Identity\",1527,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCTU+Open+Contest+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e CTU Open Contest 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1238\":[\"Substrings\",5692,\"\"],\"CodeForces-123D\":[\"String\",1332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/123\\\"\\u003eCodeforces Beta Round 92 (Div. 1 Only)\\u003c/a\\u003e\"],\"UVALive-3527\":[\"Find the Clones\",285,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"HDU-2846\":[\"Repository\",1766,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Multi-University+Training+Contest+4+-+Host+by+HDU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Multi-University Training Contest 4 - Host by HDU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"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\"],\"UVA-10150\":[\"Doublets\",2657,null],\"CodeForces-25E\":[\"Test\",2616,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"POJ-2503\":[\"Babelfish\",17202,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2001.09.22\\\"\\u003eWaterloo local 2001.09.22\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10679\":[\"I Love Strings!!\",4994,null],\"URAL-1297\":[\"Palindrome\",7424,\"\"],\"HDU-3374\":[\"String Problem\",2070,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDOJ+Monthly+Contest+%A8C+2010.04.04\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDOJ Monthly Contest – 2010.04.04 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4622\":[\"Reincarnation\",1528,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+Multi-University+Training+Contest+3\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 3 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-227\":[\"Puzzle\",8461,null],\"UVA-11809\":[\"Floating-Point Numbers\",2310,null],\"UVA-340\":[\"Master-Mind Hints\",11264,null],\"CodeForces-86C\":[\"Genetic engineering\",814,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"HDU-4758\":[\"Walk Through Squares\",508,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Nanjing+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Nanjing Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-2457\":[\"DNA repair\",1632,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Hefei Regional Contest Online by USTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1247\":[\"Hat’s Words\",5167,\"\"],\"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\"],\"HDU-1800\":[\"Flying to the Mars\",5454,\"\"],\"HDU-1403\":[\"Longest Common Substring\",1567,\"\"],\"HDU-2459\":[\"Maximum repetition substring\",291,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+Asia+Hefei+Regional+Contest+Online+by+USTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 Asia Hefei Regional Contest Online by USTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11475\":[\"Extend to Palindrome\",5659,null],\"POJ-1743\":[\"Musical Theme\",6270,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dLouTiancheng%40POJ\\\"\\u003eLouTiancheng@POJ\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-1226\":[\"Substrings\",4203,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTehran+2002+Preliminary\\\"\\u003eTehran 2002 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-1368\":[\"DNA Consensus String\",7506,null],\"Aizu-2212\":[\"Stolen Jewel\",194,\"University of Tokyo Programming Contest 2010\"],\"POJ-1625\":[\"Censored!\",1813,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2001\\\"\\u003eNortheastern Europe 2001\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"HDU-2296\":[\"Ring\",1309,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dThe+4th+Baidu+Cup+final\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e The 4th Baidu Cup final \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4117\":[\"GRE Words\",455,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2011+Asia+ChengDu+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2011 Asia ChengDu Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-1509\":[\"Glass Beads\",2540,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCentral+Europe+1998\\\"\\u003eCentral Europe 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4513\":[\"吉哥系列故事——完美队形II\",3129,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%B6%FE%B3%A1%A3%A83%D4%C222%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第二场(3月22日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4511\":[\"小明系列故事——女友的考验\",599,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%CC%DA%D1%B6%B1%E0%B3%CC%C2%ED%C0%AD%CB%C9%B3%F5%C8%FC%B5%DA%B6%FE%B3%A1%A3%A83%D4%C222%C8%D5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013腾讯编程马拉松初赛第二场(3月22日) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"Aizu-2292\":[\"Common Palindromes\",237,\"ACM-ICPC Japan Alumni Group Summer Camp 2011 Day 2\"],\"ZOJ-1038\":[\"T9\",804,null],\"ZOJ-1159\":[\"487-3279\",1841,null],\"SPOJ-LCS2\":[\"Longest Common Substring II\",2810,\"\"],\"HDU-2609\":[\"How many\",2357,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%B7%DC%B6%B7%B5%C4%C4%EA%B4%FA\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 奋斗的年代 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-272\":[\"TEX Quotes\",59120,null],\"URAL-1517\":[\"Freedom of Choice\",2252,\"\"],\"POJ-3376\":[\"Finding Palindromes\",685,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.09.09\\\"\\u003ePOJ Monthly--2007.09.09\\u003c/a\\u003e, Zhou Gelin, modified from POI06\\u003c/div\\u003e\"],\"UVA-10132\":[\"File Fragmentation\",3350,null],\"POJ-3415\":[\"Common Substrings\",3049,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.10.06\\\"\\u003ePOJ Monthly--2007.10.06\\u003c/a\\u003e, wintokk\\u003c/div\\u003e\"],\"UVA-10010\":[\"Where\\u0027s Waldorf?\",10326,null],\"UVA-10252\":[\"Common Permutation\",13160,null],\"HDU-1251\":[\"统计难题\",18043,\"\"],\"HDU-2222\":[\"Keywords Search\",14073,\"\"],\"HDU-4763\":[\"Theme Section\",2809,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM%2FICPC+Asia+Regional+Changchun+Online\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM/ICPC Asia Regional Changchun Online \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1347\":[\"Aladdin and the Magical Lamp\",647,null],\"ZOJ-3228\":[\"Searching the String\",2544,null],\"UVA-848\":[\"Fmt\",727,null],\"ZOJ-1046\":[\"Double Vision\",104,null],\"ZOJ-1044\":[\"Index Generation\",61,null],\"UVA-202\":[\"Repeating Decimals\",7414,null],\"POJ-3261\":[\"Milk Patterns\",5452,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+December+Gold\\\"\\u003eUSACO 2006 December Gold\\u003c/a\\u003e\\u003c/div\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943401000,"title":"TYUT字符串题汇","dislikeCnt":0,"content":"\nTYUT字符串题汇\n\n紫书 第3章 数组和字符串(例题)\n1. [problem:UVA-272] TEX Quotes\n2. [problem:UVA-10082] WERTYU\n3. [problem:UVA-401] Palindromes\n4. [problem:UVA-340] Master-Mind Hints\n5. [problem:UVA-1583] Digit Generator\n6. [problem:UVA-1584] Circular Sequence\n\n紫书 第3章 数组和字符串(习题)\n1. [problem:UVA-1585] Score\n2. [problem:UVA-1586] Molar mass\n3. [problem:UVA-1225] Digit Counting\n4. [problem:UVA-455] Periodic Strings\n5. [problem:UVA-227] Puzzle\n6. [problem:UVA-232] Crossword Answers\n7. [problem:UVA-1368] DNA Consensus String\n8. [problem:UVA-202] Repeating Decimals\n9. [problem:UVA-10340] All in All\n10. [problem:UVA-1587] Box\n11. [problem:UVA-1588] Kickdown\n12. [problem:UVA-11809] Floating-Point Numbers\n\n俞书 第五章论题选编\n\n5.1字符串\n1. [problem:POJ-1699] Best Sequence\n2. [problem:SPOJ-BEADS] Glass Beads\n3. [problem:URAL-1158] Censored!\n4. [problem:URAL-1517] Freedom of Choice\n5. [problem:POJ-1743] Musical Theme\n6. [problem:URAL-1297] Palindrome\n7. [problem:POJ-2503] Babelfish\n\n白书 4.7字符串(练习题)\n1. [problem:Aizu-2212] Stolen Jewel\n2. [problem:CodeForces-86C] Genetic engineering\n3. [problem:CodeForces-25E] Test\n4. [problem:Aizu-1312] Where\u0027s Wally\n5. [problem:POJ-1509] Glass Beads\n6. [problem:POJ-3415] Common Substrings\n7. [problem:POJ-3729] Facer’s string\n8. [problem:Aizu-2292] Common Palindromes\n9. [problem:CodeForces-123D] String\n\n《挑战编程--程序设计竞赛训练手册》 3 Strings\n1. [problem:UVA-10082] WERTYU\n2. [problem:UVA-10010] Where\u0027s Waldorf?\n3. [problem:UVA-10252] Common Permutation\n4. [problem:UVA-850] Crypt Kicker II\n5. [problem:UVA-10188] Automated Judge Script\n6. [problem:UVA-10132] File Fragmentation\n7. [problem:UVA-10150] Doublets\n8. [problem:UVA-848] Fmt\n\nπ-Algorithmist String 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\n9. [problem:UVA-10010] Where\u0027s Waldorf?\n\n余书 第8章 字符串算法\n1. [problem:POJ-2752] Seek the Name, Seek the Fame\n2. [problem:POJ-2503] Babelfish\n3. [problem:POJ-2778] DNA Sequence\n4. [problem:POJ-3294] Life Forms\n\n喻书 第8章 字符串算法(例题)\n1. [problem:POJ-2774] Long Long Message\n2. [problem:HDU-4162] Shape Number\n3. [problem:HDU-3068] 最长回文\n4. [problem:HDU-1711] Number Sequence\n5. [problem:HDU-2087] 剪花布条\n6. [problem:HDU-3746] Cyclic Nacklace\n7. [problem:HDU-3374] String Problem\n8. [problem:HDU-3522] Minimum Integer sequence\n9. [problem:HDU-4763] Theme Section\n10. [problem:HDU-3518] Boring counting\n11. [problem:HDU-1251] 统计难题\n12. [problem:HDU-1247] Hat’s Words\n13. [problem:HDU-2222] Keywords Search\n14. [problem:HDU-4787] GRE Words Revenge\n15. [problem:HDU-2243] 考研路茫茫——单词情结\n16. [problem:POJ-1743] Musical Theme\n17. [problem:POJ-3261] Milk Patterns\n18. [problem:HDU-4622] Reincarnation\n19. [problem:SPOJ-LCS2] Longest Common Substring II\n20. [problem:HDU-4416] Good Article Good sentence\n21. [problem:HDU-4436] str2int\n\n喻书 第8章 字符串算法(习题)\n1. [problem:HDU-3973] AC\u0027s String\n2. [problem:HDU-1800] Flying to the Mars\n3. [problem:HDU-4821] String\n4. [problem:HDU-2609] How many\n5. [problem:HDU-3613] Best Reward\n6. [problem:HDU-3294] Girls\u0027 research\n7. [problem:HDU-3336] Count the string\n8. [problem:HDU-1358] Period\n9. [problem:HDU-2594] Simpsons’ Hidden Talents\n10. [problem:HDU-4333] Revolving Digits\n11. [problem:HDU-4300] Clairewd’s message\n12. [problem:HDU-2846] Repository\n13. [problem:HDU-2896] 病毒侵袭\n14. [problem:HDU-3065] 病毒侵袭持续中\n15. [problem:HDU-4117] GRE Words\n16. [problem:HDU-2296] Ring\n17. [problem:HDU-5008] Boring String Problem\n18. [problem:HDU-3518] Boring counting\n19. [problem:HDU-2459] Maximum repetition substring\n20. [problem:HDU-1403] Longest Common Substring\n21. [problem:HDU-4622] Reincarnation\n22. [problem:HDU-4270] Dynamic Lover\n\n赵书 第三章 字符串\n1. [problem:ZOJ-1170] String Matching\n2. [problem:ZOJ-1174] Skip Letter Code\n3. [problem:ZOJ-1175] Word Process Machine\n4. [problem:ZOJ-1179] Finding Rectangles\n5. [problem:ZOJ-1181] Word Amalgamation\n6. [problem:ZOJ-2727] List the Books\n\n赵书2 第三章字符串(1-2)\n1. [problem:ZOJ-1014] Operand\n2. [problem:ZOJ-1038] T9\n3. [problem:ZOJ-1044] Index Generation\n4. [problem:ZOJ-1046] Double Vision\n5. [problem:ZOJ-1050] Start Up the Startup\n6. [problem:ZOJ-1068] P,MTHBGWB\n7. [problem:ZOJ-1109] Language of FatMouse\n8. [problem:ZOJ-1111] Poker Hands\n9. [problem:ZOJ-1116] A Well-Formed Problem\n10. [problem:ZOJ-1126] Bio-Informatics\n11. [problem:ZOJ-1159] 487-3279\n\nHDU KMP\n1. [problem:HDU-1358] \t Period \t\n2. [problem:HDU-1711] \t Number Sequence \n\nKB专题十六 KMP \u0026 扩展KMP \u0026 Manacher\n1. [problem:HDU-1711] Number Sequence\n2. [problem:HDU-1686] Oulipo\n3. [problem:HDU-2087] 剪花布条\n4. [problem:HDU-3746] Cyclic Nacklace\n5. [problem:HDU-1358] Period\n6. [problem:HUST-1010] The Minimum Length\n7. [problem:POJ-2406] Power Strings\n8. [problem:POJ-2752] Seek the Name, Seek the Fame\n9. [problem:POJ-3080] Blue Jeans\n10. [problem:HDU-2594] Simpsons’ Hidden Talents\n11. [problem:HDU-3336] Count the string\n12. [problem:HDU-4300] Clairewd’s message\n13. [problem:HDU-1238] Substrings\n14. [problem:HDU-2328] Corporate Identity\n15. [problem:HDU-3374] String Problem\n16. [problem:HDU-2609] How many\n17. [problem:FZU-1901] Period II\n18. [problem:POJ-3746] Teacher YYF\n19. [problem:HDU-3613] Best Reward\n20. [problem:POJ-3376] Finding Palindromes\n21. [problem:POJ-3974] Palindrome\n22. [problem:HDU-4513] 吉哥系列故事――完美队形II\n23. [problem:HDU-3294] Girls\u0027 research\n24. [problem:HDU-3068] 最长回文\n25. [problem:HDU-4847] Wow! Such Doge!\n26. [problem:HDU-4763] Theme Section\n\nKB专题十七 AC自动机\n1. [problem:HDU-2222] Keywords Search\n2. [problem:HDU-2896] 病毒侵袭\n3. [problem:HDU-3065] 病毒侵袭持续中\n4. [problem:ZOJ-3430] Detect the Virus\n5. [problem:POJ-2778] DNA Sequence\n6. [problem:HDU-2243] 考研路茫茫――单词情结\n7. [problem:POJ-1625] Censored!\n8. [problem:HDU-2825] Wireless Password\n9. [problem:HDU-2296] Ring\n10. [problem:HDU-2457] DNA repair\n11. [problem:ZOJ-3228] Searching the String\n12. [problem:HDU-3341] Lost\u0027s revenge\n13. [problem:HDU-3247] Resource Archiver\n14. [problem:ZOJ-3494] BCD Code\n15. [problem:HDU-4758] Walk Through Squares\n16. [problem:HDU-4511] 小明系列故事――女友的考验\n\nKB专题十八 后缀数组\n1. [problem:POJ-1743] Musical Theme\n2. [problem:POJ-3261] Milk Patterns\n3. [problem:SPOJ-DISUBSTR] Distinct Substrings\n4. [problem:SPOJ-SUBST1] New Distinct Substrings\n5. [problem:POJ-2406] Power Strings\n6. [problem:SPOJ-REPEATS] Repeats\n7. [problem:POJ-3693] Maximum repetition substring\n8. [problem:POJ-2774] Long Long Message\n9. [problem:POJ-3415] Common Substrings\n10. [problem:POJ-3294] Life Forms\n11. [problem:SPOJ-PHRASES] Relevant Phrases of Annihilation\n12. [problem:POJ-1226] Substrings\n13. [problem:UVA-11475] Extend to Palindrome\n14. [problem:POJ-3581] Sequence\n15. [problem:POJ-3450] Corporate Identity\n16. [problem:POJ-3080] Blue Jeans\n17. [problem:POJ-2758] Checking the Text\n\nKB SHU训练三——字符串\n1. [problem:LightOJ-1427] Substring Frequency (II)\n2. [problem:LightOJ-1258] Making Huge Palindromes\n3. [problem:LightOJ-1268] Unlucky Strings\n4. [problem:LightOJ-1334] Genes in DNA\n5. [problem:LightOJ-1428] Melody Comparison\n6. [problem:LightOJ-1314] Names for Babies\n7. [problem:LightOJ-1347] Aladdin and the Magical Lamp","threadId":40001,"likeCnt":3,"createTime":1543571294000,"isWorkbook":true,"viewCnt":2446,"openness":1,"fav":false,"id":758,"trustable":false}