Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- enum { maxn = 10};
- int main() {
- int m[maxn][maxn];
- int n, k, i, j, x, z;
- scanf_s("%d", &n);
- for (int i = 1; i <= n; i++) {
- for (int j = 1; j <= n; j++) {
- scanf_s("%d", &m[i][j]);
- }
- }
- j = 0;
- for (int i = 0; i <= n + 1; i++) {
- m[i][j] = 0;
- }
- i = 0;
- for (int j = 0; j <= n + 1; j++) {
- m[i][j] = 0;
- }
- i = n + 1;
- for (int j = 0; j <= n + 1; j++) {
- m[i][j] = 0;
- }
- j = n + 1;
- for (int i = 0; i <= n + 1; i++) {
- m[i][j] = 0;
- }
- if (n % 2 == 1) {
- i = n / 2 + 1;
- } else {
- i = n / 2 ;
- }
- if (n == 1) {
- i = 1;
- }
- j = i;
- x = 0;
- do {
- x++;
- for (k = 0; k < x; k++) {
- printf("%d ", m[i][j]);
- i = i + 1;
- }
- if (x == n) {
- break;
- }
- for (k = 0; k < x; k++) {
- printf("%d ", m[i][j]);
- j = j + 1;
- }
- x++;
- for (k = 0; k < x; k++) {
- printf("%d ", m[i][j]);
- i = i - 1;
- }
- if (x == n) {
- break;
- }
- for (k = 0; k < x; k++) {
- printf("%d ", m[i][j]);
- j = j - 1;
- }
- } while (x != n);
- scanf_s("%d", &z);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement