結果

問題 No.213 素数サイコロと合成数サイコロ (3-Easy)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-05-23 03:26:18
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 2,745 ms / 3,000 ms
コード長 7,849 bytes
コンパイル時間 2,726 ms
コンパイル使用メモリ 108,660 KB
実行使用メモリ 32,380 KB
最終ジャッジ日時 2023-09-20 10:29:58
合計ジャッジ時間 11,043 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,745 ms
32,380 KB
testcase_01 AC 2,518 ms
31,300 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Long();
            var p = sc.Integer();
            var c = sc.Integer();
            var a = new int[] { 2, 3, 5, 7, 11, 13 };
            var b = new int[] { 4, 6, 8, 9, 10, 12 };
            const int max = 128;
            var table = Enumerate(p + c + 1, x => new ModInteger[max]);
            table[0][0] = 1;
            for (int i = 0; i < 6; i++)
                for (int j = p - 1; j >= 0; j--)
                    for (int k = 1; k <= p; k++)
                        if (j + k <= p) for (int l = 0; l < max; l++)
                                if (table[j][l].num > 0) table[j + k][l + a[i] * k] += table[j][l];
            for (int i = 0; i < 6; i++)
                for (int j = p + c - 1; j >= p; j--)
                    for (int k = 1; k <= c; k++)
                        if (j + k <= p + c) for (int l = 0; l < max; l++)
                                if (table[j][l].num > 0) table[j + k][l + b[i] * k] += table[j][l];
            var mat = new Matrix(max, max);
            for (int i = 1; i < max; i++)
                mat[i, i - 1] = 1;
            for (int i = 0; i < max - 1; i++)
                mat[0, i] = table[p + c][i + 1].num;
            var ret = Matrix.Pow(mat, n);
            ModInteger ans = 0;
            for (int i = 0; i < max; i++)
                ans += ret[0, i];
            IO.Printer.Out.WriteLine(ans);

        }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}

static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region ModNumber
public partial struct ModInteger
{
    public const long Mod = (long)1e9 + 7;
    public long num;
    public ModInteger(long n) : this() { num = n % Mod; }
    public override string ToString() { return num.ToString(); }
    public static ModInteger operator +(ModInteger l, ModInteger r) { var n = l.num + r.num; if (n >= Mod)n -= Mod; return new ModInteger(n); }
    public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num - r.num; if (n < 0)n += Mod; return new ModInteger(n); }
    public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger((l.num * r.num) % Mod); }
    public static implicit operator ModInteger(long n) { return new ModInteger(n); }
}
#endregion

#region Matrix
public class Matrix
{
    int row, col;
    long[,] mat;

    public long this[int r, int c]
    {
        get { return mat[r, c]; }
        set { mat[r, c] = value; }
    }
    public Matrix(int r, int c)
    {
        row = max; col = max;
        mat = new long[max, max];
    }
    public static Matrix operator +(Matrix l, Matrix r)
    {
        check(l, r);
        var ret = new Matrix(l.row, l.col);
        for (int i = 0; i < l.row; i++)
            for (int j = 0; j < l.col; j++)
                ret.mat[i, j] = (l.mat[i, j] + r.mat[i, j]);
        return ret;

    }
    const long mod = (long)1e9 + 7;
    const int max = 128;
    public static Matrix operator *(Matrix l, Matrix r)
    {
        var ret = new Matrix(max, max);
        for (int i = 0; i < max; i++)
            for (int k = 0; k < max / 2; k++)
                for (int j = 0; j < max; j++)
                    ret.mat[i, j] = (ret.mat[i, j] + (l.mat[i, k] * r.mat[k, j]) + (l.mat[i, max - k - 1]) * r.mat[max - k - 1, j]) % mod;
        return ret;
    }
    public static Matrix Pow(Matrix m, long n)
    {
        var ret = new Matrix(m.row, m.col);
        for (int i = 0; i < m.row; i++)
            ret.mat[i, i] = 1;
        for (; n > 0; m *= m, n >>= 1)
        {
            if ((n & 1) == 1)
                ret = ret * m;
        }
        return ret;

    }

    [System.Diagnostics.Conditional("DEBUG")]
    static private void check(Matrix a, Matrix b)
    {
        if (a.row != b.row || a.col != b.col)
            throw new Exception("row and col have to be same.");

    }
    [System.Diagnostics.Conditional("DEBUG")]
    static private void checkMul(Matrix a, Matrix b)
    {
        if (a.col != b.row)
            throw new Exception("row and col have to be same.");

    }
}
#endregion
0