Submission #52349157

---

Source Code Expand

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long L = scanner.nextLong(), R = scanner.nextLong();
        int max = Long.toBinaryString(R - L).length() - 1;
        long ms = 1L << max;
        long m = ms;
        while (m < L) m += ms;
        String sL = Long.toBinaryString(m - L);
        String sR = Long.toBinaryString(R - m);
        Stack<Long> up = new Stack<>();
        for (int i = 0;i < sL.length();i++) {
            if (sL.charAt(i) == '1') up.add(1L << (sL.length() - i - 1));
        }
        Queue<Long> down = new ArrayDeque<>();
        for (int i = 0;i < sR.length();i++) {
            if (sR.charAt(i) == '1') down.add(1L << (sR.length() - i - 1));
        }
        System.out.println(up.size() + down.size());
        long now = L;
        while (!up.isEmpty()) {
            long u = up.pop();
            System.out.println(now + " " + (now + u));
            now += u;
        }
        while (!down.isEmpty()) {
            long d = down.poll();
            System.out.println(now + " " + (now + d));
            now += d;
        }
    }
}

Submission Info

Judge Result