摘要：源代码下载：OpenGL_ch2.rar WGL – Windows的 OpenGL扩展层 The WGL extension consists of a set of functions (wglCreateContext, wglDeleteContext etc.) and structures (such as PIXELFORMATDESCRIPTOR, GLYPHMETRICSF...
阅读全文
摘要：3D图形学基本概念PerspectivePerspective refers to the angles between the lines that lend the illusion of three dimensions. Colors and ShadingMoving beyond line drawing, we need to add color to create a solid object. Shading refers to the way the color is applied to the polygon. Shading can be of two types i
阅读全文
摘要：想不服都不行，实在是太牛的代码,诡异的算法思路，出神入化的STL技巧。。。
阅读全文
摘要：Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include #include using namespace std; struct Movie { string name;//电影...
阅读全文
摘要：以前用递归的回溯搜索思路做过一次，参见ZOJ1002 Fire Net(递归版)，今天想着用非递归的方法试试看，呵呵，比我想象中要难啊，主要还是堆栈里究竟放什么，这一点上思路一直没理清。因此用了整整一天的时间，总算用非递归的方法把1002给AC掉了，在代码中我引入了堆栈层次的概念，模拟系统堆栈的行为，并且在搜索时加入了剪枝，但代码写得还是很烂，继续思考如何改进。
阅读全文
摘要：Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->#include #include using namespace std; const int MAXSIZE = 8;//棋盘大小 int chess[MAXSIZE][MAXSIZE]={0}...
阅读全文
摘要：计算几何题，使用的数学公式参考http://topic.csdn.net/t/20050329/22/3892541.html Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #incl...
阅读全文
摘要：计算几何问题，基本思想从要判断的点引一条射线看和多边形交点的个数，如果是奇数个，那么就在多边形内，否则在多边形外。先判断点是否在多边形边上的情况判掉，再判断线段相交。 Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #in...
阅读全文
摘要：Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include using namespace std; bool IsPalindrom(stack& s,const vector& v) {/...
阅读全文
摘要：最大矩阵和问题，简单DP Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ --> #include #include using namespace std; const int MAXSIZE = 100; int a[MAXSI...
阅读全文
摘要：典型的贪心算法，和前面1029一样也是工作时间调度问题。 Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include using namespace std; const int MAXSIZ...
阅读全文
摘要：Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include using namespace std; const int TIMEPERMOVE = 10;//每次分钟 const int ...
阅读全文
摘要：原始版本： Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include using namespace std; void ClearStack(stack& s) {//清空栈 wh...
阅读全文
摘要：简单的物理公式计算 Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include using namespace std; int main(void) { double v...
阅读全文
摘要：Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include #include #include using namespace std; const int MAXSIZE = 100; int pos[100];//记录对应的...
阅读全文
摘要：这道题我觉得加法这里比较难懂，和分成高字和低字，分别存放在寄存器A和B中。 Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include using namespace std; const int MAXSIZE = 2...
阅读全文
摘要：Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->#include #include using namespace std; int rotor[3][26];//密码表 int rround[3]; //加权轮转表 int totalL...
阅读全文
摘要：两道简单题，此外，1049有网友给出的计算公式是 Z=3.14*(x*x+y*y)/100.0+1.0，可惜我不明白其原理 ZOJ1045 HangOver Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include using nam...
阅读全文
摘要：这道题就是读懂题目太费劲了，非要扯到什么DNA上去，其实就是简单的数组处理，和上下左右的加加，然后查表把所得值加到当前项上来，若越界则处理下。 Code highlighting produced by Actipro CodeHighlighter (freeware) http://www.CodeHighlighter.com/ -->#include using namespace...
阅读全文
