beecrowd-solutions/1435.c at main · Rottschaefer/beecrowd-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <stdio.h>

int get_min(int a, int b){
    if(a<b){
        return a;
    }
    else{
        return b;
    }
}

void print_matrix(int ord){

    int meio = ord/2;

    int k = 1;
    int y = 1;

    for(int i=0; i<ord;i++){

        if(ord%2 != 0){
            if(i <=meio){
                y = i+1;
            }
            else{
                y--;
            }
        }
        else{
            if(i < meio){
            y = i+1;
        }
            else if( i!= meio){
                y--;
            }
        }

        for(int j=0; j<ord;j++){

            if(i != 0 && i!= ord-1){

                if(ord%2 != 0){
                    if(j<= meio){
                        k++;
                     }
                    else{
                        k--;
                    }
                }
                else{
                    if(j < meio){
                        k++;
                     }
                    else if(j != meio){
                        k--;
                    }
                }

            }
            else{
                k=1;
            }


            if(j == ord-1){
                printf("%3i\n", get_min(y, k));
            }
            else{
                printf("%3i ", get_min(y, k));
            }

        }
        k = 0;
    }
}

int main(){

    int ord = 1;
    while(ord != 0){
        scanf("%d", &ord);

        if(ord == 0){
            break;
        }
        print_matrix(ord);
        printf("\n");
    }


    return 0;
}