#566487 (C#(csc)) No.491 10^9+1と回文

提出ソース

結果

問題	No.491 10^9+1と回文
ユーザー	fairy_lettuce
提出日時	2020-10-14 12:20:11
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	9,241 bytes
コンパイル時間	3,872 ms
コンパイル使用メモリ	120,564 KB
実行使用メモリ	28,132 KB
最終ジャッジ日時	2024-07-20 19:04:00
合計ジャッジ時間	6,068 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	26 ms 21,816 KB
testcase_01	AC	27 ms 25,976 KB
testcase_02	AC	25 ms 17,664 KB
testcase_03	AC	25 ms 18,048 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	AC	27 ms 18,176 KB
testcase_07	AC	25 ms 17,920 KB
testcase_08	WA	-
testcase_09	AC	25 ms 17,792 KB
testcase_10	AC	25 ms 18,048 KB
testcase_11	WA	-
testcase_12	AC	25 ms 17,920 KB
testcase_13	AC	25 ms 18,048 KB
testcase_14	WA	-
testcase_15	AC	25 ms 17,920 KB
testcase_16	AC	25 ms 17,664 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	25 ms 17,664 KB
testcase_21	WA	-
testcase_22	AC	25 ms 17,920 KB
testcase_23	WA	-
testcase_24	AC	25 ms 17,792 KB
testcase_25	WA	-
testcase_26	AC	25 ms 17,920 KB
testcase_27	AC	25 ms 17,920 KB
testcase_28	WA	-
testcase_29	AC	25 ms 18,048 KB
testcase_30	WA	-
testcase_31	AC	25 ms 17,920 KB
testcase_32	WA	-
testcase_33	AC	25 ms 17,792 KB
testcase_34	AC	25 ms 18,048 KB
testcase_35	WA	-
testcase_36	AC	25 ms 18,048 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	25 ms 17,792 KB
testcase_40	AC	25 ms 17,792 KB
testcase_41	AC	25 ms 17,792 KB
testcase_42	WA	-
testcase_43	WA	-
testcase_44	AC	25 ms 18,048 KB
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	AC	25 ms 17,792 KB
testcase_49	AC	24 ms 18,048 KB
testcase_50	AC	25 ms 17,920 KB
testcase_51	WA	-
testcase_52	AC	26 ms 17,664 KB
testcase_53	AC	26 ms 17,792 KB
testcase_54	AC	25 ms 18,048 KB
testcase_55	AC	25 ms 18,048 KB
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	25 ms 17,664 KB
testcase_59	WA	-
testcase_60	AC	25 ms 17,920 KB
testcase_61	AC	25 ms 17,920 KB
testcase_62	AC	25 ms 18,048 KB
testcase_63	AC	25 ms 17,792 KB
testcase_64	WA	-
testcase_65	AC	25 ms 18,048 KB
testcase_66	AC	25 ms 17,920 KB
testcase_67	WA	-
testcase_68	WA	-
testcase_69	AC	24 ms 17,792 KB
testcase_70	WA	-
testcase_71	AC	25 ms 17,920 KB
testcase_72	WA	-
testcase_73	AC	25 ms 17,792 KB
testcase_74	WA	-
testcase_75	AC	26 ms 18,048 KB
testcase_76	AC	25 ms 18,048 KB
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	AC	25 ms 18,048 KB
testcase_81	AC	25 ms 17,920 KB
testcase_82	AC	25 ms 17,792 KB
testcase_83	WA	-
testcase_84	AC	25 ms 17,792 KB
testcase_85	WA	-
testcase_86	AC	26 ms 18,048 KB
testcase_87	WA	-
testcase_88	AC	26 ms 18,048 KB
testcase_89	AC	26 ms 18,048 KB
testcase_90	AC	25 ms 17,920 KB
testcase_91	WA	-
testcase_92	AC	25 ms 17,792 KB
testcase_93	WA	-
testcase_94	WA	-
testcase_95	AC	25 ms 17,920 KB
testcase_96	AC	25 ms 18,048 KB
testcase_97	AC	25 ms 18,048 KB
testcase_98	WA	-
testcase_99	AC	26 ms 17,920 KB
testcase_100	WA	-
testcase_101	AC	25 ms 17,920 KB
testcase_102	AC	26 ms 17,920 KB
testcase_103	AC	26 ms 18,048 KB
testcase_104	WA	-
testcase_105	WA	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Diagnostics;
using System.Runtime.CompilerServices;

namespace FertiLib.Contest.A
{
	static class Program
	{
		public static void Solve(Scanner cin)
		{
			long n = cin.ReadLong();
			var m = n / 1000000000L;
			if (m > n % 1000000000L) m--;
			var len = m.ToString().Length;
			long ans = 0;
			for (int i = 0; i < len; i++)
			{
				ans += GetAns(m, i + 1);
			}
			Console.WriteLine(ans);
		}

		public static long GetAns(long n, long keta)
		{
			if (n.ToString().Length > keta)
			{
				n = 1;
				for (int i = 0; i < keta; i++)
				{
					n *= 10;
				}
				n--;
			}
			var s = n.ToString();
			var dp = new long[(keta + 1) / 2, 10, 2];
			long mask = 1L;
			for (int i = 0; i < keta; i++)
			{
				mask *= 10;
			}
			for (int i = 0; i < (keta + 1) / 2; i++)
			{
				long t = 0;
				if (i > 0)
				{
					for (int j = 0; j < 10; j++)
					{
						t += dp[i - 1, j, 1];
					}
				}
				else
				{
					dp[i, 0, 1]--;
				}
				for (int j = 0; j < 10; j++)
				{
					dp[i, j, 1] += t;
				}
				for (int j = 0; j < s[i] - '0'; j++)
				{
					dp[i, j, 1]++;
				}
				dp[i, s[i] - '0', 0] += 1;
			}
			var ret = 0L;
			for (int i = 0; i < 10; i++)
			{
				ret += dp[(keta + 1) / 2 - 1, i, 0];
				ret += dp[(keta + 1) / 2 - 1, i, 1];
			}
			return ret;
		}

		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);
			var cin = new Scanner();
			Solve(cin);
			Console.Out.Flush();
		}

		public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO");
		public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No");
		public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no");

		public static bool Chmax<T>(ref T a, T b) where T : IComparable<T>
		{
			if (a.CompareTo(b) >= 0) return false;
			a = b;
			return true;
		}
		public static bool Chmin<T>(ref T a, T b) where T : IComparable<T>
		{
			if (a.CompareTo(b) <= 0) return false;
			a = b;
			return true;
		}
	}

	static class Extention
	{
		public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);

		public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default);
		public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default);
		public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer)
		{
			var ng = index - 1;
			var ok = index + length;
			while (ok - ng > 1)
			{
				var mid = ng + (ok - ng) / 2;
				var res = comparer.Compare(list[mid], value);
				if (res < 0 || (isUpperBound && res == 0)) ng = mid;
				else ok = mid;
			}
			return ok;
		}
	}

	class Scanner
	{
		string[] s;
		int i;

		char[] separator = new char[] { ' ' };

		public Scanner()
		{
			s = new string[0];
			i = 0;
		}

		public string Read() => ReadString();

		public string ReadString()
		{
			if (i < s.Length) return s[i++];
			string st = Console.ReadLine();
			while (st == "") st = Console.ReadLine();
			s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries);
			if (s.Length == 0) return ReadString();
			i = 0;
			return s[i++];
		}

		public string[] ReadStringArray(int N)
		{
			string[] Array = new string[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadString();
			}
			return Array;
		}

		public int ReadInt()
		{
			return int.Parse(ReadString());
		}

		public int[] ReadIntArray(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadInt() + add;
			}
			return Array;
		}

		public long ReadLong()
		{
			return long.Parse(ReadString());
		}

		public long[] ReadLongArray(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadLong() + add;
			}
			return Array;
		}

		public double ReadDouble()
		{
			return double.Parse(ReadString());
		}

		public double[] ReadDoubleArray(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadDouble() + add;
			}
			return Array;
		}

		public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1));

		public (T1, T2) ReadValue<T1, T2>()
		{
			var inputs = ReadStringArray(2);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			return (v1, v2);
		}

		public (T1, T2, T3) ReadValue<T1, T2, T3>()
		{
			var inputs = ReadStringArray(3);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			return (v1, v2, v3);
		}

		public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>()
		{
			var inputs = ReadStringArray(4);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			return (v1, v2, v3, v4);
		}

		public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>()
		{
			var inputs = ReadStringArray(5);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			return (v1, v2, v3, v4, v5);
		}

		public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>()
		{
			var inputs = ReadStringArray(6);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
			return (v1, v2, v3, v4, v5, v6);
		}

		public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>()
		{
			var inputs = ReadStringArray(7);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
			var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
			return (v1, v2, v3, v4, v5, v6, v7);
		}

		public T1[] ReadValueArray<T1>(int N)
		{
			var v1 = new T1[N];
			for (int i = 0; i < N; i++)
			{
				v1[i] = ReadValue<T1>();
			}
			return v1;
		}

		public (T1[], T2[]) ReadValueArray<T1, T2>(int N)
		{
			var (v1, v2) = (new T1[N], new T2[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2) = ReadValue<T1, T2>();
				v1[i] = t1;
				v2[i] = t2;
			}
			return (v1, v2);
		}

		public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int N)
		{
			var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3) = ReadValue<T1, T2, T3>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
			}
			return (v1, v2, v3);
		}

		public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int N)
		{
			var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4) = ReadValue<T1, T2, T3, T4>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
			}
			return (v1, v2, v3, v4);
		}

		public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int N)
		{
			var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5) = ReadValue<T1, T2, T3, T4, T5>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
			}
			return (v1, v2, v3, v4, v5);
		}

		public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int N)
		{
			var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5, t6) = ReadValue<T1, T2, T3, T4, T5, T6>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
				v6[i] = t6;
			}
			return (v1, v2, v3, v4, v5, v6);
		}

		public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int N)
		{
			var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5, t6, t7) = ReadValue<T1, T2, T3, T4, T5, T6, T7>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
				v6[i] = t6;
				v7[i] = t7;
			}
			return (v1, v2, v3, v4, v5, v6, v7);
		}
	}
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード