ACM試題Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
標簽： Description divisible Problem integer
上傳時間： 2015-08-23
上傳用戶：zhenyushaw
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
本文簡要介紹了集成電路MAX038的性能，并給出了以MAX038波形產生器為核心具有四種輸出波形的函數 信號發生器的設計方案。用這種方法設計的信號發生器具有結構簡單、成本低、體積小等特點，很好地滿足 了一般的實驗要求。 關鍵詞：集成電路 信號發生器 頻率 Abstract：The performance ofIC_MAX038 was introduced briefly in this paper．At the sa／ne time，a signal generator design making with integrated circuit MAX038 is provided，which can produce four kinds of waveforms output．The signal generator was of characters such as simple structur，cheap expense，small volume and SO on．The signal generator contents the demand of general experiments very wel1． Key words：Integrated circuit Signal generator Frequency
上傳時間： 2013-12-12
上傳用戶：四只眼
These files contain all of the code listings in Java: The Complete Reference, J2SE 5 Edition The source code is organized into files by chapter. For example, the file Chap7.code contains the programs shown in Chapter 7. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you are interested.
標簽： Reference Complete listings Edition
上傳時間： 2013-12-18
上傳用戶：diets
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標簽： project implement developed Database
上傳時間： 2013-12-25
上傳用戶：semi1981
This version of malloc for VxWorks contains two different algorithms. One is the BSD based Kingsley "bucket" allocator which has some unique fragmentation behavior. The other is Doug Lea s well tested allocator that tries to minimize fragmentation while keeping the speed/space requirements. 非常實用,可移植用作實現跨平臺的嵌入式的內存分配機制.
標簽： algorithms different Kingsley contains
上傳時間： 2015-08-28
上傳用戶：hfmm633
This project does not contain a full, runnable application program. Instead, the only package ope.account contains two classes which represent basic bank customer and account information.
標簽： application runnable Instead project
上傳時間： 2013-12-25
上傳用戶：許小華
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
Securing Apache 2: Step-by-Step When choosing a web server, Apache very often wins against its competitors because of stability, performance, that fact that it s open source, and many other advantages. But when deciding on which version of Apache to use, the choice is not always so simple. On the one hand there is a very popular, stable version used by millions of users, version 1.3, and on the other hand, there is an enhanced and re-designed version 2.0.
標簽： Apache Step-by-Step Securing choosing
上傳時間： 2015-09-06
上傳用戶：gundamwzc
* This a software code module for a time-of-day clock object. * The clock may be fixed 12-hour, fixed 24-hour, or dynamically * configurable between these two types. Clock data can be accessed * as a binary number representing the number of minutes since midnight * or a BCD number formatted according to the time-of-day description * in the TIME module 0404x. The functions work with time-of-day values * which conform to normally accepted clock values of 1:00 to * 12:59 BCD / 0 to 719 binary for a 12-hour clock or clock values * 00:00 to 23:59 BCD / 0 to 1439 binary for a 24-hour clock. On power-up * the clock is 12:00 BCD / 0 binary for a 12-hour or dynamically * configurable clock, or 00:00 BCD / 0 binary for a 24-hour clock.
標簽： clock time-of-day software module
上傳時間： 2013-12-07
上傳用戶：llandlu
