Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"UVALive-3619\":[\"Sum of Different Primes\",395,\"Regionals 2006 \\u003e\\u003e Asia - Yokohama\"],\"POJ-2891\":[\"Strange Way to Express Integers\",5289,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2006.07.30\\\"\\u003ePOJ Monthly--2006.07.30\\u003c/a\\u003e, Static\\u003c/div\\u003e\"],\"UVA-10089\":[\"Repackaging\",962,null],\"UVALive-2889\":[\"Palindrome Numbers\",499,\"Regionals 2003 \\u003e\\u003e Asia - Dhaka\"],\"UVALive-5916\":[\"GCD Guessing Game\",108,\"Regionals 2011 \\u003e\\u003e Europe - Northeastern\"],\"UVA-1386\":[\"Cellular Automaton\",406,null],\"UVA-11181\":[\"Probability|Given\",2403,null],\"UVA-1021\":[\"Eurodiffusion\",83,null],\"UVA-10090\":[\"Marbles\",3448,null],\"UVA-1262\":[\"Password\",2192,null],\"UVA-10079\":[\"Pizza Cutting\",19774,null],\"UVA-10198\":[\"Counting\",4721,null],\"UVA-11166\":[\"Power Signs\",184,null],\"UVA-10075\":[\"Airlines\",1030,null],\"POJ-2429\":[\"GCD \\u0026amp; LCM Inverse\",1866,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Achilles\\\"\\u003ePOJ Achilles\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-707\":[\"Robbery\",560,null],\"URAL-1132\":[\"Square Root\",1086,\"\"],\"UVALive-2756\":[\"Crazy tea party\",456,\"Regionals 2003 \\u003e\\u003e Europe - Southeastern\"],\"SPOJ-DETER\":[\"Find The Determinant\",194,\"\\\"The Art Of Computer Programming\\\"\"],\"UVALive-3720\":[\"Highways\",211,\"Regionals 2006 \\u003e\\u003e Europe - Central\"],\"UVALive-3962\":[\"Tough Water Level\",31,\"Regionals 2007 \\u003e\\u003e Europe - Central\"],\"HackerRank-euler012\":[\"Project Euler #12: Highly divisible triangular number\",9316,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/projecteuler\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eprojecteuler\\u003c/a\\u003e\"],\"UVA-1390\":[\"Interconnect\",183,null],\"UVA-944\":[\"Happy Numbers\",1008,null],\"UVA-1393\":[\"Highways\",518,null],\"UVALive-5819\":[\"Alphabet Soup\",77,\"Regionals 2011 \\u003e\\u003e Europe - Southwestern\"],\"UVALive-3516\":[\"Exploring Pyramids\",602,\"Regionals 2005 \\u003e\\u003e Europe - Northeastern\"],\"UVA-10183\":[\"How Many Fibs?\",6259,null],\"URAL-1387\":[\"Vasya\\u0027s Dad\",438,\"Petrozavodsk summer training camp, August 2005.\"],\"UVALive-3998\":[\"Prime k-tuple\",93,\"Regionals 2007 \\u003e\\u003e Asia - Danang\"],\"HackerRank-euler027\":[\"Project Euler #27: Quadratic primes\",4360,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/projecteuler\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eprojecteuler\\u003c/a\\u003e\"],\"UVALive-3510\":[\"Pixel Shuffle\",177,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"UVA-11038\":[\"How Many O\\u0027s?\",1677,null],\"UVA-913\":[\"Joana and the Odd Numbers\",10032,null],\"UVA-10071\":[\"Back to High School Physics\",65354,null],\"UVA-12371\":[\"Guards\",106,null],\"UVA-11040\":[\"Add bricks in the wall\",2751,null],\"UVA-1282\":[\"Fibonacci Words\",344,null],\"UVA-11388\":[\"GCD LCM\",13363,null],\"UVA-10299\":[\"Relatives\",4982,null],\"UVA-10179\":[\"Irreducable Basic Fractions\",6292,null],\"UVA-10177\":[\"(2/3/4)-D Sqr/Rects/Cubes/Boxes?\",2343,null],\"UVA-11021\":[\"Tribles\",1945,null],\"UVA-12230\":[\"Crossing Rivers\",1518,null],\"UVA-10294\":[\"Arif in Dhaka (First Love Part 2)\",994,null],\"UVA-808\":[\"Bee Breeding\",1339,null],\"HDU-5015\":[\"233 Matrix\",2474,\"\\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\"],\"POJ-2407\":[\"Relatives\",8035,\"\\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\"],\"URAL-1397\":[\"Points Game\",311,\"Open All-Ukrainian Collegiate Programming Contest 2006\"],\"POJ-1678\":[\"I Love this Game!\",843,\"\\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\"],\"POJ-3735\":[\"Training little cats\",2542,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPKU+Campus+2009+%28POJ+Monthly+Contest+%E2%80%93+2009.05.17%29\\\"\\u003ePKU Campus 2009 (POJ Monthly Contest – 2009.05.17)\\u003c/a\\u003e, Facer\\u003c/div\\u003e\"],\"URAL-1032\":[\"Find a Multiple\",4663,\"Ural Collegiate Programming Contest \\u002799\"],\"POJ-2409\":[\"Let it Bead\",4143,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUlm+Local+2000\\\"\\u003eUlm Local 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11149\":[\"Power of Matrix\",1112,null],\"UVA-1050\":[\"Ars Longa\",42,null],\"UVA-10182\":[\"Bee Maja\",3410,null],\"UVA-11150\":[\"Cola\",15676,null],\"POJ-3421\":[\"X-factor Chains\",2795,\"\\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, ailyanlu@zsu\\u003c/div\\u003e\"],\"HYSBZ-2005\":[\"能量采集\",550,\"Noi2010\"],\"POJ-2214\":[\"Regions\",123,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+FEE+Local+1998\\\"\\u003eCTU FEE Local 1998\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-2683\":[\"Payment System\",30,\"Regionals 2006 \\u003e\\u003e Europe - Southeastern\"],\"UVA-1118\":[\"Binary Stirling Numbers\",243,null],\"UVALive-3529\":[\"Widget Factory\",77,\"Regionals 2005 \\u003e\\u003e Europe - Central\"],\"POJ-2103\":[\"Jackpot\",153,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2004\\\"\\u003eNortheastern Europe 2004\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"POJ-2345\":[\"Central heating\",374,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%272000+Students+Session\\\"\\u003eUral State University Internal Contest October\\u00272000 Students Session\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-3883\":[\"Prime Gap\",537,\"Regionals 2007 \\u003e\\u003e Asia - Tokyo\"],\"UVALive-3641\":[\"Leonardo\\u0027s Notebook\",458,\"Regionals 2006 \\u003e\\u003e Europe - Northwestern\"],\"UVALive-3521\":[\"Joseph\\u0027s Problem\",222,\"Regionals 2005 \\u003e\\u003e Europe - Northeastern\"],\"UVALive-3891\":[\"The Teacher\\u0027s Side of Math\",44,\"Regionals 2007 \\u003e\\u003e Asia - Tokyo\"],\"UVA-12063\":[\"Zeros and Ones\",907,null],\"CodeForces-392C\":[\"Yet Another Number Sequence\",784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/392\\\"\\u003eCodeforces Round 230 (Div. 1)\\u003c/a\\u003e\"],\"POJ-3641\":[\"Pseudoprime numbers\",5599,\"\\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, 2007.9.23\\u003c/div\\u003e\"],\"UVA-12169\":[\"Disgruntled Judge\",1783,null],\"POJ-3761\":[\"Bubble Sort\",878,\"\"],\"POJ-1220\":[\"NUMBER BASE CONVERSION\",2521,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dGreater+New+York+2002\\\"\\u003eGreater New York 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11076\":[\"Add Again\",1589,null],\"UVA-11077\":[\"Find the Permutations\",867,null],\"POJ-2315\":[\"Football Game\",260,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,uni\\u003c/div\\u003e\"],\"POJ-3526\":[\"The Teacher’s Side of Math\",163,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2007\\\"\\u003eJapan 2007\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-2344\":[\"Parallel Expectations\",14,\"Regionals 2001 \\u003e\\u003e Asia - Tehran\"],\"UVA-1482\":[\"Playing With Stones\",797,null],\"UVA-12293\":[\"Box Game\",2282,null],\"UVA-1363\":[\"Joseph\\u0027s Problem\",915,null],\"POJ-3532\":[\"Resistance\",291,\"\\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.03.16\\\"\\u003ePOJ Founder Monthly Contest – 2008.03.16\\u003c/a\\u003e, g201513\\u003c/div\\u003e\"],\"UVA-12034\":[\"Race\",2144,null],\"UVA-11186\":[\"Circum Triangle\",569,null],\"TopCoder-6784\":[\"RefactorableNumber\",2,\"\\u003ca href\\u003d\\\"https://community.topcoder.com/tc?module\\u003dProblemDetail\\u0026amp;rd\\u003d10667\\u0026amp;pm\\u003d6784\\\"\\u003eSingle Round Match 343 Round 1 - Division I, Level Three\\u003c/a\\u003e\"],\"UVA-10098\":[\"Generating Fast\",8466,null],\"POJ-3533\":[\"Light Switching Game\",277,\"\\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.03.16\\\"\\u003ePOJ Founder Monthly Contest – 2008.03.16\\u003c/a\\u003e, g201513\\u003c/div\\u003e\"],\"UVALive-4998\":[\"Simple Encryption\",138,\"Regionals 2010 \\u003e\\u003e Asia - Kuala Lumpur\"],\"UVALive-3668\":[\"A Funny Stone Game\",285,\"Regionals 2006 \\u003e\\u003e Asia - Beijing\"],\"POJ-3537\":[\"Crosses and Crosses\",1536,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2007\\\"\\u003eNortheastern Europe 2007\\u003c/a\\u003e, Northern Subregion\\u003c/div\\u003e\"],\"UVALive-5846\":[\"Neon Sign\",450,\"Regionals 2011 \\u003e\\u003e Asia - Daejeon\"],\"UVALive-5721\":[\"Activation\",80,\"Regionals 2011 \\u003e\\u003e Asia - Beijing\"],\"CodeForces-282D\":[\"Yet Another Number Game\",1498,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/282\\\"\\u003eCodeforces Round 173 (Div. 2)\\u003c/a\\u003e\"],\"POJ-1286\":[\"Necklace of Beads\",3824,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dXi%27an+2002\\\"\\u003eXi\\u0027an 2002\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1700\":[\"Points on Cycle\",865,\"\\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%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-4305\":[\"Wizards\",153,\"Regionals 2008 \\u003e\\u003e Europe - Southwestern\"],\"UVA-10924\":[\"Prime Words\",13918,null],\"UVALive-5760\":[\"Alice and Bob\",132,\"Regionals 2011 \\u003e\\u003e Asia - Chengdu\"],\"UVA-10808\":[\"Rational Resistors\",116,null],\"ZOJ-1177\":[\"K-Magic Number\",307,null],\"POJ-3471\":[\"Integral Roots\",191,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly--2007.11.25\\\"\\u003ePOJ Monthly--2007.11.25\\u003c/a\\u003e, Zhou Dong\\u003c/div\\u003e\"],\"UVA-530\":[\"Binomial Showdown\",8811,null],\"CodeForces-385E\":[\"Bear in the Field\",764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"HDU-1714\":[\"RedField\",434,\"\\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\"],\"HDU-1713\":[\"相遇周期\",2587,\"\\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\"],\"HDU-1716\":[\"排列2\",6546,\"\\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%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10910\":[\"Marks Distribution\",2626,null],\"UVALive-4411\":[\"Addition-Subtraction Game\",104,\"Regionals 2008 \\u003e\\u003e Asia - Kuala Lumpur\"],\"UVALive-4412\":[\"The Great Game\",28,\"Regionals 2008 \\u003e\\u003e Asia - Kuala Lumpur\"],\"UVALive-2481\":[\"Silly Sort\",217,\"World Finals \\u003e\\u003e 2002 - Honolulu\"],\"HDU-5072\":[\"Coprime\",924,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Asia+AnShan+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Asia AnShan Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10918\":[\"Tri Tiling\",2733,null],\"ZOJ-1189\":[\"Numbers That Count\",268,null],\"ZOJ-1188\":[\"DNA Sorting\",3126,null],\"ZOJ-1186\":[\"Street Directions\",138,null],\"UVA-543\":[\"Goldbach\\u0027s Conjecture\",18546,null],\"ZOJ-1180\":[\"Self Numbers\",4556,null],\"POJ-1061\":[\"青蛙的约会\",23285,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E6%B5%99%E6%B1%9F\\\"\\u003e浙江\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2234\":[\"Matches Game\",7209,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,readchild\\u003c/div\\u003e\"],\"HDU-1722\":[\"Cake\",3945,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHZIEE+2007+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HZIEE 2007 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2116\":[\"Death to Binary?\",810,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2004\\\"\\u003eCTU Open 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1724\":[\"Ellipse\",1144,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHZIEE+2007+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HZIEE 2007 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2356\":[\"Find a multiple\",3850,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+Collegiate+Programming+Contest+1999\\\"\\u003eUral Collegiate Programming Contest 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3688\":[\"Cheat in the Game\",406,\"\\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.08.31\\\"\\u003ePOJ Founder Monthly Contest – 2008.08.31\\u003c/a\\u003e, facer\\u003c/div\\u003e\"],\"POJ-2478\":[\"Farey Sequence\",7215,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Contest\\\"\\u003ePOJ Contest\\u003c/a\\u003e,Author:Mathematica@ZSU\\u003c/div\\u003e\"],\"POJ-2599\":[\"A funny game\",641,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+collegiate+programming+contest+2000\\\"\\u003eUral State University collegiate programming contest 2000\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2115\":[\"C Looooops\",8030,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+2004\\\"\\u003eCTU Open 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"URAL-1540\":[\"Battle for the Ring\",472,\"VIII USU Open Personal Contest (March 3, 2007)\"],\"UVA-10900\":[\"So you want to be a 2n-aire?\",1037,null],\"SCU-3502\":[\"The Almost Lucky Numbers\",42,null],\"UVALive-3357\":[\"Pinary\",171,\"Regionals 2005 \\u003e\\u003e Asia - Seoul\"],\"UVALive-4330\":[\"Timer\",68,\"Regionals 2008 \\u003e\\u003e Asia - Beijing\"],\"UVA-756\":[\"Biorhythms\",1937,null],\"SPOJ-LARGE\":[\"Large party\",39,\"IPSC 2008\"],\"UVALive-3485\":[\"Bridge\",230,\"Regionals 2005 \\u003e\\u003e Asia - Hangzhou\"],\"UVA-516\":[\"Prime Land\",3689,null],\"HDU-1717\":[\"小数化分数2\",2591,\"\\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%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-1198\":[\"Single-Player Games\",30,null],\"HDU-5080\":[\"Colorful Toy\",255,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Asia+AnShan+Regional+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Asia AnShan Regional Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-2480\":[\"Longge\\u0027s problem\",2776,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Contest\\\"\\u003ePOJ Contest\\u003c/a\\u003e,Author:Mathematica@ZSU\\u003c/div\\u003e\"],\"POJ-1150\":[\"The Last Non-zero Digit\",1460,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003duva+10212\\\"\\u003euva 10212\\u003c/a\\u003e\\u003c/div\\u003e\"],\"CodeForces-492E\":[\"Vanya and Field\",1687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/492\\\"\\u003eCodeforces Round 280 (Div. 2)\\u003c/a\\u003e\"],\"POJ-2369\":[\"Permutations\",1624,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%272000+Junior+Session\\\"\\u003eUral State University Internal Contest October\\u00272000 Junior Session\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2368\":[\"Buttons\",1122,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUral+State+University+Internal+Contest+October%272000+Junior+Session\\\"\\u003eUral State University Internal Contest October\\u00272000 Junior Session\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-5769\":[\"Ji-Tu Problem\",12,\"Regionals 2011 \\u003e\\u003e Asia - Chengdu\"],\"HDU-1730\":[\"Northcott Game\",2231,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B0%CD%F8%D0%C2%B6%F7%C6%D5%B1%AD%A1%B1%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e “网新恩普杯”杭州电子科技大学程序设计邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-766\":[\"Sum of powers\",245,null],\"UVA-406\":[\"Prime Cuts\",10988,null],\"SGU-520\":[\"Fire in the Country\",180,null],\"HDU-2818\":[\"Building Block\",1561,\"\\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\"],\"HDU-1729\":[\"Stone Game\",1144,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B0%CD%F8%D0%C2%B6%F7%C6%D5%B1%AD%A1%B1%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e “网新恩普杯”杭州电子科技大学程序设计邀请赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-880\":[\"Cantor Fractions\",1834,null],\"POJ-1284\":[\"Primitive Roots\",3138,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003d%E8%B4%BE%E6%80%A1%40pku\\\"\\u003e贾怡@pku\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-3139\":[\"Kid\\u0027s Problem\",20,\"Regionals 2004 \\u003e\\u003e Asia - Beijing\"],\"UVA-10847\":[\"Basic Tautologies\",72,null],\"UVA-10844\":[\"Bloques\",275,null],\"UVA-10601\":[\"Cubes\",750,null],\"SPOJ-TSUM\":[\"Triple Sums\",661,\"own problem, used for a contest on codechef\"],\"UVALive-3262\":[\"Different Digits\",61,\"Regionals 2004 \\u003e\\u003e Asia - Shanghai\"],\"UVALive-4352\":[\"Binary Integer\",11,\"Regionals 2008 \\u003e\\u003e Asia - Hangzhou\"],\"UVALive-4353\":[\"Cryptography Reloaded\",40,\"Regionals 2008 \\u003e\\u003e Asia - Hangzhou\"],\"POJ-3153\":[\"Fool\\u0027s Game\",20,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2006\\\"\\u003eNortheastern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2068\":[\"Nim\",1238,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dJapan+2001\\\"\\u003eJapan 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1090\":[\"Trailing Zeroes (II)\",2469,null],\"HDU-1756\":[\"Cupid\\u0027s Arrow\",944,\"\\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\"],\"HDU-1755\":[\"A Number Puzzle\",465,\"\\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\"],\"CodeForces-450B\":[\"Jzzhu and Sequences\",27883,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/450\\\"\\u003eCodeforces Round 257 (Div. 2)\\u003c/a\\u003e\"],\"HDU-1757\":[\"A Simple Math Problem\",4323,\"\\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\"],\"HDU-1517\":[\"A Multiplication Game\",4033,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Waterloo+Local+Contest+2001.09.22\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2001.09.22 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1098\":[\"A New Function\",1699,null],\"SPOJ-BINSTIRL\":[\"Binary Stirling Numbers\",2643,\"ACM Central European Programming Contest, Warsaw 2001\"],\"UVA-10831\":[\"Gerg\\u0027s Cake\",329,null],\"HDU-1510\":[\"White Rectangles\",522,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZOJ+Monthly%2C+January+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZOJ Monthly, January 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10951\":[\"Polynomial GCD\",257,null],\"UVA-10830\":[\"A New Function\",756,null],\"UVA-10837\":[\"A Research Problem\",326,null],\"UVA-11806\":[\"Cheerleaders\",2450,null],\"UVA-1079\":[\"A Careful Approach\",515,null],\"HDU-1402\":[\"A * B Problem Plus\",4623,\"\"],\"POJ-1067\":[\"取石子游戏\",14671,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNOI\\\"\\u003eNOI\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-2154\":[\"Color\",2377,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e,Lou Tiancheng\\u003c/div\\u003e\"],\"HDU-1404\":[\"Digital Deletions\",1128,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZhejiang+University+Local+Contest+2006+Preliminary\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Zhejiang University Local Contest 2006 Preliminary \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1524\":[\"A Chess Game\",1011,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPKU+Monthly\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e PKU Monthly \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-2742\":[\"Akai的数学作业\",3,\"HEOI2012\"],\"HDU-1405\":[\"The Last Practice\",2545,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8IV%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(IV) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"POJ-3126\":[\"Prime Path\",19552,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNorthwestern+Europe+2006\\\"\\u003eNorthwestern Europe 2006\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10824\":[\"Regular Polygon\",202,null],\"UVA-10943\":[\"How do you add?\",7454,null],\"LightOJ-1065\":[\"Number Sequence\",1463,null],\"LightOJ-1186\":[\"Incredible Chess\",2086,null],\"UVA-10820\":[\"Send a Table\",3832,null],\"LightOJ-1067\":[\"Combinations\",4279,null],\"HDU-1760\":[\"A New Tetris Game\",732,\"\\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\"],\"HDU-1521\":[\"排列组合\",2455,\"\"],\"HDU-2971\":[\"Tower\",428,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+European+Programming+Contest+2008\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central European Programming Contest 2008 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-5101\":[\"Math teacher\\u0027s homework\",81,\"Regionals 2010 \\u003e\\u003e Asia - Fuzhou\"],\"UVA-10828\":[\"Back to Kernighan-Ritchie\",460,null],\"UVA-11916\":[\"Emoogle Grid\",611,null],\"UVA-713\":[\"Adding Reversed Numbers\",9695,null],\"POJ-2164\":[\"Find the Border\",123,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dNortheastern+Europe+2004\\\"\\u003eNortheastern Europe 2004\\u003c/a\\u003e\\u003c/div\\u003e\"],\"POJ-3378\":[\"Crazy Thairs\",1213,\"\\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, tdzl2003\\u003c/div\\u003e\"],\"HDU-1536\":[\"S-Nim\",3345,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dNorgesmesterskapet+2004\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Norgesmesterskapet 2004 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1070\":[\"Algebraic Problem\",1113,null],\"LightOJ-1192\":[\"Left Right\",2033,null],\"HDU-1418\":[\"抱歉\",2757,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%D2%BB%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(一) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-1407\":[\"Savage\",118,\"Noi2002\"],\"LightOJ-1197\":[\"Help Hanzo\",3003,null],\"UVALive-4119\":[\"Always an integer\",612,\"World Finals \\u003e\\u003e 2008 - Banff\"],\"UVA-10812\":[\"Beat the Spread!\",23249,null],\"LightOJ-1077\":[\"How Many Points?\",2616,null],\"LightOJ-1199\":[\"Partitioning Game\",1057,null],\"LightOJ-1079\":[\"Just another Robbery\",2068,null],\"UVALive-4123\":[\"Glenbow Museum\",651,\"World Finals \\u003e\\u003e 2008 - Banff\"],\"UVALive-4485\":[\"Crossing Rivers\",334,\"Regionals 2009 \\u003e\\u003e Asia - Wuhan\"],\"UVA-846\":[\"Steps\",7514,null],\"POJ-1082\":[\"Calendar Game\",2908,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dTaejon+2001\\\"\\u003eTaejon 2001\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11971\":[\"Polygon\",716,null],\"UVA-10640\":[\"Planes around the World\",166,null],\"UVA-10883\":[\"Supermean\",936,null],\"Gym-100761H\":[\"Hero of Our Time\",23,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100761\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2009 Halloween Contest + Misc\\u003c/a\\u003e\"],\"HDU-1788\":[\"Chinese remainder theorem again\",1450,\"\\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%A810%A3%A9_%D2%D4%B4%CB%B8%D0%D0%BBDOOMIII\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(10)_以此感谢DOOMIII \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1160\":[\"Discovering Paths in Grid\",187,null],\"HDU-1309\":[\"Loansome Car Buyer\",132,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1282\":[\"Leading and Trailing\",3671,null],\"UVA-10648\":[\"Chocolate Box\",423,null],\"LightOJ-1163\":[\"Bank Robbery\",1290,null],\"LightOJ-1284\":[\"Lights inside 3D Grid\",465,null],\"UVA-10407\":[\"Simple division\",4742,null],\"UVA-11859\":[\"Division Game\",457,null],\"UVA-10886\":[\"Standard Deviation\",357,null],\"LightOJ-1045\":[\"Digits of Factorial\",6652,null],\"LightOJ-1287\":[\"Where to Run?\",452,null],\"UVA-10644\":[\"Floor Tiles\",170,null],\"UVA-10766\":[\"Organising the Organisation\",604,null],\"LightOJ-1288\":[\"Subsets Forming Perfect Squares\",143,null],\"UVA-10884\":[\"Persephone\",103,null],\"HDU-1785\":[\"You Are All Excellent\",1846,\"\\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%A810%A3%A9_%D2%D4%B4%CB%B8%D0%D0%BBDOOMIII\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2007省赛集训队练习赛(10)_以此感谢DOOMIII \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10885\":[\"Martin the Gardener\",88,null],\"LightOJ-1038\":[\"Race to 1 Again\",3225,null],\"UVA-138\":[\"Street Numbers\",8146,null],\"UVALive-4270\":[\"Discrete Square Roots\",143,\"Regionals 2008 \\u003e\\u003e Asia - Hefei\"],\"UVA-374\":[\"Big Mod\",24426,null],\"UVALive-4390\":[\"Counting heaps\",164,\"Regionals 2008 \\u003e\\u003e Europe - Central\"],\"POJ-3191\":[\"The Moronic Cowmpouter\",1905,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dUSACO+2006+February+Bronze\\\"\\u003eUSACO 2006 February Bronze\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-136\":[\"Ugly Numbers\",31814,null],\"HDU-1798\":[\"Tell me the area\",1050,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Insigma+International+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A84%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(4) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10871\":[\"Primed Subsequence\",1408,null],\"UVA-10870\":[\"Recurrences\",2362,null],\"HDU-1799\":[\"循环多少次?\",2729,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Insigma+International+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A84%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(4) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1172\":[\"Krypton Number System\",57,null],\"HDU-1319\":[\"Prime Cuts\",1088,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouth+Central+USA+1996\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e South Central USA 1996 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1052\":[\"String Growth\",444,null],\"UVA-11605\":[\"Lights inside a 3d Grid\",271,null],\"LightOJ-1296\":[\"Again Stone Game\",1003,null],\"UVA-10515\":[\"Powers Et Al.\",3533,null],\"UVALive-3288\":[\"Harmonic Mean\",646,\"Regionals 2005 \\u003e\\u003e Asia - Dhaka\"],\"UVA-10633\":[\"Rare Easy Problem\",3643,null],\"UVA-11722\":[\"Joining with Friend\",824,null],\"SPOJ-CANTON\":[\"Count on Cantor\",13111,\"ACM South Eastern European Region 2004\"],\"HDU-1796\":[\"How many integers can you find\",3183,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2008+%A1%B0Insigma+International+Cup%A1%B1+Zhejiang+Collegiate+Programming+Contest+-+Warm+Up%A3%A84%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Insigma International Cup” Zhejiang Collegiate Programming Contest - Warm Up(4) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HYSBZ-2956\":[\"模积和\",105,\"\\u003cp\\u003e\\u003ca href\\u003d\\\"http://www.lydsy.com/JudgeOnline/problemset.php?search\\u003d中国国家队清华集训 2012-2013 第一天\\\"\\u003e中国国家队清华集训 2012-2013 第一天\\u003c/a\\u003e\\u003c/p\\u003e\"],\"UVALive-4258\":[\"Metal\",41,\"Regionals 2008 \\u003e\\u003e Asia - Seoul\"],\"UVALive-3295\":[\"Counting Triangles\",328,\"Regionals 2005 \\u003e\\u003e Asia - Dhaka\"],\"UVALive-4384\":[\"Business Cards\",150,\"Regionals 2008 \\u003e\\u003e Europe - Central\"],\"ZOJ-1222\":[\"Just the Facts\",750,null],\"UVA-11609\":[\"Teams\",2549,null],\"UVA-10518\":[\"How Many Calls?\",1730,null],\"UVA-11728\":[\"Alternate Task\",3333,null],\"ZOJ-2674\":[\"Strange Limit\",766,null],\"UVALive-4382\":[\"YAPTCHA\",406,\"Regionals 2008 \\u003e\\u003e Europe - Central\"],\"UVA-264\":[\"Count on Cantor\",10756,null],\"SGU-106\":[\"The equation\",1296,\"\"],\"UVA-147\":[\"Dollars\",12223,null],\"UVA-389\":[\"Basically Speaking\",5135,null],\"UVA-146\":[\"ID Codes\",16595,null],\"HDU-1568\":[\"Fibonacci\",3021,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1329\":[\"Hanoi Tower Troubles Again!\",777,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dOIBH+Reminiscence+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e OIBH Reminiscence Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"CodeForces-138D\":[\"World of Darkraft\",563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/138\\\"\\u003eCodeforces Beta Round 99 (Div. 1)\\u003c/a\\u003e\"],\"UVA-10868\":[\"Bungee Jumping\",474,null],\"LightOJ-1142\":[\"Summing up Powers (II)\",474,null],\"UVA-10622\":[\"Perfect P-th Powers\",3718,null],\"LightOJ-1265\":[\"Island of Survival\",1409,null],\"LightOJ-1024\":[\"Eid\",1692,null],\"UVA-10862\":[\"Connect the Cable Wires\",1570,null],\"HDU-1564\":[\"Play a game\",4039,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHappy+2007\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Happy 2007 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-4049\":[\"Game\",50,\"Regionals 2007 \\u003e\\u003e Europe - Northeastern\"],\"LightOJ-1268\":[\"Unlucky Strings\",466,null],\"HDU-1322\":[\"Floppies\",316,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouthwestern+Europe+1996%2C+Practice\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Southwestern Europe 1996, Practice \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1138\":[\"Trailing Zeroes (III)\",6992,null],\"LightOJ-1259\":[\"Goldbach\\u0027s Conjecture\",5970,null],\"ZOJ-1238\":[\"Guess the Number\",342,null],\"POJ-3292\":[\"Semi-prime H-numbers\",4496,\"\\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\"],\"UVA-113\":[\"Power of Cryptography\",23970,null],\"UVA-355\":[\"The Bases Are Loaded\",3465,null],\"POJ-2084\":[\"Game of Connections\",3519,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dShanghai+2004+Preliminary\\\"\\u003eShanghai 2004 Preliminary\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1215\":[\"七夕节\",13677,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM省赛集训队选拔赛之热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1336\":[\"Word Index\",297,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+1995\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 1995 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1214\":[\"圆桌会议\",4802,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM省赛集训队选拔赛之热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1335\":[\"Basically Speaking\",1669,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+1995\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 1995 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4965\":[\"Fast Matrix Calculation\",1113,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2014+Multi-University+Training+Contest+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2014 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1216\":[\"Assistance Required\",1470,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+2002\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 2002 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVALive-5009\":[\"Error Curves\",564,\"Regionals 2010 \\u003e\\u003e Asia - ChengDu\"],\"LightOJ-1030\":[\"Discovering Gold\",3543,null],\"LightOJ-1151\":[\"Snakes and Ladders\",711,null],\"LightOJ-1272\":[\"Maximum Subset Sum\",232,null],\"LightOJ-1393\":[\"Crazy Calendar\",884,null],\"HDU-1570\":[\"A C\",4335,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-1 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1274\":[\"Beating the Dataset\",478,null],\"LightOJ-1395\":[\"A Dangerous Maze (II)\",282,null],\"HDU-1330\":[\"Deck\",1598,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouth+Central+USA+1998\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e South Central USA 1998 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1695\":[\"GCD\",4761,\"\\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-10853\":[\"Pablito nailed a nail\",87,null],\"UVA-10733\":[\"The Colored Cubes\",789,null],\"HDU-1210\":[\"Eddy\\u0027s 洗牌问题\",3739,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM省赛集训队选拔赛之热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1035\":[\"Intelligent Factorial Factorization\",4991,null],\"HDU-1573\":[\"X问题\",2492,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-1 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1452\":[\"Happy 2004\",1648,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%C1%F9%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(六) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1278\":[\"Sum of Consecutive Integers\",1148,null],\"HDU-1575\":[\"Tr A\",5956,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2007-1+Programming+Contest\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-1 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1212\":[\"Big Number\",6707,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%CA%A1%C8%FC%BC%AF%D1%B5%B6%D3%D1%A1%B0%CE%C8%FC%D6%AE%C8%C8%C9%ED%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM省赛集训队选拔赛之热身赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10852\":[\"Less Prime\",3790,null],\"LightOJ-1279\":[\"Graph Coloring\",224,null],\"HDU-1333\":[\"Smith Numbers\",618,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+European+Regional+Contest+2000\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central European Regional Contest 2000 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1027\":[\"A Dangerous Maze\",3984,null],\"LightOJ-1028\":[\"Trailing Zeroes (I)\",3979,null],\"UVA-369\":[\"Combinations\",15833,null],\"UVA-11827\":[\"Maximum GCD\",8877,null],\"UVA-482\":[\"Permutation Arrays\",7289,null],\"UVA-10200\":[\"Prime Time\",4145,null],\"HDU-1588\":[\"Gauss Fibonacci\",1304,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+%A1%B0Valentines+Day%A1%B1+Open+Programming+Contest+2007-02-14\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU “Valentines Day” Open Programming Contest 2007-02-14 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11895\":[\"Honorary Tickets\",132,null],\"UVA-11774\":[\"Doom\\u0027s Day\",768,null],\"UVA-11892\":[\"ENimEN\",901,null],\"UVA-10561\":[\"Treblecross\",752,null],\"UVA-11651\":[\"Krypton Number System\",266,null],\"SPOJ-PEBBMOV\":[\"Moving Pebbles\",25,\"\"],\"HDU-1108\":[\"最小公倍数\",39896,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dPOJ\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e POJ \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-12508\":[\"Triangles in the Grid\",103,null],\"HDU-1220\":[\"Cube\",2296,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B5%DA%C8%FD%BD%EC%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭州电子科技大学第三届程序设计大赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10207\":[\"The Unreal Tournament\",232,null],\"UVA-11538\":[\"Chess Queen\",3496,null],\"HDU-1222\":[\"Wolf and Rabbit\",5587,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B5%DA%C8%FD%BD%EC%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭州电子科技大学第三届程序设计大赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1364\":[\"Expected Cards\",417,null],\"HDU-1221\":[\"Rectangle and Circle\",901,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B5%DA%C8%FD%BD%EC%B3%CC%D0%F2%C9%E8%BC%C6%B4%F3%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭州电子科技大学第三届程序设计大赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1244\":[\"Tiles\",596,null],\"HDU-1100\":[\"Trees Made to Order\",1069,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10689\":[\"Yet another Number Sequence\",2481,null],\"LightOJ-1245\":[\"Harmonic Number (II)\",2897,null],\"HDU-1465\":[\"不容易系列之一\",12353,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dACM%CA%EE%C6%DA%BC%AF%D1%B5%B6%D3%C1%B7%CF%B0%C8%FC%A3%A8%BE%C5%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ACM暑期集训队练习赛(九) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1236\":[\"Pairs Forming LCM\",2659,null],\"UVALive-4079\":[\"Gauss Prime\",62,\"Regionals 2007 \\u003e\\u003e Asia - Changchun\"],\"ZOJ-2344\":[\"Toral Tickets\",176,null],\"UVALive-4190\":[\"GCD Determinant\",153,\"Regionals 2008 \\u003e\\u003e Europe - Southeastern\"],\"UVA-697\":[\"Jack and Jill\",298,null],\"UVA-575\":[\"Skew Binary\",15911,null],\"UVA-10673\":[\"Play with Floor and Ceil\",4516,null],\"UVA-11762\":[\"Race to 1\",1290,null],\"UVA-10790\":[\"How Many Points of Intersection?\",3638,null],\"Aizu-0005\":[\"GCD and LCM\",12048,\"1st PC Koshien, Final\"],\"UVA-10791\":[\"Minimum Sum LCM\",4815,null],\"POJ-1930\":[\"Dead Fraction\",1712,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2003.09.27\\\"\\u003eWaterloo local 2003.09.27\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1370\":[\"Bi-shoe and Phi-shoe\",4673,null],\"UVA-11529\":[\"Strange Tax Calculation\",205,null],\"UVA-11526\":[\"H(n)\",4500,null],\"HDU-1594\":[\"find the max\",482,\"\\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+-+Warm+Up+%A3%A81%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2007-Spring Programming Contest - Warm Up (1) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11889\":[\"Benefit\",3160,null],\"UVA-11768\":[\"Lattice Point or Not\",336,null],\"LightOJ-1131\":[\"Just Two Functions\",1002,null],\"HDU-1110\":[\"Equipment Box\",652,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dCentral+Europe+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Central Europe 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1352\":[\"I Conduit!\",85,\"\"],\"POJ-1811\":[\"Prime Test\",4141,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dPOJ+Monthly\\\"\\u003ePOJ Monthly\\u003c/a\\u003e\\u003c/div\\u003e\"],\"LightOJ-1132\":[\"Summing up Powers\",720,null],\"LightOJ-1253\":[\"Misere Nim\",1956,null],\"UVA-11645\":[\"Bits\",457,null],\"LightOJ-1376\":[\"Tetromino\",12,null],\"UVA-11401\":[\"Triangle Counting\",5523,null],\"UVA-11885\":[\"Number of Battlefields\",199,null],\"UVALive-5028\":[\"Delta Wave\",105,\"Regionals 2010 \\u003e\\u003e Asia - Tianjin\"],\"UVA-107\":[\"The Cat in the Hat\",6577,null],\"LightOJ-1247\":[\"Matrix Game\",1888,null],\"UVA-106\":[\"Fermat vs. Pythagoras\",4980,null],\"LightOJ-1248\":[\"Dice (III)\",2071,null],\"LightOJ-1007\":[\"Mathematically Hard\",4504,null],\"FZU-1911\":[\"Construct a Matrix\",186,\"2010年全国大学生程序设计邀请赛(福州)\"],\"UVALive-4064\":[\"Magnetic Train Tracks\",190,\"Regionals 2007 \\u003e\\u003e Asia - Dhaka\"],\"ZOJ-2113\":[\"XX Language\",61,null],\"UVA-583\":[\"Prime Factors\",11202,null],\"Aizu-0009\":[\"Prime Number\",10758,\"1st PC Koshien, Final\"],\"UVALive-4060\":[\"The Bells are Ringing\",196,\"Regionals 2007 \\u003e\\u003e Asia - Dhaka\"],\"UVA-580\":[\"Critical Mass\",3535,null],\"UVA-343\":[\"What Base Is This?\",3723,null],\"HDU-1248\":[\"寒冰王座\",11958,\"\"],\"UVA-10783\":[\"Odd Sum\",40325,null],\"UVA-11752\":[\"The Super Powers\",2184,null],\"SPOJ-CMPLS\":[\"Complete the Sequence!\",4433,\"ACM Central European Programming Contest, Prague 2000\"],\"HDU-1249\":[\"三角形\",5991,\"\"],\"UVA-10780\":[\"Again Prime? No Time.\",2941,null],\"HDU-4992\":[\"Primitive Roots\",296,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%238\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10789\":[\"Prime Frequency\",6959,null],\"UVA-10668\":[\"Expanding Rods\",832,null],\"HDU-4990\":[\"Reading comprehension\",1441,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dBestCoder+Round+%238\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e BestCoder Round #8 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1220\":[\"Mysterious Bacteria\",2688,null],\"LightOJ-1341\":[\"Aladdin and the Flying Carpet\",3207,null],\"UVA-11637\":[\"Garbage Remembering Exam\",176,null],\"LightOJ-1342\":[\"Aladdin and the Magical Sticks\",362,null],\"UVALive-5059\":[\"Playing With Stones\",1057,\"Regionals 2010 \\u003e\\u003e Asia - Jakarta\"],\"LightOJ-1344\":[\"Aladdin and the Game of Bracelets\",171,null],\"UVA-10302\":[\"Summation of Polynomials\",10883,null],\"UVA-11754\":[\"Code Feat\",784,null],\"LightOJ-1214\":[\"Large Division\",9478,null],\"LightOJ-1215\":[\"Finding LCM\",2641,null],\"LightOJ-1336\":[\"Sigma Function\",2857,null],\"UVA-557\":[\"Burger\",1253,null],\"UVA-11982\":[\"Fantasy Cricket\",155,null],\"HDU-1259\":[\"ZJUTACM\",2704,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1019\":[\"Least Common Multiple\",21577,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+2003%2C+Practice\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 2003, Practice \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1018\":[\"Big Number\",21437,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2002%2C+Dhaka+%28Bengal%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2002, Dhaka (Bengal) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10892\":[\"LCM Cardinality\",4560,null],\"HDU-1492\":[\"The number of divisors(约数) about Humble Numbers\",2508,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%A1%B02006%D0%A3%D4%B0%CE%C4%BB%AF%BB%EE%B6%AF%D4%C2%A1%B1%D6%AE%A1%B0%D0%A3%C7%EC%B1%AD%A1%B1%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC%F4%DF%BA%BC%D6%DD%B5%E7%D7%D3%BF%C6%BC%BC%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e “2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1250\":[\"Hat\\u0027s Fibonacci\",3988,\"\"],\"UVA-10539\":[\"Almost Prime Numbers\",4293,null],\"UVA-12716\":[\"GCD XOR\",2440,null],\"HDU-1374\":[\"The Circumference of the Circle\",773,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Ulm+Local+Contest+1996\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Ulm Local Contest 1996 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10778\":[\"Mathemagicland\",25,null],\"HDU-1376\":[\"Octal Fractions\",398,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouth+Africa+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e South Africa 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10655\":[\"Contemplation! Algebra\",1478,null],\"SPOJ-TWOSQRS\":[\"Two squares or not two squares\",6312,\"\"],\"LightOJ-1234\":[\"Harmonic Number\",3630,null],\"LightOJ-1355\":[\"Game of CS\",210,null],\"UVA-10533\":[\"Digit Primes\",6777,null],\"LightOJ-1356\":[\"Prime Independence\",931,null],\"UVA-10775\":[\"Mystical Matrix\",114,null],\"LightOJ-1104\":[\"Birthday Paradox\",2490,null],\"LightOJ-1229\":[\"Treblecross\",309,null],\"LightOJ-1109\":[\"False Ordering\",6085,null],\"HDU-2580\":[\"a simple stone game\",260,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dECJTU+2009+Spring+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ECJTU 2009 Spring Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1370\":[\"Biorhythms\",2000,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dEast+Central+North+America+1999%3B+Pacific+Northwest+1999\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e East Central North America 1999; Pacific Northwest 1999 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-3341\":[\"Voyager 1\",97,null],\"UVA-443\":[\"Humble Numbers\",6239,null],\"HDU-1028\":[\"Ignatius and the Princess III\",16400,\"\"],\"HDU-1027\":[\"Ignatius and the Princess II\",9552,\"\"],\"SPOJ-MARBLES\":[\"Marbles\",8182,\"own problem\"],\"POJ-2931\":[\"Procrastination\",168,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dMIT+Programming+Contest+2005\\\"\\u003eMIT Programming Contest 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11330\":[\"Andy\\u0027s Shoes\",487,null],\"HDU-1261\":[\"字串数\",1445,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%D5%E3%BD%AD%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CB%C4%BD%EC%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 浙江工业大学第四届大学生程序设计竞赛 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10006\":[\"Carmichael Numbers\",10929,null],\"UVA-10007\":[\"Count the Trees\",2899,null],\"LightOJ-1321\":[\"Sending Packets\",574,null],\"UVA-10247\":[\"Complete Tree Labeling\",910,null],\"LightOJ-1315\":[\"Game of Hyper Knights\",859,null],\"URAL-1091\":[\"Tmutarakan Exams\",2771,\"USU Open Collegiate Programming Contest March\\u00272001 Senior Session\"],\"LightOJ-1317\":[\"Throwing Balls into the Baskets\",1128,null],\"UVA-10233\":[\"Dermuba Triangle\",1308,null],\"HDU-4549\":[\"M斐波那契数列\",1929,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013%BD%F0%C9%BD%CE%F7%C9%BD%BE%D3%B4%B4%D2%E2%D3%CE%CF%B7%B3%CC%D0%F2%CC%F4%D5%BD%C8%FC%A1%AA%A1%AA%B3%F5%C8%FC%A3%A82%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013金山西山居创意游戏程序挑战赛——初赛(2) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10110\":[\"Light, more light\",24390,null],\"UVA-10473\":[\"Simple Base Conversion\",6331,null],\"POJ-3910\":[\"GCD Determinant\",273,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dSoutheastern+European+Regional+Programming+Contest+2008\\\"\\u003eSoutheastern European Regional Programming Contest 2008\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVALive-2911\":[\"Maximum\",235,\"Regionals 2006 \\u003e\\u003e Europe - Southeastern\"],\"UVA-11440\":[\"Help Tomisu\",662,null],\"POJ-1730\":[\"Perfect Pth Powers\",3332,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dWaterloo+local+2004.01.31\\\"\\u003eWaterloo local 2004.01.31\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1273\":[\"漫步森林\",2486,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-4+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-4 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1396\":[\"Counting Triangles\",1619,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dZOJ+Monthly%2C+June+2003\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e ZOJ Monthly, June 2003 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1275\":[\"两车追及或相遇问题\",572,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VI%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VI) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1153\":[\"Magic Bitstrings\",332,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Waterloo+Local+Contest+2005.06.11\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2005.06.11 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1398\":[\"Square Coins\",7744,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+1999%2C+Kyoto+%28Japan%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 1999, Kyoto (Japan) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10237\":[\"Bishops\",562,null],\"UVA-10479\":[\"The Hendrie Sequence\",437,null],\"HDU-1155\":[\"Bungee Jumping\",689,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dUniversity+of+Waterloo+Local+Contest+2005.06.11\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e University of Waterloo Local Contest 2005.06.11 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"LightOJ-1332\":[\"Kings in Chessboard\",241,null],\"UVA-12535\":[\"Probability Through Experiments\",217,null],\"HDU-3334\":[\"Matrix Puzzle\",15,\"\\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\"],\"LightOJ-1213\":[\"Fantasy of a Summation\",2133,null],\"UVA-12413\":[\"Big Decimal Calculator\",30,null],\"HDU-1271\":[\"整数对\",1148,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dHDU+2006-4+Programming+Contest+\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e HDU 2006-4 Programming Contest \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-3469\":[\"Catching the Thief\",420,\"\\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%A84%A3%A9%A1%AA%A1%AAHost+by+UESTC\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2010 ACM-ICPC Multi-University Training Contest(4)——Host by UESTC \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10341\":[\"Solve It\",9695,null],\"UVA-11551\":[\"Experienced Endeavour\",497,null],\"UVA-12520\":[\"Square Garden\",289,null],\"UVALive-2708\":[\"Necklace of Beads\",0,\"Regionals 2002 \\u003e\\u003e Asia - Xian\"],\"HDU-3221\":[\"Brute-force Algorithm\",621,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2009+Asia+Shanghai+Regional+Contest+Host+by+DHU\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2009 Asia Shanghai Regional Contest Host by DHU \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1284\":[\"钱币兑换问题\",7619,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1286\":[\"找新朋友\",7346,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1164\":[\"Eddy\\u0027s research I\",7297,\"\"],\"UVA-10229\":[\"Modular Fibonacci\",4835,null],\"UVA-10347\":[\"Medians\",5344,null],\"HDU-1288\":[\"Hat\\u0027s Tea\",538,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10469\":[\"To Carry or not to Carry\",16623,null],\"POJ-1704\":[\"Georgia and Bob\",4834,\"\\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\"],\"UVA-10104\":[\"Euclid Problem\",10926,null],\"UVA-195\":[\"Anagram\",7909,null],\"UVA-11542\":[\"Square\",880,null],\"UVA-10696\":[\"f91\",22294,null],\"UVA-11540\":[\"Sultan\\u0027s Chandelier\",79,null],\"UVA-10692\":[\"Huge Mods\",746,null],\"UVA-1213\":[\"Sum of Different Primes\",3871,null],\"UVA-11429\":[\"Randomness\",91,null],\"HDU-1295\":[\"Move Move Look\",726,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1294\":[\"Rooted Trees Problem\",298,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11427\":[\"Expect the Expected\",957,null],\"HDU-1299\":[\"Diophantus of Alexandria\",1130,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dTUD+Programming+Contest+2006\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e TUD Programming Contest 2006 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10699\":[\"Count the factors\",10348,null],\"UVA-11426\":[\"GCD - Extreme (II)\",4339,null],\"HDU-1056\":[\"HangOver\",7335,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Central+USA+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Central USA 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10213\":[\"How Many Pieces of Land ?\",3099,null],\"HDU-4565\":[\"So Easy!\",1762,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d2013+ACM-ICPC%B3%A4%C9%B3%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 ACM-ICPC长沙赛区全国邀请赛——题目重现 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-4686\":[\"Arc of Dream\",1476,\"\\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+9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2013 Multi-University Training Contest 9 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-10214\":[\"Trees in a Wood.\",918,null],\"UVA-11303\":[\"Permutations\",73,null],\"ZOJ-2614\":[\"Bridge\",283,null],\"UVALive-5096\":[\"Volume\",86,\"Regionals 2010 \\u003e\\u003e Asia - Harbin\"],\"HDU-1290\":[\"献给杭电五十周年校庆的礼物\",7224,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003d%BA%BC%B5%E7ACM%BC%AF%D1%B5%B6%D3%D1%B5%C1%B7%C8%FC%A3%A8VIII%A3%A9\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 杭电ACM集训队训练赛(VIII) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1171\":[\"Big Event in HDU\",11724,\"\"],\"UVA-1575\":[\"Factors\",332,null],\"UVALive-5092\":[\"Permutation Counting\",192,\"Regionals 2010 \\u003e\\u003e Asia - Harbin\"],\"UVA-1210\":[\"Sum of Consecutive Prime Numbers\",3774,null],\"UVA-10288\":[\"Coupons\",1728,null],\"UVA-11014\":[\"Make a Crystal\",236,null],\"UVALive-2729\":[\"The Solar System\",148,\"World Finals \\u003e\\u003e 2003 - Beverly Hills\"],\"UVA-10047\":[\"The Monocycle\",3115,null],\"UVA-10168\":[\"Summation of Four Primes\",8050,null],\"UVA-11255\":[\"Necklace\",465,null],\"UVA-10042\":[\"Smith Numbers\",5332,null],\"POJ-2975\":[\"Nim\",3340,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dStanford+Local+2005\\\"\\u003eStanford Local 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-10161\":[\"Ant on a Chessboard\",9303,null],\"UVA-10041\":[\"Vito\\u0027s Family\",23183,null],\"ZOJ-2619\":[\"Generator\",413,null],\"HDU-1066\":[\"Last non-zero Digit in N!\",2162,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dSouth+Central+USA+1997\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e South Central USA 1997 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"HDU-1065\":[\"I Think I Need a Houseboat\",3944,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dMid-Atlantic+USA+2001\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Mid-Atlantic USA 2001 \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11139\":[\"Counting Quadrilaterals\",68,null],\"POJ-3708\":[\"Recurrent Function\",255,\"\\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.12.28\\\"\\u003ePOJ Founder Monthly Contest – 2008.12.28\\u003c/a\\u003e, Yaojinyu\\u003c/div\\u003e\"],\"UVA-10049\":[\"Self-describing Sequence\",3086,null],\"SGU-491\":[\"Game for Little Johnny\",51,null],\"SPOJ-EIGHTS\":[\"Triple Fat Ladies\",19192,\"Al-Khawarizm 2006\"],\"HDU-1060\":[\"Leftmost Digit\",7737,\"\"],\"HDU-1061\":[\"Rightmost Digit\",26548,\"\"],\"UVA-12590\":[\"Guards II\",57,null],\"UVA-294\":[\"Divisors\",12752,null],\"UVA-10035\":[\"Primary Arithmetic\",30460,null],\"UVA-1639\":[\"Candy\",840,null],\"UVA-10157\":[\"Expressions\",1073,null],\"UVA-11246\":[\"K-Multiple Free set \",920,null],\"UVA-12212\":[\"Password Remembering\",114,null],\"UVA-10394\":[\"Twin Primes\",11097,null],\"UVALive-2955\":[\"Vivian\\u0027s Problem\",81,\"Regionals 2003 \\u003e\\u003e Asia - Guangzhou\"],\"POJ-3710\":[\"Christmas Game\",733,\"\\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.12.28\\\"\\u003ePOJ Founder Monthly Contest – 2008.12.28\\u003c/a\\u003e, Yaojinyu\\u003c/div\\u003e\"],\"UVA-11481\":[\"Arrange the Numbers\",534,null],\"UVA-11361\":[\"Investigating Div-Sum Property\",1098,null],\"HDU-1077\":[\"Catching Fish\",921,\"\"],\"POJ-1777\":[\"Vivian\\u0027s Problem\",312,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dAsia+Guangzhou+2003\\\"\\u003eAsia Guangzhou 2003\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1079\":[\"Calendar Game\",3665,\"\\u003cdiv class\\u003d\\\"panel_content\\\"\\u003e \\u003ca href\\u003d\\\"https://acm.hdu.edu.cn/search.php?field\\u003dproblem\\u0026amp;key\\u003dAsia+2001%2C+Taejon+%28South+Korea%29\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e Asia 2001, Taejon (South Korea) \\u003c/a\\u003e \\u003c/div\\u003e\"],\"ZOJ-2507\":[\"Let\\u0027s play a game\",542,null],\"UVA-1635\":[\"Irrelevant Elements\",1333,null],\"UVA-1636\":[\"Headshot\",1832,null],\"UVA-11489\":[\"Integer Game\",2759,null],\"UVA-11005\":[\"Cheapest Base\",2993,null],\"UVA-1637\":[\"Double Patience\",700,null],\"UVA-10038\":[\"Jolly Jumpers\",41366,null],\"UVA-10159\":[\"Star\",256,null],\"UVA-1638\":[\"Pole Arrangement\",1168,null],\"LightOJ-1401\":[\"No More Tic-tac-toe\",237,null],\"HDU-1071\":[\"The area\",8988,\"\"],\"LightOJ-1408\":[\"Batting Practice\",420,null],\"HDU-2161\":[\"Primes\",8459,\"\\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+-+Warm+Up\\u0026amp;source\\u003d1\\u0026amp;searchmode\\u003dsource\\\"\\u003e 2008 “Sunline Cup” National Invitational Contest - Warm Up \\u003c/a\\u003e \\u003c/div\\u003e\"],\"UVA-11490\":[\"Just Another Problem\",374,null],\"Gym-100548F\":[\"Color\",643,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100548\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014-2015 ACM-ICPC, Asia Xian Regional Contest\\u003c/a\\u003e\"],\"UVA-1406\":[\"A Sequence of Numbers\",170,null],\"UVA-10385\":[\"Duathlon\",875,null],\"UVA-160\":[\"Factors and Factorials\",11312,null],\"POJ-1740\":[\"A New Stone Game\",3535,\"\\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\"],\"UVA-1642\":[\"Magical GCD\",818,null],\"HDU-1085\":[\"Holding Bin-Laden Captive!\",8843,\"\"],\"UVA-1643\":[\"Angle and Squares\",306,null],\"UVA-1644\":[\"Prime Gap\",3298,null],\"POJ-3922\":[\"A simple stone game\",322,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dBeijing+2008\\\"\\u003eBeijing 2008\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-4111\":[\"Alice and Bob\",718,\"\\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\"],\"UVA-1645\":[\"Count\",632,null],\"UVA-1646\":[\"Edge Case\",477,null],\"UVA-1647\":[\"Computer Transformation\",489,null],\"UVA-1648\":[\"Business Center\",389,null],\"UVA-11479\":[\"Is this the easiest problem?\",12795,null],\"UVA-1649\":[\"Binomial coefficients\",271,null],\"UVA-1640\":[\"The Counting Problem\",1703,null],\"UVA-1641\":[\"ASCII Area\",1095,null],\"UVA-10013\":[\"Super long sums\",7258,null],\"UVA-10497\":[\"Sweet Child Makes Trouble\",1359,null],\"UVA-10014\":[\"Simple calculations\",3248,null],\"UVA-10253\":[\"Series-Parallel Networks\",547,null],\"UVA-10375\":[\"Choose and divide\",3700,null],\"UVA-10254\":[\"The Priest Mathematician\",1496,null],\"POJ-1995\":[\"Raising Modulo Numbers\",11635,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dCTU+Open+1999\\\"\\u003eCTU Open 1999\\u003c/a\\u003e\\u003c/div\\u003e\"],\"UVA-11461\":[\"Square Numbers\",18016,null],\"UVA-1414\":[\"Hanoi Towers\",167,null],\"UVA-11582\":[\"Colossal Fibonacci Numbers!\",3307,null],\"UVALive-3704\":[\"Cellular Automaton\",398,\"Regionals 2006 \\u003e\\u003e Europe - Northeastern\"],\"UVA-10252\":[\"Common Permutation\",13194,null],\"UVA-10491\":[\"Cows and Cars\",5375,null],\"POJ-2720\":[\"Last Digits\",317,\"\\u003cdiv class\\u003d\\\"ptx\\\" lang\\u003d\\\"en-US\\\"\\u003e\\u003ca href\\u003d\\\"http://poj.org/searchproblem?field\\u003dsource\\u0026amp;key\\u003dRocky+Mountain+2005\\\"\\u003eRocky Mountain 2005\\u003c/a\\u003e\\u003c/div\\u003e\"],\"HDU-1097\":[\"A hard puzzle\",19189,\"\"],\"UVA-1653\":[\"Yet Another Multiple Problem\",138,null],\"SPOJ-CRYPTO1\":[\"The Bytelandian Cryptographer (Act I)\",1344,\";)\"],\"UVA-1654\":[\"Pairs of integers\",78,null],\"HDU-1099\":[\"Lottery\",2189,\"\"],\"UVA-10019\":[\"Funny Encryption Method\",12981,null],\"UVA-1655\":[\"Exam\",114,null],\"UVA-1656\":[\"Exponential Towers\",47,null],\"UVA-1657\":[\"Game\",51,null],\"UVA-10139\":[\"Factovisors\",6243,null],\"UVA-11346\":[\"Probability\",1259,null],\"UVA-10137\":[\"The Trip\",11706,null],\"UVA-11105\":[\"Semi-prime H-numbers\",1412,null],\"UVA-1650\":[\"Number String\",273,null],\"ZOJ-1202\":[\"Divide and Count\",2060,null],\"UVA-1651\":[\"Binary Operation\",31,null],\"ZOJ-1201\":[\"Inversion\",3958,null],\"UVA-1652\":[\"Fibonacci System\",64,null],\"UVA-1410\":[\"Expensive Drink\",9,null]}","joined":false,"groups":{}},"managingGroups":{},"author":"tigerisland45","updateTime":1552943565000,"title":"TYUT数学题汇","dislikeCnt":0,"content":"\nTYUT数学题汇\n\n紫书 第10章 数学概念与方法(例题)\n1. [problem:UVA-11582] Colossal Fibonacci Numbers!\n2. [problem:UVA-12169] Disgruntled Judge\n3. [problem:UVA-10375] Choose and divide\n4. [problem:UVA-10791] Minimum Sum LCM\n5. [problem:UVA-12716] GCD XOR\n6. [problem:UVA-1635] Irrelevant Elements\n7. [problem:UVA-10820] Send a Table\n8. [problem:UVA-1262] Password\n9. [problem:UVA-1636] Headshot\n10. [problem:UVA-10491] Cows and Cars\n11. [problem:UVA-11181] Probability|Given\n12. [problem:UVA-1637] Double Patience\n13. [problem:UVA-580] Critical Mass\n14. [problem:UVA-12034] Race\n15. [problem:UVA-1638] Pole Arrangement\n16. [problem:UVA-12230] Crossing Rivers\n17. [problem:UVA-1639] Candy\n18. [problem:UVA-10288] Coupons\n19. [problem:UVA-11346] Probability\n20. [problem:UVA-10900] So you want to be a 2n-aire?\n21. [problem:UVA-11971] Polygon\n22. [problem:UVA-1640] The Counting Problem\n23. [problem:UVA-10213] How Many Pieces of Land ?\n24. [problem:UVA-1641] ASCII Area\n25. [problem:UVA-1363] Joseph\u0027s Problem\n26. [problem:UVA-11440] Help Tomisu\n27. [problem:UVA-10214] Trees in a Wood.\n28. [problem:UVA-1393] Highways\n29. [problem:UVA-1642] Magical GCD\n\n紫书 第10章 数学概念与方法(习题)\n1. [problem:UVA-11040] Add bricks in the wall\n2. [problem:UVA-808] Bee Breeding\n3. [problem:UVA-1643] Angle and Squares\n4. [problem:UVA-1644] Prime Gap\n5. [problem:UVA-1213] Sum of Different Primes\n6. [problem:UVA-1210] Sum of Consecutive Prime Numbers\n7. [problem:UVA-10539] Almost Prime Numbers\n8. [problem:UVA-10622] Perfect P-th Powers\n9. [problem:UVA-294] Divisors\n10. [problem:UVA-1645] Count\n11. [problem:UVA-1646] Edge Case\n12. [problem:UVA-557] Burger\n13. [problem:UVA-11526] H(n)\n14. [problem:UVA-10886] Standard Deviation\n15. [problem:UVA-12063] Zeros and Ones\n16. [problem:UVA-1647] Computer Transformation\n17. [problem:UVA-11105] Semi-prime H-numbers\n18. [problem:UVA-10837] A Research Problem\n19. [problem:UVA-10868] Bungee Jumping\n20. [problem:UVA-1648] Business Center\n21. [problem:UVA-1649] Binomial coefficients\n22. [problem:UVA-10640] Planes around the World\n23. [problem:UVA-10479] The Hendrie Sequence\n24. [problem:UVA-766] Sum of powers\n25. [problem:UVA-1575] Factors\n26. [problem:UVA-12520] Square Garden\n27. [problem:UVA-1390] Interconnect\n28. [problem:UVA-1650] Number String\n29. [problem:UVA-11982] Fantasy Cricket\n30. [problem:UVA-12371] Guards\n31. [problem:UVA-12590] Guards II\n32. [problem:UVA-1414] Hanoi Towers\n33. [problem:UVA-1651] Binary Operation\n34. [problem:UVA-12212] Password Remembering\n35. [problem:UVA-1282] Fibonacci Words\n36. [problem:UVA-1652] Fibonacci System\n37. [problem:UVA-1653] Yet Another Multiple Problem\n38. [problem:UVA-10824] Regular Polygon\n39. [problem:UVA-11186] Circum Triangle\n40. [problem:UVA-12535] Probability Through Experiments\n41. [problem:UVA-1406] A Sequence of Numbers\n42. [problem:UVA-12508] Triangles in the Grid\n43. [problem:UVA-1654] Pairs of integers\n44. [problem:UVA-11246] K-Multiple Free set\n45. [problem:UVA-11166] Power Signs\n46. [problem:UVA-11895] Honorary Tickets\n47. [problem:UVA-11429] Randomness\n48. [problem:UVA-1655] Exam\n49. [problem:UVA-1656] Exponential Towers\n50. [problem:UVA-11303] Permutations\n51. [problem:UVA-1657] Game\n\n白书 2.6数学(练习题)\n1. [problem:Aizu-0005] GCD and LCM\n2. [problem:POJ-2429] GCD \u0026 LCM Inverse\n3. [problem:POJ-1930] Dead Fraction\n4. [problem:Aizu-0009] Prime Number\n5. [problem:POJ-3126] Prime Path\n6. [problem:POJ-3421] X-factor Chains\n7. [problem:POJ-3292] Semi-prime H-numbers\n8. [problem:POJ-3641] Pseudoprime numbers\n9. [problem:POJ-1995] Raising Modulo Numbers\n\n白书 4.1数学问题(练习题)\n1. [problem:POJ-1150] The Last Non-zero Digit\n2. [problem:POJ-1284] Primitive Roots\n3. [problem:POJ-2115] C Looooops\n4. [problem:POJ-3708] Recurrent Function\n5. [problem:POJ-2720] Last Digits\n6. [problem:POJ-2345] Central heating\n7. [problem:POJ-3532] Resistance\n8. [problem:POJ-3526] The Teacher’s Side of Math\n9. [problem:POJ-2407] Relatives\n10. [problem:POJ-1286] Necklace of Beads\n11. [problem:POJ-2409] Let it Bead\n12. [problem:POJ-2164] Find the Border\n13. [problem:POJ-2214] Regions\n\n蓝书 第2章 数学基础(例题)\n1. [problem:UVA-11538] Chess Queen\n2. [problem:UVA-11401] Triangle Counting\n3. [problem:UVA-11806] Cheerleaders\n4. [problem:UVALive-3516] Exploring Pyramids\n5. [problem:UVA-11361] Investigating Div-Sum Property\n6. [problem:UVALive-4123] Glenbow Museum\n7. [problem:UVA-10253] Series-Parallel Networks\n8. [problem:UVALive-4119] Always an integer\n9. [problem:UVA-11426] GCD - Extreme (II)\n10. [problem:UVA-11754] Code Feat\n11. [problem:UVA-11916] Emoogle Grid\n12. [problem:UVALive-5059] Playing With Stones\n13. [problem:UVA-10561] Treblecross\n14. [problem:UVA-11021] Tribles\n15. [problem:UVA-11722] Joining with Friend\n16. [problem:UVA-11427] Expect the Expected\n17. [problem:UVA-11762] Race to 1\n18. [problem:UVA-10294] Arif in Dhaka (First Love Part 2)\n19. [problem:UVALive-3641] Leonardo\u0027s Notebook\n20. [problem:UVA-11077] Find the Permutations\n21. [problem:UVALive-3510] Pixel Shuffle\n22. [problem:UVA-10870] Recurrences\n23. [problem:UVALive-3704] Cellular Automaton\n24. [problem:UVA-10828] Back to Kernighan-Ritchie\n25. [problem:UVA-11542] Square\n26. [problem:UVA-10341] Solve It\n27. [problem:UVALive-5009] Error Curves\n28. [problem:UVALive-3485] Bridge\n\nπ-Algorithmist Math\n1. [problem:UVALive-2729] The Solar System\n2. [problem:UVALive-3288] Harmonic Mean\n3. [problem:UVALive-3529] Widget Factory\n4. [problem:SPOJ-CANTON] Count on Cantor\n5. [problem:SPOJ-CMPLS] Complete the Sequence!\n6. [problem:SPOJ-EIGHTS] Triple Fat Ladies\n7. [problem:SPOJ-MARBLES] Marbles\n8. [problem:UVA-10013] Super long sums\n9. [problem:UVA-10014] Simple calculations\n10. [problem:UVA-10019] Funny Encryption Method\n11. [problem:UVA-10035] Primary Arithmetic\n12. [problem:UVA-10038] Jolly Jumpers\n13. [problem:UVA-10041] Vito\u0027s Family\n14. [problem:UVA-10071] Back to High School Physics\n15. [problem:UVA-10079] Pizza Cutting\n16. [problem:UVA-10137] The Trip\n17. [problem:UVA-10139] Factovisors\n18. [problem:UVA-10161] Ant on a Chessboard\n19. [problem:UVA-10168] Summation of Four Primes\n20. [problem:UVA-10183] How Many Fibs?\n21. [problem:UVA-10229] Modular Fibonacci\n22. [problem:UVA-10302] Summation of Polynomials\n23. [problem:UVA-10347] Medians\n24. [problem:UVA-10407] Simple division\n25. [problem:UVA-10469] To Carry or not to Carry\n26. [problem:UVA-10473] Simple Base Conversion\n27. [problem:UVA-106] Fermat vs. Pythagoras\n28. [problem:UVA-10633] Rare Easy Problem\n29. [problem:UVA-10644] Floor Tiles\n30. [problem:UVA-10696] f91\n31. [problem:UVA-10699] Count the factors\n32. [problem:UVA-107] The Cat in the Hat\n33. [problem:UVA-10775] Mystical Matrix\n34. [problem:UVA-10778] Mathemagicland\n35. [problem:UVA-10783] Odd Sum\n36. [problem:UVA-10812] Beat the Spread!\n37. [problem:UVA-10830] A New Function\n38. [problem:UVA-10831] Gerg\u0027s Cake\n39. [problem:UVA-10847] Basic Tautologies\n40. [problem:UVA-10853] Pablito nailed a nail\n41. [problem:UVA-10885] Martin the Gardener\n42. [problem:UVA-11005] Cheapest Base\n43. [problem:UVA-11038] How Many O\u0027s?\n44. [problem:UVA-11150] Cola\n45. [problem:UVA-113] Power of Cryptography\n46. [problem:UVA-11479] Is this the easiest problem?\n47. [problem:UVA-136] Ugly Numbers\n48. [problem:UVA-138] Street Numbers\n49. [problem:UVA-146] ID Codes\n50. [problem:UVA-195] Anagram\n51. [problem:UVA-264] Count on Cantor\n52. [problem:UVA-294] Divisors\n53. [problem:UVA-343] What Base Is This?\n54. [problem:UVA-355] The Bases Are Loaded\n55. [problem:UVA-369] Combinations\n56. [problem:UVA-374] Big Mod\n57. [problem:UVA-389] Basically Speaking\n58. [problem:UVA-443] Humble Numbers\n59. [problem:UVA-516] Prime Land\n60. [problem:UVA-575] Skew Binary\n61. [problem:UVA-583] Prime Factors\n62. [problem:UVA-697] Jack and Jill\n63. [problem:UVA-713] Adding Reversed Numbers\n64. [problem:UVA-880] Cantor Fractions\n65. [problem:UVA-913] Joana and the Odd Numbers\n66. [problem:UVA-944] Happy Numbers\n\nHDU Math\n1. [problem:HDU-1018] \t Big Number \t\n2. [problem:HDU-1028] \t Ignatius and the Princess III \t\n3. [problem:HDU-1056] \t HangOver \t\n4. [problem:HDU-1060] \t Leftmost Digit \t\n5. [problem:HDU-1065] \t I Think I Need a Houseboat \t\n6. [problem:HDU-1066] \t Last non-zero Digit in N! \t\n7. [problem:HDU-1071] \t The area \t\n8. [problem:HDU-1077] \t Catching Fish \t\n9. [problem:HDU-1099] \t Lottery \t\n10. [problem:HDU-1110] \t Equipment Box \t\n11. [problem:HDU-1155] \t Bungee Jumping \t\n12. [problem:HDU-1210] \t Eddy\u0027s 洗牌问题 \t\n13. [problem:HDU-1214] \t 圆桌会议 \t\n14. [problem:HDU-1215] \t 七夕节 \t\n15. [problem:HDU-1216] \t Assistance Required \t\n16. [problem:HDU-1220] \t Cube \t\n17. [problem:HDU-1221] \t Rectangle and Circle \t\n18. [problem:HDU-1222] \t Wolf and Rabbit \t\n19. [problem:HDU-1248] \t 寒冰王座 \t\n20. [problem:HDU-1249] \t 三角形 \t\n21. [problem:HDU-1250] \t Hat\u0027s Fibonacci \t\n22. [problem:HDU-1259] \t ZJUTACM \t\n23. [problem:HDU-1271] \t 整数对 \t\n24. [problem:HDU-1273] \t 漫步森林 \t\n25. [problem:HDU-1275] \t 两车追及或相遇问题 \t\n26. [problem:HDU-1284] \t 钱币兑换问题 \t\n27. [problem:HDU-1286] \t 找新朋友 \t\n28. [problem:HDU-1288] \t Hat\u0027s Tea \t\n29. [problem:HDU-1290] \t 献给杭电五十周年校庆的礼物 \t\n30. [problem:HDU-1295] \t Move Move Look \t\n31. [problem:HDU-1299] \t Diophantus of Alexandria \t\n32. [problem:HDU-1309] \t Loansome Car Buyer \t\n33. [problem:HDU-1319] \t Prime Cuts \t\n34. [problem:HDU-1322] \t Floppies \t\n35. [problem:HDU-1329] \t Hanoi Tower Troubles Again! \t\n36. [problem:HDU-1330] \t Deck \t\n37. [problem:HDU-1333] \t Smith Numbers \t\n38. [problem:HDU-1335] \t Basically Speaking \t\n39. [problem:HDU-1336] \t Word Index \t\n40. [problem:HDU-1352] \t I Conduit! \t\n41. [problem:HDU-1374] \t The Circumference of the Circle \t\n42. [problem:HDU-1376] \t Octal Fractions \t\n43. [problem:HDU-1396] \t Counting Triangles \t\n44. [problem:HDU-1402] \t A * B Problem Plus \t\n45. [problem:HDU-1405] \t The Last Practice \t\n46. [problem:HDU-1418] \t 抱歉 \t\n47. [problem:HDU-1568] \t Fibonacci \t\n48. [problem:HDU-1594] \t find the max \t\n49. [problem:HDU-1700] \t Points on Cycle \t\n50. [problem:HDU-1713] \t 相遇周期 \t\n51. [problem:HDU-1714] \t RedField \t\n52. [problem:HDU-1717] \t 小数化分数2 \t\n53. [problem:HDU-1722] \t Cake \t\n54. [problem:HDU-1724] \t Ellipse \t\n55. [problem:HDU-1724] \t Ellipse \t\n56. [problem:HDU-1755] \t A Number Puzzle \t\n57. [problem:HDU-1756] \t Cupid\u0027s Arrow \t\n58. [problem:HDU-1757] \t A Simple Math Problem \t\n59. [problem:HDU-1785] \t You Are All Excellent \t\n60. [problem:HDU-1798] \t Tell me the area \t\n61. [problem:HDU-2818] \t Building Block\n\n赵书 第十二章 数学\n1. [problem:ZOJ-1177] K-Magic Number\n2. [problem:ZOJ-1180] Self Numbers\n3. [problem:ZOJ-1188] DNA Sorting\n4. [problem:ZOJ-1189] Numbers That Count\n5. [problem:ZOJ-1198] Single-Player Games\n6. [problem:ZOJ-1201] Inversion\n7. [problem:ZOJ-1202] Divide and Count\n8. [problem:ZOJ-1222] Just the Facts\n9. [problem:ZOJ-1238] Guess the Number\n10. [problem:ZOJ-1186] Street Directions \n\n余书 第4章 数学问题\n1. [problem:POJ-3761] Bubble Sort\n2. [problem:POJ-3735] Training little cats\n3. [problem:POJ-1061] 青蛙的约会\n4. [problem:POJ-1220] NUMBER BASE CONVERSION\n5. [problem:POJ-3191] The Moronic Cowmpouter\n6. [problem:POJ-2407] Relatives\n7. [problem:POJ-1811] Prime Test\n8. [problem:POJ-2891] Strange Way to Express Integers\n9. [problem:POJ-2409] Let it Bead\n\n喻书 第7章 数学基础(例题)\n1. [problem:URAL-1540] Battle for the Ring\n2. [problem:HDU-4992] Primitive Roots\n3. [problem:UVA-10294] Arif in Dhaka (First Love Part 2)\n4. [problem:SPOJ-TSUM] Triple Sums\n\n喻书 第7章 数学基础(习题)\n1. [problem:HDU-3469] Catching the Thief\n2. [problem:UVA-11489] Integer Game\n3. [problem:SPOJ-PEBBMOV] Moving Pebbles\n4. [problem:UVA-11859] Division Game\n5. [problem:UVA-1482] Playing With Stones\n6. [problem:SGU-520] Fire in the Country\n7. [problem:HDU-4111] Alice and Bob\n8. [problem:CodeForces-282D] Yet Another Number Game\n9. [problem:URAL-1397] Points Game\n10. [problem:HackerRank-euler012] Project Euler #12: Highly divisible triangular number\n11. [problem:HYSBZ-2742] Akai的数学作业\n12. [problem:HackerRank-euler027] Project Euler #27: Quadratic primes\n13. [problem:HYSBZ-2956] 模积和\n14. [problem:SPOJ-DETER] Find The Determinant\n15. [problem:POJ-2480] Longge\u0027s problem\n16. [problem:HYSBZ-1407] Savage\n17. [problem:CodeForces-492E] Vanya and Field\n18. [problem:POJ-3378] Crazy Thairs\n19. [problem:SGU-491] Game for Little Johnny\n20. [problem:URAL-1032] Find a Multiple\n21. [problem:HDU-5072] Coprime\n22. [problem:URAL-1091] Tmutarakan Exams\n23. [problem:Gym-100548F] Color\n24. [problem:SPOJ-BINSTIRL] Binary Stirling Numbers\n25. [problem:HDU-5080] Colorful Toy\n26. [problem:SPOJ-LARGE] Large party\t\n\n俞书 第一章 数学\n1. [problem:UVA-10288] Coupons\n2. [problem:ZOJ-2619] Generator\n3. [problem:UVA-10294] Arif in Dhaka (First Love Part 2)\n4. [problem:HDU-2971] Tower\n5. [problem:ZOJ-2113] XX Language\n6. [problem:UVA-1050] Ars Longa\n7. [problem:UVA-1410] Expensive Drink\n8. [problem:UVA-10207] The Unreal Tournament\n9. [problem:POJ-2103] Jackpot\n10. [problem:SCU-3502] The Almost Lucky Numbers\n11. [problem:URAL-1387] Vasya\u0027s Dad\n12. [problem:UVA-10766] Organising the Organisation\n13. [problem:Gym-100761H] Hero of Our Time\n14. [problem:URAL-1540] Battle for the Ring\n15. [problem:POJ-3153] Fool\u0027s Game\n16. [problem:URAL-1397] Points Game\n17. [problem:UVALive-4305] Wizards\n18. [problem:ZOJ-2674] Strange Limit\n19. [problem:UVALive-4190] GCD Determinant\n20. [problem:URAL-1132] Square Root\n21. [problem:HDU-3221] Brute-force Algorithm\n22. [problem:POJ-3471] Integral Roots\n23. [problem:POJ-1777] Vivian\u0027s Problem\n24. [problem:ZOJ-3341] Voyager 1\n25. [problem:ZOJ-2614] Bridge\n\n蓝书 第2章 数学基础(例题)\n\n1.组合计数\n1. [problem:UVA-11538] Chess Queen\n2. [problem:UVA-11401] Triangle Counting\n3. [problem:UVA-11806] Cheerleaders\n4. [problem:UVALive-3516] Exploring Pyramids\n5. [problem:UVA-11361] Investigating Div-Sum Property\n6. [problem:UVALive-4123] Glenbow Museum\n7. [problem:UVA-10253] Series-Parallel Networks\n\n2.数论\n1. [problem:UVALive-4119] Always an integer\n2. [problem:UVA-11426] GCD - Extreme (II)\n3. [problem:UVA-11754] Code Feat\n4. [problem:UVA-11916] Emoogle Grid\n\n3.组合游戏\n1. [problem:UVALive-5059] Playing With Stones\n2. [problem:UVA-10561] Treblecross\n\n4.概率\n1. [problem:UVA-11021] Tribles\n2. [problem:UVA-11722] Joining with Friend\n3. [problem:UVA-11427] Expect the Expected\n4. [problem:UVA-11762] Race to 1\n\n5.置换\n1. [problem:UVA-10294] Arif in Dhaka (First Love Part 2)\n2. [problem:UVALive-3641] Leonardo\u0027s Notebook\n3. [problem:UVA-11077] Find the Permutations\n4. [problem:UVALive-3510] Pixel Shuffle\n\n6.矩阵与线性方程组\n1. [problem:UVA-10870] Recurrences\n2. [problem:UVALive-3704] Cellular Automaton\n3. [problem:UVA-10828] Back to Kernighan-Ritchie\n4. [problem:UVA-11542] Square\n\n7.数值方法\n1. [problem:UVA-10341] Solve It\n2. [problem:UVALive-5009] Error Curves\n3. [problem:UVALive-3485] Bridge\n\n蓝书 第2章 数学基础(习题)\n1. [problem:UVA-11388] GCD LCM\n2. [problem:UVA-11889] Benefit\n3. [problem:UVA-10943] How do you add?\n4. [problem:UVA-10780] Again Prime? No Time.\n5. [problem:UVA-10892] LCM Cardinality\n6. [problem:UVA-11752] The Super Powers\n7. [problem:UVA-11076] Add Again\n8. [problem:UVA-11609] Teams\n9. [problem:UVALive-2889] Palindrome Numbers\n10. [problem:UVA-11489] Integer Game\n11. [problem:UVA-10791] Minimum Sum LCM\n12. [problem:UVA-11461] Square Numbers\n13. [problem:UVALive-2911] Maximum\n14. [problem:UVALive-2756] Crazy tea party\n\n1.组合计数\n1. [problem:UVA-11038] How Many O\u0027s?\n2. [problem:UVA-10883] Supermean\n3. [problem:UVALive-3720] Highways\n4. [problem:UVALive-5846] Neon Sign\n5. [problem:UVALive-3295] Counting Triangles\n6. [problem:UVA-11139] Counting Quadrilaterals\n7. [problem:UVA-11529] Strange Tax Calculation\n8. [problem:UVALive-4064] Magnetic Train Tracks\n9. [problem:UVALive-4390] Counting heaps\n10. [problem:UVALive-3357] Pinary\n11. [problem:UVA-11645] Bits\n12. [problem:UVA-11481] Arrange the Numbers\n13. [problem:UVA-10237] Bishops\n14. [problem:UVALive-4258] Metal\n15. [problem:UVA-10884] Persephone\n16. [problem:UVALive-5092] Permutation Counting\n17. [problem:UVALive-5028] Delta Wave\n18. [problem:UVALive-5101] Math teacher\u0027s homework\n19. [problem:UVALive-4352] Binary Integer\n\n2.数论\n1. [problem:UVA-10673] Play with Floor and Ceil\n2. [problem:UVA-11768] Lattice Point or Not\n3. [problem:UVA-11490] Just Another Problem\n4. [problem:UVA-11728] Alternate Task\n5. [problem:UVA-10692] Huge Mods\n6. [problem:UVA-10951] Polynomial GCD\n7. [problem:UVALive-4270] Discrete Square Roots\n8. [problem:UVALive-4079] Gauss Prime\n9. [problem:UVALive-4353] Cryptography Reloaded\n10. [problem:UVALive-5916] GCD Guessing Game\n11. [problem:UVA-11014] Make a Crystal\n12. [problem:UVALive-2683] Payment System\n13. [problem:UVALive-4060] The Bells are Ringing\n14. [problem:UVALive-3998] Prime k-tuple\n15. [problem:UVALive-2955] Vivian\u0027s Problem\n16. [problem:UVALive-3262] Different Digits\n17. [problem:UVALive-3521] Joseph\u0027s Problem\n18. [problem:UVALive-4382] YAPTCHA\n19. [problem:UVALive-4998] Simple Encryption\n20. [problem:UVALive-5769] Ji-Tu Problem\n21. [problem:UVALive-4384] Business Cards\n\n3.组合游戏\n1. [problem:UVA-12293] Box Game\n2. [problem:UVA-11892] ENimEN\n3. [problem:UVALive-3668] A Funny Stone Game\n4. [problem:UVALive-5760] Alice and Bob\n5. [problem:UVALive-4411] Addition-Subtraction Game\n\n4.概率\n1. [problem:UVALive-4485] Crossing Rivers\n2. [problem:UVA-1118] Binary Stirling Numbers\n3. [problem:UVA-10491] Cows and Cars\n4. [problem:UVA-11637] Garbage Remembering Exam\n5. [problem:UVA-11605] Lights inside a 3d Grid\n6. [problem:UVA-10900] So you want to be a 2n-aire?\n7. [problem:UVALive-5721] Activation\n8. [problem:UVALive-4049] Game\n9. [problem:UVALive-2344] Parallel Expectations\n10. [problem:UVALive-4412] The Great Game\n\n5.置换\n1. [problem:UVA-10601] Cubes\n2. [problem:UVA-11774] Doom\u0027s Day\n3. [problem:UVA-11330] Andy\u0027s Shoes\n4. [problem:UVA-11540] Sultan\u0027s Chandelier\n5. [problem:UVALive-5819] Alphabet Soup\n6. [problem:UVA-10733] The Colored Cubes\n7. [problem:UVA-11255] Necklace\n8. [problem:UVALive-2481] Silly Sort\n\n6.矩阵与线性方程组\n1. [problem:UVA-10655] Contemplation! Algebra\n2. [problem:UVA-11149] Power of Matrix\n3. [problem:UVA-10808] Rational Resistors\n4. [problem:UVALive-3139] Kid\u0027s Problem\n5. [problem:UVALive-3891] The Teacher\u0027s Side of Math\n\n7.数值方法\n1. [problem:UVA-10668] Expanding Rods\n2. [problem:UVA-10385] Duathlon\n3. [problem:UVALive-5096] Volume\n4. [problem:UVALive-3962] Tough Water Level\n5. [problem:UVALive-4330] Timer\n6. [problem:UVA-12413] Big Decimal Calculator\n\n吴书《算法设计编程实验》 第3章 数论\n1. [problem:UVA-543] Goldbach\u0027s Conjecture\n2. [problem:UVA-10168] Summation of Four Primes\n3. [problem:UVA-10533] Digit Primes\n4. [problem:UVALive-3883] Prime Gap\n5. [problem:UVA-10871] Primed Subsequence\n6. [problem:SGU-106] The equation\n7. [problem:POJ-2115] C Looooops\n8. [problem:UVA-756] Biorhythms\n9. [problem:UVA-10299] Relatives\n10. [problem:POJ-1284] Primitive Roots\n11. [problem:HYSBZ-2005] 能量采集\n12. [problem:UVA-10789] Prime Frequency\n13. [problem:UVA-10394] Twin Primes\n14. [problem:UVA-10852] Less Prime\n15. [problem:UVA-10924] Prime Words\n16. [problem:UVALive-3619] Sum of Different Primes\n17. [problem:UVA-10831] Gerg\u0027s Cake\n18. [problem:UVALive-3529] Widget Factory\n19. [problem:POJ-1061] 青蛙的约会\n20. [problem:UVA-10699] Count the factors\n21. [problem:UVA-516] Prime Land\n22. [problem:UVA-583] Prime Factors\n23. [problem:POJ-1730] Perfect Pth Powers\n24. [problem:UVA-10139] Factovisors\n25. [problem:POJ-2478] Farey Sequence\n26. [problem:UVA-10179] Irreducable Basic Fractions\n27. [problem:UVA-10892] LCM Cardinality\n28. [problem:POJ-3910] GCD Determinant\n29. [problem:POJ-2429] GCD \u0026 LCM Inverse\n\n《挑战编程--程序设计竞赛训练手册》 7 Number Theory\n1. [problem:UVA-10110] Light, more light\n2. [problem:UVA-10006] Carmichael Numbers\n3. [problem:UVA-10104] Euclid Problem\n4. [problem:UVA-10139] Factovisors\n5. [problem:UVA-10168] Summation of Four Primes\n6. [problem:UVA-10042] Smith Numbers\n7. [problem:UVA-10090] Marbles\n8. [problem:UVA-10089] Repackaging\n\nKB 专题十四 数论基础\n1. [problem:LightOJ-1370] Bi-shoe and Phi-shoe\n2. [problem:LightOJ-1356] Prime Independence\n3. [problem:LightOJ-1341] Aladdin and the Flying Carpet\n4. [problem:LightOJ-1336] Sigma Function\n5. [problem:LightOJ-1282] Leading and Trailing\n6. [problem:LightOJ-1259] Goldbach`s Conjecture\n7. [problem:LightOJ-1245] Harmonic Number (II)\n8. [problem:LightOJ-1236] Pairs Forming LCM\n9. [problem:LightOJ-1234] Harmonic Number\n10. [problem:LightOJ-1220] Mysterious Bacteria\n11. [problem:LightOJ-1214] Large Division\n12. [problem:LightOJ-1213] Fantasy of a Summation\n13. [problem:LightOJ-1197] Help Hanzo\n14. [problem:LightOJ-1138] Trailing Zeroes (III)\n15. [problem:UVA-11426] GCD - Extreme (II)\n16. [problem:UVA-11754] Code Feat\n17. [problem:UVA-11916] Emoogle Grid\n18. [problem:POJ-1061] 青蛙的约会\n19. [problem:POJ-2115] C Looooops\n20. [problem:POJ-2116] Death to Binary?\n21. [problem:HDU-2161] Primes\n22. [problem:UVA-11827] Maximum GCD\n23. [problem:UVA-10200] Prime Time\n24. [problem:SGU-106] The equation\n25. [problem:POJ-2478] Farey Sequence\n26. [problem:UVA-11752] The Super Powers\n\nKB SHU训练七——数论\n1. [problem:LightOJ-1007] Mathematically Hard\n2. [problem:LightOJ-1024] Eid\n3. [problem:LightOJ-1028] Trailing Zeroes (I)\n4. [problem:LightOJ-1035] Intelligent Factorial Factorization\n5. [problem:LightOJ-1045] Digits of Factorial\n6. [problem:LightOJ-1067] Combinations\n7. [problem:LightOJ-1077] How Many Points?\n8. [problem:LightOJ-1090] Trailing Zeroes (II)\n9. [problem:LightOJ-1098] A New Function\n10. [problem:LightOJ-1109] False Ordering\n11. [problem:LightOJ-1138] Trailing Zeroes (III)\n12. [problem:LightOJ-1163] Bank Robbery\n13. [problem:LightOJ-1197] Help Hanzo\n14. [problem:LightOJ-1213] Fantasy of a Summation\n15. [problem:LightOJ-1214] Large Division\n16. [problem:LightOJ-1215] Finding LCM\n17. [problem:LightOJ-1220] Mysterious Bacteria\n18. [problem:LightOJ-1234] Harmonic Number\n19. [problem:LightOJ-1236] Pairs Forming LCM\n20. [problem:LightOJ-1245] Harmonic Number (II)\n21. [problem:LightOJ-1259] Goldbach`s Conjecture\n22. [problem:LightOJ-1278] Sum of Consecutive Integers\n\nπ-Algorithmist Primes\n1. [problem:TopCoder-6784] RefactorableNumber\n2. [problem:UVA-10168] Summation of Four Primes\n3. [problem:UVA-10394] Twin Primes\n4. [problem:UVA-10533] Digit Primes\n5. [problem:UVA-10699] Count the factors\n6. [problem:UVA-10789] Prime Frequency\n7. [problem:UVA-10852] Less Prime\n8. [problem:UVA-10871] Primed Subsequence\n9. [problem:UVA-10924] Prime Words\n10. [problem:UVA-160] Factors and Factorials\n11. [problem:UVA-294] Divisors\n12. [problem:UVA-406] Prime Cuts\n13. [problem:UVA-516] Prime Land\n14. [problem:UVA-543] Goldbach\u0027s Conjecture\n15. [problem:UVA-583] Prime Factors\n\nπ-Algorithmist Number Theory\n1. [problem:UVALive-3529] Widget Factory\n2. [problem:SPOJ-CRYPTO1] The Bytelandian Cryptographer (Act I)\n3. [problem:SPOJ-TWOSQRS] Two squares or not two squares\n4. [problem:TopCoder-6784] RefactorableNumber\n5. [problem:UVA-10006] Carmichael Numbers\n6. [problem:UVA-10110] Light, more light\n7. [problem:UVA-10139] Factovisors\n8. [problem:UVA-10168] Summation of Four Primes\n9. [problem:UVA-10179] Irreducable Basic Fractions\n10. [problem:UVA-10299] Relatives\n11. [problem:UVA-10407] Simple division\n12. [problem:UVA-10515] Powers Et Al.\n13. [problem:UVA-106] Fermat vs. Pythagoras\n14. [problem:UVA-10699] Count the factors\n15. [problem:UVA-107] The Cat in the Hat\n16. [problem:UVA-10733] The Colored Cubes\n17. [problem:UVA-10820] Send a Table\n18. [problem:UVA-10831] Gerg\u0027s Cake\n19. [problem:UVA-10852] Less Prime\n20. [problem:UVA-10862] Connect the Cable Wires\n21. [problem:UVA-10892] LCM Cardinality\n22. [problem:UVA-10924] Prime Words\n23. [problem:UVA-160] Factors and Factorials\n24. [problem:UVA-374] Big Mod\n25. [problem:UVA-516] Prime Land\n26. [problem:UVA-543] Goldbach\u0027s Conjecture\n27. [problem:UVA-583] Prime Factors\n28. [problem:UVA-846] Steps\n\nHDU Math Theory\n1. [problem:HDU-1019] \t Least Common Multiple \t\n2. [problem:HDU-1061] \t Rightmost Digit \t\n3. [problem:HDU-1097] \t A hard puzzle \t\n4. [problem:HDU-1108] \t 最小公倍数 \t\n5. [problem:HDU-1164] \t Eddy\u0027s research I \t\n6. [problem:HDU-1212] \t Big Number \t\n7. [problem:HDU-1370] \t Biorhythms \t\n8. [problem:HDU-1452] \t Happy 2004 \t\n9. [problem:HDU-1573] \t X问题 \t\n10. [problem:HDU-1695] \t GCD \t\n11. [problem:HDU-1788] \t Chinese remainder theorem again \t\n12. [problem:HDU-1796] \t How many integers can you find \t\n13. [problem:HDU-3334] \t Matrix Puzzle \n\nπ-Algorithmist Permutations\n1. [problem:UVALive-3510] Pixel Shuffle\n2. [problem:UVA-10098] Generating Fast\n3. [problem:UVA-10252] Common Permutation\n4. [problem:UVA-136] Ugly Numbers\n5. [problem:UVA-146] ID Codes\n6. [problem:UVA-195] Anagram\n7. [problem:UVA-482] Permutation Arrays\n\n吴书《算法设计编程实验》 第4章 组合分析\n1. [problem:UVA-146] ID Codes\n2. [problem:UVA-10098] Generating Fast\n3. [problem:UVA-530] Binomial Showdown\n4. [problem:UVA-369] Combinations\n5. [problem:POJ-2084] Game of Connections\n6. [problem:UVA-10844] Bloques\n7. [problem:POJ-2356] Find a multiple\n8. [problem:URAL-1091] Tmutarakan Exams\n9. [problem:UVA-10497] Sweet Child Makes Trouble\n10. [problem:UVALive-2708] Necklace of Beads\n11. [problem:ZOJ-2344] Toral Tickets\n12. [problem:POJ-2154] Color\n13. [problem:UVA-10252] Common Permutation\n14. [problem:UVA-195] Anagram\n15. [problem:UVA-10790] How Many Points of Intersection?\n16. [problem:POJ-2369] Permutations\n17. [problem:UVA-10288] Coupons\n18. [problem:UVALive-3510] Pixel Shuffle\n19. [problem:UVA-10733] The Colored Cubes\n\nπ-Algorithmist Combinatorics\n1. [problem:UVA-10007] Count the Trees\n2. [problem:UVA-10213] How Many Pieces of Land ?\n3. [problem:UVA-1021] Eurodiffusion\n4. [problem:UVA-10497] Sweet Child Makes Trouble\n5. [problem:UVA-10648] Chocolate Box\n6. [problem:UVA-1079] A Careful Approach\n7. [problem:UVA-10844] Bloques\n8. [problem:UVA-10910] Marks Distribution\n9. [problem:UVA-10918] Tri Tiling\n10. [problem:UVA-11401] Triangle Counting\n11. [problem:UVA-136] Ugly Numbers\n12. [problem:UVA-147] Dollars\n13. [problem:UVA-195] Anagram\n\n《挑战编程--程序设计竞赛训练手册》 6 Combinatorics\n1. [problem:UVA-10183] How Many Fibs?\n2. [problem:UVA-10213] How Many Pieces of Land ?\n3. [problem:UVA-10198] Counting\n4. [problem:UVA-10157] Expressions\n5. [problem:UVA-10247] Complete Tree Labeling\n6. [problem:UVA-10254] The Priest Mathematician\n7. [problem:UVA-10049] Self-describing Sequence\n8. [problem:UVA-846] Steps\t\n\nHDU Combinatorics\n1. [problem:HDU-1027] \t Ignatius and the Princess II \t\n2. [problem:HDU-1085] \t Holding Bin-Laden Captive! \t\n3. [problem:HDU-1100] \t Trees Made to Order \t\n4. [problem:HDU-1153] \t Magic Bitstrings \t\n5. [problem:HDU-1171] \t Big Event in HDU \t\n6. [problem:HDU-1261] \t 字串数 \t\n7. [problem:HDU-1294] \t Rooted Trees Problem \t\n8. [problem:HDU-1398] \t Square Coins \t\n9. [problem:HDU-1465] \t 不容易系列之一 \t\n10. [problem:HDU-1492] \t The number of divisors(约数) about Humble Numbers \t\n11. [problem:HDU-1510] \t White Rectangles \t\n12. [problem:HDU-1521] \t 排列组合 \t\n13. [problem:HDU-1570] \t A C \t\n14. [problem:HDU-1716] \t 排列2 \t\n15. [problem:HDU-1799] \t 循环多少次? \n\n白书 4.2博弈(练习题)\n1. [problem:POJ-1082] Calendar Game\n2. [problem:POJ-2068] Nim\n3. [problem:POJ-3688] Cheat in the Game\n4. [problem:POJ-1740] A New Stone Game\n5. [problem:POJ-2975] Nim\n6. [problem:POJ-3537] Crosses and Crosses\n7. [problem:CodeForces-138D] World of Darkraft\n8. [problem:POJ-2315] Football Game\n\nHDU Game Theory\n1. [problem:HDU-1079] \t Calendar Game \t\n2. [problem:HDU-1404] \t Digital Deletions \t\n3. [problem:HDU-1517] \t A Multiplication Game \t\n4. [problem:HDU-1524] \t A Chess Game \t\n5. [problem:HDU-1536] \t S-Nim \t\n6. [problem:HDU-1564] \t Play a game \t\n7. [problem:HDU-1729] \t Stone Game \t\n8. [problem:HDU-1730] \t Northcott Game \t\n9. [problem:HDU-1760] \t A New Tetris Game \t\n10. [problem:HDU-2580] \t a simple stone game\n\n吴书3 第7章 博弈\n1. [problem:POJ-1678] I Love this Game!\n2. [problem:UVALive-3668] A Funny Stone Game\n3. [problem:POJ-2368] Buttons\n4. [problem:POJ-1067] 取石子游戏\n5. [problem:POJ-2234] Matches Game\n6. [problem:POJ-2975] Nim\n7. [problem:ZOJ-2507] Let\u0027s play a game\n8. [problem:POJ-3922] A simple stone game\n9. [problem:POJ-1704] Georgia and Bob\n10. [problem:POJ-3533] Light Switching Game\n11. [problem:POJ-2599] A funny game\n12. [problem:POJ-3710] Christmas Game\n13. [problem:POJ-2931] Procrastination\n\nKB SHU训练六——博弈\n1. [problem:LightOJ-1355] Game of CS\n2. [problem:LightOJ-1186] Incredible Chess\n3. [problem:LightOJ-1192] Left Right\n4. [problem:LightOJ-1247] Matrix Game\n5. [problem:LightOJ-1253] Misere Nim\n6. [problem:LightOJ-1393] Crazy Calendar\n7. [problem:LightOJ-1199] Partitioning Game\n8. [problem:LightOJ-1229] Treblecross\n9. [problem:LightOJ-1296] Again Stone Game\n10. [problem:LightOJ-1315] Game of Hyper Knights\n11. [problem:LightOJ-1344] Aladdin and the Game of Bracelets\n12. [problem:LightOJ-1401] No More Tic-tac-toe \t\n\nHDU Matrix\n1. [problem:HDU-1575] \t Tr A \t\n2. [problem:HDU-1588] \t Gauss Fibonacci \n\nKB 专题十九 矩阵\n1. [problem:CodeForces-450B] Jzzhu and Sequences\n2. [problem:HDU-5015] 233 Matrix\n3. [problem:HDU-4990] Reading comprehension\n4. [problem:UVA-11651] Krypton Number System\n5. [problem:HDU-4965] Fast Matrix Calculation\n6. [problem:UVA-11551] Experienced Endeavour\n7. [problem:UVA-10689] Yet another Number Sequence\n8. [problem:UVA-11149] Power of Matrix\n9. [problem:UVA-10655] Contemplation! Algebra\n10. [problem:UVA-1386] Cellular Automaton\n11. [problem:UVA-10870] Recurrences\n12. [problem:UVA-11885] Number of Battlefields\n13. [problem:HDU-4565] So Easy!\n14. [problem:CodeForces-392C] Yet Another Number Sequence\n15. [problem:CodeForces-385E] Bear in the Field\n16. [problem:FZU-1911] Construct a Matrix\n17. [problem:UVA-10518] How Many Calls?\n18. [problem:HDU-4549] M斐波那契数列\n19. [problem:HDU-4686] Arc of Dream\n\nKB SHU训练五——矩阵\n1. [problem:LightOJ-1151] Snakes and Ladders\n2. [problem:LightOJ-1272] Maximum Subset Sum\n3. [problem:LightOJ-1279] Graph Coloring\n4. [problem:LightOJ-1288] Subsets Forming Perfect Squares\n5. [problem:LightOJ-1052] String Growth\n6. [problem:LightOJ-1065] Number Sequence\n7. [problem:LightOJ-1070] Algebraic Problem\n8. [problem:LightOJ-1131] Just Two Functions\n9. [problem:LightOJ-1132] Summing up Powers\n10. [problem:LightOJ-1142] Summing up Powers (II)\n11. [problem:LightOJ-1160] Discovering Paths in Grid\n12. [problem:LightOJ-1172] Krypton Number System\n13. [problem:LightOJ-1244] Tiles\n14. [problem:LightOJ-1268] Unlucky Strings\n15. [problem:LightOJ-1332] Kings in Chessboard\n16. [problem:LightOJ-1376] Tetromino\n\n《挑战编程--程序设计竞赛训练手册》 12 Grids\n1. [problem:UVA-10161] Ant on a Chessboard\n2. [problem:UVA-10047] The Monocycle\n3. [problem:UVA-10159] Star\n4. [problem:UVA-10182] Bee Maja\n5. [problem:UVA-707] Robbery\n6. [problem:UVA-10177] (2/3/4)-D Sqr/Rects/Cubes/Boxes?\n7. [problem:UVA-10233] Dermuba Triangle\n8. [problem:UVA-10075] Airlines\n\nKB 专题二十一 概率\u0026期望\n1. [problem:LightOJ-1027] A Dangerous Maze\n2. [problem:LightOJ-1030] Discovering Gold\n3. [problem:LightOJ-1038] Race to 1 Again\n4. [problem:LightOJ-1079] Just another Robbery\n5. [problem:LightOJ-1104] Birthday Paradox\n6. [problem:LightOJ-1151] Snakes and Ladders\n7. [problem:LightOJ-1248] Dice (III)\n8. [problem:LightOJ-1265] Island of Survival\n9. [problem:LightOJ-1274] Beating the Dataset\n10. [problem:LightOJ-1284] Lights inside 3D Grid\n11. [problem:LightOJ-1287] Where to Run\n12. [problem:LightOJ-1317] Throwing Balls into the Baskets\n13. [problem:LightOJ-1321] Sending Packets\n14. [problem:LightOJ-1342] Aladdin and the Magical Sticks\n15. [problem:LightOJ-1364] Expected Cards\n16. [problem:LightOJ-1395] A Dangerous Maze (II)\n17. [problem:LightOJ-1408] Batting Practice\n\n","threadId":39793,"likeCnt":5,"createTime":1543268357000,"isWorkbook":true,"viewCnt":2600,"openness":1,"fav":false,"id":742,"trustable":false}