Forwarded from Off Campus job Updates- Placement Material
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
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
Forwarded from Off Campus job Updates- Placement Material
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
✅ Degree - BE BCA BSc ME MCA MSc
Apply Link - https://bit.ly/3J7IvbT
Telegram - https://t.me/offcampusjobs_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
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
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
s = input().split()
for i in s:
if i[0].isdigit():
c += 1
print(c)
Count words
🔗 Telegram:https://t.me/Coding_solution_0
Off Campus Job Update pinned «Are you looking for Daily Job 📣 Updates Join Our Telegram Group 🚀 https://t.me/offcampusjobs_0»
Forwarded from Off Campus Job Update