使用查表发实现公历转换为农历 文件说明 luanrday.h 头文件，声明了公历到农历转换的函数 luanrday.cpp 实现文件,实现...

本代码包包括超长整数相加、积分实现、数制转换、单词统计等-the code include long integer column, integral realization of a number of system conversion, word statistics

奖金管理程序，用DELPHI开发，包括奖金计算、报表管理等-management bonus program, Delphi development, including bonuses, and other statements of management

如何在程序中改写你的注册表-how the process rewrite your registry

Observer模式实现,并有Demo演示.封装完整,演示全面.-Observer mode, and Demo demo. Package integrity, comprehensive presentation.

Make icon for yahoo chat. It s great for you.

this the collection of develop skill point. this is uesful for your development.-this is the collection of develop skill point. this is uesful for your development.

EXCEL 教程-failed to translate

XNA编程：实现一个精灵的时隐时现的功能， 很基础的。 关于2D编程的。-XNA program

初学编程写的一个简易整数计算器，希望大家喜欢-Novice programmer wrote a simple integer calculator, I hope everyone likes

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