挑战程序设计
文章平均质量分 85
Apoised
我将一直前行,即使那时身边空无一人。
展开
-
poj1852(Ants)
原题AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14721 Accepted: 6413DescriptionAn army of ants walk on a horizontal pole of length l cm, e原创 2016-07-27 20:00:29 · 211 阅读 · 0 评论 -
nyoj 1058 (部分和问题)
DFS 部分和问题描述给定整数a1、a2、.......an,判断是否可以从中选出若干数,使它们的和恰好为K。输入首先,n和k,n表示数的个数,k表示数的和。接着一行n个数。(1输出如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入4 131 2 4 7样例输出YES2 4原创 2016-08-18 16:54:46 · 275 阅读 · 0 评论 -
poj 2386 (Lake Counting)
Lake CountingDescriptionDue 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原创 2016-08-18 17:36:51 · 205 阅读 · 0 评论 -
DFS && BFS 最少步数(nyoj 58)
最少步数最少步数时间限制: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原创 2016-07-29 16:30:44 · 232 阅读 · 0 评论 -
poj 3614(Best Cow Line)
贪心Best Cow Line DescriptionFJ 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原创 2016-08-20 16:56:01 · 236 阅读 · 0 评论 -
poj 3069 (Saruman's Army)
贪心 Saruman's Army DescriptionSaruman 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原创 2016-08-22 11:18:12 · 239 阅读 · 0 评论