#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main ()
{
vector<int> myvector;
int myint;
cout << "Please enter some integers (enter 0 to end):\n";
while (cin >> myint && myint != 0) {
myvector.push_back(myint);
}
cout << "myvector stores " << myvector.size() << " numbers.\n";
for (auto it = myvector.begin(); it != myvector.end(); ++it) {
cout << *it << endl;
}
for (int x : myvector) {
cout << x << endl;
}
if (!myvector.empty()) {
myvector.pop_back();
}
if (!myvector.empty()) {
if (myvector.front() == myvector.back()) {
cout << "First and last elements are equal\n";
}
myvector.back() += myvector.front();
}
if (!myvector.empty()) {
cout << "First element: " << myvector.front() << endl;
cout << "Last element: " << myvector.back() << endl;
}
sort(myvector.begin(), myvector.end());
cout << "Sorted vector:\n";
for (int val : myvector) {
cout << val << " ";
}
cout << endl;
cout << "Size: " << myvector.size() << endl;
int findNumber;
cout << "Look for your number: ";
cin >> findNumber;
bool searchNumber = false;
for(int i = 0; i < myvector.size(); i++){
if(myvector.at(i) == findNumber){
searchNumber = true;
break;
}
}
if (searchNumber) {
cout << "Your number " << findNumber << " was found" << endl;
} else {
cout << "Your number was not found" << endl;
}
myvector.clear();
return 0;
}