結果

問題 No.1791 Repeat Multiplication
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-22 04:59:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,814 ms / 3,000 ms
コード長 3,454 bytes
コンパイル時間 4,843 ms
コンパイル使用メモリ 81,656 KB
実行使用メモリ 263,724 KB
最終ジャッジ日時 2023-10-13 23:14:42
合計ジャッジ時間 58,679 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
50,996 KB
testcase_01 AC 63 ms
48,604 KB
testcase_02 AC 65 ms
50,804 KB
testcase_03 AC 65 ms
51,172 KB
testcase_04 AC 81 ms
51,236 KB
testcase_05 AC 84 ms
51,568 KB
testcase_06 AC 66 ms
51,056 KB
testcase_07 AC 80 ms
51,052 KB
testcase_08 AC 340 ms
64,704 KB
testcase_09 AC 357 ms
64,516 KB
testcase_10 AC 317 ms
60,432 KB
testcase_11 AC 454 ms
67,808 KB
testcase_12 AC 272 ms
59,984 KB
testcase_13 AC 2,367 ms
244,024 KB
testcase_14 AC 2,466 ms
248,584 KB
testcase_15 AC 1,678 ms
196,140 KB
testcase_16 AC 1,621 ms
192,368 KB
testcase_17 AC 2,604 ms
254,468 KB
testcase_18 AC 2,120 ms
216,068 KB
testcase_19 AC 2,470 ms
241,484 KB
testcase_20 AC 1,791 ms
202,728 KB
testcase_21 AC 2,339 ms
239,036 KB
testcase_22 AC 2,723 ms
255,436 KB
testcase_23 AC 2,066 ms
205,804 KB
testcase_24 AC 2,580 ms
249,116 KB
testcase_25 AC 2,249 ms
232,724 KB
testcase_26 AC 2,577 ms
250,612 KB
testcase_27 AC 1,933 ms
215,640 KB
testcase_28 AC 2,802 ms
260,060 KB
testcase_29 AC 2,727 ms
257,692 KB
testcase_30 AC 2,814 ms
260,584 KB
testcase_31 AC 63 ms
50,636 KB
testcase_32 AC 2,711 ms
260,284 KB
testcase_33 AC 2,669 ms
263,724 KB
testcase_34 AC 2,720 ms
259,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int n = ni();
    int q = ni();

    int[][] divs = new int[n + 1][];
    int[] divP = new int[n + 1];

    long[] dpL = new long[n + 1];
    dpL[1] = 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 2; j * i <= n; j++) {
        int k = j * i;
        dpL[k] += dpL[i];
        divP[k] ++;
      }
    }
    for (int i = 1; i <= n; i ++) {
      divs[i] = new int[divP[i]];
    }

    Arrays.fill(divP, 0);
    for (int i = 1; i <= n; i++) {
      for (int j = 2; j * i <= n; j++) {
        int k = j * i;
        divs[k][divP[k] ++] = i;
      }
    }

    long[] dpR = new long[n + 1];
    Arrays.fill(dpR, 1);
    for (int i = n; i >= 1; i--) {
      for (int j = 0; j < divP[i]; j++) {
        int v = divs[i][j];
        if (v == 1) continue;
        dpR[i / v] += dpR[i];
      }
    }

    for (int i = 0; i < q; i++) {
      int x = ni();
      long ret = 1;
      for (int j = 2; j * x <= n; j++) {
        ret += dpR[j * x];
      }
      ret *= dpL[x];

      out.println(ret);
    }
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0