ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is abOut the positive integers and its binary form. Given a positive integer I, you task is to find Out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write Out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should Output "83".
标签： Description computers Problem binary
上传时间： 2013-12-11
上传用户：libenshu01
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find Out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
标签： introduction the contains intended
上传时间： 2013-12-23
上传用户：liansi
This is a little console mode utility program which is able to (de-)compress single files with a static Arithmetic compression algorithm. You could easily add the RLE/BWT/MFT data transformation algorithms. Just rip the corresponding classes Out of my HuffComp source code. I won t add these ones in the next time.
标签： compress console utility program
上传时间： 2015-08-27
上传用户：lili123
Address book helps you look up your addresses from the system tray. It is quite useful in that way 慶ause it stays Out of the way and is easily accessible when needed. Double clicking on any URL will start the default web browser and take you to that URL. Double clicking on the phone number will dial that number. Every column supports sorting and can be customized to your needs. Preview will display the notes associated with each record. This program can also import Comma Separated Values (*csv) text files of Outlook Express.
标签： addresses Address system useful
上传时间： 2014-07-08
上传用户：lyy1234
* * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS AND ANY EXPRESS * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE * GOODS OR SERVICES LOSS OF USE, DATA, OR PROFITS OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY Out OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH D
标签： WARRANTIES SOFTWARE PROVIDED EXPRESS
上传时间： 2013-12-20
上传用户：sxdtlqqjl
使用到的参数跟谈到弹性网络的那一章里头所讲的是一样的， ke 则是终止条件。如果 step 被打勾，则程式在每一步之间会暂停 100毫秒（或其他使用者输入的数值）。如果 Random 被打勾，则程式会以系统时间作为乱数产生器的种子数，否则，就以使用者输入的数（ Random 右边那一格）为种子数。 你可以利用 load 来载入推销员问题档与其最佳解，如此便可比较弹性网络所找出来的解与最佳解差了多少。 Central, Radius, and Error 这三个参数的前两个，只影响弹性网络的起使位置和大小，对求解没有影响。第三个参数代表城市与网络点之间的容忍距离，也就是说，如果某城市与某网络点之间的距离，小于容忍距离，那就把这个城市当成是被该网络点所拜访。 按下小 w按钮会将目前的结果与参数值写到“en.Out”这个档案。使得我们可以很方便地来比较不同参数的效果。
上传时间： 2013-12-17
上传用户：84425894
vc环境下开发的多级多服务员排队模拟系统，输入文件为后缀名in文件，输出为后缀名Out文件
上传时间： 2015-09-12
上传用户：宋桃子
There is an example of how to use the LDPC encode/decode with AWGN channel model in files .\ldpc_decode.m and .\GFq\ldpc_decode.m. There are a few parity check matrices available in the code but you can use other matrices provided you have enough memory to load them. I suggest checking Out matrices in Alist format available on David MacKay s web site.You will need to have access to a MEX compiler to be able to use a few functions written in C. LDPC的仿真代码
标签： example channel ldpc_de encode
上传时间： 2013-12-03
上传用户：lili123
This a two node test, requires a Coordinator and an RFD. The coordinator and node simply ping-pong a packet back and forth, and print Out the RSSI byte. The RFD waits before bouncing it back, while the coordinator responds immediately.
标签： node Coordinator coordinator and
上传时间： 2013-12-24
上传用户：ardager
//Basic packet sending test at the MAC level, used for internal testing only. //This packet test has one node sending Out a variety of //differently formatted packets to two assumed destination nodes.
标签： packet test internal sending
上传时间： 2014-08-21
上传用户：CSUSheep
