Submission #71690

#TimeUsernameProblemLanguageResultExecution timeMemory
71690team (#119)The Ant Doing Hard Work (FXCUP3_ant)C++98
0 / 100
2 ms248 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=r;
        int tmp=DeliverCount(mid);
        if(tmp){
            r=mid/tmp;
            l=max(mid/(tmp+1)+1,l);
        }
        else l=mid+1;
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...