习题7-7 埃及分数（Eg[y]ptian Fractions (HARD version), Rujia Liu's Present 6, UVa 12558）

一道IDA*的入门题，在普通的埃及分数上加上一个vis即可通过，需要注意的是long long。

#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)  
#define SFF(a, b) scanf("%d%d", &a, &b)  
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 105
#define maxm 205
#define mod 1000000007
#define INF 10000007
#define eps 1e-10
using namespace std;
//-------------------------CHC------------------------------//
int maxd;
LL v[maxn], ans[maxn];
int vis[1005];

inline int get_first(LL a, LL b) { return b / a + 1; }
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

bool better(int d) {
	for (int i = d; i >= 0; --i) if (v[i] != ans[i]) 
		return ans[i] == -1 || v[i] < ans[i];
	return false;
}

bool dfs(int d, int from, LL aa, LL bb) {
	if(d == maxd) {
		if (bb % aa) return false;
		v[d] = bb / aa;
		if (v[d] <= 1000 && vis[v[d]]) return false;
		if (better(d)) memcpy(ans, v, sizeof(LL)*(d + 1));
		return true;
	}
	from = max(from, get_first(aa, bb));
	bool ok = false;
	for (int i = from; ; ++i) {
		if (aa * i >= bb * (maxd - d + 1)) break;
		v[d] = i;
		if (v[d] <= 1000 && vis[v[d]]) continue;
		LL na = aa * i - bb, nb = bb * i;
		LL g = gcd(na, nb);
		if (dfs(d + 1, i + 1, na / g, nb / g)) ok = true;
	}
	return ok;
}

int main() {
	int a, b, k;
	int kase = 1;
	int t;
	SF(t);
	while (t--) {
		SFFF(a, b, k);
		CLEAR(vis, 0);
		int x;
		FOR(i, 0, k) SF(x), vis[x] = true;
		for (maxd = 1; ; ++maxd) {
			CLEAR(ans, -1);
			if (dfs(0, get_first(a, b), a, b)) break;
		}
		printf("Case %d: %d/%d=", kase++, a, b);
		for (int i = 0; i < maxd; ++i) printf("1/%lld+", ans[i]);
		printf("1/%lld\n", ans[maxd]);
	}
	return 0;
}