摘要：Time limit: 3.000 seconds限时：3.000秒Problem问题Consider objects such as these. They are polygons, specified by the coordinates of a centre of mass and their vertices. In the figure, centres of mass are sh...
阅读全文
随笔分类 - OJ Problems
http://uva.onlinejudge.org/
摘要：Time limit: 3.000 seconds限时：3.000秒Problem问题Given two convex polygons, they may or may not overlap. If they do overlap, they will do so to differing degrees and in different ways. Write a program that ...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景The saying "You can't see the wood for the trees" is not only a cliche, but is also incorrect. The real problem is that you can't see the trees for the wo...
阅读全文
摘要：Problem问题The well-known physicist Alfred E Neuman is working on problems that involve multiplying polynomials of x and y. For example, he may need to calculate著名的物理学家纽曼（译注：杜撰人名）正在研究的问题中需要计算多项式的乘积，他可能需...
阅读全文
摘要：Background背景Problems that process input and generate a simple "yes" or "no" answer are called decision problems. One class of decision problems, the NP-complete problems, are not amenable to general e...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Order is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: "a partially ordered set in which every chain has ...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Searching and sorting are part of the theory and practice of computer science. For example, binary search provides a good example of an easy-to-understand...
阅读全文
摘要：Background背景Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fu...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Filters, or programs that pass "processed" data through in some changed form, are an important class of programs in the UNIX operating system. A pipe is a...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Stacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and discrete even...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Computer generated and assisted proofs and verification occupy a small niche in the realm of Computer Science. The first proof of the four-color problem w...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒The Problem问题This problem involves determining, for a group of gift-giving friends, how much more each person gives than they receive (and vice versa for those that v...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: ar...
阅读全文
摘要：Time limit: 3.000 seconds限时3.000秒Background背景Graph algorithms form a very important part of computer science and have a lineage that goes back at least to Euler and the famous Seven Bridges of Kö...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Problems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI ro...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景Expression trees, B and B* trees, red-black trees, quad trees, PQ trees; trees play a significant role in many domains of computer science. Sometimes the ...
阅读全文
摘要：Time limit: 3.000 secondsBackgroundSimulation is an important application area in computer science involving the development of computer models to provide insight into real-world events. There are man...
阅读全文
摘要：Time limit: 3.000 seconds限时: 3.000秒Background背景Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Work in ...
阅读全文
摘要：Time limit: 3.000 seconds限时：3.000秒Background背景LISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are the...
阅读全文
摘要：Time limit: 3.000 secondsBackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put several histori...
阅读全文