Unaccept 100迭代加深求助

#include <bits/stdc++.h>
#define int long long

const int N = 1e7 + 5;
using namespace std;

int n, m;
int ans;
int a[N], w[N];

int gcd(int x, int y) {
    return y != 0 ? gcd(y, x % y) : x;
}
bool dfs(int cnt, int x, int y) {
	if (cnt == ans + 1) { 
		if (x == 0) {
			if (w[ans] > a[ans])
				for (int i = 1; i <= ans; i++) w[i] = a[i];
			return true;
		}
		else return false;
	}
	bool flag = false;
	for (int i = max(y / x, a[cnt - 1] + 1); i <= (ans - cnt + 1) * y / x; i++) {
		a[cnt] = i;
		int dx = x * i - y;
		int dy = y * i;
		int d = gcd(dx, dy);
		dx /= d;
		dy /= d;
		if (dfs(cnt + 1, dx, dy)) flag = true;
	}
	return flag;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n>> m;
	for (ans = 1; ; ans++) {
		w[ans] = 2e9;
		if (dfs(1, n, m) == true) break;
	}
	for (int i = 1; i <= ans; i++) cout << w[i]<< " ";
	return 0;
}