結果
問題 | No.491 10^9+1と回文 |
ユーザー | tanzaku |
提出日時 | 2017-03-10 23:42:32 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,563 bytes |
コンパイル時間 | 3,428 ms |
コンパイル使用メモリ | 74,384 KB |
実行使用メモリ | 59,192 KB |
最終ジャッジ日時 | 2023-09-06 14:37:15 |
合計ジャッジ時間 | 19,362 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 119 ms
56,116 KB |
testcase_01 | AC | 121 ms
56,052 KB |
testcase_02 | AC | 119 ms
55,728 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 119 ms
55,652 KB |
testcase_09 | AC | 118 ms
56,268 KB |
testcase_10 | AC | 121 ms
55,736 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 118 ms
56,388 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 125 ms
56,148 KB |
testcase_18 | AC | 128 ms
56,404 KB |
testcase_19 | WA | - |
testcase_20 | AC | 117 ms
55,844 KB |
testcase_21 | WA | - |
testcase_22 | AC | 118 ms
55,976 KB |
testcase_23 | WA | - |
testcase_24 | AC | 119 ms
55,684 KB |
testcase_25 | AC | 118 ms
56,680 KB |
testcase_26 | AC | 122 ms
57,160 KB |
testcase_27 | AC | 118 ms
56,320 KB |
testcase_28 | AC | 118 ms
56,416 KB |
testcase_29 | AC | 119 ms
56,492 KB |
testcase_30 | WA | - |
testcase_31 | AC | 121 ms
56,112 KB |
testcase_32 | WA | - |
testcase_33 | AC | 120 ms
55,860 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 125 ms
55,956 KB |
testcase_37 | AC | 122 ms
56,412 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 120 ms
55,820 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 129 ms
56,140 KB |
testcase_48 | AC | 126 ms
55,772 KB |
testcase_49 | AC | 126 ms
55,804 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | AC | 120 ms
55,984 KB |
testcase_54 | AC | 120 ms
56,248 KB |
testcase_55 | AC | 119 ms
55,992 KB |
testcase_56 | AC | 124 ms
55,888 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | AC | 121 ms
56,108 KB |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | AC | 119 ms
56,200 KB |
testcase_66 | AC | 122 ms
55,676 KB |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | AC | 122 ms
55,832 KB |
testcase_70 | AC | 121 ms
56,088 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | AC | 119 ms
56,160 KB |
testcase_76 | AC | 116 ms
55,840 KB |
testcase_77 | AC | 121 ms
55,568 KB |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | AC | 124 ms
55,860 KB |
testcase_81 | AC | 128 ms
56,304 KB |
testcase_82 | AC | 124 ms
55,696 KB |
testcase_83 | WA | - |
testcase_84 | AC | 120 ms
56,144 KB |
testcase_85 | WA | - |
testcase_86 | AC | 123 ms
56,084 KB |
testcase_87 | WA | - |
testcase_88 | AC | 124 ms
53,612 KB |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | AC | 126 ms
55,944 KB |
testcase_93 | WA | - |
testcase_94 | WA | - |
testcase_95 | AC | 121 ms
55,876 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 java.io.BufferedInputStream; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class _491 { public static void main(String[] args) throws IOException { new _491().solve(); } void solve() throws IOException { try (final Scanner in = new Scanner(System.in)) { n = in.nextLong(); long ans = 0; for (int i = 1; i <= 9; i++) { ans += rec(i, 0, 0); } System.out.println(ans); } } long n; char[] cs; long x = 1000000000+1; long[] digits = new long[20]; boolean palindrome(long cur) { int len = 0; while (cur > 0) { digits[len++] = cur % 10; cur /= 10; } for (int i = 0; i < len / 2; i++) { if (digits[i] != digits[len-1-i]) return false; } return true; } long rec(int len, int idx, long cur) { if (len % 2 == 0) { if (2*idx == len) { long c = cur; for (int i = 0; i < len / 2; i++) { cur = cur * 10 + c % 10; c /= 10; } // if (cur * x <= n) dump(cur); return cur <= n / x && palindrome(cur) ? 1 : 0; } } else { if (2*idx-1 == len) { long c = cur; for (int i = 0; i < len / 2; i++) { cur = cur * 10 + c % 10; c /= 10; } // if (cur * x <= n) dump(cur); return cur <= n / x && palindrome(cur) ? 1 : 0; } } long ans = 0; for (int i = 0; i < 10; i++) { if (cur == 0 && i == 0) continue; ans += rec(len, idx + 1, cur * 10 + i); } return ans; } // for debug static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } }