結果
問題 | No.491 10^9+1と回文 |
ユーザー | McGregorsh |
提出日時 | 2022-10-30 08:58:47 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,701 bytes |
コンパイル時間 | 97 ms |
コンパイル使用メモリ | 11,052 KB |
実行使用メモリ | 10,236 KB |
最終ジャッジ日時 | 2023-09-21 08:43:38 |
合計ジャッジ時間 | 8,173 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
9,924 KB |
testcase_01 | AC | 34 ms
9,952 KB |
testcase_02 | AC | 35 ms
10,120 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 35 ms
9,984 KB |
testcase_09 | AC | 35 ms
9,928 KB |
testcase_10 | AC | 35 ms
9,984 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 34 ms
9,984 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 35 ms
9,888 KB |
testcase_18 | AC | 34 ms
9,964 KB |
testcase_19 | WA | - |
testcase_20 | AC | 34 ms
10,168 KB |
testcase_21 | WA | - |
testcase_22 | AC | 34 ms
10,036 KB |
testcase_23 | WA | - |
testcase_24 | AC | 34 ms
10,020 KB |
testcase_25 | AC | 35 ms
9,984 KB |
testcase_26 | AC | 34 ms
10,028 KB |
testcase_27 | AC | 34 ms
10,172 KB |
testcase_28 | AC | 35 ms
9,988 KB |
testcase_29 | AC | 34 ms
10,112 KB |
testcase_30 | WA | - |
testcase_31 | AC | 35 ms
10,072 KB |
testcase_32 | WA | - |
testcase_33 | AC | 35 ms
9,980 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 34 ms
10,036 KB |
testcase_37 | AC | 34 ms
9,952 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 35 ms
9,884 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 34 ms
9,924 KB |
testcase_48 | AC | 35 ms
10,104 KB |
testcase_49 | AC | 36 ms
10,024 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | AC | 34 ms
10,176 KB |
testcase_54 | AC | 34 ms
10,036 KB |
testcase_55 | AC | 35 ms
10,072 KB |
testcase_56 | AC | 34 ms
9,948 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | AC | 35 ms
10,028 KB |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | AC | 34 ms
10,104 KB |
testcase_66 | AC | 34 ms
10,032 KB |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | AC | 34 ms
9,892 KB |
testcase_70 | AC | 34 ms
9,980 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | AC | 33 ms
10,164 KB |
testcase_76 | AC | 35 ms
10,108 KB |
testcase_77 | AC | 35 ms
10,152 KB |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | AC | 34 ms
9,924 KB |
testcase_81 | AC | 33 ms
9,988 KB |
testcase_82 | AC | 34 ms
9,928 KB |
testcase_83 | WA | - |
testcase_84 | AC | 34 ms
9,984 KB |
testcase_85 | WA | - |
testcase_86 | AC | 33 ms
10,020 KB |
testcase_87 | WA | - |
testcase_88 | AC | 34 ms
9,948 KB |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | AC | 34 ms
10,156 KB |
testcase_93 | WA | - |
testcase_94 | WA | - |
testcase_95 | AC | 36 ms
9,960 KB |
testcase_96 | WA | - |
testcase_97 | WA | - |
testcase_98 | WA | - |
testcase_99 | WA | - |
testcase_100 | WA | - |
testcase_101 | WA | - |
testcase_102 | WA | - |
testcase_103 | WA | - |
testcase_104 | WA | - |
testcase_105 | WA | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): N = int(input()) ans = 0 for i in range(1, 10): if N >= i * 1000000001: ans += 1 for i in range(1, 1000): a = str(i) b = a[::-1] mozi = 8 - max(len(a), 0) c = a + b + '0' * mozi + a + b c = int(c) if N >= c: ans += 1 print(ans) if __name__ == '__main__': main()