The CD Audio sample allows some non-SCSI2 CD ROMs to support audio operations by intercepting the relevant audio ioctls and translating them into the command block(s) expected by the non-compliant cdroms. It supports Plug and Play and Power Management, and is 64-bit compliant.
包含一下內(nèi)容:
* An extensible agent
* An SNMP library
* tools to request or set information from SNMP agents
* tools to generate and handle SNMP traps
* a version of the unix netstat command using SNMP
* a graphical Perl/Tk/SNMP based mib browser
a3load is 8051 firmware that can be used for uploading or downloading
to EZ-USB RAM (internal or external). It implements the vendor specific
command bRequest = 0xA3. The address to download/upload to/from is
specified in the wValue field of the SETUP packet and the length of
the transfer in the wLength field. The actual upload/download data
is transferred during the DATA stage of the SETUP transfer. This firmware
will function on all EZ-USB chips (EZ-USB, EZ-USB FX, FX2, FX2LP, FX1).
A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.
abel Tool Sample
Requires: Visual Basic 6 and MapObjects 2.x
Data: redlands.shp (Redlands sample data set from MO 2.x)
Interactive Labeling Tool
If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the check box is not checked, then the mouse down will turn into a pan/zoom tool.
There is a slider bar to control the search tolerance in screen pixels for the labeling.
數(shù)字運算，判斷一個數(shù)是否接近素數(shù)
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
2^x mod n = 1 acm競賽題 Give a number n, find the minimum x that satisfies 2^x mod n = 1.
Input
One positive integer on each line, the value of n.
Output
If the minimum x exists, print a line with 2^x mod n = 1.
Print 2^? mod n = 1 otherwise.
You should replace x and n with specific numbers.
Sample Input
2
5
Sample Output
2^? mod 2 = 1
2^4 mod 5 = 1
