Exemplo n.º 1
0
Arquivo: 96.c Projeto: Ballaw/MyBin
int64_t Euler_96()
{
    char filepath[100];
    snprintf(filepath, sizeof(filepath), "%s96.txt", EULER_DATA_PATH);
    FILE* data = fopen(filepath, "r");
    if (data == NULL)
        return 0;
    char line[16];
    int total = 0;
    int i;
    int* puzzle = (int*) (malloc)(sizeof(int) * 81);
    for (i = 0; i < 50; i++) {
        fgets(line, sizeof(line), data);
        int n;
        for (n = 0; n < 9; n++) {
            fgets(line, sizeof(line), data);
            int s;
            for (s = 0; s < 9; s++)
                puzzle[SUDOKU_INDEX(n,s)] = (int) (line[s] - '0');
        }

        //PrintSudoku(puzzle);
        puzzle = SudokuSolver(puzzle);
        total += (puzzle[0] * 100) + (puzzle[1] * 10) + puzzle[2];
        //PrintSudoku(puzzle);
    }
    free(puzzle);
    fclose(data);
    return (int64_t) total;
}
Exemplo n.º 2
0
int main()
{
	Tester t;

	Sudoku i;
	i = {
		{5, 3, 0, 0, 7, 0, 0, 0, 0},
		{6, 0, 0, 1, 9, 5, 0, 0, 0},
		{0, 9, 8, 0, 0, 0, 0, 6, 0},
		{8, 0, 0, 0, 6, 0, 0, 0, 3},
		{4, 0, 0, 8, 0, 3, 0, 0, 1},
		{7, 0, 0, 0, 2, 0, 0, 0, 6},
		{0, 6, 0, 0, 0, 0, 2, 8, 0},
		{0, 0, 0, 4, 1, 9, 0, 0, 5},
		{0, 0, 0, 0, 8, 0, 0, 7, 9},
	};
	t.test(i, true, SudokuSolver().solve(i));

	i = {
		{1, 2, 3, 4, 5, 6, 7, 8, 9},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
	};
	t.test(i, true, SudokuSolver().solve(i));

	i ={
		{1, 1, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
	};
	t.test(i, false, SudokuSolver().solve(i));

	i = {
		{0, 9, 5, 0, 0, 3, 6, 0, 0},
		{0, 6, 0, 0, 5, 1, 0, 3, 8},
		{1, 8, 0, 0, 4, 6, 7, 0, 9},
		{5, 0, 4, 0, 2, 0, 0, 0, 6},
		{6, 1, 0, 4, 8, 0, 0, 2, 0},
		{8, 3, 0, 0, 0, 0, 0, 7, 0},
		{9, 5, 0, 7, 3, 4, 0, 6, 0},
		{0, 0, 6, 0, 0, 0, 4, 0, 0},
		{7, 0, 0, 0, 0, 2, 5, 9, 3},
	};
	t.test(i, true, SudokuSolver().solve(i));

	i = {
		{5, 3, 4, 6, 7, 8, 9, 1, 0},
		{6, 7, 2, 1, 9, 5, 3, 4, 0},
		{1, 9, 8, 3, 4, 2, 5, 6, 0},
		{8, 5, 9, 7, 6, 1, 4, 2, 0},
		{4, 2, 6, 8, 5, 3, 7, 9, 0},
		{7, 1, 3, 9, 2, 4, 8, 5, 0},
		{9, 6, 1, 5, 3, 7, 2, 8, 0},
		{2, 8, 7, 4, 1, 9, 6, 3, 0},
		{3, 4, 5, 2, 8, 6, 1, 7, 0},
	};
	t.test(i, true, SudokuSolver().solve(i));

	i = {
		{5, 3, 4, 6, 7, 8, 9, 1, 2},
		{6, 7, 2, 1, 9, 5, 3, 4, 8},
		{1, 9, 8, 3, 4, 2, 5, 6, 7},
		{8, 5, 9, 7, 6, 1, 4, 2, 3},
		{4, 2, 6, 8, 5, 3, 7, 9, 1},
		{7, 1, 3, 9, 2, 4, 8, 5, 6},
		{9, 6, 1, 5, 3, 7, 2, 8, 4},
		{2, 8, 7, 4, 1, 9, 6, 3, 5},
		{0, 0, 0, 0, 0, 0, 0, 0, 0},
	};

	t.test(i, true, SudokuSolver().solve(i));

	t.status();

}