UVa Problem Category (Programming Challenges)

最新推荐文章于 2009-02-13 17:32:00 发布
原创 最新推荐文章于 2009-02-13 17:32:00 发布 · 置顶 · 1.1w 阅读 · 1 ·
本内容遵循CC 4.0 BY-SA版权协议
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
标签
#numbers #permutation #traversal #setter #cookies
#pair
这篇博客详细探讨了UVa在线判题系统中的问题分类，涉及数字处理、排列组合、遍历算法等多个编程挑战方面。同时，博主分享了作为问题设置者的经验，并提到了解决问题时需要用到的技巧，如cookie管理和配对策略。
General
100 - The 3n+1 problem | Solution10189 - Minesweeper | Solution
10137 - The Trip | Solution706 - LC-Display | Solution
10267 - Graphical Editor | Solution10033 - Interpreter | Solution
10196 - Check The Check | Solution10142 - Australian Voting | Solution
Data Structures
10038 - Jolly Jumpers | Solution10315 - Poker Hands | Solution
10050 - Hartals | Solution843 - Crypt Kicker | Solution
10205 - Stack 'em Up | Solution10044 - Erdos Numbers | Solution
10258 - Contest Scoreboard | Solution10149 - Yahtzee | Solution
Strings
10082 - WERTYU | Solution10010 - Where's Waldorf? | Solution
10252 - Common Permutation | Solution850 - Crypt Kicker II | Solution
10188 - Automated Judge Script | Solution10132 - File Fragmentation | Solution
10150 - Doublets | Solution848 - Fmt | Solution
Sorting
10041 - Vito's Family | Solution120 - Stacks of Flapjacks | Solution
10037 - Bridge | Solution10191 - Longest Nap | Solution
10026 - Shoemaker's Problem | Solution10138 - CDVII | Solution
10152 - ShellSort | Solution10194 - Football (aka Soccer) | Solution
Arithmetic and Algebra
10035 - Primary Arithmetic | Solution10018 - Reverse and Add | Solution
701 - The Archaeologists' Dilemma | Solution10127 - Ones | Solution
847 - A multiplication game | Solution10105 - Polynomial coefficients | Solution
10077 - The Stern-Brocot Number System | Solution10202 - Pairsumonious Numbers | Solution
Combinatorics
10183 - How many Fibs? | Solution10213 - How Many Pieces of Land? | Solution
10198 - Counting | Solution10157 - Expressions | Solution
10247 - Complete Tree labeling | Solution10254 - The Priest Mathematician | Solution
10049 - Selfdescribing Sequence | Solution846 - Steps | Solution
Number Theory
10110 - Light, more light | Solution10006 - Carmichael Numbers | Solution
10104 - Euclid problem | Solution10139 - Factovisors | Solution
10168 - Summation of Four Primes | Solution10042 - Smith Numbers | Solution
10090 - Marbles | Solution10089 - Repackaging | Solution
Backtracking
861 - Little Bishops | Solution10181 - 15-Puzzle Problem | Solution
10128 - Queue | Solution10160 - Servicing Stations | Solution
10032 - Tug of War | Solution10001 - Garden of Eden | Solution
704 - Color Hash | Solution10270 - Bigger Square Please... | Solution
Graph Traversal
10004 - Bicoloring | Solution10067 - Playing with Wheels | Solution
10099 - The Tourist Guide | Solution705 - Slash Maze | Solution
10029 - Edit Step Ladders | Solution10051 - Tower of Cubes | Solution
10187 - From Dusk Till Dawn | Solution10276 - Hanoi Tower Troubles Again! | Solution
Graph Algorithms
10034 - Freckles | Solution10054 - The Necklace | Solution
10278 - Fire Station | Solution10039 - Railroads | Solution
10158 - War | Solution10199 - Tourist Guide | Solution
10249 - The Grand Dinner | Solution10092 - The Problem with the Problem Setter | Solution
Dynamic Programming
10131 - Is Bigger Smarter? | Solution10069 - Distinct Subsequences | Solution
10154 - Weights and Measures | Solution116 - Unidirectional TSP | Solution
10003 - Cutting Sticks | Solution10261 - Ferry Loading | Solution
10271 - Chopsticks | Solution10201 - Adventures in Moving - Part IV | Solution
Grids
10161 - Ant on a Chessboard | Solution10047 - The Monocycle | Solution
10159 - Star | Solution10182 - Bee Maja | Solution
707 - Robbery | Solution10177 - (2/3/4)-D Sqr/Rects/Cubes/Boxes ? | Solution
10233 - Dermuba Triangle | Solution10075 - Airlines | Solution
Geometry
10310 - Dog and Gopher | Solution10180 - Rope Crisis in Ropeland ! | Solution
10195 - The Knights Of The Round Table | Solution10136 - Chocolate Chip Cookies | Solution
10167 - Birthday Cake | Solution10215 - The Largest/Smallest Box.. | Solution
10209 - Is This Integration? | Solution10012 - How Big Is It? | Solution
Computational Geometry
10135 - Herding Frosh | Solution10245 - The Closest Pair Problem | Solution
10043 - Chainsaw Massacre | Solution10084 - Hotter Colder | Solution
10065 - Useless Tile Packers | Solution849 - Radar Tracking | Solution
10088 - Trees on My Island | Solution10117 - Nice Milk | Solution
UVa Problem Solution: 10090 - Marbles
Kaipeng Liu's Column
01-19 4495
 This problem requires us to find two non-negative numbers m1 and m2 that satisfying  n1*m1 + n2*m2 = nand minimize the cost  c = c1*m1 + c2*m2. First, we can use extended Euclids algorit
UVa Problem Solution: 843 - Crypt Kicker
Kaipeng Liu's Column
11-03 4233
This is the hardest problem ever since in this book. After some thinking, I realized that this problem can be solved with backtracking. After some more thinking, I realized that we should backtrack th
UVa Problem Solution: 10139 - Factovisors
Kaipeng Liu's Column
01-08 4055
We check each of the prime factors of m to see if n! has enough prime factors of the same value. If so, m can divide n!, otherwise m can not divide n!.Code:/*******************************************
UVa Problem Solution: 10247 - Complete Tree Labeling
Kaipeng Liu's Column
12-04 3984
Let f(k, d) denote the number of labelings of the k-ary tree of depth d. Moreover, let n(k, d) denote the number of nodes of the tree. The tree contains k subtrees, each contains n(k, d-1) nodes. Ther
UVa Problem Solution: 10049 - Self-describing Sequence
Kaipeng Liu's Column
12-04 3866
Let g(n) denote the nth number that satifies f(k) > f(k-1). We can know that     g(0) = 1, g(1) = 2, g(2) = 4, ... From the definition of g(n), we can know that all the values of f(k) where k belongs
UVa Problem Solution: 10149 - Yahtzee
Kaipeng Liu's Column
11-10 3450
Im stuck by this problem for two days. Finally I searched for some hints and came to this solution.The key points to solve this problem are:  1) using bitmap to record all the possible combinations,
UVa Problem Solution: 10198 - Counting
Kaipeng Liu's Column
11-27 3283
 Let f(n) denote the number of ways to make the sum of n. When n > 3, the number of digits is greater than 1. The first digit d used must be one of 1, 2, 3 or 4. Remove the first digit, then the remai
UVa Problem Solution: 10202 - Pairsumonious Numbers
Kaipeng Liu's Column
11-25 3266
The problem is not as difficult as it is seen at first. Carefully examine the structure of the sums will give you the key inspiration.Let N[0..n] denotes the n numbers and S[0..n*(n-1)/2] denote the p
UVa Problem Solution: 10089 - Repackaging
Kaipeng Liu's Column
02-13 3265
 First, convert each package p = (s1, s2, s3) to a vector (s2 - s1, s3 - s1). All the packages forms convex hull. If point (0, 0) is in this convex hull, then there will be a solution, otherwise not
UVa Problem Solution: 10037 - Bridge
Kaipeng Liu's Column
11-20 3201
Given the two fastest people as f1 and f2, f1   1) f1, f2 go --> f1 back --> s1, s2 go --> f2 back: time1 = f2 + f1 + s2 + f2  2) f1, s1 go --> f1 back --> f1, s2 go --> f1 back: time2 = s1 + f1 + s2
UVa Problem Solution: 10315 - Poker Hands
Kaipeng Liu's Column
10-28 3172
I believe sorting the poker at first may be helpful. You should determine the kind of the poker hand from the highest rank down to the lowest. Comparing the poker hands with the same kind is tricky to
UVa Problem Solution: 10254 - The Priest Mathematician
Kaipeng Liu's Column
12-04 3069
From the description of this problem we can easily draw the recurrence of   f(n) = 2*f(n-k) + 2^k - 1and the base cases of   f(0) = 0 and f(1) = 1However, how can we determine which k would give the m
UVa Problem Solution: 701 - The Archaeologist's Dilemma
Kaipeng Liu's Column
11-24 3051
Let P denotes the prefix, T denotes the # of lost digits. We are searching for N, that the prefix of 2^N is P. We have an inequlity of    P*10^T thus    log2(P*10^T) which is    log2(P)+T*log2(10) Als
UVa Problem Solution: 10157 - Expressions
Kaipeng Liu's Column
12-03 2977
Let n denotes the length of the expression, d denotes the depth at most, and the count is f(n,d). Obviously, f(n,d) = 0 when n is odd. For other conditions, let us consider where we can find the corre
易语言源码易语言socket连接超时源码例程
最新发布
06-21
易语言源码易语言socket连接超时源码例程
评论 1
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值