Submission #71776

#TimeUsernameProblemLanguageResultExecution timeMemory
71776λf.(λx.f (x x)) (λx.f (x x)) (#119)The Ant Doing Hard Work (FXCUP3_ant)C++98
100 / 100
3 ms440 KiB
#include "ant.h"
#include <algorithm>
using namespace std;

int FindK() {
    int lo = 1;
    int hi = 99999999;
    int init = 66666666;
    int c = DeliverCount(init);
    if (c == 0) lo = init + 1;
    else {
        hi = init/c;
        lo = init/(c+1);
    }
    while(lo < hi){
        int mid = (lo+hi)>>1;
        if (DeliverCount(mid))hi=mid;
        else lo=mid+1;
    }
    return lo;
}
#Verdict Execution timeMemoryGrader output
Fetching results...