# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71714 | 2018-08-25T13:00:16 Z | chobo(#2238, andy627) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 3 ms | 248 KB |
#include "ant.h" #include <stdio.h> #include <algorithm> using namespace std; int FindK() { int s=1,e=1e8,m; while(s<=e){ m=(s+e)>>1; printf("%d ",m); if(DeliverCount(m)) e=m-1; else s=m+1; } return s; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 248 KB | Wrong |
2 | Halted | 0 ms | 0 KB | - |