Opengl中二次曲线绘制地球，并进行纹理贴图，得到逼真的地球模型。

CRT在计算机上的运行问题，可解决N个同余式组的问题-CRT running on the computer problem

FAQ系统，后台问题填写，前台问题展示

SQL语言的分类及语法-SQL syntax and the classification

Please read your package and describe it at least 40 bytes in English. System will automatically delete the directory of debug and release, so please do not put files on these two directory. -Please read your package and describe it at least 40 bytes in English. System will automatically delete the directory of debug and release, so please do not put files on these two directory.Please read your package and describe it at least 40 bytes in English. System will automatically delete the directory of debug and release, so please do not put files on these two directory.

数据库打印预览示例 vb.net 2005 =================================== 这个源代码适合于初学VB.NET的网友，主要演示读取ACCESS数据库，并进行预览打印的示例。源代码演示了对MDB数据库的一些基本操作，如跳到记录头等数据导航功能。-Print Preview sample database vb.net 2005 =================================== This source code is suitable for beginners VB.NET users, the main demonstration of ACCESS database to read and print preview of the sample. Source code for the MDB database demonstrated some of the basic operations, such as the jump record of first-class navigation data.

在关闭文件前提示的是否关闭保存-It can ask you wheather you really want to close this file or save it before close.

A small tool to turn off the monitor. The beauty of the program is, when compiled the final output of the executable is 1025 bytes only!

请认真阅读您的文件包然后写出其具体功能(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码。系统会自动删除debug和release目录，所以请不要将文件放在这两个目录下

各种时间间隔方式测试比较-various time intervals comparison testing

八皇后VC图形演示，算法思想：回溯法，先在第1行放上一个皇后，然后在第2行合适的位置放上一个皇后，依次类推，如果8行都放满了，说明找到了一个解，如果第好第i行的皇后后，第i+1行找不到合适的位置，这时就回到第i行，把第i行的皇后放到下一个位置，继续尝试下一行。如此反复，知道找到所有的解。注意，这种算法找的解可能有等价的，某些解可由别的解经过旋转棋盘得到。-visual demostration in vc of eight queens problem. algorithm: backtracking. First, put a queen on first line then find a suitable position on 2nd line for next queen, and so on. When all eight lines have queens, it means we have find a solution. If we put the i-th queen, but can find a suitable position on the (i+1)th line, then back to the ith line and move the queen on the ith line to next suitable position and move on to the next line. Repeat this until we have found all the solutions. Note:By this mean, some solutions maybe equivalent to others, some can be acquired by the rotation of other solutions.