Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main()
- {
- int n, i, j, k;
- scanf("%d", &n);
- int mas[n*n+1];
- int res[n+1][n+1];
- for (i = 1; i < n*n+1; i++) {
- scanf("%d", &mas[i]);
- }
- res[1][1] = mas[1];
- res[1][2] = mas[2];
- res[2][2] = mas[3];
- res[2][1] = mas[4];
- int l = 3, d = 5;
- for (i = 3; i < n+1; i++) {
- if (i%2 != 0) {
- for (j = 1; j <= l; j++) {
- res[i][j] = mas[d];
- d++;
- }
- for (j = i-1; j >= 1; j--) {
- res[j][l] = mas[d];
- d++;
- }
- l++;
- }
- else {
- for (j = 1; j <= l-1; j++) {
- res[j][l] = mas[d];
- d++;
- }
- for (j = l; j >= 1; j--) {
- res[i][j] = mas[d];
- d++;
- }
- l++;
- }
- }
- for (i = 1; i < n+1; i++) {
- for (j = 1; j < n+1; j++) {
- printf("%4d ", res[i][j]);
- }
- printf("\n");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment