내가 작년 겨울방학 시작 즈음에 신입생들 풀라고 뽑은 문제들인데.. 쉬우면서 비교적 좋은 문제라고 생각되는 문제들만 뽑았다..
볼륨별로 3~4문제씩 뽑아서 총 80문제를 뽑았는데.. 대체로 별다른 알고리즘이 필요없거나.. 아주 기초적인 알고리즘을 쓰는 문제들이다.. 그러나 가끔 풀기 좀 까다로운.. 낚시문제도 있다..;;
문제 리스트는 여기..
102 - Ecological Bin Packing 116 - Unidirectional TSP 145 - Gondwanaland Telecom 147 - Dollars 255 - Correct Move 264 - Count on Cantor 294 - Divisors 299 - Train Swapping 336 - A Node Too Far 348 - Optimal Array Multiplication Sequence 352 - The Seasonal War 401 - Palindromes 441 - Lotto 498 - Polly the Polynomial 524 - Prime Ring Problem 530 - Binomial Showdown 544 - Heavy Carg 594 - One Little, Two Little, Three Little Endians 602 - What Day Is It? 627 - The Net 661 - Blowing Fuses 673 - Parentheses Balance 713 - Adding Reversed Numbers 727 - Equation 750 - 8 Queens Chess Problem 820 - Internet Bandwidth 825 - Walking on the Safe Side 846 - Steps 884 - Factorial Factors 900 - Brick Wall Patterns 911 - Multinomial Coefficients 913 - Joana and the Odd Numbers 991 - Safe Salutations 10034 - Freckles 10041 - Vito's family 10074 - Take the Land 10078 - The Art Gallery 10080 - Gopher II 10127 - Ones 10147 - Highways 10161 - Ant on a Chessboard 10199 - Tourist Guide 10260 - Soundex 10281 - Average Speed 10298 - Power Strings 10299 - Relatives 10305 - Ordering Tasks 10336 - Rank the Languages 10346 - Peter's Smoke 10370 - Above Average 10400 - Game Show Math 10452 - Marcus, help! 10469 - To Carry or not to Carry 10496 - Collecting Beepers 10530 - Guessing Game 10535 - Shooter 10579 - Fibonacci Numbers 10608 - Friends 10653 - Bombs! NO they are Mines!! 10664 - Luggage 10696 - f91 10714 - Ants 10763 - Foreign Exchange 10783 - Odd Sum 10799 - OOPS! They did it Again 10812 - Beat the Spread! 10815 - Andy's First Dictionary 10849 - Move the bishop 10878 - Decode the tape 10918 - Tri Tiling 10931 - Parity 10944 - Nuts for nuts.. 10970 - Big Chocolate 11005 - Cheapest Base 11015 - 05-2 Rendezvous 11039 - Building designing 11074 - Draw Grid 11121 - Base -2 11137 - Ingenuous Cubrency 11152 - Colourful Flowers
흠.. 근데 암울한것은.. 저기있는 문제 다푼다고해도.. 과연 ICPC 본선에서 몇문제나 풀수있을까..;;
UVa도 문제가 너무 많이 늘어나서.. 다 푸는것은 좀 비효율적이고.. 좋은문제만 잘 골라서 푸는방법이 필요할것 같다..