結果

問題 No.537 ユーザーID
ユーザー kenkooookenkoooo
提出日時 2017-06-30 22:34:16
言語 Java21
(openjdk 21)
結果
AC  
実行時間 176 ms / 2,000 ms
コード長 4,627 bytes
コンパイル時間 3,258 ms
コンパイル使用メモリ 81,244 KB
実行使用メモリ 53,976 KB
最終ジャッジ日時 2024-04-15 06:28:02
合計ジャッジ時間 7,509 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 95 ms
52,780 KB
testcase_01 AC 89 ms
52,936 KB
testcase_02 AC 85 ms
51,040 KB
testcase_03 AC 89 ms
51,312 KB
testcase_04 AC 105 ms
52,512 KB
testcase_05 AC 84 ms
52,932 KB
testcase_06 AC 81 ms
51,188 KB
testcase_07 AC 84 ms
52,892 KB
testcase_08 AC 80 ms
51,008 KB
testcase_09 AC 96 ms
52,472 KB
testcase_10 AC 94 ms
52,612 KB
testcase_11 AC 94 ms
52,168 KB
testcase_12 AC 96 ms
52,804 KB
testcase_13 AC 96 ms
52,828 KB
testcase_14 AC 81 ms
51,160 KB
testcase_15 AC 83 ms
51,256 KB
testcase_16 AC 82 ms
51,332 KB
testcase_17 AC 84 ms
51,440 KB
testcase_18 AC 115 ms
53,236 KB
testcase_19 AC 112 ms
52,932 KB
testcase_20 AC 110 ms
53,060 KB
testcase_21 AC 108 ms
53,256 KB
testcase_22 AC 115 ms
53,216 KB
testcase_23 AC 121 ms
53,316 KB
testcase_24 AC 97 ms
52,796 KB
testcase_25 AC 122 ms
53,036 KB
testcase_26 AC 120 ms
52,860 KB
testcase_27 AC 115 ms
53,288 KB
testcase_28 AC 162 ms
53,644 KB
testcase_29 AC 168 ms
53,976 KB
testcase_30 AC 176 ms
53,948 KB
testcase_31 AC 114 ms
53,136 KB
testcase_32 AC 108 ms
53,016 KB
testcase_33 AC 164 ms
53,684 KB
testcase_34 AC 120 ms
53,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.NoSuchElementException;
import java.util.TreeSet;

public class Main {

  private void solve(FastScanner in, PrintWriter out) {
    long N = in.nextLong();
    ArrayList<Long> list = new ArrayList<>();
    for (long i = 1; i * i <= N; i++) {
      if (N % i == 0) {
        list.add(i);
      }
    }
    
    TreeSet<String> set = new TreeSet<>();
    for (long i : list) {
      long j = N / i;
      set.add(i + "" + j);
      set.add(j + "" + i);
    }

    out.println(set.size());
  }

  public static int[] getPrimes(int N) {
    ArrayList<Integer> primes = new ArrayList<>();
    boolean[] isComposite = new boolean[N + 1];
    primes.add(2);
    for (int i = 3; i <= N; i += 2) {
      if (!isComposite[i]) {
        primes.add(i);
        for (int j = i * 2; j <= N; j += i) {
          isComposite[j] = true;
        }
      }
    }
    int[] array = new int[primes.size()];
    for (int i = 0; i < primes.size(); i++) {
      array[i] = primes.get(i);
    }
    return array;
  }

  public static void main(String[] args) {
    PrintWriter out = new PrintWriter(System.out);
    new Main().solve(new FastScanner(), out);
    out.close();
  }

  private static class FastScanner {

    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int bufferLength = 0;

    private boolean hasNextByte() {
      if (ptr < bufferLength) {
        return true;
      } else {
        ptr = 0;
        try {
          bufferLength = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (bufferLength <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) {
        return buffer[ptr++];
      } else {
        return -1;
      }
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
        ptr++;
      }
    }

    boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) {
        throw new NoSuchElementException();
      }
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    long nextLong() {
      if (!hasNext()) {
        throw new NoSuchElementException();
      }
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    double nextDouble() {
      return Double.parseDouble(next());
    }

    double[] nextDoubleArray(int n) {
      double[] array = new double[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextDouble();
      }
      return array;
    }

    double[][] nextDoubleMap(int n, int m) {
      double[][] map = new double[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextDoubleArray(m);
      }
      return map;
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int n) {
      int[] array = new int[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextInt();
      }
      return array;
    }

    public long[] nextLongArray(int n) {
      long[] array = new long[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextLong();
      }
      return array;
    }

    public String[] nextStringArray(int n) {
      String[] array = new String[n];
      for (int i = 0; i < n; i++) {
        array[i] = next();
      }
      return array;
    }

    public char[][] nextCharMap(int n) {
      char[][] array = new char[n][];
      for (int i = 0; i < n; i++) {
        array[i] = next().toCharArray();
      }
      return array;
    }

    public int[][] nextIntMap(int n, int m) {
      int[][] map = new int[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextIntArray(m);
      }
      return map;
    }
  }
}
0