Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int n;
- cin >> n;
- int arr[20][20];
- int k = 0;
- n--;
- int last = 1;
- for (; k <= n / 2; k++) {
- for (int i = k; i <= n - k; i++)
- {
- arr[k][i] = last;
- last++;
- }
- for (int i = k + 1; i <= n - k; i++)
- {
- arr[i][n - k] = last;
- last++;
- }
- for (int i = n - k - 1; i >= k; i--)
- {
- arr[n - k][i] = last;
- last++;
- }
- for (int i = n - k - 1; i > k; i--)
- {
- arr[i][k] = last;
- last++;
- }
- }
- if (++n % 2 != 0) arr[n / 2][n / 2] = --last;
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- cout.width(3);
- cout << arr[i][j];
- }
- cout << "\n";
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment