結果
| 問題 | No.213 素数サイコロと合成数サイコロ (3-Easy) |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-05-24 20:39:25 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 65 ms / 3,000 ms |
| コード長 | 6,497 bytes |
| コンパイル時間 | 1,114 ms |
| コンパイル使用メモリ | 123,664 KB |
| 実行使用メモリ | 25,688 KB |
| 最終ジャッジ日時 | 2024-07-06 08:06:08 |
| 合計ジャッジ時間 | 1,726 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 45 ms
25,688 KB |
| testcase_01 | AC | 65 ms
23,656 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.Linq;
using Debug = System.Diagnostics.Debug;
using Watch = System.Diagnostics.Stopwatch;
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 };
var max = 13 * p + 12 * c;
var A = Enumerate(p + 1, x => new ulong[max + 1]);
var B = Enumerate(c + 1, x => new ulong[max + 1]);
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 < p * 13; 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 < c * 12; j++)
if (B[i][j] > 0) B[i + 1][j + b[k]] += B[i][j];
const ulong mod = (ulong)1e9 + 7;
var C = new ulong[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[max - i - j] = ((C[max - i - j] + A[p][i] * B[c][j]) % mod);
var V = Enumerate(max, x => 1ul);
var res = Polynomial.Get(n + max - 1, V, C);
IO.Printer.Out.WriteLine(res);
}
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 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); 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 Polynomial
public static class Polynomial
{
static public ulong Get(long n, ulong[] A, ulong[] C)
{
var k = C.Length;
temp = new ulong[k << 1];
zero = new ulong[k << 1];
ulong[] p = new ulong[k], ret = new ulong[k];
p[1] = ret[0] = 1;
for (; n > 0; n >>= 1)
{
if ((n & 1) == 1) multiply(ret, p, C);
multiply(p, p, C);
}
return substitute(ret, A);
}
static ulong[] temp, zero;
static void multiply(ulong[] l, ulong[] r, ulong[] bas)
{
const ulong mod = (ulong)1e9 + 7;
var k = l.Length;
Buffer.BlockCopy(zero, 0, temp, 0, sizeof(ulong) * temp.Length);
for (int i = 0; i < k; i++)
for (int j = 0; j < k; j++)
temp[i + j] = (temp[i + j] + l[i] * r[j]) % mod;
for (int i = (k << 1) - 1; i >= k; i--)
for (int j = 1; j <= k; j++)
temp[i - j] = (temp[i - j] + temp[i] * bas[k - j]) % mod;
Buffer.BlockCopy(temp, 0, l, 0, sizeof(ulong) * k);
}
static ulong substitute(ulong[] val, ulong[] init)
{
const ulong mod = (ulong)1e9 + 7;
ulong ret = 0;
for (int i = 0; i < val.Length; i++)
ret = ((ret + 1ul * init[i] * val[i]) % mod);
return ret;
}
}
#endregion