#include <bits/stdc++.h>
  using namespace std;
  long long dfs(long long src,long long par,vector<long long> adj[],vector<long long> &sum,vector<long long> &depth,vector<long long> &a,vector<long long> &c)
  {
    if(a[src]!=0)
    {
      depth[src]=0;
      sum[src]=a[src];
      return a[src];
    }
    long long maxi=0;
    for(auto x:adj[src])
    {
      if(x!=par)
      {
        long long temp=dfs(x,src,adj,sum,depth,a,c);
        sum[src]+=(temp-depth[x]);
        depth[src]=depth[x]+1;
        maxi=max(maxi,temp);
      }
    }
    return (maxi + min(c[src],sum[src]-(maxi-depth[src])));
  }
  int main() {

    long long n;
    cin>>n;
    vector<long long> a(n+1);
    vector<long long> c(n+1);
   
    for(long long i=0;i<n;i++)
    cin>>a[i+1];
    for(long long i=0;i<n;i++)
    cin>>c[i+1];
   
    vector<long long> adj[n+1];
    for(long long i=1;i<n;i++)
    {
      long long u,v;
      cin>>u>>v;
     
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    vector<long long> sum(n+1,0);
    vector<long long> depth(n+1);
    cout<<dfs(1,0,adj,sum,depth,a,c);

    return 0;

  }

fruits on tree✅
Media. Net

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll M = 1e9+7 ;

int main() {

    ll n;cin>>n ;
    vector<ll> v(31) ;
    for(ll i = 1;i<=n;i++){
      ll x;cin>>x ;
      v[x]++ ;
    }
    vector<ll> p ;
    for(ll i = 2;i<=30;i++){
      bool ch = 1 ;
      for(ll j = 2;j*j<=i;j++){
        if(i%(j*j)==0)ch = 0 ;
      }
      if(ch)p.push_back(i) ;
    }
    ll one = 1 ;
    while(v[1]){
      one = one*2%M ;
      v[1]-- ;
    }
    n = p.size() ;
    ll ans = 0 ;
    for(ll i = 1;i<(1ll<<n);i++){
      ll pro = 1 ;
      ll tot = 1 ;
      bool ch = 1 ;
      
      for(ll j =0;j<n;j++){
        if((1ll<<j)&i){
          if(__gcd(pro,p[j])!=1){
            ch = 0 ;
            break;
          }
          pro = pro*p[j] ;
          tot = tot*v[p[j]]%M ;
        }
      }
      
      tot = tot*(one)%M ;
      if(ch){
        ans += tot ;
        ans %= M ;
      }
    }
    cout<<(ans+M)%M<<endl;
    

    return 0;

  }

  }
 

omega prime
media .net✅

from collections import deque
def timeOfBuffering(arrivalRate, packets):
    buffer = deque()
    current = 1
    time = 0

    for i in range(0, len(packets), arrivalRate):
        time += 1

        for j in range(i, min(i + arrivalRate, len(packets))):
            packet = packets[j]
            if packet != current:
                buffer.append(packet)

        if current in buffer:
            buffer.remove(current)
        elif current == packets[i]:
            pass
        else:
            return time

        current += 1

    return -1

Video Buffering ✅

def maxProfit(cost, x):
    ans = 0
    mod = 10 ** 9 + 7
    for i in range(len(cost) - 1, -1, -1):
        if cost[i] <= x:
            x -= cost[i]
            ans = (ans + pow(2, i, mod)) % mod
    return ans

Company Name : Coinbase
Role : SDE 1
Batch : 2023/2022 pssouts
Base salary : 26 Lakhs
CTC : 45-50 LPA
Link : https://www.linkedin.com/jobs/view/4078279139

Company: Stripe
Role: SWE Intern

Duration: 2 and 6 months
Batch: 2025, 2026
https://stripe.com/jobs/listing/software-engineer-intern/6109583?gh_src=73vnei

https://www.linkedin.com/posts/sarang-kulkarni-0a96651b6_hiring-internship-linkedin-activity-7264122791237443584-1ZK8?utm_source=share&utm_medium=member_desktop

2025 Batch Only

Front-end Developer (only for folks graduated in or before 2024) at POOLit • Delhi • Gurgaon • New Delhi • Remote (Work from Home) | Wellfound
https://wellfound.com/jobs/80848-front-end-developer-only-for-folks-graduated-in-or-before-2024

SEND US YOUR CV
RIYA.COLLINS@GRAYOPUS.COM

Company Name : Amazon
Role : Cloud Support Associate
Batch : 2024/2023 passouts

Link : https://www.amazon.jobs/en/jobs/2676989/cloud-support-associate

EY is hiring Associate Analyst

For 2022, 2023, 2024 grads
Location: Kochi

https://careers.ey.com/ey/job/Kochi-Associate-Analyst-KL-682303/1140385501/

📌PowerSchool is hiring!
Associate Technical Support Engineer

Location: Bengaluru
Experience: 0-2 years

💻Apply Link: https://careers3-powerschool.icims.com/jobs/8022/associate-technical-support-engineer/job

https://www.linkedin.com/posts/saaransh-mahipal_associate-technical-consultant-activity-7264284762888904704-XEbq?utm_source=share&utm_medium=member_desktop

Except (IT, COMP)

Edifecs hiring Associate Software Engineer

0-2 year experience

Apply Here :  http://jobs.jobvite.com/edifecs/job/o0Z8sfwj?jvst=Job%2520Board&jvsd=LinkedIn

Ideaforge Hiring !!
Role - sde 1
Exp - fresher

https://app.webbtree.com/company/ideaforge/jobs/engineer-i---perception-systems-2dea7a