Submission #95584

#TimeUsernameProblemLanguageResultExecution timeMemory
95584shenxyGap (APIO16_gap)C++11
0 / 100
47 ms1240 KiB
#include "gap.h"
#include <algorithm>
using namespace std;
long long findGap(int T, int N){
    long long int m, n;
    MinMax(1, 1E18, &m, &n);
    long long int ans = 0;
    while (m < n) {
        long long int a = m, b = n;
        MinMax(a + 1, b - 1, &m, &n);
        ans = max(ans, max(m - a, b - n));
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...