Using C Templates to overcome some of the or iginal Subject/Observer design patt...

欢迎下载 欢迎下载 欢迎下载 -Download welcome welcome welcome welcome to download download download

public class gedebahe { public static void main( String [] args) { for ( ) { int a=-1,b,c //b,c是分解出来的两个数 System.out.print("Please input a oushu:") //输入一个偶数 try { BufferedReader in = new BufferedReader(new InputStreamReader(System.in)) String inputLine = in.readLine() a = Integer.valueOf(inputLine).intValue() }catch (Exception exc) { System.out.println("Sorry,please input a number.") return } if (a%2!=0) { System.out.println("Sorry,please input a oushu.") return } for (b=1 b

multipeak 3Dimension Problem using genetic algorithm to find the maximum （global optimum)point for 3D multipeak surface -multipeak 3Dimension Problem using genetic algorithm to find the maximum (global optimum) point for 3D multipeak surface

c语言词法分析，功能比较全，大家随便看看吧，有界面-The file is for accidence analysis fo C language and has lots of functions. It has the interface and please check it freely.

子窗口编程的例子-Programming examples of sub-window

vb程序排序与查找-vb ranking and search procedures

演示了随机数的产生和使用-demonstration, the random number generation and use

使用P2P技术设计的一个简易聊天程序。不使用专用的服务器，只要将好友添加到好友列表中，就能检测出好友是否在线，并相互发送聊天信息。-The use of P2P technology, designed for a simple chat program. Do not use a dedicated server, as long as the friend add to friends list, will be able to detect friends are online, and send chat messages with each other.

最近在研究USB，上网找到了个USB的DELPHI的组件，上传上来给大家　-USB recent study, found on the Internet a USB of Delphi components uploaded onto for everyone

给定的字母表A 由26 个小 写英文字母组成A={a,b,…,z}。该字母表产生的升序字符串是指字符串中字母按照从左到 右出现的次序与字母在字母表中出现的次序相同，且每个字符最多出现1 次。例如， a,b,ab,bc,xyz 等字符串都是升序字符串。现在对字母表A 产生的所有长度不超过6 的升序 字符串按照字典序排列并编码如下。 1 2 … 26 27 28 … a b … z ab ac … 对于任意长度不超过6 的升序字符串，迅速计算出它在上述字典中的编码。 -Given the alphabet A by the 26 lowercase letters of the alphabet composed of A = (a, b, ..., z). Generated by the alphabet ascending string refers to the letter string in accordance with the order from left to right appears in the alphabet and letters appearing in the same order, and each character appears a maximum of 1 times. For example, a, b, ab, bc, xyz, etc. are ascending string string. Alphabet A have now all the length of not more than 6 strings of ascending order in accordance with the dictionary and coding sequence is as follows. 1 2 ... 26 27 28 ... ab ... z ab ac ... for any length of not more than 6 strings of ascending quickly calculate it in the dictionary encoding.