이진검색 더블릿 (PS)

#include <stdio.h>
 
int idx[10002] = { 0 };
int n, k;
 
int search(int right) {
    int left = 0,tmp=0;
    while (left <= right) {
        int mid = (left + right) / 2;
        if (mid > n) {
            right = mid - 1;
            tmp++;
        }
        else if (mid < n) {
            left = mid + 1;
            tmp++;
        }
        else {
            tmp++;
            return tmp;
        }
    }
}
 
int main() {
    scanf("%d %d", &n, &k);
    
    for (int i = n; i <= 10000; i++) {
        if (search(i-1) == k) {
            idx[i] = 1;
        }
    }
 
    //출력
    int num = 0;
    for (int i = n; i <= 10001; i++) {
        if (idx[i - 1] == 1 && idx[i] == 0)
            num++;
    }
    printf("%d\n", num);
 
    for (int i = n; i <= 10001; i++) {
        if (idx[i - 1] == 0 && idx[i] == 1) {
            printf("%d ", i);
        }
        if (idx[i - 1] == 1 && idx[i] == 0) {
            printf("%d\n", i-1);
        }
    }
}