dim3_0.cpp

来自「数据结构常用算法合集」· C++ 代码 · 共 55 行

 //dim3_0.cpp
 #include <iostream.h>			//cout
 #include <conio.h>			//getch()
 const int R=3;
 const int C=4;
 const int D=3;
 void main()
 { int a[R][C][D],i,j,k;
   for (i=0;i<R;i++)
   for (j=0;j<C;j++)
   for (k=0;k<D;k++)
   a[i][j][k]=i+j+k;
   for (i=0;i<R;i++)		//以"行"为主
   { cout << "第" << i << "行:\n";
     cout << "  i  j  k        i  j  k        i  j  k\n";  
     for (j=0;j<C;j++)		//"列"为次
     { for (k=0;k<D;k++)	//"深"改变最快
       { cout << "a["<<i<<"]["<<j<<"]["<<k<<"]=";
         cout.width(3);
         cout << a[i][j][k]<<' ';
       }
       cout << endl;
     }
   }
   cout << "按任意键继续....";getch();
   for (k=0;k<D;k++)
   { cout << "\n第" << k << "深:\n";
     cout << "  i  j  k        i  j  k        i  j  k\n";
     for (j=0;j<C;j++)
     { for (i=0;i<R;i++)
       { cout << "a["<<i<<"]["<<j<<"]["<<k<<"]=";
         cout.width(3);
         cout << a[i][j][k]<<' ';
       }
       cout << endl;
     }
   }
   cout << "按任意键继续....";getch();
   for (j=0;j<C;j++)
   { cout << "\n第" << j << "列:\n";
     cout << "  i  j  k        i  j  k        i  j  k\n";
     for (i=0;i<R;i++)
     { for (k=0;k<D;k++)
       { cout << "a["<<i<<"]["<<j<<"]["<<k<<"]=";
         cout.width(3);
         cout << a[i][j][k]<<' ';
       }
       cout << endl;
     }
   }
   cout << "按任意键继续....\n";
   getch();
 }