题目大意:给出n和m,表示有n个各格子,每次走1,3,5...2n-1。不能走出格子,问能否走到m。
解题思路:队友告诉我说n大于50的话都可以到达,还没想出证明的方法,小于50的话就直接bfs。
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
const int N = 105;
const int INF = 0x3f3f3f3f;
int n, m;
bool judge() {
if (n >= 50) return true;
queue<int> q;
int u, v, d[N];
memset(d, INF, sizeof(d));
d[1] = 1;
q.push(1);
while (!q.empty()) {
u = q.front(); q.pop();
if (u == m) return true;
v = u + d[u] + 2;
if (v <= n) {
q.push(v); d[v] = d[u] + 2;
}
v = u - d[u] - 2;
if (v > 0) {
q.push(v); d[v] = d[u] + 2;
}
}
return false;
}
int main() {
while (scanf("%d%d", &n, &m) == 2 && n && m) {
printf("%s\n", judge() ? "Let me try!" : "Don't make fun of me!");
}
return 0;
}