mulitusers2dcdma.rar - 多用户多载波时频域cdma扩频的仿真，使用类编程。包含发送，信道，接收3个类。有选择用户数，联合扩频，调制，FFT变换，高斯信道和瑞利，解调，解扩，统计误码率等功能，减小仿真点数可使程序运行更快。,2008-10-05 15:37:55,下载33次
oneuser2dcdma.rar - 单用户多载波时频域联合cdma扩频的仿真，使用类编程。包含发送，信道，接收3个类。有联合扩频，调制，FFT变换，高斯信道和瑞利，解调，解扩，统计误码率等功能，减小仿真点数可使程序运行更快。,2008-10-05 15:35:52,下载34次
oneuserdscdma.rar - 单用户dscdma的仿真，使用类编程。包含发送，信道，接收3个类。有扩频，调制，高斯信道和瑞利，解调，解扩，统计误码率等功能，减小仿真点数可使程序运行更快。,2008-10-05 15:33:26,下载16次
oneusermccdma.rar - 单用户多载波mccdma的仿真，使用类编程。包含发送，信道，接收3个类。有扩频，调制，FFT变换，高斯信道和瑞利，解调，解扩，统计误码率等功能，减小仿真点数可使程序运行更快。,2008-10-05 15:31:33,下载23次
cdma2.rar - 简单的cdma基础仿真，包含简单的产生数据，扩频，调制，解调，解扩。适合初学者。,2008-10-05 15:25:11,下载16次
2136.rar - 北京大学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.,2008-03-14 19:35:24,下载2次
2309.rar - 北京大学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.
,2008-03-14 19:32:28,下载5次
2262.rar - 北京大学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.,2008-03-14 19:28:44,下载11次
2973.rar - 北京大学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.,2008-03-14 19:19:35,下载10次
2722.rar - 北京大学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.
,2008-03-14 19:16:09,下载2次