TCP.rar - 一个TCP通讯的例子，分为客户端和服务器端。首先运行服务器，然后运行客户。,2009-11-08 18:37:58,下载5次
mutirender.rar - 这是一个mutirender的例子，通过将多个render的结果合并在一起，从而实现去锯齿化,2009-11-08 18:34:14,下载10次
anstoita.rar - 算法导论introduction to algorithm答案,2008-09-25 08:12:21,下载2次
m-in.rar - 数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法,2008-09-25 08:06:33,下载61次
forward_viterbi.rar - The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And what is the most likely sequence of rainy/sunny days that would explain these observations? The first question is answered by the forward algorithm the second question is answered by the Viterbi algorithm. These two algorithms are structurally so similar (in fact, they are both instances of the same abstract algorithm) that they can be implemented in a single function:
,2007-11-30 19:59:30,下载8次
1.rar - 类高级语言的词法分析程序 在keyword里是关健词 origin输入源文件 token输出结果,2007-10-08 22:14:06,下载2次
accept.rar - 数字运算，判断一个数是否接近素数
A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value.
Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not.
Input
Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone.
Output
For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise.
Sample Input
10 111
2 110
10 123
6 1000
8 2314
0
Sample Output
yes
yes
no
yes
no,2006-04-08 18:51:21,下载1次
accepted1.rar - 解决时钟问题，acm竞赛题
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.,2006-04-08 18:46:21,下载6次
1001.rar - 数学加法（实现两位数相加）
输入两位整数,2006-04-02 21:25:52,下载104次