python-data-structure

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

书店管理程序，TC3下调试成功，可以实现书籍增加，删除，查询等功能，数据采用文本保存-Bookstore management procedures, debug TC3 success can be achieved books to add, delete, query capabilities, data using text preservation

ADOClient通过ADO调用后台数据库，支持ORACLE，MSSQL，ACCESS等数据库-ADOClient

说明：  The famous Collatz sequence is generated by a method decribed as follows. Given a positive integer N, if it is odd, then replace it with 3*N+1. For even number N, use N/2 instead. You can get a sequence of number by this method. It is conjectured that the algorithm above will terminate at 1 for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.) (Input The first line contains a single integer T tells that there are T cases in the problem. Then for each case, there is an integers N. Output For each number N, output the sequence generated in a line, using coma as its separator. )

矩形件最优排样的程序,用Visual C编写，在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)

数据库管理系统，是一个管理学生学籍的-database management system, is a management student behind the expulsion of

一个很简单的java web系统的需求分析及数据库设计-A very simple java web systems analysis and database design

数据结构中栈的经典算法――第二类背包问题，已经通过测试！-The stack data structure in the classic method- II knapsack problem, has passed the test!

太阳能电池参数计算，可以快速方便计算电流，电压，填充因子等参数(Solar cell parameter calculation)

Memory Decoder