3. Vector k elementidan l elementigacha bo`lgan elementlarining o`rtacha qiymatidan hisoblansin

1-topshiriq
3.Vector k – elementidan l – elementigacha bo`lgan elementlarining o`rtacha qiymatidan hisoblansin

#include

#include
#include

using namespace std;

int main() {
vector nums = {10, 20, 30, 40, 50}; // Vector tuzish
int k = 1; // k elementi
int l = 3; // l elementi
// k chi elementdan l chi elementigacha bo`lgan elementlarining o`rtacha qiymatini hisoblash
double sum = 0;
int count = l - k + 1;
for(int i = k-1; i < l; i++) {
sum += nums[i];
}
double avg = sum / count;
cout << "K chi elementdan L chi elementigacha bo`lgan elementlarining o`rtacha qiymati: " << avg << endl;
return 0;
}

2-topshiriq
1. Vektorning eng katta va eng kichik elementlari o’rni almashtirilsin.
#include
using namespace std;

int main()

{
// vector yaratib olamiz
vector myVector;
//vectorga elementlar soni
int n;
cin>>n;
// vectorga elementlar qo'shib olamiz
int m;
for (int i = 0; i < n; i++) {
cin>>m;
myVector.push_back(m);
}
int min = 0;
for (int i = 0; i < myVector.size(); i++)
if (myVector[i] < myVector[min])
min = i;

int max =0;

for (int i = 0; i < myVector.size(); i++)
if (myVector[i] > myVector[max])
max = i;
swap(myVector[min],myVector[max]);
cout<<"Vector elementlari = ";
for(int i=0;i {
cout< }

cout<

return 0;
}

3-topshiriq
3.Vektor tоk o`rindagi elementlarini yig’indisi hisoblansin

#include

#include

using namespace std;

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

vector v(n);

for (int i = 1; i <=n; i++)
{
int x;
cin >> x;
v[i] = x;
}

int sum = 0;

for (int i = 1; i <=n; i++)
{ if(i%2==1)
sum += v[i];
}

cout << "Vektor elementlarining yig'indisi: " << sum << endl;

return 0;
}