ofdm

这是一个井字游戏的源码。。编程语言：VB 能帮助你理解游戏编程中，电脑思考的技巧。。 -Well this is a game of FOSS. . Programming Languages : VB will help you understand the game programming, computer thinking skills. .

图表基本上显示如何设计一台电脑，在 c + + 中使用 opengl。它是最适合初学者不知道如何在 opengl 中编写的代码。

VC6.0的一些实例原代码，都是一些实际运用，需要有一定基础-Many sample source code of VC++6.0

This component (inherited from TPaintBox) will draw itself } { as transparent part of form (shows what be under form), } { with possibility to set glass color and degree of the } { transparency.-This component (inherited from TPaintBox) will draw itself } { as transparent part of form (shows what be under form), } { with possibility to set glass color and degree of the } { transparency.

一个简单的pdf阅读器-a simple pdf reader

在bcb中使用matlab的计算引擎-used in the calculation engine Matlab

我国农历的算法 C++。来源于http://blog.chinaunix.net/u/18517/-China" s Lunar New algorithm C++. From http://blog.chinaunix.net/u/18517/

刚学编程，多多指教-just learning programming, exhibitions

对于元音字母（a e i o u）开头的英文单词结尾加上cow；相反，如果是辅音开头的英文单词，开头第一个字母移到末尾加ow-Bovine Latin The cows have heard that the pigs use a secret language called "Pig Latin" when they want to communicate with each other without Farmer John being able to understand what they are saying. Thinking this is an excellent idea, they have invented their own version, aptly called Bovine Latin. Converting an English word to a Bovine Latin word is quite simple. For words that start with a vowel ( a , e , i , o or u ), "cow" is added to the end of the word for example, "udder" becomes "uddercow". For words that do not begin with a vowel, the first letter is moved to the end of the word, and "ow" is added e.g., "farmer" becomes "armerfow". So "the cows escape at dawn" becomes "hetow owscow escapecow atcow awndow." The cows fervently believe that FJ will not understand this subterfuge. Never known as enthusiastic linguists, the cows find this translation quite tedious and thus have asked you to write a pr

Assume that Edison has found himself in a square-shaped maze of NxN square cells which is surrounded by walls from the outside. In the maze, some of the cells are also walls. Edison can only move between two empty cells in four directions, north, south, west and east. In order to get out of the maze, he drafts a plan. He uses his left hand to lean on the wall and goes by following the wall. Here is the question, is Edison able to get out of the maze in at most 10,000 steps? If he can make it, output the path. By getting out of the maze, he only needs to be in the exit cell. If the starting cell is the same as the exit, Edison won"t need to move and can directly get out of the maze. Input The first line of the input gives the number of test cases, T. T test cases follow. Each test case starts with an integer N. N is the size of the maze. Th