id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
3,540 | <p>You are given a string <code>s</code> of length <code>n</code> and an integer <code>k</code>, where <code>n</code> is a <strong>multiple</strong> of <code>k</code>. Your task is to hash the string <code>s</code> into a new string called <code>result</code>, which has a length of <code>n / k</code>.</p>
<p>First, di... | 3 | {
"code": "class Solution {\npublic:\n string a=\"abcdefghijklmnopqrstuvwxyz\";\n unordered_map<char , int>mp;\n char kjitna(string &mera){\n int news=0;\n for(auto x:mera){\n news+=mp[x];\n }\n news=news%26;\n return a[news];\n }\n st... |
3,540 | <p>You are given a string <code>s</code> of length <code>n</code> and an integer <code>k</code>, where <code>n</code> is a <strong>multiple</strong> of <code>k</code>. Your task is to hash the string <code>s</code> into a new string called <code>result</code>, which has a length of <code>n / k</code>.</p>
<p>First, di... | 3 | {
"code": "class Solution {\npublic:\n \n string stringHash(string s, int k) {\n map<char,int>mp;\n int i=0,n=s.length();\n for(char ch = 'a';ch<='z';ch++){\n mp[ch] = i;\n i++;\n }\n int length = n / k;\n string result = \"\";\n for (int i = 0;... |
3,540 | <p>You are given a string <code>s</code> of length <code>n</code> and an integer <code>k</code>, where <code>n</code> is a <strong>multiple</strong> of <code>k</code>. Your task is to hash the string <code>s</code> into a new string called <code>result</code>, which has a length of <code>n / k</code>.</p>
<p>First, di... | 3 | {
"code": "class Solution {\npublic:\n string stringHash(string s, int k) {\n vector<string>v;\n int n=s.size();\n vector<char>dic;\n // dic.push_back('a');\n for(char i='a';i<='z';i++){\n dic.push_back(i);\n }\n for(int i=0;i<=n-k;i+=k){\n v.pu... |
3,540 | <p>You are given a string <code>s</code> of length <code>n</code> and an integer <code>k</code>, where <code>n</code> is a <strong>multiple</strong> of <code>k</code>. Your task is to hash the string <code>s</code> into a new string called <code>result</code>, which has a length of <code>n / k</code>.</p>
<p>First, di... | 3 | {
"code": "class Solution {\npublic:\n int getSum(string sub) {\n int res=0;\n for(auto x: sub)\n res+=x-'a';\n return res;\n }\n\n char getChar(int index) {\n return 'a'+index;\n }\n\n string stringHash(string s, int k) {\n vector<string> subs;\n fo... |
3,540 | <p>You are given a string <code>s</code> of length <code>n</code> and an integer <code>k</code>, where <code>n</code> is a <strong>multiple</strong> of <code>k</code>. Your task is to hash the string <code>s</code> into a new string called <code>result</code>, which has a length of <code>n / k</code>.</p>
<p>First, di... | 3 | {
"code": "class Solution {\npublic:\nvector<string> DivideStr(string s, int k){\n vector<string> v;\n int count = 0;\n string str;\n for(char c : s){\n str+= c;\n ++count;\n if(count == k){\n v.emplace_back(str);\n str.clear();\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n long long ans=0;\n if(k==1){\n if(n==1 || n==2) return 9;\n if(n==3) return 243;\n if(n==4) return 252;\n if(n==5) return 10935;\n if(n==6) return 10944;\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "constexpr array<array<int64_t, 10>, 11> kAns{{\n // k =0 1 2 3 4 5 6 7 8 9\n {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, // n = 0\n {0, 9, 4, 3, 2, 1, 1, 1, ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\n typedef long long LL;\n static const LL base = 11;\npublic:\n long long countGoodIntegers(int n, int k) {\n vector<int> ten(15, 0);\n ten[0] = 1;\n for(int i = 1; i <= 6; ++i) ten[i] = ten[i-1] * 10;\n vector<LL> fac(15, 0);\n fac[0] = 1;\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "long long fact[11];\nint speedup = []{\n ios::sync_with_stdio(0); cin.tie(0);\n fact[0] = 1;\n for (int i = 1; i <= 10; ++i) fact[i] = fact[i-1] * i;\n return 0;\n}();\n\nlong long check(long long n, int k, bool odd) {\n long long res = 0, cur = n;\n int i;\n if (odd) i = n/10, res = 1... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n struct vhash {\n size_t operator()(const int *p) const {\n long long r = 0;\n for(int i = 0; i < 10; ++i) r = 10*r+p[i];\n return r % 1000000007;\n }\n };\n int h[10] = {0}, p[10] = {0}, m, kk, nn, nnn, cc;\n long long r... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n struct vhash {\n size_t operator()(const int *p) const {\n long long r = 0;\n for(int i = 0; i < 10; ++i) r = 10*r+p[i];\n return r % 1000000007;\n }\n };\n int h[10] = {0}, p[10] = {0}, m, k, nn, n, cc;\n long long r, x... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n auto factorial = [](int value) -> long\n {\n long fact = 1;\n for (int i = 2; i <= value; ++i) fact *= i;\n return fact;\n };\n const int half_length = (n + 1) / 2,\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n vector<long long> factorial(n + 1);\n factorial[0] = 1;\n for (int i = 1; i <= n; ++i) {\n factorial[i] = factorial[i - 1] * i;\n }\n long long res = 0;\n unordered_set<string> ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "using ll = long long ;\nclass Solution {\npublic:\n vector<long long> fact = {1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800};\n long long countGoodIntegers(int n, int k) {\n unordered_set<string> st;\n ll ans = 0;\n\n ll low = pow(10, (n % 2 == 1) ? (n - 1) / 2 : n / 2 -... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n\n long long f[12];\n\n long long countGoodIntegers(int n, int k) {\n long long ret = 0;\n int m = (n + 1) / 2;\n \n f[0] = 1;\n for (int i = 1; i < 12; ++i) {\n f[i] = f[i - 1] * i;\n }\n set<string> seen;\n \n\n map<string, i... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n long long fact(long long n)\n {\n if(n==0)return 1;\n long long ans=1;\n for(long long i=1;i<=n;i++)\n {\n ans*=i;\n\n }\n return ans;\n }\n\n long long permute(string &nums,unordered_set<string>&s)\n {\n vector<long long>coun... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n long long pw10[10] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000};\n map<vector<int>, bool> good;\n\n void rec(int n, int k, int rem, int ready, vector<int> &cnt) {\n if (ready == n) {\n if (!rem) {\n good[... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n\nclass Solution {\npublic:\n static constexpr array<long long,11>Fact={1,1,2,6,24,120,720,5040,40320,362880,3628800};\n long long countGoodIntegers(int n,int k)\n {\n vector<long long>pali_recur;\n if(n==0)return 0;\n int sza=(n... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n int cnt[10];\n int tot;\n int md;\n long long ans;\n long long C[12][12];\n int odd = 0;\n bool check() {\n vector<int>v;\n for (int i = 0 ; i < 10 ; i++) {\n for (int j = 0 ; j < cnt[i] ; j++) {\n v.push_back(i);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "class Solution {\npublic:\n string p;\n using ll = long long;\n ll ans= 0;\n long long countGoodIntegers(int n, int k) {\n p = string(n,'0');\n genpal(0,n-1,k,n);\n return ans;\n }\n unordered_set<string> vis;\n void genpal(int l, int r, int k, int n){\n if ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 0 | {
"code": "\nclass Solution {\npublic:\n long long res=0;\n long long fact(int x) {\n long long ans=1;\n for(int i=1; i<=x; i++) {\n ans=ans*i;\n }\n return ans;\n }\n set<string> mp;\n void solve(int i, int n, string& s, int k) {\n if(i > (n-1)/2) {\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "#define ll long long\nconst int M = 1e9 + 7;\nconst int MAX_N = 500000;\n\nclass Solution {\npublic:\n unordered_map<string, bool> seen;\n \n void generateHalf(string &half, int pos, int n, vector<string> &result, bool oddLength, int& k) {\n if (pos >= n) {\n string fullPalindrom... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "\nclass Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n long long count = 0;\n int half = (n + 1) / 2;\n int start = (n == 1) ? 0 : 1;\n unordered_map<string, bool> done;\n \n for (int i = start; i < pow(10, half); i++) {\n string ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n int lo = pow(10, n/2-1);\n int hi = pow(10, n/2) - 1;\n long long ans = 0;\n if (n == 1)\n {\n for (int i = 1; i<10; i++)\n {\n if (i % k == 0)\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n\n unordered_set<string> d;\n long long ret=0;\n string s=\"\";\n int nn,kk;\n int f[11];\n\n void DFS(int l, int r){\n if (l<=r){\n for (char c=(l==0?'1':'0');c<='9';c++){\n s[l]=s[r]=c;\n DFS(l+1,r-1);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n\n unordered_set<string> d;\n long long ret=0;\n string s=\"\";\n int nn,kk;\n\n void DFS(int l, int r){\n if (l<=r){\n for (char c=(l==0?'1':'0');c<='9';c++){\n s[l]=s[r]=c;\n DFS(l+1,r-1);\n }\n }e... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n vector <int> fact (int n)\n {\n vector <int> ans (n+1, 1);\n for (int i = 2; i <= n; i++) ans[i] = i*ans[i-1];\n return ans;\n }\n \n long long countGoodIntegers(int n, int k)\n {\n int n2 = n/2 + n%2;\n int min = 1, max = pow... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n vector <int> fact (int n)\n {\n vector <int> ans (n+1, 1);\n for (int i = 2; i <= n; i++) ans[i] = i*ans[i-1];\n return ans;\n }\n \n long long countGoodIntegers(int n, int k)\n {\n int n2 = n/2 + n%2;\n int max = pow (10, n2)... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n#define ll long long\nunordered_map<string, int> mp;\n void f(ll &res, string &cur, int d, int &n, int &k) {\n if (d == 0) {\n string tmp = cur;\n int m = cur.size();\n for (int i = m-1; i >= 0; i--) {\n if (i == m-1) {\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n vector<long long> fact;\n map<string, bool> vis;\n long long ans = 0; // Declare global answer to track the result\n\n long long count(string s) {\n int n = s.length();\n if (n == 1)\n return 1;\n \n vector<int> fr(10);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\n unordered_set<string> st;\n long long createPalindrome(int half, int n) {\n string str = to_string(half);\n string rev = string(str.rbegin(), str.rend());\n if (n % 2 != 0) {\n rev = rev.substr(1);\n }\n return stoll(str + rev);\n }\... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n map<vector<int>,bool> mp;\n \n long long factorial(long x){\n if(x==0)\n return 1;\n return factorial(x-1)*x;\n }\n long long perms(long num){\n vector<int> cnt(10,0);\n int tot=0;\n while(num!=0){\n cnt[num... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n using ll = long long;\n vector<ll> fact;\n\n Solution() {\n fact.resize(12);\n fact[0] = 1;\n for(ll i = 1; i < 12; i++)\n fact[i] = fact[i - 1]*i;\n }\n\n ll ncr(ll n, ll r) {\n ll den = fact[n - r]*fact[r];\n return ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n void generate(int ind, string s, int& n, int& k, set<vector<int>>& oset){\n if(n%2 && ind>n/2){\n for(int i = ind-2;i>=0;i--){\n s.push_back(s[i]);\n }\n long long num = stoll(s);\n if(num%k==0){\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "using ll = long long;\n\nclass Solution {\nprivate:\n ll fac[12];\npublic:\n Solution(){\n fac[0] = fac[1] = 1;\n for(ll i=2; i<12; i++) fac[i] = fac[i-1] * i;\n }\n\n ll countGoodIntegers(int n, int k) {\n vector<ll> halfSizeList = getHalfSizeNumbers(n);\n vector<ll... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "using ll = long long;\n\nclass Solution {\nprivate:\n ll fac[12];\npublic:\n Solution(){\n fac[0] = fac[1] = 1;\n for(ll i=2; i<12; i++) fac[i] = fac[i-1] * i;\n }\n\n ll countGoodIntegers(int n, int k) {\n vector<ll> halfSizeList = getHalfSizeNumbers(n);\n vector<ll... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n if(n == 1){\n return 9 / k;\n }\n vector<long long> f(11, 1);\n for(int i = 1; i <= 10; i++) f[i] = f[i - 1] * i;\n set<vector<int>> st;\n auto calc = [&](vector<int> a){\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n\n struct node{\n struct node *next[11];\n } Node;\n\n struct node head;\n\n void add(){\n struct node *p=&head;\n for (int i=0;i<10;i++){\n if (!p->next[b[i]]) p->next[b[i]]=new node();\n p=p->next[b[i]];\n }\n }\n... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\nvector<long long> generatePalindromicNumbers(int n) {\n vector<long long> palindromes;\n int half_len = (n + 1) / 2;\n long long start = pow(10, half_len - 1);\n long long end = pow(10, half_len) - 1;\n\n for (long long i = start; i <= end; ++i) {\n long lon... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n map<vector<int>,int> lookup;\n long long result = 0;\n long long getNum(vector<int> &num){\n long long res = 0;\n long long tenPow = 1;\n for(int i=num.size()-1;i>=0;i--){\n res+=(num[i])*tenPow;\n tenPow*=10;\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n vector<string> palindromes(int d,int k)\n {\n vector<string> ans;\n \n int t = (d + 1) / 2;\n\n long long smaller = pow(10, t - 1); \n long long largest = pow(10, t) - 1;\n string w = \"\";\n for (long long i = smaller; i <= ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\nprivate:\n long long* factorial;\n\npublic:\n Solution() {\n factorial =\n new long long[11]{1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800};\n }\n\n ~Solution() { delete[] this->factorial; }\n\n pair<long long, long long> findPermutations(long lon... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "using ll=long long;\n\nclass Solution {\npublic:\n ll fact[11];\n unordered_map<string,int>vis;\n // ll getTotalPer(string &s){\n // int n=s.size();\n // ll total=fact[n];\n // vector<int>freq(10,0);\n \n \n // for(int i=0;i<n;i++){\n // freq[s[i... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 1 | {
"code": "class Solution {\npublic:\n long long ans;\n vector<long long> fact;\n unordered_map<string, int> vis;\n long long count(string& s) {\n vector<long long> fr(10, 0);\n\n long long n = s.length();\n\n if (n == 1)\n return 1;\n\n for (int i = 0; i < s.length(... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nclass Solution {\n public:\n vector<long long> generate(int n, int k) {\n vector<long long> pos;\n if (n == 0) return pos;\n long long start = pow(10, (n + 1) / 2 - 1);\n long long end = pow(10, (n + 1) / 2) - 1;\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "\n\nclass Solution\n{\npublic:\n long long countGoodIntegers(int n, int k)\n {\n long long fact[11];\n fact[0] = 1;\n for (int i = 1; i <= 10; i++)\n {\n fact[i] = fact[i - 1] * i;\n }\n if (n == 0)\n {\n return 0;\n }\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n vector <int> fact (int n)\n {\n vector <int> ans (n+1, 1);\n for (int i = 2; i <= n; i++) ans[i] = i*ans[i-1];\n return ans;\n }\n \n long long countGoodIntegers(int n, int k)\n {\n int n2 = n/2 + n%2;\n int max = pow (10, n2)... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n vector <int> fact (int n)\n {\n vector <int> ans (n+1, 1);\n for (int i = 2; i <= n; i++) ans[i] = i*ans[i-1];\n return ans;\n }\n \n long long countGoodIntegers(int n, int k)\n {\n int n2 = n/2 + n%2;\n int max = pow (10, n2)... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n vector<long long> pow(10, 1);\n vector<long long> fact(11, 1);\n for(int i = 1; i < 10; ++i) pow[i] = 1LL * 10 * pow[i-1];\n for(int i = 1; i <= 10; ++i) fact[i] = 1LL * i * fact[i-1];\n int end ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n \n long long factorial[12];\n \n int N, K;\n \n bool Valid(vector<int>& counter) {\n if (counter[0] == 0 || counter[0] % 2) return true;\n for (int idx = 1; idx < 10; ++idx) {\n if (counter[idx] && counter[idx] % 2 == 0) {\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n long long factorial(int n) {\n long long res = 1;\n for (int i = 2; i <= n; ++i)\n res *= i;\n return res;\n }\n // int pow(int k){\n // int c=1;\n // while(k>0){\n // c = c*10;\n // k--;\n // }\... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define ll long long\n\nclass Solution\n{\npublic:\n ll factorial[12];\n\n ll count_ways(vector<int> counts, int n)\n {\n ll total = 0;\n for (int d = 1; d <= 9; d++)\n {\n if (counts[d] == 0)\n continue;\n vector<int> temp = counts;\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define MAX_DIGITS 11\n#define ll long long\n#define vi std::vector<int>\n#define vll std::vector<ll>\n\nclass Solution {\npublic:\n ll factorialArr[MAX_DIGITS];\n \n Solution() {\n factorialArr[0] = 1;\n for (int i = 1; i < MAX_DIGITS; i++) {\n for(int i = 0; i<1; i++){in... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define ll long long\nclass Solution {\npublic:\nll ncr(ll a,ll b){\n ll ans=1;\n for(ll i=b+1;i<=a;i++)ans*=i;\n for(ll i=1;i<=a-b;i++)ans/=i;\n return ans;\n}\nll calc_bgd(vector<ll>fr){\n vector<ll>v;\n ll sum=0;\n ll ans=1;\n for(ll it:fr)if(it)v.push_back(it),sum+=it;\n for(... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define ll long long\n#define ld long double\nclass Solution {\n ll ans;\n vector<ll> fact;\n unordered_map<string, int> vis; // visited map\n\n string genpal(ll num, ll val) // generating palindrome corresponding to the first half generated.\n {\n string s = to_string(num);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n long long ans;\n\n vector<long long> factorials;\n unordered_map<string, int> vis;\n\n // Generate Palindrome Corresponding To The Left Part.\n // 123 -> 12321.\n // 21 -> 2112.\n\n string generatePalindrome(long long num, long long left) {\n\n string... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define ll long long int\n#define PB push_back\n\nll check(ll val, int bad) {\n ll temp = val;\n while(temp) {\n ll now = temp % 10;\n temp /= 10;\n if(bad) {\n bad = 0; continue;\n }\n val = val * 10 + now;\n }\n return val;\n}\nll sorted(ll val) {... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n\nclass Solution {\npublic:\n vector<long long> factorial; // Store factorial values for efficient computation\n\n Solution() {\n factorial.resize(11, 1);\n // Precompute factorial values\n for (int i = 1; i <= 10; ++i) {\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define PI (3.141592653589)\n#define M 1000000007\n#define pb push_back\n#define f first\n#define s second\n#define rep(i,j) for(int i = 0; i<j; i++)\n#define rrep(i,j) for(int i = j; i>=0; i--)\n#define all(x) x.begin(), x.end()\n#define out(x) cout << x... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define ll long long int\n#define PB push_back\n\nll check(ll val, int bad) {\n ll temp = val;\n while (temp) {\n ll now = temp % 10;\n temp /= 10;\n if (bad) {\n bad = 0;\n continue;\n }\n val = val * 10 + now;\n }\n return val;\n}\nll s... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "long long binom[11][11];\nclass Solution {\n long long nCr(long long n, long long r) {\n if(binom[n][r] != -1) return binom[n][r];\n long long& res = binom[n][r] = 0;\n if(r == 0 or n == r) return res = 1;\n if(r > n - r) return res = nCr(n, n - r);\n return res = nCr(... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "long long binom[11][11];\nclass Solution {\n long long nCr(long long n, long long r) {\n if(binom[n][r] != -1) return binom[n][r];\n long long& res = binom[n][r] = 0;\n if(r == 0 or n == r) return res = 1;\n if(r > n - r) return res = nCr(n, n - r);\n return res = nCr(... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n\n long long ans = 0, fact[11], currAnsWithZero, currAnsWithoutZero;\n vector<int> numCnt;\n set<vector<int> > s;\n\n void calcFact(int ind, int n){\n\n fact[0] = 1;\n fact[1] = 1;\n\n for(int i = 2;i<=n;i++)\n fact[i] = fact[i - 1] * i... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n vector<long long> palindromeList = generatePalindromes(n);\n set<vector<int>> uniqueDigitFreq;\n\n for (long long palindrome : palindromeList) {\n if (palindrome % k == 0) {\n uniqueD... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n\nclass Solution {\npublic:\n long long factorialCache[11];\n \n Solution() {\n precomputeFactorials();\n }\n \n long long countGoodIntegers(int n, int k) {\n vector<long long> palindromes = generateAllPalindromes(n);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\nvector<long long> a; \npublic:\n Solution() {\n a.resize(11);\n a[0] = 1;\n for (int b = 1; b <= 10; b++) {\n a[b] = a[b - 1] * b;\n }\n }\n\n vector<long long> generatePalindromes(int n) {\n vector<long long> c;\n if (n == 0)... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n#define vi vector<int>\n#define vll vector<ll>\n#define pb push_back\n\nclass Solution {\npublic:\n \n vll cF(int mx) {\n vll F(mx + 1, 1);\n for (int i = 1; i <= mx; i++) F[i] = F[i - 1] * i;\n return F;\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n\nclass Solution {\npublic:\n \n long long fact[11] = {1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800};\n\n long long countGoodIntegers(int n, int k) {\n vector<long long> pals;\n if (n==0) return 0;\n\n int half = (n+1)/... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "#define ll long long\nint mod = 1e9+7;\n\nclass Solution {\nprivate:\n ll fact[11];\n vector<ll> palindromes;\n void compute() {\n fact[0] = 1;\n for(int i=1;i<=10;i++) {\n fact[i] = fact[i-1] * i;\n }\n }\n \n void generatePalindromes(int n) {\n int h... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 2 | {
"code": "class Solution {\npublic:\n long long rickFactorials[11];\n\n Solution() { initializeFactorials(); }\n\n void initializeFactorials() {\n rickFactorials[0] = 1;\n int mortyI = 1;\n do {\n rickFactorials[mortyI] = rickFactorials[mortyI - 1] * mortyI;\n mort... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\n vector< vector<int>> counts;\n set<map<int, int>> s;\n map<int, int> curr;\n vector<long long> fact;\n int k, n;\n\n void fillCurr(int i = 0, int value = 0) {\n if(i == counts.size()) {\n if(value == 0) s.insert(curr);\n } else for(int digit = 0... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n vector<long long> fun(int n){\n vector<long long> ans;\n int m = (n+1)/2;\n for(int i = pow(10,m-1); i<=pow(10,m)-1; i++){\n string a = to_string(i);\n string res = \"\";\n if(n%2){\n int M = a.size();\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n \n int fac(long long n) {\n long long res = 1;\n while(n > 0) {\n res *= n;\n n -= 1;\n }\n return res;\n }\n \n int rearrangements(string &s) {\n unordered_map<int, int> m;\n for(auto &c: s) {\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n \n#define ll long long \n void func(string sh,string sp){\n int n=sh.size() , m=sp.size();\n n=n+m;\n }\n vector<ll> gP(int l) {\n vector<ll> p;\n if (l == 0) return p;\n\n int hL = (l + 1) / 2;\n ll s = pow(10, hL - 1);\n... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n if (n == 1) {\n return 9 / k;\n }\n long r = pow(10, n / 2 - 1), m = n % 2 ? 0 : -1, s = pow(10, (n + 1) / 2); // 1, 1, 10 ; 10 100 100;\n long h = r * 10;\n long res = 0;\n ini... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n if (n == 1) {\n return 9 / k;\n }\n long r = pow(10, n / 2 - 1), m = n % 2 ? 0 : -1, s = pow(10, (n + 1) / 2); // 1, 1, 10 ; 10 100 100;\n long h = r * 10;\n long res = 0;\n ini... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "using ll = long long;\nclass Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n vector<ll>fact(11,1);\n for(ll i =1;i<=10;++i)fact[i]=i*fact[i-1];\n ll ans = 0;\n set<long long>s;\n ll lo = pow(10,n/2 + n%2-1);\n ll hi = pow(10,n/2+n%2);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n vector<long long> factorials = computeFactorials();\n vector<long long> palindromes = generatePalindromes(n);\n\n vector<long long> valid_palindromes;\n for (auto num : palindromes) {\n if (n... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\n\npublic:\n long long countGoodIntegers(int n, int k) {\n\n long long fact[11];\n fact[0] = 1;\n for(int i=1;i<11;i++) {\n fact[i] = fact[i-1]*i;\n }\n\n int hf = ceil((double)n/2)-1;\n int l = pow(10, hf);\n int r = pow(10, h... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic: \n set<string>st;\n long long fact(long long int n,vector<int>&factorial)\n {\n if(n==1||n==0)\n {\n return 1;\n }\n return factorial[n]=fact(n-1,factorial)*n;\n }\n long long f(int i,int size,int k,long long curr,vector<int>&f... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n if (n == 1) {\n long long res = 0;\n for (int i = 1; i <= 9; ++i) {\n if (i % k == 0) {\n ++res;\n }\n }\n return res;\n }\... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n // generate each possible palindrom (n / 2)\n // check if it's divisble by k\n // count the number of permutations without leading or trailing zeroes\n\n set<vector<int>> found;\n int d = (n + 1)... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "typedef long long ll;\nll ans = 0;\nset<vector<ll>> done;\nclass Solution {\npublic:\n ll Calc_Num(ll num, vector<ll>& fact) {\n vector<ll> cnt(10, 0);\n ll n = num;\n ll sz = 0;\n while (n) {\n cnt[n % 10]++;\n n /= 10;\n sz++;\n }\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n void f(int i, long long num, int n, unordered_set<long long>& st) {\n if (i > n) {\n st.insert(num);\n return;\n }\n\n for (int k = 0; k <= 9; k++) {\n if (num==0 && k==0) continue;\n int newNum = num * 10 + k;\... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n \n void rec(vector<int> c,int i,int n,int d,int k,vector<int>& p10,set<vector<int>>& cnt,int rem = 0){\n if(i == d){\n if(rem == 0){\n cnt.insert(c);\n } \n\n return;\n }\n \n int l = i;\n int r ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long fact(long long n) {\n if (n == 0) {\n return 1;\n }\n return n * fact(n-1);\n }\n long long nChoosek(long long n, long long k)\n {\n if (k > n) return 0;\n if (k * 2 > n) k = n-k;\n if (k == 0) return 1;\... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n set<string>st;\n long long fact(int n){\n if(n == 0) return 1;\n int ans = 1;\n while(n >= 1){\n ans *= n;\n n--;\n }\n return ans;\n }\n long long int solve(int n ,int k , string &curr){\n long long int... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n\n int fact[11] = {1,1,2,6,24,120, 720, 5040, 40320, 362880, 3628800};\n long long countGoodIntegers(int n, int k) {\n if(n == 1)return 9/k;\n map<long long,int> mp;\n long long ans=0;\n int len = n/2;\n int start = 1;\n for(int i =... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long int power(long long int a, int b){\n \n for(int i=0; i<b; i++){\n a*= 10;\n }\n return a;\n }\n long long int allPossible(long long int num, vector<long long int> &factorial, int n, map<string, bool> &hashedValues){\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n \nstd::vector<std::string> generateAllPalindromes(int n) {\n std::vector<std::string> palindromes;\n \n // If n is 1, generate single-digit palindromes\n if (n == 1) {\n for (int i = 0; i <= 9; ++i) {\n palindromes.push_back(std::to_string(i));\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n long long countGoodIntegers(int n, int k) {\n using ll = long long;\n vector<string> pal;\n string s = \"\";\n auto gen = [&](auto& self, int i) -> void{\n if(i == (n+1)/2){\n string rev = s;\n if(n&1) rev.p... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\nlong long ans = 0;\nunordered_map<string, bool> used;\nint factorial[15];\n\nbool check(string s, int k) {\n long long cntr = 0;\n for (int i = 0; i < s.size(); i++){\n cntr += int(s[i] - '0') * 1ll;\n if (i != s.size() - 1) {\n cntr *= 10;\n }\n }... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "#include <iostream>\n#include <vector>\n#include <string>\n#include <set>\n#include <unordered_map>\n#include <algorithm>\n#include <map>\n\nusing namespace std;\n\nclass Solution {\npublic:\n // Helper function to generate all palindromes recursively\n void generatePalindromesRecursively(int pos, in... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n\nclass Solution {\npublic:\n ll factorial[11];\n\n // Function to precompute factorials up to 10\n void precomputeFactorials() {\n factorial[0] = 1;\n for (int i = 1; i <= 10; i++) {\n factorial[i] = ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n vector<long long> factorial;\n long long convertTono(vector<int> temp){\n long long no=0;\n for(auto t:temp){\n no=no*10+t;\n }\n return no;\n }\n void fact(int n){\n long long res=1;\n factorial.resize(n + 1, 1);\... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n const int MOD = 1e9 + 7;\n\n long long factorial(int n) {\n return (n <= 1) ? 1 : n * factorial(n - 1);\n }\n\n long long possi(long long n) {\n string numStr = to_string(n);\n int x = numStr.length();\n\n vector<int> freq(10, 0);\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\n long long ans = 0;\n set<map<int, int>> vis;\nprivate:\n void generate_palindrome(vector<int>& num, int left, int right, int k, int n){\n if(left > right){\n long long pali = vectorToNumber(num);\n\n if((pali % k) == 0){\n map<int, int... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "//typedef map map;\n//vector<long long>factStore(11,-1);\n\nclass Solution {\npublic:\n vector<long long>factStore;\n Solution(){\n factStore.resize(11,-1);\n }\n long long fact(int n){\n if(n==1)\n return 1;\n if(factStore[n]!=-1)\n return factStore[n];\n ... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "class Solution {\npublic:\n typedef long long ll;\n\n set<ll> goodNumbers;\n\nll factorial(int n) {\n if (n <= 1) return 1;\n ll result = 1;\n for (int i = 2; i <= n; ++i) {\n result *= i;\n }\n return result;\n}\n\n// Function to calculate the number of valid permutations\nll c... |
3,548 | <p>You are given two <strong>positive</strong> integers <code>n</code> and <code>k</code>.</p>
<p>An integer <code>x</code> is called <strong>k-palindromic</strong> if:</p>
<ul>
<li><code>x</code> is a <span data-keyword="palindrome-integer">palindrome</span>.</li>
<li><code>x</code> is divisible by <code>k</code>.... | 3 | {
"code": "#include <vector>\n#include <string>\n#include <algorithm>\n#include <unordered_set>\n#include <unordered_map>\n#include <iostream>\n\nusing namespace std;\n\nconst int MOD = 1e9 + 7;\n\nclass Solution {\npublic:\n vector<long long> factorial;\n\n void computeFactorials(int n) {\n factorial.re... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.