結果
問題 | No.491 10^9+1と回文 |
ユーザー | naimonon77 |
提出日時 | 2017-03-11 02:05:19 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,391 bytes |
コンパイル時間 | 1,843 ms |
コンパイル使用メモリ | 182,900 KB |
実行使用メモリ | 12,288 KB |
最終ジャッジ日時 | 2024-06-24 09:31:56 |
合計ジャッジ時間 | 4,542 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 2 ms
6,944 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | WA | - |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | WA | - |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | WA | - |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,944 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | WA | - |
testcase_31 | AC | 2 ms
6,944 KB |
testcase_32 | WA | - |
testcase_33 | AC | 2 ms
6,944 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 2 ms
6,940 KB |
testcase_37 | AC | 2 ms
6,940 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 2 ms
6,940 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 2 ms
6,940 KB |
testcase_48 | AC | 2 ms
6,940 KB |
testcase_49 | AC | 2 ms
6,944 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | AC | 2 ms
6,940 KB |
testcase_54 | AC | 2 ms
6,940 KB |
testcase_55 | AC | 2 ms
6,940 KB |
testcase_56 | AC | 2 ms
6,940 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | AC | 2 ms
6,944 KB |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | AC | 2 ms
6,944 KB |
testcase_66 | AC | 2 ms
6,940 KB |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | AC | 2 ms
6,940 KB |
testcase_70 | AC | 2 ms
6,940 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | AC | 2 ms
6,940 KB |
testcase_76 | AC | 2 ms
6,944 KB |
testcase_77 | AC | 2 ms
6,948 KB |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | AC | 2 ms
6,944 KB |
testcase_81 | AC | 2 ms
6,944 KB |
testcase_82 | AC | 2 ms
6,940 KB |
testcase_83 | WA | - |
testcase_84 | AC | 2 ms
6,944 KB |
testcase_85 | WA | - |
testcase_86 | AC | 2 ms
6,944 KB |
testcase_87 | WA | - |
testcase_88 | AC | 2 ms
6,940 KB |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | AC | 2 ms
6,944 KB |
testcase_93 | WA | - |
testcase_94 | WA | - |
testcase_95 | AC | 2 ms
6,944 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 | - |
ソースコード
#define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include "bits/stdc++.h" #include <random> using namespace std; #define rep(i,n) for(int i=0;i<(n);++i) #define rep2(i,a,b) for(int i=(a);i<(b);++i) #define rrep(i,n) for(int i=(n)-1;i>=0;--i) #define rrep2(i,a,b) for(int i=(a)-1;i>=b;--i) #define range(i,a,b,c) for(int i=a;\ c>0?i<b:\ i>b;\ i+=c) #define chmax(a, b) (a = (a) < (b) ? (b) : (a)) #define chmin(a, b) (a = (a) > (b) ? (b) : (a)) using ll = long long; using ull = unsigned long long; using ld = long double; #define all(a) begin(a),end(a) #define ifnot(a) if(not (a)) #define dump(x) cerr << #x << " = " << (x) << endl #define int long long #ifdef _MSC_VER const bool test = true; #else const bool test = false; #endif int dx[] = { 1,0,-1,0 }; int dy[] = { 0,1,0,-1 }; const int INF = 1 << 28; const ll INFL = (ll)1 << 58; ll mod = (int)1e9 + 7; const double eps = 1e-10; typedef long double Real; // return -1, 0, 1 int sgn(const Real& r) { return (r > eps) - (r < -eps); } int sgn(const Real& a, const Real &b) { return sgn(a - b); } //..................... const int MAX = (int)2e5 + 5; vector<string> split(const string &str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); } return v; } template<class InputIterator> int sum(InputIterator begin, InputIterator end) { return accumulate(begin, end, 0ll); } int n; string reverse_res(string s) { reverse(all(s)); return s; } set<int> set1; void solve() { set1.clear(); cin >> n; int mod_n = (int)1e9; rep2(i, 1, mod_n) { string s1 = to_string(i); string s2 = reverse_res(s1); string s3 = s1 + s2; int a = stoll(s3); int b = a * mod_n + a; if (n < b) break; set1.insert(a); } rep(i, mod_n) { rep2(j, 1, 10) { string s1 = to_string(i); string s2 = reverse_res(s1); if (i == 0) s1 = s2 = ""; string s3 = s1 + to_string(j) + s2; int a = stoll(s3); int b = a * mod_n + a; if (n < b) goto end; set1.insert(a); } } end: cout << set1.size() << endl; } signed main() { srand(time(NULL)); int T = 100; cout << fixed << setprecision(15); rep(i, T) { char s[MAX]; if (scanf("%s", s) == EOF) break; int n = strlen(s); for (int i = n - 1; i > -1; i--) { ungetc(s[i], stdin); } solve(); } return 0; }