๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.7K 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
L&T Technology Services - B.Tech Hiring โ€“ 2023 pass out batch.

Please register using the below link:

https://forms.office.com/pages/responsepage.aspx?id=eDMbMYqOXkujP-gKPYumCl54ACWF32ZNsqKK3NlTPy1UQk1ESDE3NUIzRkdGOVowNjdZVEg2QTZYQS4u

** Please note that applicants that do not fill the above form will not be considered.
Registration End Date: 6:00PM, 19th October 2023

Position Details:
- Hiring for candidates with specialization in Instrumentation and Control & Civil.

Year of Pass out โ€“ 2023.
Joining โ€“ Quarterly Joining
Type of Offer โ€“ Full time
Compensation - As per Industry Standards

**Please note that only candidates who have completed B.Tech will be considered for the further processes.
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)
๐Ÿš€ 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 ๐Ÿ†“๐ŸŽŸ๏ธ
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
#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 โœ