結果

問題 No.1791 Repeat Multiplication
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-12-22 04:59:19
言語 Java
(openjdk 23)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,454 bytes
コンパイル時間 2,721 ms
コンパイル使用メモリ 83,964 KB
実行使用メモリ 255,360 KB
最終ジャッジ日時 2024-09-15 19:06:06
合計ジャッジ時間 44,286 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21 TLE * 11
権限があれば一括ダウンロードができます

ソースコード

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