Setting up an ADOCE project using Visual C++ 6.0 is rather simple. Assuming that you have downloaded and installed the ADOCE SDK from Microsoft, you are ready to use it in your Windows CE Database applications. The sample that I have provided is a *very* simple one illustrating how to instantiate the proper COM objects, and the basics of how to interface with them (in a very simple example)
标签： downloaded Assuming Setting project
上传时间： 2015-01-16
上传用户：阳光少年2016
Tug of War(A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other the number of people on the two teams must not differ by more than 1 the total weight of the people on each team should be as nearly equal as possible. The first line of input contains n the number of people at the picnic. n lines follow. The first line gives the weight of person 1 the second the weight of person 2 and so on. Each weight is an integer between 1 and 450. There are at most 100 people at the picnic. Your output will be a single line containing 2 numbers: the total weight of the people on one team, and the total weight of the people on the other team. If these numbers differ, give the lesser first. )
上传时间： 2014-01-07
上传用户：离殇
(7)--j2me软件教学，sun one studio环境
上传时间： 2014-01-12
上传用户：xlcky
一种很有用的搜寻算法，对开发1-wire很有用
标签： 算法
上传时间： 2014-08-13
上传用户：我干你啊
WHAT MIME64 IS: MIME64 is an encoding described in RFC1341 as MIME base64.Its purpose is to encode binary files into ASCII so that they may be passedthrough e-mail gates. In this regard, MIME64 is similar to UUENCODE.Although most binaries these days are transmitted using UUENCODE, Ihave seen a few using MIME64, and I have had requests from friends thatI decode MIME64 files that have fallen into their hands. As long assome MIME64 continues to exist, a package such as this one is usefulto have.
标签： MIME described 64 encoding
上传时间： 2013-12-17
上传用户：maizezhen
浮点数基本运算 浮点数的基本运算主要有四则运算、符号处理、大小比较，以及浮点数分柝等。 包含头文件 "fn.hpp" #include "fn.hpp" 浮点数基本运算 浮点数的基本运算中有加、减、乘、除、取负、绝对值、相等比较等。 加减乘除 加、减、乘、除四个运算极为相似，都是需要两个参数，结果当然也是浮点数了。 例子： // 加 减 乘 除 btil::fn::plus<f1, f2>::value // f1+f2 的结果 btil::fn::minus<f1, f2>::value // f1-f2 的结果 btil::fn::multiplies<f1, f2>::value // f1*f2 的结果 btil::fn::divides<f1, f2>::value // f1/f2 的结果 plus<f1, f2>::value::f_val // f1+f2 的结果的值 struct one { static const double f_val = 1.0 } // 两个浮点数 struct two { static const double f_val = 2.0 } minus<two, plus<divides<one, two>::value, one>::value >::value::f_val == 0.5 取负 取负运算就是取一个浮点数的负数。
上传时间： 2014-12-06
上传用户：exxxds
自己用C编写的小游戏，DOS界面哦，可以运行。 浮点数基本运算 浮点数的基本运算主要有四则运算、符号处理、大小比较，以及浮点数分柝等。 包含头文件 "fn.hpp" #include "fn.hpp" 浮点数基本运算 浮点数的基本运算中有加、减、乘、除、取负、绝对值、相等比较等。 加减乘除 加、减、乘、除四个运算极为相似，都是需要两个参数，结果当然也是浮点数了。 例子： // 加 减 乘 除 btil::fn::plus<f1, f2>::value // f1+f2 的结果 btil::fn::minus<f1, f2>::value // f1-f2 的结果 btil::fn::multiplies<f1, f2>::value // f1*f2 的结果 btil::fn::divides<f1, f2>::value // f1/f2 的结果 plus<f1, f2>::value::f_val // f1+f2 的结果的值 struct one { static const double f_val = 1.0 } // 两个浮点数 struct two { static const double f_val = 2.0 } minus<two, plus<divides<one, two>::value, one>::value >::value::f_val == 0.5 取负 取负运算就是取一个浮点数的负数。
上传时间： 2014-12-06
上传用户：jichenxi0730
This directory contains utility for implementing generic Reqursive Least Squares (RLS) algorithm. The example shows how one can use the utility to estamate the parameters of a simple linear discrete time system.
标签： implementing Reqursive directory algorithm
上传时间： 2014-01-06
上传用户：gtf1207
ATmega8 taillight circuitAn assembly language program that generates 5 different static patterns with switching from pattern-to-pattern controlled by the depression of one push-button switch (S2).
标签： taillight circuitAn generates different
上传时间： 2014-01-12
上传用户：wanghui2438
In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
标签： algorithm character position either
上传时间： 2014-01-27
上传用户：wang0123456789
