samlin961112@gmail.com
(林哲甫)
學校
:
新北市私立南山高級中學
編號 : 220506
來源 : [219.70.213.92]
最後登入時間 ：
2024-10-21 22:34:09
#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';
}
}
}
samlin961112@gmail.com
(林哲甫)
學校
:
新北市私立南山高級中學
編號 : 220506
來源 : [219.70.213.92]
最後登入時間 ：
2024-10-21 22:34:09
#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';
}
}
}
想不到怎麼剪枝了