Home
Problem
Status
Contest
User
Group
Forum
Article
Register
Login
{"likeCnt":6,"createTime":"Dec 3, 2018 2:30:27 PM","author":"shizhan","viewCnt":1176,"id":769,"title":"Competitve Programming 4-5","trustable":false,"dislikeCnt":0,"content":"chapter 4\nGraph Traversal \n Just Graph Traversal \n[problem:UVA-118] - Mutant Flatworld Explorers \n[problem:UVA-168] - Theseus and the Minotaur \n[problem:UVA-280] - Vertex \n[problem:UVA-318] - Domino Effect \n[problem:UVA-614] - Mapping the Route \n[problem:UVA-824] - Coast Tracker \n[problem:UVA-10113] - Exchange Rates \n[problem:UVA-10116] - Robot Motion \n[problem:UVA-10377] - Maze Traversal \n[problem:UVA-10687] - Monitoring the Amazon \n[problem:UVA-11831] - Sticker Collector Robot ★ \n[problem:UVA-11902] - Dominator \n[problem:UVA-11906] - Knight in a War Grid ★ \n[problem:UVA-12376] - As Long as I Learn, I Live \n[problem:UVA-12442] - Forwarding Emails ★ \n[problem:UVA-12582] - Wedding of Sultan \n Flood Fill/Finding Connected Components \n[problem:UVA-260] - Il Gioco dell\u0027X \n[problem:UVA-352] - The Seasonal War \n[problem:UVA-459] - Graph Connectivity \n[problem:UVA-469] - Wetlands of Florida \n[problem:UVA-572] - Oil Deposits \n[problem:UVA-657] - The die is cast \n[problem:UVA-722] - Lakes \n[problem:UVA-758] - The Same Game \n[problem:UVA-776] - Monkeys in a Regular Forest \n[problem:UVA-782] - Contour Painting \n[problem:UVA-784] - Maze Exploration \n[problem:UVA-785] - Grid Colouring \n[problem:UVA-852] - Deciding victory in Go \n[problem:UVA-871] - Counting Cells in a Blob \n[problem:UVA-1103] - Ancient Messages ★ \n[problem:UVA-10336] - Rank the Languages \n[problem:UVA-10707] - 2D\n[problem:UVA-10946] - You want what filled? \n[problem:UVA-11094] - Continents ★ \n[problem:UVA-11110] - Equidivisions \n[problem:UVA-11244] - Counting Stars \n[problem:UVA-11470] - Square Sums \n[problem:UVA-11518] - Dominos 2 \n[problem:UVA-11561] - Getting Gold \n[problem:UVA-11749] - Poor Trade Advisor \n[problem:UVA-11953] - Battleships ★ \n Topological Sort \n[problem:UVA-124] - Following Orders \n[problem:UVA-200] - Rare Order \n[problem:UVA-872] - Ordering ★ \n[problem:UVA-10305] - Ordering Tasks ★ \n[problem:UVA-11060] - Beverages ★ \n[problem:UVA-11686] - Pick up sticks \n Bipartite Graph Check \n[problem:UVA-10004] - Bicoloring ★ \n[problem:UVA-10505] - Montesco vs Capuleto \n[problem:UVA-11080] - Place the Guards ★ \n[problem:UVA-11396] - Claw Decomposition ★ \n Finding Articulation Points/Bridges \n[problem:UVA-315] - Network ★ \n[problem:UVA-610] - Street Directions \n[problem:UVA-796] - Critical Links ★ \n[problem:UVA-10199] - Tourist Guide \n[problem:UVA-10765] - Doves and bombs ★ \n Finding Strongly Connected Components \n[problem:UVA-247] - Calling Circles ★ \n[problem:UVA-1229] - Sub\n[problem:UVA-10731] - Test \n[problem:UVA-11504] - Dominos ★ \n[problem:UVA-11709] - Trust groups \n[problem:UVA-11770] - Lighting Away \n[problem:UVA-11838] - Come and Go ★ \nMinimum Spanning Tree \n Standard \n[problem:UVA-908] - Re\n[problem:UVA-1174] - IP\n[problem:UVA-1208] - Oreon \n[problem:UVA-1235] - Anti Brute Force Lock \n[problem:UVA-10034] - Freckles \n[problem:UVA-11228] - Transportation system. ★ \n[problem:UVA-11631] - Dark roads ★ \n[problem:UVA-11710] - Expensive subway \n[problem:UVA-11733] - Airports \n[problem:UVA-11747] - Heavy Cycle Edges ★ \n[problem:UVA-11857] - Driving Range \n Variants \n[problem:UVA-534] - Frogger \n[problem:UVA-544] - Heavy Cargo \n[problem:UVA-1160] - X\n[problem:UVA-1216] - The Bug Sensor Problem \n[problem:UVA-1234] - RACING \n[problem:UVA-10048] - Audiophobia ★ \n[problem:UVA-10099] - The Tourist Guide \n[problem:UVA-10147] - Highways \n[problem:UVA-10369] - Arctic Network ★ \n[problem:UVA-10397] - Connect the Campus \n[problem:UVA-10462] - Is There A Second Way Left? \n[problem:UVA-10600] - ACM Contest and Blackout ★ \n[problem:UVA-10842] - Traffic Flow \nSingle-Source Shortest Paths \n On Unweighted Graph: BFS, Easier \n[problem:UVA-336] - A Node Too Far \n[problem:UVA-383] - Shipping Routes \n[problem:UVA-388] - Galactic Import \n[problem:UVA-429] - Word Transformation ★ \n[problem:UVA-627] - The Net \n[problem:UVA-762] - We Ship Cheap \n[problem:UVA-924] - Spreading The News ★ \n[problem:UVA-1148] - The mysterious X network \n[problem:UVA-10009] - All Roads Lead Where? \n[problem:UVA-10422] - Knights in FEN \n[problem:UVA-10610] - Gopher and Hawks \n[problem:UVA-10653] - Bombs! NO they are Mines!! ★ \n[problem:UVA-10959] - The Party, Part I \n On Unweighted Graph: BFS, Harder \n[problem:UVA-314] - Robot ★ \n[problem:UVA-532] - Dungeon Master \n[problem:UVA-859] - Chinese Checkers \n[problem:UVA-949] - Getaway \n[problem:UVA-10044] - Erdos Numbers \n[problem:UVA-10067] - Playing with Wheels \n[problem:UVA-10150] - Doublets \n[problem:UVA-10977] - Enchanted Forest \n[problem:UVA-11049] - Basic wall maze \n[problem:UVA-11101] - Mall Mania ★ \n[problem:UVA-11352] - Crazy King \n[problem:UVA-11624] - Fire! \n[problem:UVA-11792] - Krochanska is Here! \n[problem:UVA-12160] - Unlock the Lock ★ \n On Weighted Graph: Dijkstra\u0027s, Easier \n[problem:UVA-929] - Number Maze ★ \n[problem:UVA-1112] - Mice and Maze ★ \n[problem:UVA-10389] - Subway \n[problem:UVA-10986] - Sending email ★ \n On Weighted Graph: Dijkstra\u0027s, Harder \n[problem:UVA-1202] - Finding Nemo \n[problem:UVA-10166] - Travel \n[problem:UVA-10187] - From Dusk Till Dawn \n[problem:UVA-10278] - Fire Station \n[problem:UVA-10356] - Rough Roads \n[problem:UVA-10603] - Fill \n[problem:UVA-10801] - Lift Hopping ★ \n[problem:UVA-10967] - The Great Escape \n[problem:UVA-11338] - Minefield \n[problem:UVA-11367] - Full Tank? \n[problem:UVA-11377] - Airport Setup \n[problem:UVA-11492] - Babel ★ \n[problem:UVA-11833] - Route Change \n[problem:UVA-12047] - Highest Paid Toll ★ \n[problem:UVA-12144] - Almost Shortest Path \n On Graph with Negative Weight Cycle: Bellman Ford\u0027s \n[problem:UVA-558] - Wormholes ★ \n[problem:UVA-10449] - Traffic ★ \n[problem:UVA-10557] - XYZZY ★ \n[problem:UVA-11280] - Flying to Fredericton \nAll-Pairs Shortest Paths \n Standard \n[problem:UVA-341] - Non\n[problem:UVA-423] - MPI Maelstrom \n[problem:UVA-567] - Risk \n[problem:UVA-821] - Page Hopping ★ \n[problem:UVA-1233] - USHER \n[problem:UVA-1247] - Interstar Transport \n[problem:UVA-10171] - Meeting Prof. Miguel... ★ \n[problem:UVA-10354] - Avoiding Your Boss \n[problem:UVA-10525] - New to Bangladesh? \n[problem:UVA-10724] - Road Construction \n[problem:UVA-10793] - The Orc Attack \n[problem:UVA-10803] - Thunder Mountain \n[problem:UVA-10947] - Bear with me, again.. \n[problem:UVA-11015] - 05\n[problem:UVA-11463] - Commandos ★ \n[problem:UVA-12319] - Edgetown\u0027s Traffic Jams \n Variants \n[problem:UVA-104] - Arbitrage ★ \n[problem:UVA-125] - Numbering Paths \n[problem:UVA-186] - Trip Routing \n[problem:UVA-274] - Cat and Mouse \n[problem:UVA-436] - Arbitrage \n[problem:UVA-334] - Identifying Concurrent Events ★ \n[problem:UVA-869] - Airline Comparison \n[problem:UVA-925] - No more prerequisites, please! \n[problem:UVA-1056] - Degrees of Separation ★ \n[problem:UVA-1198] - The Geodetic Set Problem \n[problem:UVA-11047] - The Scrooge Co Problem \nNetwork Flow \n Standard Max Flow Problem \n[problem:UVA-259] - Software Allocation ★ \n[problem:UVA-820] - Internet Bandwidth ★ \n[problem:UVA-10092] - The Problem with the Problem Setter \n[problem:UVA-10511] - Councilling \n[problem:UVA-10779] - Collectors Problem \n[problem:UVA-11045] - My T\n[problem:UVA-11167] - Monkeys in the Emei Mountain ★ \n[problem:UVA-11418] - Clever Naming Patterns \n Variants \n[problem:UVA-10330] - Power Transmission \n[problem:UVA-10480] - Sabotage \n[problem:UVA-11380] - Down Went The Titanic ★ \n[problem:UVA-11506] - Angry Programmer ★ π \n[problem:UVA-12125] - March of the Penguins ★ \nSpecial Graphs \n Tree \n[problem:UVA-112] - Tree Summing \n[problem:UVA-115] - Climbing Trees \n[problem:UVA-122] - Trees on the level \n[problem:UVA-536] - Tree Recovery \n[problem:UVA-548] - Tree \n[problem:UVA-615] - Is It A Tree? \n[problem:UVA-699] - The Falling Leaves \n[problem:UVA-712] - S\n[problem:UVA-839] - Not so Mobile \n[problem:UVA-10308] - Roads in the North \n[problem:UVA-10459] - The Tree Root ★ \n[problem:UVA-10701] - Pre, in and post \n[problem:UVA-10805] - Cockroach Escape Networks ★ \n[problem:UVA-11131] - Close Relatives \n[problem:UVA-11234] - Expressions \n[problem:UVA-11615] - Family Tree \n[problem:UVA-11695] - Flight Planning ★ \n[problem:UVA-12186] - Another Crisis \n[problem:UVA-12347] - Binary Search Tree \n Eulerian Graph \n[problem:UVA-117] - The Postal Worker Rings Once \n[problem:UVA-291] - The House Of Santa Claus \n[problem:UVA-10054] - The Necklace ★ \n[problem:UVA-10129] - Play on Words \n[problem:UVA-10203] - Snow Clearing ★ \n[problem:UVA-10596] - Morning Walk ★ \n Bipartite Graph \n[problem:UVA-663] - Sorting Slides \n[problem:UVA-670] - The dog task \n[problem:UVA-753] - A Plug for UNIX \n[problem:UVA-1194] - Machine Schedule \n[problem:UVA-10080] - Gopher II \n[problem:UVA-10349] - Antenna Placement ★ \n[problem:UVA-11138] - Nuts and Bolts ★ \n[problem:UVA-11159] - Factors and Multiples ★ \n[problem:UVA-11419] - SAM I AM \n[problem:UVA-12083] - Guardian of Decency \n[problem:UVA-12168] - Cat vs. Dog \nSpecial Graph \n Single-Source Shortest/Longest Paths on DAG \n[problem:UVA-103] - Stacking Boxes \n[problem:UVA-452] - Project Scheduling ★ \n[problem:UVA-10000] - Longest Paths \n[problem:UVA-10051] - Tower of Cubes \n[problem:UVA-10259] - Hippity Hopscotch \n[problem:UVA-10285] - Longest Run on a Snowboard ★ \n[problem:UVA-10350] - Liftless EME ★ \n Counting Paths in DAG \n[problem:UVA-825] - Walking on the Safe Side \n[problem:UVA-926] - Walking Around Wisely \n[problem:UVA-986] - How Many? \n[problem:UVA-988] - Many Paths, One Destination ★ \n[problem:UVA-10401] - Injured Queen Problem ★ \n[problem:UVA-10926] - How Many Dependencies? \n[problem:UVA-11067] - Little Red Riding Hood \n[problem:UVA-11655] - Waterland \n[problem:UVA-11957] - Checkers ★ \n Converting General Graph to DAG \n[problem:UVA-590] - Always on the run \n[problem:UVA-907] - Winterim Backpacking Trip ★ \n[problem:UVA-910] - TV game \n[problem:UVA-10201] - Adventures in Moving \n[problem:UVA-10543] - Traveling Politician \n[problem:UVA-10681] - Teobaldo\u0027s Trip \n[problem:UVA-10702] - Travelling Salesman \n[problem:UVA-10874] - Segments \n[problem:UVA-10913] - Walking on a Grid ★ \n[problem:UVA-11307] - Alternative Arborescence \n[problem:UVA-11487] - Gathering Food ★ \n[problem:UVA-11545] - Avoiding Jungle in the Dark \n[problem:UVA-11782] - Optimal Cut \n\nchapter 5\nAd Hoc Mathematics Problems \n The Simpler Ones \n[problem:UVA-10055] - Hashmat the Brave Warrior \n[problem:UVA-10071] - Back to High School Physics \n[problem:UVA-10281] - Average Speed \n[problem:UVA-10469] - To Carry or not to Carry \n[problem:UVA-10773] - Back to Intermediate Math ★ \n[problem:UVA-11614] - Etruscan Warriors Never Play Chess \n[problem:UVA-11723] - Numbering Roads ★ \n[problem:UVA-11805] - Bafana Bafana \n[problem:UVA-11875] - Brick Game ★ \n[problem:UVA-12149] - Feynman \n[problem:UVA-12502] - Three Families \n Mathematical Simulation \n[problem:UVA-100] - The 3n + 1 problem \n[problem:UVA-371] - Ackermann Functions \n[problem:UVA-382] - Perfection ★ \n[problem:UVA-834] - Continued Fractions \n[problem:UVA-906] - Rational Neighbor \n[problem:UVA-1225] - Digit Counting ★ \n[problem:UVA-10035] - Primary Arithmetic \n[problem:UVA-10346] - Peter\u0027s Smokes ★ \n[problem:UVA-10370] - Above Average \n[problem:UVA-10783] - Odd Sum \n[problem:UVA-10879] - Code Refactoring \n[problem:UVA-11150] - Cola \n[problem:UVA-11247] - Income Tax \n[problem:UVA-11313] - Gourmet Games \n[problem:UVA-11689] - Soda Surpler \n[problem:UVA-11877] - The Coco\n[problem:UVA-11934] - Magic Formula \n[problem:UVA-12290] - Counting Game \n[problem:UVA-12527] - Different Digits \n Mathematical Simulation \n[problem:UVA-493] - Rational Spiral \n[problem:UVA-550] - Multiplying by Rotation \n[problem:UVA-616] - Coconuts, Revisited ★ \n[problem:UVA-697] - Jack and Jill \n[problem:UVA-846] - Steps \n[problem:UVA-10025] - The ? 1 ? 2 ? ... ? n \u003d k problem \n[problem:UVA-10257] - Dick and Jane \n[problem:UVA-10624] - Super Number \n[problem:UVA-11130] - Billiard bounces ★ \n[problem:UVA-11254] - Consecutive Integers ★ \n[problem:UVA-11968] - In The Airport \n Finding Pattern or Formula, easier \n[problem:UVA-10014] - Simple calculations \n[problem:UVA-10170] - The Hotel with Infinite Rooms \n[problem:UVA-10499] - The Land of Justice \n[problem:UVA-10696] - f91 \n[problem:UVA-10751] - Chessboard ★ \n[problem:UVA-10940] - Throwing cards away II ★ \n[problem:UVA-11202] - The least possible effort \n[problem:UVA-12004] - Bubble Sort ★ \n[problem:UVA-12027] - Very Big Perfect Squares \n Finding Pattern or Formula, harder \n[problem:UVA-651] - Deck \n[problem:UVA-913] - Joana and the Odd Numbers \n[problem:UVA-10161] - Ant on a Chessboard ★ \n[problem:UVA-10493] - Cats, with or without Hats \n[problem:UVA-10509] - R U Kidding Mr. Feynman? \n[problem:UVA-10666] - The Eurocup is Here! \n[problem:UVA-10693] - Traffic Volume \n[problem:UVA-10710] - Chinese Shuffle \n[problem:UVA-10882] - Koerner\u0027s Pub \n[problem:UVA-10970] - Big Chocolate \n[problem:UVA-10994] - Simple Addition \n[problem:UVA-11231] - Black and white painting ★ \n[problem:UVA-11246] - K\n[problem:UVA-11296] - Counting Solutions to an Integral Equation \n[problem:UVA-11298] - Dissecting a Hexagon \n[problem:UVA-11387] - The 3\n[problem:UVA-11393] - Tri\n[problem:UVA-11718] - Fantasy of a Summation ★ \n Grid \n[problem:UVA-264] - Count on Cantor ★ \n[problem:UVA-808] - Bee Breeding \n[problem:UVA-880] - Cantor Fractions \n[problem:UVA-10182] - Bee Maja ★ \n[problem:UVA-10233] - Dermuba Triangle ★ \n[problem:UVA-10620] - A Flea on a Chessboard \n[problem:UVA-10642] - Can You Solve It? \n[problem:UVA-10964] - Strange Planet \n Number Systems or Sequences \n[problem:UVA-136] - Ugly Numbers \n[problem:UVA-138] - Street Numbers \n[problem:UVA-413] - Up and Down Sequences \n[problem:UVA-443] - Humble Numbers ★ \n[problem:UVA-640] - Self Numbers \n[problem:UVA-694] - The Collatz Sequence \n[problem:UVA-962] - Taxicab Numbers \n[problem:UVA-974] - Kaprekar Numbers \n[problem:UVA-10006] - Carmichael Numbers \n[problem:UVA-10042] - Smith Numbers ★ \n[problem:UVA-10049] - Self\n[problem:UVA-10101] - Bangla Numbers \n[problem:UVA-10408] - Farey sequences ★ \n[problem:UVA-10930] - A\n[problem:UVA-11028] - Sum of Product \n[problem:UVA-11063] - B2\n[problem:UVA-11461] - Square Numbers \n[problem:UVA-11660] - Look\n[problem:UVA-11970] - Lucky Numbers \n Logarithm, Exponentiation, Power \n[problem:UVA-107] - The Cat in the Hat \n[problem:UVA-113] - Power of Cryptography \n[problem:UVA-474] - Heads / Tails Probability \n[problem:UVA-545] - Heads \n[problem:UVA-701] - The Archeologists\u0027 Dilemma ★ \n[problem:UVA-1185] - Big Number \n[problem:UVA-10916] - Factstone Benchmark ★ \n[problem:UVA-11384] - Help is needed for Dexter \n[problem:UVA-11556] - Best Compression Ever \n[problem:UVA-11636] - Hello World! \n[problem:UVA-11666] - Logarithms \n[problem:UVA-11714] - Blind Sorting \n[problem:UVA-11847] - Cut the Silver Bar ★ \n[problem:UVA-11986] - Save from Radiation \n[problem:UVA-12416] - Excessive Space Remover \n Polynomial \n[problem:UVA-126] - The Errant Physicist \n[problem:UVA-392] - Polynomial Showdown \n[problem:UVA-498] - Polly the Polynomial ★ \n[problem:UVA-10215] - The Largest/Smallest Box ... \n[problem:UVA-10268] - 498\n[problem:UVA-10302] - Summation of Polynomials \n[problem:UVA-10326] - The Polynomial Equation \n[problem:UVA-10586] - Polynomial Remains ★ \n[problem:UVA-10719] - Quotient Polynomial \n[problem:UVA-11692] - Rain Fall \n Base Number Variants \n[problem:UVA-377] - Cowculations ★ \n[problem:UVA-575] - Skew Binary ★ \n[problem:UVA-636] - Squares \n[problem:UVA-10093] - An Easy Problem! \n[problem:UVA-10677] - Base Equality \n[problem:UVA-10931] - Parity ★ \n[problem:UVA-11005] - Cheapest Base \n[problem:UVA-11121] - Base \n[problem:UVA-11398] - The Base\n[problem:UVA-12602] - Nice Licence Plates \n Just Ad Hoc \n[problem:UVA-276] - Egyptian Multiplication \n[problem:UVA-496] - Simply Subsets \n[problem:UVA-613] - Numbers That Count \n[problem:UVA-10137] - The Trip ★ \n[problem:UVA-10190] - Divide, But Not Quite Conquer! \n[problem:UVA-11055] - Homogeneous squares \n[problem:UVA-11241] - Humidex \n[problem:UVA-11526] - H\n[problem:UVA-11715] - Car \n[problem:UVA-11816] - HST \n[problem:UVA-12036] - Stable Grid ★ \nJava BigInteger Class \n Basic Features \n[problem:UVA-424] - Integer Inquiry \n[problem:UVA-465] - Overflow \n[problem:UVA-619] - Numerically Speaking \n[problem:UVA-713] - Adding Reversed Numbers ★ \n[problem:UVA-748] - Exponentiation \n[problem:UVA-1226] - Numerical surprises \n[problem:UVA-10013] - Super long sums \n[problem:UVA-10083] - Division \n[problem:UVA-10106] - Product \n[problem:UVA-10198] - Counting \n[problem:UVA-10430] - Dear GOD \n[problem:UVA-10433] - Automorphic Numbers \n[problem:UVA-10494] - If We Were a Child Again \n[problem:UVA-10519] - !! Really Strange !! \n[problem:UVA-10523] - Very Easy !!! ★ \n[problem:UVA-10669] - Three powers \n[problem:UVA-10925] - Krakovia \n[problem:UVA-10992] - The Ghost of Programmers \n[problem:UVA-11448] - Who said crisis? \n[problem:UVA-11664] - Langton\u0027s Ant \n[problem:UVA-11830] - Contract Revision \n[problem:UVA-11879] - Multiple of 17 ★ \n[problem:UVA-12143] - Stopping Doom\u0027s Day \n[problem:UVA-12459] - Bees\u0027 ancestors \n Bonus Features: Base Number Conversion \n[problem:UVA-290] - Palindroms \u003c\n[problem:UVA-343] - What Base Is This? ★ \n[problem:UVA-355] - The Bases Are Loaded \n[problem:UVA-389] - Basically Speaking ★ \n[problem:UVA-446] - Kibbles \"n\" Bits \"n\" Bits \"n\" Bits \n[problem:UVA-10473] - Simple Base Conversion \n[problem:UVA-10551] - Basic Remains ★ \n[problem:UVA-11185] - Ternary \n[problem:UVA-11952] - Arithmetic \n Bonus Features: Primality Testing \n[problem:UVA-960] - Gaussian Primes \n[problem:UVA-1210] - Sum of Consecutive Prime Numbers ★ \n[problem:UVA-10235] - Simply Emirp ★ \n[problem:UVA-10924] - Prime Words \n[problem:UVA-11287] - Pseudoprime Numbers ★ \n[problem:UVA-12542] - Prime Substring \n Bonus Features: Others \n[problem:UVA-1230] - MODEX ★ \n[problem:UVA-10023] - Square root \n[problem:UVA-10193] - All You Need Is Love \n[problem:UVA-10464] - Big Big Real Numbers \n[problem:UVA-10814] - Simplifying Fractions ★ \n[problem:UVA-11821] - High\nCombinatorics \n Fibonacci Numbers \n[problem:UVA-495] - Fibonacci Freeze \n[problem:UVA-580] - Critical Mass \n[problem:UVA-763] - Fibinary Numbers ★ \n[problem:UVA-900] - Brick Wall Patterns \n[problem:UVA-948] - Fibonaccimal Base \n[problem:UVA-1258] - Nowhere Money \n[problem:UVA-10183] - How Many Fibs? \n[problem:UVA-10334] - Ray Through Glasses ★ \n[problem:UVA-10450] - World Cup Noise \n[problem:UVA-10497] - Sweet Child Makes Trouble \n[problem:UVA-10579] - Fibonacci Numbers \n[problem:UVA-10689] - Yet another Number Sequence ★ \n[problem:UVA-10862] - Connect the Cable Wires \n[problem:UVA-11000] - Bee \n[problem:UVA-11089] - Fi\n[problem:UVA-11161] - Help My Brother \n[problem:UVA-11780] - Miles 2 Km \n Binomial Coefficients \n[problem:UVA-326] - Extrapolation Using a Difference Table \n[problem:UVA-369] - Combinations \n[problem:UVA-485] - Pascal\u0027s Triangle of Death \n[problem:UVA-530] - Binomial Showdown \n[problem:UVA-911] - Multinomial Coefficients \n[problem:UVA-10105] - Polynomial Coefficients \n[problem:UVA-10219] - Find the ways ! ★ \n[problem:UVA-10375] - Choose and divide \n[problem:UVA-10532] - Combination! Once Again \n[problem:UVA-10541] - Stripe ★ \n[problem:UVA-11955] - Binomial Theorem ★ \n Catalan Numbers \n[problem:UVA-991] - Safe Salutations ★ \n[problem:UVA-10007] - Count the Trees ★ \n[problem:UVA-10223] - How many nodes ? \n[problem:UVA-10303] - How Many Trees? \n[problem:UVA-10312] - Expression Bracketing ★ \n[problem:UVA-10643] - Facing Problem With Trees \n Others, Easier \n[problem:UVA-11115] - Uncle Jack \n[problem:UVA-11310] - Delivery Debacle ★ \n[problem:UVA-11401] - Triangle Counting ★ \n[problem:UVA-11480] - Jimmy\u0027s Balls \n[problem:UVA-11597] - Spanning Subtree ★ \n[problem:UVA-11609] - Teams \n[problem:UVA-12463] - Little Nephew \n Other, Harder \n[problem:UVA-1224] - Tile Code \n[problem:UVA-10079] - Pizza Cutting \n[problem:UVA-10359] - Tiling \n[problem:UVA-10733] - The Colored Cubes \n[problem:UVA-10784] - Diagonal ★ \n[problem:UVA-10790] - How Many Points of Intersection? \n[problem:UVA-10918] - Tri Tiling \n[problem:UVA-11069] - A Graph Problem ★ \n[problem:UVA-11204] - Musical instruments \n[problem:UVA-11270] - Tiling Dominoes \n[problem:UVA-11538] - Chess Queen ★ \n[problem:UVA-11554] - Hapless Hedonism \n[problem:UVA-12022] - Ordering T\nNumber Theory \n Prime Numbers \n[problem:UVA-406] - Prime Cuts \n[problem:UVA-543] - Goldbach\u0027s Conjecture ★ \n[problem:UVA-686] - Goldbach\u0027s Conjecture \n[problem:UVA-897] - Anagrammatic Primes \n[problem:UVA-914] - Jumping Champion \n[problem:UVA-10140] - Prime Distance ★ \n[problem:UVA-10168] - Summation of Four Primes \n[problem:UVA-10311] - Goldbach and Euler \n[problem:UVA-10394] - Twin Primes ★ \n[problem:UVA-10490] - Mr. Azad and his Son!!!!! \n[problem:UVA-10650] - Determinate Prime \n[problem:UVA-10852] - Less Prime \n[problem:UVA-10948] - The primary problem \n[problem:UVA-11752] - The Super Powers \n GCD and/or LCM \n[problem:UVA-106] - Fermat vs. Pythagoras \n[problem:UVA-332] - Rational Numbers from Repeating Fractions \n[problem:UVA-408] - Uniform Generator \n[problem:UVA-412] - Pi \n[problem:UVA-10407] - Simple division ★ \n[problem:UVA-10892] - LCM Cardinality ★ \n[problem:UVA-11388] - GCD LCM \n[problem:UVA-11417] - GCD \n[problem:UVA-11774] - Doom\u0027s Day \n[problem:UVA-11827] - Maximum GCD ★ \n[problem:UVA-12068] - Harmonic Mean \n Factorial \n[problem:UVA-324] - Factorial Frequencies ★ \n[problem:UVA-568] - Just the Facts \n[problem:UVA-623] - 500! ★ \n[problem:UVA-10220] - I Love Big Numbers ! \n[problem:UVA-10323] - Factorial! You Must be Kidding!!! \n[problem:UVA-10338] - Mischievous Children ★ \n Finding Prime Factors \n[problem:UVA-516] - Prime Land ★ \n[problem:UVA-583] - Prime Factors ★ \n[problem:UVA-10392] - Factoring Large Numbers \n[problem:UVA-11466] - Largest Prime Divisor ★ \n Working with Prime Factors \n[problem:UVA-160] - Factors and Factorials \n[problem:UVA-993] - Product of digits \n[problem:UVA-10061] - How many zero\u0027s and how many digits ? \n[problem:UVA-10139] - Factovisors ★ \n[problem:UVA-10484] - Divisibility of Factors \n[problem:UVA-10527] - Persistent Numbers \n[problem:UVA-10622] - Perfect P\n[problem:UVA-10680] - LCM ★ \n[problem:UVA-10780] - Again Prime? No Time. \n[problem:UVA-10791] - Minimum Sum LCM \n[problem:UVA-11347] - Multifactorials \n[problem:UVA-11395] - Sigma Function \n[problem:UVA-11889] - Benefit ★ \n Functions involving Prime Factors \n[problem:UVA-294] - Divisors ★ \n[problem:UVA-884] - Factorial Factors \n[problem:UVA-1246] - Find Terrorists \n[problem:UVA-10179] - Irreducable Basic Fractions ★ \n[problem:UVA-10299] - Relatives \n[problem:UVA-10820] - Send a Table \n[problem:UVA-10958] - How Many Solutions? \n[problem:UVA-11064] - Number Theory \n[problem:UVA-11086] - Composite Prime \n[problem:UVA-11226] - Reaching the fix\n[problem:UVA-11353] - A Different Kind of Sorting \n[problem:UVA-11728] - Alternate Task ★ \n[problem:UVA-12005] - Find Solutions \n Modified Sieve \n[problem:UVA-10699] - Count the factors ★ \n[problem:UVA-10738] - Riemann vs Mertens ★ \n[problem:UVA-10990] - Another New Function ★ \n[problem:UVA-11327] - Enumerating Rational Numbers \n[problem:UVA-12043] - Divisors \n Modulo Arithmetic \n[problem:UVA-128] - Software CRC \n[problem:UVA-374] - Big Mod ★ \n[problem:UVA-10127] - Ones \n[problem:UVA-10174] - Couple\n[problem:UVA-10176] - Ocean Deep! \n[problem:UVA-10212] - The Last Non\n[problem:UVA-10489] - Boxes of Chocolates \n[problem:UVA-11029] - Leading and Trailing \n Extended Euclid \n[problem:UVA-10090] - Marbles ★ \n[problem:UVA-10104] - Euclid Problem ★ \n[problem:UVA-10633] - Rare Easy Problem \n[problem:UVA-10673] - Play with Floor and Ceil ★ \n Other Number Theory Problems \n[problem:UVA-547] - DDF \n[problem:UVA-756] - Biorhythms \n[problem:UVA-10110] - Light, more light ★ \n[problem:UVA-10922] - 2 the 9s \n[problem:UVA-10929] - You can say 11 \n[problem:UVA-11042] - Complex, difficult and complicated \n[problem:UVA-11344] - The Huge One ★ \n[problem:UVA-11371] - Number Theory for Newbies ★ \nProbability Theory \n Standard \n[problem:UVA-542] - France \u002798 \n[problem:UVA-10056] - What is the Probability ? \n[problem:UVA-10218] - Let\u0027s Dance !!! \n[problem:UVA-10238] - Throw the Dice \n[problem:UVA-10328] - Coin Toss \n[problem:UVA-10491] - Cows and Cars ★ \n[problem:UVA-10759] - Dice Throwing ★ \n[problem:UVA-10777] - God! Save me \n[problem:UVA-11021] - Tribles \n[problem:UVA-11176] - Winning Streak ★ \n[problem:UVA-11181] - Probability\n[problem:UVA-11346] - Probability \n[problem:UVA-11500] - Vampires \n[problem:UVA-11628] - Another lottery \n[problem:UVA-12024] - Hats \n[problem:UVA-12114] - Bachelor Arithmetic \n[problem:UVA-12457] - Tennis contest \n[problem:UVA-12461] - Airplane \nCycle-Finding \n Standard \n[problem:UVA-202] - Repeating Decimals \n[problem:UVA-275] - Expanding Fractions \n[problem:UVA-350] - Pseudo\n[problem:UVA-944] - Happy Numbers \n[problem:UVA-10162] - Last Digit \n[problem:UVA-10515] - Powers Et Al. \n[problem:UVA-10591] - Happy Number \n[problem:UVA-11036] - Eventually Periodic Sequence \n[problem:UVA-11053] - Flavius Josephus Reloaded ★ \n[problem:UVA-11549] - Calculator Conundrum \n[problem:UVA-11634] - Generate random numbers ★ \n[problem:UVA-12464] - Professor Lazy, Ph.D. \nGame Theory \n Standard \n[problem:UVA-847] - A Multiplication Game \n[problem:UVA-10111] - Find the Winning Move ★ \n[problem:UVA-10165] - Stone Game \n[problem:UVA-10368] - Euclid\u0027s Game \n[problem:UVA-10404] - Bachet\u0027s Game \n[problem:UVA-10578] - The Game of 31 \n[problem:UVA-11311] - Exclusively Edible ★ \n[problem:UVA-11489] - Integer Game ★ \n[problem:UVA-12293] - Box Game \n[problem:UVA-12469] - Stones "}
