#147082 (C#(csc)) No.376 立方体のN等分 (2)

• 問題: No.376 立方体のN等分 (2)
• ユーザー: mban
• 提出日時: 2017-01-31 10:44:06
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 2,615 bytes
• コンパイル時間: 941 ms
• コンパイル使用メモリ: 113,200 KB
• 実行使用メモリ: 26,184 KB
• 最終ジャッジ日時: 2024-06-06 08:32:58
• 合計ジャッジ時間: 25,743 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	23 ms; 17,920 KB
testcase_01	AC	23 ms; 17,664 KB
testcase_02	AC	106 ms; 18,048 KB
testcase_03	AC	110 ms; 17,920 KB
testcase_04	AC	123 ms; 17,920 KB
testcase_05	AC	22 ms; 18,048 KB
testcase_06	AC	22 ms; 18,048 KB
testcase_07	AC	23 ms; 17,920 KB
testcase_08	WA	-
testcase_09	AC	44 ms; 17,792 KB
testcase_10	AC	296 ms; 18,048 KB
testcase_11	WA	-
testcase_12	AC	81 ms; 17,920 KB
testcase_13	AC	84 ms; 17,792 KB
testcase_14	AC	91 ms; 17,792 KB
testcase_15	WA	-
testcase_16	AC	3,839 ms; 17,764 KB
testcase_17	RE	-
testcase_18	WA	-
testcase_19	RE	-
testcase_20	WA	-
testcase_21	AC	3,860 ms; 18,028 KB
testcase_22	AC	116 ms; 18,048 KB
testcase_23	AC	4,035 ms; 17,904 KB
testcase_24	AC	3,830 ms; 17,780 KB
testcase_25	AC	123 ms; 18,048 KB
testcase_26	AC	4,378 ms; 17,648 KB
testcase_27	WA	-
testcase_28	AC	125 ms; 18,048 KB
testcase_29	WA	-
testcase_30	AC	126 ms; 17,792 KB
testcase_31	AC	124 ms; 17,792 KB
testcase_32	AC	127 ms; 17,920 KB
testcase_33	AC	126 ms; 17,920 KB
testcase_34	AC	122 ms; 17,792 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	124 ms; 17,792 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{
    static void Main(string[] args)
    {
        Magatro alice = new Magatro();
        alice.Scan();
        alice.Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;
    private string[] S;
    private int Index;
    private const char Separator = ' ';
    public Scanner()
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(Console.OpenStandardInput());
    }
    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }
    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{
    private long N;
    private List<long> L;
    public void Scan()
    {
        Scanner sc = new Scanner();
        N = sc.NextLong();
    }

    public void Solve()
    {
        long Tmin = int.MaxValue;
        L = new List<long>();
        Calc();
        foreach (long i in L)
        {
            foreach (long j in L)
            {
                if (N % (i * j) == 0)
                {
                    long k = N / (i * j);
                    Tmin = Math.Min(Tmin, (i - 1) + (j - 1) + (k - 1));
                }
            }
        }
        long Tmax = N - 1;
        Console.WriteLine("{0} {1}", Tmin, Tmax);
    }

    private void Calc()
    {
        long loop = (long)Math.Sqrt(N);
        for (long i = 1; i <= loop; i++)
        {
            if (N % i == 0)
            {
                L.Add(i);
                if (i * i != N)
                {
                    L.Add(N / i);
                }
            }
        }
    }
}