DFS
DFS
饕餮梼杌之徒
这个作者很懒,什么都没留下…
展开
-
DFS
#include<bits/stdc++.h>using namespace std;int visited[100];const int N = 5;int maze[N][N] = { { 0, 1, 1, 0, 0 }, { 0, 0, 1, 1, 0 }, { 0, 1, 1, 1, 0 }, { 1, 0, 0, 0, 0 }, ...原创 2020-01-18 14:28:39 · 70 阅读 · 0 评论 -
poj2956The Pilots Brothers' refrigerator
The Pilots Brothers’ refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33314 Accepted: 12924 Special JudgeDescriptionThe game “The Pilots Brothers: following the stripy elep...原创 2019-12-23 20:34:51 · 96 阅读 · 0 评论 -
poj1753Flip Game
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 58520 Accepted: 24385DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 s...原创 2019-12-21 20:55:20 · 158 阅读 · 0 评论 -
P1596 [USACO10OCT]湖计数Lake Counting
题目描述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 square contai...原创 2019-12-08 15:55:00 · 172 阅读 · 0 评论 -
CF6A Triangle
要求给定4根木棍的长度,如果它们中存在3根木棍可以组成三角形,输出"TRIANGLE";如果它们无法组成三角形,但是它们中存在3根木棍可以组成退化的三角形(任意两边之和大于等于第三边,但是不是三角形),输出"SEGMENT";否则,输出"IMPOSSIBLE"。注意: 木棍不能折断,也不能只用一部分长度。输入一行4个整数,4根木棍的长度。输出如果它们中存在3根木棍可以组成三角形,输出"...原创 2019-12-08 15:23:04 · 216 阅读 · 0 评论 -
[kuangbin带你飞]专题一 + 简单搜索 + 棋盘问题 + poj1321
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 89644 Accepted: 41188Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。...原创 2019-11-17 11:24:16 · 109 阅读 · 0 评论 -
poj2245Lotto
DescriptionIn the German Lotto you have to select 6 numbers from the set {1,2,…,49}. A popular strategy to play Lotto - although it doesn’t increase your chance of winning - is to select a subset S c...原创 2019-10-24 21:29:21 · 148 阅读 · 0 评论