結果
問題 | No.491 10^9+1と回文 |
ユーザー | mkawa2 |
提出日時 | 2020-01-02 15:25:38 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,150 bytes |
コンパイル時間 | 122 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 44,844 KB |
最終ジャッジ日時 | 2024-11-22 18:05:28 |
合計ジャッジ時間 | 55,429 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 500 ms
44,532 KB |
testcase_01 | AC | 486 ms
44,396 KB |
testcase_02 | AC | 505 ms
44,524 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 490 ms
44,652 KB |
testcase_09 | WA | - |
testcase_10 | AC | 463 ms
44,536 KB |
testcase_11 | AC | 461 ms
44,656 KB |
testcase_12 | WA | - |
testcase_13 | AC | 487 ms
44,524 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 488 ms
44,652 KB |
testcase_17 | AC | 497 ms
44,660 KB |
testcase_18 | AC | 485 ms
44,652 KB |
testcase_19 | WA | - |
testcase_20 | AC | 479 ms
44,660 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 489 ms
44,400 KB |
testcase_26 | AC | 502 ms
44,404 KB |
testcase_27 | AC | 483 ms
44,656 KB |
testcase_28 | AC | 488 ms
44,788 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 486 ms
44,660 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 483 ms
44,524 KB |
testcase_37 | AC | 475 ms
44,780 KB |
testcase_38 | AC | 471 ms
44,532 KB |
testcase_39 | WA | - |
testcase_40 | AC | 502 ms
44,656 KB |
testcase_41 | WA | - |
testcase_42 | AC | 520 ms
44,652 KB |
testcase_43 | AC | 497 ms
44,524 KB |
testcase_44 | AC | 481 ms
44,780 KB |
testcase_45 | AC | 487 ms
44,528 KB |
testcase_46 | WA | - |
testcase_47 | AC | 487 ms
44,792 KB |
testcase_48 | AC | 502 ms
44,524 KB |
testcase_49 | AC | 489 ms
44,784 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 483 ms
44,656 KB |
testcase_53 | AC | 495 ms
44,524 KB |
testcase_54 | AC | 506 ms
44,528 KB |
testcase_55 | AC | 496 ms
44,528 KB |
testcase_56 | AC | 498 ms
44,796 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 478 ms
44,788 KB |
testcase_61 | AC | 488 ms
44,524 KB |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | AC | 483 ms
44,784 KB |
testcase_65 | AC | 488 ms
44,668 KB |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | AC | 494 ms
44,532 KB |
testcase_69 | AC | 499 ms
44,784 KB |
testcase_70 | AC | 503 ms
44,528 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | AC | 497 ms
44,528 KB |
testcase_75 | WA | - |
testcase_76 | AC | 513 ms
44,788 KB |
testcase_77 | AC | 491 ms
44,784 KB |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | AC | 506 ms
44,656 KB |
testcase_81 | WA | - |
testcase_82 | AC | 498 ms
44,660 KB |
testcase_83 | WA | - |
testcase_84 | AC | 487 ms
44,532 KB |
testcase_85 | WA | - |
testcase_86 | AC | 493 ms
44,656 KB |
testcase_87 | AC | 516 ms
44,652 KB |
testcase_88 | AC | 501 ms
44,660 KB |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | WA | - |
testcase_93 | WA | - |
testcase_94 | WA | - |
testcase_95 | WA | - |
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 | - |
ソースコード
from itertools import * from bisect import * #from math import * from collections import * from heapq import * from random import * from decimal import * import numpy as np import sys sys.setrecursionlimit(10 ** 6) int1 = lambda x: int(x) - 1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def MI(): return map(int, sys.stdin.readline().split()) def MI1(): return map(int1, sys.stdin.readline().split()) def MF(): return map(float, sys.stdin.readline().split()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LF(): return list(map(float, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] dij = [(1, 0), (0, 1), (-1, 0), (0, -1)] def main(): s=input() n=int(s) if n<10**9+1: print(0) exit() k=len(s)-9 ans=0 for i in range(1,k): ans+=10**((i+1)//2)-1 ans+=int(s[:(k+1)//2])-(10**((k-1)//2)-1) sym=int(s[:(k+1)//2]+s[:k//2][::-1]) ls=int(s[:k]) if ls<sym:ans-=1 if ls==sym and int(s[-k:])<ls:ans-=1 print(ans) main()