Spirala pravougaona (mxn)

#include <iostream>
using namespace std;

main()
{
      int n, m, a[50][50], s=1;

      cin >> n >> m;

      // Ako je n neparno
      if (n%2!=0)
      for (int i=0; i<=n/2; i++)
      {
           for (int j=i; j<m-i; j++)
           {
               a[i][j] = s;
               s = s + 1;
           }

           for (int j=i+1; j<n-i; j++)
           {
               a[j][m-i-1] = s;
               s = s + 1;
           }

           if  (i<n/2)
           for (int j=m-i-2; j>=i; j--)
           {
               a[n-i-1][j] = s;
               s = s + 1;
           }

           for (int j=n-i-2; j>i; j--)
           {
               a[j][i] = s;
               s = s + 1;
           }
      }

      // Ako je n parno
      if (n%2==0)
      for (int i=0; i<n/2; i++)
      {
           for (int j=i; j<m-i; j++)
           {
               a[i][j] = s;
               s = s + 1;
           }

           for (int j=i+1; j<n-i; j++)
           {
               a[j][m-i-1] = s;
               s = s + 1;
           }

           for (int j=m-i-2; j>=i; j--)
           {
               a[n-i-1][j] = s;
               s = s + 1;
           }

           for (int j=n-i-2; j>i; j--)
           {
               a[j][i] = s;
               s = s + 1;
           }
      }

      // Postavlja posjednji clan, ukoliko je n neparno
      for (int i=0; i<n; i++)
      for (int j=0; j<m; j++)
          if (a[i][j] == 0)
          a[i][j] = s;

      // Stampanje sa malo sredjenim izgledom
      for (int i=0; i<n; i++)
      {
         for (int j=0; j<m; j++)
         if (a[i][j] < 10)
         cout << " " << a[i][j] << " ";
         else
         cout << a[i][j] << " ";
         cout << endl;
      }

      system ("PAUSE");
}