渣渣眼里没有水题

原题 Ants Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 14721   Accepted: 6413 Description An army of ants walk on a horizontal pole of length l cm, e

DFS    部分和问题 描述 给定整数a1、a2、.......an，判断是否可以从中选出若干数，使它们的和恰好为K。 输入首先，n和k，n表示数的个数，k表示数的和。 接着一行n个数。 （1 输出如果和恰好可以为k，输出“YES”，并按输入顺序依次输出是由哪几个数的和组成，否则“NO” 样例输入 4 13 1 2 4 7 样例输出 YES 2 4

Lake Counting Description Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each

最少步数 最少步数 时间限制：3000 ms  |  内存限制：65535 KB 难度：4 描述 这有一个迷宫，有0~8行和0~8列：  1,1,1,1,1,1,1,1,1  1,0,0,1,0,0,1,0,1  1,0,0,1,1,0,0,0,1  1,0,1,0,1,1,0,1,1  1,0,0,0,0,1,0,0,1  1,1,0

贪心 Best Cow Line   Description FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds th

贪心  Saruman's Army    Description Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known