結果

問題 No.375 立方体のN等分 (1)
ユーザー EmKjpEmKjp
提出日時 2016-06-04 23:49:01
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 263 ms / 5,000 ms
コード長 3,539 bytes
コンパイル時間 3,557 ms
コンパイル使用メモリ 108,240 KB
実行使用メモリ 31,188 KB
最終ジャッジ日時 2023-08-02 01:31:52
合計ジャッジ時間 7,299 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
22,816 KB
testcase_01 AC 58 ms
22,816 KB
testcase_02 AC 82 ms
20,816 KB
testcase_03 AC 57 ms
22,980 KB
testcase_04 AC 57 ms
20,804 KB
testcase_05 AC 58 ms
22,908 KB
testcase_06 AC 57 ms
22,840 KB
testcase_07 AC 59 ms
20,876 KB
testcase_08 AC 74 ms
20,868 KB
testcase_09 AC 59 ms
22,784 KB
testcase_10 AC 65 ms
20,764 KB
testcase_11 AC 65 ms
20,892 KB
testcase_12 AC 69 ms
20,764 KB
testcase_13 AC 67 ms
22,884 KB
testcase_14 AC 132 ms
23,620 KB
testcase_15 AC 73 ms
22,880 KB
testcase_16 AC 68 ms
22,836 KB
testcase_17 AC 190 ms
28,412 KB
testcase_18 AC 135 ms
21,440 KB
testcase_19 AC 68 ms
20,888 KB
testcase_20 AC 69 ms
20,760 KB
testcase_21 AC 68 ms
22,840 KB
testcase_22 AC 263 ms
31,188 KB
testcase_23 AC 71 ms
20,792 KB
testcase_24 AC 66 ms
20,888 KB
testcase_25 AC 86 ms
22,884 KB
testcase_26 AC 65 ms
20,848 KB
testcase_27 AC 71 ms
20,768 KB
testcase_28 AC 64 ms
20,784 KB
testcase_29 AC 66 ms
20,768 KB
testcase_30 AC 69 ms
20,756 KB
testcase_31 AC 69 ms
20,932 KB
testcase_32 AC 63 ms
20,800 KB
testcase_33 AC 69 ms
18,800 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;


partial class Solver {
    static public List<long> Divisors(long x) {
        List<long> ret = new List<long>();
        for (long i = 1; i * i <= x; i++) {
            if (x % i == 0) {
                ret.Add(i);
                if (i != x / i) ret.Add(x / i);
            }
        }
        ret.Sort();
        return ret;
    }

    public void Run() {
        var N = nl();
        var divisors = Divisors(N);
        long tmin = long.MaxValue, tmax = 0;

        foreach (var a in divisors) {
            if (tmin <= a) continue;
            var rem = N / a;
            foreach (var b in Divisors(rem)) {
                if (tmin <= a + b) break;
                var c = rem / b;
                tmin = Math.Min(tmin, a + b + c - 3);
            }
        }

        tmax = N - 1;

        cout.WriteLine(string.Format("{0} {1}", tmin, tmax));
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner {
    public static void Main(string[] args) {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

public class Scanner {
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0