程序控

IPPP (Institute of Penniless Peasent-Programmer) Fellow
  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: :: 管理 ::
  75 随笔 :: 0 文章 :: 470 评论 :: 116万 阅读
< 2025年3月 >
日 一 二 三 四 五 六
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5

随笔分类 -  OJ Problems

上一页 1 2 3

http://uva.onlinejudge.org/
UVa OJ 110 - Meta-Loopless Sorts (无循环-元排序)
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an important part of the education of mo... 阅读全文
posted @ 2010-08-10 03:05 Devymex 阅读(1494) 评论(0) 推荐(0) 编辑

UVa OJ 109 - SCUD Busters (SCUD重磅炸弹)
摘要：Time limit: 3.000 secondsBackgroundSome problems are difficult to solve but have a simplification that is easy to solve. Rather than deal with the difficulties of constructing a model of the Earth (a ... 阅读全文
posted @ 2010-08-09 02:39 Devymex 阅读(1758) 评论(0) 推荐(0) 编辑

UVa OJ 108 - Maximum Sum (最大和)
摘要：Time limit: 3.000 secondsBackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. Consider satisfying a boolean expression in conj... 阅读全文
posted @ 2010-08-08 15:56 Devymex 阅读(2445) 评论(0) 推荐(0) 编辑

UVa OJ 107 - The Cat in the Hat (戴帽子的猫)
摘要：Time limit: 3.000 secondsBackground(An homage to Theodore Seuss Geisel)The Cat in the Hat is a nasty creature,But the striped hat he is wearing has a rather nifty feature.With one flick of his wrist h... 阅读全文
posted @ 2010-08-08 03:56 Devymex 阅读(2321) 评论(0) 推荐(0) 编辑

ZOJ 1002 - Fire Net (火力网)
摘要：ime Limit: 1 Second Memory Limit: 32768 KBBackgroundSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or... 阅读全文
posted @ 2010-08-07 13:16 Devymex 阅读(1768) 评论(0) 推荐(1) 编辑

关于OJ系列文章的说明
摘要：什么是UVa OJ？UVa OJ（英文）是西班牙巴利亚多利德大学提供的一套在线评判系统(OJ)。它提供多达近3000道ACM算法题，而且还在增加。任何人在免费注册后都可以浏览题目和提交自己的解答程序。服务器会自动编译你提交的代码，用特殊的数据（不是题目中的Test Case）进行测试，并立即做出评判。如果程序在限定条件内运行出符合要求的结果，系统会给出运行时间和下列结果：正确(Accepted, ... 阅读全文
posted @ 2010-08-07 04:30 Devymex 阅读(4437) 评论(1) 推荐(3) 编辑

UVa OJ 105 - The Skyline Problem (地平线问题)
摘要：Time limit: 3.000 secondsBackgroundWith the advent of high speed graphics workstations, CAD (computer-aided design) and other areas (CAM, VLSI design) have made increasingly effective use of computers... 阅读全文
posted @ 2010-08-07 03:08 Devymex 阅读(3061) 评论(1) 推荐(1) 编辑

UVa OJ 641 - Do the Untwist (解密工作)
摘要：Time limit: 3.000 secondsBackgroundCryptography deals with methods of secret communication that transform a message (the plaintext) into a disguised form (the ciphertext) so that no one seeing the cip... 阅读全文
posted @ 2010-08-04 17:42 Devymex 阅读(1484) 评论(0) 推荐(0) 编辑

UVa OJ 571 - Jugs (罐子)
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug... 阅读全文
posted @ 2010-08-04 16:08 Devymex 阅读(1582) 评论(0) 推荐(0) 编辑

UVa OJ 732 - Anagrams by Stack (堆栈字迷)
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert "TROT" to "TORT":怎样才能通过一系列的堆栈操作，将... 阅读全文
posted @ 2010-08-04 16:02 Devymex 阅读(2673) 评论(0) 推荐(1) 编辑

UVa OJ 103 - Stacking Boxes (嵌套盒子)
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Some concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consi... 阅读全文
posted @ 2010-08-04 14:22 Devymex 阅读(2379) 评论(0) 推荐(0) 编辑

UVa OJ 102 - Ecological Bin Packing (生态学装箱问题)
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Bin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem. So... 阅读全文
posted @ 2010-08-04 14:05 Devymex 阅读(2485) 评论(0) 推荐(0) 编辑

UVa OJ 101 - The Blocks Problem (积木问题)
摘要：Time limit: 3.000 second限时：3.000秒Background背景Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robot... 阅读全文
posted @ 2010-08-04 14:01 Devymex 阅读(9470) 评论(0) 推荐(2) 编辑

UVa OJ 100 - The 3n + 1 problem (3n + 1问题)
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.计算 阅读全文
posted @ 2010-08-04 13:46 Devymex 阅读(6689) 评论(5) 推荐(2) 编辑

上一页 1 2 3
点击右上角即可分享
微信分享提示