Developing.ru

Код: Выделить всё

#include "stdafx.h"
int main()
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
int k = a[i][j];
a[i][j] = a[i + n / 2, j + n / 2];
a[i + n / 2, j + n / 2] = k;
}
}
return 0;
}

Код: Выделить всё

#include <cassert>
#include <iostream>
#include <algorithm>

template <typename T, int LoBound, int HiBound> class Array {
  T arr_[HiBound - LoBound + 1];
public:
  Array()
  {
    std::fill(arr_, arr_ + sizeof(arr_) / sizeof(arr_[0]), T{});
  }
  Array(const Array& other)
    :arr_(other.arr_)
  {}
  Array(std::initializer_list<T> initList)
  {
    std::copy(initList.begin(), initList.end(), arr_);
  }
  T& operator[](int ix)
  {
    assert(ix >= LoBound && ix <= HiBound);
    return arr_[ix - LoBound];
  }
  const T& operator[](int ix) const
  {
    assert(ix >= LoBound && ix <= HiBound);
    return arr_[ix - LoBound];
  }
};

int main()
{
  enum {LoBound = -2, HiBound = 2};
  using A1D = Array<int, LoBound, HiBound>;
  Array<A1D, LoBound, HiBound> arr = 
   { A1D{ 1,  2,  3,  4,  5},
     A1D{ 6,  7,  8,  9, 10},
    A1D{11, 12, 13, 14, 15},
    A1D{16, 17, 18, 19, 20},
    A1D{21, 22, 23, 24, 25} };
  for (int i = LoBound; i <= HiBound; ++i) {
    for (int j = LoBound; j <= HiBound; ++j) {
      std::cout << arr[-i][-j] << " ";
    }
    std::cout << "\n";
  }
  return 0;
}

Код: Выделить всё

#include <iostream>
#include <algorithm>

using namespace std;

#define	DIM	4	// Matrix dimension

template <typename T>
void DisplayMatrix(const T& matrix)
{
	for (unsigned v = 0; v < DIM; v++)
	{
		for (unsigned h = 0; h < DIM; h++)
		{
			cout << matrix[v][h] << '\t';
		}
		cout << endl;
	}
}

template <typename T>
void SwapQuarters(T& matrix)
{
	for (unsigned v = 0; v < DIM/2; v++)
	{
		for (unsigned h = 0; h < DIM/2; h++)
		{
			swap(matrix[v][h], matrix[v + DIM/2][h + DIM/2]);
		}
	}
}

int _tmain(int argc, _TCHAR* argv[])
{
	int MX[DIM][DIM] = 
	{
		{1,		1,		2,		2},
		{1,		1,		2,		2},
		{3,		3,		4,		4},
		{3,		3,		4,		4}
	};
	
	SwapQuarters(MX);

	DisplayMatrix(MX);

	_gettch();

	return 0;
}