365 Days of Code - Day 065

 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

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdbool.h>

/**
 * Don't let the machines win. You are humanity's last hope...
 **/

int main()
{
    // the number of cells on the X axis
    int width;
    scanf("%d", &width);
    // the number of cells on the Y axis
    int height;
    scanf("%d", &height); fgetc(stdin);
    fprintf(stderr, "W: %d, H: %d\n", width, height);
    for (int i = 0; i < height; i++) {
        // width characters, each either 0 or .
        char line[32] = "";
        scanf("%[^\n]", line); fgetc(stdin);
    }

    // Write an action using printf(). DON'T FORGET THE TRAILING \n
    // To debug: fprintf(stderr, "Debug messages...\n");


    // Three coordinates: a node, its right neighbor, its bottom neighbor
    printf("0 0 1 0 0 1\n");

    return 0;
}

1
2
3
4
5

W: 4, H: 4
LINE: 00.0
LINE: 0.00
LINE: .0.0
LINE: 000.

1
2
3

printf("0 0 1 0 0 1\n");
printf("1 0 -1 -1 -1 -1\n");
printf("0 1 -1 -1 -1 -1\n");

1
2
3
4

typedef struct {
    bool isNode;
    bool isVisited;
} node;

1

node grid[width][height];

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11

for (int i = 0; i < width; ++i)
{
    for (int j = 0; j < height; ++j)
    {
        grid[i][j].isNode = false;
        grid[i][j].isVisited = false;
        fprintf(stderr, "[X: %d, Y: %d [%d]", i, j, grid[i][j].isNode);
        fprintf(stderr, "[%d]] ", grid[i][j].isVisited);
    }
    fprintf(stderr, "\n");
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13

for (int i = 0; i < height; i++) {
    // width characters, each either 0 or .
    char line[32] = "";
    scanf("%[^\n]", line); fgetc(stdin);
    fprintf(stderr, "LINE: %s\n", line);
    for (int j = 0; j < width; ++j)
    {
        if (line[j] == '0')
        {
            grid[i][j].isNode = true;
        }
    }
}

 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

char output[6];
for (int i = 0; i < width; ++i)
{
    for (int j = 0; j < height; ++j)
    {
        // fprintf(stderr, "[X: %d, Y: %d [%d]", i, j, grid[i][j].isNode);
        // fprintf(stderr, "[%d]] ", grid[i][j].isVisited);
        if (grid[i][j].isNode == true)
        {
            sprintf(output, "%d %d ", i, j);
            printf("%s", output);

            // Right Neighbor Check
            if (i + 1 < width)
            {
                if (grid[i + 1][j].isNode == true)
                {
                    sprintf(output, "%d %d ", i + 1, j);
                    printf("%s", output);
                }
                else
                {
                    printf("-1 -1 ");
                }
            }
            else
            {
                printf("-1 -1 ");
            }

            // Down Neighbor Check
            if (j + 1 < height)
            {
                if (grid[i][j + 1].isNode == true)
                {
                    sprintf(output, "%d %d", i, j + 1);
                    printf("%s", output);
                }
                else
                {
                    printf("-1 -1");
                }
            }
            else
            {
                printf("-1 -1 ");
            }
            printf("\n");
        }
    }
}

1
2
3
4
5
6
7
8

Standard Output Stream:
0 0 1 0 0 1
Standard Output Stream:
0 1 -1 -1 -1 -1
Standard Output Stream:
1 0 -1 -1 -1 -1
Game information:
All connections valid.