結果
問題 | No.528 10^9と10^9+7と回文 |
ユーザー |
![]() |
提出日時 | 2017-06-09 23:38:11 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 139 ms / 1,000 ms |
コード長 | 3,769 bytes |
コンパイル時間 | 5,187 ms |
コンパイル使用メモリ | 116,492 KB |
実行使用メモリ | 31,776 KB |
最終ジャッジ日時 | 2024-07-23 18:29:30 |
合計ジャッジ時間 | 5,287 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.IO;using System.Linq;using System.Text;using System.Collections.Generic;using System.Diagnostics;using Enu = System.Linq.Enumerable;public class Program{static readonly int Mod1 = (int)1e9;static readonly int Mod2 = (int)1e9 + 7;static void Add(ref int a, int b, int mod) { if ((a += b) >= mod) a -= mod; }public void Solve(){var A = Reader.String().Select(c => c - '0').ToArray();Console.WriteLine(DP(A, Mod1) + "\n" + DP(A, Mod2));}long DP(int[] A, int mod){int len = (A.Length + 1) / 2;var dp = new int[len + 1, 2, 2, 2];for (int remLen = A.Length; remLen >= 1; remLen--){int b = remLen == A.Length ? 0 : 1;dp[len - (remLen + 1) / 2, 0, b, b]++;}for (int i = 0, val; i < len; i++)for (int used = 0; used < 2; used++)for (int less = 0; less < 2; less++)for (int Rless = 0; Rless < 2; Rless++)if ((val = dp[i, used, less, Rless]) > 0)for (int d = 0; d <= 9; d++){if (less == 0 && d > A[i]) continue;if (used == 0 && d == 0) continue;int nextless = less | (d < A[i] ? 1 : 0);int nextRless = (d < A[A.Length - 1 - i] ? 1 : 0);nextRless |= (Rless == 1 && d == A[A.Length - 1 - i]) ? 1 : 0;Add(ref dp[i + 1, 1, nextless, nextRless], val, mod);}int ans = A.SequenceEqual(A.Reverse()) ? 1 : 0;for (int L = 0; L < 2; L++)for (int R = 0; R < 2; R++)if (L + R > 0)Add(ref ans, dp[len, 1, L, R], mod);return ans;}}class Entry { static void Main() { new Program().Solve(); } }class Reader{static TextReader reader = Console.In;static readonly char[] separator = { ' ' };static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;static string[] A = new string[0];static int i;static void Init() { Dispose(); A = new string[0]; }public static void Set(TextReader r) { Init(); reader = r; }public static void Set(string file) { Init(); reader = new StreamReader(file); }public static bool HasNext() { return CheckNext(); }public static string String() { return Next(); }public static int Int() { return int.Parse(Next()); }public static long Long() { return long.Parse(Next()); }public static double Double() { return double.Parse(Next()); }public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }public static int[] IntArray(int N) { return Range(N, Int); }public static int[][] IntTable(int H) { return Range(H, IntLine); }public static string[] StringArray(int N) { return Range(N, Next); }public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }public static string Line() { return reader.ReadLine().Trim(); }public static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }public static void Dispose() { reader.Dispose(); }static string[] Split(string s) { return s.Split(separator, op); }static string Next() { CheckNext(); return A[i++]; }static bool CheckNext(){if (i < A.Length) return true;string line = reader.ReadLine();if (line == null) return false;if (line == "") return CheckNext();A = Split(line);i = 0;return true;}}