結果
問題 | No.491 10^9+1と回文 |
ユーザー | olphe |
提出日時 | 2017-03-10 23:00:34 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 16 ms / 1,000 ms |
コード長 | 2,255 bytes |
コンパイル時間 | 1,114 ms |
コンパイル使用メモリ | 113,448 KB |
実行使用メモリ | 9,728 KB |
最終ジャッジ日時 | 2024-04-08 14:23:21 |
合計ジャッジ時間 | 5,119 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 14 ms
9,728 KB |
testcase_01 | AC | 15 ms
9,728 KB |
testcase_02 | AC | 14 ms
9,728 KB |
testcase_03 | AC | 14 ms
9,728 KB |
testcase_04 | AC | 15 ms
9,728 KB |
testcase_05 | AC | 15 ms
9,728 KB |
testcase_06 | AC | 15 ms
9,728 KB |
testcase_07 | AC | 14 ms
9,728 KB |
testcase_08 | AC | 15 ms
9,728 KB |
testcase_09 | AC | 15 ms
9,728 KB |
testcase_10 | AC | 14 ms
9,728 KB |
testcase_11 | AC | 14 ms
9,728 KB |
testcase_12 | AC | 15 ms
9,728 KB |
testcase_13 | AC | 15 ms
9,728 KB |
testcase_14 | AC | 15 ms
9,728 KB |
testcase_15 | AC | 16 ms
9,728 KB |
testcase_16 | AC | 15 ms
9,728 KB |
testcase_17 | AC | 15 ms
9,728 KB |
testcase_18 | AC | 15 ms
9,728 KB |
testcase_19 | AC | 14 ms
9,728 KB |
testcase_20 | AC | 14 ms
9,728 KB |
testcase_21 | AC | 15 ms
9,728 KB |
testcase_22 | AC | 14 ms
9,728 KB |
testcase_23 | AC | 15 ms
9,728 KB |
testcase_24 | AC | 15 ms
9,728 KB |
testcase_25 | AC | 14 ms
9,728 KB |
testcase_26 | AC | 14 ms
9,728 KB |
testcase_27 | AC | 15 ms
9,728 KB |
testcase_28 | AC | 14 ms
9,728 KB |
testcase_29 | AC | 15 ms
9,728 KB |
testcase_30 | AC | 15 ms
9,728 KB |
testcase_31 | AC | 15 ms
9,728 KB |
testcase_32 | AC | 14 ms
9,728 KB |
testcase_33 | AC | 15 ms
9,728 KB |
testcase_34 | AC | 15 ms
9,728 KB |
testcase_35 | AC | 15 ms
9,728 KB |
testcase_36 | AC | 15 ms
9,728 KB |
testcase_37 | AC | 15 ms
9,728 KB |
testcase_38 | AC | 15 ms
9,728 KB |
testcase_39 | AC | 15 ms
9,728 KB |
testcase_40 | AC | 15 ms
9,728 KB |
testcase_41 | AC | 15 ms
9,728 KB |
testcase_42 | AC | 14 ms
9,728 KB |
testcase_43 | AC | 15 ms
9,728 KB |
testcase_44 | AC | 14 ms
9,728 KB |
testcase_45 | AC | 15 ms
9,728 KB |
testcase_46 | AC | 15 ms
9,728 KB |
testcase_47 | AC | 15 ms
9,728 KB |
testcase_48 | AC | 14 ms
9,728 KB |
testcase_49 | AC | 15 ms
9,728 KB |
testcase_50 | AC | 14 ms
9,728 KB |
testcase_51 | AC | 15 ms
9,728 KB |
testcase_52 | AC | 15 ms
9,728 KB |
testcase_53 | AC | 14 ms
9,728 KB |
testcase_54 | AC | 14 ms
9,728 KB |
testcase_55 | AC | 14 ms
9,728 KB |
testcase_56 | AC | 15 ms
9,728 KB |
testcase_57 | AC | 15 ms
9,728 KB |
testcase_58 | AC | 14 ms
9,728 KB |
testcase_59 | AC | 15 ms
9,728 KB |
testcase_60 | AC | 15 ms
9,728 KB |
testcase_61 | AC | 14 ms
9,728 KB |
testcase_62 | AC | 15 ms
9,728 KB |
testcase_63 | AC | 15 ms
9,728 KB |
testcase_64 | AC | 15 ms
9,728 KB |
testcase_65 | AC | 15 ms
9,728 KB |
testcase_66 | AC | 15 ms
9,728 KB |
testcase_67 | AC | 14 ms
9,728 KB |
testcase_68 | AC | 15 ms
9,728 KB |
testcase_69 | AC | 14 ms
9,728 KB |
testcase_70 | AC | 14 ms
9,728 KB |
testcase_71 | AC | 14 ms
9,728 KB |
testcase_72 | AC | 15 ms
9,728 KB |
testcase_73 | AC | 15 ms
9,728 KB |
testcase_74 | AC | 15 ms
9,728 KB |
testcase_75 | AC | 14 ms
9,728 KB |
testcase_76 | AC | 15 ms
9,728 KB |
testcase_77 | AC | 15 ms
9,728 KB |
testcase_78 | AC | 14 ms
9,728 KB |
testcase_79 | AC | 15 ms
9,728 KB |
testcase_80 | AC | 15 ms
9,728 KB |
testcase_81 | AC | 15 ms
9,728 KB |
testcase_82 | AC | 14 ms
9,728 KB |
testcase_83 | AC | 15 ms
9,728 KB |
testcase_84 | AC | 14 ms
9,728 KB |
testcase_85 | AC | 15 ms
9,728 KB |
testcase_86 | AC | 15 ms
9,728 KB |
testcase_87 | AC | 14 ms
9,728 KB |
testcase_88 | AC | 15 ms
9,728 KB |
testcase_89 | AC | 15 ms
9,728 KB |
testcase_90 | AC | 14 ms
9,728 KB |
testcase_91 | AC | 15 ms
9,728 KB |
testcase_92 | AC | 15 ms
9,728 KB |
testcase_93 | AC | 15 ms
9,728 KB |
testcase_94 | AC | 14 ms
9,728 KB |
testcase_95 | AC | 15 ms
9,728 KB |
testcase_96 | AC | 14 ms
9,728 KB |
testcase_97 | AC | 15 ms
9,728 KB |
testcase_98 | AC | 15 ms
9,728 KB |
testcase_99 | AC | 15 ms
9,728 KB |
testcase_100 | AC | 16 ms
9,728 KB |
testcase_101 | AC | 15 ms
9,728 KB |
testcase_102 | AC | 15 ms
9,728 KB |
testcase_103 | AC | 15 ms
9,728 KB |
testcase_104 | AC | 15 ms
9,728 KB |
testcase_105 | AC | 15 ms
9,728 KB |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:90:65: warning: iteration 2 invokes undefined behavior [-Waggressive-loop-optimizations] 90 | num.push_back(i * 1000000001 + j * 100000010 + k * 10000100 + l * 1001000 + m * 110000); | ~~^~~~~~~~~~~~ main.cpp:85:27: note: within this loop 85 | for (int i = 1; i < 10; i++) { | ~~^~~~
ソースコード
#include "iostream" #include "climits" #include "list" #include "queue" #include "stack" #include "set" #include "functional" #include "algorithm" #include "math.h" #include "utility" #include "string" #include "map" #include "unordered_map" #include "iomanip" #include "random" using namespace std; const long long int MOD = 1000000007; long long int N; string a; string b; int ans=0; int box; list <long long int>num; int main() { cin >> N; N /= 1000000001; for (int i = 1; i < 10; i++)num.push_back(i); for (int i = 1; i < 10; i++)num.push_back(i * 11); for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { num.push_back(i * 100 + j * 10 + i); } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { num.push_back(i * 1000 + j * 110 + i); } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { num.push_back(i * 10001 + j * 1010 + k * 100); } } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { num.push_back(i * 100001 + j * 10010 + k * 1100); } } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { for (int l = 0; l < 10; l++) { num.push_back(i * 1000001 + j * 100010 + k * 10100 + l * 1000); } } } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { for (int l = 0; l < 10; l++) { num.push_back(i * 10000001 + j * 1000010 + k * 100100 + l * 11000); } } } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { for (int l = 0; l < 10; l++) { for (int m = 0; m < 10; m++) { num.push_back(i * 100000001 + j * 10000010 + k * 1000100 + l * 101000 + m * 10000); } } } } } for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { for (int k = 0; k < 10; k++) { for (int l = 0; l < 10; l++) { for (int m = 0; m < 10; m++) { num.push_back(i * 1000000001 + j * 100000010 + k * 10000100 + l * 1001000 + m * 110000); } } } } } for (auto i : num) { if (i <= N)ans++; else break; //cout << i << endl; } cout << ans << endl; return 0; }