TestDriver/testlab12.c at master · katikn/TestDriver · 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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include "testLab.h"
#include <stdio.h>
#include <string.h>

#define TESTS_COUNT 28
#define TIME_LIMIT 3000
#define MEMORY_LIMIT (1 << 10)

static const struct {const char *const in; int count_symbols; const char *const out;} testInOut[TESTS_COUNT] = {
        {"483921657\n967345821\n251876493\n548132976\n729564138\n136798245\n372689514\n814253769\n69541738a", 20, "Incorrect input data"}, //последний символ - а
        {"261849735\n479635128\n538712496\n15628b349\n784391652\n923564817\n315978264\n697423581\n842156973", 20, "Incorrect input data"}, // четвёртая строка - b
        {"..3.2.6..\n9..3.5..1\n..18.64..\n..81.29..\n7.......8\n..67.82..\n..26.95..\n8..2.3..9\n..5.1.3..\n........6",20, "Incorrect input data"}, // есть 10ая строка
        {"..3.2.6..\n9..3.5..1\n..18.64..\n..81.29..\n7.....8\n..67.82..\n..26.95..\n8..2.3..9\n..5.1.3..", 20, "Incorrect input data"}, // недостаток символов в 5ой строке
        {"48.3.....\n..1....71\n.2.......\n7.5....6.\n...2..8..\n.........\n....76...\n3.....4..\n....5....", 20, "Incorrect input data"}, // повторение числа в строке
        {"48.3.....\n..1....7.\n.2.......\n7.5....6.\n...2..8..\n.........\n..1.76...\n3.....4..\n....5....", 20, "Incorrect input data"}, // повторение числа в столбце
        {"48.3....7\n..1....7.\n.2.......\n7.5....6.\n...2..8..\n.........\n....76...\n3.....4..\n....5....", 20, "Incorrect input data"}, // повторение числа в квадранте
        {".85.2....\n9..3..54.\n........6\n..2.3.61.\n1.......7\n...6....9\n4..5..13.\n..9..4...\n.......7.\n\n\ns", 20, "Incorrect input data"}, // 3 \n
        {".85.2....\n9..3..54.\n........6\n..2.3.61.\n1.......7\n...6....9\n4..5..13.\n..9..4...\n.......7.\t\t\ts", 20, "Incorrect input data"}, // 3\t
        {".85.2....\n9..3..54.\n........6\n..2.3.61.\n1.......7\n...6....9\n4..5..13.\n..9..4...\n.......7.   s", 20, "Incorrect input data"}, // 3 пробела
        {".85.2....\n9..3..54.\n........6\n..2.3.61.\n1.......7\n...6....9\n4..5..13.\t..9..4...\n.......7.", 20, "Incorrect input data"}, // \t вместо \n
        {"..6......\n87..1...6\n...54...9\n6...813.4\n\n...3...5.\n.....7...\n.........\n.9.4....8\n..5.6.1..", 20, "Incorrect input data"}, // лишний \n
        {"..6......\n87..1...6\n...54...9\n6...813.4\n...3...5.\n.....7....\n.........\n.9.4....8\n..5.6.1..", 20, "Incorrect input data"}, //10 символов в строке
        {"", 20, "Incorrect input data"}, //пустой файл
        {"261849735\n479635128\n538712496\n156287349\n784391652\n923564817\n315978264\n697423581\n842156973", 26, "This sudoku already solved"},
        {".........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........", 31, "Sudoku has more than 1 solution"},
        {"1........\n.........\n.........\n.........\n....1....\n.........\n.........\n.........\n........1", 31, "Sudoku has more than 1 solution"},
        {".......8.\n.736.4.2.\n4....2753\n6.27.....\n....46...\n.....96.1\n9312....4\n.5.4.391.\n.8.......", 31, "Sudoku has more than 1 solution"},
        {"483921657\n967345821\n251876493\n548132976\n729564138\n136798245\n372689514\n814253769\n69541738.", 89, "483921657\n967345821\n251876493\n548132976\n729564138\n136798245\n372689514\n814253769\n695417382"},
        {"261849735\n479635128\n538712496\n156287349\n784391652\n923564817\n315978264\n697423581\n842156...", 89, "261849735\n479635128\n538712496\n156287349\n784391652\n923564817\n315978264\n697423581\n842156973"},
        {"483921657\n967345821\n251876493\n.........\n729564138\n136798245\n372689514\n695417382\n814253769", 89, "483921657\n967345821\n251876493\n548132976\n729564138\n136798245\n372689514\n695417382\n814253769"},
        {"8613.7294\n5974.2361\n4326.9785\n9162.5843\n3589.4127\n2741.8956\n7895.1632\n1438.6579\n6257.3418", 89, "861357294\n597482361\n432619785\n916275843\n358964127\n274138956\n789541632\n143826579\n625793418"},
        {"..2..41..\n9.7..84..\n..1...9.6\n.3..5...9\n.1..6...4\n.9..4.8.7\n..3....2.\n4..7...9.\n5..31....", 89, "852694173\n967138452\n341572986\n734851269\n218967534\n695243817\n173489625\n486725391\n529316748"}, //лёгкое судоку с 28 заполненными клетами
        {"..6......\n87..1...6\n...54...9\n6...813.4\n...3...5.\n.....7...\n.........\n.9.4....8\n..5.6.1..", 89, "546879213\n879213546\n213546879\n657981324\n981324657\n324657981\n768192435\n192435768\n435768192"}, //тяжёлое судоку с 22 заполненными ячейками
        {"9....673.\n...94...2\n.24......\n.65....83\n..7.8.5..\n89....41.\n......97.\n7...21...\n.867....5", 89, "958216734\n371945862\n624837159\n465179283\n217483596\n893652417\n542368971\n739521648\n186794325"}, // судоку с 29 заполненными ячейками(тяжёлое)
        {"...5....6\n..948.7..\n..8..2...\n....24..5\n.319.562.\n4..16....\n...6..1..\n..6.472..\n5....1...", 89, "273519486\n159486732\n648732591\n967324815\n831975624\n425168973\n792653148\n316847259\n584291367"}, //сложное с 28 заполненными клетами
        {"........2\n.28.9.4..\n41..2.7..\n.45.18...\n1.......8\n...96.14.\n..1.4..25\n..2.8.69.\n3........", 89, "679834512\n528791436\n413526789\n945318267\n136472958\n287965143\n891647325\n752183694\n364259871"},
        {"8........\n..36.....\n.7..9.2..\n.5...7...\n....457..\n...1...3.\n..1....68\n..85...1.\n.9....4..", 89, "812753649\n943682175\n675491283\n154237896\n369845721\n287169534\n521974368\n438526917\n796318452"} // Arto Inkala Sudoku
};

static size_t currentTest = 0;

static int FeedFromArray(void) {
    FILE* fl_In = fopen("in.txt", "w+");
    if (!fl_In) {
        printf("Can't create the file. No space on disk ?");
        fclose(fl_In);
        return -1;
    }
    if (fprintf(fl_In, "%s\n", testInOut[currentTest].in) < 0) {
        printf("Can't create in.txt. No space on disk?\n");
        fclose(fl_In);
        return -1;
    }
    fclose(fl_In);
    return 0;
}

static int CheckFromArray(void) {
    FILE* const fl_Out = fopen("out.txt", "r");
    if (!fl_Out) {
        printf("Can't open out.txt");
        currentTest++;
        return -1;
    }
    char testOutput[128] = { 0 };
    int passed = 1;
    const int outSymbols = (int)fread(testOutput, sizeof(char), sizeof(testOutput), fl_Out);
    if (!feof(fl_Out)) { // проверка, что файл не закрылся
            printf("Premature end of file");
            fclose(fl_Out);
            currentTest++;
            return -1;
        } else if (ferror(fl_Out)){
            printf("File read error");
            fclose(fl_Out);
            currentTest++;
            return -1;
        }

    if (outSymbols != testInOut[currentTest].count_symbols) {
        if (outSymbols > testInOut[currentTest].count_symbols) {
            printf("Answer is too long");
        } else {
            printf("Answer is too short");
        }
        fclose(fl_Out);
        currentTest++;
        return -1;
    }

    for (int i = 0; i < outSymbols; i++) {
        if (testInOut[currentTest].out[i] != testOutput[i]) {
            passed = 0;
            break;
        }
    }
    if (passed) {
        passed = !HaveGarbageAtTheEnd(fl_Out);
    }
    fclose(fl_Out);
    if (passed) {
        printf("PASSED\n");
    } else {
        printf("FAILED\n");
    }
    currentTest++;
    return !passed;
}

TLabTest GetLabTest(int testInd) {
    (void)testInd;
    TLabTest rv = {FeedFromArray, CheckFromArray};
    return rv;
}

int GetTestCount(void){
    return TESTS_COUNT;
}

const char* GetTesterName(void) {
    return "Lab 12 Sudoku solver";
}

int GetTestTimeout(void) {
    return TIME_LIMIT;
}

size_t GetTestMemoryLimit(void) {
    return MIN_PROCESS_RSS_BYTES + MEMORY_LIMIT;
}