努力成为游戏开发人员

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16165 Accepted: 6676DescriptionOn Planet MM-21, after their Olympic games this year, curling

Description定义一个二维数组： int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到 右下角的最短路线。I

DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is tw

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3087    Accepted Submission(s): 1765Problem DescriptionThe GeoSurvCo

DescriptionFarmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ≤

Time Limit:1000MS Memory Limit:65536KTotal Submissions:9653 Accepted:3478 Special Judge    DescriptionMy birthday is coming up and traditionally I"m serving pie. No

题目大意：　　输入一个矩阵，再输入其中一个“X”的位置（从1开始）。从该位置向八个方向扩展，如果是“X”就可以并在一起。问最后得到的模块的周长是多少。网上说这题用广搜比较好。。。不过我还没看，用了深搜。找到连续的图像不麻烦，但是计算周长难到我了。每个方块初始周长都是4，如果它四周每存在一个方块周长就会减少1，把每个方块的有效周长加在一起就是这个图像的周长。#

River HopscotchTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusAppoint description:DescriptionEvery year the cows hold an event featuring

Fire NetTime Limit: 2 Seconds      Memory Limit: 65536 KBSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each represe

棋盘问题时间限制：1000 ms  |  内存限制：65536 KB描述输入三个自然数n,i,j(1(2,3)表示该格为第2行第3列要求编制一个程序，根据输入的n,i,j的值，输出与格子(i,j)在同一行、同一列、同一对角线上的所有格子位置，例如：当n=4,i=2,j=3时，输出的结果是： (2,1)(2,2)(2,3)(2,4) {同一行格

下面是一个很好用的大数模板，提供了正整数大数的基本运算#include#include#include#include#include#includeusing namespace std;#define MAXN 9999#define MAXSIZE 10#define DLEN 4class BigNum{private: int a[500]; //

题目大意：输入n个木棍长度，判断能否组成一个正方形思路：深搜，并通过几种方法剪枝使时间复杂度降低#include #includeusing namespace std;int sum, n, len[21], flag;bool isok[21];bool cmp (int a, int b){ return a<b;}void dfs(int lens,

DescriptionJohn never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John

01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为C1，C2，…，Cn，与之相对应的价值为W1,W2，…，Wn.求解将那些物品装入背包可使总价值最大。动态规划（DP）：        1） 子问题定义：F[i][j]表示前i件物品中选取若干件物品放入剩余空间为j的背包中所能得到的最大价值。        2） 根据第i件物品放或不放进行决策

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27754 Accepted Submission(s): 12338Problem Description A ring is compose

遗传算法是一种仿生算法，用于获得一些问题的满意解，自己感觉这种算法很有意思，就写了这个程序（后来交了大作业）。源代码：http://pan.baidu.com/s/1bosWRIf下面抄自百度百科：遗传算法（Genetic Algorithm）是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型，是一种通过模拟自然进化过程搜索最优解的方法。遗传算法是从代表问题可能潜在的

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9733    Accepted Submission(s): 3539Problem DescriptionAs the new term comes, the Igna

A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are1035 Robot Motion">A robot has been programmed to follow the instruction

题目是哪的我给忘了。大意要求输入n组数，前一个数是DPS，后一个数是hp。每回合存活的敌人都会对你造成相当于DPS的伤害，你每回合都能对一个敌人造成一点伤害，要求求出所受的最少伤害。思路就是先杀DPS/hp最大的敌人，如果相同就杀血少的。#include#include#include#include#include#include#includeusing namesp

题意：给你一个row*col的矩阵，上面的'#'代表你不能走的地方，'.'表示你能走的地方，'@'表示你的起点，问你最多能走多少格。还是求连到一起的方块。。。但是一开始输入写反了，旋转了90度（之前已经犯过一次这种错误了。。。），WA了好久。#include #include #include #include #include #includeusing namespace