結果
| 問題 | No.315 世界のなんとか3.5 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-12-08 01:48:24 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 9,083 bytes |
| コンパイル時間 | 1,339 ms |
| コンパイル使用メモリ | 117,348 KB |
| 実行使用メモリ | 36,040 KB |
| 最終ジャッジ日時 | 2024-09-14 19:01:13 |
| 合計ジャッジ時間 | 9,237 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 29 ms
25,000 KB |
| testcase_01 | AC | 29 ms
24,616 KB |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Diagnostics;
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 b = dec(sc.Scan().ToCharArray());
var a = sc.Scan();
var p = sc.Integer();
//f(Enumerable.Repeat('a', 100000).AsString());
var A = f(a);
var B = f(b.ToString());
IO.Printer.Out.WriteLine(g(A, p) - g(B, p));
}
static public string dec(char[] a)
{
for (int i = a.Length - 1; i >= 0; i--)
{
if (a[i] == '0')
{
a[i] = '9'; continue;
}
a[i]--; break;
}
return a.AsString();
}
static public ModInteger g(ModInteger[,,,] a, int p)
{
ModInteger sum = 0;
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
{
for (int k = 0; k < 3; k++)
{
if (j == 1 || k == 0)
{
for (int l = 0; l < 800; l++)
{
if (l % p == 0)
continue;
//Debug.WriteLine("{0} {1} {2} {3} {4}", i, j, k, l, a[i, j, k, l]);
sum += a[i, j, k, l];
}
}
}
}
return sum;
}
static public ModInteger[,,,] f(string s)
{
const int koyumeishi = 3;
var dp = new ModInteger[2, 2, koyumeishi];
dp[0, 0, 0] = 1;
for (int i = 0; i < s.Length - 5; i++)
{
var next = new ModInteger[2, 2, koyumeishi];
var v = s[i] - '0';
for (int j = 0; j < 10; j++)
{
for (int k = 0; k < koyumeishi; k++)
{
var to = (j + k * 10) % koyumeishi;
var go = j == 3 ? 1 : 0;
next[1, go, to] += dp[1, 0, k];
next[1, 1, to] += dp[1, 1, k];
if (j <= v)
{
var otaku = j == v ? 0 : 1;
next[otaku, go, to] += dp[0, 0, k];
next[otaku, 1, to] += dp[0, 1, k];
}
}
}
dp = next;
}
//return dp;
//otaku special
int size = 1;
var unko = new ModInteger[2, 2, 3, 800];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 3; k++)
unko[i, j, k, 0] = dp[i, j, k];
for (int i = Math.Max(0, s.Length - 5); i < s.Length; i++)
{
var next = new ModInteger[2, 2, 3, 800];
var v = s[i] - '0';
for (int j = 0; j < 10; j++)
{
for (int k = 0; k < koyumeishi; k++)
for (int l = 0; l < size; l++)
{
var to = (j + k * 10) % koyumeishi;
var gogo = (l * 10 + j) % 800;
var go = j == 3 ? 1 : 0;
next[1, go, to, gogo] += unko[1, 0, k, l];
next[1, 1, to, gogo] += unko[1, 1, k, l];
if (j <= v)
{
var otaku = j == v ? 0 : 1;
next[otaku, go, to, gogo] += unko[0, 0, k, l];
next[otaku, 1, to, gogo] += unko[0, 1, k, l];
}
}
}
unko = next;
size *= 10;
}
return unko;
}
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 != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
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() { var s = Scan(); return s != "" ? double.Parse(Scan(), CultureInfo.InvariantCulture) : double.NaN; }
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 ModNumber
public partial struct ModInteger
{
public const long Mod = (long)1e9 + 7;
public long num;
public ModInteger(long n) : this() { num = n % Mod; if (num < 0) num += 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() { num = n }; }
public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num + Mod - r.num; if (n >= Mod) n -= Mod; return new ModInteger() { num = n }; }
public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger(l.num * r.num); }
public static implicit operator ModInteger(long n) { return new ModInteger(n); }
}
#endregion