😎All placement help available 😔

🔥All Companies help Available (Genuine + Clearance guarantee) ▶️

😎All placement help available 😔

string largestMagical(string binString) {
    if (binString.empty()) return binString;
    vector<string> ans;
    int cnt = 0, j = 0;
    for (int i = 0; i < binString.size(); ++i) {
        cnt += binString[i] == '1' ? 1 : -1;
        if (cnt == 0) {
            ans.push_back("1" + largestMagical(binString.substr(j + 1, i - j - 1)) + "0");
            j = i + 1;
        }
    }
    sort(ans.begin(), ans.end(), greater<string>());
    return accumulate(ans.begin(), ans.end(), string{});
}

def max_distance(n, intervals):
    intervals.sort(key=lambda x: x[1])
    def possible(distance):
        prev = intervals[0][0]
        for start, end in intervals[1:]:
            prev = max(prev + distance, start)
            if prev > end:
                return False
        return True

    low, high = 0, intervals[-1][1] - intervals[0][0]
    while low <= high:
        mid = (low + high) // 2
        if possible(mid):
            low = mid + 1
        else:
            high = mid - 1

    return low - 1

n = int(input())
intervals = [list(map(int, input().split())) for _ in range(n)]
print(max_distance(n, intervals))

#include <stdio.h>
#include <regex.h>
int isPowerOfTwo(const char *binaryString) {
    regex_t regex;
    int result;
    result = regcomp(&regex, "^0*10*$", REG_EXTENDED);
    if (result) {
        printf("Could not compile regex\n");
        return 0;
    }
    result = regexec(&regex, binaryString, 0, NULL, 0);
    regfree(&regex);
    if (!result) {
        return 1;
    } else {
        return 0;
    }
}

int main() {
    int t;
    char binaryString[1000]; 
    scanf("%d", &t);
    while (t--) {
        scanf("%s", binaryString);
        if (isPowerOfTwo(binaryString)) {
            printf("True\n");
        } else {
            printf("False\n");
        }
    }

    return 0;
}