| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 71775 | 내일_개학이다_ㅠㅠ (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++98 | 2 ms | 256 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"
int FindK(){
int rett = DeliverCount(99999999);
int ss = 1, ee = 99999999, ans = 99999999;
ss = 99999999 / (rett+1) + 1;
ee = 99999999 / rett;
ans = ee; ee--;
while(ss <= ee){
int mid = (ss+ee)/2;
int ret = DeliverCount(mid);
if(ret > 0){
ans = mid;
}else{
ss = mid + 1;
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||