练习1

#include<cstdio>#include<iostream>#include<deque>#include<stack>#include<algorithm>using namespace std;void input(deque< deque<int> >&x,deque<int>&y);void output(deque< deque<int> >&x);int main(){       deque< deque<int> >a;    deque<int>b;    input(a,b);    output(a);    return 0;}void input(deque< deque<int> >&x,deque<int>&y){    int i=1,o;    while(i<=9)    {         scanf("%d",&o);       y.push_back(o);       if(!(i%3))       {           x.push_back(y);           while(!y.empty())               y.pop_back();       }       i++;    }}void output(deque< deque<int> >&x){    int i=0;    while(i<=8)    {        printf("%d ",x.at((i%3)).front());        x.at((i%3)).pop_front();        if(!((i+1)%3)&&i)            printf("\n");        i++;    }}

矩阵转制，队列方法，对于容器作为函数参数与二维容器的练习.

输入
1 2 3
4 5 6
7 8 9
输出
1 4 7
2 5 8
3 6 9