結果
問題 | No.1085 桁和の桁和 |
ユーザー | EmKjp |
提出日時 | 2020-07-12 03:45:12 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 184 ms / 2,000 ms |
コード長 | 9,167 bytes |
コンパイル時間 | 3,027 ms |
コンパイル使用メモリ | 112,896 KB |
実行使用メモリ | 22,824 KB |
最終ジャッジ日時 | 2024-11-06 17:45:50 |
合計ジャッジ時間 | 7,161 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
18,304 KB |
testcase_01 | AC | 23 ms
18,176 KB |
testcase_02 | AC | 23 ms
18,304 KB |
testcase_03 | AC | 24 ms
18,432 KB |
testcase_04 | AC | 27 ms
18,500 KB |
testcase_05 | AC | 24 ms
18,176 KB |
testcase_06 | AC | 24 ms
18,304 KB |
testcase_07 | AC | 24 ms
18,560 KB |
testcase_08 | AC | 24 ms
18,304 KB |
testcase_09 | AC | 25 ms
18,560 KB |
testcase_10 | AC | 23 ms
18,176 KB |
testcase_11 | AC | 24 ms
18,688 KB |
testcase_12 | AC | 24 ms
18,560 KB |
testcase_13 | AC | 36 ms
19,840 KB |
testcase_14 | AC | 63 ms
22,224 KB |
testcase_15 | AC | 112 ms
22,564 KB |
testcase_16 | AC | 112 ms
22,680 KB |
testcase_17 | AC | 67 ms
22,524 KB |
testcase_18 | AC | 46 ms
20,608 KB |
testcase_19 | AC | 103 ms
22,452 KB |
testcase_20 | AC | 26 ms
18,372 KB |
testcase_21 | AC | 75 ms
22,560 KB |
testcase_22 | AC | 96 ms
22,560 KB |
testcase_23 | AC | 32 ms
18,816 KB |
testcase_24 | AC | 25 ms
18,560 KB |
testcase_25 | AC | 70 ms
22,696 KB |
testcase_26 | AC | 118 ms
22,824 KB |
testcase_27 | AC | 98 ms
22,572 KB |
testcase_28 | AC | 128 ms
22,432 KB |
testcase_29 | AC | 79 ms
22,564 KB |
testcase_30 | AC | 75 ms
22,684 KB |
testcase_31 | AC | 113 ms
22,692 KB |
testcase_32 | AC | 87 ms
22,428 KB |
testcase_33 | AC | 183 ms
22,656 KB |
testcase_34 | AC | 184 ms
22,640 KB |
testcase_35 | AC | 184 ms
22,700 KB |
testcase_36 | AC | 184 ms
22,700 KB |
testcase_37 | AC | 184 ms
22,564 KB |
testcase_38 | AC | 184 ms
22,560 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; using System.Collections.Generic; using System.Diagnostics; using System.Globalization; using System.IO; using System.Text; using System.Linq; using E = System.Linq.Enumerable; internal partial class Solver { public void Run() { var t = ns(); var d = ni(); if (d == 0) { cout.WriteLine(t.All(c => c == '0' || c == '?') ? 1 : 0); return; } var mod = ModInt.SetModValue(1000000007); var dp = new ModInt[9]; dp[0] = 1; foreach (var c in t) { var next = new ModInt[9]; for (int j = 0; j < 9; j++) { for (int i = 0; i < 10; i++) { if (c == '?' || (char)(i + '0') == c) { next[(j * 10 + i) % 9] += dp[j]; } } } dp = next; } var ans = dp[d % 9]; if (d == 9 && t.All(c => c == '0' || c == '?')) { ans--; } cout.WriteLine(ans); } } public struct ModInt : IEquatable<ModInt> { private static int mod = 0; private long _value; public ModInt(long x) { _value = x; Normalize(); } private static long RegularMod(long x, int mod) { if (x >= mod) { if (x < 2 * mod) { return x - mod; } return x % mod; } if (x >= 0) { return x; } x = mod - RegularMod(-x, mod); if (x == mod) { return 0; } return x; } public static int SetModValue(int m) { return mod = m; } private void Normalize() { _value = RegularMod(_value, mod); } public override string ToString() { return _value.ToString(CultureInfo.InvariantCulture); } public int ToInt() { return (int)_value; } public static bool operator ==(ModInt c1, ModInt c2) { return c1._value == c2._value; } public static bool operator !=(ModInt c1, ModInt c2) { return !(c1 == c2); } public static ModInt operator +(ModInt x, ModInt y) { return new ModInt(x._value + y._value); } public static ModInt operator -(ModInt x, ModInt y) { return new ModInt(x._value - y._value); } public static ModInt operator -(ModInt x) { return new ModInt(-x._value); } public static ModInt operator *(ModInt x, ModInt y) { return new ModInt(x._value * y._value); } public static ModInt operator /(ModInt x, ModInt y) { return new ModInt(x._value * Inverse(y._value, mod)); } public static ModInt operator ++(ModInt x) { return x + 1; } public static ModInt operator --(ModInt x) { return x - 1; } public static ModInt Pow(ModInt x, long n) { ModInt r = 1; while (n > 0) { if ((n & 1) != 0) { r *= x; } x *= x; n >>= 1; } return r; } private static long ExtendedGcd(long a, long b, ref long x, ref long y) { if (b == 0) { x = 1; y = 0; return a; } else { var d = ExtendedGcd(b, a % b, ref y, ref x); y -= a / b * x; return d; } } private static long Inverse(long a, long mod) { long x = 0, y = 0; if (ExtendedGcd(a, mod, ref x, ref y) == 1) { return (x + mod) % mod; } else { throw new Exception("Invalid inverse " + a + " " + mod); } } public static implicit operator ModInt(long x) { return new ModInt(x); } public override bool Equals(object obj) { if (obj == null) { return false; } return _value.Equals(((ModInt)obj)._value); } public override int GetHashCode() { return _value.GetHashCode(); } public bool Equals(ModInt other) { return _value.Equals(other._value); } } // PREWRITEN CODE BEGINS FROM HERE static public class StringExtensions { static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") { return string.Join(separator, source); } } internal partial class Solver : Scanner { public static void Main() { #if LOCAL byte[] inputBuffer = new byte[1000000]; var inputStream = Console.OpenStandardInput(inputBuffer.Length); using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) { Console.SetIn(reader); new Solver(Console.In, Console.Out).Run(); } #else Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver(Console.In, Console.Out).Run(); Console.Out.Flush(); #endif } #pragma warning disable IDE0052 private readonly TextReader cin; private readonly TextWriter cout; private readonly TextWriter cerr; #pragma warning restore IDE0052 public Solver(TextReader reader, TextWriter writer) : base(reader) { cin = reader; cout = writer; cerr = Console.Error; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } #pragma warning disable IDE1006 #pragma warning disable IDE0051 private int ni() { return NextInt(); } private int[] ni(int n) { return NextIntArray(n); } private long nl() { return NextLong(); } private long[] nl(int n) { return NextLongArray(n); } private double nd() { return NextDouble(); } private double[] nd(int n) { return NextDoubleArray(n); } private string ns() { return Next(); } private string[] ns(int n) { return NextArray(n); } #pragma warning restore IDE1006 #pragma warning restore IDE0051 } internal static class LinqPadExtension { [Conditional("DEBUG")] public static void TextDump<T>(this T obj) { #if DEBUG if (obj is IEnumerable) (obj as IEnumerable).Cast<object>().JoinToString().Dump(); else obj.ToString().Dump(); #endif } [Conditional("DEBUG")] public static void Dump<T>(this T obj) { #if DEBUG LINQPad.Extensions.Dump(obj); #endif } } public class Scanner { private readonly TextReader Reader; private readonly CultureInfo ci = CultureInfo.InvariantCulture; private readonly char[] buffer = new char[2 * 1024]; private int cursor = 0, length = 0; private string Token; private readonly StringBuilder sb = new StringBuilder(1024); public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { Reader = reader; } public int NextInt() { return checked((int)NextLong()); } public long NextLong() { var s = Next(); long r = 0; int i = 0; bool negative = false; if (s[i] == '-') { negative = true; i++; } for (; i < s.Length; i++) { r = r * 10 + (s[i] - '0'); #if DEBUG if (!char.IsDigit(s[i])) throw new FormatException(); #endif } return negative ? -r : r; } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { string[] array = new string[size]; for (int i = 0; i < size; i++) { array[i] = Next(); } return array; } public int[] NextIntArray(int size) { int[] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = NextInt(); } return array; } public long[] NextLongArray(int size) { long[] array = new long[size]; for (int i = 0; i < size; i++) { array[i] = NextLong(); } return array; } public double[] NextDoubleArray(int size) { double[] array = new double[size]; for (int i = 0; i < size; i++) { array[i] = NextDouble(); } return array; } public string Next() { if (Token == null) { if (!StockToken()) { throw new Exception(); } } var token = Token; Token = null; return token; } public bool HasNext() { if (Token != null) { return true; } return StockToken(); } private bool StockToken() { while (true) { sb.Clear(); while (true) { if (cursor >= length) { cursor = 0; if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) { break; } } var c = buffer[cursor++]; if (33 <= c && c <= 126) { sb.Append(c); } else { if (sb.Length > 0) break; } } if (sb.Length > 0) { Token = sb.ToString(); return true; } return false; } } }