# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71776 | λf.(λx.f (x x)) (λx.f (x x)) (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++98 | 3 ms | 440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |