-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
87 lines (77 loc) · 1.94 KB
/
main.c
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
//
// main.c
// BaekJun Algorithm 119(스도쿠, 2580)
// https://www.acmicpc.net/problem/2580
// Created by hyungwook on 2021/06/21.
//
int flag_a[10][10];
int flag_b[10][10];
int flag_c[10][10][10];
int digit[10][10];
int count = 0;
#include <stdio.h>
void set(int a)
{
int pc = ((a - 1) / 9) + 1;
int pr = ((a - 1) % 9) + 1;
if(digit[pc][pr] == 0)
{
for(int i = 1; i <= 9; i++)
{
if(flag_a[pc][i] == 0 && flag_b[pr][i] == 0 && flag_c[2 + 3 * ((pc - 1) / 3)][2 + 3 * ((pr - 1) / 3)][i] == 0)
{
digit[pc][pr] = i;
flag_a[pc][i] = 1;
flag_b[pr][i] = 1;
flag_c[2 + 3 * ((pc - 1) / 3)][2 + 3 * ((pr - 1) / 3)][i] = 1;
if(a < 81)
{
set(a + 1);
if(count == 81)
return;
digit[pc][pr] = 0;
flag_a[pc][i] = 0;
flag_b[pr][i] = 0;
flag_c[2 + 3 * ((pc - 1) / 3)][2 + 3 * ((pr - 1) / 3)][i] = 0;
}
else
{
count = a;
return;
}
}
}
if(digit[pc][pr] == 0)
return;
}
if(a < 81)
set(a + 1);
else
{
count = a;
return;
}
}
int main(int argc, const char * argv[]) {
// insert code here...
for(int i = 1; i <= 9; i++)
{
for(int j = 1; j <= 9; j++)
{
scanf("%d", &digit[i][j]);
flag_a[i][digit[i][j]] = 1;
flag_b[j][digit[i][j]] = 1;
flag_c[2 + 3 * ((i - 1) / 3)][2 + 3 * ((j - 1) / 3)][digit[i][j]] = 1;
}
}
set(1);
for(int i = 1; i <= 9; i++)
{
for(int j = 1; j <=9 ; j++)
{
printf("%d ", digit[i][j]);
}
printf("\n");
}
return 0;
}