# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71675 | 2018-08-25T10:57:04 Z | team(#2232, comfile) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int FindK(){ int l=0; int r=1e8-1; while(l<r){ int mid=(l+r)/2; if(DeliverCount(mid)) r=mid; else l=mid+1; } return l; }