#include <vector>
#include <iostream>
#include <iterator>
// vectoryt e wid templeiten klas;
using namespace std;

int main()
{              // primerni funkcii - vuvedenie vuv vectorite;

	vector <int> v(10,0); // 10 - nuli;
	ostream_iterator <int> out(cout," ");
	copy(v.begin(), v.end(), out);
	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	vector <int> :: iterator i=v.begin();
	*i=125;
	copy(v.begin(), v.end(), out);
	cout<< endl << " ---- " << endl;
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;
	v.resize(v.capacity()+1);
	i=v.begin();
	*i=126;
	cout << endl;
	copy(v.begin(), v.end(), out);
	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	v.push_back(100);

	copy(v.begin(), v.end(), out);
	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	v.pop_back();

	copy(v.begin(), v.end(), out);
	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	cout << endl << "-----" << endl;
	i = v.begin();
	advance(i,3);
	v[3]=15;
	cout << " position " << distance(v.begin(), i) <<  " = " << *i << endl;

	copy(v.begin(), v.end(), out);
	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	v.insert(i,3,2);
	for( int i=0; i<v.size(); i++) // otpechatwa vectora; tova e for po indeksi;
		cout << v[i] << "  "; // ili v.at(i)

	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	v.push_back(1001);
	v.push_back(1002);
	v.push_back(1003);
	vector<int>::iterator it=v.begin();
	for( it=v.begin(); it!=v.end(); it++) // fpr sus iterator;
		cout << *it << "  ";

	cout<< endl << " ---- " << endl;       //1
	cout << " Size: " << v.size() << endl;
	cout << " Capacity: " << v.capacity() << endl;     //1

	for(auto a:v)           // for sus auto; imame promenliwa a i tq shte vzima wseki element ot vectora -> a:v; auto moje i da pishe int ili kakuvto e tipa;
		cout << a << " ";

	system("pause");
	return 0;
} // kakwo e iterator? dawa dostyp do elementitee; begin - funkciq dawa nachaloto na vektora; end- vrushta SLED posledniq;
// ako iskame  posledniq el  end-1;
// ! [begin(), end() )
// copy funkciq  podawame i v kakuv interwal shte pechatame v sluchaq  na konzolata ( predstawlqwa for) izvikwa << na wseki tip, za nash tip trqbwa da si definirame takuv;
// size() vrushta razmera na elementite;
// capacity() - vectoryt ne e efektiwen ako mnogo puti premestwame, push, resize.. i capacity e vinagi poveche, dava dopulnitelno nad size;
// *i=125 otiwa kudeto e i i mu zadawa stoinost;
// resize() promenq razmera i sled towa  i moje da se e razmestil za towa winagi go inicializirame - i=v.begin();
//push_back(50) - dobawq oshte 1 element - dobawq 50; razshirqwa vectora, ako podawame nash tip vuv vektora te sa kopiq i ako go promenqme ne se promenq originala;
// pop_back()- premahwa posledniq element i pak si inicializirame i-to;
// advance() - premestwa i s 3 pozicii v + posoka;
// v[3] - dostyp do 4tiq element;
// distance(v.begin(), i ) - razstoqnieto mejdu nachaloto i iteratora;
// insert(i, 3, 2) na i-ta poziciq mi VMUKWA (i imestwa sledwashtite elementi)  3 dwoiki; ako e (i, 3) na itata poziciq vmukni 3ka;
//funkciq at() cout << v.at(i) vuv for - otpechatwa elementi ;
// push_back dobawq nowi elementi i samo si suzdawa mesto