|
Bajardi: 014-guruh talabasi Kamilov Kamoliddin
|
Sana | 26.05.2023 | Hajmi | 330.37 Kb. | | #64855 |
Bog'liq KAMILOV K 1685178841, 104-guruh talabasi Esonova Shahloxonning kompyuterni boshqaruvch-azkurs.org
MUHAMMAD AL-XORAZMIY NOMIDAGI
TOSHKENT AXBOROT TEXNOLOGIYALARI
UNIVERSITETI
Dasturlash kafedrasi
Dasturlash - 2 fani
3 - Laboratoriya ishi
Bajardi: 014-guruh talabasi
Kamilov Kamoliddin
TOSHKENT-2023
#include
#include
#include
using namespace std;
int main() {
string s;
cout << "Enter a string: ";
getline(cin, s);
unordered_set us;
for (int i = 0; i < s.size(); i++) {
string temp = "";
while (s[i] != ' ' && i < s.size()) {
temp += s[i];
i++;
}
if (temp.size() > 1) {
us.insert(temp);
}
}
set s1;
for (int i = 0; i < s.size(); i++) {
string temp = "";
while (s[i] != ' ' && i < s.size()) {
temp += s[i];
i++;
}
if (temp.size() == 1) {
s1.insert(temp);
}
}
set mergedSet;
mergedSet.insert(s1.begin(), s1.end());
for (auto it = us.begin(); it != us.end(); it++) {
mergedSet.insert(*it + *it);
}
cout << "\nElements with size greater than 1:\n";
for (auto it = us.begin(); it != us.end(); it++) {
cout << *it << " ";
}
cout << "\n\nElements with size 1:\n";
for (auto it = s1.begin(); it != s1.end(); it++) {
cout << *it << " ";
}
cout << "\n\nMerged set:\n";
for (auto it = mergedSet.begin(); it != mergedSet.end(); it++) {
cout << *it << " ";
}
return 0;
}
|
| |