orderID_str = str(orderID)
   
    product = 1
    for digit in orderID_str:
        product *= int(digit)
   
    return product

numOfCust = int(input())
bill = list(map(int, input().split()))
count = 0
for i in range(numOfCust):
    if int(bill[i]  0.5) == bill[i]  0.5:
        count += 1
print(count)

base1 = float(input())
height1 = float(input())
base2 = float(input())
height2 = float(input())
area1 = (base1 * height1) / 2
area2 = (base2 * height2) / 2
if area1 > area2:
    print("%.1f" % area1)
else:
    print("%.1f" % area2)

Only 2024 Batch

Saama Technologies is Hiring !!

Role: Software Engineer (UI Developer)

Expected CTC: 6-12 Lpa

Location: Pune

Apply here- https://jobs.jobvite.com/saama/job/oFeEofwF

🚀 Do you want to launch a career in Data Analytics in a top MNC right after college?🎯

Join our webinar to understand the Data Analytics domain, job opportunities and the skills needed as a recent graduate to crack a role from a highly experienced speaker.

📅 Save the date: Today at 04:00 PM IST 📅⏰

🎟️ Register for FREE (Limited seats available): https://bit.ly/3M6UA4l 🆓🎟️

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

int solve(int arr[], int n){

  int pos[n], p = 0;

  for(int i=0;i<n;i++){
    if(arr[i] == 1){
      pos[p] = i + 1;
      p++;
    }
  }

  if(p == 0) return 0;

  int res = 1;
  for(int i=0;i<p-1;i++){
    res *= pos[i+1]-pos[i];
  }
  return res;
}

int main(){
  int n;
    cin >> n;

    int arr[n];
   
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
  cout<<solve(arr, n);
  return 0;
}

One Block ✅

Company Name: Deloitte

Role: Analyst Trainee

Batch eligible: 2024 grads only

Apply: https://bit.ly/46XiJlR

Company Name: MAQ Software

Role: Software Engineer

Batch eligible: 2021, 2022 and 2023 grads

Apply: https://docs.google.com/forms/d/e/1FAIpQLSdCCiiMtnExn7YYvUN-oZDKIURM75YirmnBryEZPLI1kbKaKA/viewform

Mercedes-Benz is Hiring

Role: Software Engineer- Fresher

Experience: 2023

Apply here-
https://jobs.mercedes-benz.com/en/software-engineer-84692-MER0002HDB

vector<int> counts(const vector<int>& ListA, const vector<int>& ListB) {
    int m = ListA.size();
    int n = ListB.size();
    vector<int> ans;
    vector<int> sortedListA = ListA;
    sort(sortedListA.begin(), sortedListA.end());
    for (int i = 0; i < n; i++) {
        auto it = upper_bound(sortedListA.begin(), sortedListA.end(), ListB[i]);
        int cnt = it - sortedListA.begin();
        ans.push_back(cnt);
    }

    return ans;
}

Twillo ✅