#include<iostream>
#include<list>
#include<deque>
using namespace std;
int main()
{
list<int> ilist;
deque<int> ideque1,ideque2;
int ival[] ={
0,1,2,3,4,5,6,7,8,9,10
};
ilist.insert(ilist.begin(),ival,ival + 10);
list<int>::iterator first = ilist.begin();
list<int>::iterator last = ilist.end();
while(first != last)
{
if((*first) % 2)
ideque1.insert(ideque1.begin(),*first);
else
ideque2.insert(ideque2.begin(),*first);
++first;
}
cout << "This is a deque1...." << endl;
for(deque<int>::iterator iter = ideque1.begin(); iter != ideque1.end(); ++iter)
cout << *iter << endl;
cout << "This is a deque2...." << endl;
for(deque<int>::iterator iter = ideque2.begin(); iter != ideque2.end(); ++iter)
cout << *iter << endl;
return 0;
}