結果

問題 No.1791 Repeat Multiplication
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-22 04:56:30
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,450 bytes
コンパイル時間 4,737 ms
コンパイル使用メモリ 83,144 KB
実行使用メモリ 211,780 KB
最終ジャッジ日時 2023-10-13 23:04:42
合計ジャッジ時間 57,134 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
50,724 KB
testcase_01 AC 64 ms
51,100 KB
testcase_02 AC 65 ms
50,724 KB
testcase_03 AC 67 ms
50,996 KB
testcase_04 AC 83 ms
51,260 KB
testcase_05 AC 87 ms
51,248 KB
testcase_06 AC 70 ms
51,092 KB
testcase_07 AC 85 ms
51,056 KB
testcase_08 AC 348 ms
65,336 KB
testcase_09 AC 356 ms
64,908 KB
testcase_10 AC 364 ms
66,796 KB
testcase_11 AC 334 ms
63,008 KB
testcase_12 AC 298 ms
66,472 KB
testcase_13 AC 2,363 ms
198,464 KB
testcase_14 AC 2,558 ms
203,124 KB
testcase_15 AC 1,638 ms
166,452 KB
testcase_16 AC 1,624 ms
164,656 KB
testcase_17 AC 2,676 ms
205,096 KB
testcase_18 AC 1,994 ms
181,508 KB
testcase_19 AC 2,331 ms
197,756 KB
testcase_20 AC 1,763 ms
172,588 KB
testcase_21 AC 2,328 ms
195,388 KB
testcase_22 AC 2,656 ms
209,008 KB
testcase_23 AC 1,963 ms
174,960 KB
testcase_24 AC 2,527 ms
203,040 KB
testcase_25 AC 2,257 ms
193,640 KB
testcase_26 AC 2,505 ms
203,664 KB
testcase_27 AC 1,824 ms
181,704 KB
testcase_28 AC 2,618 ms
210,368 KB
testcase_29 AC 2,547 ms
210,408 KB
testcase_30 AC 2,579 ms
210,724 KB
testcase_31 AC 64 ms
50,640 KB
testcase_32 AC 2,569 ms
211,780 KB
testcase_33 AC 2,465 ms
209,696 KB
testcase_34 WA -
権限があれば一括ダウンロードができます

ソースコード

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];

    int[] dpL = new int[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;
      }
    }

    int[] dpR = new int[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