Off Campus Job Update
Ir al canal en Telegram
500+ Placement & Competitive Exam Materials 75+ Companies Materials 100+ JOB Updates in a Month 🚀DM for Promotion @Wren_0 🚀Placement Updates: @offcampusjobs_0 🌟 Placment Material: @placement_materials0
Mostrar más
Red:8 266
Suscriptores
Sin datos24 horas
Sin datos7 días
-12430 días
Archivo de publicaciones
ADMIN Giving Daily Job Updates
In Reels
Join Us to get instant job Updates ❤️
🚀🚀
https://www.instagram.com/invites/contact/?i=hw4ru7whop04&utm_content=26zggmd
c = 0
s = input().split()
for i in s:
if i[0].isdigit():
c += 1
print(c)
Count words
🔗 Telegram:https://t.me/Coding_solution_0
#include<iostream>
using namespace std;
int main()
{
int n,i;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
{
cin>>arr[i];
}
int len = n-1, curr = -1, next = 0, ans = 0;
for (int i = 0; next < len; i++)
{
if (i > curr)
{ ans++, curr = next;
next = max(next, arr[i] + i);
}
}
cout<<ans;
}
C++
Bicycle Racing
🔗 Telegram:- https://t.me/Coding_solution_0
Join this and Turn On Your Notification to get instant Job Updates
🚀🚀
https://t.me/offcampusjobs_0
Join this and Turn On Your Notification to get instant Job Updates
🚀🚀
https://t.me/offcampusjobs_0
Royal Cyber Off-Campus | 🎖2020/21/22 Batch | 💰3.5LPA
✅ Degree - BE BCA BSc ME MCA MSc
Apply Link - https://bit.ly/3J7IvbT
Telegram - https://t.me/offcampusjobs_0
Wipro Mega Off-Campus Drive | 2020-22 Batch | BE BCA Mtech
Elite [3.5LPA] - bit.ly/3pboN75
Elite NTH [3.5LPA] - bit.ly/32dBXHH
WILP [2.5LPA] - bit.ly/33zDp7S
STAR [11LPA] - bit.ly/32l6lQh
TURBO [6.5LPA] - bit.ly/32iyJCW
✅ Share post in ur college Whatsapp grps
Telegram - https://t.me/offcampusjobs_0
input1 = str(input1)
n = len(input1)
ans = 0
for i in range(0, n) :
v = ans * 10 + (int)(input1[i])
ans = v % 11
return ans
Remainder mod 11
Bob and Numbers
n = int(input())
a = list(map(int,input().split()))
c = 0
for i in range(n-1):
for j in range(i+1:n):
s1 = sum(list(map(int,bin(i)[2:].split())))
s2 = sum(list(map(int,bin(j)[2:].split())))
if s1 == s2:
c += 1
print(c)
Apple Orchard
n = int(input())
l = list(map(int,input().split()))
res = min(l)*n
print(res)
for(int i=0;i<n;i++)
{
a[i]=Integer.parseInt(k.nextLine());
}
for(int i=0;i<n;i++)
{
b[i]=Integer.parseInt(k.nextLine());
}int sum=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n-1;j++)
{
if(b[i]==b[j])
{
int c=Math.max(a[i],a[j]);
sum=sum+c;
}
else
sum=sum+a[i];
}
}
return (sum);
Harold and his homework Code
Telegram -https://t.me/Coding_solution_0
Wipro Mega Off-Campus Drive | 2020-22 Batch | BE BCA Mtech
Elite [3.5LPA] - bit.ly/3pboN75
Elite NTH [3.5LPA] - bit.ly/32dBXHH
WILP [2.5LPA] - bit.ly/33zDp7S
STAR [11LPA] - bit.ly/32l6lQh
TURBO [6.5LPA] - bit.ly/32iyJCW
✅ Share post in ur college Whatsapp grps
Telegram - https://t.me/offcampusjobs_0
Tips for an Interview 🚀
Ask Questions While you are in interview ✅
https://youtu.be/Su8QXFdSXlY
