#include <vector>
#include <iostream>
#include <conio.h>
#include <map>
#include <algorithm>
using namespace std;
typedef vector<int> vectortest;
typedef struct _INTTEST
{
int a;
int b;
}inttest;
int main()
{
vectortest vectorT[3];
vectortest::iterator itervector;
map<int ,vector<int> > map1;
map<int,vector<int> >::iterator itermap;
pair< map<int,vector<int> >::iterator ,bool > pairmap;
int i=0;
for(;i<10;i++)
{
vectorT[0].push_back(i);
}
for(i=90;i<100;i++)
{
vectorT[1].push_back(i);
}
for(i=190;i<200;i++)
{
vectorT[2].push_back(i);
}
for(i=0;i<3;i++)
{
map1.insert(make_pair(i,vectorT[i]));
}
while(i!=55)
{
scanf("%d",&i);
itermap=map1.find(i);
if(itermap!=map1.end())
{
for(itervector=itermap->second.begin();itervector!=itermap->second.end();itervector++)
{
cout<<*itervector<<endl;
}
}
}
getch();
return 0;
}
---------------------------------------------------------------------------------------------------------------------------------------
#include <deque>
#include<iostream>
#include <string>
#include <algorithm>
#include<conio.h>
using namespace std;
int main()
{
deque<string> str;
str.assign(3,string("hello"));
copy (str.begin(),str.end(),ostream_iterator<string>(cout,"/n"));
getch();
return 0;
}