埃及分数

首先说下吧,这题测评系统答案有问题,nefu(http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=358)和rqnoj(https://www.rqnoj.cn/problem/240),后台数据存在争议

先看测试数据的可以进rqnoj,直接贴代码吧,迭代加深,很多人用的是gcd,我就知道用浮点数了,注意把握好误差的设置,代码如下:

#include "iostream"
#include <cmath>
#include <string.h>
#include "algorithm"
#include "stdio.h"
using namespace std;
int nextfrom,minlevel,a,b,bit[55],bit2[55];
const double eps=1e-9;
int getstart(double a){
    if (abs(a)<eps) {
        return 0;
    }
    return abs(floor(1.0/a)-1.0/a)<eps?1.0/a:1.0/a+1;
}
int getnextdfs(double jud){
    return abs(floor(jud)-jud)<eps?jud:jud+1;
}
int getbetter(int a2[],int b2[]){//a2是答案,b2是枚举类型
    int i=-1;
    for (i=minlevel-1; i>=0; i--) {
        if (a2[i]!=b2[i]) {
            break;
        }
    }
    if ((i==minlevel-1 && a2[i]>b2[i]) || (i!=minlevel-1 && a2[i]<b2[i])) {
        return 1;
    }
    return 0;
}
bool notinset(int k,int level){
    for (int i=0; i<=level; i++) {
        if (bit[i]==k) {
            return 0;
        }
    }
    return 1;
}
bool dfs(int level,double result,int from){
    int ok=0;
    if (!from) {
        sort(bit,bit+minlevel);
        if (getbetter(bit2, bit)) {
            for (int i=0; i<minlevel; i++) {
                bit2[i]=bit[i];
            }
        }
        return 1;
    }
    for (int i=from; ; i++) {
        int getlevel=getnextdfs(result*i);
        if (level+getlevel>minlevel) {
            break;
        }
        if (notinset(i,level)) {
            int temp=bit[level];
            bit[level]=i;
            if (dfs(level+1, result-1.0/i, getstart(result-1.0/i))) {
                ok=1;
            }
            bit[level]=temp;
        }
    }
    return ok;
}
int main(){
    while (~scanf("%d%d",&a,&b)) {
        minlevel=0;
        while (!dfs(0, a*1.0/b, getstart(a*1.0/b))) {
            minlevel++;
        }
        for (int i=0; i<50; i++) {
            bit2[i]=1e+8;
        }
        if (dfs(0, a*1.0/b, getstart(a*1.0/b))) {
            for (int i=0; i<minlevel; i++) {
                printf("%d ",bit2[i]);
            }
            cout<<endl;
        }
    }
}//3484 8145