其他

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 shown as black squares. The vertices will be

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 an operating system concept that permits data to "

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 this area has resulted in the practical use of

Time limit: 3.000 seconds限時：3.000秒Problem問題You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest the contestants are tested on

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 event simulation. Stacks are also important in the

概念凸包(Convex Hull)是一個計算幾何（圖形學）中的概念。用不嚴謹的話來講，給定二維平面上的點集，凸包就是將最外層的點串連起來構成的凸多邊型，它能包含點集中所有點的。嚴謹的定義和相關概念參見維基百科：凸包。這個演算法是由數學大師葛立恒(Graham)發明的，他曾經是美國數學學會(AMS)主席、AT&T首席科學家以及國際雜技師協會(IJA)主席。（太汗了，這位大牛還會玩雜技~） 問題給定平面上的二維點集，求解其凸包。 過程1.

Time limit: 3.000 seconds BackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put several historical events into chronological order. Students

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 view gift-giving with

Time limit: 3.000 seconds限時：3.000秒 Problem問題You are to simulate the playing of games of "Accordian" patience, the rules for which are as follows:類比玩一個“手風琴”紙牌遊戲，規則如下：Deal cards one by one in a row from left to right, not overlapping. Whenever the

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 most computer scientists, and sorting accounts for

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著名的物理學家紐曼（譯註： 杜撰人名 ）正在研究的問題中需要計算多項式的乘積，他可能需要計算：(-x8y+9x3-1)·(x5y+1+x3)getting the

Time limit: 3.000 seconds BackgroundSome 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 somewhat oblate spheroid), consider a

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: artificial intelligence, algorithms and complexity,

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 an upper bound contains a maximal element."

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önigsberg problem. Many optimization problems involve

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 algorithm with sub-linear complexity. Quicksort

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 routing problems is minimizing wire length. The

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 fundamental to many algorithms in computer graphics.

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 name of a problem may indicate that trees are

Time limit: 3.000 seconds BackgroundSimulation is an important application area in computer science involving the development of computer models to provide insight into real-world events. There are many kinds of simulation including (and certainly