結果
問題 | No.1509 Swap!! |
ユーザー |
![]() |
提出日時 | 2021-05-14 23:56:53 |
言語 | Java (openjdk 23) |
結果 |
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 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
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 remaindera = 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;}}