-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path129.go
71 lines (63 loc) · 1.09 KB
/
129.go
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
// UVa 129 - Krypton Factor
package main
import (
"fmt"
"io"
"os"
)
var (
n, l, count int
out io.WriteCloser
)
func isEasy(level int, sequence []string) bool {
here:
for i := 1; 2*i <= level+1; i++ {
for j := 0; j < i; j++ {
if sequence[level-j] != sequence[level-j-i] {
continue here
}
}
return true
}
return false
}
func output(sequence []string) {
for i := range sequence {
switch {
case i > 0 && i%64 == 0:
fmt.Fprintln(out)
case i > 0 && i%4 == 0:
fmt.Fprint(out, " ")
}
fmt.Fprint(out, sequence[i])
}
fmt.Fprintf(out, "\n%d\n", len(sequence))
}
func dfs(level int, sequence []string) bool {
if count == n {
output(sequence)
return true
}
count++
for i := 0; i < l; i++ {
if !isEasy(level, append(sequence, string('A'+i))) {
if dfs(level+1, append(sequence, string('A'+i))) {
return true
}
}
}
return false
}
func main() {
in, _ := os.Open("129.in")
defer in.Close()
out, _ = os.Create("129.out")
defer out.Close()
for {
if fmt.Fscanf(in, "%d%d", &n, &l); n == 0 && l == 0 {
break
}
count = 0
dfs(0, nil)
}
}