1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
| #include <bits/stdc++.h>
#pragma optimization_level 3 #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") #pragma GCC optimization ("unroll-loops")
#define MAX_N 2020 #define ll long long #define pll pair<ll, ll> #define vpll vector<pll> #define vll vector<ll> #define vvll vector<vll> #define all(a) begin(a), end(a) using namespace std; unordered_map<ll, bool> cache;
bool palindrome(ll n) { if(cache.count(n)) return cache[n]; string s = to_string(n); ll l = 0, r = s.length() - 1; while(l < r) { if(s[l++] != s[r--]) return cache[n] = false; } return cache[n] = true; }
ll solve(ll& n) { ll res = 0, sq = sqrt(n); for(ll i = 1; i <= sq; i++) { if(n % i == 0) { res += palindrome(n / i); if(i * i != n) res += palindrome(i); } }
return res; }
int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios::fixed); cout.precision(6); ll tc, n; cin>>tc; for(ll i = 1; i <= tc; i++) { cin>>n; cout<<"Case #"<<i<<": "<<solve(n)<<'\n'; }
return 0; }
|