基于QT的酒店管理系统

1-从用户处读取RGB（彩色）图像。

有些PDF加密后，虽然能查看，但不能拷贝，这里给出了一个单文件的绿色密码去除软件-Some PDF encryption, though able to view, but you can not copy, here gives a green single-file password removal software

这是一个简单的LABVIEW程序，它完成二进制的读入或读出。-This is a simple program which can implete a arry imread from LabView or write into it.

这是一个啤酒销售系统的软件-This is a beer sales system software

ti－idf算法，实现对英文文档的检索，把多篇文档中的词（英文单词），按照权值从小到大进行排列-ti-idf algorithm, the realization of the English document retrieval, to document more than words (English words), in accordance with the right values to be ranked from small to large

Compulsary Library for Visual C++ 6.0, Visual C++ 2005, Visual Studio.net

这是用C语言编写的一个小程序，它的结果是演示物理实验中的李萨如图。运行程序的时候需要把CCBP文件夹包含在头文件中。-This is the C language of a small program, and the result is a demonstration of physics experiments Lissajous figure. When operational procedures need CCBP folder contains the first document.

文本比较器，可实现两个文本的比较，比如文本文档-Comparators text, the text can be compared both

这是一份爱的礼物，收到礼物的人，打开应用程序，便能在屏幕上看到i love you的字样。-This is a gift of love, those who receive the gift, open applications, will be able to see on the screen the words i love you.

邮票问题:设一国家发行n种不同面值的邮票，并且每封信至多允许贴m张邮票，对于给定的m,n值，写一个算法求出从邮资1开始在增量为一的情况下可能获得的邮资值的最大连续区域以及获得这个区域的各种可能面值的集合。如，当 n=4,m=5,若有面值为（1，4，12，21）的四种邮票，则邮资最大的连续区域为1到71。还有其他面值的四种邮票可组成同样大小的区域吗-stamp issue : Let a national issue n different denominations of the stamps and letters each allow up to m stamp affixed, to the m, n, write an algorithm derived from a postage in an increment of the circumstances, may obtain a postage value of the maximum continuous access to this region and regional various denominations could assemble. For example, when n = 4, m = 5, if the values of (1,4,12,21) of the four stamps, postage largest regional consecutive 1-71. There are four other denominations of the stamps can be the same size as the composition of the region? ?