#404046 (Java21) No.939 and or

• 問題: No.939 and or
• ユーザー: Oland
• 提出日時: 2019-12-02 18:26:08
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 51 ms / 2,000 ms
• コード長: 6,591 bytes
• コンパイル時間: 1,999 ms
• コンパイル使用メモリ: 78,592 KB
• 実行使用メモリ: 50,736 KB
• 最終ジャッジ日時: 2024-11-24 14:31:43
• 合計ジャッジ時間: 4,472 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	50 ms; 50,536 KB
testcase_01	AC	50 ms; 50,440 KB
testcase_02	AC	50 ms; 50,436 KB
testcase_03	AC	51 ms; 50,536 KB
testcase_04	AC	48 ms; 50,512 KB
testcase_05	AC	48 ms; 50,308 KB
testcase_06	AC	47 ms; 50,164 KB
testcase_07	AC	49 ms; 50,536 KB
testcase_08	AC	48 ms; 50,476 KB
testcase_09	AC	49 ms; 50,412 KB
testcase_10	AC	49 ms; 50,508 KB
testcase_11	AC	49 ms; 50,560 KB
testcase_12	AC	49 ms; 50,644 KB
testcase_13	AC	50 ms; 50,472 KB
testcase_14	AC	48 ms; 50,352 KB
testcase_15	AC	48 ms; 50,372 KB
testcase_16	AC	48 ms; 50,352 KB
testcase_17	AC	48 ms; 50,448 KB
testcase_18	AC	48 ms; 50,560 KB
testcase_19	AC	49 ms; 50,552 KB
testcase_20	AC	48 ms; 50,488 KB
testcase_21	AC	48 ms; 50,592 KB
testcase_22	AC	48 ms; 50,412 KB
testcase_23	AC	48 ms; 50,736 KB
testcase_24	AC	47 ms; 50,464 KB
testcase_25	AC	48 ms; 50,468 KB
testcase_26	AC	51 ms; 50,540 KB
testcase_27	AC	49 ms; 50,168 KB
testcase_28	AC	49 ms; 50,596 KB
testcase_29	AC	49 ms; 50,272 KB
testcase_30	AC	48 ms; 50,228 KB
testcase_31	AC	49 ms; 50,532 KB

ソースコード

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve() {
        long A = in.nextLong(), B = in.nextLong();
        if((A & B) != A){
            out.println("0");
            return;
        }
        long ans = 1;
        for(int i = 0; i <= 30; i++){
            if((((B >> i) & 1) == 1) && (((A >> i) & 1) == 0)) ans <<= 1;
        }
        if(A != B) ans >>= 1;
        out.println(ans);
    }
    
    public static void main(String[] args) {
        new Main().m();
    }

    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "output.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }

    static class FastScanner {
        private Reader input;

        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

        public int nextInt() {return (int) nextLong();}

        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}