| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 71682 | team (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++98 | 2 ms | 376 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 <bits/stdc++.h>
#include "ant.h"
using namespace std;
int FindK(){
int l=1; int r=1e8-1;
while(l<r){
int mid=(l+r)/2;
int tmp=DeliverCount(mid);
if(tmp) r=mid/tmp,l=mid/(tmp+1)+1;
else l=mid+1;
}
return l;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||