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: 358 ms):
import java.util.*;
import java.io.*;

public class C_Trip_to_the_Olympiad {

    int mod = (int) 1e9 + 7;
    
    public static void main(String[] args) {
        int t = sc.nextInt();
        while (t-- > 0) {
            int l = sc.nextInt();
            int r = sc.nextInt();
            int x1 = r;
            int x2 = l;
            boolean f1 = false;
            boolean f2 = false;

            for(int i=30;i>=0;i--){
                int b1 = ((x1>>i)&1);
                int b2 = ((x2>>i)&1);
                if(b1==b2){
                    if(f1) x1 = x1 ^ (1<<i);
                    else if(f2) x2 = x2 ^ (1<<i);
                    else{
                        if(b1==0 && (x2^(1<<i))<=r){
                            // System.out.println((x2^(1<<i)));
                            x2 = x2 ^ (1<<i);
                            f2 = true;
                        }
                        else if(b1==1 && (x1^(1<<i))>=l){
                            x1 = x1 ^ (1<<i);
                            f1 = true;
                        }
                        
                    }
                }
                // System.out.println(x2);
            }
            int x3 = l;
            boolean f3 = false;

            for(int i=30;i>=0;i--){
                int b1 = ((x1>>i)&1);
                int b2 = ((x2>>i)&1);
                if(b1==b2 && b1==1 && f3) x3^=(1<<i);
                if(b1==b2 && b1==0 && (x3^(1<<i))<=r){
                    f3 = true;
                    x3^=(1<<i);
                }
            }
            if(x2==x3) x3++;
            if(x1==x3) x3++;
            System.out.println(x1 + " " + x2 + " " + x3);
        }
    }
    
    public static void input(Object array) {
        if (array instanceof int[])
            for (int i = 0; i < ((int[]) array).length; i++)
                ((int[]) array)[i] = sc.nextInt();
        else if (array instanceof long[])
            for (int i = 0; i < ((long[]) array).length; i++)
                ((long[]) array)[i] = sc.nextLong();
    }
    
    public static void printArr(Object array) {
        if (array instanceof int[])
            for (int x : (int[]) array)
                System.out.print(x + " ");
        else if (array instanceof long[])
            for (long x : (long[]) array)
                System.out.print(x + " ");
        System.out.println();
    }
    
    public static <T extends Number> long gcd(T a, T b) {
        return b.longValue() == 0 ? a.longValue() : gcd(b, a.longValue() % b.longValue());
    }
    
    static FastReader sc = new FastReader();
    
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;
    
        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
    
        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
    
        int nextInt() {
            return Integer.parseInt(next());
        }
    
        long nextLong() {
            return Long.parseLong(next());
        }
    
        double nextDouble() {
            return Double.parseDouble(next());
        }
    
        String nextLine() {
            String str = "";
            try {
                str = br.readLine().trim();
            } catch (Exception e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}