Java版蜀山剑侠传游戏源代码

还是用分支限界法解N皇后问题，已成功运行过。-Using branch and bound Solving N Queens, which has been run successfully over

公通软电话，市话，长途都是8分钱。注册一下平台，用户名和密码就可使用。-GTcall

网页自动打怪练习游戏功能自动看图片你再点击一下吧

检测液晶屏幕好坏的最好的程序，本人一直在用-Detection of the best LCD screen of the program good or bad, I have been in use

背景 背景 背景 背景 背景 背景

又一个经典的贪吃蛇游戏，用鼠标控制蛇移动的方向．-also a classic Snake game with mouse control snake moving in the direction.

mFormat是一个U盘格式化工具，可以格一些老的U 盘-mFormat U is a disk formatting tools, Lattice some old U disk

以前做的一个数字钟-before doing a digital clock

这个例子中,控件随窗口大小一起变-this case, control together with the window size change

邮票问题:设一国家发行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? ?