{"id":338,"date":"2013-08-02T23:39:19","date_gmt":"2013-08-03T03:39:19","guid":{"rendered":"http:\/\/www.ferociouscoder.com\/blog\/?page_id=338"},"modified":"2013-08-18T07:56:16","modified_gmt":"2013-08-18T11:56:16","slug":"competitive-programming-3","status":"publish","type":"page","link":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3","title":{"rendered":"Competitive Programming 3: The New Lower Bound of Programming Contests"},"content":{"rendered":"<p>Below are my solutions to programming problems mentioned in the book. The book also has theoretical problems which I am not going to include. The book is by\u00a0<a href=\"http:\/\/www.comp.nus.edu.sg\/~stevenha\" target=\"_blank\" rel=\"nofollow\">Steven Halim<\/a>\u00a0and <a href=\"http:\/\/felix-halim.net\/\" target=\"_blank\" rel=\"nofollow\">Felix Halim<\/a>\u00a0and you can <a title=\"Competitive Programming 3\" href=\"https:\/\/sites.google.com\/site\/stevenhalim\/\" target=\"_blank\">grab yourself a copy<\/a>. If money is an issue, the first edition of the book has now been made free which you can get from the author&#8217;s website.<\/p>\n<h2><strong>Introduction<\/strong><\/h2>\n<h3>Getting Started: The Easy Problems<\/h3>\n<p><strong><\/strong><span style=\"text-decoration: underline;\">Super Easy<\/span><\/p>\n<ul class=\"custom\">\n<li><a title=\"UVA 272 \u2013 TEX Quotes\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-272-tex-quotes.html\">272\u00a0&#8211;\u00a0TEX Quotes<\/a><\/li>\n<li><a title=\"UVA 1124 \u2013 Celebrity Jeopardy\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-1124-celebrity-jeopardy.html\">1124\u00a0&#8211;\u00a0Celebrity jeopardy<\/a><\/li>\n<li><a title=\"UVA 10550 \u2013 Combination Lock\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10550-combination-lock.html\">10550\u00a0&#8211;\u00a0Combination Lock<\/a><\/li>\n<li><a title=\"UVA 11044 \u2013 Searching for Nessy\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11044-searching-for-nessy.html\">11044\u00a0&#8211;\u00a0Searching for Nessy<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 11172 \u2013 Relational Operator\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11172-relational-operator.html\">11172\u00a0&#8211;\u00a0Relational Operator<\/a><\/li>\n<li><a title=\"UVA 11364 \u2013 Parking\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11364-parking.html\">11364\u00a0&#8211;\u00a0Parking<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 11498 \u2013 Division of Nlogonia\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11498-division-of-nlogonia.html\">11498\u00a0&#8211;\u00a0Division of Nlogonia<\/a><\/li>\n<li><a title=\"UVA 11547 \u2013 Automatic Answer\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11547-automatic-answer.html\">11547\u00a0&#8211;\u00a0Automatic Answer<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 11727 \u2013 Cost Cutting\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11727-cost-cutting.html\">11727\u00a0&#8211;\u00a0Cost Cutting<\/a><\/li>\n<li><a title=\"UVA 12250 \u2013 Language Detection\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12250-language-detection.html\">12250\u00a0&#8211;\u00a0Language Detection<\/a><\/li>\n<li><a title=\"UVA 12279 \u2013 Emoogle Balance\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12279-emoogle-balance.html\">12279\u00a0&#8211;\u00a0Emoogle Balance<\/a><\/li>\n<li><a title=\"UVA 12289 \u2013 One-Two-Three\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12289-one-two-three.html\">12289\u00a0&#8211;\u00a0One-Two-Three<\/a><\/li>\n<li><a title=\"UVA 12372 \u2013 Packing for Holiday\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12372-packing-for-holiday.html\">12372\u00a0&#8211;\u00a0Packing for Holiday<\/a><\/li>\n<li><a title=\"UVA 12403 \u2013 Save Setu\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12403-save-setu.html\">12403\u00a0&#8211;\u00a0Save Setu<\/a><\/li>\n<li><a title=\"UVA 12577 \u2013 Hajj-e-Akbar\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12577-hajj-e-akbar.html\">12577\u00a0&#8211;\u00a0Hajj-e-Akbar<\/a><\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Easy<\/span><\/p>\n<ul class=\"custom\">\n<li><a title=\"UVA 621 \u2013 Secret Research\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-621-secret-research.html\">621\u00a0&#8211;\u00a0Secret Research<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 10114 \u2013 Loansome Car Buyer\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10114-loansome-car-buyer.html\">10114\u00a0&#8211;\u00a0Loansome Car Buyer<\/a><\/li>\n<li><a title=\"UVA 10300 \u2013 Ecological Premium\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10300-ecological-premium.html\">10300\u00a0&#8211;\u00a0Ecological Premium<\/a><\/li>\n<li><a title=\"UVA 10963 \u2013 The Swallowing Ground\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10963-the-swallowing-ground.html\">10963\u00a0&#8211;\u00a0The Swallowing Ground<\/a><\/li>\n<li><a title=\"UVA 11332 \u2013 Summing Digits\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11332-summing-digits.html\">11332\u00a0&#8211;\u00a0Summing Digits<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 11559 \u2013 Event Planning\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11559-event-planning.html\">11559\u00a0&#8211;\u00a0Event Planning<\/a><\/li>\n<li><a title=\"UVA 11679 \u2013 Sub-prime\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11679-sub-prime.html\">11679\u00a0&#8211;\u00a0Sub-prime<\/a><\/li>\n<li><a title=\"UVA 11764 \u2013 Jumping Mario\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11764-jumping-mario.html\">11764\u00a0&#8211;\u00a0Jumping Mario<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 11799 \u2013 Horror Dash\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11799-horror-dash.html\">11799\u00a0&#8211;\u00a0Horror Dash<\/a><\/li>\n<li><a title=\"UVA 11942 \u2013 Lumberjack Sequencing\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11942-lumberjack-sequencing.html\">11942\u00a0&#8211;\u00a0Lumberjack Sequencing<\/a><\/li>\n<li><a title=\"UVA 12015 \u2013 Google is Feeling Lucky\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12015-google-is-feeling-lucky.html\">12015\u00a0&#8211;\u00a0Google is Feeling Lucky<\/a><\/li>\n<li><a title=\"UVA 12157 \u2013 Tariff Plan\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12157-tariff-plan.html\">12157\u00a0&#8211;\u00a0Tariff Plan<\/a><\/li>\n<li><a title=\"UVA 12468 \u2013 Zapping\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12468-zapping.html\">12468\u00a0&#8211;\u00a0Zapping<\/a><\/li>\n<li><a title=\"UVA 12503 \u2013 Robot Instructions\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12503-robot-instructions.html\">12503\u00a0&#8211;\u00a0Robot Instructions<\/a><\/li>\n<li><a title=\"UVA 12554 \u2013 A Special \u201cHappy Birthday\u201d Song!!!\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12554-a-special-happy-birthday-song.html\">12554\u00a0&#8211;\u00a0A Special &#8220;Happy Birthday&#8221; Song!!!<\/a><\/li>\n<li>IOI 2010 &#8211; Cluedo<\/li>\n<li>IOI 2010 &#8211; Memory<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Medium<\/span><\/p>\n<ul class=\"custom\">\n<li><a title=\"UVA 119 \u2013 Greedy Gift Givers\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-119-greedy-gift-givers.html\">119\u00a0&#8211;\u00a0Greedy Gift Givers<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 573 \u2013 The Snail\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-573-the-snail.html\">573\u00a0&#8211;\u00a0The Snail<\/a><\/li>\n<li><a title=\"UVA 661 \u2013 Blowing Fuses\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-661-blowing-fuses.html\">661\u00a0&#8211;\u00a0Blowing Fuses<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 10141 \u2013 Request for Proposal\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10141-request-for-proposal.html\">10141\u00a0&#8211;\u00a0Request for Proposal<\/a><\/li>\n<li><a title=\"UVA 10324 \u2013 Zeros and Ones\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10324-zeros-and-ones.html\">10324\u00a0&#8211;\u00a0Zeros and Ones<\/a><\/li>\n<li><a title=\"UVA 10424 \u2013 Love Calculator\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10424-love-calculator.html\">10424\u00a0&#8211;\u00a0Love Calculator<\/a><\/li>\n<li><a title=\"UVA 10919 \u2013 Prerequisites?\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10919-prerequisites.html\">10919\u00a0&#8211;\u00a0Prerequisites?<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 11507 \u2013 Bender B. Rodr\u00edguez Problem\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11507-bender-b-rodriguez-problem.html\">11507\u00a0&#8211;\u00a0Bender B. Rodr\u00edguez Problem<\/a><\/li>\n<li><a title=\"UVA 11586 \u2013 Train Tracks\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11586-train-tracks.html\">11586\u00a0&#8211;\u00a0Train Tracks<\/a><\/li>\n<li><a title=\"UVA 11661 \u2013 Burger Time?\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11661-burger-time.html\">11661\u00a0&#8211;\u00a0Burger Time?<\/a><\/li>\n<li><a title=\"UVA 11683 \u2013 Laser Sculpture\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11683-laser-sculpture.html\">11683\u00a0&#8211;\u00a0Laser Sculpture<\/a><\/li>\n<li><a title=\"UVA 11687 \u2013 Digits\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11687-digits.html\">11687\u00a0&#8211;\u00a0Digits<\/a><\/li>\n<li><a title=\"UVA 11956 \u2013 Brainfuck\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11956-brainfuck.html\">11956\u00a0&#8211;\u00a0Brainfuck<\/a><\/li>\n<li><a title=\"UVA 12478 \u2013 Hardest Problem Ever (Easy)\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/algorithms\/uva-12478-hardest-problem-ever-easy.html\">12478\u00a0&#8211;\u00a0Hardest Problem Ever (Easy)<\/a><\/li>\n<li>IOI 2009 &#8211; Garage<\/li>\n<li>IOI 2009 &#8211; POI<\/li>\n<\/ul>\n<h3>Ad Hoc Problems<\/h3>\n<p><span style=\"text-decoration: underline;\">Game (Card)<\/span><\/p>\n<ul class=\"custom\">\n<li><a title=\"UVA 162 \u2013 Beggar My Neighbour\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/algorithms\/uva-162-beggar-my-neighbour.html\">162\u00a0&#8211;\u00a0Beggar My Neighbour<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 462 \u2013 Bridge Hand Evaluator\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-462-bridge-hand-evaluator.html\">462\u00a0&#8211;\u00a0Bridge Hand Evaluator<\/a><\/li>\n<li>555\u00a0&#8211;\u00a0Bridge Hands<\/li>\n<li><a title=\"UVA 10205 \u2013 Stack \u2018em Up\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10205-stack-em-up.html\">10205\u00a0&#8211;\u00a0Stack &#8217;em Up<\/a><\/li>\n<li>10315\u00a0&#8211;\u00a0Poker Hands<\/li>\n<li class=\"star\"><a title=\"UVA 10646 \u2013 What is the Card?\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10646-what-is-the-card.html\">10646\u00a0&#8211;\u00a0What is the Card?<\/a><\/li>\n<li>11225\u00a0&#8211;\u00a0Tarot scores.<\/li>\n<li>11678\u00a0&#8211;\u00a0Cards&#8217; Exchange<\/li>\n<li class=\"star\"><a title=\"UVA 12247 \u2013 Jollo\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12247-jollo.html\">12247\u00a0&#8211;\u00a0Jollo<\/a><\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Game (Chess)<\/span><\/p>\n<ul class=\"custom\">\n<li>255\u00a0&#8211;\u00a0Correct Move<\/li>\n<li class=\"star\"><a title=\"UVA 278 \u2013 Chess\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-278-chess.html\">278\u00a0&#8211;\u00a0Chess<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 696 \u2013 How Many Knights\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-696-how-many-knights.html\">696\u00a0&#8211;\u00a0How Many Knights<\/a><\/li>\n<li><a title=\"UVA 10196 \u2013 Check The Check\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10196-check-the-check.html\">10196\u00a0&#8211;\u00a0Check The Check<\/a><\/li>\n<li class=\"star\"><a title=\"UVA 10284 \u2013 Chessboard in FEN\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10284-chessboard-in-fen.html\">10284\u00a0&#8211;\u00a0Chessboard in FEN<\/a><\/li>\n<li>10849\u00a0&#8211;\u00a0Move the bishop<\/li>\n<li>11494\u00a0&#8211;\u00a0Queen<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Game (Others), Easier<\/span><\/p>\n<ul class=\"custom\">\n<li>340\u00a0&#8211;\u00a0Master-Mind Hints<\/li>\n<li class=\"star\"><a title=\"UVA 489 \u2013 Hangman Judge\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-489-hangman-judge.html\">489\u00a0&#8211;\u00a0Hangman Judge<\/a><\/li>\n<li>947\u00a0&#8211;\u00a0Master Mind Helper<\/li>\n<li class=\"star\"><a title=\"UVA 10189 \u2013 Minesweeper\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10189-minesweeper.html\">10189\u00a0&#8211;\u00a0Minesweeper<\/a><\/li>\n<li>10279\u00a0&#8211;\u00a0Mine Sweeper<\/li>\n<li>10409\u00a0&#8211;\u00a0Die Game<\/li>\n<li>10530\u00a0&#8211;\u00a0Guessing Game<\/li>\n<li class=\"star\"><a title=\"UVA 11459 \u2013 Snakes and Ladders\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-11459-snakes-and-ladders.html\">11459\u00a0&#8211;\u00a0Snakes and Ladders<\/a><\/li>\n<li>12239\u00a0&#8211;\u00a0Bingo!<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Game (Others), Harder (more tedious)<\/span><\/p>\n<ul class=\"custom\">\n<li>114\u00a0&#8211;\u00a0Simulation Wizardry<\/li>\n<li>141\u00a0&#8211;\u00a0The Spot Game<\/li>\n<li>220\u00a0&#8211;\u00a0Othello<\/li>\n<li>227\u00a0&#8211;\u00a0Puzzle<\/li>\n<li>232\u00a0&#8211;\u00a0Crossword Answers<\/li>\n<li>339\u00a0&#8211;\u00a0SameGame Simulation<\/li>\n<li>379\u00a0&#8211;\u00a0Hi-Q<\/li>\n<li class=\"star\">584\u00a0&#8211;\u00a0Bowling<\/li>\n<li>647\u00a0&#8211;\u00a0Chutes and Ladders<\/li>\n<li>10363\u00a0&#8211;\u00a0Tic Tac Toe<\/li>\n<li class=\"star\">10443\u00a0&#8211;\u00a0Rock, Scissors, Paper<\/li>\n<li class=\"star\">10813\u00a0&#8211;\u00a0Traditional BINGO<\/li>\n<li>10903\u00a0&#8211;\u00a0Rock-Paper-Scissors Tournament<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Palindrome<\/span><\/p>\n<ul class=\"custom\">\n<li>353\u00a0&#8211;\u00a0Pesky Palindromes<\/li>\n<li class=\"star\">401\u00a0&#8211;\u00a0Palindromes<\/li>\n<li>10018\u00a0&#8211;\u00a0Reverse and Add<\/li>\n<li class=\"star\">10945\u00a0&#8211;\u00a0Mother bear<\/li>\n<li class=\"star\">11221\u00a0&#8211;\u00a0Magic square palindromes.<\/li>\n<li>11309\u00a0&#8211;\u00a0Counting Chaos<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Anagram<\/span><\/p>\n<ul class=\"custom\">\n<li>148\u00a0&#8211;\u00a0Anagram checker<\/li>\n<li class=\"star\">156\u00a0&#8211;\u00a0Ananagrams<\/li>\n<li class=\"star\">195\u00a0&#8211;\u00a0Anagram<\/li>\n<li class=\"star\">454\u00a0&#8211;\u00a0Anagrams<\/li>\n<li>630\u00a0&#8211;\u00a0Anagrams (II)<\/li>\n<li>642\u00a0&#8211;\u00a0Word Amalgamation<\/li>\n<li>10098\u00a0&#8211;\u00a0Generating Fast<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Interesting Real Life Problems, Easier<\/span><\/p>\n<ul class=\"custom\">\n<li class=\"star\">161\u00a0&#8211;\u00a0Traffic Lights<\/li>\n<li>187\u00a0&#8211;\u00a0Transaction Processing<\/li>\n<li>362\u00a0&#8211;\u00a018,000 Seconds Remaining<\/li>\n<li class=\"star\">637\u00a0&#8211;\u00a0Booklet Printing<\/li>\n<li>857\u00a0&#8211;\u00a0Quantiser<\/li>\n<li>10082\u00a0&#8211;\u00a0WERTYU<\/li>\n<li>10191\u00a0&#8211;\u00a0Longest Nap<\/li>\n<li>10528\u00a0&#8211;\u00a0Major Scales<\/li>\n<li>10554\u00a0&#8211;\u00a0Calories from Fat<\/li>\n<li class=\"star\">10812\u00a0&#8211;\u00a0Beat the Spread!<\/li>\n<li>11530\u00a0&#8211;\u00a0SMS Typing<\/li>\n<li>11945\u00a0&#8211;\u00a0Financial Management<\/li>\n<li>11984\u00a0&#8211;\u00a0A Change in Thermal Unit<\/li>\n<li>12195\u00a0&#8211;\u00a0Jingle Composing<\/li>\n<li>12555\u00a0&#8211;\u00a0Baby Me<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Interesting Real Life Problems, Harder (more tedious)<\/span><\/p>\n<ul class=\"custom\">\n<li>139\u00a0&#8211;\u00a0Telephone Tangles<\/li>\n<li>145\u00a0&#8211;\u00a0Gondwanaland Telecom<\/li>\n<li>333\u00a0&#8211;\u00a0Recognizing Good ISBNs<\/li>\n<li>346\u00a0&#8211;\u00a0Getting Chorded<\/li>\n<li class=\"star\">403\u00a0&#8211;\u00a0Postscript<\/li>\n<li>447\u00a0&#8211;\u00a0Population Explosion<\/li>\n<li>448\u00a0&#8211;\u00a0OOPS!<\/li>\n<li>449\u00a0&#8211;\u00a0Majoring in Scales<\/li>\n<li>457\u00a0&#8211;\u00a0Linear Cellular Automata<\/li>\n<li>538\u00a0&#8211;\u00a0Balancing Bank Accounts<\/li>\n<li class=\"star\">608\u00a0&#8211;\u00a0Counterfeit Dollar<\/li>\n<li>706\u00a0&#8211;\u00a0LCD Display<\/li>\n<li class=\"star\">1061\u00a0&#8211;\u00a0Consanguine Calculations<\/li>\n<li>10415\u00a0&#8211;\u00a0Eb Alto Saxophone Player<\/li>\n<li>10659\u00a0&#8211;\u00a0Fitting Text into Slides<\/li>\n<li>11223\u00a0&#8211;\u00a0O: dah dah dah!<\/li>\n<li>11743\u00a0&#8211;\u00a0Credit Check<\/li>\n<li>12342\u00a0&#8211;\u00a0Tax Calculator<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">Time<\/span><\/p>\n<ul class=\"custom\">\n<li>170\u00a0&#8211;\u00a0Clock Patience<\/li>\n<li>300\u00a0&#8211;\u00a0Maya Calendar<\/li>\n<li class=\"star\">579\u00a0&#8211;\u00a0Clock Hands<\/li>\n<li class=\"star\">893\u00a0&#8211;\u00a0Y3K Problem<\/li>\n<li>10070\u00a0&#8211;\u00a0Leap Year or Not Leap Year and &#8230;<\/li>\n<li>10339\u00a0&#8211;\u00a0Watching Watches<\/li>\n<li>10371\u00a0&#8211;\u00a0Time Zones<\/li>\n<li>10683\u00a0&#8211;\u00a0The decadary watch<\/li>\n<li>11219\u00a0&#8211;\u00a0How old are you?<\/li>\n<li>11356\u00a0&#8211;\u00a0Dates<\/li>\n<li>11650\u00a0&#8211;\u00a0Mirror Clock<\/li>\n<li>11677\u00a0&#8211;\u00a0Alarm Clock<\/li>\n<li class=\"star\">11947\u00a0&#8211;\u00a0Cancer or Scorpio<\/li>\n<li>11958\u00a0&#8211;\u00a0Coming Home<\/li>\n<li>12019\u00a0&#8211;\u00a0Doom&#8217;s Day Algorithm<\/li>\n<li>12136\u00a0&#8211;\u00a0Schedule of a Married Man<\/li>\n<li>12148\u00a0&#8211;\u00a0Electricity<\/li>\n<li>12439\u00a0&#8211;\u00a0February 29<\/li>\n<li>12531\u00a0&#8211;\u00a0Hours and Minutes<\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">&#8216;Time Waster&#8217; Problems<\/span><\/p>\n<ul class=\"custom\">\n<li>144\u00a0&#8211;\u00a0Student Grants<\/li>\n<li>214\u00a0&#8211;\u00a0Code Generation<\/li>\n<li>335\u00a0&#8211;\u00a0Processing MX Records<\/li>\n<li>337\u00a0&#8211;\u00a0Interpreting Control Sequences<\/li>\n<li>349\u00a0&#8211;\u00a0Transferable Voting (II)<\/li>\n<li>381\u00a0&#8211;\u00a0Making the Grade<\/li>\n<li>405\u00a0&#8211;\u00a0Message Routing<\/li>\n<li class=\"star\">556\u00a0&#8211;\u00a0Amazing<\/li>\n<li>603\u00a0&#8211;\u00a0Parking Lot<\/li>\n<li>830\u00a0&#8211;\u00a0Shark<\/li>\n<li>945\u00a0&#8211;\u00a0Loading a Cargo Ship<\/li>\n<li>10033\u00a0&#8211;\u00a0Interpreter<\/li>\n<li>10134\u00a0&#8211;\u00a0AutoFish<\/li>\n<li>10142\u00a0&#8211;\u00a0Australian Voting<\/li>\n<li>10188\u00a0&#8211;\u00a0Automated Judge Script<\/li>\n<li>10267\u00a0&#8211;\u00a0Graphical Editor<\/li>\n<li>10961\u00a0&#8211;\u00a0Chasing After Don Giovanni<\/li>\n<li>11140\u00a0&#8211;\u00a0Little Ali&#8217;s Little Brother!<\/li>\n<li>11717\u00a0&#8211;\u00a0Energy Saving Microcontroller<\/li>\n<li class=\"star\">12060\u00a0&#8211;\u00a0All Integer Average<\/li>\n<li class=\"star\">12085\u00a0&#8211;\u00a0Mobile Casanova<\/li>\n<li>12608\u00a0&#8211;\u00a0Garbage Collection<\/li>\n<\/ul>\n<hr \/>\n<h2><strong>Data Structures and Libraries<\/strong><\/h2>\n<h3>Programming exercies involving linear data structures (and algorithms) with libraries<\/h3>\n<p><span style=\"text-decoration: underline;\">1D Array Manipulation<\/span><\/p>\n<ul class=\"custom\">\n<li>230\u00a0&#8211;\u00a0Borrowers<\/li>\n<li>394\u00a0&#8211;\u00a0Mapmaker<\/li>\n<li>414\u00a0&#8211;\u00a0Machined Surfaces<\/li>\n<li>467\u00a0&#8211;\u00a0Synching Signals<\/li>\n<li>482\u00a0&#8211;\u00a0Permutation Arrays<\/li>\n<li>591\u00a0&#8211;\u00a0Box of Bricks<\/li>\n<li>665\u00a0&#8211;\u00a0False coin<\/li>\n<li>755\u00a0&#8211;\u00a0487-3279<\/li>\n<li class=\"star\"><a title=\"UVA 10038 \u2013 Jolly Jumpers\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/10038-jolly-jumpers.html\">10038\u00a0&#8211;\u00a0Jolly Jumpers<\/a><\/li>\n<li><a title=\"UVA 10050 \u2013 Hartals\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-10050-hartals.html\">10050\u00a0&#8211;\u00a0Hartals<\/a><\/li>\n<li>10260\u00a0&#8211;\u00a0Soundex<\/li>\n<li>10978\u00a0&#8211;\u00a0Let&#8217;s Play Magic!<\/li>\n<li>11093\u00a0&#8211;\u00a0Just Finish it up<\/li>\n<li>11192\u00a0&#8211;\u00a0Group Reverse<\/li>\n<li>11222\u00a0&#8211;\u00a0Only I did it!<\/li>\n<li class=\"star\"><a title=\"UVA 11340 \u2013 Newspaper\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/11340-newspaper.html\">11340\u00a0&#8211;\u00a0Newspaper<\/a><\/li>\n<li>11496\u00a0&#8211;\u00a0Musical Loop<\/li>\n<li>11608\u00a0&#8211;\u00a0No Problem<\/li>\n<li>11850\u00a0&#8211;\u00a0Alaska<\/li>\n<li>12150\u00a0&#8211;\u00a0Pole Position<\/li>\n<li class=\"star\"><a title=\"UVA 12356 \u2013 Army Buddies\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-12356-army-buddies.html\">12356\u00a0&#8211;\u00a0Army Buddies<\/a><\/li>\n<\/ul>\n<p><span style=\"text-decoration: underline;\">2D Array Manipulation<\/span><\/p>\n<ul class=\"custom\">\n<li><a title=\"UVA 101 \u2013 The Blocks Problem\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/programming\/uva-online-judge\/uva-101-the-blocks-problem.html\">101\u00a0&#8211;\u00a0The Blocks Problem<\/a><\/li>\n<li>434\u00a0&#8211;\u00a0Matty&#8217;s Blocks<\/li>\n<li>466\u00a0&#8211;\u00a0Mirror, Mirror<\/li>\n<li>541\u00a0&#8211;\u00a0Error Correction<\/li>\n<li>10016\u00a0&#8211;\u00a0Flip-Flop the Squarelotron<\/li>\n<li>10703\u00a0&#8211;\u00a0Free spots<\/li>\n<li class=\"star\"><a title=\"UVA 10855 \u2013 Rotated square\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/algorithms\/uva-10855-rotated-square.html\">10855\u00a0&#8211;\u00a0Rotated square<\/a><\/li>\n<li class=\"star\">10920\u00a0&#8211;\u00a0Spiral Tap<\/li>\n<li>11040\u00a0&#8211;\u00a0Add bricks in the wall<\/li>\n<li>11349\u00a0&#8211;\u00a0Symmetric Matrix<\/li>\n<li>11360\u00a0&#8211;\u00a0Have Fun with Matrices<\/li>\n<li class=\"star\">11581\u00a0&#8211;\u00a0Grid Successors<\/li>\n<li>11835\u00a0&#8211;\u00a0Formula 1<\/li>\n<li>12187\u00a0&#8211;\u00a0Brothers<\/li>\n<li>12291\u00a0&#8211;\u00a0Polyomino Composer<\/li>\n<li>12398\u00a0&#8211;\u00a0NumPuzz I<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Below are my solutions to programming problems mentioned in the book. The book also has theoretical problems which I am not going to include. The book is by\u00a0Steven Halim\u00a0and Felix Halim\u00a0and you can grab yourself a copy. If money is an issue, the first edition of the book has now been made free which you &hellip; <a href=\"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Competitive Programming 3: The New Lower Bound of Programming Contests<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"page-template-wide.php","meta":{"jetpack_post_was_ever_published":false,"footnotes":""},"class_list":["post-338","page","type-page","status-publish","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Competitive Programming 3: The New Lower Bound of Programming Contests - Ferocious Coder<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Competitive Programming 3: The New Lower Bound of Programming Contests - Ferocious Coder\" \/>\n<meta property=\"og:description\" content=\"Below are my solutions to programming problems mentioned in the book. The book also has theoretical problems which I am not going to include. The book is by\u00a0Steven Halim\u00a0and Felix Halim\u00a0and you can grab yourself a copy. If money is an issue, the first edition of the book has now been made free which you &hellip; Continue reading Competitive Programming 3: The New Lower Bound of Programming Contests &rarr;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3\" \/>\n<meta property=\"og:site_name\" content=\"Ferocious Coder\" \/>\n<meta property=\"article:modified_time\" content=\"2013-08-18T11:56:16+00:00\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"4 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/competitive-programming-3\",\"url\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/competitive-programming-3\",\"name\":\"Competitive Programming 3: The New Lower Bound of Programming Contests - Ferocious Coder\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#website\"},\"datePublished\":\"2013-08-03T03:39:19+00:00\",\"dateModified\":\"2013-08-18T11:56:16+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/competitive-programming-3#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/competitive-programming-3\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/competitive-programming-3#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Competitive Programming 3: The New Lower Bound of Programming Contests\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/\",\"name\":\"Ferocious Coder\",\"description\":\"RAWR!\",\"publisher\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#\\\/schema\\\/person\\\/1fb5cbee546cffd619a7b301e3dc447a\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#\\\/schema\\\/person\\\/1fb5cbee546cffd619a7b301e3dc447a\",\"name\":\"Rawrosaur\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\",\"caption\":\"Rawrosaur\"},\"logo\":{\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\"},\"sameAs\":[\"http:\\\/\\\/www.ferociouscoder.com\\\/\"]}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Competitive Programming 3: The New Lower Bound of Programming Contests - Ferocious Coder","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3","og_locale":"en_US","og_type":"article","og_title":"Competitive Programming 3: The New Lower Bound of Programming Contests - Ferocious Coder","og_description":"Below are my solutions to programming problems mentioned in the book. The book also has theoretical problems which I am not going to include. The book is by\u00a0Steven Halim\u00a0and Felix Halim\u00a0and you can grab yourself a copy. If money is an issue, the first edition of the book has now been made free which you &hellip; Continue reading Competitive Programming 3: The New Lower Bound of Programming Contests &rarr;","og_url":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3","og_site_name":"Ferocious Coder","article_modified_time":"2013-08-18T11:56:16+00:00","twitter_misc":{"Est. reading time":"4 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3","url":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3","name":"Competitive Programming 3: The New Lower Bound of Programming Contests - Ferocious Coder","isPartOf":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/#website"},"datePublished":"2013-08-03T03:39:19+00:00","dateModified":"2013-08-18T11:56:16+00:00","breadcrumb":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.ferociouscoder.com\/blog\/competitive-programming-3#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.ferociouscoder.com\/blog"},{"@type":"ListItem","position":2,"name":"Competitive Programming 3: The New Lower Bound of Programming Contests"}]},{"@type":"WebSite","@id":"https:\/\/www.ferociouscoder.com\/blog\/#website","url":"https:\/\/www.ferociouscoder.com\/blog\/","name":"Ferocious Coder","description":"RAWR!","publisher":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/#\/schema\/person\/1fb5cbee546cffd619a7b301e3dc447a"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.ferociouscoder.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":["Person","Organization"],"@id":"https:\/\/www.ferociouscoder.com\/blog\/#\/schema\/person\/1fb5cbee546cffd619a7b301e3dc447a","name":"Rawrosaur","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg","url":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg","caption":"Rawrosaur"},"logo":{"@id":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg"},"sameAs":["http:\/\/www.ferociouscoder.com\/"]}]}},"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/P1mYMV-5s","jetpack_likes_enabled":true,"_links":{"self":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/pages\/338","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/comments?post=338"}],"version-history":[{"count":27,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/pages\/338\/revisions"}],"predecessor-version":[{"id":399,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/pages\/338\/revisions\/399"}],"wp:attachment":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/media?parent=338"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}