結果

問題 No.1730 GCD on Blackboard in yukicoder
ユーザー shojin_proshojin_pro
提出日時 2021-11-05 22:02:10
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,313 bytes
コンパイル時間 2,129 ms
コンパイル使用メモリ 79,132 KB
実行使用メモリ 55,100 KB
最終ジャッジ日時 2024-04-24 05:49:55
合計ジャッジ時間 17,216 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,252 ms
55,100 KB
testcase_01 AC 69 ms
42,388 KB
testcase_02 AC 65 ms
42,292 KB
testcase_03 AC 72 ms
42,448 KB
testcase_04 AC 78 ms
42,240 KB
testcase_05 AC 72 ms
42,264 KB
testcase_06 AC 68 ms
42,256 KB
testcase_07 AC 79 ms
42,256 KB
testcase_08 WA -
testcase_09 AC 68 ms
42,060 KB
testcase_10 WA -
testcase_11 AC 65 ms
42,232 KB
testcase_12 AC 67 ms
41,980 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 1,207 ms
55,056 KB
testcase_23 AC 329 ms
52,480 KB
testcase_24 WA -
testcase_25 WA -
権限があれば一括ダウンロードができます

ソースコード

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 {
        solve();
        pw.flush();
    }
    
    static int maxA = (int)1e6+1;
    public static void solve() {
        int n = sc.nextInt();
        int[] cnt = new int[maxA];
        for(int i = 0; i < n; i++){
            int a = sc.nextInt();
            int rootA = (int)Math.sqrt(a);
            for(int j = 1; j <= rootA; j++){
                if(a % j == 0){
                    cnt[j]++;
                    cnt[a/j]++;
                }
            }
        }
        int[] ans = new int[n+1];
        for(int i = 1; i < maxA; i++){
            ans[Math.min(cnt[i],n)] = i;
        }
        int max = 0;
        for(int i = n; i > 0; i--){
            max = Math.max(max,ans[i]);
            pw.println(max);
        }
    }
    
    static class ArrayComparator implements Comparator<int[]> {
        @Override
        public int compare(int[] a1, int[] a2) {
            if(a1[1] > a2[1]){
                return -1;
            }else if(a1[1] < a2[1]){
                return 1;
            }else{
                if(a1[0] < a2[0]){
                    return -1;
                }else{
                    return 1;
                }
            }
        }
    }

    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