6 Muzeylar haqida ma’lumotlar berilgan (class Museum). Eng ko‘p eksponantlarga ega bo‘lgan muzeyni qidirib topuvchi dastur tuzing
Download 1.45 Mb.
|
1 2
Bog'liqdasturlash 2.2
muzeylar[i].print();
topildi = true; } } if (!topildi) { cout << "Bunday muzey topilmadi." << endl; } return 0; } 8. Vectorni eng kichik elementigacha bo‘lgan elementlarini o‘chiruvchi funksiyalar yarating. #include #include using namespace std; void eng_kichik_elementni_ochir(vector if (v.empty()) { cout << "Vector bo'sh." << endl; return; } int min_element = v[0]; int min_index = 0; for (int i = 1; i < v.size(); i++) { if (v[i] < min_element) { min_element = v[i]; min_index = i; } } v.erase(v.begin() + min_index); } void barcha_elementlarni_ochir(vector v.clear(); } int main() { vector cout << "Vector: "; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; eng_kichik_elementni_ochir(v); cout << "Eng kichik element o'chirildi. Yangi vector: "; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; barcha_elementlarni_ochir(v); cout << "Barcha elementlar o'chirildi. Yangi vector: "; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; return 0; }#include #include using namespace std; void eng_kichik_elementni_ochir(vector if (v.empty()) { cout << "Vector bo'sh." << endl; return; } int min_element = v[0]; int min_index = 0; for (int i = 1; i < v.size(); i++) { if (v[i] < min_element) { min_element = v[i]; min_index = i; } } v.erase(v.begin() + min_index); } void barcha_elementlarni_ochir(vector v.clear(); } int main() { vector cout << "Vector: "; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; eng_kichik_elementni_ochir(v); cout << "Eng kichik element o'chirildi. Yangi vector: "; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; barcha_elementlarni_ochir(v); cout << "Barcha elementlar o'chirildi. Yangi vector: "; for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; return 0; } 6. String turidagi To‘plam berilgan. Undagi elementlarni char turidagi A massivga joylashtirib, toq elementlarini B massivga, juftlarni C massivga joylashtiruvchi dastur tuzing. #include #include using namespace std; void massivga_joylashtir(string s, char A[], char B[], char C[]) { for (int i = 0; i < s.length(); i++) { A[i] = s[i]; if (i % 2 == 0) { B[i/2] = s[i]; } else { C[i/2] = s[i]; } } A[s.length()] = '\0'; B[(s.length()+1)/2] = '\0'; C[s.length()/2] = '\0'; } int main() { string s = "Hello, world!"; char A[s.length()+1]; char B[(s.length()+1)/2]; char C[s.length()/2]; massivga_joylashtir(s, A, B, C); cout << "A massiv: " << A << endl; cout << "B massiv: " << B << endl; cout << "C massiv: " << C << endl; return 0; } 5 Z to‘plamning manfiy juft qiytlarini B to‘plamning musbat toq qiymatlaridan keyin joylashtiradigan dastur tuzing. #include #include using namespace std; void massivga_joylashtir(vector vector for (int i = 0; i < Z.size(); i++) { if (Z[i] < 0 && Z[i] % 2 == 0) { B.push_back(Z[i]); } else if (Z[i] > 0 && Z[i] % 2 == 1) { C.push_back(Z[i]); } } B.insert(B.end(), C.begin(), C.end()); } int main() { vector vector massivga_joylashtir(Z, B); cout << "Z to'plam: "; for (int i = 0; i < Z.size(); i++) { cout << Z[i] << " "; } cout << endl; cout << "B to'plam: "; for (int i = 0; i < B.size(); i++) { cout << B[i] << " "; } cout << endl; return 0; } Download 1.45 Mb. Do'stlaringiz bilan baham: |
1 2
Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2024
ma'muriyatiga murojaat qiling
ma'muriyatiga murojaat qiling