test

原始文件为 cpp 代码，本文是转换后的 Markdown 文件。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
#include <set>
#include <ctime>

using namespace std;
set<long long> islegal;

int maxd = 0;
long long get_first(long long a, long long b)
{
    return (b%a) ? (b/a + 1) : (b/a);
}

int main()
{
    int ok = 0;
    for(maxd = 1; ; ++maxd)
    {
        memset(ans, -1, sizeof(ans));
        if(dfs(0, get_first(a, b), a, b))
        {
            ok = 1; break;
        }
    }
}

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, long long aa, long long bb)
{
    if(d == maxd)
    {
        if(bb % aa) return false;
        v[d] = bb/aa;

        if(better(d)) memcpy(ans, v, sizeof(long long) * (d + 1));
        return true;
    }

    bool ok = false;
    from = max(from, get_first(aa, bb));
    for(int i = from; ; ++i)

        if(bb * (maxd + 1 - d) <= i * aa) break;
        v[d] = i;
        long long b2 = bb * i;
        long long a2 = aa * i - bb;
        long long g = gcd(a2, b2);
        if(dfs(d+1, i+1, a2/g, b2/g)) ok = true;
    }
    return ok;
}