結果

問題 No.1509 Swap!!
ユーザー shojin_proshojin_pro
提出日時 2021-05-14 23:56:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 438 ms / 2,000 ms
コード長 3,794 bytes
コンパイル時間 2,296 ms
コンパイル使用メモリ 79,392 KB
実行使用メモリ 61,888 KB
最終ジャッジ日時 2024-10-02 06:31:00
合計ジャッジ時間 15,080 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,380 KB
testcase_01 AC 57 ms
50,516 KB
testcase_02 AC 347 ms
56,772 KB
testcase_03 AC 346 ms
56,952 KB
testcase_04 AC 333 ms
58,572 KB
testcase_05 AC 347 ms
59,008 KB
testcase_06 AC 357 ms
59,288 KB
testcase_07 AC 358 ms
56,204 KB
testcase_08 AC 354 ms
56,536 KB
testcase_09 AC 358 ms
59,596 KB
testcase_10 AC 343 ms
57,700 KB
testcase_11 AC 433 ms
59,224 KB
testcase_12 AC 436 ms
59,532 KB
testcase_13 AC 422 ms
61,888 KB
testcase_14 AC 437 ms
59,060 KB
testcase_15 AC 420 ms
59,824 KB
testcase_16 AC 424 ms
59,352 KB
testcase_17 AC 422 ms
59,264 KB
testcase_18 AC 423 ms
59,380 KB
testcase_19 AC 419 ms
58,900 KB
testcase_20 AC 438 ms
59,736 KB
testcase_21 AC 345 ms
59,348 KB
testcase_22 AC 325 ms
56,924 KB
testcase_23 AC 370 ms
59,388 KB
testcase_24 AC 367 ms
59,236 KB
testcase_25 AC 344 ms
59,300 KB
testcase_26 AC 342 ms
56,460 KB
testcase_27 AC 277 ms
58,500 KB
testcase_28 AC 275 ms
56,992 KB
testcase_29 AC 280 ms
56,592 KB
testcase_30 AC 420 ms
59,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        int T = sc.nextInt();
        for(int i = 0; i < T; i++) solve();
        pw.flush();
    }

    public static void solve() {
        long n = sc.nextLong();
        long a = sc.nextLong();
        long b = sc.nextLong();
        if(a == b){
            pw.println((n-a) >= n-1 && a == 1? "YES" : "NO");
        }else{
            long gcd = gcd(a,b);
            pw.println((n-a) + (n-b) >= n-1 && gcd == 1 ? "YES" : "NO");
        }
        
    }
    
    private static long gcd(long a, long b){
        while (b > 0)
        {
            long temp = b;
            b = a % b; // % is remainder
            a = temp;
        }
        return a;
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

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

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