My solution of complexity O(n^2)


#1
vector<vector<int>> b(A.size());

for(int j=0;j<A.size();j++)
{
    for(int i=A.size()-1;i>=0;i--)
    b[j].push_back(A[i][j]);
}
A=b;