|
////////////////////////////////////////////////////////////////////////////////////////////////////////////////Bog'liq Namozov Maxmud 2 ish Mundarija, Bank tizimi. Pul-kredit siyosati, Yuklar va ta\'sirlar. Normal va hisobiy yuklar, yuklar birikmasi (birgalikdagi ta\'siri). Po\'latning me\'yoriy va hisobiy qarshiligi Materialning ishonchlilik koeffitsienti, Binoni vazifasi bo\'yicha ishonchlilik koeffitsienti., Manufacturing and service, ISH O’RNINI TASHKIL ETISH, sirtqi Mustaqil ish mavzularining taqsimlanishi (2), 1. mavzu. Umumta’lim va kasb-hunar maktablarining chizmachilik f, XALQARO TIJORAT BANKLARI AUDITI, kurs ishi fulleren, Turli davlatlar-WPS Office, Oraliq nazorat topshiriqlariga javoblari, Javob Yaxshilab chaynash kerak-fayllar.org, bobur, kdsl;fdskfls;dfsed, 1-Topshiriq////////////////////////////////////////////////////////////////////////////////////////////////////////////////
TOPSHIRIQ
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
7.Boshiga qo‘yish usulidan foydalanib ro‘yhatda qo‘shni elementlari ayrimasi 72
dan kichik bo‘lgan elementni toping. Agar bunday elementlar ko‘p bo‘lsa, u holda
ularning eng kattasini toping; agar bunday element mavjud bo‘lmasa – shunga mos
ma’lumot chiqaring.
Dastur kodi
#include
#include
int main() {
std::vector royxat = {31, 40, 70, 45, 30, 50, 60}; // Sizning ro'yxatingiz
int yangi_element;
std::cout << "Yangi elementni kiriting: ";
std::cin >> yangi_element;
royxat.push_back(yangi_element);
int max_element = -1;
bool bor = false;
for (int i = 0; i < royxat.size(); ++i) {
if (royxat[i] < 72) {
if (!bor || royxat[i] > max_element) {
max_element = royxat[i];
bor = true;
}
}
}
if (bor) {
std::cout << "Ro'yxatda 72 dan kichik bo'lgan eng katta element: " <<
max_element << std::endl;
} else {
std::cout << "Ro'yxatda 72 dan kichik bo'lgan element yo'q" << std::endl;
}
return 0;
}
ADABIYOTLAR VA MANBALAR RO’YXATI
1. Adam Drozdek. Data structures and algorithms in C++. Fourth edition.
2013.
2. Н.А.Литвиненко. Технология программирования. “БХВ Петербург”
Санкт-Петербург. 2012 г.
3. Роберт Седжвик. Фундаментальные алгоритмы на C++. Анализ,
Структуры данных, Сортировка, Поиск//К.: Изд. «ДиаСофт», 2007
4. Ma’ruza matnlari. Carnegie Mellon University – CORTINA. 2010. 15-121
Introduction
to
Data
Structures,
(
http://www.cs.cmu.edu/~tcortina/15-
121sp10/lectures.html
)
5. https\\Metanit.com.
|
| |
