ACM中，用筛选法求素数，效率很高的算法，希望大家喜欢
标签： ACM
上传时间： 2016-04-17
上传用户：wang0123456789
ACM中南大学 H道路的算法，有测试数据和结果，希望对大家有用
上传时间： 2014-01-10
上传用户：cc1015285075
ACM中南大学找出最大的正方形，希望对大家的学习有帮助
上传时间： 2016-04-17
上传用户：牛津鞋
ACM中南大学找最大合法序列的算法，很经典，希望大家喜欢
上传时间： 2016-04-17
上传用户：huannan88
北京大学ACM题 Here is a geometric problem. You have an angle and some squares in the first quadrant of the plane rectangular coordinates. The vertex of the angle is fixed on the origin O of the coordinates, and both of its radial lines are specified by the input. The sizes of the squares are also specified by the input, and the squares can shift vertically and horizontally. Now your job is to use the squares and the radial lines of the angle to enclose the maximum area, which excludes the area of the squares (see Figure 1). You should note that the edges of the squares must be parallel to the axes.
标签： geometric quadrant problem squares
上传时间： 2013-12-25
上传用户：ynzfm
北京大学ACM比赛题 The game of Scrabble is played with tiles. A tile either has a single letter written on it, or it is blank. In the latter case, the tile may be used to represent a letter of your choice. On your turn, you arrange the tiles to form a word. Each tile may be used at most once, but not all tiles need to be used. Given several Scrabble tiles and a dictionary, determine how many words in the dictionary can be formed using the given Scrabble tiles.
标签： Scrabble written either letter
上传时间： 2016-04-22
上传用户：dancnc
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
标签： mathematician Christian Goldbach Leonhard
上传时间： 2016-04-22
上传用户：wangchong
北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries.
标签： the Consider infinite numbers
上传时间： 2013-12-16
上传用户：日光微澜
北京大学ACM比赛题目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
标签： CAPITAL LETTERS program Write
上传时间： 2014-01-17
上传用户：410805624
用蛮力法解决的Acm icpc试题（求矩阵每一列列和的最小值）。
上传时间： 2016-04-22
上传用户：bruce
