桥本分数,吧{1,2,3,...,9}这9个数字填入图中的9个方格中使得等式成立(要求不得重复),使用回溯求解。
//8_7
#include<iostream>
#include<vector>
using namespace std;
int n = 9;
vector<int> result(n), visited(n + 1);
void dfs(int i) {
if (i == n) {
if (result[0] / double(result[1] * 10 + result[2]) + result[3] / double(result[4] * 10 + result[5]) == result[6] / double(result[7] * 10 + result[8]))
cout << result[0] << "/" << result[1] << result[2] << " + " << result[3] << "/" << result[4] << result[5] << " = " << result[6] << "/" << result[7] << result[8] << endl;
}
else
for (int j = 1; j <= 9; j++) {
if (!visited[j]) {
visited[j] = 1;
result[i] = j;
dfs(i + 1);
visited[j] = 0;
}
}
}
int main() {
dfs(0);
return 0;
}