Happy People✅
ABInBev

#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

#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✅

vector<int> solve(vector<int>& arr) {
    int n = arr[1];
    int m = arr[2];
    vector<int> img(n * m);
    for (int i = 0; i < n * m; i++) {
        img[i] = arr[i + 3];
    }
    vector<int> v(m * n);
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            v[i * n + j] = img[(n - j - 1) * m + i];
        }
    }
    return v;
}

C++✅

int solve(vector<int>& arr1, vector<int>& arr2, int d) {
    int c = 0;
    for (int i = 0; i < arr1.size(); i++) {
        bool found = false;
        for (int j = 0; j < arr2.size(); j++) {
            if (abs(arr1[i] - arr2[j]) <= d) {
                found = true;
                break;
            }
        }
        if (!found) {
            c++;
        }
    }
    return c;
}

Find Comparator value ✅

public static String solution(String[] paths) {
        String[] simplified = new String[paths.length];
        for (int i = 0; i < paths.length; i++) {
            simplified[i] = simplify(paths[i]);
        }
        String result = "";
        for (int i = 0; i < simplified.length; i++) {
            if (i == 0) {
                result = simplified[i];
            } else {
                result = commonSuffix(result, simplified[i]);
            }
        }
        return result;
    }

    public static String simplify(String path) {
        String[] parts = path.split("/");
        Stack<String> stack = new Stack<>();
        for (String part : parts) {
            if (part.equals("..")) {
                if (!stack.isEmpty()) {
                    stack.pop();
                }
            } else if (!part.equals(".")) {
                stack.push(part);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (String part : stack) {
            sb.append("/");
            sb.append(part);
        }
        return sb.toString();
    }

    public static String commonSuffix(String path1, String path2) {
        String[] parts1 = path1.split("/");
        String[] parts2 = path2.split("/");
        int i = parts1.length - 1;
        int j = parts2.length - 1;
        while (i >= 0 && j >= 0 && parts1[i].equals(parts2[j])) {
            i--;
            j--;
        }
        StringBuilder sb = new StringBuilder();
        for (int k = i + 1; k < parts1.length; k++) {
            sb.append("/");
            sb.append(parts1[k]);
        }
        return sb.toString();

Company : Terabyte Innovations

Position : SDE Intern - 6 Months

Work Location : Remote

https://www.linkedin.com/posts/terabyte-innovations_softwaredeveloper-internshipopportunity-terabyteinnovations-activity-7139517802079576064-RyGk?utm_source=share&utm_medium=member_desktop

int solve(vector<int>& points) {
    sort(points.begin(), points.end(), greater<int>());
    int p1 = 0, p2 = 0;
    for(int i = 0; i < points.size(); i++) {
        if(i % 2 == 0) {
            p1 += points[i];
        } else {
            p2 += points[i];
        }
    }
    return p1 - p2;
}

Amazon ✅