import sys
sys.setrecursionlimit(10**6)

def countVerticalPaths(costs, edge_nodes, from_lst, to_lst, k):
    children = [[] for _ in range(edge_nodes)]

    for u, v in zip(from_lst, to_lst):
        u -= 1
        v -= 1
        children[u].append(v)
        children[v].append(u)

    prefixes = [0] * k
    prefixes[0] = 1

    def g(n, s, p, result):
        curr = (s + costs[n]) % k
        result[0] += prefixes[curr]
        prefixes[curr] += 1

        for c in children[n]:
            if c != p:
                g(c, curr, n, result)

        prefixes[curr] -= 1

    result = [0]
    g(0, 0, -1, result)

    return result[0]

DTCC HackTree ✅

#include <vector>
using namespace std;

long long countSetBits(int number) {
    long long bitMask = 1, setBitsCount = 0;
    for (int bitPosition = 0; bitPosition < 32; bitPosition++) {
        long long quotient = number / (bitMask << (bitPosition + 1));
        long long remainder = number % (bitMask << (bitPosition + 1)) - (bitMask << bitPosition);
        setBitsCount += quotient * (bitMask << bitPosition);
        if (remainder > 0) setBitsCount += remainder;
        if (1 & (number >> bitPosition)) setBitsCount++;
    }
    return setBitsCount;
}

int solve(int targetCount) {
    if (targetCount == 0) return 1;
    int low = 1, high = 1e9 + 1;
    while (low < high) {
        int mid = (low + high) / 2;
        long long currentCount = countSetBits(mid);
        if (currentCount >= targetCount + 1) {
            high = mid;
        } else {
            low = mid + 1;
        }
    }
    return low;
}

vector<int> getValueAtIndices(const vector<int>& queries) {
    vector<int> results;
    for (int query : queries) {
        int result = solve(query);
        results.push_back(result);
    }
    return results;
}

DTCC female pass credits ✅

MERN stack intern (backend focus: NodeJS) to join us for 3 months starting 15th July.

- prior experience building projects on NodeJS
- Work from office in Gurgaon
- Rs. 10K monthly stipend

If this is you, please reach out to me at garima@sploot.tech

Company Name : Innovacer
Batch : 2023/2022 passouts
Role : Data Analyst

Skillset : majorly good at SQL

Link : https://boards.greenhouse.io/innovaccer/jobs/7269176002

Company: edtechcube
Location: N/A
Role: Frontend Developer
For Graduates: 2023, 2024

https://www.linkedin.com/posts/mohit-kumar-mahato-2b7423269_hiring-techjobs-frontenddeveloper-activity-7212328435078111232-5Y3J?utm_source=share&utm_medium=member_desktop

https://www.linkedin.com/posts/arnabdebnath07_were-hiring-product-designers-looking-activity-7212325301295439872-X4sH?utm_source=share&utm_medium=member_android


Apply Link Form :

https://docs.google.com/forms/d/e/1FAIpQLSfLSvtnw8PbVoCfRKKWd_0_qIT6EK5GlIFApS04aKE9TjvzFQ/viewform

Hiring for SDET - Intern & Full time At Cashfree Payments
Batch: 2023, 2024, 2025, 2026

https://docs.google.com/forms/d/e/1FAIpQLSetl8ZhAgiPQBYz-fChjTZHcm_DyKJcLisqvu7VAA9Ba8sZYQ/viewform

M.tech 2024 passout freshers opening at western digital

Qualifications
M.Tech in Electronics/Embedded Systems/Computer Science (2024 Passouts Only)


Apply at :https://smrtr.io/m5GpC

BlackBerry hiring Interns for multiple roles in Bengaluru.
🎓 Interested students (especially 2023 & 2024 graduates) please apply through this link 👉 https://lnkd.in/g2gk59Wm

- Paid internship
- Duration: 6-9 months
- Roles:
*Cloud backend engineer
*Associate cloud engineer
*Software development engineer in Test (SDET)

int dayofweek(int d, int m, int y)
{
    static int t[] = { 0, 3, 2, 5, 0, 3,

                       5, 1, 4, 6, 2, 4 };

    y -= m < 3;

    return ( y + y / 4 - y / 100 +

             y / 400 + t[m - 1] + d) % 7;
}

Prime Day of week ✅

#include <iostream>
#include <vector>
using namespace std;

struct T {
    int v;
    T* l;
    T* r;

    T(int val) : v(val), l(nullptr), r(nullptr) {}
};

class B {
public:
    T* r;

    B() : r(nullptr) {}

    void i(int val) {
        r = iR(r, val);
    }

    T* iR(T* r, int val) {
        if (r == nullptr) {
            r = new T(val);
            return r;
        }

        if (val < r->v) {
            r->l = iR(r->l, val);
        } else if (val > r->v) {
            r->r = iR(r->r, val);
        }

        return r;
    }
};

class BM {
public:
    T* m(T* n) {
        if (n == nullptr) {
            return n;
        }

        T* l = m(n->l);
        T* ri = m(n->r);

        n->l = ri;
        n->r = l;

        return n;
    }
};

class BT {
public:
    void p(T* n) {
        if (n == nullptr) {
            return;
        }
        cout << n->v << " ";
        p(n->l);
        p(n->r);
    }
};

int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }

    B t;
    for (int val : v) {
        t.i(val);
    }

    BM m;
    T* mr = m.m(t.r);
    BT tr;
    tr.p(mr);

    return 0;
}


// mirror tree c++

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    long sum = 0;

    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        sum += x;
        cout << sum - i << endl;
    }

    return 0;
}

//waiting time me try this