結果
問題 | No.537 ユーザーID |
ユーザー |
|
提出日時 | 2017-06-30 22:34:16 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 147 ms / 2,000 ms |
コード長 | 4,627 bytes |
コンパイル時間 | 2,150 ms |
コンパイル使用メモリ | 90,876 KB |
実行使用メモリ | 53,976 KB |
最終ジャッジ日時 | 2024-10-04 20:04:35 |
合計ジャッジ時間 | 6,123 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
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;}}}