UVA725 除法 Division

知识点：暴力枚举

这个题简单的思路就是枚举一个数，然后算出另外一个，看看是不是满足题意，我也没仔细挖掘题目的性质，写的代码比较长，时间也不短，不打算再想了

#include <bits/stdc++.h>

using namespace std;

const int N = 15;

int n, vis[N], order[N];
vector<pair<int, int>> ans;

void dfs(int k) {
	if (k == 6) {
		int x2 = 0;
		set<int> st;
		for (int i = 1; i <= 5; i++) {
		    x2 = x2 * 10 + order[i];
		    st.insert(order[i]);
		}
		int x1 = x2 * n;
		if (x1 >= 1e5 || x1 < 1e4) return;
		int tmp = x1;
		while (tmp) {
			st.insert(tmp % 10);
			tmp /= 10;
		}
		if ((int) st.size() == 10) {
			ans.push_back(make_pair(x1, x2));
		}
		return;
	}
	for (int i = 0; i < 10; i++) {
		if (vis[i]) continue;
		if (k == 1 && i >= 5) continue;
		vis[i] = 1;
		order[k] = i;
		dfs(k + 1);
		vis[i] = 0;
	}
}

int main() {
	int tt = 0;
	while (cin >> n && n) {
		if (tt++) cout << '\n';
		ans.clear();
		dfs(1);
		sort(ans.begin(), ans.end());
		if (!(int) ans.size()) cout << "There are no solutions for " << n << ".\n";
		else {
			for (int i = 0; i < (int) ans.size(); i++) {
				printf("%d / %05d = %d\n", ans[i].first, ans[i].second, n);
			}
		}
	}
	return 0;
}