Submission #71686

#TimeUsernameProblemLanguageResultExecution timeMemory
71686team (#119)The Ant Doing Hard Work (FXCUP3_ant)C++98
0 / 100
3 ms508 KiB
#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+1)/(tmp+1)-1; } else l=mid+1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...