_阿阿阿阿欢

坦克大战时间限制：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 dis

PetTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1737    Accepted Submission(s): 835Problem DescriptionOne day, Lin Ji wake up in

Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6775 Accepted: 3620DescriptionFarmer John's farm was flooded in the most recent storm,

Exchange CardsTime Limit: 2 Seconds      Memory Limit: 65536 KB As a basketball fan, Mike is also fond of collecting basketball player cards. But as a student, he can not always get the mo

Fire NetTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7912    Accepted Submission(s): 4505Problem DescriptionSuppose that we have

变形课Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 17913    Accepted Submission(s): 6443Problem Description呃......变形课上Harry碰到了一点小麻烦

CC On The TreeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1726    Accepted Submission(s): 617Problem DescriptionCC lives on the

SeedingTime Limit: 2 Seconds      Memory Limit: 65536 KB It is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There

经典的搜索问题，先深搜求出所有情况 #include #include #include int n,s[15],sum; bool check (int x){ int i; for(i=1;i<x;++i){ if(s[i]==s[x] || abs(x-i)==abs(s[x]-s[i]))//注意 ret

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28147 Accepted: 13918Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编

MazeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 903    Accepted Submission(s): 316Problem DescriptionThis story happened on th

胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6656    Accepted Submission(s): 2315Problem DescriptionIgnatius再次被魔王抓走了(搞不懂他

标题：六角填数   下图所示六角形中，填入1~12的数字。   使得每条直线上的数字之和都相同。   图中，已经替你填好了3个数字，请你计算星号位置所代表的数字是多少？蓝桥杯填空题只要结果。方法一：直接暴力#include "cstdio"#include "cstring"#include "iostream"#inc

#include #include #include #include using namespace std;int n, m, flag;int a[11000], b[11000];int cmp(int a, int b){ return a > b;}void dfs(int pos , int ans, int sum){ if(sum == n){ fl

Additive equationsTime Limit: 10 Seconds      Memory Limit: 32768 KB     We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer s

逃离迷宫Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19403    Accepted Submission(s): 4708Problem Description　　给定一个m × n (m行, n列)的迷宫，

Dating with girls(2)Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2656    Accepted Submission(s): 741Problem DescriptionIf you hav

3D dungeon时间限制：1000 ms  |  内存限制：65535 KB难度：2描述You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be fil

一笔画问题时间限制：3000 ms  |  内存限制：65535 KB难度：4描述zyc从小就比较喜欢玩一些小游戏，其中就包括画一笔画，他想请你帮他写一个程序，判断一个图是否能够用一笔画下来。规定，所有的边都只能画一次，不能重复画。 输入第一行只有一个正整数N(N每组测试数据的第一行有两个正整数P,Q(P随后的Q行，每行有

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

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

非常可乐Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7960    Accepted Submission(s): 3178Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是

SudokuTime Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others)Submit StatusYi Sima was one of the best counselors of Cao Cao. He likes to play a funny

红黑树时间限制：3000 ms  |  内存限制：65535 KB难度：3描述什么是红黑树呢？顾名思义，跟枣树类似，红黑树是一种叶子是黑色果子是红色的树。。。当然，这个是我说的。。。《算法导论》上可不是这么说的：如果一个二叉查找树满足下面的红黑性质，那么则为一个红黑树。1）每个节点或是红的，或者是黑的。2）每个叶子节点

题意：有N个池塘和M条连接池塘的无向管道，每个池塘都有一个价值。现在要把临近池塘数小于2的池塘全部移除（不移除管道），让你求出所有由奇数个池塘组成的连通分支，并统计它们的价值和。

Walking AntTime Limit: 2 Seconds      Memory Limit: 65536 KBAnts are quite diligent. They sometimes build their nests beneath flagstones.Here, an ant is walking in a rectangular area tiled w

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 89408    Accepted Submission(s): 24316Problem DescriptionThe dogg

迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11216 Accepted: 6709Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,

Sudoku KillerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4724    Accepted Submission(s): 1529Problem Description自从2006年3月10日至11日

第三题：李白打酒    话说大诗人李白，一生好饮。幸好他从不开车。    一天，他提着酒壶，从家里出来，酒壶中有酒2斗。他边走边唱：    无事街上走，提壶去打酒。    逢店加一倍，遇花喝一斗。    这一路上，他一共遇到店5次，遇到花10次，已知最后一次遇到的是花，他正好把酒喝光了。     请你计算李白遇到店和花的次序，可以把遇店记为a，遇花记为b

吝啬的国度时间限制：1000 ms  |  内存限制：65535 KB难度：3描述在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 80532 Accepted: 30038DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或

RescueTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18703    Accepted Submission(s): 6692Problem DescriptionAngel was caught by th

Red and BlackTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11503    Accepted Submission(s): 7158Problem DescriptionThere is a rect

Find a wayTime Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 5   Accepted Submission(s) : 3Font: Times New Roman | Verdana | Georgia Font S

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15293    Accepted Submission(s): 8789Problem DescriptionThe GeoSurvComp

Catch That CowTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8103    Accepted Submission(s): 2568Problem DescriptionFarmer John has

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18161 Accepted: 7056DescriptionYou are trapped in a 3D dungeon and need to find the quic

LabyrinthTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 3821 Accepted: 1453DescriptionThe northern part of the Pyramid contains a very large and comp

A计划Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10864    Accepted Submission(s): 2651Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之