A Blog

摘要： bfsView Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 55struct Point{ int x, y;}q[maxn * maxn];int n, m, ans;int map[maxn][maxn];bool vis[maxn][maxn];int dir[4][2] ={{ 0, -1 },{ -1, 0 },{ 0, 1 },{ 1, 0 } };bool o 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;char st[100];int main(){ //freopen("t.txt", "r", stdin); while (scanf("%s", st)) { if (strcmp(st, "#") == 阅读全文

摘要： dfsView Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 25int n, m;int f[maxn], s[maxn];int ans;void dfs(int cow, int sum){ if (ans == 0) return; if (s[cow] + sum < m) return; if (sum >= m) { ans = min(ans, s 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int main(){ //freopen("t.txt", "r", stdin); int t; scanf("%d", &t); while (t--) { int year, month, day, hour, minute, second; scanf(" 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 100int n, w, s;char name[maxn][100];bool out[maxn];int main(){ //freopen("t.txt", "r", stdin); scanf("%d", &n); for (int i = 阅读全文