𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

🎯 NTrust Infotech Walk-in Drive 2023 for Trainee | 11 to 15 December 2023 🎯

Job Role : Trainee
Qualification : B.Com/BA/BCA/B.Sc/BBM/BBA
Batch : : 2023
Salary : Rs. 2.15 Lakhs per Annum

342 viewsDushyant, 16:07

Happy People✅
ABInBev

372 viewsDushyant, edited 16:13

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Happy People✅ ABInBev

366 viewsDushyant, 16:14

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#include <bits/stdc++.h>
using namespace std;

const int MX = 1e6 + 5;
int mu[MX], pre[MX], cnt[MX];

void Sieve() {
    vector<int> prime;
    vector<bool> isComp(MX, false);
    mu[1] = 1;
    for (int i = 2; i < MX; ++i) {
        if (!isComp[i]) {
            prime.push_back(i);
            mu[i] = -1;
        }
        for (int j = 0; j < prime.size() && i * prime[j] < MX; ++j) {
            isComp[i * prime[j]] = true;
            if (i % prime[j] == 0) {
                mu[i * prime[j]] = 0;
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
            }
        }
    }
    for (int i = 1; i < MX; ++i) {
        pre[i] = pre[i - 1] + mu[i];
    }
}

long long KGCD(int N, int K) {
    if (K == 0) return 0;
    N /= K;
    long long res = 0;
    for (int l = 1, r; l <= N; l = r + 1) {
        r = N / (N / l);
        res += 1LL * (N / l) * (N / l) * (pre[r] - pre[l - 1]);
    }
    return res;
}

int main() {
    Sieve();
    int T;
    cin >> T;
    while (T--) {
        int N, K;
        cin >> N >> K;
        cout << KGCD(N, K) << "\n";
    }
    return 0;
}

GCD Chegg✅
Source :Hola

370 viewsDushyant, 16:19

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#include<bits/stdc++.h>
using namespace std;

vector<long long> solve(long long m1, long long m2) {
    vector<long long> res(3);
    for (long long i = 1; ; ++i) {
        if (i <= m1 && (i > m2 || m1 >= m2)) {
            m1 -= i;
        } else if (i <= m2 && (i > m1 || m2 > m1)) {
            m2 -= i;
        } else {
            res[0] = i;
            res[1] = m1;
            res[2] = m2;
            break;
        }
    }
    return res;
}

int main() {
    long long m1, m2;
    cin >> m1 >> m2;
    vector<long long> res = solve(m1, m2);
    cout << res[0] << " " << res[1] << " " << res[2] << "\n";
    return 0;
}

Computer Crash✅

400 viewsDushyant, 16:28

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

from collections import Counter

def solve(nums, k):
    c = Counter(map(lambda x: x.bit_count(), set(nums)))
    return sum(c[k1] * c[k2] for k1 in c for k2 in c if k1 + k2 >= k)

t = int(input())
for _ in range(t):
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    print (solve(arr, k))

Awesome Pairs ✅

394 viewsDushyant, 16:49

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

#include<bits/stdc++.h>
using namespace std;

int solve(string s, int k) {
    int n = s.size();
    int count[26] = {0};
    int ml = 0;
    int mc = 0;
    int st = 0;

    for (int e = 0; e < n; e++) {
        count[s[e] - 'a']++;
        mc = max(mc, count[s[e] - 'a']);

        if ((e - st + 1) - mc > k) {
            count[s[st] - 'a']--;
            st++;
        }

        ml = max(ml, e - st + 1);
    }

    return ml+2;
}

C++✅

371 viewsDushyant, 18:01

About

Blog

Apps

Platform