結果

問題 No.491 10^9+1と回文
ユーザー Coki628Coki628
提出日時 2020-09-23 01:20:47
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 171 ms / 1,000 ms
コード長 1,443 bytes
コンパイル時間 122 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-06-27 02:18:40
合計ジャッジ時間 19,819 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 163 ms
10,880 KB
testcase_01 AC 160 ms
10,880 KB
testcase_02 AC 157 ms
10,880 KB
testcase_03 AC 159 ms
10,880 KB
testcase_04 AC 161 ms
10,752 KB
testcase_05 AC 157 ms
10,752 KB
testcase_06 AC 168 ms
10,752 KB
testcase_07 AC 161 ms
10,752 KB
testcase_08 AC 160 ms
10,880 KB
testcase_09 AC 162 ms
10,880 KB
testcase_10 AC 159 ms
10,880 KB
testcase_11 AC 159 ms
10,880 KB
testcase_12 AC 162 ms
10,880 KB
testcase_13 AC 161 ms
10,880 KB
testcase_14 AC 159 ms
10,880 KB
testcase_15 AC 159 ms
10,752 KB
testcase_16 AC 159 ms
10,880 KB
testcase_17 AC 160 ms
10,880 KB
testcase_18 AC 160 ms
10,752 KB
testcase_19 AC 162 ms
10,880 KB
testcase_20 AC 159 ms
10,880 KB
testcase_21 AC 160 ms
10,752 KB
testcase_22 AC 162 ms
10,880 KB
testcase_23 AC 159 ms
10,880 KB
testcase_24 AC 160 ms
10,752 KB
testcase_25 AC 158 ms
10,880 KB
testcase_26 AC 161 ms
10,880 KB
testcase_27 AC 160 ms
10,880 KB
testcase_28 AC 161 ms
10,880 KB
testcase_29 AC 160 ms
10,880 KB
testcase_30 AC 162 ms
10,752 KB
testcase_31 AC 157 ms
10,880 KB
testcase_32 AC 162 ms
10,752 KB
testcase_33 AC 158 ms
10,880 KB
testcase_34 AC 160 ms
10,880 KB
testcase_35 AC 161 ms
10,880 KB
testcase_36 AC 157 ms
10,752 KB
testcase_37 AC 158 ms
10,880 KB
testcase_38 AC 161 ms
10,752 KB
testcase_39 AC 159 ms
10,880 KB
testcase_40 AC 162 ms
10,752 KB
testcase_41 AC 160 ms
10,880 KB
testcase_42 AC 161 ms
10,880 KB
testcase_43 AC 161 ms
10,752 KB
testcase_44 AC 162 ms
10,880 KB
testcase_45 AC 159 ms
10,880 KB
testcase_46 AC 162 ms
10,752 KB
testcase_47 AC 162 ms
10,880 KB
testcase_48 AC 155 ms
10,752 KB
testcase_49 AC 159 ms
10,752 KB
testcase_50 AC 161 ms
10,880 KB
testcase_51 AC 157 ms
10,880 KB
testcase_52 AC 160 ms
10,880 KB
testcase_53 AC 162 ms
10,880 KB
testcase_54 AC 159 ms
10,880 KB
testcase_55 AC 158 ms
10,880 KB
testcase_56 AC 162 ms
11,008 KB
testcase_57 AC 161 ms
10,752 KB
testcase_58 AC 159 ms
10,752 KB
testcase_59 AC 160 ms
10,752 KB
testcase_60 AC 157 ms
10,880 KB
testcase_61 AC 159 ms
10,880 KB
testcase_62 AC 159 ms
10,880 KB
testcase_63 AC 161 ms
10,880 KB
testcase_64 AC 159 ms
10,880 KB
testcase_65 AC 158 ms
10,880 KB
testcase_66 AC 158 ms
11,008 KB
testcase_67 AC 160 ms
10,752 KB
testcase_68 AC 159 ms
10,880 KB
testcase_69 AC 161 ms
10,752 KB
testcase_70 AC 158 ms
10,880 KB
testcase_71 AC 159 ms
10,880 KB
testcase_72 AC 156 ms
11,008 KB
testcase_73 AC 161 ms
11,008 KB
testcase_74 AC 157 ms
11,008 KB
testcase_75 AC 159 ms
10,880 KB
testcase_76 AC 160 ms
10,880 KB
testcase_77 AC 159 ms
10,880 KB
testcase_78 AC 162 ms
10,880 KB
testcase_79 AC 156 ms
10,752 KB
testcase_80 AC 161 ms
10,880 KB
testcase_81 AC 161 ms
10,880 KB
testcase_82 AC 158 ms
10,880 KB
testcase_83 AC 158 ms
11,008 KB
testcase_84 AC 159 ms
11,008 KB
testcase_85 AC 158 ms
10,880 KB
testcase_86 AC 158 ms
10,880 KB
testcase_87 AC 163 ms
10,880 KB
testcase_88 AC 157 ms
10,880 KB
testcase_89 AC 157 ms
10,752 KB
testcase_90 AC 159 ms
10,752 KB
testcase_91 AC 158 ms
10,880 KB
testcase_92 AC 160 ms
10,880 KB
testcase_93 AC 160 ms
10,880 KB
testcase_94 AC 156 ms
11,008 KB
testcase_95 AC 162 ms
10,880 KB
testcase_96 AC 160 ms
10,880 KB
testcase_97 AC 160 ms
10,880 KB
testcase_98 AC 169 ms
10,880 KB
testcase_99 AC 165 ms
10,752 KB
testcase_100 AC 168 ms
10,880 KB
testcase_101 AC 167 ms
10,752 KB
testcase_102 AC 166 ms
10,880 KB
testcase_103 AC 169 ms
10,880 KB
testcase_104 AC 171 ms
10,752 KB
testcase_105 AC 169 ms
10,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
# sys.setrecursionlimit(10**9)
# INF = 10**18
MOD = 10**9 + 7
EPS = 10**-10

N = INT()

def check(d):
    d = str(d)
    n = len(d)
    for i in range(n//2):
        if d[i] != d[n-i-1]:
            return False
    return True

# M = 1000000001
# ans = []
# cur = M
# while cur <= N:
#     if check(cur):
#         ans.append(cur)
#     cur += M
# print(len(ans))

ans = 0
for i in range(1, 10000):
    s = str(i)
    rev = s[::-1]
    ln = len(s)*2
    zeros = '0'*(9-ln)
    num = int(s+rev+zeros+s+rev)
    if num <= N:
        ans += 1
    zeros = '0'*(9-ln-1)
    for j in range(10):
        t = str(j)
        num = int(s+t+rev+zeros+s+t+rev)
        if num <= N:
            ans += 1
zeros = '0'*8
for j in range(1, 10):
    t = str(j)
    num = int(t+zeros+t)
    if num <= N:
        ans += 1
print(ans)
0