結果

問題 No.213 素数サイコロと合成数サイコロ (3-Easy)
コンテスト
ユーザー 紙ぺーぱー
提出日時 2015-06-10 16:31:23
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 509 ms / 3,000 ms
コード長 11,960 bytes
コンパイル時間 901 ms
コンパイル使用メモリ 114,688 KB
実行使用メモリ 29,056 KB
最終ジャッジ日時 2024-07-06 15:22:30
合計ジャッジ時間 2,750 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 = 126;
            var A = Enumerate(p + 1, x => new int[max]);
            var B = Enumerate(c + 1, x => new int[max]);
            A[0][0] = B[0][0] = 1;
            for (int k = 0; k < 6; k++)
                for (int i = 0; i < p; i++)
                    for (int j = 0; j < 70; j++)
                        if (A[i][j] > 0) A[i + 1][j + a[k]] += A[i][j];
            for (int k = 0; k < 6; k++)
                for (int i = 0; i < c; i++)
                    for (int j = 0; j < 70; j++)
                        if (B[i][j] > 0) B[i + 1][j + b[k]] += B[i][j];
            var C = new int[max];
            for (int i = 0; i < max; i++)
                for (int j = 0; j < max; j++)
                    if (A[p][i] > 0 && B[c][j] > 0) C[i + j] += A[p][i] * B[c][j];

            var mat = new FastModMatrix(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] = C[i + 1];
            var ret = FastModMatrix.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 main
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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, 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 string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') 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); }
    }
}
#endregion
#region FastModMatrix
public struct FastModMatrix
{
    int row, col;
    const ulong mod = ModInteger.Mod;
    public ulong[] mat;
    const int sz = 18;
    public ModInteger this[int r, int c]
    {
        get { return new ModInteger((long)mat[r * col + c]); }
        set { mat[r * col + c] = (ulong)value.num; }
    }
    public FastModMatrix(int r, int c)
    {
        if (r % sz > 0) r += sz - r % sz;
        if (c % sz > 0) c += sz - c % sz;
        row = r; col = c;
        mat = new ulong[row * col];
    }
    public static FastModMatrix operator +(FastModMatrix l, FastModMatrix r)
    {
        check(l, r);
        var ret = new FastModMatrix(l.row, l.col);
        for (int i = 0; i < l.row; i++)
            for (int j = 0; j < l.col; j++)
            {
                ret.mat[i * ret.col + j] = l.mat[i * l.col + j] + r.mat[i * r.col + j];
                if (ret.mat[i * ret.col + j] >= mod) ret.mat[i * ret.col + j] -= mod;
            }
        return ret;

    }
    public static FastModMatrix operator *(FastModMatrix l, FastModMatrix r)
    {
        checkMul(l, r);
        var ret = new FastModMatrix(l.row, l.col);
        for (int i = 0; i < l.row; i++)
            for (int k = 0; k < l.col; k += sz)
                for (int j = 0; j < l.col; j++)
                    ret.mat[i * l.col + j] = (ret.mat[i * l.col + j] +
                        l.mat[i * l.col + k] * r.mat[k * l.col + j] +
                        l.mat[i * l.col + k + 1] * r.mat[(k + 1) * l.col + j] +
                        l.mat[i * l.col + k + 2] * r.mat[(k + 2) * l.col + j] +
                        l.mat[i * l.col + k + 3] * r.mat[(k + 3) * l.col + j] +
                        l.mat[i * l.col + k + 4] * r.mat[(k + 4) * l.col + j] +
                        l.mat[i * l.col + k + 5] * r.mat[(k + 5) * l.col + j] +
                        l.mat[i * l.col + k + 6] * r.mat[(k + 6) * l.col + j] +
                        l.mat[i * l.col + k + 7] * r.mat[(k + 7) * l.col + j] +
                        l.mat[i * l.col + k + 8] * r.mat[(k + 8) * l.col + j] +
                        l.mat[i * l.col + k + 9] * r.mat[(k + 9) * l.col + j] +
                        l.mat[i * l.col + k + 10] * r.mat[(k + 10) * l.col + j] +
                        l.mat[i * l.col + k + 11] * r.mat[(k + 11) * l.col + j] +
                        l.mat[i * l.col + k + 12] * r.mat[(k + 12) * l.col + j] +
                        l.mat[i * l.col + k + 13] * r.mat[(k + 13) * l.col + j] +
                        l.mat[i * l.col + k + 14] * r.mat[(k + 14) * l.col + j] +
                        l.mat[i * l.col + k + 15] * r.mat[(k + 15) * l.col + j] +
                        l.mat[i * l.col + k + 16] * r.mat[(k + 16) * l.col + j] +
                        l.mat[i * l.col + k + 17] * r.mat[(k + 17) * l.col + j]) % mod;
        return ret;
    }
    public void MulSelf()
    {
        if (row != col) throw new Exception();
        var ret = new ulong[mat.Length];
        for (int i = 0; i < row; i++)
            for (int k = 0; k < col; k += sz)
                for (int j = 0; j < col; j++)
                    ret[i * col + j] = (ret[i * col + j] +
                        mat[i * col + k] * mat[k * col + j] +
                        mat[i * col + k + 1] * mat[(k + 1) * col + j] +
                        mat[i * col + k + 2] * mat[(k + 2) * col + j] +
                        mat[i * col + k + 3] * mat[(k + 3) * col + j] +
                        mat[i * col + k + 4] * mat[(k + 4) * col + j] +
                        mat[i * col + k + 5] * mat[(k + 5) * col + j] +
                        mat[i * col + k + 6] * mat[(k + 6) * col + j] +
                        mat[i * col + k + 7] * mat[(k + 7) * col + j] +
                        mat[i * col + k + 8] * mat[(k + 8) * col + j] +
                        mat[i * col + k + 9] * mat[(k + 9) * col + j] +
                        mat[i * col + k + 10] * mat[(k + 10) * col + j] +
                        mat[i * col + k + 11] * mat[(k + 11) * col + j] +
                        mat[i * col + k + 12] * mat[(k + 12) * col + j] +
                        mat[i * col + k + 13] * mat[(k + 13) * col + j] +
                        mat[i * col + k + 14] * mat[(k + 14) * col + j] +
                        mat[i * col + k + 15] * mat[(k + 15) * col + j] +
                        mat[i * col + k + 16] * mat[(k + 16) * col + j] +
                        mat[i * col + k + 17] * mat[(k + 17) * col + j]) % mod;
        Buffer.BlockCopy(ret, 0, mat, 0, sizeof(ulong) * mat.Length);
    }
    public static FastModMatrix Pow(FastModMatrix m, long n)
    {
        var ret = new FastModMatrix(m.row, m.col);
        for (int i = 0; i < m.row; i++)
            ret.mat[i * m.col + i] = 1;
        for (; n > 0; m.MulSelf(), n >>= 1)
            if ((n & 1) == 1)
                ret = ret * m;
        return ret;

    }
    public static FastModMatrix Trans(FastModMatrix m)
    {
        var ret = new FastModMatrix(m.col, m.row);
        for (int i = 0; i < m.row; i++)
            for (int j = 0; j < m.col; j++)
                ret.mat[j * m.col + i] = m.mat[i * m.col + j];
        return ret;
    }
    [System.Diagnostics.Conditional("DEBUG")]
    static private void check(FastModMatrix a, FastModMatrix 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(FastModMatrix a, FastModMatrix b)
    {
        if (a.col != b.row)
            throw new Exception("row and col have to be same.");

    }
}
#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
0