Matrix Transpose

Given a 2D array A, your task is to convert all rows to columns and columns to rows.
Input:
First line contains 2 space separated integers, N - total rows, M - total columns.
Each of the next N lines will contain M space separated integers.
Output:
Print M lines each containing N space separated integers.
Constraints:
$1\le N\le 10$
$1\le M\le 10$
$0\le A\left[i\right]\left[j\right]\le 100$ where $1\le i\le N$ and $1\le j\le M$

$\mathrm{Solution}$

	#include <iostream>
	using namespace std;
	int main()
	{
	int row,col;
	cin>>row>>col;
	int m[row][col];
	int mt[col][row];
	for(int i=0;i<row;i++)
	{
	for(int j=0;j<col;j++)
	{
	cin>>m[i][j];
	mt[j][i]=m[i][j];
	}
	}
	for(int k=0;k<col;k++)
	{
	for(int l=0;l<row;l++)
	{
	cout<<mt[k][l]<<" ";
	}
	cout<<endl;
	}
	return 0;
	}

view raw trans.cpp hosted with ❤ by GitHub