Problem: 2057C - Trip to the Olympiad
Language: java

Solution 1 (runtime: 374 ms):
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;


public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int t = sc.nextInt();
        while(t-- != 0){
            int l = sc.nextInt(), r = sc.nextInt();
            int a = 0, b = 0, c = 0;
            int n1 = countBits(l), n2 = countBits(r);
            if(r - l == 2){
                a = l; b = a + 1; c = b + 1;
            }
            else{
                int count = 0;
                for(int i = Math.max(n1, n2) - 1; i >= 0; i--){
                    int bit1 = ((l & (int)(1 << i)) == 0) ? 0 : 1;
                    int bit2 = ((r & (int)(1 << i)) == 0) ? 0 : 1;
                    count = i;
                    if(bit1 != bit2){
                        break;
                    }
                    int val = bit1 << i;
                    a += val; b += val;
                }
                a += (int)(1 << count);
                for(int i = count - 1; i >= 0; i--){
                    b += (int)(1 << i);
                }
                for(int i = l; i <= r; i++){
                    if(a != i && b != i){
                        c = i;
                        break;
                    }
                }
            }
            out.println(a + " " + b + " " + c);
        }
        out.close();
        }
    
    static int countBits(int n){
        int count = 0;
        while(n != 0){
            n /= 2;
            count++;
        }
        return count;
    }

        static class FastScanner {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            StringTokenizer st = new StringTokenizer("");
     
            String next() {
                while (!st.hasMoreTokens())
                    try {
                        st = new StringTokenizer(br.readLine());
                    } catch (IOException e) {
                        e.printStackTrace();
                    }
                return st.nextToken();
            }
     
            int nextInt() {
                return Integer.parseInt(next());
            }
     
            int[] readArray(int n) {
                int[] a = new int[n];
                for (int i = 0; i < n; i++)
                    a[i] = nextInt();
                return a;
            }
     
            long nextLong() {
                return Long.parseLong(next());
            }
        }

    }

Solution 2 (runtime: 421 ms):
// package prectice;

import java.lang.reflect.Array;
import java.math.BigInteger;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Stack;
import java.util.TreeMap;
import java.util.regex.Pattern;
import java.util.stream.Stream;




public class P1 {
	
	public static BigInteger factorial(int n) {
        BigInteger fact = BigInteger.ONE;
        for (int i = 1; i <= n; i++) {
            fact = fact.multiply(BigInteger.valueOf(i));
        }
        return fact;
    }
	

    // Method to calculate nCr using BigInteger
	
    public static int nCr(int n, int r) {
        if (r > n) {
            return 0;
        }
        BigInteger numerator = factorial(n);
        BigInteger denominator = factorial(r).multiply(factorial(n - r));
        BigInteger result = numerator.divide(denominator);
        return result.intValue();  // Cast to int
    }
    
    public static long gcd(long a,long b) {
    	if(b == 0) {
    		return a;
    	}
    	return gcd(b,a%b);
    }
    
	public static void dfs(List<List<Integer>> edge,int u,int p,int[] d,int[] s) {
	    	
		s[u] = 1;
		for(int v : edge.get(u)) {
			if(v == p) {
				continue;
			}
			d[v] = d[u]+1;
			dfs(edge,v,u,d,s);
			s[u] += s[v];
		}
	    	
	}
	
	public static void dfs2(List<List<Integer>> edge,int u,int p,int sd,int[] s,int[] ans,int n) {
		
		ans[u] = sd;
		
		for(int v : edge.get(u)) {
			if(v == p) {
				continue;
			}
			int sdv = sd + n - 2*s[v];
			dfs2(edge,v,u,sdv,s,ans,n);
		}
		
	}
	
	public static long f(long n,int k) {
		if((n+1)/2 >= k && n != 1) {
			return f((n+1)/2,k);
		}
		return n;
	}

    	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		
//		StringBuilder ansf = new StringBuilder("");

		
		while(t-- > 0) {
			
			int n = sc.nextInt();
			int m = sc.nextInt();
			
			int nn = n;
			int mm = m;
		
			int[] ar1 = new int[30];
			int[] ar2 = new int[30];
			
			for(int i=29;i>=0;i--) {
				ar1[i] = n%2;
				n/=2;
				ar2[i] = m%2;
				m/=2;
			}
			
			int ans = -1;
			for(int i=0;i<30;i++) {
				if(ar1[i] != ar2[i]) {
					ans = i;
					break;
				}
			}
			
			int a = 0;
			int b = 0;
			for(int i=0;i<30;i++) {
				if(i < ans) {
					a  = a*2 + ar1[i];
					b  = b*2 + ar1[i];
				}
				else if(i == ans) {
					a = a*2 + 1;
					b = b*2;
				}
				else {
					b = b*2 + 1;
					a = a*2;
				}
			}
			
			int c = 0;
			for(int i=nn;i<=mm;i++) {
				if(i != a && i != b) {
					c = i;
					break;
				}
			}
			
			System.out.println(a + " " + b + " " + c);
			
			
		}
		
	}
	
}