#36138: 我超菜 只能拿到TLE


samlin961112@gmail.com (林哲甫)


#include <bits/stdc++.h>
using namespace std;
bool canWin(int n, int m, bool isMaxPlayer) {
  if (n == 0 && m == 0) {
    return false; 
  }
  for (int i = 1; i <= n; ++i) {
    if (!canWin(n - i, m, !isMaxPlayer)) {
      return true;
    }
  }
  for (int i = 1; i <= m; ++i) {
    if (!canWin(n, m - i, !isMaxPlayer)) {
      return true;
    }
  }

  return false; 
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  while (cin >> n >> m) {
    bool isMaxPlayer = true; 
    bool canFirstPlayerWin = canWin(n, m, isMaxPlayer);

    if (canFirstPlayerWin) {
      cout << ">\\\\\\<" << '\n';
    } else {
      cout << "= =\"" << '\n';
    }
  }
}

#36139: Re: 我超菜 只能拿到TLE


samlin961112@gmail.com (林哲甫)


#include
using namespace std;
bool canWin(int n, int m, bool isMaxPlayer) {
  if (n == 0 && m == 0) {
    return false; 
  }
  for (int i = 1; i <= n; ++i) {
    if (!canWin(n - i, m, !isMaxPlayer)) {
      return true;
    }
  }
  for (int i = 1; i <= m; ++i) {
    if (!canWin(n, m - i, !isMaxPlayer)) {
      return true;
    }
  }

  return false; 
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  while (cin >> n >> m) {
    bool isMaxPlayer = true; 
    bool canFirstPlayerWin = canWin(n, m, isMaxPlayer);

    if (canFirstPlayerWin) {
      cout << ">\\\\\\<" << '\n';
    } else {
      cout << "= =\"" << '\n';
    }
  }
}

想不到怎麼剪枝了

#36174: Re: 我超菜 只能拿到TLE


cges30901 (cges30901)


你要不要看看討論區?這題其實超簡單