結果
問題 | No.1176 少ない質問 |
ユーザー |
![]() |
提出日時 | 2020-08-21 21:51:59 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 54 ms / 1,000 ms |
コード長 | 2,865 bytes |
コンパイル時間 | 2,423 ms |
コンパイル使用メモリ | 78,476 KB |
実行使用メモリ | 37,248 KB |
最終ジャッジ日時 | 2024-10-15 05:33:32 |
合計ジャッジ時間 | 4,149 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
import java.util.*;import java.io.*;import java.lang.IllegalArgumentException;public class Main {public static void main(String[] args) throws Exception {FastScanner sc = new FastScanner(System.in);PrintWriter pw = new PrintWriter(System.out);long a = sc.nextLong();long imax = a;long min = Long.MAX_VALUE;for(long i = 2; i <= imax; i++){long tmp = 0;long now = a-1;while(now > 0){tmp += i;now /= i;}min = Math.min(min,tmp);imax = Math.min(imax,tmp);}pw.println(min);pw.flush();}static class GeekInteger {public static void save_sort(int[] array) {shuffle(array);Arrays.sort(array);}public static int[] shuffle(int[] array) {int n = array.length;Random random = new Random();for (int i = 0, j; i < n; i++) {j = i + random.nextInt(n - i);int randomElement = array[j];array[j] = array[i];array[i] = randomElement;}return array;}}}class FastScanner {private BufferedReader reader = null;private StringTokenizer tokenizer = null;public FastScanner(InputStream in) {reader = new BufferedReader(new InputStreamReader(in));tokenizer = null;}public String next() {if (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new StringTokenizer(reader.readLine());} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}public String nextLine() {if (tokenizer == null || !tokenizer.hasMoreTokens()) {try {return reader.readLine();} catch (IOException e) {throw new RuntimeException(e);}}return tokenizer.nextToken("\n");}public long nextLong() {return Long.parseLong(next());}public int nextInt() {return Integer.parseInt(next());}public double nextDouble() {return Double.parseDouble(next());}public String[] nextArray(int n) {String[] a = new String[n];for (int i = 0; i < n; i++)a[i] = next();return a;}public int[] nextIntArray(int n) {int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = nextInt();return a;}public long[] nextLongArray(int n) {long[] a = new long[n];for (int i = 0; i < n; i++)a[i] = nextLong();return a;}}