結果

問題 No.1895 Mod 2
ユーザー tenten
提出日時 2023-01-18 08:27:40
言語 Java
(openjdk 23)
結果
AC  
実行時間 167 ms / 2,000 ms
コード長 3,169 bytes
コンパイル時間 2,667 ms
コンパイル使用メモリ 92,444 KB
実行使用メモリ 42,424 KB
最終ジャッジ日時 2024-06-11 11:47:29
合計ジャッジ時間 5,454 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 11
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    static final long MAX = 1000000000000000L;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int t = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        while (t-- > 0) {
            long left = sc.nextLong();
            long right = sc.nextLong();
            long ans = getUpperCount1(right) + getUpperCount2(right) - getLowerCount1(left) - getLowerCount2(left);
            sb.append(ans % 2).append("\n");
        }
        System.out.print(sb);
    }
    
    static long getUpperCount1(long x) {
        long left = 0;
        long right = 1000000000;
        while (right - left > 1) {
            long m = (left + right) / 2;
            if (m * m <= x) {
                left = m;
            } else {
                right = m;
            }
        }
        return left;
    }
    static long getUpperCount2(long x) {
        long left = 0;
        long right = 1000000000;
        while (right - left > 1) {
            long m = (left + right) / 2;
            if (m * m * 2 <= x) {
                left = m;
            } else {
                right = m;
            }
        }
        return left;
    }
    static long getLowerCount1(long x) {
        long left = 0;
        long right = 1000000000;
        while (right - left > 1) {
            long m = (left + right) / 2;
            if (m * m < x) {
                left = m;
            } else {
                right = m;
            }
        }
        return left;
    }
    static long getLowerCount2(long x) {
        long left = 0;
        long right = 1000000000;
        while (right - left > 1) {
            long m = (left + right) / 2;
            if (m * m * 2 < x) {
                left = m;
            } else {
                right = m;
            }
        }
        return left;
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0