#346407 (C#(csc)) No.287 場合の数

• 問題: No.287 場合の数
• ユーザー: EmKjp
• 提出日時: 2019-05-12 16:52:41
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 27 ms / 5,000 ms
• コード長: 3,362 bytes
• コンパイル時間: 3,295 ms
• コンパイル使用メモリ: 112,840 KB
• 実行使用メモリ: 18,304 KB
• 最終ジャッジ日時: 2024-07-04 18:15:13
• 合計ジャッジ時間: 3,943 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	25 ms; 18,264 KB
testcase_01	AC	24 ms; 18,008 KB
testcase_02	AC	24 ms; 18,020 KB
testcase_03	AC	26 ms; 18,012 KB
testcase_04	AC	26 ms; 18,008 KB
testcase_05	AC	26 ms; 17,888 KB
testcase_06	AC	24 ms; 18,176 KB
testcase_07	AC	25 ms; 18,304 KB
testcase_08	AC	25 ms; 18,176 KB
testcase_09	AC	25 ms; 18,140 KB
testcase_10	AC	26 ms; 18,268 KB
testcase_11	AC	24 ms; 17,764 KB
testcase_12	AC	26 ms; 18,136 KB
testcase_13	AC	24 ms; 18,136 KB
testcase_14	AC	25 ms; 18,264 KB
testcase_15	AC	26 ms; 18,012 KB
testcase_16	AC	25 ms; 17,752 KB
testcase_17	AC	25 ms; 18,176 KB
testcase_18	AC	25 ms; 17,892 KB
testcase_19	AC	26 ms; 17,752 KB
testcase_20	AC	25 ms; 18,016 KB
testcase_21	AC	26 ms; 18,008 KB
testcase_22	AC	27 ms; 17,888 KB
testcase_23	AC	26 ms; 18,008 KB
testcase_24	AC	26 ms; 18,016 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.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

partial class Solver
{
    long?[,] memo = new long?[1000, 10];

    long Solve(int remain, int depth, int n)
    {
        if (depth == 8)
        {
            return remain == 0 ? 1 : 0;
        }
        if (remain < 0) return 0;

        if (!memo[remain, depth].HasValue)
        {
            long val = 0;

            for (int i = 0; i <= n; i++)
            {
                val += Solve(remain - i, depth + 1, n);
            }

            memo[remain, depth] = val;
        }
        return memo[remain, depth].Value;
    }

    public void Run()
    {
        var n = ni();

        cout.WriteLine(Solve(6 * n, 0, n));
    }

}


// 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;
        }
    }
}