PrintNow is a 32-bit application that runs only under Windows 95
or Windows NT 4.0. It allows your PrtScr and Alt+PrtScr keys to
print a screen capture directly to your printer instead of just
copying the image to the Windows clipboard. PrintNow can also
print any DIB image in the clipboard, regardless of its
original source. PrintNow supports multiple instances, it can
print multiple copies of a screen capture to the same printer
with different print settings, to several different printers,
or any combination thereof, with a single keystroke.
to show the waveform of audio file and play it on computer
Purpose: Familiar with WAV file format and UI design
It should have the following functions:
Provide a Graphic User Interface for user to browse the file system and select one WAV file
Show the waveform of input audio signal
Play the selected WAV file
Print the parameters of WAV file such as sampling rate, bit-depth, etc
ARM下 Implement matrix multiplication of 2 square matrices, with data read from an input file and printed both to the console and to an output file.
• Assume a file with correct data (no garbage, characters, etc.).
• you must check and provide appropriate execution for 2 extra cases, namely when the matrix size given is either “0” , or when the size is greater than the maximum handled of “5” . In these 2 cases you must implement the following behaviour:
o If size = 0, then print a message “Size = 0 is unacceptable” and continue by reading the
next size for the next 2 matrices (if not end of file).
o If size >5, then print two messages: “Size is too big - unacceptable”. Then read and
discard the next (size2 ) integers and continue by reading the next size for the next 2 matrices (if not end of file).
數(shù)字運(yùn)算，判斷一個(gè)數(shù)是否接近素?cái)?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競(jìng)賽題 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
