結果

問題 No.375 立方体のN等分 (1)
ユーザー eitaho
提出日時 2016-06-04 23:34:36
言語 C#
(csc 2.8.2.62916)
結果
AC  
実行時間 322 ms
コード長 3,964 Byte
コンパイル時間 853 ms
使用メモリ 30,872 KB
最終ジャッジ日時 2019-04-22 19:59:13

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
sample1.txt AC 37 ms
9,712 KB
sample2.txt AC 39 ms
9,696 KB
system_test1.txt AC 41 ms
10,712 KB
t01.txt AC 38 ms
9,692 KB
t02.txt AC 38 ms
9,712 KB
t03.txt AC 38 ms
9,712 KB
t04.txt AC 38 ms
9,712 KB
t05.txt AC 39 ms
9,780 KB
t06.txt AC 59 ms
13,820 KB
t07.txt AC 38 ms
9,712 KB
t08.txt AC 38 ms
9,720 KB
t09.txt AC 38 ms
9,724 KB
t10.txt AC 39 ms
9,728 KB
t11.txt AC 38 ms
9,724 KB
t12.txt AC 98 ms
17,444 KB
t13.txt AC 38 ms
9,768 KB
t14.txt AC 38 ms
9,724 KB
t15.txt AC 174 ms
23,148 KB
t16.txt AC 101 ms
17,228 KB
t17.txt AC 38 ms
9,724 KB
t18.txt AC 38 ms
9,716 KB
t19.txt AC 40 ms
9,720 KB
t20.txt AC 322 ms
30,872 KB
t21.txt AC 38 ms
9,708 KB
t22.txt AC 38 ms
9,712 KB
t23.txt AC 41 ms
10,472 KB
t24.txt AC 40 ms
9,716 KB
t25.txt AC 39 ms
9,728 KB
t26.txt AC 41 ms
9,712 KB
t27.txt AC 41 ms
9,712 KB
t28.txt AC 40 ms
9,712 KB
t29.txt AC 42 ms
9,720 KB
t30.txt AC 43 ms
9,700 KB
t31.txt AC 39 ms
9,720 KB
テストケース一括ダウンロード
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 2.8.2.62916 (2ad4aabc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

public class Program
{
    long ans;
    long[] primes;
    int[] num;
    long[] mult = { 1, 1, 1 };

    public void Solve()
    {
        long N = Reader.Long();
        ans = N - 1;
        var factors = Factorization(N);
        primes = factors.Keys.ToArray();
        num = factors.Values.ToArray();
        Rec(0, 0);
        Console.WriteLine(ans + " " + (N - 1));
        Console.ReadLine();
    }

    void Rec(int who, long sum)
    {
        if (who == 2)
        {
            long mult = 1;
            for (int i = 0; i < primes.Length; i++)
                for (int c = 0; c < num[i]; c++)
                    mult *= primes[i];
            sum += mult - 1;
            if (sum < ans) ans = sum;
            return;
        }
        var cand = new List<int[]>();
        Select(0, new int[primes.Length], cand);
        foreach (var c in cand)
        {
            long mult = 1;
            for (int i = 0; i < primes.Length; i++)
            {
                num[i] -= c[i];
                for (int t = 0; t < c[i]; t++) mult *= primes[i];
            }
            Rec(who + 1, sum + mult - 1);
            for (int i = 0; i < primes.Length; i++)
                num[i] += c[i];
        }
    }

    void Select(int i, int[] curr, List<int[]> cand)
    {
        if (i == primes.Length)
        {
            int[] copy = new int[curr.Length];
            Array.Copy(curr, copy, curr.Length);
            cand.Add(copy);
            return;
        }
        for (int c = 0; c <= num[i]; c++)
        {
            curr[i] = c;
            Select(i + 1, curr, cand);
        }
    }


    static Dictionary<long, int> Factorization(long n)
    {
        var dic = new Dictionary<long, int>();
        for (long i = 2; i * i <= n; i++)
            while (n % i == 0)
            {
                n /= i;
                if (!dic.ContainsKey(i)) dic[i] = 1;
                else dic[i]++;
            }
        if (n > 1) dic[n] = 1;
        return dic;
    }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static T[] Range<T>(int N, Func<T> f) { return Enu.Range(0, N).Select(i => f()).ToArray(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}
0