# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71775 | 2018-08-25T15:20:40 Z | 내일_개학이다_ㅠㅠ(#2253, mAng0) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 2 ms | 256 KB |
#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 |
---|---|---|---|---|
1 | Runtime error | 2 ms | 256 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |