Guest User

Untitled

a guest
Nov 20th, 2018
93
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.86 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int main()
  4. {
  5. int n;
  6. cin >> n;
  7. int arr[20][20];
  8. int k = 0;
  9. n--;
  10. int last = 1;
  11. for (; k <= n / 2; k++) {
  12. for (int i = k; i <= n - k; i++)
  13. {
  14. arr[k][i] = last;
  15. last++;
  16. }
  17. for (int i = k + 1; i <= n - k; i++)
  18. {
  19. arr[i][n - k] = last;
  20. last++;
  21. }
  22. for (int i = n - k - 1; i >= k; i--)
  23. {
  24. arr[n - k][i] = last;
  25. last++;
  26. }
  27. for (int i = n - k - 1; i > k; i--)
  28. {
  29. arr[i][k] = last;
  30. last++;
  31. }
  32. }
  33.  
  34. if (++n % 2 != 0) arr[n / 2][n / 2] = --last;
  35.  
  36. for (int i = 0; i < n; i++) {
  37. for (int j = 0; j < n; j++) {
  38. cout.width(3);
  39. cout << arr[i][j];
  40. }
  41. cout << "\n";
  42. }
  43. return 0;
  44. }
Add Comment
Please, Sign In to add comment