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

Solution 1 (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);
			
			
		}
		
	}
	
}





Solution 2 (runtime: 234 ms):
import java.util.*;

public class C{
    public static boolean powerOf2(int n){
        if(n==1) return false;
        int a = 1;
        while(a<n) a = a*2;
        if(a==n) return true;
        return false;
    }
    public static void main(String...args){
        Scanner sc = new Scanner(System.in);

        int t = sc.nextInt();
        while(t>0){
            t--;

            int l = sc.nextInt();
            int r = sc.nextInt();

            int mid = 0;
            boolean smallerThanr = false, greaterThanl = false;

            int start = 30;
            int i = start;
            while(i>=0){
                int lbit = (((1<<i)&l)>>i);
                int rbit = (((1<<i)&r)>>i);
                if(lbit != rbit) break;
                mid += (lbit<<i);
                i--;
            }
            // System.out.println(mid);

            start = i;
            for(i=start; i>=0; i--){
                int lbit = (((1<<i)&l)>>i);
                int rbit = (((1<<i)&r)>>i);
                int mBit = 0;

                if(lbit==1 || rbit==1) mBit=0;
                else mBit = 1;
                mid += (mBit<<i);
            }
            // System.out.println(mid);

            
            i = start;
            while(i>=0 && mid <= l){
                int mBit = (((1<<i)&mid)>>i);
                // System.out.println(i + " " + mBit + " " + mid);
                if(mBit==0 && ((mid + (1<<i)) < r)){
                    mid += (1<<i);
                }
                i--;
            }
            System.out.println(l + " " + mid + " " + r);
        }
    }
}