๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.59K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
๐‚๐จ๐ฆ๐ฉ๐š๐ง๐ฒ ๐๐š๐ฆ๐ž: Innofield

๐‘๐จ๐ฅ๐ž: Software Engineer

๐๐š๐ญ๐œ๐ก ๐ž๐ฅ๐ข๐ ๐ข๐›๐ฅ๐ž: 2022 and 2023 grads

https://innofied.zohorecruit.in/jobs/Careers/31467000056712017/Freshers-Hiring---Software-Engineer?source=CareerSite
CQLsys Technologies is providing training for freshers for the following profiles:-

1) ๐Œ๐š๐ง๐ฎ๐š๐ฅ ๐“๐ž๐ฌ๐ญ๐ž๐ซ (๐๐€)

2) ๐ˆ๐Ž๐’ ๐ƒ๐ž๐ฏ๐ž๐ฅ๐จ๐ฉ๐ฆ๐ž๐ง๐ญ

๐๐ฎ๐š๐ฅ๐ข๐Ÿ๐ข๐œ๐š๐ญ๐ข๐จ๐ง ๐‘๐ž๐ช๐ฎ๐ข๐ซ๐ž๐:- BCA / MCA/ BE/ B.Tech (CS)

๐‚๐จ๐ฆ๐ฉ๐š๐ง๐ฒ: CQLsys Technologies (IT)

๐–๐จ๐ซ๐ค๐ข๐ง๐  ๐๐š๐ฒ๐ฌ: 5 days

๐‡๐จ๐ฎ๐ซ๐ฌ ๐จ๐Ÿ ๐ฐ๐จ๐ซ๐ค: 8 hours (Work from office)

๐‹๐จ๐œ๐š๐ญ๐ข๐จ๐ง: F-267, Mohali Phase 8B, Sector 74 Interested candidates can share their cv at- recruiter@cqlsys.co.uk
๐Ÿ‘1
int generate_D(long long A)
{
    int mod = 1000000007;
    int count = 0;
    vector<int> factors;
    for (int i = 2; i <= sqrt(A); i++)
    {
        while (A % i == 0)
        {
            factors.push_back(i);
            A /= i;
        }
    }
    if (A > 1)
    {
        factors.push_back(A);
    }

    int B = 1;
    vector<int> vec;
    for (int factor : factors)
    {
        if (find(vec.begin(), vec.end(), factor) == vec.end())
        {
            vec.push_back(factor);
            B *= factor;
        }
    }

    int C = 1;
    for (int i = 1; i <= sqrt(B); i++)
    {
        if (B % i == 0)
        {
            C *= i;
            if (i != B / i)
                C *= B / i;
        }
    }

    for (int i = 1; i <= sqrt(C); i++)
    {
        if (C % i == 0)
            count += (i != sqrt(C)) ? 2 : 1;
    }

    int D = count % mod;
    return D;
}

Converting numbers
Google Girl (Hackathon)
C++โœ…
int ans = INT_MIN;
    int index = 0;
    for (int i = 0; i < lenght; i++)
    {
        if (arr[i] > ans)
        {
            ans = arr[i];
            index = i;
        }
    }
    cout << ans << endl;
    cout << index;


C++
Accenture โœ…
int sumOfDigits(int num) {
    int sum = 0;
    while (num > 0) {
        sum += num % 10;
        num /= 10;
    }
    return sum;
}

int DifferenceSumOfDigits(int arr[], int n) {
    int f1 = 0;
    int f2 = 0;

    for (int i = 0; i < n; i++) {
        f1 += sumOfDigits(arr[i]);
        f2 += arr[i];
    }

    f1 *= 10;
    f1 -= f2;
    f1 %= 10;

    return f1;
}

C++
Accenture โœ