HR30 Day 29: Bitwise AND

1 개요

HR30 Day 29: Bitwise AND

• https://www.hackerrank.com/challenges/30-bitwise-and/problem
• https://www.hackerrank.com/challenges/30-bitwise-and/tutorial

해커랭크 30 Days of Code

문제	풀이
20-29 Day e
HR30 Day 20: Sorting
HR30 Day 21: Generics
HR30 Day 22: Binary Search Trees
HR30 Day 23: BST Level-Order Traversal
HR30 Day 24: More Linked Lists
HR30 Day 25: Running Time and Complexity
HR30 Day 26: Nested Logic
HR30 Day 27: Testing
HR30 Day 28: RegEx, Patterns, and Intro to Databases
HR30 Day 29: Bitwise AND

2 Java

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {
    private static final Scanner scanner = new Scanner(System.in);
    public static void main(String[] args) {
        int t = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
        for (int tItr = 0; tItr < t; tItr++) {
            String[] nk = scanner.nextLine().split(" ");
            int n = Integer.parseInt(nk[0]);
            int k = Integer.parseInt(nk[1]);
            if( ((k-1)|k)<=n )
                System.out.println( k-1 );
            else
                System.out.println( k-2 );
        }
        scanner.close();
    }
}

3 PHP

<?php
$stdin = fopen("php://stdin", "r");
fscanf($stdin, "%d\n", $t);
for ($t_itr = 0; $t_itr < $t; $t_itr++) {
    fscanf($stdin, "%[^\n]", $nk_temp);
    $nk = explode(' ', $nk_temp);
    $n = intval($nk[0]);
    $k = intval($nk[1]);
    if( (($k-1)|$k) <= $n ) echo $k-1 . "\n";
    else echo $k-2 . "\n";
}
fclose($stdin);

4 Python

#!/bin/python3
import math
import os
import random
import re
import sys

if __name__ == '__main__':
    t = int(input())
    for t_itr in range(t):
        nk = input().split()
        n = int(nk[0])
        k = int(nk[1])
        print(k-1 if ((k-1) | k) <= n else k-2)