Toshkent axborot texnologiyalari universiteti Nurafshon filiali 310-21 guruh talabasi Jozilov Shohruxning Dasturlash fanidan bajargan ishi

Download 13,74 Kb.

Sana	05.06.2022
Hajmi	13,74 Kb.
	#637476

Bog'liq
Dasturlash 2-topshiriq

Toshkent axborot texnologiyalari universiteti Nurafshon filiali 310-21 guruh talabasi Jozilov Shohruxning Dasturlash fanidan bajargan ishi.

#include

#include
using namespace std;
int main(){
int n;
cout << "Hajmni kiriting: ";
cin >> n;
map mp;
string j;
int s1 = 0, s2 = 0;
for (int i = 1; i <= n; i ++){
cout << "a[" << i << "]=";
cin >> j;
mp[i] = j;
}
cout << "\nKatta harfdan boshlanuchilari: \n";
for (auto [i, word] : mp){
if (isupper(word[0])){
cout << word << " ";
s1 += 1;
}
}
cout << " -> " << s1;
cout << "\nKichik harfdan boshlanuchilari: \n";
for (auto [i, word] : mp){
if (!isupper(word[0])){
cout << word << " ";
s2 += 1;
}
}
cout << " -> " << s2;
return 0;
}

#include

#include
#include
using namespace std;
int main(){
int n, l;
cout << "Hajmni kiriting: ";
cin >> n;
queue a, b;
stack c;
for (int i = 0; i < n; i ++){
cout << "a[" << i+1 << "]=";
cin >> l;
a.push(l);
}
int lena = a.size();
for (int i = 0; i < lena; i ++){
if (a.front() % 2 == 0) b.push(a.front());
else c.push(a.front());
a.pop();
}
int lenb = b.size(), lenc = c.size();
for (int i = 0; i < lenb; i ++){
cout << b.front() << " ";
b.pop();
}
cout << endl;
for (int i = 0; i < lenc; i ++){
cout << c.top() << " ";
c.pop();
}
return 0;
}

#include

#include
#include
using namespace std;
int main(){
int n;
cout << "Hajmni kiriting: ";
cin >> n;
map > mp;
string a[6] = {"Nomi", "o`qituvchi_FIO", "5 chilar soni", "4 chilar soni", "3 chilar soni", "o`zlashtira olmaganlar soni"};
for (int i = 1; i <= n; i ++){
vector a1(7);
cout << i << "-fan ma`lumotlarini kiriting: \n";
for (int j = 1; j < 7; j ++){
cout << a[j] << ": "; cin >> a1[j];
}
mp[i] = a1;
}
vector search(7);
cout << "\nQidirmoqchi bo`lgan ma`lumotlaringizni kiriting: \n";
for (int i = 1; i < 7; i ++){
cout << a[i] << ": "; cin >> search[i];
}

vector search_result(7, 0);

for (int i = 1; i < 7; i ++){
bool t = false;
for (auto [index, vec] : mp){
if (search[i] == vec[i]){
search_result[i] = 1;
break;
}
}
}
for (int i = 1; i < 7; i ++){
if (!search_result[i]) cout << search[i] << " topilmadi!\n";
}
return 0;
}

Download 13,74 Kb.

Do'stlaringiz bilan baham: