int getDivisor(int iNum)
{
int i = 1
int sum = 0
if (0 == iNum)
{
return 1
}
while (i <= iNum / 2)
{
if (0 == iNum ％ i)
{
sum++
}
i++
}
return (sum+1)
}
Huffman codes
In telecommunication, how do we represent a
set of messages, each with an access
frequency, by a sequence of 0’s and 1’s?
To minimize the transmission and decoding
costs, we may use short strings to represent
more frequently used messages.
This problem can by solved by using an
extended binary tree which is used in the 2-
way merging problem.
What is it?
A generic stand-alone MIPS program that can do printf on a standard UART.
requirements:
. CPU has CP0 structure (r4k compatible)
Configure:
Windows Mobile NLED driver proxy. Created for customization of incoming call ring vibration.
While original Windows Mobile ring vibration constant vibrating during all ring, this driver help to apply any user vibrating pattern.
