Lancer

Escape Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 301 Accepted Submission(s): 110 Problem Description You find yourself trapped in a larg

素数环题目链接 ： 点这里#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int b[22];int vis[22];//判断是否访问int res[2...

3D dungeon题目链接 :点这里#include<iostream>#include<stdio.h>#include<queue>#include<string.h>using namespace std;struct LNode{ int x,y,z; int step ; ...

坦克大战 时间限制：1000 ms | 内存限制：65535 KB 难度：3描述 Many of us had played the game “Battle city” in our childhood, and some people (like me) even often play it on computer now. What we are discus...

图像有用区域 时间限制：3000 ms | 内存限制：65535 KB 难度：4描述“ACKing”同学以前做一个图像处理的项目时，遇到了一个问题，他需要摘取出图片中某个黑色线圏成的区域以内的图片，现在请你来帮助他完成第一步，把黑色线圏外的区域全部变为黑色。 图1 ...

Farm Irrigation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 263 Accepted Submission(s): 133 Problem Description Benny has a spacious farm

N皇后问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 805 Accepted Submission(s): 463 Problem Description 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允

Asteroids! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5527 Accepted Submission(s): 3514Problem Description You’re in space. You want

Sudoku Killer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1289 Accepted Submission(s): 422 Problem Description 自从2006年3月10日至11日的首届数独世界锦标赛以

Remainder Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 491 Accepted Submission(s): 132 Problem Description Coco is a clever boy, who is goo

Kaitou Kid - The Phantom Thief (2) Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 234 Accepted Submission(s): 99 Problem Description 破解字迷之后，

三个水杯 时间限制：1000 ms | 内存限制：65535 KB 难度：4 描述 给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。 输入 第一行一个整数N(0/* 广搜 六个方向 a - &g...