結果
問題 | No.491 10^9+1と回文 |
ユーザー | mban |
提出日時 | 2017-03-11 19:40:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 193 ms / 1,000 ms |
コード長 | 2,740 bytes |
コンパイル時間 | 2,257 ms |
コンパイル使用メモリ | 101,804 KB |
実行使用メモリ | 29,784 KB |
最終ジャッジ日時 | 2023-07-24 13:21:03 |
合計ジャッジ時間 | 25,758 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 190 ms
25,684 KB |
testcase_01 | AC | 191 ms
25,688 KB |
testcase_02 | AC | 190 ms
29,784 KB |
testcase_03 | AC | 190 ms
25,768 KB |
testcase_04 | AC | 191 ms
25,720 KB |
testcase_05 | AC | 190 ms
25,700 KB |
testcase_06 | AC | 188 ms
27,660 KB |
testcase_07 | AC | 186 ms
25,812 KB |
testcase_08 | AC | 190 ms
27,740 KB |
testcase_09 | AC | 191 ms
27,852 KB |
testcase_10 | AC | 190 ms
25,804 KB |
testcase_11 | AC | 190 ms
25,772 KB |
testcase_12 | AC | 190 ms
25,732 KB |
testcase_13 | AC | 189 ms
23,672 KB |
testcase_14 | AC | 190 ms
27,784 KB |
testcase_15 | AC | 189 ms
25,720 KB |
testcase_16 | AC | 187 ms
25,832 KB |
testcase_17 | AC | 187 ms
23,696 KB |
testcase_18 | AC | 188 ms
25,740 KB |
testcase_19 | AC | 188 ms
25,736 KB |
testcase_20 | AC | 188 ms
27,824 KB |
testcase_21 | AC | 189 ms
25,792 KB |
testcase_22 | AC | 188 ms
25,776 KB |
testcase_23 | AC | 190 ms
27,808 KB |
testcase_24 | AC | 189 ms
27,764 KB |
testcase_25 | AC | 187 ms
25,768 KB |
testcase_26 | AC | 188 ms
27,896 KB |
testcase_27 | AC | 188 ms
27,816 KB |
testcase_28 | AC | 188 ms
19,676 KB |
testcase_29 | AC | 188 ms
19,604 KB |
testcase_30 | AC | 189 ms
19,776 KB |
testcase_31 | AC | 189 ms
19,684 KB |
testcase_32 | AC | 189 ms
19,700 KB |
testcase_33 | AC | 189 ms
19,656 KB |
testcase_34 | AC | 193 ms
19,672 KB |
testcase_35 | AC | 188 ms
19,540 KB |
testcase_36 | AC | 189 ms
19,592 KB |
testcase_37 | AC | 189 ms
19,704 KB |
testcase_38 | AC | 189 ms
19,620 KB |
testcase_39 | AC | 188 ms
19,716 KB |
testcase_40 | AC | 187 ms
19,588 KB |
testcase_41 | AC | 186 ms
19,660 KB |
testcase_42 | AC | 189 ms
19,540 KB |
testcase_43 | AC | 188 ms
19,744 KB |
testcase_44 | AC | 189 ms
19,604 KB |
testcase_45 | AC | 189 ms
19,704 KB |
testcase_46 | AC | 188 ms
19,584 KB |
testcase_47 | AC | 189 ms
19,656 KB |
testcase_48 | AC | 191 ms
19,668 KB |
testcase_49 | AC | 189 ms
19,724 KB |
testcase_50 | AC | 189 ms
19,724 KB |
testcase_51 | AC | 191 ms
19,768 KB |
testcase_52 | AC | 190 ms
19,524 KB |
testcase_53 | AC | 189 ms
19,696 KB |
testcase_54 | AC | 188 ms
19,656 KB |
testcase_55 | AC | 188 ms
19,532 KB |
testcase_56 | AC | 191 ms
19,520 KB |
testcase_57 | AC | 189 ms
19,704 KB |
testcase_58 | AC | 190 ms
19,700 KB |
testcase_59 | AC | 188 ms
19,700 KB |
testcase_60 | AC | 191 ms
19,608 KB |
testcase_61 | AC | 191 ms
19,520 KB |
testcase_62 | AC | 191 ms
19,764 KB |
testcase_63 | AC | 188 ms
19,716 KB |
testcase_64 | AC | 189 ms
19,692 KB |
testcase_65 | AC | 188 ms
19,656 KB |
testcase_66 | AC | 190 ms
19,644 KB |
testcase_67 | AC | 188 ms
19,760 KB |
testcase_68 | AC | 188 ms
19,596 KB |
testcase_69 | AC | 188 ms
19,700 KB |
testcase_70 | AC | 189 ms
19,668 KB |
testcase_71 | AC | 188 ms
19,652 KB |
testcase_72 | AC | 189 ms
19,536 KB |
testcase_73 | AC | 193 ms
19,664 KB |
testcase_74 | AC | 190 ms
19,712 KB |
testcase_75 | AC | 190 ms
19,648 KB |
testcase_76 | AC | 190 ms
19,588 KB |
testcase_77 | AC | 189 ms
19,708 KB |
testcase_78 | AC | 190 ms
19,596 KB |
testcase_79 | AC | 188 ms
19,672 KB |
testcase_80 | AC | 191 ms
19,524 KB |
testcase_81 | AC | 190 ms
19,696 KB |
testcase_82 | AC | 189 ms
19,712 KB |
testcase_83 | AC | 190 ms
19,604 KB |
testcase_84 | AC | 190 ms
19,696 KB |
testcase_85 | AC | 190 ms
19,624 KB |
testcase_86 | AC | 189 ms
19,584 KB |
testcase_87 | AC | 189 ms
19,696 KB |
testcase_88 | AC | 190 ms
19,708 KB |
testcase_89 | AC | 189 ms
19,760 KB |
testcase_90 | AC | 189 ms
19,592 KB |
testcase_91 | AC | 188 ms
19,616 KB |
testcase_92 | AC | 190 ms
19,704 KB |
testcase_93 | AC | 188 ms
19,668 KB |
testcase_94 | AC | 188 ms
19,648 KB |
testcase_95 | AC | 187 ms
19,560 KB |
testcase_96 | AC | 189 ms
19,596 KB |
testcase_97 | AC | 188 ms
19,516 KB |
testcase_98 | AC | 187 ms
19,584 KB |
testcase_99 | AC | 190 ms
19,660 KB |
testcase_100 | AC | 188 ms
19,760 KB |
testcase_101 | AC | 189 ms
19,696 KB |
testcase_102 | AC | 188 ms
19,588 KB |
testcase_103 | AC | 188 ms
19,692 KB |
testcase_104 | AC | 188 ms
19,656 KB |
testcase_105 | AC | 189 ms
19,704 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.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; using System.ComponentModel; class Program { static void Main(string[] args) { var alice = new Magatro(); alice.Scan(); alice.Solve(); } } public class Scanner { private StreamReader Sr; private string[] S; private int Index; private const char Separator = ' '; public Scanner() : this(Console.OpenStandardInput()) { Index = 0; S = new string[0]; } public Scanner(Stream source) { Sr = new StreamReader(source); } private string[] Line() { return Sr.ReadLine().Split(Separator); } public string Next() { string result; if (Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public T Next<T>() { var converter = TypeDescriptor.GetConverter(typeof(T)); return (T)converter.ConvertFromString(Next()); } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } public decimal NextDecimal() { return decimal.Parse(Next()); } public string[] StringArray(int index = 0) { Next(); Index = S.Length; return S.Skip(index).ToArray(); } public int[] IntArray(int index = 0) { return StringArray(index).Select(int.Parse).ToArray(); } public long[] LongArray(int index = 0) { return StringArray(index).Select(long.Parse).ToArray(); } public bool EndOfStream { get { return Sr.EndOfStream; } } } public class Magatro { private long N; private const long Mod = (int)1e9 + 1; public void Scan() { Scanner cin = new Scanner(); N = cin.NextLong(); } public void Solve() { var max = N / Mod; int cnt = 0; for (int i = 1; i < 100000; i++) { string left = i.ToString(); var right = i.ToString().Reverse().ToArray(); string rights = new string(right); string rightss = new string(right.Skip(1).ToArray()); if (long.Parse(left + rights) <= max) { cnt++; } if (long.Parse(left + rightss) <= max) { cnt++; } } Console.WriteLine(cnt); } }